hfscommon/BTree/BTreeTreeOps.c

110 									 NodeDescPtr				 rightNode );
117 									 NodeDescPtr				 rightNode,
129 									 NodeDescPtr				 rightNode );
133 									 BlockDescriptor			*rightNode,
156 									 BlockDescriptor			*rightNode,
560 							 BlockDescriptor		*rightNode,
580 	PanicIf ( rightNode->buffer == leftNode->buffer, " InsertNode: rightNode == leftNode, huh?");
582 	leftNodeNum = ((NodeDescPtr) rightNode->buffer)->bLink;
599 		targetNode = rightNode;
633 			err = RotateLeft (btreePtr, leftNode->buffer, rightNode->buffer, index, key->keyPtr, key->recPtr,
651 		err = SplitLeft (btreePtr, leftNode, rightNode, node, index, key->keyPtr,
657 		if ( ((NodeDescPtr) rightNode->buffer)->height == btreePtr->treeDepth )
659 			err = AddNewRootNode (btreePtr, leftNode->buffer, rightNode->buffer);	// Note: does not update TPT
940 			rightNode			- description
957 								 NodeDescPtr				 rightNode,
979 	keyLength = GetKeyLength(btreePtr, keyPtr, (rightNode->kind == kBTLeafNode));
995 	rightSize		= nodeSize - GetNodeFreeSize (btreePtr, rightNode) + insertSize;
1004 			moveSize = GetRecordSize (btreePtr, rightNode, moveIndex) + 2;
1012 			moveSize = GetRecordSize (btreePtr, rightNode, moveIndex - 1) + 2;
1064 			*insertNodeNum = rightNode->bLink;
1068 			didItFit = RotateRecordLeft (btreePtr, leftNode, rightNode);
1084 		didItFit = InsertKeyRecord (btreePtr, rightNode, rightInsertIndex,
1119 								 BlockDescriptor			*rightNode,
1137 	right = rightNode->buffer;
1219 	(void) ReleaseNode (btreePtr, rightNode);
1236 							 	 NodeDescPtr				rightNode )
1242 	size	= GetRecordSize (btreePtr, rightNode, 0);
1243 	recPtr	= GetRecordAddress (btreePtr, rightNode, 0);
1250 	DeleteRecord (btreePtr, rightNode, 0);
1260 								 NodeDescPtr			 rightNode )
1273 	PanicIf (rightNode == nil, "AddNewRootNode: rightNode == nil");
1297 								 (u_int8_t *) &rightNode->bLink, 4 );
1304 	keyPtr = (KeyPtr) GetRecordAddress (btreePtr, rightNode, 0);