/macosx-10.10/xnu-2782.1.97/bsd/hfs/hfscommon/BTree/ |
H A D | BTreeMiscOps.c | 164 u_int32_t totalNodes; local 179 totalNodes = header->totalNodes; 181 forkSize = (u_int64_t)totalNodes * (u_int64_t)header->nodeSize; 186 if ( header->freeNodes >= totalNodes ) 189 if ( header->rootNode >= totalNodes ) 192 if ( header->firstLeafNode >= totalNodes ) 195 if ( header->lastLeafNode >= totalNodes ) 268 header->totalNodes = btreePtr->totalNodes; [all...] |
H A D | BTreeNodeReserve.c | 119 int rsrvNodes, availNodes, totalNodes; local 198 totalNodes = rsrvNodes + btree->totalNodes - availNodes; 201 if (totalNodes > (int)CalcMapBits(btree)) { 202 ++totalNodes; 204 if ((err = ExtendBTree(btree, totalNodes))) {
|
H A D | BTreeAllocate.c | 185 if (nodeNumber >= btreePtr->totalNodes) 333 oldTotalNodes = btreePtr->totalNodes; 381 btreePtr->totalNodes = newTotalNodes; // do we need to update freeNodes here too? 494 btreePtr->totalNodes = newTotalNodes; 612 while (mapBits < btreePtr->totalNodes) 677 if (nodeNumber + bitNumber >= btreePtr->totalNodes)
|
H A D | BTree.c | 281 btreePtr->totalNodes = header->totalNodes; 1305 err = ExtendBTree (btreePtr, btreePtr->totalNodes + 1); 1371 nodesNeeded = btreePtr->treeDepth + 1 + btreePtr->totalNodes - btreePtr->freeNodes; 1522 nodesNeeded = btreePtr->treeDepth + 1 + btreePtr->totalNodes - btreePtr->freeNodes; 1725 if ((btreePtr->treeDepth + 1UL) > btreePtr->totalNodes) 1727 nodesNeeded = btreePtr->treeDepth + 1 + btreePtr->totalNodes; 1787 info->numNodes = btreePtr->totalNodes; 1885 btreePtr->totalNodes = header->totalNodes; [all...] |
H A D | BTreeScanner.c | 179 if ( scanState->nodeNum >= scanState->btcb->totalNodes )
|
H A D | BTreeNodeOps.c | 203 if( nodeNum >= btreePtr->totalNodes ) 205 Panic("GetNode:nodeNum >= totalNodes");
|
/macosx-10.10/hfs-285/fsck_hfs/dfalib/ |
H A D | BTreeMiscOps.c | 84 UInt32 totalNodes; local 99 totalNodes = header->totalNodes; 101 forkSize = totalNodes * header->nodeSize; 106 if ( header->freeNodes >= totalNodes ) 109 if ( header->rootNode >= totalNodes ) 112 if ( header->firstLeafNode >= totalNodes ) 115 if ( header->lastLeafNode >= totalNodes ) 176 header->totalNodes = btreePtr->totalNodes; [all...] |
H A D | BTreeAllocate.c | 133 if (nodeNumber >= btreePtr->totalNodes) 273 oldTotalNodes = btreePtr->totalNodes; 321 btreePtr->totalNodes = newTotalNodes; //�� do we need to update freeNodes here too? 425 btreePtr->totalNodes = newTotalNodes; 539 while (mapBits < btreePtr->totalNodes)
|
H A D | SRebuildBTree.c | 547 myBTreeCBPtr->totalNodes = ( myFCBPtr->fcbPhysicalSize / myBTreeCBPtr->nodeSize ); 548 myBTreeCBPtr->freeNodes = myBTreeCBPtr->totalNodes; 563 myBTreeCBPtr->totalNodes = myHeaderRec.totalNodes; 630 myHeaderRecPtr->totalNodes = theBTreeCBPtr->totalNodes; 631 myHeaderRecPtr->freeNodes = myHeaderRecPtr->totalNodes - 1; /* header node */ 651 if ( myHeaderRecPtr->totalNodes > myNodeBitsInHeader ) 660 *theMapNodeCountPtr = (myHeaderRecPtr->totalNodes - myNodeBitsInHeader + 670 temp = myHeaderRecPtr->totalNodes [all...] |
H A D | SVerify2.c | 318 if ( header->rootNode >= calculatedBTCB->totalNodes || 323 header->rootNode, calculatedBTCB->totalNodes, 425 plog( " totalNodes = %d \n", header->totalNodes ); 662 if ( (nodeNum == kHeaderNodeNum) || (nodeNum >= calculatedBTCB->totalNodes) ) 691 if ( (nodeNum == kHeaderNodeNum) || (nodeNum >= calculatedBTCB->totalNodes) ) 713 if ( (nodeNum == kHeaderNodeNum) || (nodeNum >= calculatedBTCB->totalNodes) ) 809 mapSize = ( calculatedBTCB->totalNodes + 7 ) / 8; /* size in bytes */ 916 for (nodeNum = 0; nodeNum < btcb->totalNodes; ++nodeNum) 1070 } else if ( calculatedBTCB->totalNodes ! [all...] |
H A D | BTree.c | 234 btreePtr->totalNodes = 1; // so ExtendBTree adds maps nodes properly 268 header->totalNodes = btreePtr->totalNodes; 269 header->freeNodes = btreePtr->totalNodes - 1; 304 err = ExtendBTree (btreePtr, forkPtr->fork.logicalEOF.lo / nodeSize); // sets totalNodes 440 btreePtr->totalNodes = header->totalNodes; 1190 err = ExtendBTree (btreePtr, btreePtr->totalNodes + 1); 1247 nodesNeeded += btreePtr->totalNodes; 1380 err = ExtendBTree (btreePtr, btreePtr->totalNodes [all...] |
H A D | SVerify1.c | 1078 btcb->totalNodes = ( GPtr->calculatedExtentsFCB->fcbPhysicalSize / btcb->nodeSize ); 1079 btcb->freeNodes = btcb->totalNodes; // start with everything free 1086 btcb->totalNodes = ( GPtr->calculatedExtentsFCB->fcbPhysicalSize / btcb->nodeSize ); 1087 btcb->freeNodes = btcb->totalNodes; // start with everything free 1139 btcb->totalNodes = (GPtr->calculatedExtentsFCB->fcbPhysicalSize / btcb->nodeSize ); 1140 btcb->freeNodes = btcb->totalNodes; // start with everything free 1160 size = (btcb->totalNodes + 7) / 8; // size of BTree bit map 1432 btcb->totalNodes = ( GPtr->calculatedCatalogFCB->fcbPhysicalSize / btcb->nodeSize ); 1433 btcb->freeNodes = btcb->totalNodes; // start with everything free 1447 btcb->totalNodes [all...] |
H A D | hfs_endian.c | 223 if (srcDesc->fLink >= btcb->totalNodes) { 226 if (srcDesc->bLink >= btcb->totalNodes) { 326 srcHead->totalNodes = SWAP_BE32 (srcHead->totalNodes); 348 if (srcDesc->fLink >= btcb->totalNodes) { 351 if (srcDesc->bLink >= btcb->totalNodes) {
|
H A D | BTreeNodeOps.c | 125 if( nodeNum >= btreePtr->totalNodes ) 127 Panic("\pGetNode:nodeNum >= totalNodes"); 128 if (debug) fprintf(stderr, "%s(%d): nodeNum %u > totalNodes %u\n", __FUNCTION__, __LINE__, nodeNum, btreePtr->totalNodes);
|
H A D | BTreeScanner.c | 158 if ( scanState->nodeNum >= scanState->btcb->totalNodes )
|
H A D | BTreePrivate.h | 121 UInt32 totalNodes; member in struct:BTreeControlBlock
|
H A D | SUtils.c | 2071 bth->totalNodes = nodeCount; // total number of nodes 2124 items += (2 * btcb->leafRecords) + (btcb->totalNodes - realFreeNodes); 2128 items += btcb->leafRecords + (btcb->totalNodes - realFreeNodes); 2135 items += (btcb->leafRecords + (btcb->totalNodes - realFreeNodes));
|
H A D | SRepair.c | 6511 for (nodeNum = 0; nodeNum < btcb->totalNodes; ++nodeNum)
|
/macosx-10.10/xnu-2782.1.97/bsd/hfs/ |
H A D | hfs_btreeio.c | 741 btcb->totalNodes = VTOF(vp)->ff_size / nodesize; 761 if (btcb->totalNodes > temp) { 762 num_map_nodes = howmany(btcb->totalNodes - temp, bytes_per_map_record * 8); 768 btcb->freeNodes = btcb->totalNodes - 1 - num_map_nodes; 805 bthp->totalNodes = btcb->totalNodes;
|
H A D | hfs_endian.c | 122 * control block is initialized. In this case, totalNodes will be zero, 127 if (btcb->totalNodes != 0) { 128 if (srcDesc->fLink >= btcb->totalNodes) { 129 printf("hfs_swap_BTNode: invalid forward link (0x%08x >= 0x%08x)\n", srcDesc->fLink, btcb->totalNodes); 133 if (srcDesc->bLink >= btcb->totalNodes) { 134 printf("hfs_swap_BTNode: invalid backward link (0x%08x >= 0x%08x)\n", srcDesc->bLink, btcb->totalNodes); 261 srcHead->totalNodes = SWAP_BE32 (srcHead->totalNodes); 284 if (srcDesc->fLink >= btcb->totalNodes) { 296 if (srcDesc->bLink >= btcb->totalNodes) { [all...] |
H A D | hfs_format.h | 740 u_int32_t totalNodes; /* total number of nodes in tree */ member in struct:BTHeaderRec
|
H A D | hfs_hotfiles.c | 1903 bthp->totalNodes = SWAP_BE32 (filesize / nodesize);
|
/macosx-10.10/hfs-285/newfs_hfs/ |
H A D | makehfs.c | 1063 bthp->totalNodes = SWAP_BE32 (fileSize / nodeSize); 1064 bthp->freeNodes = SWAP_BE32 (SWAP_BE32 (bthp->totalNodes) - (numOverflowExtents ? 2 : 1)); /* header */ 1085 if (SWAP_BE32 (bthp->totalNodes) > nodeBitsInHeader) { 1093 *mapNodes = (SWAP_BE32 (bthp->totalNodes) - nodeBitsInHeader + 1104 temp = SWAP_BE32 (bthp->totalNodes) - SWAP_BE32 (bthp->freeNodes); 1147 *bytesUsed = (SWAP_BE32 (bthp->totalNodes) - SWAP_BE32 (bthp->freeNodes) - *mapNodes) * nodeSize; 1223 bthp->totalNodes = SWAP_BE32 (fileSize / nodeSize); 1226 bthp->freeNodes = SWAP_BE32 (SWAP_BE32 (bthp->totalNodes) - 2); 1230 bthp->freeNodes = SWAP_BE32 (SWAP_BE32 (bthp->totalNodes) - 1); 1252 if (SWAP_BE32 (bthp->totalNodes) > nodeBitsInHeade [all...] |
/macosx-10.10/xnu-2782.1.97/bsd/hfs/hfscommon/headers/ |
H A D | BTreesPrivate.h | 205 u_int32_t totalNodes; member in struct:BTreeControlBlock
|
/macosx-10.10/xnu-2782.1.97/iokit/Kernel/ |
H A D | IOPMrootDomain.cpp | 7527 unsigned int totalNodes = 0; local 7654 totalNodes += count; 7671 totalNodes, gPMHaltArray->getCount(), numWorkers);
|