Lines Matching refs:buffer
259 header = (BTHeaderRec*) ((char *)node.buffer + sizeof(BTNodeDescriptor));
335 left->buffer = nil;
337 middle->buffer = nil;
339 right->buffer = nil;
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;
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);
413 left->buffer = nil;
423 else if (leftIndex >= ((NodeDescPtr) left->buffer)->numRecords)
425 nodeNum = ((NodeDescPtr) left->buffer)->fLink;
434 left->buffer = nil;
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);
452 if ( ((NodeDescPtr) right->buffer)->kind != kBTLeafNode ||
453 ((NodeDescPtr) right->buffer)->numRecords <= 0 )
458 foundIt = SearchNode (btreePtr, right->buffer, &iterator->key, &rightIndex);
459 if (rightIndex >= ((NodeDescPtr) right->buffer)->numRecords) // we're lost
467 right->buffer = nil;