Home
last modified time | relevance | path

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

12

/linux-6.15/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()
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()
294 node_to_delete = next_node; in acpi_ns_delete_children()
[all …]
H A Dnswalk.c80 struct acpi_namespace_node *next_node = NULL; in acpi_ns_get_next_node_typed() local
84 next_node = acpi_ns_get_next_node(parent_node, child_node); in acpi_ns_get_next_node_typed()
93 return (next_node); in acpi_ns_get_next_node_typed()
98 while (next_node) { in acpi_ns_get_next_node_typed()
102 if (next_node->type == type) { in acpi_ns_get_next_node_typed()
103 return (next_node); in acpi_ns_get_next_node_typed()
108 next_node = next_node->peer; in acpi_ns_get_next_node_typed()
H A Dnsnames.c200 struct acpi_namespace_node *next_node; in acpi_ns_build_normalized_path() local
225 next_node = node; in acpi_ns_build_normalized_path()
226 while (next_node && next_node != acpi_gbl_root_node) { in acpi_ns_build_normalized_path()
227 if (next_node != node) { in acpi_ns_build_normalized_path()
232 ACPI_MOVE_32_TO_32(name, &next_node->name); in acpi_ns_build_normalized_path()
244 next_node = next_node->parent; in acpi_ns_build_normalized_path()
H A Devregion.c828 struct acpi_namespace_node *next_node; in acpi_ev_execute_orphan_reg_method() local
857 next_node = acpi_ns_get_next_node(device_node, NULL); in acpi_ev_execute_orphan_reg_method()
858 while (next_node) { in acpi_ev_execute_orphan_reg_method()
859 if ((next_node->type == ACPI_TYPE_REGION) && in acpi_ev_execute_orphan_reg_method()
860 (next_node->object) && in acpi_ev_execute_orphan_reg_method()
861 (next_node->object->region.space_id == space_id)) { in acpi_ev_execute_orphan_reg_method()
865 next_node = acpi_ns_get_next_node(device_node, next_node); in acpi_ev_execute_orphan_reg_method()
/linux-6.15/drivers/net/ethernet/apm/xgene/
H A Dxgene_enet_cle.c215 .next_node = PKT_PROT_NODE,
226 .next_node = LAST_NODE,
251 .next_node = RSS_IPV4_TCP_NODE,
263 .next_node = RSS_IPV4_UDP_NODE,
299 .next_node = RSS_IPV4_TCP_NODE,
311 .next_node = RSS_IPV4_TCP_NODE,
323 .next_node = RSS_IPV4_TCP_NODE,
359 .next_node = LAST_NODE,
444 .next_node = LAST_NODE,
529 .next_node = LAST_NODE,
[all …]
H A Dxgene_enet_cle.h204 u16 next_node; member
/linux-6.15/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-6.15/fs/hfs/
H A Dbrec.c234 struct hfs_bnode *node, *new_node, *next_node; in hfs_bnode_split() local
254 next_node = hfs_bnode_find(tree, node->next); in hfs_bnode_split()
256 next_node = NULL; in hfs_bnode_split()
258 if (IS_ERR(next_node)) { in hfs_bnode_split()
261 return next_node; in hfs_bnode_split()
277 if (next_node) in hfs_bnode_split()
278 hfs_bnode_put(next_node); in hfs_bnode_split()
333 if (next_node) { in hfs_bnode_split()
334 next_node->prev = new_node->this; in hfs_bnode_split()
336 node_desc.prev = cpu_to_be32(next_node->prev); in hfs_bnode_split()
[all …]
H A Dbtree.c252 struct hfs_bnode *node, *next_node; in hfs_bmap_alloc() local
307 next_node = hfs_bmap_new_bmap(node, idx); in hfs_bmap_alloc()
309 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
311 if (IS_ERR(next_node)) in hfs_bmap_alloc()
312 return next_node; in hfs_bmap_alloc()
313 node = next_node; in hfs_bmap_alloc()
/linux-6.15/fs/hfsplus/
H A Dbrec.c238 struct hfs_bnode *node, *new_node, *next_node; in hfs_bnode_split() local
258 next_node = hfs_bnode_find(tree, node->next); in hfs_bnode_split()
260 next_node = NULL; in hfs_bnode_split()
262 if (IS_ERR(next_node)) { in hfs_bnode_split()
265 return next_node; in hfs_bnode_split()
281 if (next_node) in hfs_bnode_split()
282 hfs_bnode_put(next_node); in hfs_bnode_split()
337 if (next_node) { in hfs_bnode_split()
338 next_node->prev = new_node->this; in hfs_bnode_split()
340 node_desc.prev = cpu_to_be32(next_node->prev); in hfs_bnode_split()
[all …]
H A Dbtree.c376 struct hfs_bnode *node, *next_node; in hfs_bmap_alloc() local
432 next_node = hfs_bmap_new_bmap(node, idx); in hfs_bmap_alloc()
434 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
436 if (IS_ERR(next_node)) in hfs_bmap_alloc()
437 return next_node; in hfs_bmap_alloc()
438 node = next_node; in hfs_bmap_alloc()
/linux-6.15/lib/
H A Dassoc_array.c368 cursor = shortcut->next_node; in assoc_array_destroy_subtree()
408 BUG_ON(shortcut->next_node != cursor); in assoc_array_destroy_subtree()
752 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()
909 new_s1->next_node = shortcut->next_node; in assoc_array_insert_mid_shortcut()
927 new_n0->slots[sc_slot] = shortcut->next_node; in assoc_array_insert_mid_shortcut()
1240 edit->set[1].ptr = &s->next_node; in assoc_array_delete()
1502 new_ptr_pp = &new_s->next_node; in assoc_array_gc()
1503 cursor = shortcut->next_node; in assoc_array_gc()
[all …]
/linux-6.15/kernel/bpf/
H A Dlpm_trie.c658 struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root; in trie_get_next_key() local
719 next_node = parent; in trie_get_next_key()
739 next_node = node; in trie_get_next_key()
742 node = rcu_dereference(next_node->child[1]); in trie_get_next_key()
746 next_key->prefixlen = next_node->prefixlen; in trie_get_next_key()
748 next_node->data, trie->data_size); in trie_get_next_key()
/linux-6.15/include/linux/
H A Dnodemask.h275 #define next_node(n, src) __next_node((n), &(src)) macro
395 (node) = next_node((node), (mask)))
454 return next_node(nid, node_states[N_ONLINE]); in next_online_node()
458 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-6.15/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_queue.c165 struct interval_tree_node *next_node; in kfd_queue_buffer_svm_put() local
169 next_node = interval_tree_iter_next(node, addr, last); in kfd_queue_buffer_svm_put()
177 node = next_node; in kfd_queue_buffer_svm_put()
/linux-6.15/arch/powerpc/kexec/
H A Dcore_64.c496 goto next_node; in update_cpus_node()
504 next_node: in update_cpus_node()
/linux-6.15/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-6.15/drivers/block/mtip32xx/
H A Dmtip32xx.c3604 static int next_node = NUMA_NO_NODE; in mtip_get_next_rr_node() local
3606 if (next_node == NUMA_NO_NODE) { in mtip_get_next_rr_node()
3607 next_node = first_online_node; in mtip_get_next_rr_node()
3608 return next_node; in mtip_get_next_rr_node()
3611 next_node = next_online_node(next_node); in mtip_get_next_rr_node()
3612 if (next_node == MAX_NUMNODES) in mtip_get_next_rr_node()
3613 next_node = first_online_node; in mtip_get_next_rr_node()
3614 return next_node; in mtip_get_next_rr_node()
/linux-6.15/fs/ext4/
H A Ddir.c586 goto next_node; in ext4_dx_readdir()
618 next_node: in ext4_dx_readdir()
/linux-6.15/drivers/md/
H A Ddm-writecache.c1948 struct rb_node *node, *next_node; in writecache_writeback() local
2040 next_node = rb_next(&f->rb_node); in writecache_writeback()
2041 if (unlikely(!next_node)) in writecache_writeback()
2043 g = container_of(next_node, struct wc_entry, rb_node); in writecache_writeback()
2075 next_node = rb_next(&f->rb_node); in writecache_writeback()
2076 if (likely(next_node)) in writecache_writeback()
2077 g = container_of(next_node, struct wc_entry, rb_node); in writecache_writeback()
/linux-6.15/kernel/sched/
H A Ddeadline.c2515 struct rb_node *next_node; in pick_earliest_pushable_dl_task() local
2520 next_node = rb_first_cached(&rq->dl.pushable_dl_tasks_root); in pick_earliest_pushable_dl_task()
2521 while (next_node) { in pick_earliest_pushable_dl_task()
2522 p = __node_2_pdl(next_node); in pick_earliest_pushable_dl_task()
2527 next_node = rb_next(next_node); in pick_earliest_pushable_dl_task()
/linux-6.15/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()

12