Home
last modified time | relevance | path

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

12

/Linux-v5.10/drivers/acpi/acpica/
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 …]
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()
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()
Devregion.c790 struct acpi_namespace_node *next_node; in acpi_ev_orphan_ec_reg_method() local
819 next_node = acpi_ns_get_next_node(ec_device_node, NULL); in acpi_ev_orphan_ec_reg_method()
820 while (next_node) { in acpi_ev_orphan_ec_reg_method()
821 if ((next_node->type == ACPI_TYPE_REGION) && in acpi_ev_orphan_ec_reg_method()
822 (next_node->object) && in acpi_ev_orphan_ec_reg_method()
823 (next_node->object->region.space_id == ACPI_ADR_SPACE_EC)) { in acpi_ev_orphan_ec_reg_method()
827 next_node = acpi_ns_get_next_node(ec_device_node, next_node); in acpi_ev_orphan_ec_reg_method()
/Linux-v5.10/drivers/net/ethernet/apm/xgene/
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 …]
Dxgene_enet_cle.h204 u16 next_node; member
/Linux-v5.10/scripts/genksyms/
Dlex.l100 cur_node = next_node; \
101 next_node = xmalloc(sizeof(*next_node)); \
102 next_node->next = cur_node; \
127 static struct string_list *next_node;
134 next_node = xmalloc(sizeof(*next_node));
135 next_node->next = NULL;
466 yylval = &next_node->next;
/Linux-v5.10/fs/hfs/
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()
335 hfs_bnode_read(next_node, &node_desc, 0, sizeof(node_desc)); in hfs_bnode_split()
[all …]
Dbtree.c249 struct hfs_bnode *node, *next_node; in hfs_bmap_alloc() local
304 next_node = hfs_bmap_new_bmap(node, idx); in hfs_bmap_alloc()
306 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
308 if (IS_ERR(next_node)) in hfs_bmap_alloc()
309 return next_node; in hfs_bmap_alloc()
310 node = next_node; in hfs_bmap_alloc()
/Linux-v5.10/fs/hfsplus/
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()
339 hfs_bnode_read(next_node, &node_desc, 0, sizeof(node_desc)); in hfs_bnode_split()
[all …]
Dbtree.c375 struct hfs_bnode *node, *next_node; in hfs_bmap_alloc() local
431 next_node = hfs_bmap_new_bmap(node, idx); in hfs_bmap_alloc()
433 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
435 if (IS_ERR(next_node)) in hfs_bmap_alloc()
436 return next_node; in hfs_bmap_alloc()
437 node = next_node; in hfs_bmap_alloc()
/Linux-v5.10/lib/
Dassoc_array.c37 cursor = READ_ONCE(shortcut->next_node); /* Address dependency. */ in assoc_array_subtree_iterate()
282 cursor = READ_ONCE(shortcut->next_node); /* Address dependency. */ in assoc_array_walk()
368 cursor = shortcut->next_node; in assoc_array_destroy_subtree()
408 BUG_ON(shortcut->next_node != cursor); in assoc_array_destroy_subtree()
708 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()
860 new_s0->next_node = assoc_array_node_to_ptr(new_n0); in assoc_array_insert_mid_shortcut()
879 side = assoc_array_ptr_to_node(shortcut->next_node); in assoc_array_insert_mid_shortcut()
910 new_s1->next_node = shortcut->next_node; in assoc_array_insert_mid_shortcut()
928 new_n0->slots[sc_slot] = shortcut->next_node; in assoc_array_insert_mid_shortcut()
[all …]
/Linux-v5.10/kernel/bpf/
Dlpm_trie.c627 struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root; in trie_get_next_key() local
688 next_node = parent; in trie_get_next_key()
708 next_node = node; in trie_get_next_key()
711 node = rcu_dereference(next_node->child[1]); in trie_get_next_key()
715 next_key->prefixlen = next_node->prefixlen; in trie_get_next_key()
717 next_node->data, trie->data_size); in trie_get_next_key()
/Linux-v5.10/include/linux/
Dnodemask.h268 #define next_node(n, src) __next_node((n), &(src)) macro
381 (node) = next_node((node), (mask)))
441 return next_node(nid, node_states[N_ONLINE]); in next_online_node()
445 return next_node(nid, node_states[N_MEMORY]); in next_memory_node()
Dassoc_array_priv.h67 struct assoc_array_ptr *next_node; member
/Linux-v5.10/kernel/sched/
Ddeadline.c546 struct rb_node *next_node; in dequeue_pushable_dl_task() local
548 next_node = rb_next(&p->pushable_dl_tasks); in dequeue_pushable_dl_task()
549 if (next_node) { in dequeue_pushable_dl_task()
550 dl_rq->earliest_dl.next = rb_entry(next_node, in dequeue_pushable_dl_task()
1932 struct rb_node *next_node = rq->dl.pushable_dl_tasks_root.rb_leftmost; in pick_earliest_pushable_dl_task() local
1938 next_node: in pick_earliest_pushable_dl_task()
1939 if (next_node) { in pick_earliest_pushable_dl_task()
1940 p = rb_entry(next_node, struct task_struct, pushable_dl_tasks); in pick_earliest_pushable_dl_task()
1945 next_node = rb_next(next_node); in pick_earliest_pushable_dl_task()
1946 goto next_node; in pick_earliest_pushable_dl_task()
/Linux-v5.10/fs/ext4/
Ddir.c566 goto next_node; in ext4_dx_readdir()
598 next_node: in ext4_dx_readdir()
/Linux-v5.10/drivers/md/
Ddm-writecache.c1766 struct rb_node *node, *next_node; in writecache_writeback() local
1838 next_node = rb_next(&f->rb_node); in writecache_writeback()
1839 if (unlikely(!next_node)) in writecache_writeback()
1841 g = container_of(next_node, struct wc_entry, rb_node); in writecache_writeback()
1874 next_node = rb_next(&f->rb_node); in writecache_writeback()
1875 if (likely(next_node)) in writecache_writeback()
1876 g = container_of(next_node, struct wc_entry, rb_node); in writecache_writeback()
Ddm-integrity.c1251 struct journal_node *node, *next_node; in test_journal_node() local
1266 next_node = container_of(next, struct journal_node, node); in test_journal_node()
1267 return next_node->sector != sector; in test_journal_node()
1273 struct journal_node *next_node; in find_newer_committed_node() local
1282 next_node = container_of(next, struct journal_node, node); in find_newer_committed_node()
1284 if (next_node->sector != node->sector) in find_newer_committed_node()
1287 next_section = (unsigned)(next_node - ic->journal_tree) / ic->journal_section_entries; in find_newer_committed_node()
/Linux-v5.10/drivers/block/mtip32xx/
Dmtip32xx.c3915 static int next_node = NUMA_NO_NODE; in mtip_get_next_rr_node() local
3917 if (next_node == NUMA_NO_NODE) { in mtip_get_next_rr_node()
3918 next_node = first_online_node; in mtip_get_next_rr_node()
3919 return next_node; in mtip_get_next_rr_node()
3922 next_node = next_online_node(next_node); in mtip_get_next_rr_node()
3923 if (next_node == MAX_NUMNODES) in mtip_get_next_rr_node()
3924 next_node = first_online_node; in mtip_get_next_rr_node()
3925 return next_node; in mtip_get_next_rr_node()
/Linux-v5.10/Documentation/sphinx/
Dkfigure.py552 for n in node.next_node():
/Linux-v5.10/security/keys/
Dkeyring.c745 ptr = READ_ONCE(shortcut->next_node); in search_nested_keyrings()
762 ptr = READ_ONCE(shortcut->next_node); in search_nested_keyrings()
/Linux-v5.10/arch/sparc/kernel/
Dhead_32.S379 or %g0, %g0, %o0 ! next_node(0) = first_node
/Linux-v5.10/fs/f2fs/
Dgc.c535 next_node: in atssr_lookup_victim()
574 goto next_node; in atssr_lookup_victim()
/Linux-v5.10/fs/ocfs2/
Dalloc.c2249 goto next_node; in ocfs2_find_cpos_for_left_leaf()
2269 next_node: in ocfs2_find_cpos_for_left_leaf()
2848 goto next_node; in ocfs2_find_cpos_for_right_leaf()
2865 next_node: in ocfs2_find_cpos_for_right_leaf()

12