Lines Matching defs:record
64 checking if we had a record and could call BlockMove with an
66 <CS8> 10/24/97 msd In BTIterateRecord, when moving to the previous or next record
84 <HFS5> 1/13/97 djb Added support for getting current record to BTIterateRecord.
103 though we didn't have to add a record.
109 position routine does not find the record and we are looking for
110 the next record. In such a case, if the node's forrward link is
133 <12> 8/16/93 prp In BTSearchRecord, if the input hint found the node and record,
429 Routine: BTSearchRecord - Search BTree for a record with a matching key.
434 a result of the search. If a record exists at that position, and a BufferDescriptor
435 is supplied, the record will be copied to the buffer (as much as will fit),
436 and recordLen will be set to the length of the record.
446 Output: record - pointer to BufferDescriptor containing record
450 Result: noErr - success, record contains copy of record found
451 fsBTRecordNotFoundErr - record was not found, no data copied
459 FSBufferDescriptor *record,
561 if (record != nil)
565 recordSize = record->itemCount * record->itemSize;
569 BlockMoveData (recordPtr, record->bufferAddress, len);
632 Routine: BTIterateRecord - Find the first, next, previous, or last record.
634 Function: Find the first, next, previous, or last record in the BTree
642 record - pointer to buffer to copy record found by iteration
643 recordLen - length of record
652 FSBufferDescriptor *record,
798 // we did not find the record but the index is already positioned correctly
802 // we found the record OR we have to look in the next node
854 if (record != nil)
858 recordSize = record->itemCount * record->itemSize;
862 BlockMoveData (recordPtr, record->bufferAddress, len);
960 callBackProc - pointer to routince to process a record
1109 // we did not find the record but the index is already positioned correctly
1113 // we found the record OR we have to look in the next node
1263 FSBufferDescriptor *record,
1280 err = CheckInsertParams (filePtr, iterator, record, recordLen);
1323 record->bufferAddress, recordLen );
1357 record->bufferAddress, recordLen);
1379 // no need to delete existing record
1381 err = InsertTree (btreePtr, treePathTable, &iterator->key, record->bufferAddress,
1426 FSBufferDescriptor *record,
1445 err = CheckInsertParams (filePtr, iterator, record, recordLen);
1468 err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1498 M_ExitOnError (err); // record must exit for Replace
1506 err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1533 DeleteRecord (btreePtr, nodeRec.buffer, index); // delete existing key/record
1535 err = InsertTree (btreePtr, treePathTable, &iterator->key, record->bufferAddress,
1720 M_ExitOnError (err); // record must exit for Delete