Searched refs:btcb (Results 1 - 8 of 8) sorted by relevance
| /xnu-2782.1.97/bsd/hfs/hfscommon/BTree/ |
| H A D | BTreeScanner.c | 88 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...] |
| /xnu-2782.1.97/bsd/hfs/hfscommon/Misc/ |
| H A D | BTreeWrapper.c | 36 static OSErr CheckBTreeKey(const BTreeKey *key, const BTreeControlBlock *btcb);
37 static Boolean ValidHFSRecord(const void *record, const BTreeControlBlock *btcb, u_int16_t recordSize);
45 BTreeControlBlock *btcb; local
55 btcb = (BTreeControlBlock*) fcb->fcbBTCBPtr;
63 result = CheckBTreeKey((const BTreeKey *) key, btcb);
68 BlockMoveData(key, &iterator->key, CalcKeySize(btcb, (const BTreeKey *) key)); //�� should we range check against maxkeylen?
70 if ( DEBUG_BUILD && !ValidHFSRecord(newData, btcb, dataSize) )
85 static OSErr CheckBTreeKey(const BTreeKey *key, const BTreeControlBlock *btcb) argument
89 if ( btcb->attributes & kBTBigKeysMask )
94 if ( (keyLen < 6) || (keyLen > btcb
105 ValidHFSRecord(const void *record, const BTreeControlBlock *btcb, u_int16_t recordSize) argument
[all...] |
| /xnu-2782.1.97/bsd/hfs/ |
| H A D | hfs_btreeio.c | 646 BTreeControlBlockPtr btcb = NULL; local
710 MALLOC(btcb, BTreeControlBlock *, sizeof(BTreeControlBlock), M_TEMP, M_WAITOK);
711 bzero(btcb, sizeof(BTreeControlBlock));
713 btcb->nodeSize = nodesize;
714 btcb->maxKeyLength = kHFSPlusAttrKeyMaximumLength;
715 btcb->btreeType = 0xFF;
716 btcb->attributes = kBTVariableIndexKeysMask | kBTBigKeysMask;
717 btcb->version = kBTreeVersion;
718 btcb->writeCount = 1;
719 btcb
[all...] |
| H A D | hfs_endian.c | 96 BTreeControlBlockPtr btcb = (BTreeControlBlockPtr)VTOF(vp)->fcbBTCBPtr; local
127 if (btcb->totalNodes != 0) {
128 if (srcDesc->fLink >= btcb->totalNodes) {
129 printf("hfs_swap_BTNode: invalid forward link (0x%08x >= 0x%08x)\n", srcDesc->fLink, btcb->totalNodes);
133 if (srcDesc->bLink >= btcb->totalNodes) {
134 printf("hfs_swap_BTNode: invalid backward link (0x%08x >= 0x%08x)\n", srcDesc->bLink, btcb->totalNodes);
284 if (srcDesc->fLink >= btcb->totalNodes) {
296 if (srcDesc->bLink >= btcb->totalNodes) {
|
| H A D | hfs_search.c | 346 && myCatPositionPtr->writeCount != myBTScanState.btcb->writeCount) {
347 myCatPositionPtr->writeCount = myBTScanState.btcb->writeCount;
417 myCatPositionPtr->writeCount = myBTScanState.btcb->writeCount;
|
| /xnu-2782.1.97/bsd/hfs/hfscommon/headers/ |
| H A D | BTreeScanner.h | 87 BTreeControlBlock * btcb; member in struct:BTScanState
|
| H A D | BTreesPrivate.h | 235 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 )
|
| /xnu-2782.1.97/bsd/hfs/hfscommon/Catalog/ |
| H A D | CatalogUtilities.c | 144 BTreeControlBlock *btcb; local
155 btcb = (BTreeControlBlock *)fcb->fcbBTCBPtr;
166 BlockMoveData(&searchIterator->key, keyPtr, CalcKeySize(btcb, &searchIterator->key));
|
Completed in 59 milliseconds