Searched refs:freeNodes (Results 1 - 9 of 9) sorted by relevance

/darwin-on-arm/xnu/bsd/hfs/hfscommon/BTree/
H A DBTreeMiscOps.c186 if ( header->freeNodes >= totalNodes )
269 header->freeNodes = btreePtr->freeNodes;
H A DBTree.c282 btreePtr->freeNodes = header->freeNodes;
1303 if (btreePtr->freeNodes == 0)
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;
1788 info->numFreeNodes = btreePtr->freeNodes;
1886 btreePtr->freeNodes = header->freeNodes;
[all...]
H A DBTreeAllocate.c198 --btreePtr->freeNodes;
275 ++btreePtr->freeNodes;
381 btreePtr->totalNodes = newTotalNodes; // do we need to update freeNodes here too?
495 btreePtr->freeNodes += (newTotalNodes - oldTotalNodes) - newMapNodes;
H A DBTreeNodeReserve.c152 availNodes = btree->freeNodes - btree->reservedNodes;
/darwin-on-arm/xnu/bsd/hfs/
H A Dhfs_btreeio.c743 btcb->freeNodes = btcb->totalNodes - 1 - num_map_nodes;
781 bthp->freeNodes = btcb->freeNodes;
H A Dhfs_format.h744 u_int32_t freeNodes; /* number of unused (free) nodes in tree */ member in struct:BTHeaderRec
H A Dhfs_endian.c256 srcHead->freeNodes = SWAP_BE32 (srcHead->freeNodes);
H A Dhfs_hotfiles.c1889 bthp->freeNodes = SWAP_BE32 (nodecnt - 1);
/darwin-on-arm/xnu/bsd/hfs/hfscommon/headers/
H A DBTreesPrivate.h206 u_int32_t freeNodes; member in struct:BTreeControlBlock

Completed in 44 milliseconds