hfscommon/BTree/BTree.c

201 	 * Subsequent opens allow key compare proc to be changed.
385 			block and key descriptor associated with the file if filePtr is last
429 Routine:	BTSearchRecord	-	Search BTree for a record with a matching key.
443 			searchKey		- pointer to search key to match.
513 				foundRecord = SearchNode (btreePtr, node.buffer, &searchIterator->key, &index);
538 		err = SearchTree ( btreePtr, &searchIterator->key, treePathTable, &nodeNum, &node, &index);
589 		// copy the key in the BTree when found rather than searchIterator->key to get proper case/diacriticals
591 			BlockMoveData ((Ptr)keyPtr, (Ptr)&resultIterator->key, CalcKeySize(btreePtr, keyPtr));
593 			BlockMoveData ((Ptr)&searchIterator->key, (Ptr)&resultIterator->key, CalcKeySize(btreePtr, &searchIterator->key));
620 		resultIterator->key.length16	= 0;	// zero out two bytes to cover both types of keys
641 			newKeyPtr		- pointer to buffer to copy key found by iteration
898 		BlockMoveData ((Ptr)keyPtr, (Ptr)&iterator->key, CalcKeySize(btreePtr, keyPtr));
942 		iterator->key.length16		= 0;
1211 		BlockMoveData((Ptr)keyPtr, (Ptr)&iterator->key, CalcKeySize(btreePtr, keyPtr));
1249 		iterator->key.length16	  = 0;
1292 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1322 															 &iterator->key, KeyLength(btreePtr, &iterator->key),
1356 										&iterator->key, KeyLength(btreePtr, &iterator->key),
1381 	err = InsertTree (btreePtr, treePathTable, &iterator->key, record->bufferAddress,
1497 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1533 	DeleteRecord (btreePtr, nodeRec.buffer, index);	// delete existing key/record
1535 	err = InsertTree (btreePtr, treePathTable, &iterator->key, record->bufferAddress,
1609 			    SearchNode (btreePtr, nodeRec.buffer, &iterator->key, &index))
1643 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1719 	err = SearchTree (btreePtr, &iterator->key, treePathTable, &nodeNum, &nodeRec, &index);