hfscommon/Misc/VolumeAllocation.c

206 					allocation block's bit, and scans it from the starting bit until either the ending bit or
290 	u_int32_t		bit,
1250 	u_int32_t bit;
1260 	bit = VCBTOHFS(vcb)->hfs_metazone_start;
1261 	if (bit == 1)
1262 		bit = 0;
1268 	 *  Count all the bits from bit to lastbit.
1270 	while (bit < lastbit) {
1279 			if (ReadBitmapBlock(vcb, bit, &currCache, &blockRef) != 0) {
1288 		bit += kBitsPerByte;
1299  * Obtain the next allocation block (bit) that's
1304 	u_int32_t		bit)
1309 		return (bit);
1313 	if ((bit >= hfsmp->hfs_metazone_start) &&
1314 	    (bit <= hfsmp->hfs_metazone_end)) {
1315 		bit = hfsmp->hfs_metazone_end + 1;
1317 	return (bit);
1327 ;			block (bit).  Return a pointer to the bitmap block.
1331 ;	bit			--	Allocation block whose bitmap block is desired
1340 	u_int32_t		bit,
1351 		KERNEL_DEBUG_CONSTANT(HFSDBG_READ_BITMAP_BLOCK | DBG_FUNC_START, bit, 0, 0, 0, 0);
1359 	block = (daddr64_t)(bit / (blockSize * kBitsPerByte));
1944 		//	Next bit
2015 		//	Next bit
2264 	u_int32_t		firstBit;		//	Bit index within word of first bit to allocate
2491 	 * destruction of rb-tree.  Set the persistent error-detected bit in the mount point.
2598 	 * Calculate the first bit in the bitmap block next to
2599 	 * the bitmap block containing the bit for startingBlock.
2617 	 * Check a full bitmap block for any 'used' bit.  If any bit is used,
2623 	 * marks entire bitmap block as free only if any bit in that bitmap
2626 	 * caller-specified last bit and if any bit is set, only mark that
2683 	u_int32_t	currentBit;		//	Bit index within word of current bit to allocate
2738 		// Move currentWord/bitMask back by one bit
2860 		// Move currentWord/bitMask/wordsLeft forward one bit
2985 	 * back off, destroy the trees, and persistently set a bit in the runtime hfsmp flags
3130 			//	Did we find an unused bit (bitMask != 0), or run out of bits (bitMask == 0)?
3171 				//	Figure out which bit is clear
3179 				break;		//	Found the free bit; break out to FoundUnused.
3189 		//	Make sure the unused bit is early enough to use
3216 			//	Did we find a used bit (bitMask != 0), or run out of bits (bitMask == 0)?
3259 				//	Figure out which bit is set
3267 				break;		//	Found the used bit; break out to FoundUsed.
3541  * Count number of bits set in the given 32-bit unsigned number
3588 	u_int32_t  firstBit;       // Bit index within word of first bit to allocate
3812  * startbit		- the allocation block represented by a bit in 'allocblock' where we need to
3816  * bitToScan	- output argument for this function to specify the next bit to scan.
3839 	 * figures out which actual on-disk block corresponds to the bit we're
3895 			 * Exit early if the next bit we'd analyze would take us beyond the end of the
3928  * one bit is active, and that we're going to pass in the buf to use, since GenerateTree
3937 	u_int32_t  firstBit;       // Bit index within word of first bit to allocate
4058 	 * variable as well, since it will use the same hfs_alloc_scan_block function to do its bit
4091 		 *		unset tree-in-progress bit.