next_node
goto next_node;
next_node:
struct acpi_namespace_node *next_node;
next_node = acpi_ns_get_next_node(device_node, NULL);
while (next_node) {
if ((next_node->type == ACPI_TYPE_REGION) &&
(next_node->object) &&
(next_node->object->region.space_id == space_id)) {
next_node = acpi_ns_get_next_node(device_node, next_node);
struct acpi_namespace_node *next_node;
next_node = parent_node->child;
while (next_node != node) {
prev_node = next_node;
next_node = next_node->peer;
struct acpi_namespace_node *next_node;
next_node = parent_node->child;
while (next_node) {
if (next_node->child) {
parent_node, next_node));
node_to_delete = next_node;
next_node = next_node->peer;
struct acpi_namespace_node *next_node;
next_node = node;
while (next_node && next_node != acpi_gbl_root_node) {
if (next_node != node) {
ACPI_MOVE_32_TO_32(name, &next_node->name);
next_node = next_node->parent;
if (next_node->type == type) {
return (next_node);
next_node = next_node->peer;
struct acpi_namespace_node *next_node = NULL;
next_node = acpi_ns_get_next_node(parent_node, child_node);
return (next_node);
while (next_node) {
static int next_node = NUMA_NO_NODE;
if (next_node == NUMA_NO_NODE) {
next_node = first_online_node;
return next_node;
next_node = next_online_node(next_node);
if (next_node == MAX_NUMNODES)
next_node = first_online_node;
return next_node;
struct interval_tree_node *next_node;
next_node = interval_tree_iter_next(node, addr, last);
node = next_node;
struct journal_node *node, *next_node;
next_node = container_of(next, struct journal_node, node);
return next_node->sector != sector;
struct journal_node *next_node;
next_node = container_of(next, struct journal_node, node);
if (next_node->sector != node->sector)
next_section = (unsigned int)(next_node - ic->journal_tree) / ic->journal_section_entries;
struct rb_node *node, *next_node;
next_node = rb_next(&f->rb_node);
if (unlikely(!next_node))
g = container_of(next_node, struct wc_entry, rb_node);
next_node = rb_next(&f->rb_node);
if (likely(next_node))
g = container_of(next_node, struct wc_entry, rb_node);
.next_node = PKT_PROT_NODE,
.next_node = LAST_NODE,
.next_node = RSS_IPV4_TCP_NODE,
.next_node = RSS_IPV4_UDP_NODE,
.next_node = RSS_IPV4_OTHERS_NODE,
.next_node = RSS_IPV4_TCP_NODE,
.next_node = RSS_IPV4_TCP_NODE,
.next_node = RSS_IPV4_TCP_NODE,
.next_node = RSS_IPV4_TCP_NODE,
.next_node = RSS_IPV4_TCP_NODE,
.next_node = LAST_NODE,
.next_node = RSS_IPV4_UDP_NODE,
.next_node = RSS_IPV4_UDP_NODE,
.next_node = RSS_IPV4_UDP_NODE,
.next_node = RSS_IPV4_UDP_NODE,
.next_node = RSS_IPV4_UDP_NODE,
.next_node = LAST_NODE,
.next_node = RSS_IPV4_OTHERS_NODE,
.next_node = RSS_IPV4_OTHERS_NODE,
.next_node = RSS_IPV4_OTHERS_NODE,
.next_node = RSS_IPV4_OTHERS_NODE,
.next_node = RSS_IPV4_OTHERS_NODE,
.next_node = LAST_NODE,
.next_node = MAX_NODES,
SET_VAL(CLE_BR_NNODE, br->next_node) |
u16 next_node;
dev_info(dev, "\tnext_node = %d\n", action->next_node);
action->next_node = FIELD_GET(ICE_PGCA_NN, data);
u16 next_node; /* Parser Node ID for the next round */
ice_gpr_add(rt, ICE_GPR_NN_IDX, rt->action->next_node);
rt->action->next_node);
goto next_node;
next_node:
next_node:
goto next_node;
struct hfs_bnode *node, *new_node, *next_node;
next_node = hfs_bnode_find(tree, node->next);
next_node = NULL;
if (IS_ERR(next_node)) {
return next_node;
if (next_node)
hfs_bnode_put(next_node);
if (next_node) {
next_node->prev = new_node->this;
hfs_bnode_read(next_node, &node_desc, 0, sizeof(node_desc));
node_desc.prev = cpu_to_be32(next_node->prev);
hfs_bnode_write(next_node, &node_desc, 0, sizeof(node_desc));
hfs_bnode_put(next_node);
struct hfs_bnode *node, *next_node;
next_node = hfs_bmap_new_bmap(node, idx);
next_node = hfs_bnode_find(tree, nidx);
if (IS_ERR(next_node))
return next_node;
node = next_node;
struct hfs_bnode *node, *new_node, *next_node;
next_node = hfs_bnode_find(tree, node->next);
next_node = NULL;
if (IS_ERR(next_node)) {
return next_node;
if (next_node)
hfs_bnode_put(next_node);
if (next_node) {
next_node->prev = new_node->this;
hfs_bnode_read(next_node, &node_desc, 0, sizeof(node_desc));
node_desc.prev = cpu_to_be32(next_node->prev);
hfs_bnode_write(next_node, &node_desc, 0, sizeof(node_desc));
hfs_bnode_put(next_node);
struct hfs_bnode *node, *next_node;
next_node = hfs_bmap_new_bmap(node, idx);
next_node = hfs_bnode_find(tree, nidx);
if (IS_ERR(next_node))
return next_node;
node = next_node;
static void hfsplus_init_map_node(u8 *buf, u16 node_size, u32 next_node)
desc->next = cpu_to_be32(next_node);
u32 next_node;
next_node = be32_to_cpu(desc->next);
if (next_node >= map_nodes)
next_node = 0;
hfsplus_init_map_node(buf, node_size, next_node);
next_node++;
goto next_node;
next_node:
goto next_node;
next_node:
struct assoc_array_ptr *next_node;
(node) = next_node((node), (mask)))
return next_node(nid, node_states[N_ONLINE]);
return next_node(nid, node_states[N_MEMORY]);
struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root;
next_node = parent;
next_node = node;
node = rcu_dereference(next_node->child[1]);
next_key->prefixlen = next_node->prefixlen;
next_node->data, trie->data_size);
struct rb_node *next_node;
next_node = rb_first_cached(&rq->dl.pushable_dl_tasks_root);
while (next_node) {
p = __node_2_pdl(next_node);
next_node = rb_next(next_node);
struct rb_node *next_node;
next_node = rb_first_cached(&rq->dl.pushable_dl_tasks_root);
while (next_node) {
i = __node_2_pdl(next_node);
next_node = rb_next(next_node);
edit->set[1].ptr = &s->next_node;
new_ptr_pp = &new_s->next_node;
cursor = shortcut->next_node;
ptr = s->next_node;
cursor = READ_ONCE(shortcut->next_node); /* Address dependency. */
cursor = shortcut->next_node;
cursor = READ_ONCE(shortcut->next_node); /* Address dependency. */
BUG_ON(shortcut->next_node != cursor);
edit->set[0].ptr = &assoc_array_ptr_to_shortcut(ptr)->next_node;
new_s0->next_node = assoc_array_node_to_ptr(new_n0);
new_s0->next_node = assoc_array_node_to_ptr(new_n0);
side = assoc_array_ptr_to_node(shortcut->next_node);
new_s1->next_node = shortcut->next_node;
new_n0->slots[sc_slot] = shortcut->next_node;
int *next_node)
for_each_node_mask_to_alloc(next_node, nr_nodes, node, nodes_allowed) {
int next_node = first_online_node;
&node_alloc_noretry, &next_node);
static inline int hstate_next_node_to_alloc(int *next_node,
nid = get_valid_node_allowed(*next_node, nodes_allowed);
*next_node = next_node_allowed(nid, nodes_allowed);
#define for_each_node_mask_to_alloc(next_node, nr_nodes, node, mask) \
((node = hstate_next_node_to_alloc(next_node, mask)) || 1); \
nid = next_node(nid, nodemask);
ptr = READ_ONCE(shortcut->next_node);
ptr = READ_ONCE(shortcut->next_node);
struct memblock_region *next_node = &memblock.memory.regions[nid_next];
r1.base = next_node->base;
struct memblock_region *next_node = &memblock.memory.regions[7];
r2.base = next_node->base + SZ_128;
struct memblock_region *next_node = &memblock.memory.regions[nid_next];
r1.base = next_node->base;
struct memblock_region *next_node = &memblock.memory.regions[7];
r2.base = next_node->base + SZ_128;