Searched refs:nodeSize (Results 1 - 17 of 17) sorted by relevance

/xnu-2782.1.97/bsd/hfs/hfscommon/BTree/
H A DBTreeScanner.c189 + scanState->btcb->nodeSize);
196 block.blockSize = scanState->btcb->nodeSize;
267 myBlocksInBufferCount = (theScanStatePtr->bufferSize / myBTreeCBPtr->nodeSize );
271 myBufferSize = (myBlockRun + 1) * myBTreeCBPtr->nodeSize;
285 theScanStatePtr->nodesLeftInBuffer = buf_count(theScanStatePtr->bufferPtr) / theScanStatePtr->btcb->nodeSize;
351 if ( bufferSize < btcb->nodeSize )
353 bufferSize = (bufferSize / btcb->nodeSize) * btcb->nodeSize;
H A DBTreeAllocate.c317 u_int16_t nodeSize; local
337 nodeSize = btreePtr->nodeSize;
345 mapNodeRecSize = nodeSize - sizeof(BTNodeDescriptor) - 6; // 2 bytes of free space (see note)
366 minEOF = (u_int64_t)newTotalNodes * (u_int64_t)nodeSize;
369 maxEOF = (u_int64_t)0x7fffffffLL * (u_int64_t)nodeSize;
378 newTotalNodes = filePtr->fcbEOF / nodeSize; // hack!
421 *(u_int16_t *)((Ptr)newNode.buffer + nodeSize - 4) = nodeSize - 6;
465 if (DEBUG_BUILD && mapSize != M_MapRecordSize (btreePtr->nodeSize) )
[all...]
H A DBTreeNodeOps.c165 #define GetRecordOffset(btreePtr,node,index) (*(short *) ((u_int8_t *)(node) + (btreePtr)->nodeSize - ((index) << 1) - kOffsetSize))
170 static void PrintNode(const NodeDescPtr node, u_int16_t nodeSize, u_int32_t nodeNumber);
210 nodePtr->blockSize = btreePtr->nodeSize; // indicate the size of a node
270 returnNodePtr->blockSize = btreePtr->nodeSize; // indicate the size of a node
293 pos = (char *)node + btreePtr->nodeSize - 2; // find address of last offset
435 static void PrintNode(const NodeDescPtr node, u_int16_t nodeSize, u_int32_t nodeNumber) argument
446 rows = nodeSize/16;
460 Function: Writes zeroes from beginning of node for nodeSize bytes.
470 ClearMemory( node, btreePtr->nodeSize );
733 offset = (u_int16_t *) ((u_int8_t *)(node) + (btreePtr)->nodeSize
[all...]
H A DBTreeMiscOps.c167 switch (header->nodeSize) // node size == 512*2^n
181 forkSize = (u_int64_t)totalNodes * (u_int64_t)header->nodeSize;
266 header->nodeSize = btreePtr->nodeSize; //�� this shouldn't change
539 if ( CalcKeyRecordSize (CalcKeySize(btreePtr, &iterator->key), recordLen) > (btreePtr->nodeSize >> 1))
H A DBTree.c272 PanicIf ( (FCBTOVCB(filePtr)->vcbSigWord != 0x4244) && (header->nodeSize == 512), " BTOpenPath: wrong node size for HFS+ volume!"); // 0x4244 = 'BD'
279 btreePtr->nodeSize = header->nodeSize;
305 if (btreePtr->nodeSize < VTOHFS(btreePtr->fileRefNum)->hfs_logical_block_size)
324 if ( btreePtr->nodeSize != nodeRec.blockSize )
326 err = SetBTreeBlockSize (btreePtr->fileRefNum, btreePtr->nodeSize, 32);
357 if ( FCBTOHFS(filePtr)->jnl && !NodesAreContiguous(FCBTOVCB(filePtr), filePtr, btreePtr->nodeSize) ) {
1783 info->nodeSize = btreePtr->nodeSize;
2014 return NodesAreContiguous(FCBTOVCB(filePtr), filePtr, btreePtr->nodeSize);
[all...]
H A DBTreeTreeOps.c969 int32_t nodeSize; local
992 nodeSize = btreePtr->nodeSize;
995 rightSize = nodeSize - GetNodeFreeSize (btreePtr, rightNode) + insertSize;
996 leftSize = nodeSize - GetNodeFreeSize (btreePtr, leftNode);
1020 if ( leftSize > nodeSize ) // undo last move
1027 if ( rightSize > nodeSize ) // record won't fit - failure, but not error
H A DBTreeNodeReserve.c191 reqblks = ((rsrvNodes - availNodes) * btree->nodeSize) / hfsmp->blockSize;
/xnu-2782.1.97/bsd/hfs/
H A Dhfs_btreeio.c73 node_size = btree->nodeSize;
90 bTreePtr->nodeSize = blockSize;
141 (((BTHeaderRec *)((char *)block->buffer + 14))->nodeSize != buf_count(bp)) &&
142 (SWAP_BE16 (((BTHeaderRec *)((char *)block->buffer + 14))->nodeSize) != buf_count(bp))) {
430 if (vcb->blockSize >= btInfo.nodeSize) {
446 while((off_t)bytesToAdd >= btInfo.nodeSize) {
453 if (bytesToAdd < btInfo.nodeSize) {
455 } else if ((bytesToAdd % btInfo.nodeSize) != 0) {
456 // make sure it's an integer multiple of the nodeSize
457 bytesToAdd -= (bytesToAdd % btInfo.nodeSize);
[all...]
H A Dhfs_format.h738 u_int16_t nodeSize; /* size of a node, in bytes */ member in struct:BTHeaderRec
H A Dhfs_endian.c258 srcHead->nodeSize = SWAP_BE16 (srcHead->nodeSize);
H A Dhfs_hotfiles.c1902 bthp->nodeSize = SWAP_BE16 (nodesize);
H A Dhfs_xattr.c2288 nodesize = btinfo.nodeSize;
H A Dhfs_vfsutils.c1927 * BTrees, this is kept as part of the BTree private nodeSize
1946 * We just want the nodeSize wich will NEVER change..so even if the world
1947 * is changing..the nodeSize should remain the same. Which argues why lock
1953 logBlockSize = bTreeInfo.nodeSize;
/xnu-2782.1.97/bsd/hfs/hfscommon/headers/
H A DBTreesPrivate.h184 #define M_MapRecordSize(nodeSize) (nodeSize - sizeof (BTNodeDescriptor) - 6)
185 #define M_HeaderMapRecordSize(nodeSize) (nodeSize - sizeof(BTNodeDescriptor) - sizeof(BTHeaderRec) - 128 - 8)
203 u_int16_t nodeSize; member in struct:BTreeControlBlock
455 #define GetRecordAddress(btreePtr,node,index) ((u_int8_t *)(node) + (*(short *) ((u_int8_t *)(node) + (btreePtr)->nodeSize - ((index) << 1) - kOffsetSize)))
H A DBTreesInternal.h239 u_int16_t nodeSize; member in struct:BTreeInfoRec
H A DFileMgrInternal.h301 u_int32_t nodeSize);
/xnu-2782.1.97/bsd/hfs/hfscommon/Misc/
H A DFileExtentMapping.c2152 u_int32_t nodeSize)
2165 if (vcb->blockSize >= nodeSize)
2168 mask = (nodeSize / vcb->blockSize) - 1;
2149 NodesAreContiguous( ExtendedVCB *vcb, FCB *fcb, u_int32_t nodeSize) argument

Completed in 59 milliseconds