Home
last modified time | relevance | path

Searched refs:next_node (Results 1 – 20 of 20) sorted by relevance

/linux/drivers/acpi/acpica/
H A Dnsalloc.c136 struct acpi_namespace_node *next_node; in acpi_ns_remove_node() local
143 next_node = parent_node->child; in acpi_ns_remove_node()
147 while (next_node != node) { in acpi_ns_remove_node()
148 prev_node = next_node; in acpi_ns_remove_node()
149 next_node = next_node->peer; in acpi_ns_remove_node()
269 struct acpi_namespace_node *next_node; in acpi_ns_delete_children() local
280 next_node = parent_node->child; in acpi_ns_delete_children()
281 while (next_node) { in acpi_ns_delete_children()
285 if (next_node->child) { in acpi_ns_delete_children()
287 parent_node, next_node)); in acpi_ns_delete_children()
[all …]
/linux/drivers/net/ethernet/apm/xgene/
H A Dxgene_enet_cle.c97 SET_VAL(CLE_BR_NNODE, br->next_node) | in xgene_cle_dn_to_hw()
215 .next_node = PKT_PROT_NODE,
226 .next_node = LAST_NODE,
251 .next_node = RSS_IPV4_TCP_NODE,
263 .next_node = RSS_IPV4_UDP_NODE,
274 .next_node = RSS_IPV4_OTHERS_NODE,
299 .next_node = RSS_IPV4_TCP_NODE,
311 .next_node = RSS_IPV4_TCP_NODE,
323 .next_node = RSS_IPV4_TCP_NODE,
335 .next_node = RSS_IPV4_TCP_NODE,
[all …]
H A Dxgene_enet_cle.h204 u16 next_node; member
/linux/scripts/genksyms/
H A Dlex.l102 cur_node = next_node; \
103 next_node = xmalloc(sizeof(*next_node)); \
104 next_node->next = cur_node; \
133 static struct string_list *next_node;
141 next_node = xmalloc(sizeof(*next_node));
142 next_node->next = NULL;
446 yylval = &next_node->next;
/linux/mm/
H A Dhugetlb_internal.h52 static inline int hstate_next_node_to_alloc(int *next_node, in hstate_next_node_to_alloc() argument
59 nid = get_valid_node_allowed(*next_node, nodes_allowed); in hstate_next_node_to_alloc()
60 *next_node = next_node_allowed(nid, nodes_allowed); in hstate_next_node_to_alloc()
83 #define for_each_node_mask_to_alloc(next_node, nr_nodes, node, mask) \ argument
86 ((node = hstate_next_node_to_alloc(next_node, mask)) || 1); \
H A Dhugetlb.c1899 int *next_node) in alloc_pool_huge_folio() argument
1904 for_each_node_mask_to_alloc(next_node, nr_nodes, node, nodes_allowed) { in alloc_pool_huge_folio()
3448 int next_node = first_online_node; in hugetlb_pages_alloc_boot_node() local
3462 &node_alloc_noretry, &next_node); in hugetlb_pages_alloc_boot_node()
/linux/lib/
H A Dassoc_array.c37 cursor = READ_ONCE(shortcut->next_node); /* Address dependency. */ in assoc_array_subtree_iterate()
283 cursor = READ_ONCE(shortcut->next_node); /* Address dependency. */ in assoc_array_walk()
369 cursor = shortcut->next_node; in assoc_array_destroy_subtree()
409 BUG_ON(shortcut->next_node != cursor); in assoc_array_destroy_subtree()
709 edit->set[0].ptr = &assoc_array_ptr_to_shortcut(ptr)->next_node; in assoc_array_insert_into_terminal_node()
753 new_s0->next_node = assoc_array_node_to_ptr(new_n0); in assoc_array_insert_into_terminal_node()
859 new_s0->next_node = assoc_array_node_to_ptr(new_n0); in assoc_array_insert_mid_shortcut()
878 side = assoc_array_ptr_to_node(shortcut->next_node); in assoc_array_insert_mid_shortcut()
908 new_s1->next_node = shortcut->next_node; in assoc_array_insert_mid_shortcut()
926 new_n0->slots[sc_slot] = shortcut->next_node; in assoc_array_insert_mid_shortcut()
[all …]
/linux/include/linux/
H A Dnodemask.h264 #define next_node(n, src) __next_node((n), &(src)) macro
383 (node) = next_node((node), (mask)))
442 return next_node(nid, node_states[N_ONLINE]); in next_online_node()
446 return next_node(nid, node_states[N_MEMORY]); in next_memory_node()
H A Dassoc_array_priv.h67 struct assoc_array_ptr *next_node; member
/linux/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_queue.c166 struct interval_tree_node *next_node; in kfd_queue_buffer_svm_put() local
170 next_node = interval_tree_iter_next(node, addr, last); in kfd_queue_buffer_svm_put()
178 node = next_node; in kfd_queue_buffer_svm_put()
/linux/tools/testing/memblock/tests/
H A Dalloc_exact_nid_api.c843 struct memblock_region *next_node = &memblock.memory.regions[nid_next]; in alloc_exact_nid_numa_reserved_full_merge_generic_check() local
854 r1.base = next_node->base; in alloc_exact_nid_numa_reserved_full_merge_generic_check()
915 struct memblock_region *next_node = &memblock.memory.regions[7]; in alloc_exact_nid_numa_split_all_reserved_generic_check() local
924 r2.base = next_node->base + SZ_128; in alloc_exact_nid_numa_split_all_reserved_generic_check()
H A Dalloc_nid_api.c2394 struct memblock_region *next_node = &memblock.memory.regions[nid_next]; in alloc_nid_numa_reserved_full_merge_generic_check() local
2405 r1.base = next_node->base; in alloc_nid_numa_reserved_full_merge_generic_check()
2465 struct memblock_region *next_node = &memblock.memory.regions[7]; in alloc_nid_numa_split_all_reserved_generic_check() local
2474 r2.base = next_node->base + SZ_128; in alloc_nid_numa_split_all_reserved_generic_check()
/linux/kernel/sched/
H A Ddeadline.c2912 struct rb_node *next_node; in pick_earliest_pushable_dl_task() local
2917 next_node = rb_first_cached(&rq->dl.pushable_dl_tasks_root); in pick_earliest_pushable_dl_task()
2918 while (next_node) { in pick_earliest_pushable_dl_task()
2919 p = __node_2_pdl(next_node); in pick_earliest_pushable_dl_task()
2924 next_node = rb_next(next_node); in pick_earliest_pushable_dl_task()
3023 struct rb_node *next_node; in pick_next_pushable_dl_task() local
3028 next_node = rb_first_cached(&rq->dl.pushable_dl_tasks_root); in pick_next_pushable_dl_task()
3029 while (next_node) { in pick_next_pushable_dl_task()
3030 i = __node_2_pdl(next_node); in pick_next_pushable_dl_task()
3037 next_node = rb_next(next_node); in pick_next_pushable_dl_task()
/linux/fs/ext4/
H A Ddir.c602 goto next_node; in ext4_dx_readdir()
634 next_node: in ext4_dx_readdir()
/linux/drivers/block/mtip32xx/
H A Dmtip32xx.c3625 static int next_node = NUMA_NO_NODE; in mtip_get_next_rr_node() local
3627 if (next_node == NUMA_NO_NODE) { in mtip_get_next_rr_node()
3628 next_node = first_online_node; in mtip_get_next_rr_node()
3629 return next_node; in mtip_get_next_rr_node()
3632 next_node = next_online_node(next_node); in mtip_get_next_rr_node()
3633 if (next_node == MAX_NUMNODES) in mtip_get_next_rr_node()
3634 next_node = first_online_node; in mtip_get_next_rr_node()
3635 return next_node; in mtip_get_next_rr_node()
/linux/drivers/net/ethernet/intel/ice/
H A Dice_parser.h226 u16 next_node; /* Parser Node ID for the next round */ member
H A Dice_parser_rt.c371 ice_gpr_add(rt, ICE_GPR_NN_IDX, rt->action->next_node); in ice_pg_exe()
842 rt->action->next_node); in ice_parser_rt_execute()
H A Dice_parser.c667 dev_info(dev, "\tnext_node = %d\n", action->next_node); in ice_pg_cam_action_dump()
720 action->next_node = FIELD_GET(ICE_PGCA_NN, data); in ice_pg_cam_action_init()
/linux/security/keys/
H A Dkeyring.c747 ptr = READ_ONCE(shortcut->next_node); in search_nested_keyrings()
764 ptr = READ_ONCE(shortcut->next_node); in search_nested_keyrings()
/linux/drivers/md/
H A Ddm-integrity.c1369 struct journal_node *node, *next_node; in test_journal_node() local
1384 next_node = container_of(next, struct journal_node, node); in test_journal_node()
1385 return next_node->sector != sector; in test_journal_node()
1391 struct journal_node *next_node; in find_newer_committed_node() local
1400 next_node = container_of(next, struct journal_node, node); in find_newer_committed_node()
1402 if (next_node->sector != node->sector) in find_newer_committed_node()
1405 next_section = (unsigned int)(next_node - ic->journal_tree) / ic->journal_section_entries; in find_newer_committed_node()