Searched refs:BTreeKey (Results 1 - 14 of 14) sorted by relevance
| /macosx-10.10/hfs-285/fsck_hfs/dfalib/ |
| H A D | SBTree.c | 43 static OSErr CheckBTreeKey(const BTreeKey *key, const BTreeControlBlock *btcb);
85 result = CheckBTreeKey((BTreeKey *) key, btcb);
88 CopyMemory(key, &searchIterator.key, CalcKeySize(btcb, (BTreeKey *) key)); //�� should we range check against maxkeylen?
239 result = CheckBTreeKey((BTreeKey *) key, btcb);
242 CopyMemory(key, &iterator.key, CalcKeySize(btcb, (BTreeKey *) key)); //�� should we range check against maxkeylen?
270 result = CheckBTreeKey((BTreeKey *) key, btcb);
273 CopyMemory(key, &iterator.key, CalcKeySize(btcb, (BTreeKey *) key)); //�� should we range check against maxkeylen?
301 result = CheckBTreeKey((BTreeKey *) key, btcb);
304 CopyMemory(key, &iterator.key, CalcKeySize(btcb, (BTreeKey *) key)); //�� should we range check against maxkeylen?
430 static OSErr CheckBTreeKey(const BTreeKey *ke
[all...] |
| H A D | BTree.h | 250 typedef BTreeKey *BTreeKeyPtr;
321 BTreeKey key;
|
| H A D | BTreePrivate.h | 153 UInt32 CalcKeySize(const BTreeControlBlock *btcb, const BTreeKey *key);
159 UInt32 KeyLength(const BTreeControlBlock *btcb, const BTreeKey *key);
|
| H A D | BTreeNodeOps.c | 907 pos += CalcKeySize(btreePtr, (BTreeKey *) pos); // key.length + size of length field
|
| H A D | BTree.c | 58 static void CopyKey(BTreeControlBlockPtr btcb, const BTreeKey *srcKey, BTreeKey *destKey)
|
| H A D | BTreeTreeOps.c | 109 const BTreeKey *key,
1327 static UInt16 GetKeyLength ( const BTreeControlBlock *btreePtr, const BTreeKey *key, Boolean forLeafNode )
|
| H A D | SVerify2.c | 595 if ( CompareKeys( (BTreeControlBlockPtr)calculatedBTCB, (BTreeKey *)parKey, keyPtr ) != 0 )
605 HexDump(parKey, CalcKeySize(calculatedBTCB, (BTreeKey *)parKey), FALSE);
|
| H A D | SRepair.c | 1703 GetRecordByIndex( calculatedBTCB, (NodeDescPtr)nodeDescP, index, (BTreeKey **)&keyP, &dataPtr, &recSize );
3632 HexDump(catKey, CalcKeySize(GPtr->calculatedCatalogBTCB, (BTreeKey *)catKey), FALSE);
|
| /macosx-10.10/xnu-2782.1.97/bsd/hfs/hfscommon/Misc/ |
| H A D | BTreeWrapper.c | 36 static OSErr CheckBTreeKey(const BTreeKey *key, const BTreeControlBlock *btcb);
63 result = CheckBTreeKey((const BTreeKey *) key, btcb);
68 BlockMoveData(key, &iterator->key, CalcKeySize(btcb, (const BTreeKey *) key)); //�� should we range check against maxkeylen?
85 static OSErr CheckBTreeKey(const BTreeKey *key, const BTreeControlBlock *btcb)
|
| /macosx-10.10/xnu-2782.1.97/bsd/hfs/hfscommon/headers/ |
| H A D | BTreesInternal.h | 231 typedef BTreeKey *BTreeKeyPtr;
275 BTreeKey key;
|
| H A D | BTreesPrivate.h | 235 u_int32_t CalcKeySize(const BTreeControlBlock *btcb, const BTreeKey *key);
238 u_int32_t KeyLength(const BTreeControlBlock *btcb, const BTreeKey *key);
|
| /macosx-10.10/xnu-2782.1.97/bsd/hfs/ |
| H A D | hfs_format.h | 705 union BTreeKey{ union
710 typedef union BTreeKey BTreeKey; typedef in typeref:union:BTreeKey
|
| /macosx-10.10/xnu-2782.1.97/bsd/hfs/hfscommon/BTree/ |
| H A D | BTreeNodeOps.c | 993 pos += CalcKeySize(btreePtr, (BTreeKey *) pos); // key.length + size of length field
|
| H A D | BTreeTreeOps.c | 167 const BTreeKey *key,
1334 static u_int16_t GetKeyLength ( const BTreeControlBlock *btreePtr, const BTreeKey *key, Boolean forLeafNode )
|
Completed in 288 milliseconds