Searched refs:treeDepth (Results 1 - 8 of 8) sorted by relevance

/xnu-2782.1.97/bsd/hfs/hfscommon/BTree/
H A DBTree.c274 btreePtr->treeDepth = header->treeDepth;
1333 * height with treeDepth.
1335 btreePtr->treeDepth = 1;
1369 if ((btreePtr->treeDepth + 1UL) > btreePtr->freeNodes)
1371 nodesNeeded = btreePtr->treeDepth + 1 + btreePtr->totalNodes - btreePtr->freeNodes;
1520 if ((btreePtr->treeDepth + 1UL) > btreePtr->freeNodes)
1522 nodesNeeded = btreePtr->treeDepth + 1 + btreePtr->totalNodes - btreePtr->freeNodes;
1725 if ((btreePtr->treeDepth + 1UL) > btreePtr->totalNodes)
1727 nodesNeeded = btreePtr->treeDepth
[all...]
H A DBTreeMiscOps.c198 if ( header->treeDepth > kMaxTreeDepth )
261 header->treeDepth = btreePtr->treeDepth;
H A DBTreeTreeOps.c216 level = btreePtr->treeDepth;
465 PanicIf ( (level == btreePtr->treeDepth), " InsertLevel: unfinished insert!?");
610 if ( (index == 0) && (((NodeDescPtr) targetNode->buffer)->height != btreePtr->treeDepth) )
657 if ( ((NodeDescPtr) rightNode->buffer)->height == btreePtr->treeDepth )
793 if ( level == btreePtr->treeDepth ) // then targetNode->buffer is the root node
801 btreePtr->treeDepth = 0;
893 --btreePtr->treeDepth;
1288 ((NodeDescPtr)rootNode.buffer)->height = ++btreePtr->treeDepth;
H A DBTreeNodeReserve.c135 height = btree->treeDepth;
/xnu-2782.1.97/bsd/hfs/hfscommon/headers/
H A DBTreesInternal.h241 u_int16_t treeDepth; member in struct:BTreeInfoRec
H A DBTreesPrivate.h196 u_int16_t treeDepth; member in struct:BTreeControlBlock
/xnu-2782.1.97/bsd/hfs/
H A Dhfs_format.h733 u_int16_t treeDepth; /* maximum height (usually leaf nodes) */ member in struct:BTHeaderRec
H A Dhfs_endian.c251 srcHead->treeDepth = SWAP_BE16 (srcHead->treeDepth);

Completed in 91 milliseconds