/linux/net/batman-adv/ |
H A D | routing.c | 531 struct batadv_orig_ifinfo *cand, *first_candidate = NULL; in batadv_find_router() local 563 hlist_for_each_entry_rcu(cand, &orig_node->ifinfo_list, list) { in batadv_find_router() 565 if (!kref_get_unless_zero(&cand->refcount)) in batadv_find_router() 568 cand_router = rcu_dereference(cand->router); in batadv_find_router() 581 cand->if_outgoing, router, in batadv_find_router() 592 kref_get(&cand->refcount); in batadv_find_router() 593 first_candidate = cand; in batadv_find_router() 602 next_candidate = cand; in batadv_find_router() 607 if (last_candidate == cand) in batadv_find_router() 615 batadv_orig_ifinfo_put(cand); in batadv_find_router()
|
H A D | distributed-arp-table.c | 683 struct batadv_dat_candidate *cand; in batadv_dat_forward_data() local 685 cand = batadv_dat_select_candidates(bat_priv, ip, vid); in batadv_dat_forward_data() 686 if (!cand) in batadv_dat_forward_data() 692 if (cand[i].type == BATADV_DAT_CANDIDATE_NOT_FOUND) in batadv_dat_forward_data() 695 neigh_node = batadv_orig_router_get(cand[i].orig_node, in batadv_dat_forward_data() 702 cand[i].orig_node, in batadv_dat_forward_data() 728 batadv_orig_node_put(cand[i].orig_node); in batadv_dat_forward_data() 731 kfree(cand); in batadv_dat_forward_data()
|
/linux/tools/perf/util/ |
H A D | build-id.c | 471 struct str_node *nd, *cand = NULL; in build_id_cache__complement() local 486 if (cand) { /* Error: There are more than 2 candidates. */ in build_id_cache__complement() 487 cand = NULL; in build_id_cache__complement() 490 cand = nd; in build_id_cache__complement() 492 if (cand) in build_id_cache__complement() 493 sbuild_id = strdup(cand->s); in build_id_cache__complement()
|
/linux/net/ipv4/ |
H A D | ip_tunnel.c | 85 struct ip_tunnel *t, *cand = NULL; in ip_tunnel_lookup() local 104 cand = t; in ip_tunnel_lookup() 118 if (!cand) in ip_tunnel_lookup() 119 cand = t; in ip_tunnel_lookup() 138 if (!cand) in ip_tunnel_lookup() 139 cand = t; in ip_tunnel_lookup() 152 if (!cand) in ip_tunnel_lookup() 153 cand = t; in ip_tunnel_lookup() 156 if (cand) in ip_tunnel_lookup() 157 return cand; in ip_tunnel_lookup()
|
/linux/mm/ |
H A D | memblock.c | 221 phys_addr_t this_start, this_end, cand; in __memblock_find_range_bottom_up() local 228 cand = round_up(this_start, align); in __memblock_find_range_bottom_up() 229 if (cand < this_end && this_end - cand >= size) in __memblock_find_range_bottom_up() 230 return cand; in __memblock_find_range_bottom_up() 256 phys_addr_t this_start, this_end, cand; in __memblock_find_range_top_down() local 267 cand = round_down(this_end - size, align); in __memblock_find_range_top_down() 268 if (cand >= this_start) in __memblock_find_range_top_down() 269 return cand; in __memblock_find_range_top_down()
|
/linux/tools/lib/bpf/ |
H A D | btf.c | 4162 struct btf_type *cand; in btf_dedup_prim_type() local 4189 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_prim_type() 4190 if (btf_equal_int_tag(t, cand)) { in btf_dedup_prim_type() 4202 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_prim_type() 4203 if (btf_equal_enum(t, cand)) { in btf_dedup_prim_type() 4207 if (btf_compat_enum(t, cand)) { in btf_dedup_prim_type() 4224 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_prim_type() 4225 if (btf_equal_common(t, cand)) { in btf_dedup_prim_type() 4803 struct btf_type *t, *cand; in btf_dedup_ref_type() local 4832 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_ref_type() [all …]
|
H A D | libbpf.c | 5577 struct bpf_core_cand *new_cands, *cand; in bpf_core_add_cands() local 5612 cand = &new_cands[cands->len]; in bpf_core_add_cands() 5613 cand->btf = targ_btf; in bpf_core_add_cands() 5614 cand->id = i; in bpf_core_add_cands()
|
/linux/net/xfrm/ |
H A D | xfrm_policy.c | 206 xfrm_policy_find_inexact_candidates(struct xfrm_pol_inexact_candidates *cand, 1660 struct xfrm_pol_inexact_candidates cand; in xfrm_policy_bysel_ctx() local 1670 if (!xfrm_policy_find_inexact_candidates(&cand, bin, in xfrm_policy_bysel_ctx() 1678 for (i = 0; i < ARRAY_SIZE(cand.res); i++) { in xfrm_policy_bysel_ctx() 1681 tmp = __xfrm_policy_bysel_ctx(cand.res[i], mark, in xfrm_policy_bysel_ctx() 2025 xfrm_policy_find_inexact_candidates(struct xfrm_pol_inexact_candidates *cand, in xfrm_policy_find_inexact_candidates() argument 2037 memset(cand, 0, sizeof(*cand)); in xfrm_policy_find_inexact_candidates() 2038 cand->res[XFRM_POL_CAND_ANY] = &b->hhead; in xfrm_policy_find_inexact_candidates() 2043 cand->res[XFRM_POL_CAND_DADDR] = &n->hhead; in xfrm_policy_find_inexact_candidates() 2047 cand->res[XFRM_POL_CAND_BOTH] = &n->hhead; in xfrm_policy_find_inexact_candidates() [all …]
|
/linux/net/ipv6/ |
H A D | ip6_tunnel.c | 119 struct ip6_tnl *t, *cand = NULL; in ip6_tnl_lookup() local 132 cand = t; in ip6_tnl_lookup() 145 else if (!cand) in ip6_tnl_lookup() 146 cand = t; in ip6_tnl_lookup() 158 else if (!cand) in ip6_tnl_lookup() 159 cand = t; in ip6_tnl_lookup() 162 if (cand) in ip6_tnl_lookup() 163 return cand; in ip6_tnl_lookup()
|
H A D | ip6_gre.c | 123 struct ip6_tnl *t, *cand = NULL; in ip6gre_tunnel_lookup() local 152 cand = t; in ip6gre_tunnel_lookup() 176 cand = t; in ip6gre_tunnel_lookup() 202 cand = t; in ip6gre_tunnel_lookup() 225 cand = t; in ip6gre_tunnel_lookup() 230 if (cand) in ip6gre_tunnel_lookup() 231 return cand; in ip6gre_tunnel_lookup()
|