hfscommon/BTree/BTree.c

95 		<11>	 9/17/96	dkh		More BTree statistics. Modified hint checks to not bail out when
119 		<21>	11/16/94	prp		Add IsItAHint routine and use it whenever hint's node number was
133 		<12>	 8/16/93	prp		In BTSearchRecord, if the input hint found the node and record,
139 		 <9>	 5/24/93	gs		Fix bug in BTInsert/Set/ReplaceRecord which didn't set node hint
143 		 <6>	 5/21/93	gs		Add hint optimization to Set/Replace routines.
431 Function:	Search for position in B*Tree indicated by searchKey. If a valid node hint
444 			hintPtr			- pointer to hint (may be nil)
505 		nodeNum = searchIterator->hint.nodeNum;
579 			resultIterator->hint.writeCount	= btreePtr->writeCount;
580 			resultIterator->hint.nodeNum = nodeNum;
581 			resultIterator->hint.index = index;
584 		resultIterator->hint.reserved1 = 0;
585 		resultIterator->hint.reserved2 = 0;
612 		resultIterator->hint.writeCount	= 0;
613 		resultIterator->hint.nodeNum	= 0;
614 		resultIterator->hint.index		= 0;
615 		resultIterator->hint.reserved1	= 0;
616 		resultIterator->hint.reserved2	= 0;
867 		iterator->hint.writeCount	= btreePtr->writeCount;
868 		iterator->hint.nodeNum		= nodeNum;
869 		iterator->hint.index		= index;
870 		iterator->hint.reserved1	= 0;
871 		iterator->hint.reserved2	= 0;
934 		iterator->hint.writeCount	= 0;
935 		iterator->hint.nodeNum		= 0;
936 		iterator->hint.index		= 0;
937 		iterator->hint.reserved1	= 0;
938 		iterator->hint.reserved2	= 0;
1206 		iterator->hint.writeCount = btreePtr->writeCount;
1207 		iterator->hint.nodeNum	  = nodeNum;
1208 		iterator->hint.index	  = index;
1245 		iterator->hint.writeCount = 0;
1246 		iterator->hint.nodeNum	  = 0;
1247 		iterator->hint.index	  = 0;
1393 	// create hint
1394 	iterator->hint.writeCount 	= btreePtr->writeCount;
1395 	iterator->hint.nodeNum		= insertNodeNum;
1396 	iterator->hint.index		= 0;						// unused
1397 	iterator->hint.reserved1	= 0;
1398 	iterator->hint.reserved2	= 0;
1409 	iterator->hint.writeCount 	= 0;
1410 	iterator->hint.nodeNum		= 0;
1411 	iterator->hint.index		= 0;
1412 	iterator->hint.reserved1	= 0;
1413 	iterator->hint.reserved2	= 0;
1460 		insertNodeNum = iterator->hint.nodeNum;
1542 	// create hint
1543 	iterator->hint.writeCount 	= btreePtr->writeCount;
1544 	iterator->hint.nodeNum		= insertNodeNum;
1545 	iterator->hint.index		= 0;						// unused
1546 	iterator->hint.reserved1	= 0;
1547 	iterator->hint.reserved2	= 0;
1558 	iterator->hint.writeCount 	= 0;
1559 	iterator->hint.nodeNum		= 0;
1560 	iterator->hint.index		= 0;
1561 	iterator->hint.reserved1	= 0;
1562 	iterator->hint.reserved2	= 0;
1603 		insertNodeNum = iterator->hint.nodeNum;
1659 	// create hint
1660 	iterator->hint.writeCount 	= btreePtr->writeCount;
1661 	iterator->hint.nodeNum		= insertNodeNum;
1662 	iterator->hint.index		= 0;
1663 	iterator->hint.reserved1	= 0;
1664 	iterator->hint.reserved2	= 0;
1673 	iterator->hint.writeCount 	= 0;
1674 	iterator->hint.nodeNum		= 0;
1675 	iterator->hint.index		= 0;
1676 	iterator->hint.reserved1	= 0;
1677 	iterator->hint.reserved2	= 0;
1717 	// check hint for simple delete case (index > 0, numRecords > 2)
1744 	iterator->hint.nodeNum	= 0;
1899 Routine:	BTInvalidateHint	-	Invalidates the hint within a BTreeInterator.
1901 Function:	Invalidates the hint within a BTreeInterator.
1906 Output:		iterator	- iterator with the hint.nodeNum cleared
1918 	iterator->hint.nodeNum = 0;