Home
last modified time | relevance | path

Searched refs:next_node (Results 1 - 25 of 52) sorted by relevance

123

/kernel/linux/linux-5.10/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 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()
91 /* next_node is NULL if we are at the end-of-list */ 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.c820 struct acpi_namespace_node *next_node; in acpi_ev_orphan_ec_reg_method() local
849 next_node = acpi_ns_get_next_node(ec_device_node, NULL); in acpi_ev_orphan_ec_reg_method()
850 while (next_node) { in acpi_ev_orphan_ec_reg_method()
851 if ((next_node->type == ACPI_TYPE_REGION) && in acpi_ev_orphan_ec_reg_method()
852 (next_node->object) && in acpi_ev_orphan_ec_reg_method()
853 (next_node->object->region.space_id == ACPI_ADR_SPACE_EC)) { in acpi_ev_orphan_ec_reg_method()
857 next_node = acpi_ns_get_next_node(ec_device_node, next_node); in acpi_ev_orphan_ec_reg_method()
/kernel/linux/linux-6.6/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 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()
91 /* next_node is NULL if we are at the end-of-list */ 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.c826 struct acpi_namespace_node *next_node; in acpi_ev_execute_orphan_reg_method() local
855 next_node = acpi_ns_get_next_node(device_node, NULL); in acpi_ev_execute_orphan_reg_method()
856 while (next_node) { in acpi_ev_execute_orphan_reg_method()
857 if ((next_node->type == ACPI_TYPE_REGION) && in acpi_ev_execute_orphan_reg_method()
858 (next_node->object) && in acpi_ev_execute_orphan_reg_method()
859 (next_node->object->region.space_id == space_id)) { in acpi_ev_execute_orphan_reg_method()
863 next_node = acpi_ns_get_next_node(device_node, next_node); in acpi_ev_execute_orphan_reg_method()
/kernel/linux/linux-5.10/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
[all...]
/kernel/linux/linux-6.6/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
[all...]
/kernel/linux/linux-5.10/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()
339 hfs_bnode_read(next_node, in hfs_bnode_split()
[all...]
H 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()
/kernel/linux/linux-5.10/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()
335 hfs_bnode_read(next_node, in hfs_bnode_split()
[all...]
H 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()
/kernel/linux/linux-6.6/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()
335 hfs_bnode_read(next_node, 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()
/kernel/linux/linux-6.6/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()
339 hfs_bnode_read(next_node, 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()
/kernel/linux/linux-5.10/lib/
H A 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()
[all...]
/kernel/linux/linux-6.6/lib/
H A 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()
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()
[all...]
/kernel/linux/linux-5.10/kernel/bpf/
H A Dlpm_trie.c630 struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root; in trie_get_next_key() local
691 next_node = parent; in trie_get_next_key()
711 next_node = node; in trie_get_next_key()
714 node = rcu_dereference(next_node->child[1]); in trie_get_next_key()
718 next_key->prefixlen = next_node->prefixlen; in trie_get_next_key()
720 next_node->data, trie->data_size); in trie_get_next_key()
/kernel/linux/linux-6.6/kernel/bpf/
H A Dlpm_trie.c617 struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root; in trie_get_next_key() local
678 next_node = parent; in trie_get_next_key()
698 next_node = node; in trie_get_next_key()
701 node = rcu_dereference(next_node->child[1]); in trie_get_next_key()
705 next_key->prefixlen = next_node->prefixlen; in trie_get_next_key()
707 next_node->data, trie->data_size); in trie_get_next_key()
/kernel/linux/linux-5.10/include/linux/
H A Dnodemask.h46 * unsigend int next_node(node, mask) Next node past 'node', or MAX_NUMNODES
268 #define next_node(n, src) __next_node((n), &(src)) macro
381 (node) = next_node((node), (mask)))
440 return next_node(nid, node_states[N_ONLINE]); in next_online_node()
444 return next_node(nid, node_states[N_MEMORY]); in next_memory_node()
/kernel/linux/linux-6.6/include/linux/
H A Dnodemask.h46 * unsigend int next_node(node, mask) Next node past 'node', or MAX_NUMNODES
269 #define next_node(n, src) __next_node((n), &(src)) macro
389 (node) = next_node((node), (mask)))
448 return next_node(nid, node_states[N_ONLINE]); in next_online_node()
452 return next_node(nid, node_states[N_MEMORY]); in next_memory_node()
/kernel/linux/linux-5.10/kernel/sched/
H A Ddeadline.c548 struct rb_node *next_node; in dequeue_pushable_dl_task() local
550 next_node = rb_next(&p->pushable_dl_tasks); in dequeue_pushable_dl_task()
551 if (next_node) { in dequeue_pushable_dl_task()
552 dl_rq->earliest_dl.next = rb_entry(next_node, in dequeue_pushable_dl_task()
1939 struct rb_node *next_node = rq->dl.pushable_dl_tasks_root.rb_leftmost; in pick_earliest_pushable_dl_task() local
1945 next_node: in pick_earliest_pushable_dl_task()
1946 if (next_node) { in pick_earliest_pushable_dl_task()
1947 p = rb_entry(next_node, struct task_struct, pushable_dl_tasks); in pick_earliest_pushable_dl_task()
1952 next_node = rb_next(next_node); in pick_earliest_pushable_dl_task()
[all...]

Completed in 21 milliseconds

123