Lines Matching defs:next
192 Checks the embedded linked list structure of the red black tree for integrity. The next pointer
906 // next block to allocate from.
1031 // Adding in the length of the current allocation might reduce the next allocate
1272 * Get next bitmap block.
1299 * Obtain the next allocation block (bit) that's
1668 * Otherwise, start from the end of the metadata zone or our next allocation pointer,
2010 // Move to the next block. If no more, then exit.
2325 ++currentWord; // move to next word
2336 // Read in the next bitmap block
2337 startingBlock += bitsPerBlock; // generate a block number in the next bitmap block
2363 ++currentWord; // move to next word
2374 // Read in the next bitmap block
2375 startingBlock += bitsPerBlock; // generate a block number in the next bitmap block
2493 * not allow the rb-tree to be used. On next mount, we will force a re-construction from
2598 * Calculate the first bit in the bitmap block next to
2775 ++currentWord; // move to next word
2785 // Read in the next bitmap block
2786 startingBlock += bitsPerBlock; // generate a block number in the next bitmap block
2811 ++currentWord; // move to next word
2822 // Read in the next bitmap block
2823 startingBlock += bitsPerBlock; // generate a block number in the next bitmap block
2986 * to indicate we should not use the rb-tree until next mount, when we can force a rebuild.
3182 // Keep looking at the next word
3270 // Keep looking at the next word
3331 // we've seen so on the next mount we won't rescan unnecessarily
3444 * embedded within each of the nodes accurately points to the correct node as its "next" pointer.
3453 extent_node_t *next = NULL;
3459 next = current->offset_next;
3461 if (next != treenext) {
3462 panic("hfs_checktreelinks: mismatch for node (%p), next: %p , treenext %p !\n", current, next, treenext);
3528 * at least one block in the target range is allocated since the next node's offset
3649 /* Read in the next bitmap block. */
3681 /* Read in the next bitmap block */
3816 * bitToScan - output argument for this function to specify the next bit to scan.
3895 * Exit early if the next bit we'd analyze would take us beyond the end of the
3914 * curAllocBlock represents the next block we need to scan while we're in this
4059 * scanning. So when we re-grab the lock, our current EOF/loop will immediately skip us to the next
4237 * Find the previous entry and update its next pointer to NULL
4274 panic ("UpdateAllocLimit: Invalid RBTree node next ptr!");
4286 extent_node_t *next = remover->offset_next;
4289 remover = next;
4526 * to undo the loop's "++i", and the next iteration will
4527 * examine index i again, which contains the next extent
4665 * to undo the loop's "++i", and the next iteration will
4666 * examine index i again, which contains the next extent