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

12

/macosx-10.10.1/hfs-285/CopyHFSMeta/
H A DScanExtents.c52 GetNode(DeviceInfo_t *devp, HFSPlusVolumeHeader *hp, int nodeNum, size_t nodeSize, void *nodePtr) argument
58 size_t bufferSize = MAX(nodeSize, S32(hp->blockSize));
68 offset = (uint32_t)(((off_t)nodeNum * nodeSize) / S32(hp->blockSize));
114 if (nodeSize < bufferSize) {
115 size_t indx = nodeNum % (S32(hp->blockSize) / nodeSize);
117 memmove(ptr, ptr + (indx * nodeSize), nodeSize);
130 ScanNode(VolumeObjects_t *vop, uint8_t *nodePtr, size_t nodeSize, off_t blockSize) argument
147 offsetPtr = (u_int16_t*)((uint8_t*)nodePtr + nodeSize);
153 if (recp > (nodePtr + nodeSize)) {
195 size_t nodeSize; local
[all...]
H A Dutil.c320 ScanCatalogNode(VolumeObjects_t *vop, uint8_t *buffer, size_t nodeSize, extent_handler_t handler) argument
323 uint16_t *indices = (uint16_t*)(buffer + nodeSize);
374 ScanAttrNode(VolumeObjects_t *vop, uint8_t *buffer, size_t nodeSize, extent_handler_t handler) argument
377 uint16_t *indices = (uint16_t*)(buffer + nodeSize);
471 catNodeSize = S16(hdp->nodeSize);
491 attrNodeSize = S16(hdp->nodeSize);
530 size_t nodeSize = 0; local
534 nodeSize = catNodeSize;
537 nodeSize = attrNodeSize;
541 retval = (*func)(vop, curPtr, nodeSize, handle
[all...]
/macosx-10.10.1/dyld-353.2.1/launch-cache/
H A DMachOTrie.hpp133 uint32_t nodeSize = 1; // length of export info when no export info local
136 nodeSize = uleb128_size(fFlags) + uleb128_size(fOther); // ordinal
138 nodeSize += strlen(fImportedName);
139 ++nodeSize; // trailing zero in imported name
142 nodeSize = uleb128_size(fFlags) + uleb128_size(fAddress);
144 nodeSize += uleb128_size(fOther);
147 nodeSize += uleb128_size(nodeSize);
150 ++nodeSize; // byte for count of chidren
153 nodeSize
168 uint32_t nodeSize = uleb128_size(fFlags) + uleb128_size(fOther) + strlen(fImportedName) + 1; local
176 uint32_t nodeSize = uleb128_size(fFlags) + uleb128_size(fOther) + 1; local
185 uint32_t nodeSize = uleb128_size(fFlags) + uleb128_size(fAddress) + uleb128_size(fOther); local
193 uint32_t nodeSize = uleb128_size(fFlags) + uleb128_size(fAddress); local
[all...]
/macosx-10.10.1/hfs-285/fsck_hfs/dfalib/
H A DBTreeAllocate.c257 UInt16 nodeSize; local
277 nodeSize = btreePtr->nodeSize;
283 mapNodeRecSize = nodeSize - sizeof(BTNodeDescriptor) - 6; // 2 bytes of free space (see note)
306 minEOF = (UInt64)newTotalNodes * (UInt64)nodeSize;
318 newTotalNodes = filePtr->fcbLogicalSize / nodeSize; //�� hack!
356 *(UInt16 *)((Ptr)newNode.buffer + nodeSize - 4) = nodeSize - 6;
397 if (DEBUG_BUILD && mapSize != M_MapRecordSize (btreePtr->nodeSize) )
537 mapBits = M_HeaderMapRecordSize (btreePtr->nodeSize) <<
[all...]
H A DBTreeScanner.c161 scanState->currentNodePtr = (BTNodeDescriptor *)((UInt8 *)scanState->currentNodePtr + scanState->btcb->nodeSize);
168 myBlockDescriptor.blockSize = scanState->btcb->nodeSize;
294 theScanStatePtr->btcb->nodeSize;
334 bufferSize = (kCatScanBufferSize / btcb->nodeSize) * btcb->nodeSize;
H A DSRebuildBTree.c509 myFCBPtr->fcbBlockSize = oldBCBPtr->nodeSize;
516 myBTreeCBPtr->nodeSize = oldBCBPtr->nodeSize;
547 myBTreeCBPtr->totalNodes = ( myFCBPtr->fcbPhysicalSize / myBTreeCBPtr->nodeSize );
569 myErr = WriteMapNodes( myBTreeCBPtr, (myBytesUsed / myBTreeCBPtr->nodeSize ), myMapNodeCount );
621 SETOFFSET( myBufferPtr, theBTreeCBPtr->nodeSize, myOffset, 1 );
629 myHeaderRecPtr->nodeSize = theBTreeCBPtr->nodeSize;
639 SETOFFSET( myBufferPtr, theBTreeCBPtr->nodeSize, myOffset, 2 );
642 SETOFFSET( myBufferPtr, theBTreeCBPtr->nodeSize, myOffse
[all...]
H A DBTreePrivate.h90 #define M_MapRecordSize(nodeSize) (nodeSize - sizeof (BTNodeDescriptor) - 6)
91 #define M_HeaderMapRecordSize(nodeSize) (nodeSize - sizeof(BTNodeDescriptor) - sizeof(BTHeaderRec) - 128 - 8)
119 UInt16 nodeSize; member in struct:BTreeControlBlock
379 #define GetRecordAddress(btreePtr,node,index) ((UInt8 *)(node) + (*(short *) ((UInt8 *)(node) + (btreePtr)->nodeSize - ((index) << 1) - kOffsetSize)))
H A DBTreeNodeOps.c95 #define GetRecordOffset(btreePtr,node,index) (*(short *) ((UInt8 *)(node) + (btreePtr)->nodeSize - ((index) << 1) - kOffsetSize))
218 pos = (char *)node + btreePtr->nodeSize - 2; // find address of last offset
378 Function: Writes zeroes from beginning of node for nodeSize bytes.
388 ClearMemory( node, btreePtr->nodeSize );
770 return btreePtr->nodeSize - freeOffset - (node->numRecords << 1) - kOffsetSize;
796 pos = (UInt8 *)node + btreePtr->nodeSize - (index << 1) - kOffsetSize;
853 pos = (UInt16 *) ((Ptr)node + btreePtr->nodeSize - (index << 1) - kOffsetSize);
878 pos = (Ptr)node + btreePtr->nodeSize - (index << 1) -2;
H A DBTree.c42 extern Boolean NodesAreContiguous(SFCB *fcb, UInt32 nodeSize);
129 nodeSize - node size for B*Tree (must be 2^n, 9 >= n >= 15)
151 UInt16 nodeSize,
188 switch (nodeSize) // node size == 512*2^n
232 btreePtr->nodeSize = nodeSize;
238 // set block size = nodeSize
239 err = setBlockSizeProc (forkPtr, nodeSize);
244 minEOF = nodeSize;
265 header->nodeSize
[all...]
H A DBTreeMiscOps.c87 switch (header->nodeSize) // node size == 512*2^n
101 forkSize = totalNodes * header->nodeSize;
174 header->nodeSize = btreePtr->nodeSize; //�� this shouldn't change
448 if ( CalcKeyRecordSize (CalcKeySize(btreePtr, &iterator->key), recordLen) > (btreePtr->nodeSize >> 1))
H A DBTreeTreeOps.c945 SInt32 nodeSize; local
968 nodeSize = btreePtr->nodeSize;
971 rightSize = nodeSize - GetNodeFreeSize (btreePtr, rightNode) + insertSize;
972 leftSize = nodeSize - GetNodeFreeSize (btreePtr, leftNode);
997 if ( leftSize > nodeSize ) // undo last move
1004 if ( rightSize > nodeSize ) // record won't fit - failure, but not error
1497 SInt32 nodeSize; local
1523 nodeSize = btreePtr->nodeSize;
[all...]
H A DBTree.h287 UInt16 nodeSize; member in struct:BTreeInfoRec
359 UInt16 nodeSize,
H A DSVerify1.c1077 btcb->nodeSize = header.nodeSize;
1078 btcb->totalNodes = ( GPtr->calculatedExtentsFCB->fcbPhysicalSize / btcb->nodeSize );
1083 if ( (err != noErr) && (btcb->nodeSize != 1024) ) // default HFS+ Extents node size is 1024
1085 btcb->nodeSize = 1024;
1086 btcb->totalNodes = ( GPtr->calculatedExtentsFCB->fcbPhysicalSize / btcb->nodeSize );
1138 btcb->nodeSize = header.nodeSize;
1139 btcb->totalNodes = (GPtr->calculatedExtentsFCB->fcbPhysicalSize / btcb->nodeSize );
1184 the nodeSize ma
[all...]
H A DSVerify2.c351 header->nodeSize > calculatedBTCB->fcbPtr->fcbVolume->vcbBlockSize) {
355 int blocksPerNode = header->nodeSize / calculatedBTCB->fcbPtr->fcbVolume->vcbBlockSize; // How many blocks in a node
1060 } else if ( calculatedBTCB->nodeSize != bTreeHeader.nodeSize ) {
1063 calculatedBTCB->nodeSize, bTreeHeader.nodeSize);
1345 HexDump(nodeP, btcb->nodeSize, TRUE);
H A DSUtils.c320 switch (header->nodeSize) {
2010 void InitBTreeHeader (UInt32 fileSize, UInt32 clumpSize, UInt16 nodeSize, UInt16 recordCount, UInt16 keySize, argument
2022 ClearMemory(buffer, nodeSize); // start out with clean node
2024 nodeCount = fileSize / nodeSize;
2025 nodeBitsInHeader = 8 * (nodeSize - sizeof(BTNodeDescriptor) - sizeof(BTHeaderRec) - kBTreeHeaderUserBytes - 4*sizeof(SInt16));
2041 nodeBitsInMapNode = 8 * (nodeSize - sizeof(BTNodeDescriptor) - 2*sizeof(SInt16) - 2); //�� why (-2) at end???
2069 bth->nodeSize = nodeSize; // size of a node
2086 offsetPtr = (SInt16*) ((Byte*) buffer + nodeSize - 4*sizeof(SInt16));
/macosx-10.10.1/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
/macosx-10.10.1/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...]
/macosx-10.10.1/hfs-285/newfs_hfs/
H A Dmakehfs.c1026 UInt32 nodeSize; local
1032 nodeSize = dp->extentsNodeSize;
1034 bzero(buffer, nodeSize);
1043 SETOFFSET(buffer, nodeSize, offset, 1);
1062 bthp->nodeSize = SWAP_BE16 (nodeSize);
1063 bthp->totalNodes = SWAP_BE32 (fileSize / nodeSize);
1071 SETOFFSET(buffer, nodeSize, offset, 2);
1075 SETOFFSET(buffer, nodeSize, offset, 3);
1079 nodeBitsInHeader = 8 * (nodeSize
1171 UInt32 nodeSize; local
1479 UInt32 nodeSize; local
1578 UInt16 nodeSize; local
[all...]
H A Dnewfs_hfs.c88 static UInt32 CalcHFSPlusBTreeClumpSize __P((UInt32 blockSize, UInt32 nodeSize, UInt64 sectors, int fileID));
1278 * nodeSize: 8192
1283 * nodeSize: 8192
1317 CalcHFSPlusBTreeClumpSize(UInt32 blockSize, UInt32 nodeSize, UInt64 sectors, int fileID) argument
1319 UInt32 mod = MAX(nodeSize, blockSize);
1343 if (clumpSize < (8 * nodeSize))
1344 clumpSize = 8 * nodeSize;
/macosx-10.10.1/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)))

Completed in 166 milliseconds

12