Home
last modified time | relevance | path

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

12

/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 …]
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.c830 struct acpi_namespace_node *next_node; in acpi_ev_execute_orphan_reg_method() local
859 next_node = acpi_ns_get_next_node(device_node, NULL); in acpi_ev_execute_orphan_reg_method()
860 while (next_node) { in acpi_ev_execute_orphan_reg_method()
861 if ((next_node->type == ACPI_TYPE_REGION) && in acpi_ev_execute_orphan_reg_method()
862 (next_node->object) && in acpi_ev_execute_orphan_reg_method()
863 (next_node->object->region.space_id == space_id)) { in acpi_ev_execute_orphan_reg_method()
867 next_node = acpi_ns_get_next_node(device_node, next_node); in acpi_ev_execute_orphan_reg_method()
/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); \
/linux/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, &node_desc, 0, sizeof(node_desc)); in hfs_bnode_split()
[all …]
H A Dbtree.c376 struct hfs_bnode *node, *next_node; in hfs_bmap_alloc() local
438 next_node = hfs_bmap_new_bmap(node, idx); in hfs_bmap_alloc()
440 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
442 if (IS_ERR(next_node)) in hfs_bmap_alloc()
443 return next_node; in hfs_bmap_alloc()
444 node = next_node; in hfs_bmap_alloc()
/linux/fs/hfs/
H A Dbrec.c253 struct hfs_bnode *node, *new_node, *next_node; in hfs_bnode_split() local
273 next_node = hfs_bnode_find(tree, node->next); in hfs_bnode_split()
275 next_node = NULL; in hfs_bnode_split()
277 if (IS_ERR(next_node)) { in hfs_bnode_split()
280 return next_node; in hfs_bnode_split()
296 if (next_node) in hfs_bnode_split()
297 hfs_bnode_put(next_node); in hfs_bnode_split()
352 if (next_node) { in hfs_bnode_split()
353 next_node->prev = new_node->this; in hfs_bnode_split()
354 hfs_bnode_read(next_node, &node_desc, 0, sizeof(node_desc)); in hfs_bnode_split()
[all …]
H A Dbtree.c287 struct hfs_bnode *node, *next_node; in hfs_bmap_alloc() local
342 next_node = hfs_bmap_new_bmap(node, idx); in hfs_bmap_alloc()
344 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
346 if (IS_ERR(next_node)) in hfs_bmap_alloc()
347 return next_node; in hfs_bmap_alloc()
348 node = next_node; in hfs_bmap_alloc()
/linux/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()
858 new_s0->next_node = assoc_array_node_to_ptr(new_n0); in assoc_array_insert_mid_shortcut()
877 side = assoc_array_ptr_to_node(shortcut->next_node); in assoc_array_insert_mid_shortcut()
907 new_s1->next_node = shortcut->next_node; in assoc_array_insert_mid_shortcut()
925 new_n0->slots[sc_slot] = shortcut->next_node; in assoc_array_insert_mid_shortcut()
[all …]
/linux/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/include/linux/
H A Dnodemask.h256 #define next_node(n, src) __next_node((n), &(src)) macro
375 (node) = next_node((node), (mask)))
434 return next_node(nid, node_states[N_ONLINE]); in next_online_node()
438 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/arch/powerpc/kexec/
H A Dcore_64.c515 goto next_node; in update_cpus_node()
523 next_node: in update_cpus_node()
/linux/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/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/drivers/block/mtip32xx/
H A Dmtip32xx.c3611 static int next_node = NUMA_NO_NODE; in mtip_get_next_rr_node() local
3613 if (next_node == NUMA_NO_NODE) { in mtip_get_next_rr_node()
3614 next_node = first_online_node; in mtip_get_next_rr_node()
3615 return next_node; in mtip_get_next_rr_node()
3618 next_node = next_online_node(next_node); in mtip_get_next_rr_node()
3619 if (next_node == MAX_NUMNODES) in mtip_get_next_rr_node()
3620 next_node = first_online_node; in mtip_get_next_rr_node()
3621 return next_node; in mtip_get_next_rr_node()
/linux/fs/ext4/
H A Ddir.c586 goto next_node; in ext4_dx_readdir()
618 next_node: in ext4_dx_readdir()
/linux/drivers/md/
H A Ddm-writecache.c1946 struct rb_node *node, *next_node; in writecache_writeback() local
2038 next_node = rb_next(&f->rb_node); in writecache_writeback()
2039 if (unlikely(!next_node)) in writecache_writeback()
2041 g = container_of(next_node, struct wc_entry, rb_node); in writecache_writeback()
2073 next_node = rb_next(&f->rb_node); in writecache_writeback()
2074 if (likely(next_node)) in writecache_writeback()
2075 g = container_of(next_node, struct wc_entry, rb_node); in writecache_writeback()
/linux/kernel/sched/
H A Ddeadline.c2694 struct rb_node *next_node; in pick_earliest_pushable_dl_task() local
2699 next_node = rb_first_cached(&rq->dl.pushable_dl_tasks_root); in pick_earliest_pushable_dl_task()
2700 while (next_node) { in pick_earliest_pushable_dl_task()
2701 p = __node_2_pdl(next_node); in pick_earliest_pushable_dl_task()
2706 next_node = rb_next(next_node); in pick_earliest_pushable_dl_task()
/linux/drivers/net/ethernet/intel/ice/
H A Dice_parser.h226 u16 next_node; /* Parser Node ID for the next round */ member

12