Searched refs:totalNodes (Results 1 - 12 of 12) sorted by relevance

/xnu-2782.1.97/bsd/hfs/hfscommon/BTree/
H A DBTreeMiscOps.c164 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 DBTreeNodeReserve.c119 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 DBTreeAllocate.c185 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 DBTree.c281 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 DBTreeScanner.c179 if ( scanState->nodeNum >= scanState->btcb->totalNodes )
H A DBTreeNodeOps.c203 if( nodeNum >= btreePtr->totalNodes )
205 Panic("GetNode:nodeNum >= totalNodes");
/xnu-2782.1.97/bsd/hfs/
H A Dhfs_btreeio.c741 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 Dhfs_endian.c122 * 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 Dhfs_format.h740 u_int32_t totalNodes; /* total number of nodes in tree */ member in struct:BTHeaderRec
H A Dhfs_hotfiles.c1903 bthp->totalNodes = SWAP_BE32 (filesize / nodesize);
/xnu-2782.1.97/bsd/hfs/hfscommon/headers/
H A DBTreesPrivate.h205 u_int32_t totalNodes; member in struct:BTreeControlBlock
/xnu-2782.1.97/iokit/Kernel/
H A DIOPMrootDomain.cpp7527 unsigned int totalNodes = 0; local
7654 totalNodes += count;
7671 totalNodes, gPMHaltArray->getCount(), numWorkers);

Completed in 348 milliseconds