hfscommon/BTree/BTreeTreeOps.c

155 									 InsertKey					*key,
167 									 const BTreeKey *key,
177 Routine:	SearchTree	-	Search BTree for key and set up Tree Path Table.
179 Function:	Searches BTree for specified key, setting up the Tree Path Table to
184 			keyPtr			- pointer to the key to search for
187 Output:		nodeNum			- number of the node containing the key position
190 Result:		noErr			- key found, index is record index
191 			fsBTRecordNotFoundErr	- key not found, index is insert index
192 			fsBTEmptyErr		- key not found, return params are nil
425 		// If inserting the secondaryKey changes the first key of
427 		// key in the new root node.
447 			DebugStr(" InsertLevel: New root from primary key, update from secondary key...");
492 			// need to delete and re-insert this parent key/ptr
558 							 InsertKey				*key,
603 	recordFit = InsertKeyRecord (btreePtr, targetNode->buffer, index, key->keyPtr, key->keyLength, key->recPtr, key->recSize);
631 		if ( !key->skipRotate )		// are rotates allowed?
633 			err = RotateLeft (btreePtr, leftNode->buffer, rightNode->buffer, index, key->keyPtr, key->recPtr,
634 							  key->recSize, newIndex, newNode, &recordFit, &recsRotated );
639 				if ( key->replacingKey || (recsRotated > 1) || (index > 0) )
651 		err = SplitLeft (btreePtr, leftNode, rightNode, node, index, key->keyPtr,
652 						 key->recPtr, key->recSize, newIndex, newNode, &recsRotated);
667 			if ( key->replacingKey || (recsRotated > 1) || (index > 0) )
834 			// need to delete and re-insert this parent key/ptr
981 	// the key's length field is 8-bits in HFS and 16-bits in HFS+
1334 static u_int16_t	GetKeyLength ( const BTreeControlBlock *btreePtr, const BTreeKey *key, Boolean forLeafNode )
1339 		length = KeyLength (btreePtr, key);		// just use actual key length
1341 		length = btreePtr->maxKeyLength;		// fixed sized index key (i.e. HFS)		//�� shouldn't we clear the pad bytes?