Home
last modified time | relevance | path

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

12

/linux/drivers/acpi/acpica/
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 …]
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()
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()
A Devregion.c807 struct acpi_namespace_node *next_node; in acpi_ev_execute_orphan_reg_method() local
836 next_node = acpi_ns_get_next_node(device_node, NULL); in acpi_ev_execute_orphan_reg_method()
837 while (next_node) { in acpi_ev_execute_orphan_reg_method()
838 if ((next_node->type == ACPI_TYPE_REGION) && in acpi_ev_execute_orphan_reg_method()
839 (next_node->object) && in acpi_ev_execute_orphan_reg_method()
840 (next_node->object->region.space_id == space_id)) { in acpi_ev_execute_orphan_reg_method()
844 next_node = acpi_ns_get_next_node(device_node, next_node); in acpi_ev_execute_orphan_reg_method()
/linux/drivers/net/ethernet/apm/xgene/
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 …]
A Dxgene_enet_cle.h204 u16 next_node; member
/linux/scripts/genksyms/
A Dlex.l100 cur_node = next_node; \
101 next_node = xmalloc(sizeof(*next_node)); \
102 next_node->next = cur_node; \
125 static struct string_list *next_node;
133 next_node = xmalloc(sizeof(*next_node));
134 next_node->next = NULL;
437 yylval = &next_node->next;
/linux/fs/hfsplus/
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 …]
A 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/fs/hfs/
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 …]
A 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/lib/
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()
1501 new_ptr_pp = &new_s->next_node; in assoc_array_gc()
1502 cursor = shortcut->next_node; in assoc_array_gc()
[all …]
/linux/kernel/bpf/
A Dlpm_trie.c616 struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root; in trie_get_next_key() local
677 next_node = parent; in trie_get_next_key()
697 next_node = node; in trie_get_next_key()
700 node = rcu_dereference(next_node->child[1]); in trie_get_next_key()
704 next_key->prefixlen = next_node->prefixlen; in trie_get_next_key()
706 next_node->data, trie->data_size); in trie_get_next_key()
/linux/include/linux/
A 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()
A Dassoc_array_priv.h67 struct assoc_array_ptr *next_node; member
/linux/kernel/sched/
A Ddeadline.c2037 struct rb_node *next_node = rq->dl.pushable_dl_tasks_root.rb_leftmost; in pick_earliest_pushable_dl_task() local
2043 next_node: in pick_earliest_pushable_dl_task()
2044 if (next_node) { in pick_earliest_pushable_dl_task()
2045 p = rb_entry(next_node, struct task_struct, pushable_dl_tasks); in pick_earliest_pushable_dl_task()
2050 next_node = rb_next(next_node); in pick_earliest_pushable_dl_task()
2051 goto next_node; in pick_earliest_pushable_dl_task()
/linux/drivers/block/mtip32xx/
A Dmtip32xx.c3826 static int next_node = NUMA_NO_NODE; in mtip_get_next_rr_node() local
3828 if (next_node == NUMA_NO_NODE) { in mtip_get_next_rr_node()
3829 next_node = first_online_node; in mtip_get_next_rr_node()
3830 return next_node; in mtip_get_next_rr_node()
3833 next_node = next_online_node(next_node); in mtip_get_next_rr_node()
3834 if (next_node == MAX_NUMNODES) in mtip_get_next_rr_node()
3835 next_node = first_online_node; in mtip_get_next_rr_node()
3836 return next_node; in mtip_get_next_rr_node()
/linux/fs/ext4/
A Ddir.c583 goto next_node; in ext4_dx_readdir()
615 next_node: in ext4_dx_readdir()
/linux/drivers/md/
A Ddm-writecache.c1924 struct rb_node *node, *next_node; in writecache_writeback() local
2016 next_node = rb_next(&f->rb_node); in writecache_writeback()
2017 if (unlikely(!next_node)) in writecache_writeback()
2019 g = container_of(next_node, struct wc_entry, rb_node); in writecache_writeback()
2051 next_node = rb_next(&f->rb_node); in writecache_writeback()
2052 if (likely(next_node)) in writecache_writeback()
2053 g = container_of(next_node, struct wc_entry, rb_node); in writecache_writeback()
A Ddm-integrity.c1360 struct journal_node *node, *next_node; in test_journal_node() local
1375 next_node = container_of(next, struct journal_node, node); in test_journal_node()
1376 return next_node->sector != sector; in test_journal_node()
1382 struct journal_node *next_node; in find_newer_committed_node() local
1391 next_node = container_of(next, struct journal_node, node); in find_newer_committed_node()
1393 if (next_node->sector != node->sector) in find_newer_committed_node()
1396 next_section = (unsigned)(next_node - ic->journal_tree) / ic->journal_section_entries; in find_newer_committed_node()
/linux/Documentation/sphinx/
A Dkfigure.py540 for n in node.next_node():
/linux/security/keys/
A Dkeyring.c745 ptr = READ_ONCE(shortcut->next_node); in search_nested_keyrings()
762 ptr = READ_ONCE(shortcut->next_node); in search_nested_keyrings()
/linux/arch/sparc/kernel/
A Dhead_32.S379 or %g0, %g0, %o0 ! next_node(0) = first_node
/linux/fs/f2fs/
A Dgc.c555 next_node: in atssr_lookup_victim()
594 goto next_node; in atssr_lookup_victim()
/linux/fs/ocfs2/
A Dalloc.c2247 goto next_node; in ocfs2_find_cpos_for_left_leaf()
2267 next_node: in ocfs2_find_cpos_for_left_leaf()
2846 goto next_node; in ocfs2_find_cpos_for_right_leaf()
2863 next_node: in ocfs2_find_cpos_for_right_leaf()

Completed in 87 milliseconds

12