hfscommon/BTree/BTreeTreeOps.c

66 									sized index keys.
68 									variable sized index keys.
135 									 u_int16_t					 index,
150 									 u_int16_t					 index,
158 									 u_int16_t	 				 index,
190 Result:		noErr			- key found, index is record index
191 			fsBTRecordNotFoundErr	- key not found, index is insert index
207 	u_int16_t	index;
209 	int8_t		nodeKind;				//	Kind of current node (index/leaf)
226 	treePathTable [0].index		= 0;
232         //	index or leaf node.  If we're ever asked to search through node 0,
234         //	we found a node full of zeroes that we thought was an index node).
274             //	A node at any other depth must be an index node
277 //		Panic("Incorrect node type: expected index");
283         keyFound = SearchNode (btreePtr, nodeRec.buffer, searchKey, &index);
289                 treePathTable [level].index = index;
293         if ( (keyFound != true) && (index != 0))
294                 --index;
296         treePathTable [level].index = index;
298         err = GetRecordByIndex (btreePtr, nodeRec.buffer, index, &keyPtr, &dataPtr, &dataSize);
301             //	[2550929] If we got an error, it is probably because the index was bad
310         //	Get the child pointer out of this index node.  We're now done with the current
325 	*returnIndex		= index;
328 		return	noErr;			// searchKey found, index identifies record in node
330 		return	fsBTRecordNotFoundErr;	// searchKey not found, index identifies insert point
357 						 u_int16_t					 index,
373 					   targetNode, index, level, insertNode );
387 						 u_int16_t					 index,
416 	err = InsertNode (btreePtr, primaryKey, targetNode, targetNodeNum, index,
430 		treePathTable [level + 1].index = 1;	// 1 since we always split/rotate left
470 		index = treePathTable [level].index;
479 			PanicIf ( ((NodeDescPtr)parentNode.buffer)->kind != kBTIndexNode, " InsertLevel: parent node not an index node! ");
489 			GetRecordByIndex (btreePtr, parentNode.buffer, index, &keyPtr, &recPtr, &recSize);
495 			DeleteRecord (btreePtr, parentNode.buffer, index);
530 						   &parentNode, index, level, insertNode );
562 							 u_int16_t	 			 index,
603 	recordFit = InsertKeyRecord (btreePtr, targetNode->buffer, index, key->keyPtr, key->keyLength, key->recPtr, key->recSize);
608 		*newIndex = index;
610 		if ( (index == 0) && (((NodeDescPtr) targetNode->buffer)->height != btreePtr->treeDepth) )
633 			err = RotateLeft (btreePtr, leftNode->buffer, rightNode->buffer, index, key->keyPtr, key->recPtr,
639 				if ( key->replacingKey || (recsRotated > 1) || (index > 0) )
651 		err = SplitLeft (btreePtr, leftNode, rightNode, node, index, key->keyPtr,
667 			if ( key->replacingKey || (recsRotated > 1) || (index > 0) )
691 			index			- description
700 								 u_int16_t					 index,
725 	DeleteRecord (btreePtr, targetNodePtr, index);
787 	else if ( index == 0 )			// did we delete the first record?
815 		//// Get Parent Node and index
816 		index = treePathTable [level].index;
831 			GetRecordByIndex (btreePtr, parentNode.buffer, index, &keyPtr, &recPtr, &recSize);
835 			DeleteRecord (btreePtr, parentNode.buffer, index);
842 							  &parentNode, index, level, kReplaceRecord, &insertNode);
847 			err = DeleteTree (btreePtr, treePathTable, &parentNode, index, level);
974 	u_int16_t			index, moveIndex;
1044 	index			= 0;
1046 	while ( index < moveIndex )
1048 		if ( index == rightInsertIndex )	// insert new record in left node
1077 		++index;
1082 		rightInsertIndex -= index;			// adjust for records already rotated
1121 								 u_int16_t					 index,
1209 	err = RotateLeft (btreePtr, left, right, index, keyPtr, recPtr, recSize,
1299 	PanicIf ( !didItFit, "AddNewRootNode:InsertKeyRecord failed for left index record");
1310 	PanicIf ( !didItFit, "AddNewRootNode:InsertKeyRecord failed for right index record");
1341 		length = btreePtr->maxKeyLength;		// fixed sized index key (i.e. HFS)		//�� shouldn't we clear the pad bytes?