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

12

/linux-master/drivers/acpi/acpica/
H A Dnswalk.c80 struct acpi_namespace_node *next_node = NULL; local
84 next_node = acpi_ns_get_next_node(parent_node, child_node);
91 /* next_node is NULL if we are at the end-of-list */
93 return (next_node);
98 while (next_node) {
102 if (next_node->type == type) {
103 return (next_node);
108 next_node = next_node->peer;
H A Dnsalloc.c136 struct acpi_namespace_node *next_node; local
143 next_node = parent_node->child;
147 while (next_node != node) {
148 prev_node = next_node;
149 next_node = next_node->peer;
269 struct acpi_namespace_node *next_node; local
280 next_node = parent_node->child;
281 while (next_node) {
285 if (next_node
[all...]
H A Dnsnames.c200 struct acpi_namespace_node *next_node; local
225 next_node = node;
226 while (next_node && next_node != acpi_gbl_root_node) {
227 if (next_node != node) {
232 ACPI_MOVE_32_TO_32(name, &next_node->name);
244 next_node = next_node->parent;
H A Devregion.c826 struct acpi_namespace_node *next_node; local
855 next_node = acpi_ns_get_next_node(device_node, NULL);
856 while (next_node) {
857 if ((next_node->type == ACPI_TYPE_REGION) &&
858 (next_node->object) &&
859 (next_node->object->region.space_id == space_id)) {
863 next_node = acpi_ns_get_next_node(device_node, next_node);
/linux-master/drivers/net/ethernet/apm/xgene/
H A Dxgene_enet_cle.c97 SET_VAL(CLE_BR_NNODE, br->next_node) |
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...]
H A Dxgene_enet_cle.h204 u16 next_node; member in struct:xgene_cle_ptree_branch
/linux-master/fs/hfsplus/
H A Dbrec.c238 struct hfs_bnode *node, *new_node, *next_node; local
258 next_node = hfs_bnode_find(tree, node->next);
260 next_node = NULL;
262 if (IS_ERR(next_node)) {
265 return next_node;
281 if (next_node)
282 hfs_bnode_put(next_node);
337 if (next_node) {
338 next_node->prev = new_node->this;
339 hfs_bnode_read(next_node,
[all...]
H A Dbtree.c376 struct hfs_bnode *node, *next_node; local
432 next_node = hfs_bmap_new_bmap(node, idx);
434 next_node = hfs_bnode_find(tree, nidx);
436 if (IS_ERR(next_node))
437 return next_node;
438 node = next_node;
/linux-master/fs/hfs/
H A Dbrec.c234 struct hfs_bnode *node, *new_node, *next_node; local
254 next_node = hfs_bnode_find(tree, node->next);
256 next_node = NULL;
258 if (IS_ERR(next_node)) {
261 return next_node;
277 if (next_node)
278 hfs_bnode_put(next_node);
333 if (next_node) {
334 next_node->prev = new_node->this;
335 hfs_bnode_read(next_node,
[all...]
H A Dbtree.c252 struct hfs_bnode *node, *next_node; local
307 next_node = hfs_bmap_new_bmap(node, idx);
309 next_node = hfs_bnode_find(tree, nidx);
311 if (IS_ERR(next_node))
312 return next_node;
313 node = next_node;
/linux-master/include/linux/
H A Dassoc_array_priv.h67 struct assoc_array_ptr *next_node; member in struct:assoc_array_shortcut
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]);
452 return next_node(nid, node_states[N_MEMORY]);
/linux-master/lib/
H A Dassoc_array.c37 cursor = READ_ONCE(shortcut->next_node); /* Address dependency. */
282 cursor = READ_ONCE(shortcut->next_node); /* Address dependency. */
368 cursor = shortcut->next_node;
408 BUG_ON(shortcut->next_node != cursor);
708 edit->set[0].ptr = &assoc_array_ptr_to_shortcut(ptr)->next_node;
752 new_s0->next_node = assoc_array_node_to_ptr(new_n0);
859 new_s0->next_node = assoc_array_node_to_ptr(new_n0);
878 side = assoc_array_ptr_to_node(shortcut->next_node);
909 new_s1->next_node = shortcut->next_node;
[all...]
/linux-master/kernel/bpf/
H A Dlpm_trie.c617 struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root; local
678 next_node = parent;
698 next_node = node;
701 node = rcu_dereference(next_node->child[1]);
705 next_key->prefixlen = next_node->prefixlen;
707 next_node->data, trie->data_size);
/linux-master/tools/testing/memblock/tests/
H A Dalloc_exact_nid_api.c843 struct memblock_region *next_node = &memblock.memory.regions[nid_next]; local
854 r1.base = next_node->base;
915 struct memblock_region *next_node = &memblock.memory.regions[7]; local
924 r2.base = next_node->base + SZ_128;
H A Dalloc_nid_api.c2394 struct memblock_region *next_node = &memblock.memory.regions[nid_next]; local
2405 r1.base = next_node->base;
2465 struct memblock_region *next_node = &memblock.memory.regions[7]; local
2474 r2.base = next_node->base + SZ_128;
/linux-master/fs/ext4/
H A Ddir.c582 goto next_node;
614 next_node:
/linux-master/kernel/sched/
H A Ddeadline.c2197 struct rb_node *next_node; local
2202 next_node = rb_first_cached(&rq->dl.pushable_dl_tasks_root);
2204 next_node:
2205 if (next_node) {
2206 p = __node_2_pdl(next_node);
2211 next_node = rb_next(next_node);
2212 goto next_node;
/linux-master/drivers/md/
H A Ddm-writecache.c1948 struct rb_node *node, *next_node; local
2040 next_node = rb_next(&f->rb_node);
2041 if (unlikely(!next_node))
2043 g = container_of(next_node, struct wc_entry, rb_node);
2075 next_node = rb_next(&f->rb_node);
2076 if (likely(next_node))
2077 g = container_of(next_node, struct wc_entry, rb_node);
H A Ddm-integrity.c1355 struct journal_node *node, *next_node; local
1370 next_node = container_of(next, struct journal_node, node);
1371 return next_node->sector != sector;
1377 struct journal_node *next_node; local
1386 next_node = container_of(next, struct journal_node, node);
1388 if (next_node->sector != node->sector)
1391 next_section = (unsigned int)(next_node - ic->journal_tree) / ic->journal_section_entries;
/linux-master/drivers/block/mtip32xx/
H A Dmtip32xx.c3617 static int next_node = NUMA_NO_NODE; local
3619 if (next_node == NUMA_NO_NODE) {
3620 next_node = first_online_node;
3621 return next_node;
3624 next_node = next_online_node(next_node);
3625 if (next_node == MAX_NUMNODES)
3626 next_node = first_online_node;
3627 return next_node;
/linux-master/mm/
H A Dhugetlb.c1468 static int hstate_next_node_to_alloc(int *next_node, argument
1475 nid = get_valid_node_allowed(*next_node, nodes_allowed);
1476 *next_node = next_node_allowed(nid, nodes_allowed);
1499 #define for_each_node_mask_to_alloc(next_node, nr_nodes, node, mask) \
1502 ((node = hstate_next_node_to_alloc(next_node, mask)) || 1); \
2355 int *next_node)
2360 for_each_node_mask_to_alloc(next_node, nr_nodes, node, nodes_allowed) {
3545 int next_node = first_online_node; local
3552 &node_alloc_noretry, &next_node);
2352 alloc_pool_huge_folio(struct hstate *h, nodemask_t *nodes_allowed, nodemask_t *node_alloc_noretry, int *next_node) argument
/linux-master/Documentation/sphinx/
H A Dkfigure.py644 for n in node.next_node():
/linux-master/security/keys/
H A Dkeyring.c745 ptr = READ_ONCE(shortcut->next_node);
762 ptr = READ_ONCE(shortcut->next_node);
/linux-master/arch/sparc/kernel/
H A Dhead_32.S379 or %g0, %g0, %o0 ! next_node(0) = first_node

Completed in 983 milliseconds

12