Lines Matching defs:leftNode
109 NodeDescPtr leftNode,
116 NodeDescPtr leftNode,
128 NodeDescPtr leftNode,
132 BlockDescriptor *leftNode,
161 BlockDescriptor *leftNode,
392 BlockDescriptor leftNode;
404 leftNode.buffer = nil;
405 leftNode.blockHeader = nil;
417 &newNodeNum, &newIndex, &leftNode, &updateParent, &insertParent, &newRoot );
443 &newNodeNum, &newIndex, &leftNode, &updateParent, &insertParent, &temp);
521 insertKeyPtr->keyPtr = (KeyPtr) GetRecordAddress (btreePtr, leftNode.buffer, 0);
537 err = UpdateNode (btreePtr, &leftNode, 0, kLockTransaction); // all done with left sibling
545 (void) ReleaseNode (btreePtr, &leftNode);
567 BlockDescriptor *leftNode,
580 PanicIf ( rightNode->buffer == leftNode->buffer, " InsertNode: rightNode == leftNode, huh?");
589 if (leftNode->buffer == NULL) {
594 targetNode = leftNode;
619 PanicIf ( leftNode->buffer != nil, " InsertNode: leftNode already acquired!");
621 if ( leftNode->buffer == nil )
623 err = GetNode (btreePtr, leftNodeNum, 0, leftNode); // will be released by caller or a split below
626 ModifyBlockStart(btreePtr->fileRefNum, leftNode);
629 PanicIf ( ((NodeDescPtr) leftNode->buffer)->fLink != node, " InsertNode, RotateLeft: invalid sibling link!" );
633 err = RotateLeft (btreePtr, leftNode->buffer, rightNode->buffer, index, key->keyPtr, key->recPtr,
651 err = SplitLeft (btreePtr, leftNode, rightNode, node, index, key->keyPtr,
659 err = AddNewRootNode (btreePtr, leftNode->buffer, rightNode->buffer); // Note: does not update TPT
675 (void) ReleaseNode (btreePtr, leftNode);
939 leftNode - description
956 NodeDescPtr leftNode,
996 leftSize = nodeSize - GetNodeFreeSize (btreePtr, leftNode);
1037 // we've found balance point, moveIndex == number of records moved into leftNode
1052 leftInsertIndex = leftNode->numRecords;
1054 didItFit = InsertKeyRecord (btreePtr, leftNode, leftInsertIndex,
1068 didItFit = RotateRecordLeft (btreePtr, leftNode, rightNode);
1094 *insertNodeNum = leftNode->fLink;
1118 BlockDescriptor *leftNode,
1138 left = leftNode->buffer;
1171 ModifyBlockStart(btreePtr->fileRefNum, leftNode);
1174 err = UpdateNode (btreePtr, leftNode, 0, kLockTransaction);
1181 err = GetNewNode (btreePtr, newNodeNum, leftNode);
1185 ModifyBlockStart(btreePtr->fileRefNum, leftNode);
1187 left = leftNode->buffer;
1218 (void) ReleaseNode (btreePtr, leftNode);
1235 NodeDescPtr leftNode,
1245 recordFit = InsertRecord (btreePtr, leftNode, leftNode->numRecords, recPtr, size);
1259 NodeDescPtr leftNode,
1272 PanicIf (leftNode == nil, "AddNewRootNode: leftNode == nil");
1293 keyPtr = (KeyPtr) GetRecordAddress (btreePtr, leftNode, 0);
1308 (u_int8_t *) &leftNode->fLink, 4 );