Lines Matching refs:buffer
133 node.buffer = nil; // clear node.buffer to get header node
250 node.buffer = nil; // invalidate node.buffer to get header node
340 mapNode.buffer = nil;
342 newNode.buffer = nil;
359 } while ( ((BTNodeDescriptor*)mapNode.buffer)->fLink != 0 );
406 ((BTNodeDescriptor*)mapNode.buffer)->fLink = firstNewMapNodeNum;
417 ((NodeDescPtr)newNode.buffer)->numRecords = 1;
418 ((NodeDescPtr)newNode.buffer)->kind = kBTMapNode;
421 *(u_int16_t *)((Ptr)newNode.buffer + nodeSize - 4) = nodeSize - 6;
426 ((BTNodeDescriptor*)newNode.buffer)->fLink = nodeNum; // point to next map node
444 nextNodeNum = ((NodeDescPtr)mapNode.buffer)->fLink;
462 mapStart = (u_int16_t *) GetRecordAddress (btreePtr, mapNode.buffer, mapIndex);
463 mapSize = GetRecordSize (btreePtr, mapNode.buffer, mapIndex);
522 it and gets the next node. If nodePtr->buffer is nil, then the header
549 if (nodePtr->buffer != nil) // if iterator is valid...
551 nextNodeNum = ((NodeDescPtr)nodePtr->buffer)->fLink;
564 if ( ((NodeDescPtr)nodePtr->buffer)->kind != kBTMapNode)
576 if ( ((NodeDescPtr)nodePtr->buffer)->kind != kBTHeaderNode)
586 *mapPtr = (u_int16_t *) GetRecordAddress (btreePtr, nodePtr->buffer, mapIndex);
587 *mapSize = GetRecordSize (btreePtr, nodePtr->buffer, mapIndex);
644 mapNode.buffer = nil;
684 * Get a buffer full of zeros and write it to the unused
712 * Try not to hog the buffer cache. Wait for the write