| /linux/net/batman-adv/ |
| H A D | routing.c | 530 struct batadv_orig_ifinfo *cand, *first_candidate = NULL; in batadv_find_router() local
562 hlist_for_each_entry_rcu(cand, &orig_node->ifinfo_list, list) { in batadv_find_router()
564 if (!kref_get_unless_zero(&cand->refcount)) in batadv_find_router()
567 cand_router = rcu_dereference(cand->router); in batadv_find_router()
580 cand->if_outgoing, router, in batadv_find_router()
591 kref_get(&cand->refcount); in batadv_find_router()
592 first_candidate = cand; in batadv_find_router()
601 next_candidate = cand; in batadv_find_router()
606 if (last_candidate == cand) in batadv_find_router()
614 batadv_orig_ifinfo_put(cand); in batadv_find_router()
|
| H A D | distributed-arp-table.c | 682 struct batadv_dat_candidate *cand; in batadv_dat_forward_data() local
684 cand = batadv_dat_select_candidates(bat_priv, ip, vid); in batadv_dat_forward_data()
685 if (!cand) in batadv_dat_forward_data()
691 if (cand[i].type == BATADV_DAT_CANDIDATE_NOT_FOUND) in batadv_dat_forward_data()
694 neigh_node = batadv_orig_router_get(cand[i].orig_node, in batadv_dat_forward_data()
701 cand[i].orig_node, in batadv_dat_forward_data()
727 batadv_orig_node_put(cand[i].orig_node); in batadv_dat_forward_data()
730 kfree(cand); in batadv_dat_forward_data()
|
| /linux/tools/perf/util/ |
| H A D | build-id.c | 486 struct str_node *nd, *cand = NULL; in build_id_cache__complement() local
501 if (cand) { /* Error: There are more than 2 candidates. */ in build_id_cache__complement()
502 cand = NULL; in build_id_cache__complement()
505 cand = nd; in build_id_cache__complement()
507 if (cand) in build_id_cache__complement()
508 sbuild_id = strdup(cand->s); in build_id_cache__complement()
|
| /linux/net/ipv4/ |
| H A D | ip_tunnel.c | 86 struct ip_tunnel *t, *cand = NULL; in ip_tunnel_lookup() local
105 cand = t; in ip_tunnel_lookup()
119 if (!cand) in ip_tunnel_lookup()
120 cand = t; in ip_tunnel_lookup()
139 if (!cand) in ip_tunnel_lookup()
140 cand = t; in ip_tunnel_lookup()
153 if (!cand) in ip_tunnel_lookup()
154 cand = t; in ip_tunnel_lookup()
157 if (cand) in ip_tunnel_lookup()
158 return cand; in ip_tunnel_lookup()
|
| /linux/mm/ |
| H A D | memblock.c | 238 phys_addr_t this_start, this_end, cand; in __memblock_find_range_bottom_up() local
245 cand = round_up(this_start, align); in __memblock_find_range_bottom_up()
246 if (cand < this_end && this_end - cand >= size) in __memblock_find_range_bottom_up()
247 return cand; in __memblock_find_range_bottom_up()
273 phys_addr_t this_start, this_end, cand; in __memblock_find_range_top_down() local
284 cand = round_down(this_end - size, align); in __memblock_find_range_top_down()
285 if (cand >= this_start) in __memblock_find_range_top_down()
286 return cand; in __memblock_find_range_top_down()
|
| /linux/net/ipv6/ |
| H A D | ip6_gre.c | 148 struct ip6_tnl *t, *cand = NULL; in ip6gre_tunnel_lookup() local
164 if (ip6gre_tunnel_match(t, dev_type, link, &cand_score, &cand)) in ip6gre_tunnel_lookup()
165 return cand; in ip6gre_tunnel_lookup()
174 if (ip6gre_tunnel_match(t, dev_type, link, &cand_score, &cand)) in ip6gre_tunnel_lookup()
175 return cand; in ip6gre_tunnel_lookup()
186 if (ip6gre_tunnel_match(t, dev_type, link, &cand_score, &cand)) in ip6gre_tunnel_lookup()
187 return cand; in ip6gre_tunnel_lookup()
195 if (ip6gre_tunnel_match(t, dev_type, link, &cand_score, &cand)) in ip6gre_tunnel_lookup()
196 return cand; in ip6gre_tunnel_lookup()
199 if (cand) in ip6gre_tunnel_lookup()
[all …]
|
| H A D | ip6_tunnel.c | 120 struct ip6_tnl *t, *cand = NULL; in ip6_tnl_lookup() local
133 cand = t; in ip6_tnl_lookup()
146 else if (!cand) in ip6_tnl_lookup()
147 cand = t; in ip6_tnl_lookup()
159 else if (!cand) in ip6_tnl_lookup()
160 cand = t; in ip6_tnl_lookup()
163 if (cand) in ip6_tnl_lookup()
164 return cand; in ip6_tnl_lookup()
|
| /linux/net/xfrm/ |
| H A D | xfrm_policy.c | 206 xfrm_policy_find_inexact_candidates(struct xfrm_pol_inexact_candidates *cand,
1663 struct xfrm_pol_inexact_candidates cand; in xfrm_policy_bysel_ctx() local
1673 if (!xfrm_policy_find_inexact_candidates(&cand, bin, in xfrm_policy_bysel_ctx()
1681 for (i = 0; i < ARRAY_SIZE(cand.res); i++) { in xfrm_policy_bysel_ctx()
1684 tmp = __xfrm_policy_bysel_ctx(cand.res[i], mark, in xfrm_policy_bysel_ctx()
2028 xfrm_policy_find_inexact_candidates(struct xfrm_pol_inexact_candidates *cand, in xfrm_policy_find_inexact_candidates() argument
2040 memset(cand, 0, sizeof(*cand)); in xfrm_policy_find_inexact_candidates()
2041 cand->res[XFRM_POL_CAND_ANY] = &b->hhead; in xfrm_policy_find_inexact_candidates()
2046 cand->res[XFRM_POL_CAND_DADDR] = &n->hhead; in xfrm_policy_find_inexact_candidates()
2050 cand->res[XFRM_POL_CAND_BOTH] = &n->hhead; in xfrm_policy_find_inexact_candidates()
[all …]
|
| /linux/tools/lib/bpf/ |
| H A D | btf.c | 4269 struct btf_type *cand; in btf_dedup_prim_type() local
4296 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_prim_type()
4297 if (btf_equal_int_tag(t, cand)) { in btf_dedup_prim_type()
4309 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_prim_type()
4310 if (btf_equal_enum(t, cand)) { in btf_dedup_prim_type()
4314 if (btf_compat_enum(t, cand)) { in btf_dedup_prim_type()
4331 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_prim_type()
4332 if (btf_equal_common(t, cand)) { in btf_dedup_prim_type()
4967 struct btf_type *t, *cand; in btf_dedup_ref_type() local
4996 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_ref_type()
[all …]
|
| H A D | libbpf.c | 5654 struct bpf_core_cand *new_cands, *cand; in bpf_core_add_cands() local
5689 cand = &new_cands[cands->len]; in bpf_core_add_cands()
5690 cand->btf = targ_btf; in bpf_core_add_cands()
5691 cand->id = i; in bpf_core_add_cands()
|