hfscommon/BTree/BTree.c

57 	   <MOSXS>	 4/15/98	djb		In BTOpenPath need to clear nodeRec.buffer if GetBlockProc fails.
229 	nodeRec.buffer				= nil;				// so we can call ReleaseNode
255 		nodeRec.buffer = nil;
261 	header = (BTHeaderRec*) ((uintptr_t)nodeRec.buffer + sizeof(BTNodeDescriptor));
331 		 * buffer cache to read the entire node
435 			is supplied, the record will be copied to the buffer (as much as will fit),
485 	node.buffer = nil;
510 			if ( ((BTNodeDescriptor*) node.buffer)->kind == kBTLeafNode &&
511 				 ((BTNodeDescriptor*) node.buffer)->numRecords	>  0 )
513 				foundRecord = SearchNode (btreePtr, node.buffer, &searchIterator->key, &index);
557 		GetRecordByIndex (btreePtr, node.buffer, index, &keyPtr, &recordPtr, &len);
641 			newKeyPtr		- pointer to buffer to copy key found by iteration
642 			record			- pointer to buffer to copy record found by iteration
670 	left.buffer		  = nil;
672 	right.buffer	  = nil;
674 	node.buffer		  = nil;
717 		if ( ((NodeDescPtr) node.buffer)->kind != kBTLeafNode ||
718 			 ((NodeDescPtr) node.buffer)->numRecords <=  0 )
730 		else									index = ((BTNodeDescriptor*) node.buffer)->numRecords - 1;
754 			if (left.buffer == nil)
756 				nodeNum = ((NodeDescPtr) node.buffer)->bLink;
770 					err = GetRightSiblingNode (btreePtr, left.buffer, &node);
778 			if (right.buffer != nil) {
784 			left.buffer	= nil;
785 			index 		= ((NodeDescPtr) node.buffer)->numRecords -1;
791 			(((NodeDescPtr) node.buffer)->fLink == 0) &&
792 			(index == ((NodeDescPtr) node.buffer)->numRecords))
799 		if ((foundRecord == false) && (index != ((NodeDescPtr) node.buffer)->numRecords))
803 		if (index < ((NodeDescPtr) node.buffer)->numRecords -1)
809 			if (right.buffer == nil)
811 				nodeNum = ((NodeDescPtr) node.buffer)->fLink;
822 			if (left.buffer != nil) {
828 			right.buffer = nil;
836 			(index >= ((NodeDescPtr) node.buffer)->numRecords))
848 	err = GetRecordByIndex (btreePtr, node.buffer, index, &keyPtr, &recordPtr, &len);
907 	if (left.buffer != nil)
913 	if (right.buffer != nil)
986 	left.buffer       = nil;
988 	right.buffer      = nil;
990 	node.buffer       = nil;
1025 		if ( ((NodeDescPtr)node.buffer)->kind != kBTLeafNode ||
1026 			 ((NodeDescPtr)node.buffer)->numRecords <=  0 )
1040 			index = ((BTNodeDescriptor*) node.buffer)->numRecords - 1;
1065 			if (left.buffer == nil)
1067 				nodeNum = ((NodeDescPtr) node.buffer)->bLink;
1081 					err = GetRightSiblingNode (btreePtr, left.buffer, &node);
1089 			if (right.buffer != nil) {
1095 			left.buffer = nil;
1096 			index	    = ((NodeDescPtr) node.buffer)->numRecords -1;
1102 			(((NodeDescPtr)node.buffer)->fLink == 0) &&
1103 			(index == ((NodeDescPtr)node.buffer)->numRecords))
1110 		if ((foundRecord == false) && (index != ((NodeDescPtr)node.buffer)->numRecords))
1114 		if (index < ((NodeDescPtr)node.buffer)->numRecords -1)
1120 			if (right.buffer == nil)
1122 				nodeNum = ((NodeDescPtr)node.buffer)->fLink;
1133 			if (left.buffer != nil) {
1139 			right.buffer = nil;
1147 			(index >= ((NodeDescPtr)node.buffer)->numRecords))
1157 	err = GetRecordByIndex(btreePtr, node.buffer, index, &keyPtr, &recordPtr, &len);
1167 		if ((index+1) < ((NodeDescPtr)node.buffer)->numRecords) {
1170 			if (right.buffer == nil)
1172 				nodeNum = ((NodeDescPtr)node.buffer)->fLink;
1183 			if (left.buffer != nil) {
1189 			right.buffer = nil;
1192 		err = GetRecordByIndex(btreePtr, node.buffer, index,
1221 	if (left.buffer != nil)
1227 	if (right.buffer != nil)
1277 	nodeRec.buffer = nil;					// so we can call ReleaseNode
1318 								((NodeDescPtr)nodeRec.buffer)->kind = kBTLeafNode;
1319 								((NodeDescPtr)nodeRec.buffer)->height	= 1;
1321 								recordFit = InsertKeyRecord (btreePtr, nodeRec.buffer, 0,
1355 		recordFit = InsertKeyRecord (btreePtr, nodeRec.buffer, index,
1442 	nodeRec.buffer = nil;					// so we can call ReleaseNode
1468 			err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1506 	err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1533 	DeleteRecord (btreePtr, nodeRec.buffer, index);	// delete existing key/record
1589 	nodeRec.buffer = nil;					// so we can call ReleaseNode
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);
1646 	err = GetRecordByIndex(btreePtr, nodeRec.buffer, index, &keyPtr, &recordPtr, &recordLen);
1699 	nodeRec.buffer = nil;					// so we can call ReleaseNode
1864 	node.buffer = nil;
1877 	header = (BTHeaderRec*)((char *)node.buffer + sizeof(BTNodeDescriptor));
2034 	node.buffer = nil;
2047 	offset = (char *)node.buffer + sizeof(BTNodeDescriptor) + sizeof(BTHeaderRec);
2071 	node.buffer = nil;
2086 	offset = (char *)node.buffer + sizeof(BTNodeDescriptor) + sizeof(BTHeaderRec);