Lines Matching refs:left
302 left - description
316 BlockDescriptor *left,
330 // assume left, middle, right point to BlockDescriptors
335 left->buffer = nil;
336 left->blockHeader = nil;
388 // BTree nodes are always grabbed in left to right order.
390 // left node.
394 // Look up the left node
395 err = GetNode (btreePtr, nodeNum, 0, left);
399 err = GetRightSiblingNode (btreePtr, left->buffer, middle);
402 if ( ((NodeDescPtr) left->buffer)->kind != kBTLeafNode ||
403 ((NodeDescPtr) left->buffer)->numRecords <= 0 )
408 foundIt = SearchNode (btreePtr, left->buffer, &iterator->key, &leftIndex);
412 *middle = *left;
413 left->buffer = nil;
423 else if (leftIndex >= ((NodeDescPtr) left->buffer)->numRecords)
425 nodeNum = ((NodeDescPtr) left->buffer)->fLink;
433 *middle = *left;
434 left->buffer = nil;
465 *left = *middle;
481 err = ReleaseNode (btreePtr, left); M_ExitOnError (err);
509 (void) ReleaseNode (btreePtr, left);