This is consistent with search.c's bsearch_callback() which also checks
key->name first.
const struct header *h = f.header;
key->data = h->data + h->off_data;
- uint64_t off_index = (key->id != NULL)
- ? h->off_id_index
- : h->off_name_index;
+ uint64_t off_index = (key->name != NULL)
+ ? h->off_name_index
+ : h->off_id_index;
uint64_t *off = search(key, h->data + off_index, h->count);
if (off == NULL) {
unmap_file(&f);
const struct header *h = f.header;
key->data = h->data + h->off_data;
- uint64_t off_index = (key->id != NULL)
- ? h->off_id_index
- : h->off_name_index;
+ uint64_t off_index = (key->name != NULL)
+ ? h->off_name_index
+ : h->off_id_index;
uint64_t *off = search(key, h->data + off_index, h->count);
if (off == NULL) {
unmap_file(&f);