Lines Matching defs:middle
303 middle - description
317 BlockDescriptor *middle,
330 // assume left, middle, right point to BlockDescriptors
337 middle->buffer = nil;
338 middle->blockHeader = nil;
359 err = GetNode (btreePtr, nodeNum, kGetNodeHint, middle);
365 if ( ((NodeDescPtr) middle->buffer)->kind != kBTLeafNode ||
366 ((NodeDescPtr) middle->buffer)->numRecords <= 0 )
371 foundIt = SearchNode (btreePtr, middle->buffer, &iterator->key, &index);
381 if (((NodeDescPtr) middle->buffer)->bLink == 0) // before 1st btree record
386 nodeNum = ((NodeDescPtr) middle->buffer)->bLink;
391 err = ReleaseNode(btreePtr, middle);
399 err = GetRightSiblingNode (btreePtr, left->buffer, middle);
411 *right = *middle;
412 *middle = *left;
432 *right = *middle;
433 *middle = *left;
440 else if (index >= ((NodeDescPtr) middle->buffer)->numRecords)
442 if (((NodeDescPtr) middle->buffer)->fLink == 0) // beyond last record
447 nodeNum = ((NodeDescPtr) middle->buffer)->fLink;
449 err = GetRightSiblingNode (btreePtr, middle->buffer, right);
465 *left = *middle;
466 *middle = *right;
482 err = ReleaseNode (btreePtr, middle); M_ExitOnError (err);
485 err = SearchTree ( btreePtr, &iterator->key, treePathTable, &nodeNum, middle, &index);
510 (void) ReleaseNode (btreePtr, middle);