Lines Matching defs:records
28 * The remainder of the volume is divided into chapters consisting of several pages of records, and
29 * several pages of static index to use to find those records. The index pages are recorded first,
34 * When a new chapter is filled and closed, the records from that chapter are sorted and
46 * are stored in a page cache when read for the common case that subsequent records need the same
59 * range of chapters contain valid records, so that those records can be used to reconstruct the
475 * The array of records is sorted by name and stored as a binary tree in heap order, so the
479 const struct uds_volume_record *records = (const struct uds_volume_record *) record_page;
483 const struct uds_volume_record *record = &records[node];
1181 const struct uds_volume_record records[], u8 record_page[])
1189 record_pointers[i] = &records[i];
1192 * Sort the record pointers by using just the names in the records, which is less work than
1206 const struct uds_volume_record *records)
1211 const struct uds_volume_record *next_record = records;
1245 const struct uds_volume_record *records)
1256 result = write_record_pages(volume, physical_chapter_number, records);