hfscommon/BTree/BTreeTreeOps.c

255         if (((BTNodeDescriptor*)nodeRec.buffer)->height != level)
261         nodeKind = ((BTNodeDescriptor*)nodeRec.buffer)->kind;
283         keyFound = SearchNode (btreePtr, nodeRec.buffer, searchKey, &index);
298         err = GetRecordByIndex (btreePtr, nodeRec.buffer, index, &keyPtr, &dataPtr, &dataSize);
339 	nodePtr->buffer				= nil;
402 	PanicIf ((level == 1) && (((NodeDescPtr)targetNode->buffer)->kind != kBTLeafNode), " InsertLevel: non-leaf at level 1! ");
404 	leftNode.buffer = nil;
460 		parentNode.buffer = nil;
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);
497 			primaryKey->keyPtr		 = (KeyPtr) GetRecordAddress( btreePtr, targetNode->buffer, 0 );
521 			insertKeyPtr->keyPtr		= (KeyPtr) GetRecordAddress (btreePtr, leftNode.buffer, 0);
523 			insertKeyPtr->recPtr		= (u_int8_t *) &((NodeDescPtr)targetNode->buffer)->bLink;
580 	PanicIf ( rightNode->buffer == leftNode->buffer, " InsertNode: rightNode == leftNode, huh?");
582 	leftNodeNum = ((NodeDescPtr) rightNode->buffer)->bLink;
589 		if (leftNode->buffer == NULL) {
603 	recordFit = InsertKeyRecord (btreePtr, targetNode->buffer, index, key->keyPtr, key->keyLength, key->recPtr, key->recSize);
610 		if ( (index == 0) && (((NodeDescPtr) targetNode->buffer)->height != btreePtr->treeDepth) )
619 		PanicIf ( leftNode->buffer != nil, " InsertNode: leftNode already acquired!");
621 		if ( leftNode->buffer == nil )
629 		PanicIf ( ((NodeDescPtr) leftNode->buffer)->fLink != node, " InsertNode, RotateLeft: invalid sibling link!" );
633 			err = RotateLeft (btreePtr, leftNode->buffer, rightNode->buffer, index, key->keyPtr, key->recPtr,
657 		if ( ((NodeDescPtr) rightNode->buffer)->height == btreePtr->treeDepth )
659 			err = AddNewRootNode (btreePtr, leftNode->buffer, rightNode->buffer);	// Note: does not update TPT
712 	parentNode.buffer      = nil;
719 	targetNodePtr = targetNode->buffer;
720 	PanicIf (targetNodePtr == nil, "DeleteTree: targetNode has nil buffer!");
736 		siblingNode.buffer = nil;
750 			((NodeDescPtr)siblingNode.buffer)->fLink = targetNodePtr->fLink;
768 			((NodeDescPtr)siblingNode.buffer)->bLink = targetNodePtr->bLink;
793 	if ( level == btreePtr->treeDepth )		// then targetNode->buffer is the root node
798 		if ( targetNode->buffer == nil )	// then root was freed and the btree is empty
803 		else if ( ((NodeDescPtr)targetNode->buffer)->numRecords == 1 )
831 			GetRecordByIndex (btreePtr, parentNode.buffer, index, &keyPtr, &recPtr, &recSize);
835 			DeleteRecord (btreePtr, parentNode.buffer, index);
837 			keyPtr = (KeyPtr) GetRecordAddress( btreePtr, targetNode->buffer, 0 );
885 		if ( ((NodeDescPtr)blockPtr->buffer)->numRecords > 1)
888 		if ( ((NodeDescPtr)blockPtr->buffer)->kind == kBTLeafNode)
892 		btreePtr->rootNode	= GetChildNodeNum (btreePtr, blockPtr->buffer, 0);
896 		ClearNode (btreePtr, blockPtr->buffer);
1137 	right = rightNode->buffer;
1138 	left  = leftNode->buffer;
1187 	left		= leftNode->buffer;
1269 	rootNode.buffer = nil;
1287 	((NodeDescPtr)rootNode.buffer)->kind = kBTIndexNode;
1288 	((NodeDescPtr)rootNode.buffer)->height	= ++btreePtr->treeDepth;
1296 	didItFit = InsertKeyRecord ( btreePtr, rootNode.buffer, 0, keyPtr, keyLength,
1307 	didItFit = InsertKeyRecord ( btreePtr, rootNode.buffer, 1, keyPtr, keyLength,