/* * Copyright (c) 2000-2007 Apple Inc. All rights reserved. * * @APPLE_OSREFERENCE_LICENSE_HEADER_START@ * * This file contains Original Code and/or Modifications of Original Code * as defined in and that are subject to the Apple Public Source License * Version 2.0 (the 'License'). You may not use this file except in * compliance with the License. The rights granted to you under the License * may not be used to create, or enable the creation or redistribution of, * unlawful or unlicensed copies of an Apple operating system, or to * circumvent, violate, or enable the circumvention or violation of, any * terms of an Apple operating system software license agreement. * * Please obtain a copy of the License at * http://www.opensource.apple.com/apsl/ and read it before using this file. * * The Original Code and all software distributed under the License are * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. * Please see the License for the specific language governing rights and * limitations under the License. * * @APPLE_OSREFERENCE_LICENSE_HEADER_END@ */ /* File: VolumeAllocation.c Contains: Routines for accessing and modifying the volume bitmap. Version: HFS Plus 1.0 Copyright: © 1996-2001 by Apple Computer, Inc., all rights reserved. */ /* Public routines: BlockAllocate Allocate space on a volume. Can allocate space contiguously. If not contiguous, then allocation may be less than what was asked for. Returns the starting block number, and number of blocks. (Will only do a single extent???) BlockDeallocate Deallocate a contiguous run of allocation blocks. Internal routines: BlockMarkFree Mark a contiguous range of blocks as free. The corresponding bits in the volume bitmap will be cleared. BlockMarkAllocated Mark a contiguous range of blocks as allocated. The cor- responding bits in the volume bitmap are set. Also tests to see if any of the blocks were previously unallocated. FindContiguous Find a contiguous range of blocks of a given size. The caller specifies where to begin the search (by block number). The block number of the first block in the range is returned. BlockAllocateAny Find and allocate a contiguous range of blocks up to a given size. The first range of contiguous free blocks found are allocated, even if there are fewer blocks than requested (and even if a contiguous range of blocks of the given size exists elsewhere). BlockAllocateContig Find and allocate a contiguous range of blocks of a given size. If a contiguous range of free blocks of the given size isn't found, then the allocation fails (i.e. it is "all or nothing"). BlockAllocateKnown Try to allocate space from known free space in the volume's free extent cache. ReadBitmapBlock Given an allocation block number, read the bitmap block that contains that allocation block into a caller-supplied buffer. ReleaseBitmapBlock Release a bitmap block back into the buffer cache. */ #include "../../hfs_macos_defs.h" #include #include #include #include #include "../../hfs.h" #include "../../hfs_dbg.h" #include "../../hfs_format.h" #include "../../hfs_endian.h" #include "../headers/FileMgrInternal.h" enum { kBytesPerWord = 4, kBitsPerByte = 8, kBitsPerWord = 32, kBitsWithinWordMask = kBitsPerWord-1 }; #define kLowBitInWordMask 0x00000001ul #define kHighBitInWordMask 0x80000000ul #define kAllBitsSetInWord 0xFFFFFFFFul static OSErr ReadBitmapBlock( ExtendedVCB *vcb, u_int32_t bit, u_int32_t **buffer, u_int32_t *blockRef); static OSErr ReleaseBitmapBlock( ExtendedVCB *vcb, u_int32_t blockRef, Boolean dirty); static OSErr BlockAllocateAny( ExtendedVCB *vcb, u_int32_t startingBlock, u_int32_t endingBlock, u_int32_t maxBlocks, Boolean useMetaZone, u_int32_t *actualStartBlock, u_int32_t *actualNumBlocks); static OSErr BlockAllocateContig( ExtendedVCB *vcb, u_int32_t startingBlock, u_int32_t minBlocks, u_int32_t maxBlocks, Boolean useMetaZone, u_int32_t *actualStartBlock, u_int32_t *actualNumBlocks); static OSErr BlockFindContiguous( ExtendedVCB *vcb, u_int32_t startingBlock, u_int32_t endingBlock, u_int32_t minBlocks, u_int32_t maxBlocks, Boolean useMetaZone, u_int32_t *actualStartBlock, u_int32_t *actualNumBlocks); static OSErr BlockAllocateKnown( ExtendedVCB *vcb, u_int32_t maxBlocks, u_int32_t *actualStartBlock, u_int32_t *actualNumBlocks); /* ;________________________________________________________________________________ ; ; Routine: BlkAlloc ; ; Function: Allocate space on a volume. If contiguous allocation is requested, ; at least the requested number of bytes will be allocated or an ; error will be returned. If contiguous allocation is not forced, ; the space will be allocated at the first free fragment following ; the requested starting allocation block. If there is not enough ; room there, a block of less than the requested size will be ; allocated. ; ; If the requested starting block is 0 (for new file allocations), ; the volume's allocation block pointer will be used as a starting ; point. ; ; Input Arguments: ; vcb - Pointer to ExtendedVCB for the volume to allocate space on ; fcb - Pointer to FCB for the file for which storage is being allocated ; startingBlock - Preferred starting allocation block, 0 = no preference ; forceContiguous - Force contiguous flag - if bit 0 set (NE), allocation is contiguous ; or an error is returned ; useMetaZone - ; minBlocks - Number of blocks requested. If the allocation is non-contiguous, ; less than this may actually be allocated ; maxBlocks - The maximum number of blocks to allocate. If there is additional free ; space after bytesRequested, then up to maxBlocks bytes should really ; be allocated. (Used by ExtendFileC to round up allocations to a multiple ; of the file's clump size.) ; ; Output: ; (result) - Error code, zero for successful allocation ; *startBlock - Actual starting allocation block ; *actualBlocks - Actual number of allocation blocks allocated ; ; Side effects: ; The volume bitmap is read and updated; the volume bitmap cache may be changed. ;________________________________________________________________________________ */ __private_extern__ OSErr BlockAllocate ( ExtendedVCB *vcb, /* which volume to allocate space on */ u_int32_t startingBlock, /* preferred starting block, or 0 for no preference */ u_int32_t minBlocks, /* desired number of blocks to allocate */ u_int32_t maxBlocks, /* maximum number of blocks to allocate */ Boolean forceContiguous, /* non-zero to force contiguous allocation and to force */ /* minBlocks bytes to actually be allocated */ Boolean useMetaZone, u_int32_t *actualStartBlock, /* actual first block of allocation */ u_int32_t *actualNumBlocks) /* number of blocks actually allocated; if forceContiguous */ /* was zero, then this may represent fewer than minBlocks */ { u_int32_t freeBlocks; OSErr err; Boolean updateAllocPtr = false; // true if nextAllocation needs to be updated // // Initialize outputs in case we get an error // *actualStartBlock = 0; *actualNumBlocks = 0; freeBlocks = hfs_freeblks(VCBTOHFS(vcb), 0); // // If the disk is already full, don't bother. // if (freeBlocks == 0) { err = dskFulErr; goto Exit; } if (forceContiguous && freeBlocks < minBlocks) { err = dskFulErr; goto Exit; } /* * Clip if necessary so we don't over-subscribe the free blocks. */ if (minBlocks > freeBlocks) { minBlocks = freeBlocks; } if (maxBlocks > freeBlocks) { maxBlocks = freeBlocks; } // // If caller didn't specify a starting block number, then use the volume's // next block to allocate from. // if (startingBlock == 0) { HFS_MOUNT_LOCK(vcb, TRUE); startingBlock = vcb->nextAllocation; HFS_MOUNT_UNLOCK(vcb, TRUE); updateAllocPtr = true; } if (startingBlock >= vcb->allocLimit) { startingBlock = 0; /* overflow so start at beginning */ } // // If the request must be contiguous, then find a sequence of free blocks // that is long enough. Otherwise, find the first free block. // if (forceContiguous) { err = BlockAllocateContig(vcb, startingBlock, minBlocks, maxBlocks, useMetaZone, actualStartBlock, actualNumBlocks); /* * If we allocated from a new position then * also update the roving allocator. */ if ((err == noErr) && (*actualStartBlock > startingBlock) && ((*actualStartBlock < VCBTOHFS(vcb)->hfs_metazone_start) || (*actualStartBlock > VCBTOHFS(vcb)->hfs_metazone_end))) { HFS_MOUNT_LOCK(vcb, TRUE); HFS_UPDATE_NEXT_ALLOCATION(vcb, *actualStartBlock); HFS_MOUNT_UNLOCK(vcb, TRUE); } } else { /* * Scan the bitmap once, gather the N largest free extents, then * allocate from these largest extents. Repeat as needed until * we get all the space we needed. We could probably build up * that list when the higher level caller tried (and failed) a * contiguous allocation first. */ err = BlockAllocateKnown(vcb, maxBlocks, actualStartBlock, actualNumBlocks); if (err == dskFulErr) err = BlockAllocateAny(vcb, startingBlock, vcb->allocLimit, maxBlocks, useMetaZone, actualStartBlock, actualNumBlocks); if (err == dskFulErr) err = BlockAllocateAny(vcb, 1, startingBlock, maxBlocks, useMetaZone, actualStartBlock, actualNumBlocks); } Exit: // if we actually allocated something then go update the // various bits of state that we maintain regardless of // whether there was an error (i.e. partial allocations // still need to update things like the free block count). // if (*actualNumBlocks != 0) { // // If we used the volume's roving allocation pointer, then we need to update it. // Adding in the length of the current allocation might reduce the next allocate // call by avoiding a re-scan of the already allocated space. However, the clump // just allocated can quite conceivably end up being truncated or released when // the file is closed or its EOF changed. Leaving the allocation pointer at the // start of the last allocation will avoid unnecessary fragmentation in this case. // HFS_MOUNT_LOCK(vcb, TRUE); if (updateAllocPtr && ((*actualStartBlock < VCBTOHFS(vcb)->hfs_metazone_start) || (*actualStartBlock > VCBTOHFS(vcb)->hfs_metazone_end))) { HFS_UPDATE_NEXT_ALLOCATION(vcb, *actualStartBlock); } // // Update the number of free blocks on the volume // vcb->freeBlocks -= *actualNumBlocks; MarkVCBDirty(vcb); HFS_MOUNT_UNLOCK(vcb, TRUE); hfs_generate_volume_notifications(VCBTOHFS(vcb)); } return err; } /* ;________________________________________________________________________________ ; ; Routine: BlkDealloc ; ; Function: Update the bitmap to deallocate a run of disk allocation blocks ; ; Input Arguments: ; vcb - Pointer to ExtendedVCB for the volume to free space on ; firstBlock - First allocation block to be freed ; numBlocks - Number of allocation blocks to free up (must be > 0!) ; ; Output: ; (result) - Result code ; ; Side effects: ; The volume bitmap is read and updated; the volume bitmap cache may be changed. ;________________________________________________________________________________ */ __private_extern__ OSErr BlockDeallocate ( ExtendedVCB *vcb, // Which volume to deallocate space on u_int32_t firstBlock, // First block in range to deallocate u_int32_t numBlocks) // Number of contiguous blocks to deallocate { OSErr err; // // If no blocks to deallocate, then exit early // if (numBlocks == 0) { err = noErr; goto Exit; } // // Call internal routine to free the sequence of blocks // err = BlockMarkFree(vcb, firstBlock, numBlocks); if (err) goto Exit; // // Update the volume's free block count, and mark the VCB as dirty. // HFS_MOUNT_LOCK(vcb, TRUE); vcb->freeBlocks += numBlocks; if (vcb->nextAllocation == (firstBlock + numBlocks)) HFS_UPDATE_NEXT_ALLOCATION(vcb, (vcb->nextAllocation - numBlocks)); MarkVCBDirty(vcb); HFS_MOUNT_UNLOCK(vcb, TRUE); hfs_generate_volume_notifications(VCBTOHFS(vcb)); Exit: return err; } u_int8_t freebitcount[16] = { 4, 3, 3, 2, 3, 2, 2, 1, /* 0 1 2 3 4 5 6 7 */ 3, 2, 2, 1, 2, 1, 1, 0, /* 8 9 A B C D E F */ }; __private_extern__ u_int32_t MetaZoneFreeBlocks(ExtendedVCB *vcb) { u_int32_t freeblocks; u_int32_t *currCache; u_int32_t blockRef; u_int32_t bit; u_int32_t lastbit; int bytesleft; int bytesperblock; u_int8_t byte; u_int8_t *buffer; blockRef = 0; bytesleft = freeblocks = 0; buffer = NULL; bit = VCBTOHFS(vcb)->hfs_metazone_start; if (bit == 1) bit = 0; lastbit = VCBTOHFS(vcb)->hfs_metazone_end; bytesperblock = vcb->vcbVBMIOSize; /* * Count all the bits from bit to lastbit. */ while (bit < lastbit) { /* * Get next bitmap block. */ if (bytesleft == 0) { if (blockRef) { (void) ReleaseBitmapBlock(vcb, blockRef, false); blockRef = 0; } if (ReadBitmapBlock(vcb, bit, &currCache, &blockRef) != 0) { return (0); } buffer = (u_int8_t *)currCache; bytesleft = bytesperblock; } byte = *buffer++; freeblocks += freebitcount[byte & 0x0F]; freeblocks += freebitcount[(byte >> 4) & 0x0F]; bit += kBitsPerByte; --bytesleft; } if (blockRef) (void) ReleaseBitmapBlock(vcb, blockRef, false); return (freeblocks); } /* * Obtain the next allocation block (bit) that's * outside the metadata allocation zone. */ static u_int32_t NextBitmapBlock( ExtendedVCB *vcb, u_int32_t bit) { struct hfsmount *hfsmp = VCBTOHFS(vcb); if ((hfsmp->hfs_flags & HFS_METADATA_ZONE) == 0) return (bit); /* * Skip over metadata allocation zone. */ if ((bit >= hfsmp->hfs_metazone_start) && (bit <= hfsmp->hfs_metazone_end)) { bit = hfsmp->hfs_metazone_end + 1; } return (bit); } /* ;_______________________________________________________________________ ; ; Routine: ReadBitmapBlock ; ; Function: Read in a bitmap block corresponding to a given allocation ; block (bit). Return a pointer to the bitmap block. ; ; Inputs: ; vcb -- Pointer to ExtendedVCB ; bit -- Allocation block whose bitmap block is desired ; ; Outputs: ; buffer -- Pointer to bitmap block corresonding to "block" ; blockRef ;_______________________________________________________________________ */ static OSErr ReadBitmapBlock( ExtendedVCB *vcb, u_int32_t bit, u_int32_t **buffer, u_int32_t *blockRef) { OSErr err; struct buf *bp = NULL; struct vnode *vp = NULL; daddr64_t block; u_int32_t blockSize; /* * volume bitmap blocks are protected by the allocation file lock */ REQUIRE_FILE_LOCK(vcb->hfs_allocation_vp, false); blockSize = (u_int32_t)vcb->vcbVBMIOSize; block = (daddr64_t)(bit / (blockSize * kBitsPerByte)); if (vcb->vcbSigWord == kHFSPlusSigWord) { vp = vcb->hfs_allocation_vp; /* use allocation file vnode */ } else /* hfs */ { vp = VCBTOHFS(vcb)->hfs_devvp; /* use device I/O vnode */ block += vcb->vcbVBMSt; /* map to physical block */ } err = (int)buf_meta_bread(vp, block, blockSize, NOCRED, &bp); if (bp) { if (err) { buf_brelse(bp); *blockRef = 0; *buffer = NULL; } else { *blockRef = (u_int32_t)bp; *buffer = (u_int32_t *)buf_dataptr(bp); } } return err; } /* ;_______________________________________________________________________ ; ; Routine: ReleaseBitmapBlock ; ; Function: Relase a bitmap block. ; ; Inputs: ; vcb ; blockRef ; dirty ;_______________________________________________________________________ */ static OSErr ReleaseBitmapBlock( ExtendedVCB *vcb, u_int32_t blockRef, Boolean dirty) { struct buf *bp = (struct buf *)blockRef; if (blockRef == 0) { if (dirty) panic("ReleaseBitmapBlock: missing bp"); return (0); } if (bp) { if (dirty) { // XXXdbg struct hfsmount *hfsmp = VCBTOHFS(vcb); if (hfsmp->jnl) { journal_modify_block_end(hfsmp->jnl, bp, NULL, NULL); } else { buf_bdwrite(bp); } } else { buf_brelse(bp); } } return (0); } /* _______________________________________________________________________ Routine: BlockAllocateContig Function: Allocate a contiguous group of allocation blocks. The allocation is all-or-nothing. The caller guarantees that there are enough free blocks (though they may not be contiguous, in which case this call will fail). Inputs: vcb Pointer to volume where space is to be allocated startingBlock Preferred first block for allocation minBlocks Minimum number of contiguous blocks to allocate maxBlocks Maximum number of contiguous blocks to allocate useMetaZone Outputs: actualStartBlock First block of range allocated, or 0 if error actualNumBlocks Number of blocks allocated, or 0 if error _______________________________________________________________________ */ static OSErr BlockAllocateContig( ExtendedVCB *vcb, u_int32_t startingBlock, u_int32_t minBlocks, u_int32_t maxBlocks, Boolean useMetaZone, u_int32_t *actualStartBlock, u_int32_t *actualNumBlocks) { OSErr err; // // Find a contiguous group of blocks at least minBlocks long. // Determine the number of contiguous blocks available (up // to maxBlocks). // /* * NOTE: If the only contiguous free extent of at least minBlocks * crosses startingBlock (i.e. starts before, ends after), then we * won't find it. Earlier versions *did* find this case by letting * the second search look past startingBlock by minBlocks. But * with the free extent cache, this can lead to duplicate entries * in the cache, causing the same blocks to be allocated twice. */ err = BlockFindContiguous(vcb, startingBlock, vcb->allocLimit, minBlocks, maxBlocks, useMetaZone, actualStartBlock, actualNumBlocks); if (err == dskFulErr && startingBlock != 0) { /* * Constrain the endingBlock so we don't bother looking for ranges * that would overlap those found in the previous call. */ err = BlockFindContiguous(vcb, 1, startingBlock, minBlocks, maxBlocks, useMetaZone, actualStartBlock, actualNumBlocks); } // // Now mark those blocks allocated. // if (err == noErr) err = BlockMarkAllocated(vcb, *actualStartBlock, *actualNumBlocks); return err; } /* _______________________________________________________________________ Routine: BlockAllocateAny Function: Allocate one or more allocation blocks. If there are fewer free blocks than requested, all free blocks will be allocated. The caller guarantees that there is at least one free block. Inputs: vcb Pointer to volume where space is to be allocated startingBlock Preferred first block for allocation endingBlock Last block to check + 1 maxBlocks Maximum number of contiguous blocks to allocate useMetaZone Outputs: actualStartBlock First block of range allocated, or 0 if error actualNumBlocks Number of blocks allocated, or 0 if error _______________________________________________________________________ */ static OSErr BlockAllocateAny( ExtendedVCB *vcb, u_int32_t startingBlock, register u_int32_t endingBlock, u_int32_t maxBlocks, Boolean useMetaZone, u_int32_t *actualStartBlock, u_int32_t *actualNumBlocks) { OSErr err; register u_int32_t block; // current block number register u_int32_t currentWord; // Pointer to current word within bitmap block register u_int32_t bitMask; // Word with given bits already set (ready to OR in) register u_int32_t wordsLeft; // Number of words left in this bitmap block u_int32_t *buffer = NULL; u_int32_t *currCache = NULL; u_int32_t blockRef; u_int32_t bitsPerBlock; u_int32_t wordsPerBlock; Boolean dirty = false; struct hfsmount *hfsmp = VCBTOHFS(vcb); /* * When we're skipping the metadata zone and the start/end * range overlaps with the metadata zone then adjust the * start to be outside of the metadata zone. If the range * is entirely inside the metadata zone then we can deny the * request (dskFulErr). */ if (!useMetaZone && (vcb->hfs_flags & HFS_METADATA_ZONE)) { if (startingBlock <= vcb->hfs_metazone_end) { if (endingBlock > (vcb->hfs_metazone_end + 2)) startingBlock = vcb->hfs_metazone_end + 1; else { err = dskFulErr; goto Exit; } } } // Since this routine doesn't wrap around if (maxBlocks > (endingBlock - startingBlock)) { maxBlocks = endingBlock - startingBlock; } // // Pre-read the first bitmap block // err = ReadBitmapBlock(vcb, startingBlock, &currCache, &blockRef); if (err != noErr) goto Exit; buffer = currCache; // // Set up the current position within the block // { u_int32_t wordIndexInBlock; bitsPerBlock = vcb->vcbVBMIOSize * kBitsPerByte; wordsPerBlock = vcb->vcbVBMIOSize / kBytesPerWord; wordIndexInBlock = (startingBlock & (bitsPerBlock-1)) / kBitsPerWord; buffer += wordIndexInBlock; wordsLeft = wordsPerBlock - wordIndexInBlock; currentWord = SWAP_BE32 (*buffer); bitMask = kHighBitInWordMask >> (startingBlock & kBitsWithinWordMask); } // // Find the first unallocated block // block=startingBlock; while (block < endingBlock) { if ((currentWord & bitMask) == 0) break; // Next bit ++block; bitMask >>= 1; if (bitMask == 0) { // Next word bitMask = kHighBitInWordMask; ++buffer; if (--wordsLeft == 0) { // Next block buffer = currCache = NULL; err = ReleaseBitmapBlock(vcb, blockRef, false); if (err != noErr) goto Exit; /* * Skip over metadata blocks. */ if (!useMetaZone) { block = NextBitmapBlock(vcb, block); } if (block >= endingBlock) { err = dskFulErr; goto Exit; } err = ReadBitmapBlock(vcb, block, &currCache, &blockRef); if (err != noErr) goto Exit; buffer = currCache; wordsLeft = wordsPerBlock; } currentWord = SWAP_BE32 (*buffer); } } // Did we get to the end of the bitmap before finding a free block? // If so, then couldn't allocate anything. if (block >= endingBlock) { err = dskFulErr; goto Exit; } // Return the first block in the allocated range *actualStartBlock = block; dirty = true; // If we could get the desired number of blocks before hitting endingBlock, // then adjust endingBlock so we won't keep looking. Ideally, the comparison // would be (block + maxBlocks) < endingBlock, but that could overflow. The // comparison below yields identical results, but without overflow. if (block < (endingBlock-maxBlocks)) { endingBlock = block + maxBlocks; // if we get this far, we've found enough } // XXXdbg if (hfsmp->jnl) { journal_modify_block_start(hfsmp->jnl, (struct buf *)blockRef); } // // Allocate all of the consecutive blocks // while ((currentWord & bitMask) == 0) { // Allocate this block currentWord |= bitMask; // Move to the next block. If no more, then exit. ++block; if (block == endingBlock) break; // Next bit bitMask >>= 1; if (bitMask == 0) { *buffer = SWAP_BE32 (currentWord); // update value in bitmap // Next word bitMask = kHighBitInWordMask; ++buffer; if (--wordsLeft == 0) { // Next block buffer = currCache = NULL; err = ReleaseBitmapBlock(vcb, blockRef, true); if (err != noErr) goto Exit; /* * Skip over metadata blocks. */ if (!useMetaZone) { u_int32_t nextBlock; nextBlock = NextBitmapBlock(vcb, block); if (nextBlock != block) { goto Exit; /* allocation gap, so stop */ } } err = ReadBitmapBlock(vcb, block, &currCache, &blockRef); if (err != noErr) goto Exit; buffer = currCache; // XXXdbg if (hfsmp->jnl) { journal_modify_block_start(hfsmp->jnl, (struct buf *)blockRef); } wordsLeft = wordsPerBlock; } currentWord = SWAP_BE32 (*buffer); } } *buffer = SWAP_BE32 (currentWord); // update the last change Exit: if (err == noErr) { *actualNumBlocks = block - *actualStartBlock; // sanity check if ((*actualStartBlock + *actualNumBlocks) > vcb->allocLimit) panic("BlockAllocateAny: allocation overflow on \"%s\"", vcb->vcbVN); } else { *actualStartBlock = 0; *actualNumBlocks = 0; } if (currCache) (void) ReleaseBitmapBlock(vcb, blockRef, dirty); return err; } /* _______________________________________________________________________ Routine: BlockAllocateKnown Function: Try to allocate space from known free space in the free extent cache. Inputs: vcb Pointer to volume where space is to be allocated maxBlocks Maximum number of contiguous blocks to allocate Outputs: actualStartBlock First block of range allocated, or 0 if error actualNumBlocks Number of blocks allocated, or 0 if error Returns: dskFulErr Free extent cache is empty _______________________________________________________________________ */ static OSErr BlockAllocateKnown( ExtendedVCB *vcb, u_int32_t maxBlocks, u_int32_t *actualStartBlock, u_int32_t *actualNumBlocks) { OSErr err; u_int32_t i; u_int32_t foundBlocks; u_int32_t newStartBlock, newBlockCount; if (vcb->vcbFreeExtCnt == 0) return dskFulErr; // Just grab up to maxBlocks of the first (largest) free exent. *actualStartBlock = vcb->vcbFreeExt[0].startBlock; foundBlocks = vcb->vcbFreeExt[0].blockCount; if (foundBlocks > maxBlocks) foundBlocks = maxBlocks; *actualNumBlocks = foundBlocks; // Adjust the start and length of that extent. newStartBlock = vcb->vcbFreeExt[0].startBlock + foundBlocks; newBlockCount = vcb->vcbFreeExt[0].blockCount - foundBlocks; // The first extent might not be the largest anymore. Bubble up any // (now larger) extents to the top of the list. for (i=1; ivcbFreeExtCnt; ++i) { if (vcb->vcbFreeExt[i].blockCount > newBlockCount) { vcb->vcbFreeExt[i-1].startBlock = vcb->vcbFreeExt[i].startBlock; vcb->vcbFreeExt[i-1].blockCount = vcb->vcbFreeExt[i].blockCount; } else { break; } } // If this is now the smallest known free extent, then it might be smaller than // other extents we didn't keep track of. So, just forget about this extent. // After the previous loop, (i-1) is the index of the extent we just allocated from. if (i == vcb->vcbFreeExtCnt) { // It's now the smallest extent, so forget about it --vcb->vcbFreeExtCnt; } else { // It's not the smallest, so store it in its proper place vcb->vcbFreeExt[i-1].startBlock = newStartBlock; vcb->vcbFreeExt[i-1].blockCount = newBlockCount; } // sanity check if ((*actualStartBlock + *actualNumBlocks) > vcb->allocLimit) { printf ("hfs: BlockAllocateKnown() found allocation overflow on \"%s\"", vcb->vcbVN); hfs_mark_volume_inconsistent(vcb); *actualStartBlock = 0; *actualNumBlocks = 0; err = EIO; } else { // // Now mark the found extent in the bitmap // err = BlockMarkAllocated(vcb, *actualStartBlock, *actualNumBlocks); } return err; } /* _______________________________________________________________________ Routine: BlockMarkAllocated Function: Mark a contiguous group of blocks as allocated (set in the bitmap). It assumes those bits are currently marked deallocated (clear in the bitmap). Inputs: vcb Pointer to volume where space is to be allocated startingBlock First block number to mark as allocated numBlocks Number of blocks to mark as allocated _______________________________________________________________________ */ __private_extern__ OSErr BlockMarkAllocated( ExtendedVCB *vcb, u_int32_t startingBlock, register u_int32_t numBlocks) { OSErr err; register u_int32_t *currentWord; // Pointer to current word within bitmap block register u_int32_t wordsLeft; // Number of words left in this bitmap block register u_int32_t bitMask; // Word with given bits already set (ready to OR in) u_int32_t firstBit; // Bit index within word of first bit to allocate u_int32_t numBits; // Number of bits in word to allocate u_int32_t *buffer = NULL; u_int32_t blockRef; u_int32_t bitsPerBlock; u_int32_t wordsPerBlock; // XXXdbg struct hfsmount *hfsmp = VCBTOHFS(vcb); // // Pre-read the bitmap block containing the first word of allocation // err = ReadBitmapBlock(vcb, startingBlock, &buffer, &blockRef); if (err != noErr) goto Exit; // // Initialize currentWord, and wordsLeft. // { u_int32_t wordIndexInBlock; bitsPerBlock = vcb->vcbVBMIOSize * kBitsPerByte; wordsPerBlock = vcb->vcbVBMIOSize / kBytesPerWord; wordIndexInBlock = (startingBlock & (bitsPerBlock-1)) / kBitsPerWord; currentWord = buffer + wordIndexInBlock; wordsLeft = wordsPerBlock - wordIndexInBlock; } // XXXdbg if (hfsmp->jnl) { journal_modify_block_start(hfsmp->jnl, (struct buf *)blockRef); } // // If the first block to allocate doesn't start on a word // boundary in the bitmap, then treat that first word // specially. // firstBit = startingBlock % kBitsPerWord; if (firstBit != 0) { bitMask = kAllBitsSetInWord >> firstBit; // turn off all bits before firstBit numBits = kBitsPerWord - firstBit; // number of remaining bits in this word if (numBits > numBlocks) { numBits = numBlocks; // entire allocation is inside this one word bitMask &= ~(kAllBitsSetInWord >> (firstBit + numBits)); // turn off bits after last } #if DEBUG_BUILD if ((*currentWord & SWAP_BE32 (bitMask)) != 0) { panic("BlockMarkAllocated: blocks already allocated!"); } #endif *currentWord |= SWAP_BE32 (bitMask); // set the bits in the bitmap numBlocks -= numBits; // adjust number of blocks left to allocate ++currentWord; // move to next word --wordsLeft; // one less word left in this block } // // Allocate whole words (32 blocks) at a time. // bitMask = kAllBitsSetInWord; // put this in a register for 68K while (numBlocks >= kBitsPerWord) { if (wordsLeft == 0) { // Read in the next bitmap block startingBlock += bitsPerBlock; // generate a block number in the next bitmap block buffer = NULL; err = ReleaseBitmapBlock(vcb, blockRef, true); if (err != noErr) goto Exit; err = ReadBitmapBlock(vcb, startingBlock, &buffer, &blockRef); if (err != noErr) goto Exit; // XXXdbg if (hfsmp->jnl) { journal_modify_block_start(hfsmp->jnl, (struct buf *)blockRef); } // Readjust currentWord and wordsLeft currentWord = buffer; wordsLeft = wordsPerBlock; } #if DEBUG_BUILD if (*currentWord != 0) { panic("BlockMarkAllocated: blocks already allocated!"); } #endif *currentWord = SWAP_BE32 (bitMask); numBlocks -= kBitsPerWord; ++currentWord; // move to next word --wordsLeft; // one less word left in this block } // // Allocate any remaining blocks. // if (numBlocks != 0) { bitMask = ~(kAllBitsSetInWord >> numBlocks); // set first numBlocks bits if (wordsLeft == 0) { // Read in the next bitmap block startingBlock += bitsPerBlock; // generate a block number in the next bitmap block buffer = NULL; err = ReleaseBitmapBlock(vcb, blockRef, true); if (err != noErr) goto Exit; err = ReadBitmapBlock(vcb, startingBlock, &buffer, &blockRef); if (err != noErr) goto Exit; // XXXdbg if (hfsmp->jnl) { journal_modify_block_start(hfsmp->jnl, (struct buf *)blockRef); } // Readjust currentWord and wordsLeft currentWord = buffer; wordsLeft = wordsPerBlock; } #if DEBUG_BUILD if ((*currentWord & SWAP_BE32 (bitMask)) != 0) { panic("BlockMarkAllocated: blocks already allocated!"); } #endif *currentWord |= SWAP_BE32 (bitMask); // set the bits in the bitmap // No need to update currentWord or wordsLeft } Exit: if (buffer) (void)ReleaseBitmapBlock(vcb, blockRef, true); return err; } /* _______________________________________________________________________ Routine: BlockMarkFree Function: Mark a contiguous group of blocks as free (clear in the bitmap). It assumes those bits are currently marked allocated (set in the bitmap). Inputs: vcb Pointer to volume where space is to be freed startingBlock First block number to mark as freed numBlocks Number of blocks to mark as freed _______________________________________________________________________ */ __private_extern__ OSErr BlockMarkFree( ExtendedVCB *vcb, u_int32_t startingBlock, register u_int32_t numBlocks) { OSErr err; register u_int32_t *currentWord; // Pointer to current word within bitmap block register u_int32_t wordsLeft; // Number of words left in this bitmap block register u_int32_t bitMask; // Word with given bits already set (ready to OR in) u_int32_t firstBit; // Bit index within word of first bit to allocate u_int32_t numBits; // Number of bits in word to allocate u_int32_t *buffer = NULL; u_int32_t blockRef; u_int32_t bitsPerBlock; u_int32_t wordsPerBlock; // XXXdbg struct hfsmount *hfsmp = VCBTOHFS(vcb); dk_discard_t discard; /* * NOTE: We use vcb->totalBlocks instead of vcb->allocLimit because we * need to be able to free blocks being relocated during hfs_truncatefs. */ if (startingBlock + numBlocks > vcb->totalBlocks) { printf ("hfs: BlockMarkFree() trying to free non-existent blocks starting at %u (numBlock=%u) on volume %s\n", startingBlock, numBlocks, vcb->vcbVN); hfs_mark_volume_inconsistent(vcb); err = EIO; goto Exit; } memset(&discard, 0, sizeof(dk_discard_t)); discard.offset = (uint64_t)startingBlock * (uint64_t)vcb->blockSize; discard.length = (uint64_t)numBlocks * (uint64_t)vcb->blockSize; // // Pre-read the bitmap block containing the first word of allocation // err = ReadBitmapBlock(vcb, startingBlock, &buffer, &blockRef); if (err != noErr) goto Exit; // XXXdbg if (hfsmp->jnl) { journal_modify_block_start(hfsmp->jnl, (struct buf *)blockRef); } // // Initialize currentWord, and wordsLeft. // { u_int32_t wordIndexInBlock; bitsPerBlock = vcb->vcbVBMIOSize * kBitsPerByte; wordsPerBlock = vcb->vcbVBMIOSize / kBytesPerWord; wordIndexInBlock = (startingBlock & (bitsPerBlock-1)) / kBitsPerWord; currentWord = buffer + wordIndexInBlock; wordsLeft = wordsPerBlock - wordIndexInBlock; } // // If the first block to free doesn't start on a word // boundary in the bitmap, then treat that first word // specially. // firstBit = startingBlock % kBitsPerWord; if (firstBit != 0) { bitMask = kAllBitsSetInWord >> firstBit; // turn off all bits before firstBit numBits = kBitsPerWord - firstBit; // number of remaining bits in this word if (numBits > numBlocks) { numBits = numBlocks; // entire allocation is inside this one word bitMask &= ~(kAllBitsSetInWord >> (firstBit + numBits)); // turn off bits after last } if ((*currentWord & SWAP_BE32 (bitMask)) != SWAP_BE32 (bitMask)) { goto Corruption; } *currentWord &= SWAP_BE32 (~bitMask); // clear the bits in the bitmap numBlocks -= numBits; // adjust number of blocks left to free ++currentWord; // move to next word --wordsLeft; // one less word left in this block } // // Free whole words (32 blocks) at a time. // while (numBlocks >= kBitsPerWord) { if (wordsLeft == 0) { // Read in the next bitmap block startingBlock += bitsPerBlock; // generate a block number in the next bitmap block buffer = NULL; err = ReleaseBitmapBlock(vcb, blockRef, true); if (err != noErr) goto Exit; err = ReadBitmapBlock(vcb, startingBlock, &buffer, &blockRef); if (err != noErr) goto Exit; // XXXdbg if (hfsmp->jnl) { journal_modify_block_start(hfsmp->jnl, (struct buf *)blockRef); } // Readjust currentWord and wordsLeft currentWord = buffer; wordsLeft = wordsPerBlock; } if (*currentWord != SWAP_BE32 (kAllBitsSetInWord)) { goto Corruption; } *currentWord = 0; // clear the entire word numBlocks -= kBitsPerWord; ++currentWord; // move to next word --wordsLeft; // one less word left in this block } // // Free any remaining blocks. // if (numBlocks != 0) { bitMask = ~(kAllBitsSetInWord >> numBlocks); // set first numBlocks bits if (wordsLeft == 0) { // Read in the next bitmap block startingBlock += bitsPerBlock; // generate a block number in the next bitmap block buffer = NULL; err = ReleaseBitmapBlock(vcb, blockRef, true); if (err != noErr) goto Exit; err = ReadBitmapBlock(vcb, startingBlock, &buffer, &blockRef); if (err != noErr) goto Exit; // XXXdbg if (hfsmp->jnl) { journal_modify_block_start(hfsmp->jnl, (struct buf *)blockRef); } // Readjust currentWord and wordsLeft currentWord = buffer; wordsLeft = wordsPerBlock; } if ((*currentWord & SWAP_BE32 (bitMask)) != SWAP_BE32 (bitMask)) { goto Corruption; } *currentWord &= SWAP_BE32 (~bitMask); // clear the bits in the bitmap // No need to update currentWord or wordsLeft } Exit: if (buffer) (void)ReleaseBitmapBlock(vcb, blockRef, true); if (err == noErr) { // it doesn't matter if this fails, it's just informational anyway VNOP_IOCTL(vcb->hfs_devvp, DKIOCDISCARD, (caddr_t)&discard, 0, vfs_context_kernel()); } return err; Corruption: #if DEBUG_BUILD panic("BlockMarkFree: blocks not allocated!"); #else printf ("hfs: BlockMarkFree() trying to free unallocated blocks on volume %s\n", vcb->vcbVN); hfs_mark_volume_inconsistent(vcb); err = EIO; goto Exit; #endif } /* _______________________________________________________________________ Routine: BlockFindContiguous Function: Find a contiguous range of blocks that are free (bits clear in the bitmap). If a contiguous range of the minimum size can't be found, an error will be returned. Inputs: vcb Pointer to volume where space is to be allocated startingBlock Preferred first block of range endingBlock Last possible block in range + 1 minBlocks Minimum number of blocks needed. Must be > 0. maxBlocks Maximum (ideal) number of blocks desired useMetaZone OK to dip into metadata allocation zone Outputs: actualStartBlock First block of range found, or 0 if error actualNumBlocks Number of blocks found, or 0 if error Returns: noErr Found at least minBlocks contiguous dskFulErr No contiguous space found, or all less than minBlocks _______________________________________________________________________ */ static OSErr BlockFindContiguous( ExtendedVCB *vcb, u_int32_t startingBlock, u_int32_t endingBlock, u_int32_t minBlocks, u_int32_t maxBlocks, Boolean useMetaZone, u_int32_t *actualStartBlock, u_int32_t *actualNumBlocks) { OSErr err; register u_int32_t currentBlock; // Block we're currently looking at. u_int32_t firstBlock; // First free block in current extent. u_int32_t stopBlock; // If we get to this block, stop searching for first free block. u_int32_t foundBlocks; // Number of contiguous free blocks in current extent. u_int32_t *buffer = NULL; register u_int32_t *currentWord; register u_int32_t bitMask; register u_int32_t wordsLeft; register u_int32_t tempWord; u_int32_t blockRef; u_int32_t wordsPerBlock; /* * When we're skipping the metadata zone and the start/end * range overlaps with the metadata zone then adjust the * start to be outside of the metadata zone. If the range * is entirely inside the metadata zone then we can deny the * request (dskFulErr). */ if (!useMetaZone && (vcb->hfs_flags & HFS_METADATA_ZONE)) { if (startingBlock <= vcb->hfs_metazone_end) { if (endingBlock > (vcb->hfs_metazone_end + 2)) startingBlock = vcb->hfs_metazone_end + 1; else goto DiskFull; } } if ((endingBlock - startingBlock) < minBlocks) { // The set of blocks we're checking is smaller than the minimum number // of blocks, so we couldn't possibly find a good range. goto DiskFull; } stopBlock = endingBlock - minBlocks + 1; currentBlock = startingBlock; firstBlock = 0; /* * Skip over metadata blocks. */ if (!useMetaZone) currentBlock = NextBitmapBlock(vcb, currentBlock); // // Pre-read the first bitmap block. // err = ReadBitmapBlock(vcb, currentBlock, &buffer, &blockRef); if ( err != noErr ) goto ErrorExit; // // Figure out where currentBlock is within the buffer. // wordsPerBlock = vcb->vcbVBMIOSize / kBytesPerWord; wordsLeft = (currentBlock / kBitsPerWord) & (wordsPerBlock-1); // Current index into buffer currentWord = buffer + wordsLeft; wordsLeft = wordsPerBlock - wordsLeft; do { foundBlocks = 0; //============================================================ // Look for a free block, skipping over allocated blocks. //============================================================ // // Check an initial partial word (if any) // bitMask = currentBlock & kBitsWithinWordMask; if (bitMask) { tempWord = SWAP_BE32(*currentWord); // Fetch the current word only once bitMask = kHighBitInWordMask >> bitMask; while (tempWord & bitMask) { bitMask >>= 1; ++currentBlock; } // Did we find an unused bit (bitMask != 0), or run out of bits (bitMask == 0)? if (bitMask) goto FoundUnused; // Didn't find any unused bits, so we're done with this word. ++currentWord; --wordsLeft; } // // Check whole words // while (currentBlock < stopBlock) { // See if it's time to read another block. if (wordsLeft == 0) { buffer = NULL; err = ReleaseBitmapBlock(vcb, blockRef, false); if (err != noErr) goto ErrorExit; /* * Skip over metadata blocks. */ if (!useMetaZone) { currentBlock = NextBitmapBlock(vcb, currentBlock); if (currentBlock >= stopBlock) { goto LoopExit; } } err = ReadBitmapBlock(vcb, currentBlock, &buffer, &blockRef); if ( err != noErr ) goto ErrorExit; currentWord = buffer; wordsLeft = wordsPerBlock; } // See if any of the bits are clear if ((tempWord = SWAP_BE32(*currentWord)) + 1) // non-zero if any bits were clear { // Figure out which bit is clear bitMask = kHighBitInWordMask; while (tempWord & bitMask) { bitMask >>= 1; ++currentBlock; } break; // Found the free bit; break out to FoundUnused. } // Keep looking at the next word currentBlock += kBitsPerWord; ++currentWord; --wordsLeft; } FoundUnused: // Make sure the unused bit is early enough to use if (currentBlock >= stopBlock) { break; } // Remember the start of the extent firstBlock = currentBlock; //============================================================ // Count the number of contiguous free blocks. //============================================================ // // Check an initial partial word (if any) // bitMask = currentBlock & kBitsWithinWordMask; if (bitMask) { tempWord = SWAP_BE32(*currentWord); // Fetch the current word only once bitMask = kHighBitInWordMask >> bitMask; while (bitMask && !(tempWord & bitMask)) { bitMask >>= 1; ++currentBlock; } // Did we find a used bit (bitMask != 0), or run out of bits (bitMask == 0)? if (bitMask) goto FoundUsed; // Didn't find any used bits, so we're done with this word. ++currentWord; --wordsLeft; } // // Check whole words // while (currentBlock < endingBlock) { // See if it's time to read another block. if (wordsLeft == 0) { buffer = NULL; err = ReleaseBitmapBlock(vcb, blockRef, false); if (err != noErr) goto ErrorExit; /* * Skip over metadata blocks. */ if (!useMetaZone) { u_int32_t nextBlock; nextBlock = NextBitmapBlock(vcb, currentBlock); if (nextBlock != currentBlock) { goto LoopExit; /* allocation gap, so stop */ } } err = ReadBitmapBlock(vcb, currentBlock, &buffer, &blockRef); if ( err != noErr ) goto ErrorExit; currentWord = buffer; wordsLeft = wordsPerBlock; } // See if any of the bits are set if ((tempWord = SWAP_BE32(*currentWord)) != 0) { // Figure out which bit is set bitMask = kHighBitInWordMask; while (!(tempWord & bitMask)) { bitMask >>= 1; ++currentBlock; } break; // Found the used bit; break out to FoundUsed. } // Keep looking at the next word currentBlock += kBitsPerWord; ++currentWord; --wordsLeft; // If we found at least maxBlocks, we can quit early. if ((currentBlock - firstBlock) >= maxBlocks) break; } FoundUsed: // Make sure we didn't run out of bitmap looking for a used block. // If so, pin to the end of the bitmap. if (currentBlock > endingBlock) currentBlock = endingBlock; // Figure out how many contiguous free blocks there were. // Pin the answer to maxBlocks. foundBlocks = currentBlock - firstBlock; if (foundBlocks > maxBlocks) foundBlocks = maxBlocks; if (foundBlocks >= minBlocks) break; // Found what we needed! // This free chunk wasn't big enough. Try inserting it into the free extent cache in case // the allocation wasn't forced contiguous. tempWord = vcb->vcbFreeExtCnt; if (tempWord == kMaxFreeExtents && vcb->vcbFreeExt[kMaxFreeExtents-1].blockCount < foundBlocks) --tempWord; if (tempWord < kMaxFreeExtents) { // We're going to add this extent. Bubble any smaller extents down in the list. while (tempWord && vcb->vcbFreeExt[tempWord-1].blockCount < foundBlocks) { vcb->vcbFreeExt[tempWord] = vcb->vcbFreeExt[tempWord-1]; --tempWord; } vcb->vcbFreeExt[tempWord].startBlock = firstBlock; vcb->vcbFreeExt[tempWord].blockCount = foundBlocks; if (vcb->vcbFreeExtCnt < kMaxFreeExtents) ++vcb->vcbFreeExtCnt; } } while (currentBlock < stopBlock); LoopExit: // Return the outputs. if (foundBlocks < minBlocks) { DiskFull: err = dskFulErr; ErrorExit: *actualStartBlock = 0; *actualNumBlocks = 0; } else { err = noErr; *actualStartBlock = firstBlock; *actualNumBlocks = foundBlocks; /* * Sanity check for overflow */ if ((firstBlock + foundBlocks) > vcb->allocLimit) { panic("blk allocation overflow on \"%s\" sb:0x%08x eb:0x%08x cb:0x%08x fb:0x%08x stop:0x%08x min:0x%08x found:0x%08x", vcb->vcbVN, startingBlock, endingBlock, currentBlock, firstBlock, stopBlock, minBlocks, foundBlocks); } } if (buffer) (void) ReleaseBitmapBlock(vcb, blockRef, false); return err; } /* * Test to see if any blocks in a range are allocated. * * The journal or allocation file lock must be held. */ __private_extern__ int hfs_isallocated(struct hfsmount *hfsmp, u_long startingBlock, u_long numBlocks) { u_int32_t *currentWord; // Pointer to current word within bitmap block u_int32_t wordsLeft; // Number of words left in this bitmap block u_int32_t bitMask; // Word with given bits already set (ready to test) u_int32_t firstBit; // Bit index within word of first bit to allocate u_int32_t numBits; // Number of bits in word to allocate u_int32_t *buffer = NULL; u_int32_t blockRef; u_int32_t bitsPerBlock; u_int32_t wordsPerBlock; int inuse = 0; int error; /* * Pre-read the bitmap block containing the first word of allocation */ error = ReadBitmapBlock(hfsmp, startingBlock, &buffer, &blockRef); if (error) return (error); /* * Initialize currentWord, and wordsLeft. */ { u_int32_t wordIndexInBlock; bitsPerBlock = hfsmp->vcbVBMIOSize * kBitsPerByte; wordsPerBlock = hfsmp->vcbVBMIOSize / kBytesPerWord; wordIndexInBlock = (startingBlock & (bitsPerBlock-1)) / kBitsPerWord; currentWord = buffer + wordIndexInBlock; wordsLeft = wordsPerBlock - wordIndexInBlock; } /* * First test any non word aligned bits. */ firstBit = startingBlock % kBitsPerWord; if (firstBit != 0) { bitMask = kAllBitsSetInWord >> firstBit; numBits = kBitsPerWord - firstBit; if (numBits > numBlocks) { numBits = numBlocks; bitMask &= ~(kAllBitsSetInWord >> (firstBit + numBits)); } if ((*currentWord & SWAP_BE32 (bitMask)) != 0) { inuse = 1; goto Exit; } numBlocks -= numBits; ++currentWord; --wordsLeft; } /* * Test whole words (32 blocks) at a time. */ while (numBlocks >= kBitsPerWord) { if (wordsLeft == 0) { /* Read in the next bitmap block. */ startingBlock += bitsPerBlock; buffer = NULL; error = ReleaseBitmapBlock(hfsmp, blockRef, false); if (error) goto Exit; error = ReadBitmapBlock(hfsmp, startingBlock, &buffer, &blockRef); if (error) goto Exit; /* Readjust currentWord and wordsLeft. */ currentWord = buffer; wordsLeft = wordsPerBlock; } if (*currentWord != 0) { inuse = 1; goto Exit; } numBlocks -= kBitsPerWord; ++currentWord; --wordsLeft; } /* * Test any remaining blocks. */ if (numBlocks != 0) { bitMask = ~(kAllBitsSetInWord >> numBlocks); if (wordsLeft == 0) { /* Read in the next bitmap block */ startingBlock += bitsPerBlock; buffer = NULL; error = ReleaseBitmapBlock(hfsmp, blockRef, false); if (error) goto Exit; error = ReadBitmapBlock(hfsmp, startingBlock, &buffer, &blockRef); if (error) goto Exit; currentWord = buffer; wordsLeft = wordsPerBlock; } if ((*currentWord & SWAP_BE32 (bitMask)) != 0) { inuse = 1; goto Exit; } } Exit: if (buffer) { (void)ReleaseBitmapBlock(hfsmp, blockRef, false); } return (inuse); }