cand 56 arch/s390/numa/toptree.c static void toptree_remove(struct toptree *cand) cand 60 arch/s390/numa/toptree.c list_del_init(&cand->sibling); cand 61 arch/s390/numa/toptree.c oldparent = cand->parent; cand 62 arch/s390/numa/toptree.c cand->parent = NULL; cand 74 arch/s390/numa/toptree.c void __ref toptree_free(struct toptree *cand) cand 78 arch/s390/numa/toptree.c if (cand->parent) cand 79 arch/s390/numa/toptree.c toptree_remove(cand); cand 80 arch/s390/numa/toptree.c toptree_for_each_child_safe(child, tmp, cand) cand 83 arch/s390/numa/toptree.c kfree(cand); cand 85 arch/s390/numa/toptree.c memblock_free_early((unsigned long)cand, sizeof(*cand)); cand 100 arch/s390/numa/toptree.c void toptree_update_mask(struct toptree *cand) cand 104 arch/s390/numa/toptree.c cpumask_clear(&cand->mask); cand 105 arch/s390/numa/toptree.c list_for_each_entry(child, &cand->children, sibling) cand 106 arch/s390/numa/toptree.c cpumask_or(&cand->mask, &cand->mask, &child->mask); cand 107 arch/s390/numa/toptree.c if (cand->parent) cand 108 arch/s390/numa/toptree.c toptree_update_mask(cand->parent); cand 122 arch/s390/numa/toptree.c static int toptree_insert(struct toptree *cand, struct toptree *target) cand 124 arch/s390/numa/toptree.c if (!cand || !target) cand 126 arch/s390/numa/toptree.c if (target->level != (cand->level + 1)) cand 128 arch/s390/numa/toptree.c list_add_tail(&cand->sibling, &target->children); cand 129 arch/s390/numa/toptree.c cand->parent = target; cand 141 arch/s390/numa/toptree.c static void toptree_move_children(struct toptree *cand, struct toptree *target) cand 145 arch/s390/numa/toptree.c toptree_for_each_child_safe(child, tmp, cand) cand 157 arch/s390/numa/toptree.c void toptree_unify(struct toptree *cand) cand 162 arch/s390/numa/toptree.c if (cand->level < 2) cand 165 arch/s390/numa/toptree.c cand_copy = toptree_alloc(cand->level, 0); cand 166 arch/s390/numa/toptree.c toptree_for_each_child_safe(child, tmp, cand) { cand 175 arch/s390/numa/toptree.c toptree_move_children(cand_copy, cand); cand 178 arch/s390/numa/toptree.c toptree_for_each_child(child, cand) cand 198 arch/s390/numa/toptree.c void toptree_move(struct toptree *cand, struct toptree *target) cand 202 arch/s390/numa/toptree.c if (cand->level + 1 == target->level) { cand 203 arch/s390/numa/toptree.c toptree_remove(cand); cand 204 arch/s390/numa/toptree.c toptree_insert(cand, target); cand 209 arch/s390/numa/toptree.c ptr = cand; cand 222 arch/s390/numa/toptree.c toptree_remove(cand); cand 223 arch/s390/numa/toptree.c toptree_insert(cand, real_insert_point); cand 236 arch/s390/numa/toptree.c struct toptree *toptree_get_child(struct toptree *cand, int id) cand 240 arch/s390/numa/toptree.c toptree_for_each_child(child, cand) cand 243 arch/s390/numa/toptree.c child = toptree_alloc(cand->level-1, id); cand 244 arch/s390/numa/toptree.c toptree_insert(child, cand); cand 25 arch/s390/numa/toptree.h void toptree_free(struct toptree *cand); cand 26 arch/s390/numa/toptree.h void toptree_update_mask(struct toptree *cand); cand 27 arch/s390/numa/toptree.h void toptree_unify(struct toptree *cand); cand 28 arch/s390/numa/toptree.h struct toptree *toptree_get_child(struct toptree *cand, int id); cand 29 arch/s390/numa/toptree.h void toptree_move(struct toptree *cand, struct toptree *target); cand 3000 drivers/net/wireless/rndis_wlan.c struct ndis_80211_pmkid_candidate *cand = cand 3002 drivers/net/wireless/rndis_wlan.c bool preauth = !!(cand->flags & NDIS_80211_PMKID_CAND_PREAUTH); cand 3005 drivers/net/wireless/rndis_wlan.c i, le32_to_cpu(cand->flags), preauth, cand->bssid); cand 3007 drivers/net/wireless/rndis_wlan.c cfg80211_pmksa_candidate_notify(usbdev->net, i, cand->bssid, cand 194 mm/memblock.c phys_addr_t this_start, this_end, cand; cand 201 mm/memblock.c cand = round_up(this_start, align); cand 202 mm/memblock.c if (cand < this_end && this_end - cand >= size) cand 203 mm/memblock.c return cand; cand 229 mm/memblock.c phys_addr_t this_start, this_end, cand; cand 240 mm/memblock.c cand = round_down(this_end - size, align); cand 241 mm/memblock.c if (cand >= this_start) cand 242 mm/memblock.c return cand; cand 682 net/batman-adv/distributed-arp-table.c struct batadv_dat_candidate *cand; cand 684 net/batman-adv/distributed-arp-table.c cand = batadv_dat_select_candidates(bat_priv, ip, vid); cand 685 net/batman-adv/distributed-arp-table.c if (!cand) cand 691 net/batman-adv/distributed-arp-table.c if (cand[i].type == BATADV_DAT_CANDIDATE_NOT_FOUND) cand 694 net/batman-adv/distributed-arp-table.c neigh_node = batadv_orig_router_get(cand[i].orig_node, cand 701 net/batman-adv/distributed-arp-table.c cand[i].orig_node, cand 727 net/batman-adv/distributed-arp-table.c batadv_orig_node_put(cand[i].orig_node); cand 731 net/batman-adv/distributed-arp-table.c kfree(cand); cand 549 net/batman-adv/routing.c struct batadv_orig_ifinfo *cand, *first_candidate = NULL; cand 581 net/batman-adv/routing.c hlist_for_each_entry_rcu(cand, &orig_node->ifinfo_list, list) { cand 583 net/batman-adv/routing.c if (!kref_get_unless_zero(&cand->refcount)) cand 586 net/batman-adv/routing.c cand_router = rcu_dereference(cand->router); cand 599 net/batman-adv/routing.c cand->if_outgoing, router, cand 610 net/batman-adv/routing.c kref_get(&cand->refcount); cand 611 net/batman-adv/routing.c first_candidate = cand; cand 620 net/batman-adv/routing.c next_candidate = cand; cand 625 net/batman-adv/routing.c if (last_candidate == cand) cand 633 net/batman-adv/routing.c batadv_orig_ifinfo_put(cand); cand 89 net/ipv4/ip_tunnel.c struct ip_tunnel *t, *cand = NULL; cand 107 net/ipv4/ip_tunnel.c cand = t; cand 121 net/ipv4/ip_tunnel.c else if (!cand) cand 122 net/ipv4/ip_tunnel.c cand = t; cand 141 net/ipv4/ip_tunnel.c else if (!cand) cand 142 net/ipv4/ip_tunnel.c cand = t; cand 154 net/ipv4/ip_tunnel.c else if (!cand) cand 155 net/ipv4/ip_tunnel.c cand = t; cand 158 net/ipv4/ip_tunnel.c if (cand) cand 159 net/ipv4/ip_tunnel.c return cand; cand 123 net/ipv6/ip6_gre.c struct ip6_tnl *t, *cand = NULL; cand 151 net/ipv6/ip6_gre.c cand = t; cand 175 net/ipv6/ip6_gre.c cand = t; cand 201 net/ipv6/ip6_gre.c cand = t; cand 224 net/ipv6/ip6_gre.c cand = t; cand 229 net/ipv6/ip6_gre.c if (cand) cand 230 net/ipv6/ip6_gre.c return cand; cand 183 net/xfrm/xfrm_policy.c xfrm_policy_find_inexact_candidates(struct xfrm_pol_inexact_candidates *cand, cand 1646 net/xfrm/xfrm_policy.c struct xfrm_pol_inexact_candidates cand; cand 1656 net/xfrm/xfrm_policy.c if (!xfrm_policy_find_inexact_candidates(&cand, bin, cand 1664 net/xfrm/xfrm_policy.c for (i = 0; i < ARRAY_SIZE(cand.res); i++) { cand 1667 net/xfrm/xfrm_policy.c tmp = __xfrm_policy_bysel_ctx(cand.res[i], mark, cand 1942 net/xfrm/xfrm_policy.c xfrm_policy_find_inexact_candidates(struct xfrm_pol_inexact_candidates *cand, cand 1954 net/xfrm/xfrm_policy.c memset(cand, 0, sizeof(*cand)); cand 1955 net/xfrm/xfrm_policy.c cand->res[XFRM_POL_CAND_ANY] = &b->hhead; cand 1960 net/xfrm/xfrm_policy.c cand->res[XFRM_POL_CAND_DADDR] = &n->hhead; cand 1964 net/xfrm/xfrm_policy.c cand->res[XFRM_POL_CAND_BOTH] = &n->hhead; cand 1970 net/xfrm/xfrm_policy.c cand->res[XFRM_POL_CAND_SADDR] = &n->hhead; cand 2047 net/xfrm/xfrm_policy.c xfrm_policy_eval_candidates(struct xfrm_pol_inexact_candidates *cand, cand 2055 net/xfrm/xfrm_policy.c for (i = 0; i < ARRAY_SIZE(cand->res); i++) { cand 2056 net/xfrm/xfrm_policy.c tmp = __xfrm_policy_eval_candidates(cand->res[i], cand 2076 net/xfrm/xfrm_policy.c struct xfrm_pol_inexact_candidates cand; cand 2112 net/xfrm/xfrm_policy.c if (!bin || !xfrm_policy_find_inexact_candidates(&cand, bin, saddr, cand 2116 net/xfrm/xfrm_policy.c pol = xfrm_policy_eval_candidates(&cand, ret, fl, type, cand 1995 tools/lib/bpf/btf.c struct btf_type *cand; cand 2020 tools/lib/bpf/btf.c cand = d->btf->types[cand_id]; cand 2021 tools/lib/bpf/btf.c if (btf_equal_int(t, cand)) { cand 2032 tools/lib/bpf/btf.c cand = d->btf->types[cand_id]; cand 2033 tools/lib/bpf/btf.c if (btf_equal_enum(t, cand)) { cand 2039 tools/lib/bpf/btf.c if (btf_compat_enum(t, cand)) { cand 2055 tools/lib/bpf/btf.c cand = d->btf->types[cand_id]; cand 2056 tools/lib/bpf/btf.c if (btf_equal_common(t, cand)) { cand 2552 tools/lib/bpf/btf.c struct btf_type *t, *cand; cand 2580 tools/lib/bpf/btf.c cand = d->btf->types[cand_id]; cand 2581 tools/lib/bpf/btf.c if (btf_equal_common(t, cand)) { cand 2604 tools/lib/bpf/btf.c cand = d->btf->types[cand_id]; cand 2605 tools/lib/bpf/btf.c if (btf_equal_array(t, cand)) { cand 2636 tools/lib/bpf/btf.c cand = d->btf->types[cand_id]; cand 2637 tools/lib/bpf/btf.c if (btf_equal_fnproto(t, cand)) { cand 519 tools/perf/util/build-id.c struct str_node *nd, *cand = NULL; cand 534 tools/perf/util/build-id.c if (cand) { /* Error: There are more than 2 candidates. */ cand 535 tools/perf/util/build-id.c cand = NULL; cand 538 tools/perf/util/build-id.c cand = nd; cand 540 tools/perf/util/build-id.c if (cand) cand 541 tools/perf/util/build-id.c sbuild_id = strdup(cand->s);