/darwin-on-arm/xnu/bsd/hfs/hfscommon/BTree/ |
H A D | BTree.c | 189 BTreeControlBlockPtr btreePtr; local 204 btreePtr = (BTreeControlBlockPtr) filePtr->fcbBTCBPtr; 205 btreePtr->keyCompareProc = keyCompareProc; 215 btreePtr = (BTreeControlBlock*) NewPtrSysClear( sizeof( BTreeControlBlock ) ); 216 if (btreePtr == nil) 218 Panic ("BTOpen: no memory for btreePtr."); 222 btreePtr->getBlockProc = GetBTreeBlock; 223 btreePtr->releaseBlockProc = ReleaseBTreeBlock; 224 btreePtr->setEndOfForkProc = ExtendBTreeFile; 225 btreePtr 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 | BTreeNodeOps.c | 149 u_int16_t *GetOffsetAddress (BTreeControlBlockPtr btreePtr, 153 void InsertOffset (BTreeControlBlockPtr btreePtr, 158 void DeleteOffset (BTreeControlBlockPtr btreePtr, 165 #define GetRecordOffset(btreePtr,node,index) (*(short *) ((u_int8_t *)(node) + (btreePtr)->nodeSize - ((index) << 1) - kOffsetSize)) 182 Input: btreePtr - pointer to BTree control block 192 OSStatus GetNode (BTreeControlBlockPtr btreePtr, argument 203 if( nodeNum >= btreePtr->totalNodes ) 210 nodePtr->blockSize = btreePtr->nodeSize; // indicate the size of a node 218 getNodeProc = btreePtr 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 | BTreeMiscOps.c | 220 OSStatus TreeIsDirty(BTreeControlBlockPtr btreePtr) argument 222 return (btreePtr->flags & kBTHeaderDirty); 233 Input: btreePtr - pointer to BTreeInfoRec 240 OSStatus UpdateHeader(BTreeControlBlockPtr btreePtr, Boolean forceWrite) argument 247 if ((btreePtr->flags & kBTHeaderDirty) == 0) // btree info already flushed 251 err = GetNode (btreePtr, kHeaderNodeNum, 0, &node ); 257 ModifyBlockStart(btreePtr->fileRefNum, &node); 261 header->treeDepth = btreePtr->treeDepth; 262 header->rootNode = btreePtr->rootNode; 263 header->leafRecords = btreePtr 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 | BTreeAllocate.c | 88 static OSStatus GetMapNode (BTreeControlBlockPtr btreePtr, 110 Input: btreePtr - pointer to control block for BTree file 120 OSStatus AllocateNode (BTreeControlBlockPtr btreePtr, u_int32_t *nodeNum) argument 139 err = GetMapNode (btreePtr, &node, &mapPtr, &mapSize); 143 ModifyBlockStart(btreePtr->fileRefNum, &node); 185 if (nodeNumber >= btreePtr->totalNodes) 195 err = UpdateNode (btreePtr, &node, 0, kLockTransaction); 198 --btreePtr->freeNodes; 199 btreePtr->flags |= kBTHeaderDirty; 202 BTUpdateReserve(btreePtr, 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 | BTreeTreeOps.c | 108 static OSStatus AddNewRootNode (BTreeControlBlockPtr btreePtr, 112 static OSStatus CollapseTree (BTreeControlBlockPtr btreePtr, 115 static OSStatus RotateLeft (BTreeControlBlockPtr btreePtr, 127 static Boolean RotateRecordLeft (BTreeControlBlockPtr btreePtr, 131 static OSStatus SplitLeft (BTreeControlBlockPtr btreePtr, 145 static OSStatus InsertLevel (BTreeControlBlockPtr btreePtr, 154 static OSErr InsertNode (BTreeControlBlockPtr btreePtr, 166 static u_int16_t GetKeyLength (const BTreeControlBlock *btreePtr, 183 Input: btreePtr - pointer to control block of BTree to search 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...] |
H A D | BTreeNodeReserve.c | 235 BTUpdateReserve(BTreeControlBlockPtr btreePtr, int nodes) argument 237 nr_update(btreePtr->fileRefNum, nodes);
|
/darwin-on-arm/xnu/bsd/hfs/hfscommon/headers/ |
H A D | BTreesPrivate.h | 182 #define M_BTreeHeaderDirty(btreePtr) btreePtr->flags |= kBTHeaderDirty 307 int32_t CompareKeys (BTreeControlBlockPtr btreePtr, 313 OSStatus AllocateNode (BTreeControlBlockPtr btreePtr, 316 OSStatus FreeNode (BTreeControlBlockPtr btreePtr, 319 OSStatus ExtendBTree (BTreeControlBlockPtr btreePtr, 322 u_int32_t CalcMapBits (BTreeControlBlockPtr btreePtr); 325 void BTUpdateReserve (BTreeControlBlockPtr btreePtr, 336 OSStatus UpdateHeader (BTreeControlBlockPtr btreePtr, 339 OSStatus FindIteratorPosition (BTreeControlBlockPtr btreePtr, [all...] |