| /xnu-2782.1.97/bsd/hfs/hfscommon/BTree/ |
| H A D | BTreeAllocate.c | 112 Output: nodeNum - number of node allocated
120 OSStatus AllocateNode (BTreeControlBlockPtr btreePtr, u_int32_t *nodeNum) argument
204 *nodeNum = nodeNumber;
213 *nodeNum = 0;
224 Function: Finds the bit representing the node specified by nodeNum in the node
229 nodeNum - number of node to mark free
238 OSStatus FreeNode (BTreeControlBlockPtr btreePtr, u_int32_t nodeNum) argument
253 while (nodeNum >= nodeIndex)
266 nodeNum -= (nodeIndex - (mapSize << 3)); // relative to this map record
267 bitOffset = 15 - (nodeNum
322 u_int32_t nodeNum, nextNodeNum; local
[all...] |
| H A D | BTree.c | 70 <CS7> 7/25/97 DSH BTSearchRecord now takes a heuristicHint, nodeNum, and tries it
134 set the local nodeNum variable correctly so that the resultant
466 u_int32_t nodeNum; local
505 nodeNum = searchIterator->hint.nodeNum;
507 err = GetNode (btreePtr, nodeNum, kGetNodeHint, &node);
538 err = SearchTree ( btreePtr, &searchIterator->key, treePathTable, &nodeNum, &node, &index);
580 resultIterator->hint.nodeNum = nodeNum;
613 resultIterator->hint.nodeNum
662 u_int32_t nodeNum; local
979 u_int32_t nodeNum; local
1693 u_int32_t nodeNum; local
[all...] |
| H A D | BTreeMiscOps.c | 305 nodeNum - description
325 u_int32_t nodeNum; local
331 // assume nodeNum points to u_int32_t
353 nodeNum = iterator->hint.nodeNum;
359 err = GetNode (btreePtr, nodeNum, kGetNodeHint, middle);
360 if( err == fsBTInvalidNodeErr ) // returned if nodeNum is out of range
377 iterator->hint.nodeNum = 0;
386 nodeNum = ((NodeDescPtr) middle->buffer)->bLink;
395 err = GetNode (btreePtr, nodeNum,
[all...] |
| H A D | BTreeScanner.c | 175 ++scanState->nodeNum;
179 if ( scanState->nodeNum >= scanState->btcb->totalNodes )
195 block.blockNum = scanState->nodeNum;
208 printf("hfs: FindNextLeafNode: Error from hfs_swap_BTNode (node %u)\n", scanState->nodeNum);
257 myErr = hfs_bmap(myBTreeCBPtr->fileRefNum, theScanStatePtr->nodeNum,
361 scanState->nodeNum = startingNode;
394 *startingNode = scanState->nodeNum;
|
| H A D | BTreeNodeOps.c | 183 nodeNum - number of node to request
193 u_int32_t nodeNum,
202 // is nodeNum within proper range?
203 if( nodeNum >= btreePtr->totalNodes )
205 Panic("GetNode:nodeNum >= totalNodes");
220 nodeNum,
250 nodeNum - number of node to request
259 u_int32_t nodeNum,
274 nodeNum,
309 nodeNum
192 GetNode(BTreeControlBlockPtr btreePtr, u_int32_t nodeNum, u_int32_t flags, NodeRec *nodePtr ) argument
258 GetNewNode(BTreeControlBlockPtr btreePtr, u_int32_t nodeNum, NodeRec *returnNodePtr ) argument
[all...] |
| H A D | BTreeTreeOps.c | 187 Output: nodeNum - number of the node containing the key position
199 u_int32_t *nodeNum,
323 *nodeNum = curNodeNum;
338 *nodeNum = 0;
876 u_int32_t nodeNum; local
891 nodeNum = btreePtr->rootNode;
899 err = FreeNode (btreePtr, nodeNum);
196 SearchTree(BTreeControlBlockPtr btreePtr, BTreeKeyPtr searchKey, TreePathTable treePathTable, u_int32_t *nodeNum, BlockDescriptor *nodePtr, u_int16_t *returnIndex ) argument
|
| /xnu-2782.1.97/bsd/hfs/hfscommon/headers/ |
| H A D | BTreeScanner.h | 78 number nodeNum. If so, then the next attempt to get a record will move
90 u_int32_t nodeNum; // zero is first node member in struct:BTScanState
|
| H A D | BTreesPrivate.h | 314 u_int32_t *nodeNum);
317 u_int32_t nodeNum);
344 u_int32_t *nodeNum,
371 u_int32_t nodeNum,
392 u_int32_t nodeNum,
484 u_int32_t *nodeNum,
|
| H A D | BTreesInternal.h | 258 u_int32_t nodeNum; // node the key was last seen in member in struct:BTreeHint
|
| /xnu-2782.1.97/bsd/hfs/hfscommon/Catalog/ |
| H A D | CatalogUtilities.c | 74 searchIterator->hint.nodeNum = hint;
82 *newHint = searchIterator->hint.nodeNum;
165 *newHint = searchIterator->hint.nodeNum;
|
| /xnu-2782.1.97/bsd/hfs/hfscommon/Misc/ |
| H A D | BTreeWrapper.c | 61 iterator->hint.nodeNum = hint;
75 *newHint = iterator->hint.nodeNum;
|
| H A D | FileExtentMapping.c | 350 *foundHint = btIterator->hint.nodeNum;
422 *hint = btIterator->hint.nodeNum;
2005 btIterator->hint.nodeNum = extentBTreeHint;
2032 btIterator->hint.nodeNum = extentBTreeHint;
|
| /xnu-2782.1.97/bsd/hfs/ |
| H A D | hfs_catalog.c | 649 iterator->hint.nodeNum = 0;
889 iterator->hint.nodeNum = hint;
911 hint = iterator->hint.nodeNum;
1171 bto->iterator.hint.nodeNum = 0;
1250 builddesc(pluskey, new_fileid, bto->iterator.hint.nodeNum,
1581 builddesc(pluskey, from_cdp->cd_cnid, to_iterator->hint.nodeNum,
1636 iterator->hint.nodeNum = 0;
1745 iterator->hint.nodeNum = descp->cd_hint;
1753 descp->cd_hint = iterator->hint.nodeNum;
2472 bto->iterator.hint.nodeNum
[all...] |