Lines Matching refs:btreePtr
145 Input: btreePtr - pointer to BTreeInfoRec
152 OSStatus UpdateHeader (BTreeControlBlockPtr btreePtr)
159 if ((btreePtr->flags & kBTHeaderDirty) == 0) // btree info already flushed
163 err = GetNode (btreePtr, kHeaderNodeNum, &node );
169 header->treeDepth = btreePtr->treeDepth;
170 header->rootNode = btreePtr->rootNode;
171 header->leafRecords = btreePtr->leafRecords;
172 header->firstLeafNode = btreePtr->firstLeafNode;
173 header->lastLeafNode = btreePtr->lastLeafNode;
174 header->nodeSize = btreePtr->nodeSize; //�� this shouldn't change
175 header->maxKeyLength = btreePtr->maxKeyLength; //�� neither should this
176 header->totalNodes = btreePtr->totalNodes;
177 header->freeNodes = btreePtr->freeNodes;
178 header->btreeType = btreePtr->btreeType;
182 err = UpdateNode (btreePtr, &node);
184 btreePtr->flags &= (~kBTHeaderDirty);
200 Input: btreePtr - description
217 OSStatus FindIteratorPosition (BTreeControlBlockPtr btreePtr,
232 // assume btreePtr valid
251 //�� verify iterator key (change CheckKey to take btreePtr instead of keyDescPtr?)
252 if (btreePtr->keyDescPtr != nil)
254 err = CheckKey (&iterator->key, btreePtr->keyDescPtr, btreePtr->maxKeyLength );
259 err = IsItAHint (btreePtr, iterator, &validHint);
268 err = GetNode (btreePtr, nodeNum, middle);
280 ++btreePtr->numValidHints;
282 foundIt = SearchNode (btreePtr, middle->buffer, &iterator->key, &index);
297 err = GetLeftSiblingNode (btreePtr, middle->buffer, left);
306 foundIt = SearchNode (btreePtr, left->buffer, &iterator->key, &leftIndex);
347 err = GetRightSiblingNode (btreePtr, middle->buffer, right);
356 foundIt = SearchNode (btreePtr, right->buffer, &iterator->key, &rightIndex);
379 err = ReleaseNode (btreePtr, left); M_ExitOnError (err);
380 err = ReleaseNode (btreePtr, middle); M_ExitOnError (err);
381 err = ReleaseNode (btreePtr, right); M_ExitOnError (err);
383 err = SearchTree ( btreePtr, &iterator->key, treePathTable, &nodeNum, middle, &index);
407 (void) ReleaseNode (btreePtr, left);
408 (void) ReleaseNode (btreePtr, middle);
409 (void) ReleaseNode (btreePtr, right);
427 BTreeControlBlockPtr btreePtr;
431 btreePtr = (BTreeControlBlockPtr) filePtr->fcbBtree;
432 if (btreePtr == nil) return fsBTInvalidFileErr;
437 if (btreePtr->keyDescPtr != nil)
441 err = CheckKey (&iterator->key, btreePtr->keyDescPtr, btreePtr->maxKeyLength);
448 if ( CalcKeyRecordSize (CalcKeySize(btreePtr, &iterator->key), recordLen) > (btreePtr->nodeSize >> 1))
471 Input: btreePtr - description
486 OSStatus TrySimpleReplace (BTreeControlBlockPtr btreePtr,
506 foundIt = SearchNode (btreePtr, nodePtr, &iterator->key, &index);
511 keySize = CalcKeySize(btreePtr, &iterator->key); // includes length field
515 oldSpace = GetRecordSize (btreePtr, nodePtr, index);
521 dst = GetRecordAddress (btreePtr, nodePtr, index);
532 else if ( (GetNodeFreeSize(btreePtr, nodePtr) + oldSpace) >= spaceNeeded)
534 DeleteRecord (btreePtr, nodePtr, index);
536 didItFit = InsertKeyRecord (btreePtr, nodePtr, index,
537 &iterator->key, KeyLength(btreePtr, &iterator->key),
555 Input: btreePtr - pointer to control block for BTree file
565 OSStatus IsItAHint (BTreeControlBlockPtr btreePtr, BTreeIterator *iterator, Boolean *answer)
567 ++btreePtr->numHintChecks;
577 ++btreePtr->numPossibleHints;