hfscommon/BTree/BTree.c

57 	   <MOSXS>	 4/15/98	djb		In BTOpenPath need to clear nodeRec.buffer if GetBlockProc fails.
191 	NodeRec					nodeRec;
229 	nodeRec.buffer				= nil;				// so we can call ReleaseNode
234 	nodeRec.blockSize = VTOHFS(btreePtr->fileRefNum)->hfs_physical_block_size;
239 		nodeRec.blockSize = FCBTOVCB(filePtr)->blockSize;
245 	err = SetBTreeBlockSize (btreePtr->fileRefNum, nodeRec.blockSize, 1);
252 						&nodeRec );
255 		nodeRec.buffer = nil;
256 		nodeRec.blockHeader	= nil;
261 	header = (BTHeaderRec*) ((uintptr_t)nodeRec.buffer + sizeof(BTNodeDescriptor));
324 	if ( btreePtr->nodeSize != nodeRec.blockSize )
333 		err = ReleaseBTreeBlock(btreePtr->fileRefNum, &nodeRec, kTrashBlock);
337 		err = GetNode (btreePtr, kHeaderNodeNum, 0, &nodeRec );
344 	err = ReleaseNode (btreePtr, &nodeRec);
373 	(void) ReleaseNode (btreePtr, &nodeRec);
1270 	BlockDescriptor			nodeRec;
1277 	nodeRec.buffer = nil;					// so we can call ReleaseNode
1278 	nodeRec.blockHeader = nil;
1292 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1312 								err = GetNewNode (btreePtr, insertNodeNum, &nodeRec);
1316 								ModifyBlockStart(btreePtr->fileRefNum, &nodeRec);
1318 								((NodeDescPtr)nodeRec.buffer)->kind = kBTLeafNode;
1319 								((NodeDescPtr)nodeRec.buffer)->height	= 1;
1321 								recordFit = InsertKeyRecord (btreePtr, nodeRec.buffer, 0,
1340 								err = UpdateNode (btreePtr, &nodeRec, 0, kLockTransaction);
1353 		ModifyBlockStart(btreePtr->fileRefNum, &nodeRec);
1355 		recordFit = InsertKeyRecord (btreePtr, nodeRec.buffer, index,
1360 			err = UpdateNode (btreePtr, &nodeRec, 0, kLockTransaction);
1382 					  recordLen, &nodeRec, index, 1, kInsertRecord, &insertNodeNum);
1407 	(void) ReleaseNode (btreePtr, &nodeRec);
1433 	BlockDescriptor			nodeRec;
1442 	nodeRec.buffer = nil;					// so we can call ReleaseNode
1443 	nodeRec.blockHeader = nil;
1462 		err = GetNode (btreePtr, insertNodeNum, kGetNodeHint, &nodeRec);
1466 			ModifyBlockStart(btreePtr->fileRefNum, &nodeRec);
1468 			err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1473 				err = UpdateNode (btreePtr, &nodeRec, 0, 0);
1485 			err = ReleaseNode (btreePtr, &nodeRec);
1497 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1504 	ModifyBlockStart(btreePtr->fileRefNum, &nodeRec);
1506 	err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1511 		err = UpdateNode (btreePtr, &nodeRec, 0, 0);
1531 	ModifyBlockStart(btreePtr->fileRefNum, &nodeRec);
1533 	DeleteRecord (btreePtr, nodeRec.buffer, index);	// delete existing key/record
1536 					  recordLen, &nodeRec, index, 1, kReplaceRecord, &insertNodeNum);
1556 	(void) ReleaseNode (btreePtr, &nodeRec);
1578 	BlockDescriptor			nodeRec;
1589 	nodeRec.buffer = nil;					// so we can call ReleaseNode
1590 	nodeRec.blockHeader = nil;
1605 		err = GetNode (btreePtr, insertNodeNum, kGetNodeHint, &nodeRec);
1608 			if (((NodeDescPtr)nodeRec.buffer)->kind == kBTLeafNode &&
1609 			    SearchNode (btreePtr, nodeRec.buffer, &iterator->key, &index))
1611 				err = GetRecordByIndex(btreePtr, nodeRec.buffer, index, &keyPtr, &recordPtr, &recordLen);
1615 				ModifyBlockStart(btreePtr->fileRefNum, &nodeRec);
1620 				err = UpdateNode (btreePtr, &nodeRec, 0, 0);
1632 			err = ReleaseNode (btreePtr, &nodeRec);
1643 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1646 	err = GetRecordByIndex(btreePtr, nodeRec.buffer, index, &keyPtr, &recordPtr, &recordLen);
1650 	ModifyBlockStart(btreePtr->fileRefNum, &nodeRec);
1655 	err = UpdateNode (btreePtr, &nodeRec, 0, 0);
1671 	(void) ReleaseNode (btreePtr, &nodeRec);
1691 	BlockDescriptor			nodeRec;
1699 	nodeRec.buffer = nil;					// so we can call ReleaseNode
1700 	nodeRec.blockHeader = nil;
1719 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &nodeNum, &nodeRec, &index);
1737 	err = DeleteTree (btreePtr, treePathTable, &nodeRec, index, 1);
1751 	(void) ReleaseNode (btreePtr, &nodeRec);