hfscommon/BTree/BTree.c

188 	OSStatus				err;
243 	// it is now safe to call M_ExitOnError (err)
245 	err = SetBTreeBlockSize (btreePtr->fileRefNum, nodeRec.blockSize, 1);
246 	M_ExitOnError (err);
249 	err = GetBTreeBlock(btreePtr->fileRefNum,
253 	if (err != noErr)
266 	err = VerifyHeader (filePtr, header);
267 	M_ExitOnError (err);
314 			err = fsBTBadNodeSize;
326 		err = SetBTreeBlockSize (btreePtr->fileRefNum, btreePtr->nodeSize, 32);
327 		M_ExitOnError (err);
333 		err = ReleaseBTreeBlock(btreePtr->fileRefNum, &nodeRec, kTrashBlock);
335 		M_ExitOnError (err);
337 		err = GetNode (btreePtr, kHeaderNodeNum, 0, &nodeRec );
338 		M_ExitOnError (err);
344 	err = ReleaseNode (btreePtr, &nodeRec);
345 	M_ExitOnError (err);
376 	return err;
398 	OSStatus				err;
411 	err = UpdateHeader (btreePtr, true);
412 	M_ExitOnError (err);
423 	return	err;
463 	OSStatus				err;
500 	err = IsItAHint (btreePtr, searchIterator, &validHint);
501 	M_ExitOnError (err);
507 		err = GetNode (btreePtr, nodeNum, kGetNodeHint, &node);
508 		if( err == noErr )
520 				err = ReleaseNode (btreePtr, &node);
521 				M_ExitOnError (err);
538 		err = SearchTree ( btreePtr, &searchIterator->key, treePathTable, &nodeNum, &node, &index);
539 		switch (err)
596 	err = ReleaseNode (btreePtr, &node);
597 	M_ExitOnError (err);
623 	if ( err == fsBTEmptyErr )
624 		err = fsBTRecordNotFoundErr;
626 	return err;
655 	OSStatus					err;
697 		err = fsInvalidIterationMovmentErr;
710 			err = fsBTEmptyErr;
714 		err = GetNode (btreePtr, nodeNum, 0, &node);
715 		M_ExitOnError (err);
720 			err = ReleaseNode (btreePtr, &node);
721 			M_ExitOnError (err);
723 			err = fsBTInvalidNodeErr;
739 	err = FindIteratorPosition (btreePtr, iterator,
741 	M_ExitOnError (err);
762 					err = ReleaseNode(btreePtr, &node);
763 					M_ExitOnError(err);
766 					err = GetNode (btreePtr, nodeNum, 0, &left);
767 					M_ExitOnError (err);
770 					err = GetRightSiblingNode (btreePtr, left.buffer, &node);
771 					M_ExitOnError (err);
773 					err = fsBTStartOfIterationErr;
779 				err = ReleaseNode(btreePtr, &right);
780 				M_ExitOnError(err);
794 			err = fsBTEndOfIterationErr;
814 					err = GetNode (btreePtr, nodeNum, 0, &right);
815 					M_ExitOnError (err);
817 					err = fsBTEndOfIterationErr;
823 				err = ReleaseNode(btreePtr, &left);
824 				M_ExitOnError(err);
838 			err = fsBTEndOfIterationErr;
848 	err = GetRecordByIndex (btreePtr, node.buffer, index, &keyPtr, &recordPtr, &len);
849 	M_ExitOnError (err);
891 			err = fsBTInvalidNodeErr;
904 	err = ReleaseNode (btreePtr, &node);
905 	M_ExitOnError (err);
909 		err = ReleaseNode (btreePtr, &left);
910 		M_ExitOnError (err);
915 		err = ReleaseNode (btreePtr, &right);
916 		M_ExitOnError (err);
945 	if ( err == fsBTEmptyErr || err == fsBTEndOfIterationErr )
946 		err = fsBTRecordNotFoundErr;
948 	return err;
973 	OSStatus		err;
1003 		err = fsInvalidIterationMovmentErr;
1018 			err = fsBTEmptyErr;
1022 		err = GetNode(btreePtr, nodeNum, 0, &node);
1023 		M_ExitOnError(err);
1028 			err = ReleaseNode(btreePtr, &node);
1029 			M_ExitOnError(err);
1031 			err = fsBTInvalidNodeErr;
1048 	err = FindIteratorPosition(btreePtr, iterator, &left, &node, &right,
1050 	if (err == fsBTRecordNotFoundErr)
1051 		err = 0;
1052 	M_ExitOnError(err);
1073 					err = ReleaseNode(btreePtr, &node);
1074 					M_ExitOnError(err);
1077 					err = GetNode (btreePtr, nodeNum, 0, &left);
1078 					M_ExitOnError (err);
1081 					err = GetRightSiblingNode (btreePtr, left.buffer, &node);
1082 					M_ExitOnError (err);
1084 					err = fsBTStartOfIterationErr;
1090 				err = ReleaseNode(btreePtr, &right);
1091 				M_ExitOnError(err);
1105 			err = fsBTEndOfIterationErr;
1125 					err = GetNode(btreePtr, nodeNum, 0, &right);
1126 					M_ExitOnError(err);
1128 					err = fsBTEndOfIterationErr;
1134 				err = ReleaseNode(btreePtr, &left);
1135 				M_ExitOnError(err);
1149 			err = fsBTEndOfIterationErr;
1157 	err = GetRecordByIndex(btreePtr, node.buffer, index, &keyPtr, &recordPtr, &len);
1158 	if (err) {
1159 		err = btBadNode;
1163 	while (err == 0) {
1175 					err = GetNode(btreePtr, nodeNum, 0, &right);
1176 					M_ExitOnError(err);
1178 					err = fsBTEndOfIterationErr;
1184 				err = ReleaseNode(btreePtr, &left);
1185 				M_ExitOnError(err);
1192 		err = GetRecordByIndex(btreePtr, node.buffer, index,
1194 		if (err) {
1195 			err = btBadNode;
1213 	M_ExitOnError(err);
1218 	err = ReleaseNode(btreePtr, &node);
1219 	M_ExitOnError(err);
1223 		err = ReleaseNode(btreePtr, &left);
1224 		M_ExitOnError(err);
1229 		err = ReleaseNode(btreePtr, &right);
1230 		M_ExitOnError(err);
1252 	if ( err == fsBTEmptyErr || err == fsBTEndOfIterationErr )
1253 		err = fsBTRecordNotFoundErr;
1255 	return err;
1266 	OSStatus				err;
1280 	err = CheckInsertParams (filePtr, iterator, record, recordLen);
1281 	if (err != noErr)
1282 		return	err;
1292 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1294 	switch (err)				// set/replace/insert decision point
1296 		case noErr:			err = fsBTDuplicateRecordErr;
1305 									err = ExtendBTree (btreePtr, btreePtr->totalNodes + 1);
1306 									M_ExitOnError (err);
1309 								err = AllocateNode (btreePtr, &insertNodeNum);
1310 								M_ExitOnError (err);
1312 								err = GetNewNode (btreePtr, insertNodeNum, &nodeRec);
1313 								M_ExitOnError (err);
1326 									err = fsBTRecordTooLargeErr;
1340 								err = UpdateNode (btreePtr, &nodeRec, 0, kLockTransaction);
1341 								M_ExitOnError (err);
1360 			err = UpdateNode (btreePtr, &nodeRec, 0, kLockTransaction);
1361 			M_ExitOnError (err);
1375 		err = ExtendBTree (btreePtr, nodesNeeded);
1376 		M_ExitOnError (err);
1381 	err = InsertTree (btreePtr, treePathTable, &iterator->key, record->bufferAddress,
1383 	M_ExitOnError (err);
1415 	if (err == fsBTEmptyErr)
1416 		err = fsBTRecordNotFoundErr;
1418 	return err;
1429 	OSStatus				err;
1445 	err = CheckInsertParams (filePtr, iterator, record, recordLen);
1446 	if (err != noErr)
1447 		return err;
1455 	err = IsItAHint (btreePtr, iterator, &validHint);
1456 	M_ExitOnError (err);
1462 		err = GetNode (btreePtr, insertNodeNum, kGetNodeHint, &nodeRec);
1463 		if( err == noErr )
1468 			err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1469 			M_ExitOnError (err);
1473 				err = UpdateNode (btreePtr, &nodeRec, 0, 0);
1474 				M_ExitOnError (err);
1485 			err = ReleaseNode (btreePtr, &nodeRec);
1486 			M_ExitOnError (err);
1497 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1498 	M_ExitOnError (err);					// record must exit for Replace
1506 	err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1507 	M_ExitOnError (err);
1511 		err = UpdateNode (btreePtr, &nodeRec, 0, 0);
1512 		M_ExitOnError (err);
1526 		err = ExtendBTree (btreePtr, nodesNeeded);
1527 		M_ExitOnError (err);
1535 	err = InsertTree (btreePtr, treePathTable, &iterator->key, record->bufferAddress,
1537 	M_ExitOnError (err);
1564 	return err;
1575 	OSStatus				err;
1598 	err = IsItAHint (btreePtr, iterator, &validHint);
1599 	M_ExitOnError (err);
1605 		err = GetNode (btreePtr, insertNodeNum, kGetNodeHint, &nodeRec);
1606 		if (err == noErr)
1611 				err = GetRecordByIndex(btreePtr, nodeRec.buffer, index, &keyPtr, &recordPtr, &recordLen);
1612 				M_ExitOnError (err);
1617 				err = callBackProc(keyPtr, recordPtr, callBackState);
1618 				M_ExitOnError (err);
1620 				err = UpdateNode (btreePtr, &nodeRec, 0, 0);
1621 				M_ExitOnError (err);
1632 			err = ReleaseNode (btreePtr, &nodeRec);
1633 			M_ExitOnError (err);
1643 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1644 	M_ExitOnError (err);
1646 	err = GetRecordByIndex(btreePtr, nodeRec.buffer, index, &keyPtr, &recordPtr, &recordLen);
1647 	M_ExitOnError (err);
1652 	err = callBackProc(keyPtr, recordPtr, callBackState);
1653 	M_ExitOnError (err);
1655 	err = UpdateNode (btreePtr, &nodeRec, 0, 0);
1656 	M_ExitOnError (err);
1678 	return err;
1688 	OSStatus				err;
1708 		err = fsBTInvalidFileErr;
1719 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &nodeNum, &nodeRec, &index);
1720 	M_ExitOnError (err);					// record must exit for Delete
1731 		err = ExtendBTree (btreePtr, nodesNeeded);
1732 		M_ExitOnError (err);
1737 	err = DeleteTree (btreePtr, treePathTable, &nodeRec, index, 1);
1738 	M_ExitOnError (err);
1753 	return	err;
1821 	OSStatus				err;
1833 	err = UpdateHeader (btreePtr, false);
1835 	return	err;
1858 	OSStatus err;
1873 	err = GetNode(btreePtr, kHeaderNodeNum, 0, &node);
1874 	if (err != noErr)
1875 		return (err);
1878 	if ((err = VerifyHeader (filePtr, header)) == 0) {
1894 	return	err;
2030 	OSStatus err;
2043 	err = GetNode(btreePtr, kHeaderNodeNum, 0, &node);
2044 	if (err)
2045 		return (err);
2067 	OSStatus err;
2080 	err = GetNode(btreePtr, kHeaderNodeNum, 0, &node);
2081 	if (err)
2082 		return (err);
2089 	err = UpdateNode (btreePtr, &node, 0, 0);
2091 	return	(err);