Searched refs:btcb (Results 1 - 7 of 7) sorted by relevance

/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/Misc/
H A DBTreeWrapper.c33 static OSErr CheckBTreeKey(const BTreeKey *key, const BTreeControlBlock *btcb);
34 static Boolean ValidHFSRecord(const void *record, const BTreeControlBlock *btcb, u_int16_t recordSize);
47 BTreeControlBlock *btcb;
52 btcb = (BTreeControlBlock*) fcb->fcbBTCBPtr;
56 if ( btcb->maxKeyLength == kHFSExtentKeyMaximumLength )
58 else if ( btcb->maxKeyLength == kHFSPlusExtentKeyMaximumLength )
70 result = CheckBTreeKey((BTreeKey *) key, btcb);
73 BlockMoveData(key, &searchIterator.key, CalcKeySize(btcb, (BTreeKey *) key)); //�� should we range check against maxkeylen?
81 result = CheckBTreeKey(&searchIterator.key, btcb);
84 BlockMoveData(&searchIterator.key, foundKey, CalcKeySize(btcb,
102 BTreeControlBlock *btcb; local
136 CheckBTreeKey(const BTreeKey *key, const BTreeControlBlock *btcb) argument
156 ValidHFSRecord(const void *record, const BTreeControlBlock *btcb, u_int16_t recordSize) argument
[all...]
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/BTree/
H A DBTreeScanner.c88 err = GetRecordByIndex( scanState->btcb, scanState->currentNodePtr,
108 if ( scanState->recordsFound >= scanState->btcb->leafRecords )
179 if ( scanState->nodeNum >= scanState->btcb->totalNodes )
189 + scanState->btcb->nodeSize);
196 block.blockSize = scanState->btcb->nodeSize;
200 fref = scanState->btcb->fileRefNum;
254 myBTreeCBPtr = theScanStatePtr->btcb;
285 theScanStatePtr->nodesLeftInBuffer = buf_count(theScanStatePtr->bufferPtr) / theScanStatePtr->btcb->nodeSize;
338 BTreeControlBlock *btcb; local
343 btcb
[all...]
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/
H A Dhfs_btreeio.c588 BTreeControlBlockPtr btcb = NULL; local
645 MALLOC(btcb, BTreeControlBlock *, sizeof(BTreeControlBlock), M_TEMP, M_WAITOK);
646 bzero(btcb, sizeof(BTreeControlBlock));
648 btcb->nodeSize = nodesize;
649 btcb->maxKeyLength = kHFSPlusAttrKeyMaximumLength;
650 btcb->btreeType = 0xFF;
651 btcb->attributes = kBTVariableIndexKeysMask | kBTBigKeysMask;
652 btcb->version = kBTreeVersion;
653 btcb->writeCount = 1;
654 btcb
[all...]
H A Dhfs_endian.c92 BTreeControlBlockPtr btcb = (BTreeControlBlockPtr)VTOF(vp)->fcbBTCBPtr; local
123 if (btcb->totalNodes != 0) {
124 if (srcDesc->fLink >= btcb->totalNodes) {
125 printf("hfs_swap_BTNode: invalid forward link (0x%08x >= 0x%08x)\n", srcDesc->fLink, btcb->totalNodes);
129 if (srcDesc->bLink >= btcb->totalNodes) {
130 printf("hfs_swap_BTNode: invalid backward link (0x%08x >= 0x%08x)\n", srcDesc->bLink, btcb->totalNodes);
162 if (srcDesc->height > btcb->treeDepth) {
276 if (srcDesc->fLink >= btcb->totalNodes) {
288 if (srcDesc->bLink >= btcb->totalNodes) {
316 if (srcDesc->height > btcb
[all...]
H A Dhfs_search.c325 && myCatPositionPtr->writeCount != myBTScanState.btcb->writeCount) {
326 myCatPositionPtr->writeCount = myBTScanState.btcb->writeCount;
388 myCatPositionPtr->writeCount = myBTScanState.btcb->writeCount;
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/headers/
H A DBTreeScanner.h87 BTreeControlBlock * btcb; member in struct:BTScanState
H A DBTreesPrivate.h235 u_int32_t CalcKeySize(const BTreeControlBlock *btcb, const BTreeKey *key);
236 #define CalcKeySize(btcb, key) ( ((btcb)->attributes & kBTBigKeysMask) ? ((key)->length16 + 2) : ((key)->length8 + 1) )
238 u_int32_t KeyLength(const BTreeControlBlock *btcb, const BTreeKey *key);
239 #define KeyLength(btcb, key) ( ((btcb)->attributes & kBTBigKeysMask) ? (key)->length16 : (key)->length8 )

Completed in 87 milliseconds