Lines Matching defs:next
60 * From a given extent_node_t, grab the next one. If no next exists, return NULL
70 * either grab the next node, if possible, or return NULL
175 extent_node_t *next = NULL;
180 next = node->offset_next;
183 node = next;
198 * Search the extent tree by offset, finding the next node in the tree
260 * From a given tree node (sorted by offset), get the next node in the tree.
295 extent_node_t *next = NULL;
319 * to update the next pointer for the linked list if applicable.
322 next = node->offset_next;
326 prev->offset_next = next;
332 /* The next pointer does not change since we keep the node in place */
421 extent_node_t *next = extent_tree_offset_next(offset_tree, newnode);
422 newnode->offset_next = next;
458 extent_node_t *next = NULL;
462 /* Insert our node into the tree, and coalesce with the next one if necessary */
467 next = node->offset_next;
474 /* Find the next entry in the tree, if applicable. */
475 next = extent_tree_offset_next(offset_tree, node);
476 node->offset_next = next;
489 /* Update the next pointer for the previous entry (if necessary) */