2 * Copyright (c) 2000-2015 Apple Inc. All rights reserved.
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. The rights granted to you under the License
10 * may not be used to create, or enable the creation or redistribution of,
11 * unlawful or unlicensed copies of an Apple operating system, or to
12 * circumvent, violate, or enable the circumvention or violation of, any
13 * terms of an Apple operating system software license agreement.
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
18 * The Original Code and all software distributed under the License are
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
23 * Please see the License for the specific language governing rights and
24 * limitations under the License.
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
31 Contains: Private interface file for the BTree Module.
33 Version: xxx put the technology version here xxx
35 Written by: Gordon Sheridan and Bill Bruffey
37 Copyright: (c) 1992-1999 by Apple Inc., all rights reserved.
43 Other Contact: Mark Day
45 Technology: File Systems
55 Change History (most recent first):
56 <MacOSX> 3/19/99 djb Disable MoveRecordsLeft/Right macros since bcopy is broken.
58 <MacOSX> 8/10/98 djb Removed unused BTreeIterator from BTreeControlBlock, fixed alignment.
60 <CS5> 9/4/97 djb Convert MoveRecordsLeft and GetLeftSiblingNode to macros.
61 <CS4> 7/24/97 djb Add macro for GetRecordAddress (was a function before).
62 <CS3> 7/21/97 msd GetRecordByIndex now returns an OSStatus.
63 <CS2> 7/16/97 DSH FilesInternal.i renamed FileMgrInternal.i to avoid name
65 <CS1> 4/23/97 djb first checked in
67 <HFS6> 3/17/97 DSH Added a refCon field to BTreeControlBlock, for DFA use, to point
68 to additional data. Fixed Panic macros for use with SC.
69 <HFS5> 2/19/97 djb Add InsertKey struct. Moved on-disk definitions to
71 <HFS4> 1/27/97 djb InsertTree and DeleteTree are now recursive and support variable
73 <HFS3> 1/15/97 djb Move GetFileRefNumFromFCB macro to FilesInternal.h. Added
74 kBTVariableIndexKeysMask.
75 <HFS2> 1/3/97 djb Added support for large keys.
76 <HFS1> 12/19/96 djb first checked in
78 History applicable to original Scarecrow Design:
80 <7> 10/25/96 ser Changing for new VFPI
81 <6> 10/18/96 ser Converting over VFPI changes
82 <5> 9/17/96 dkh More BTree statistics
83 <4> 9/16/96 dkh Revised BTree statistics
84 <3> 6/20/96 dkh Radar #1358740. Switch from using Pools to debug MemAllocators.
85 <2> 12/7/95 dkh D10E2 build. Changed usage of Ref data type to LogicalAddress.
86 <1> 10/18/95 rst Moved from Scarecrow project.
88 <19> 11/22/94 djb Add prototype for GetMapNode
89 <18> 11/16/94 prp Add IsItAHint routine prototype.
90 <17> 9/30/94 prp Get in sync with D2 interface changes.
91 <16> 7/25/94 wjk Eliminate usage of BytePtr in favor of UInt8 *.
92 <15> 7/22/94 wjk Convert to the new set of header files.
93 <14> 5/31/94 srs Moved Btree types to public interface
94 <13> 12/9/93 wjk Add 68k alignment pragma's around persistent structures.
95 <12> 11/30/93 wjk Move from Makefiles to BuildFiles. Fit into the ModernOS and
97 <11> 11/23/93 wjk Changes required to compile on the RS6000.
98 <10> 8/30/93 CH Removed the M_ExitOnError and M_ReturnErrorIf macros which were
99 already defined in FileSystemPriv.h (included here).
100 <9> 8/30/93 CH Added parens around the M_ReturnErrorIf macro.
101 <8> 5/21/93 gs Add kBadClose flag. Add some prototypes for internal routines.
102 <7> 5/10/93 gs Change Ptr to BytePtr. Move BTreeTypes to BTree.h. Add
103 DeleteTree prototype.
104 <6> 3/23/93 gs Remove mysterious "flags" field from HeaderRec structure. Move
105 prototypes of private functions to top of respective source
107 <5> 2/8/93 gs Update to use FSAgent.h Get/Release/SetEOF/SetBlockSize
108 procPtrs. Add UpdateNode routine.
109 <4> 12/10/92 gs Add Key Descriptor function declarations.
110 <3> 12/8/92 gs Add HeaderRec structure and incorporate review feedback.
111 <2> 12/2/92 gs Add GetNode and ReleaseNode callback procptrs to BTree CB, and
112 add internal function declarations.
113 <1> 11/15/92 gs first checked in
117 #ifndef __BTREESPRIVATE__
118 #define __BTREESPRIVATE__
120 #include <sys/appleapiopts.h>
123 #ifdef __APPLE_API_PRIVATE
125 #include "hfs_macos_defs.h"
127 #ifndef __FILEMGRINTERNAL__
128 #include "FileMgrInternal.h"
131 #ifndef __BTREESINTERNAL__
132 #include "BTreesInternal.h"
136 /////////////////////////////////// Constants ///////////////////////////////////
138 #define kBTreeVersion 1
139 #define kMaxTreeDepth 16
142 #define kHeaderNodeNum 0
143 #define kKeyDescRecord 1
146 // Header Node Record Offsets
148 kHeaderRecOffset
= 0x000E,
149 kKeyDescRecOffset
= 0x0078,
150 kHeaderMapRecOffset
= 0x00F8
153 #define kMinNodeSize 512
155 #define kMinRecordSize 6
156 // where is minimum record size enforced?
158 // miscellaneous BTree constants
169 // illegal string attribute bits set in mask
170 #define kBadStrAttribMask 0xCF
174 //////////////////////////////////// Macros /////////////////////////////////////
176 #define M_NodesInMap(mapSize) ((mapSize) << 3)
178 #define M_ClearBitNum(integer,bitNumber) ((integer) &= (~(1<<(bitNumber))))
179 #define M_SetBitNum(integer,bitNumber) ((integer) |= (1<<(bitNumber)))
180 #define M_IsOdd(integer) (((integer) & 1) != 0)
181 #define M_IsEven(integer) (((integer) & 1) == 0)
183 #define M_MapRecordSize(nodeSize) (nodeSize - sizeof (BTNodeDescriptor) - 6)
184 #define M_HeaderMapRecordSize(nodeSize) (nodeSize - sizeof(BTNodeDescriptor) - sizeof(BTHeaderRec) - 128 - 8)
186 #define M_SWAP_BE16_ClearBitNum(integer,bitNumber) ((integer) &= SWAP_BE16(~(1<<(bitNumber))))
187 #define M_SWAP_BE16_SetBitNum(integer,bitNumber) ((integer) |= SWAP_BE16(1<<(bitNumber)))
189 ///////////////////////////////////// Types /////////////////////////////////////
191 typedef struct BTreeControlBlock
{ // fields specific to BTree CBs
193 u_int8_t keyCompareType
; /* Key string Comparison Type */
196 FileReference fileRefNum
; // refNum of btree file
197 KeyCompareProcPtr keyCompareProc
;
199 u_int32_t leafRecords
;
200 u_int32_t firstLeafNode
;
201 u_int32_t lastLeafNode
;
203 u_int16_t maxKeyLength
;
204 u_int32_t totalNodes
;
207 u_int16_t reserved3
; // 4-byte alignment
211 u_int32_t flags
; // dynamic flags
212 u_int32_t attributes
; // persistent flags
213 u_int32_t writeCount
;
214 u_int32_t lastfsync
; /* Last time that this was fsynced */
216 GetBlockProcPtr getBlockProc
;
217 ReleaseBlockProcPtr releaseBlockProc
;
218 SetEndOfForkProcPtr setEndOfForkProc
;
220 // statistical information
221 u_int32_t numGetNodes
;
222 u_int32_t numGetNewNodes
;
223 u_int32_t numReleaseNodes
;
224 u_int32_t numUpdateNodes
;
225 u_int32_t numMapNodesRead
; // map nodes beyond header node
226 u_int32_t numHintChecks
;
227 u_int32_t numPossibleHints
; // Looks like a formated hint
228 u_int32_t numValidHints
; // Hint used to find correct record.
229 u_int32_t reservedNodes
;
230 BTreeIterator iterator
; // useable when holding exclusive b-tree lock
233 void *madeDirtyBy
[2];
235 } BTreeControlBlock
, *BTreeControlBlockPtr
;
237 u_int32_t
CalcKeySize(const BTreeControlBlock
*btcb
, const BTreeKey
*key
);
238 #define CalcKeySize(btcb, key) ( ((btcb)->attributes & kBTBigKeysMask) ? ((key)->length16 + 2) : ((key)->length8 + 1) )
240 u_int32_t
KeyLength(const BTreeControlBlock
*btcb
, const BTreeKey
*key
);
241 #define KeyLength(btcb, key) ( ((btcb)->attributes & kBTBigKeysMask) ? (key)->length16 : (key)->length8 )
246 kBTHeaderDirty
= 0x00000001
249 static inline void M_BTreeHeaderDirty(BTreeControlBlock
*bt
) {
251 bt
->madeDirtyBy
[0] = __builtin_return_address(0);
252 bt
->madeDirtyBy
[1] = __builtin_return_address(1);
254 bt
->flags
|= kBTHeaderDirty
;
257 typedef int8_t *NodeBuffer
;
258 typedef BlockDescriptor NodeRec
, *NodePtr
; //\80\80 remove this someday...
263 //// Tree Path Table - constructed by SearchTree, used by InsertTree and DeleteTree
266 u_int32_t node
; // node number
268 u_int16_t reserved
; // align size to a power of 2
269 } TreePathRecord
, *TreePathRecordPtr
;
271 typedef TreePathRecord TreePathTable
[kMaxTreeDepth
];
274 //// InsertKey - used by InsertTree, InsertLevel and InsertNode
281 Boolean replacingKey
;
285 typedef struct InsertKey InsertKey
;
288 //// For Notational Convenience
290 typedef BTNodeDescriptor
* NodeDescPtr
;
291 typedef u_int8_t
*RecordPtr
;
292 typedef BTreeKeyPtr KeyPtr
;
295 //////////////////////////////////// Globals ////////////////////////////////////
298 //////////////////////////////////// Macros /////////////////////////////////////
301 #define Panic( message ) DebugStr( message )
302 #define PanicIf( condition, message ) do { if ( (condition) != 0 ) DebugStr( message ); } while(0)
304 #define Panic( message ) do { } while(0)
305 #define PanicIf( condition, message ) do { } while(0)
308 // Exit function on error
309 #define M_ExitOnError( result ) do { if ( ( result ) != noErr ) goto ErrorExit; } while(0)
311 // Test for passed condition and return if true
312 #define M_ReturnErrorIf( condition, error ) do { if ( condition ) return( error ); } while(0)
314 //////////////////////////////// Key Operations /////////////////////////////////
316 int32_t CompareKeys (BTreeControlBlockPtr btreePtr
,
320 //////////////////////////////// Map Operations /////////////////////////////////
322 OSStatus
AllocateNode (BTreeControlBlockPtr btreePtr
,
325 OSStatus
FreeNode (BTreeControlBlockPtr btreePtr
,
328 OSStatus
ExtendBTree (BTreeControlBlockPtr btreePtr
,
331 u_int32_t
CalcMapBits (BTreeControlBlockPtr btreePtr
);
334 void BTUpdateReserve (BTreeControlBlockPtr btreePtr
,
337 //////////////////////////////// Misc Operations ////////////////////////////////
339 u_int16_t
CalcKeyRecordSize (u_int16_t keySize
,
342 OSStatus
VerifyHeader (FCB
*filePtr
,
343 BTHeaderRec
*header
);
345 OSStatus
UpdateHeader (BTreeControlBlockPtr btreePtr
,
346 Boolean forceWrite
);
348 OSStatus
FindIteratorPosition (BTreeControlBlockPtr btreePtr
,
349 BTreeIteratorPtr iterator
,
350 BlockDescriptor
*left
,
351 BlockDescriptor
*middle
,
352 BlockDescriptor
*right
,
355 Boolean
*foundRecord
);
357 OSStatus
CheckInsertParams (FCB
*filePtr
,
358 BTreeIterator
*iterator
,
359 FSBufferDescriptor
*record
,
360 u_int16_t recordLen
);
362 OSStatus
TrySimpleReplace (BTreeControlBlockPtr btreePtr
,
364 BTreeIterator
*iterator
,
365 FSBufferDescriptor
*record
,
367 Boolean
*recordInserted
);
369 OSStatus
IsItAHint (BTreeControlBlockPtr btreePtr
,
370 BTreeIterator
*iterator
,
373 extern OSStatus
TreeIsDirty(BTreeControlBlockPtr btreePtr
);
375 //////////////////////////////// Node Operations ////////////////////////////////
379 OSStatus
GetNode (BTreeControlBlockPtr btreePtr
,
382 NodeRec
*returnNodePtr
);
384 /* Flags for GetNode() */
385 #define kGetNodeHint 0x1 /* If set, the node is being looked up using a hint */
387 OSStatus
GetLeftSiblingNode (BTreeControlBlockPtr btreePtr
,
391 #define GetLeftSiblingNode(btree,node,left) GetNode ((btree), ((NodeDescPtr)(node))->bLink, 0, (left))
393 OSStatus
GetRightSiblingNode (BTreeControlBlockPtr btreePtr
,
397 #define GetRightSiblingNode(btree,node,right) GetNode ((btree), ((NodeDescPtr)(node))->fLink, 0, (right))
400 OSStatus
GetNewNode (BTreeControlBlockPtr btreePtr
,
402 NodeRec
*returnNodePtr
);
404 OSStatus
ReleaseNode (BTreeControlBlockPtr btreePtr
,
407 OSStatus
TrashNode (BTreeControlBlockPtr btreePtr
,
410 OSStatus
UpdateNode (BTreeControlBlockPtr btreePtr
,
412 u_int32_t transactionID
,
415 //// Node Buffer Operations
417 void ClearNode (BTreeControlBlockPtr btreePtr
,
420 u_int16_t
GetNodeDataSize (BTreeControlBlockPtr btreePtr
,
423 u_int16_t
GetNodeFreeSize (BTreeControlBlockPtr btreePtr
,
427 //// Record Operations
429 Boolean
InsertRecord (BTreeControlBlockPtr btreePtr
,
435 Boolean
InsertKeyRecord (BTreeControlBlockPtr btreePtr
,
443 void DeleteRecord (BTreeControlBlockPtr btree
,
448 Boolean
SearchNode (BTreeControlBlockPtr btree
,
453 OSStatus
GetRecordByIndex (BTreeControlBlockPtr btree
,
458 u_int16_t
*dataSize
);
460 u_int8_t
* GetRecordAddress (BTreeControlBlockPtr btree
,
464 #define GetRecordAddress(btreePtr,node,index) ((u_int8_t *)(node) + (*(short *) ((u_int8_t *)(node) + (btreePtr)->nodeSize - ((index) << 1) - kOffsetSize)))
467 u_int16_t
GetRecordSize (BTreeControlBlockPtr btree
,
471 u_int32_t
GetChildNodeNum (BTreeControlBlockPtr btreePtr
,
475 void MoveRecordsLeft (u_int8_t
* src
,
477 u_int16_t bytesToMove
);
479 #define MoveRecordsLeft(src,dst,bytes) bcopy((src),(dst),(bytes))
481 void MoveRecordsRight (u_int8_t
* src
,
483 u_int16_t bytesToMove
);
485 #define MoveRecordsRight(src,dst,bytes) bcopy((src),(dst),(bytes))
488 //////////////////////////////// Tree Operations ////////////////////////////////
490 OSStatus
SearchTree (BTreeControlBlockPtr btreePtr
,
492 TreePathTable treePathTable
,
494 BlockDescriptor
*nodePtr
,
497 OSStatus
InsertTree (BTreeControlBlockPtr btreePtr
,
498 TreePathTable treePathTable
,
502 BlockDescriptor
*targetNode
,
505 Boolean replacingKey
,
506 u_int32_t
*insertNode
);
508 OSStatus
DeleteTree (BTreeControlBlockPtr btreePtr
,
509 TreePathTable treePathTable
,
510 BlockDescriptor
*targetNode
,
514 #endif /* __APPLE_API_PRIVATE */
516 #endif //__BTREESPRIVATE__