/xnu-2422.115.4/bsd/hfs/hfscommon/BTree/ |
H A D | BTreeMiscOps.c | 220 OSStatus TreeIsDirty(BTreeControlBlockPtr btreePtr) argument 240 OSStatus UpdateHeader(BTreeControlBlockPtr btreePtr, Boolean forceWrite) argument 314 FindIteratorPosition(BTreeControlBlockPtr btreePtr, BTreeIteratorPtr iterator, BlockDescriptor *left, BlockDescriptor *middle, BlockDescriptor *right, u_int32_t *returnNodeNum, u_int16_t *returnIndex, Boolean *foundRecord ) argument 529 BTreeControlBlockPtr btreePtr; local 577 TrySimpleReplace(BTreeControlBlockPtr btreePtr, NodeDescPtr nodePtr, BTreeIterator *iterator, FSBufferDescriptor *record, u_int16_t recordLen, Boolean *recordInserted ) argument 656 IsItAHint(BTreeControlBlockPtr btreePtr, BTreeIterator *iterator, Boolean *answer) argument [all...] |
H A D | BTree.c | 189 BTreeControlBlockPtr btreePtr; local 399 BTreeControlBlockPtr btreePtr; local 464 BTreeControlBlockPtr btreePtr; local 656 BTreeControlBlockPtr btreePtr; local 974 BTreeControlBlockPtr btreePtr; local 1267 BTreeControlBlockPtr btreePtr; local 1430 BTreeControlBlockPtr btreePtr; local 1576 BTreeControlBlockPtr btreePtr; local 1689 BTreeControlBlockPtr btreePtr; local 1764 BTreeControlBlockPtr btreePtr; local 1799 BTreeControlBlockPtr btreePtr; local 1822 BTreeControlBlockPtr btreePtr; local 1859 BTreeControlBlockPtr btreePtr; local 1943 BTreeControlBlockPtr btreePtr; local 1982 BTreeControlBlockPtr btreePtr; local 2003 BTreeControlBlockPtr btreePtr; local 2027 BTreeControlBlockPtr btreePtr; local 2064 BTreeControlBlockPtr btreePtr; local [all...] |
H A D | BTreeAllocate.c | 120 OSStatus AllocateNode (BTreeControlBlockPtr btreePtr, u_int32_t *nodeNum) argument 238 FreeNode(BTreeControlBlockPtr btreePtr, u_int32_t nodeNum) argument 311 ExtendBTree(BTreeControlBlockPtr btreePtr, u_int32_t newTotalNodes ) argument 540 GetMapNode(BTreeControlBlockPtr btreePtr, BlockDescriptor *nodePtr, u_int16_t **mapPtr, u_int16_t *mapSize ) argument 606 CalcMapBits(BTreeControlBlockPtr btreePtr) argument 629 BTreeControlBlockPtr btreePtr; local [all...] |
H A D | BTreeNodeOps.c | 192 OSStatus GetNode (BTreeControlBlockPtr btreePtr, argument 258 GetNewNode(BTreeControlBlockPtr btreePtr, u_int32_t nodeNum, NodeRec *returnNodePtr ) argument 315 ReleaseNode(BTreeControlBlockPtr btreePtr, NodePtr nodePtr ) argument 357 TrashNode(BTreeControlBlockPtr btreePtr, NodePtr nodePtr ) argument 399 UpdateNode(BTreeControlBlockPtr btreePtr, NodePtr nodePtr, u_int32_t transactionID, u_int32_t flags ) argument 468 ClearNode(BTreeControlBlockPtr btreePtr, NodeDescPtr node ) argument 490 InsertRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, RecordPtr recPtr, u_int16_t recSize ) argument 560 InsertKeyRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, KeyPtr keyPtr, u_int16_t keyLength, RecordPtr recPtr, u_int16_t recSize ) argument 665 DeleteRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index ) argument 718 SearchNode( BTreeControlBlockPtr btreePtr, NodeDescPtr node, KeyPtr searchKey, u_int16_t *returnIndex ) argument 776 GetRecordByIndex(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, KeyPtr *keyPtr, u_int8_t * *dataPtr, u_int16_t *dataSize ) argument 827 GetNodeDataSize(BTreeControlBlockPtr btreePtr, NodeDescPtr node ) argument 850 GetNodeFreeSize(BTreeControlBlockPtr btreePtr, NodeDescPtr node ) argument 933 GetRecordSize(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index ) argument 958 GetOffsetAddress(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index ) argument 986 GetChildNodeNum(BTreeControlBlockPtr btreePtr, NodeDescPtr nodePtr, u_int16_t index ) argument 1015 InsertOffset(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, u_int16_t delta ) argument 1049 DeleteOffset(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index ) argument [all...] |
H A D | BTreeNodeReserve.c | 251 BTUpdateReserve(BTreeControlBlockPtr btreePtr, int nodes) argument
|
H A D | BTreeTreeOps.c | 196 OSStatus SearchTree (BTreeControlBlockPtr btreePtr, argument 351 InsertTree( BTreeControlBlockPtr btreePtr, TreePathTable treePathTable, KeyPtr keyPtr, u_int8_t * recPtr, u_int16_t recSize, BlockDescriptor *targetNode, u_int16_t index, u_int16_t level, Boolean replacingKey, u_int32_t *insertNode ) argument 382 InsertLevel(BTreeControlBlockPtr btreePtr, TreePathTable treePathTable, InsertKey *primaryKey, InsertKey *secondaryKey, BlockDescriptor *targetNode, u_int16_t index, u_int16_t level, u_int32_t *insertNode ) argument 557 InsertNode(BTreeControlBlockPtr btreePtr, InsertKey *key, BlockDescriptor *rightNode, u_int32_t node, u_int16_t index, u_int32_t *newNode, u_int16_t *newIndex, BlockDescriptor *leftNode, Boolean *updateParent, Boolean *insertParent, Boolean *rootSplit ) argument 697 DeleteTree(BTreeControlBlockPtr btreePtr, TreePathTable treePathTable, BlockDescriptor *targetNode, u_int16_t index, u_int16_t level ) argument 871 CollapseTree(BTreeControlBlockPtr btreePtr, BlockDescriptor *blockPtr ) argument 955 RotateLeft(BTreeControlBlockPtr btreePtr, NodeDescPtr leftNode, NodeDescPtr rightNode, u_int16_t rightInsertIndex, KeyPtr keyPtr, u_int8_t * recPtr, u_int16_t recSize, u_int16_t *insertIndex, u_int32_t *insertNodeNum, Boolean *recordFit, u_int16_t *recsRotated ) argument 1117 SplitLeft(BTreeControlBlockPtr btreePtr, BlockDescriptor *leftNode, BlockDescriptor *rightNode, u_int32_t rightNodeNum, u_int16_t index, KeyPtr keyPtr, u_int8_t * recPtr, u_int16_t recSize, u_int16_t *insertIndex, u_int32_t *insertNodeNum, u_int16_t *recsRotated ) argument 1234 RotateRecordLeft(BTreeControlBlockPtr btreePtr, NodeDescPtr leftNode, NodeDescPtr rightNode ) argument 1258 AddNewRootNode(BTreeControlBlockPtr btreePtr, NodeDescPtr leftNode, NodeDescPtr rightNode ) argument 1334 GetKeyLength( const BTreeControlBlock *btreePtr, const BTreeKey *key, Boolean forLeafNode ) argument [all...] |