hfscommon/BTree/BTree.c

80 	  <HFS7>	 2/19/97	djb		Enable variable sized index keys for HFS+ volumes. Added node
83 									variable sized index keys).
468 	u_int16_t				index;
513 				foundRecord = SearchNode (btreePtr, node.buffer, &searchIterator->key, &index);
515 				//�� if !foundRecord, we could still skip tree search if ( 0 < index < numRecords )
538 		err = SearchTree ( btreePtr, &searchIterator->key, treePathTable, &nodeNum, &node, &index);
557 		GetRecordByIndex (btreePtr, node.buffer, index, &keyPtr, &recordPtr, &len);
581 			resultIterator->hint.index = index;
614 		resultIterator->hint.index		= 0;
665 	u_int16_t					index;
729 		if (operation == kBTreeFirstRecord)		index = 0;
730 		else									index = ((BTNodeDescriptor*) node.buffer)->numRecords - 1;
740 								&left, &node, &right, &nodeNum, &index, &foundRecord);
748 		if (index > 0)
750 			--index;
785 			index 		= ((NodeDescPtr) node.buffer)->numRecords -1;
792 			(index == ((NodeDescPtr) node.buffer)->numRecords))
798 		// we did not find the record but the index is already positioned correctly
799 		if ((foundRecord == false) && (index != ((NodeDescPtr) node.buffer)->numRecords))
803 		if (index < ((NodeDescPtr) node.buffer)->numRecords -1)
805 			++index;
829 			index		 = 0;
836 			(index >= ((NodeDescPtr) node.buffer)->numRecords))
848 	err = GetRecordByIndex (btreePtr, node.buffer, index, &keyPtr, &recordPtr, &len);
869 		iterator->hint.index		= index;
936 		iterator->hint.index		= 0;
981 	u_int16_t		index;
1038 			index = 0;
1040 			index = ((BTNodeDescriptor*) node.buffer)->numRecords - 1;
1049 				   &nodeNum, &index, &foundRecord);
1059 		if (index > 0)
1061 			--index;
1096 			index	    = ((NodeDescPtr) node.buffer)->numRecords -1;
1103 			(index == ((NodeDescPtr)node.buffer)->numRecords))
1109 		// we did not find the record but the index is already positioned correctly
1110 		if ((foundRecord == false) && (index != ((NodeDescPtr)node.buffer)->numRecords))
1114 		if (index < ((NodeDescPtr)node.buffer)->numRecords -1)
1116 			++index;
1140 			index	     = 0;
1147 			(index >= ((NodeDescPtr)node.buffer)->numRecords))
1157 	err = GetRecordByIndex(btreePtr, node.buffer, index, &keyPtr, &recordPtr, &len);
1167 		if ((index+1) < ((NodeDescPtr)node.buffer)->numRecords) {
1168 			++index;
1190 			index	     = 0;
1192 		err = GetRecordByIndex(btreePtr, node.buffer, index,
1208 		iterator->hint.index	  = index;
1247 		iterator->hint.index	  = 0;
1272 	u_int16_t				index;
1292 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1350 	if (index > 0)
1355 		recordFit = InsertKeyRecord (btreePtr, nodeRec.buffer, index,
1382 					  recordLen, &nodeRec, index, 1, kInsertRecord, &insertNodeNum);
1396 	iterator->hint.index		= 0;						// unused
1411 	iterator->hint.index		= 0;
1435 	u_int16_t				index;
1497 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1533 	DeleteRecord (btreePtr, nodeRec.buffer, index);	// delete existing key/record
1536 					  recordLen, &nodeRec, index, 1, kReplaceRecord, &insertNodeNum);
1545 	iterator->hint.index		= 0;						// unused
1560 	iterator->hint.index		= 0;
1583 	u_int16_t				index;
1609 			    SearchNode (btreePtr, nodeRec.buffer, &iterator->key, &index))
1611 				err = GetRecordByIndex(btreePtr, nodeRec.buffer, index, &keyPtr, &recordPtr, &recordLen);
1643 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1646 	err = GetRecordByIndex(btreePtr, nodeRec.buffer, index, &keyPtr, &recordPtr, &recordLen);
1662 	iterator->hint.index		= 0;
1675 	iterator->hint.index		= 0;
1694 	u_int16_t				index;
1717 	// check hint for simple delete case (index > 0, numRecords > 2)
1719 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &nodeNum, &nodeRec, &index);
1737 	err = DeleteTree (btreePtr, treePathTable, &nodeRec, index, 1);