hfscommon/BTree/BTreeTreeOps.c

203 	OSStatus	err;
220 		err = fsBTEmptyErr;
239             err = btBadNode;
243         err = GetNode (btreePtr, curNodeNum, 0, &nodeRec);
244         if (err != noErr)
258                 err = btBadNode;
268                 err = btBadNode;
278                 err = btBadNode;
298         err = GetRecordByIndex (btreePtr, nodeRec.buffer, index, &keyPtr, &dataPtr, &dataSize);
299         if (err != noErr)
313         err = ReleaseNode (btreePtr, &nodeRec);
314         if (err != noErr)
343 	return	err;
363 	OSStatus			err;
372 	err	= InsertLevel (btreePtr, treePathTable, &primaryKey, nil,
375 	return err;
391 	OSStatus			 err;
416 	err = InsertNode (btreePtr, primaryKey, targetNode, targetNodeNum, index,
418 	M_ExitOnError (err);
442 		err = InsertNode (btreePtr, secondaryKey, targetNode, newNodeNum, newIndex,
444 		M_ExitOnError (err);
475 		err = GetNode (btreePtr, parentNodeNum, 0, &parentNode);	// released as target node in next level up
476 		M_ExitOnError (err);
529 		err = InsertLevel (btreePtr, treePathTable, primaryKey, secondaryKey,
531 		M_ExitOnError (err);
534 	err = UpdateNode (btreePtr, targetNode, 0, kLockTransaction);	// all done with target
535 	M_ExitOnError (err);
537 	err = UpdateNode (btreePtr, &leftNode, 0, kLockTransaction);		// all done with left sibling
538 	M_ExitOnError (err);
549 	return	err;
575 	OSErr				 err;
590 			err = fsBTInvalidNodeErr;
591 			M_ExitOnError(err);
623 			err = GetNode (btreePtr, leftNodeNum, 0, leftNode);	// will be released by caller or a split below
624 			M_ExitOnError (err);
633 			err = RotateLeft (btreePtr, leftNode->buffer, rightNode->buffer, index, key->keyPtr, key->recPtr,
635 			M_ExitOnError (err);
651 		err = SplitLeft (btreePtr, leftNode, rightNode, node, index, key->keyPtr,
653 		M_ExitOnError (err);
659 			err = AddNewRootNode (btreePtr, leftNode->buffer, rightNode->buffer);	// Note: does not update TPT
660 			M_ExitOnError (err);
676 	return err;
703 	OSStatus			err;
744 			err = GetNode (btreePtr, siblingNodeNum, 0, &siblingNode);
745 			M_ExitOnError (err);
751 			err = UpdateNode (btreePtr, &siblingNode, 0, kLockTransaction);
752 			M_ExitOnError (err);
762 			err = GetNode (btreePtr, siblingNodeNum, 0, &siblingNode);
763 			M_ExitOnError (err);
769 			err = UpdateNode (btreePtr, &siblingNode, 0, kLockTransaction);
770 			M_ExitOnError (err);
781 		err = UpdateNode (btreePtr, targetNode, 0, kLockTransaction);
782 		M_ExitOnError (err);
784 		err = FreeNode (btreePtr, targetNodeNum);
785 		M_ExitOnError (err);
805 			err = CollapseTree (btreePtr, targetNode);
806 			M_ExitOnError (err);
817 		err = GetNode (btreePtr, treePathTable[level].node, 0, &parentNode);
818 		M_ExitOnError (err);
841 			err = InsertTree (btreePtr, treePathTable, keyPtr, recPtr, recSize,
843 			M_ExitOnError (err);
847 			err = DeleteTree (btreePtr, treePathTable, &parentNode, index, level);
848 			M_ExitOnError (err);
853 	err = UpdateNode (btreePtr, targetNode, 0, kLockTransaction);
854 	M_ExitOnError (err);
863 	return	err;
874 	OSStatus		err;
897 		err = UpdateNode (btreePtr, blockPtr, 0, kLockTransaction);
898 		M_ExitOnError (err);
899 		err = FreeNode (btreePtr, nodeNum);
900 		M_ExitOnError (err);
903 		err = GetNode (btreePtr, btreePtr->rootNode, 0, blockPtr);
904 		M_ExitOnError (err);
913 	err = UpdateNode (btreePtr, blockPtr, 0, kLockTransaction);	// always update!
914 	M_ExitOnError (err);
923 	return	err;
967 	OSStatus			err;
1059 				err = fsBTBadRotateErr;
1072 				err = fsBTBadRotateErr;
1089 			err = fsBTBadRotateErr;
1110 	return	err;
1129 	OSStatus			err;
1162 	err = AllocateNode (btreePtr, &newNodeNum);
1163 	M_ExitOnError (err);
1174 		err = UpdateNode (btreePtr, leftNode, 0, kLockTransaction);
1175 		M_ExitOnError (err);
1181 	err = GetNewNode (btreePtr, newNodeNum, leftNode);
1182 	M_ExitOnError (err);
1209 	err = RotateLeft (btreePtr, left, right, index, keyPtr, recPtr, recSize,
1212 	M_ExitOnError (err);
1227 	return	err;
1262 	OSStatus			err;
1278 	err = AllocateNode (btreePtr, &rootNum);
1279 	M_ExitOnError (err);
1281 	err = GetNewNode (btreePtr, rootNum, &rootNode);
1282 	M_ExitOnError (err);
1315 	err = UpdateNode (btreePtr, &rootNode, 0, kLockTransaction);
1316 	M_ExitOnError (err);
1330 	return	err;