hfscommon/Misc/VolumeAllocation.c

496  ;				be unmapped after the current transaction is written to disk.
1031 		//	Adding in the length of the current allocation might reduce the next allocate
1875 	register u_int32_t	block;			//	current block number
1876 	register u_int32_t	currentWord;	//	Pointer to current word within bitmap block
1921 	//	Set up the current position within the block
2261 	register u_int32_t	*currentWord;	//	Pointer to current word within bitmap block
2563  * Scan the bitmap block beyond end of current file system for bits
2568  * end of current file system during hfs_extendfs(), which makes
2571  * current file system are always marked as free, but there might
2663 					for current volume and whether they were allocated
2680 	u_int32_t	*currentWord;	//	Pointer to current word within bitmap block
2683 	u_int32_t	currentBit;		//	Bit index within word of current bit to allocate
2731 	// (up to the start of the current bitmap block).  Set unmapStart to
2852 	// (up to the end of the current bitmap block).
2961 				 * of the range to be deallocated is greater than the current high
3045 	u_int32_t			firstBlock;			//	First free block in current extent.
3047 	u_int32_t			foundBlocks;		//	Number of contiguous free blocks in current extent.
3122 			tempWord = SWAP_BE32(*currentWord);			//	Fetch the current word only once
3208 			tempWord = SWAP_BE32(*currentWord);			//	Fetch the current word only once
3423 	u_int32_t current;
3428 	for (current = start; current < end; current++) {
3430 		int rbtree = hfs_isrbtree_allocated(hfsmp, current, 1, &node1);
3431 		int bitmap = hfs_isallocated(hfsmp, current, 1);
3435 				  current, bitmap, rbtree);
3452 	extent_node_t *current = NULL;
3456 	current = extent_tree_off_first (tree);
3458 	while (current) {
3459 		next = current->offset_next;
3460 		treenext = extent_tree_off_next (tree, current);
3462 			panic("hfs_checktreelinks: mismatch for node (%p), next: %p , treenext %p !\n", current, next, treenext);
3464 		current = treenext;
3585 	u_int32_t  *currentWord;   // Pointer to current word within bitmap block
3935 	u_int32_t  *currentWord;   // Pointer to current word within bitmap block
4020  * read the most current version of the blocks that we're scanning.  If we used
4049 	 * This loop advances over all allocation bitmap blocks of the current region
4059 	 * scanning.  So when we re-grab the lock, our current EOF/loop will immediately skip us to the next
4067 		 * update our endBlock to match the current allocation limit in the hfsmp struct.
4190  * a re-scan of the new allocation blocks from our current allocLimit to the new end block.
4209 	 * it does not have any extents beyond end of current
4220 		/* Remover points to the current item to free/remove from the tree */
4281 			 * Remover is our "temp" pointer that points to the current node to remove from
4282 			 * the offset tree.  We'll simply iterate through the tree linked list, removing the current
4509 		 * If the current extent is entirely before or entirely after the
4517 		 * If the extent being removed entirely contains the current extent,
4518 		 * then remove the current extent.
4537 		 * current extent, then we need to split the current extent into
4551 		 * overlaps the start or end (but not both!) of the current extent.
4552 		 * So we need to replace the current extent with a shorter one.
4556 		 * was inserted after the current extent, then we need to re-examine
4564 			/* Remove the tail of the current extent. */
4567 			/* Remove the head of the current extent. */
4592  * If the extent provided has blocks beyond current allocLimit, it is
4631 	/* No need to add extent that is beyond current allocLimit */
4636 	/* If end of the free extent is beyond current allocLimit, clip the extent */