]>
Commit | Line | Data |
---|---|---|
b6fdc44c | 1 | #include "git-compat-util.h" |
f394e093 | 2 | #include "gettext.h" |
3449f8c4 | 3 | #include "pack-revindex.h" |
87bed179 | 4 | #include "object-file.h" |
a034e910 | 5 | #include "object-store-ll.h" |
4828ce98 | 6 | #include "packfile.h" |
a034e910 | 7 | #include "strbuf.h" |
74ea5c95 | 8 | #include "trace2.h" |
ec8e7760 | 9 | #include "config.h" |
f894081d | 10 | #include "midx.h" |
d975fe1f | 11 | #include "csum-file.h" |
3449f8c4 | 12 | |
d5bc7c60 TB |
13 | struct revindex_entry { |
14 | off_t offset; | |
15 | unsigned int nr; | |
16 | }; | |
17 | ||
3449f8c4 NP |
18 | /* |
19 | * Pack index for existing packs give us easy access to the offsets into | |
20 | * corresponding pack file where each object's data starts, but the entries | |
21 | * do not store the size of the compressed representation (uncompressed | |
22 | * size is easily available by examining the pack entry header). It is | |
23 | * also rather expensive to find the sha1 for an object given its offset. | |
24 | * | |
f4015337 JK |
25 | * The pack index file is sorted by object name mapping to offset; |
26 | * this revindex array is a list of offset/index_nr pairs | |
3449f8c4 NP |
27 | * ordered by offset, so if you know the offset of an object, next offset |
28 | * is where its packed representation ends and the index_nr can be used to | |
29 | * get the object sha1 from the main index. | |
30 | */ | |
31 | ||
8b8dfd51 JK |
32 | /* |
33 | * This is a least-significant-digit radix sort. | |
34 | * | |
35 | * It sorts each of the "n" items in "entries" by its offset field. The "max" | |
36 | * parameter must be at least as large as the largest offset in the array, | |
37 | * and lets us quit the sort early. | |
38 | */ | |
39 | static void sort_revindex(struct revindex_entry *entries, unsigned n, off_t max) | |
3449f8c4 | 40 | { |
8b8dfd51 JK |
41 | /* |
42 | * We use a "digit" size of 16 bits. That keeps our memory | |
43 | * usage reasonable, and we can generally (for a 4G or smaller | |
44 | * packfile) quit after two rounds of radix-sorting. | |
45 | */ | |
46 | #define DIGIT_SIZE (16) | |
47 | #define BUCKETS (1 << DIGIT_SIZE) | |
48 | /* | |
49 | * We want to know the bucket that a[i] will go into when we are using | |
50 | * the digit that is N bits from the (least significant) end. | |
51 | */ | |
52 | #define BUCKET_FOR(a, i, bits) (((a)[(i)].offset >> (bits)) & (BUCKETS-1)) | |
53 | ||
54 | /* | |
55 | * We need O(n) temporary storage. Rather than do an extra copy of the | |
56 | * partial results into "entries", we sort back and forth between the | |
57 | * real array and temporary storage. In each iteration of the loop, we | |
58 | * keep track of them with alias pointers, always sorting from "from" | |
59 | * to "to". | |
60 | */ | |
b32fa95f | 61 | struct revindex_entry *tmp, *from, *to; |
8b8dfd51 | 62 | int bits; |
b32fa95f JK |
63 | unsigned *pos; |
64 | ||
65 | ALLOC_ARRAY(pos, BUCKETS); | |
66 | ALLOC_ARRAY(tmp, n); | |
67 | from = entries; | |
68 | to = tmp; | |
8b8dfd51 JK |
69 | |
70 | /* | |
71 | * If (max >> bits) is zero, then we know that the radix digit we are | |
72 | * on (and any higher) will be zero for all entries, and our loop will | |
73 | * be a no-op, as everybody lands in the same zero-th bucket. | |
74 | */ | |
75 | for (bits = 0; max >> bits; bits += DIGIT_SIZE) { | |
8b8dfd51 JK |
76 | unsigned i; |
77 | ||
78 | memset(pos, 0, BUCKETS * sizeof(*pos)); | |
79 | ||
80 | /* | |
81 | * We want pos[i] to store the index of the last element that | |
82 | * will go in bucket "i" (actually one past the last element). | |
83 | * To do this, we first count the items that will go in each | |
84 | * bucket, which gives us a relative offset from the last | |
85 | * bucket. We can then cumulatively add the index from the | |
86 | * previous bucket to get the true index. | |
87 | */ | |
88 | for (i = 0; i < n; i++) | |
89 | pos[BUCKET_FOR(from, i, bits)]++; | |
90 | for (i = 1; i < BUCKETS; i++) | |
91 | pos[i] += pos[i-1]; | |
92 | ||
93 | /* | |
94 | * Now we can drop the elements into their correct buckets (in | |
95 | * our temporary array). We iterate the pos counter backwards | |
96 | * to avoid using an extra index to count up. And since we are | |
97 | * going backwards there, we must also go backwards through the | |
98 | * array itself, to keep the sort stable. | |
99 | * | |
100 | * Note that we use an unsigned iterator to make sure we can | |
101 | * handle 2^32-1 objects, even on a 32-bit system. But this | |
102 | * means we cannot use the more obvious "i >= 0" loop condition | |
103 | * for counting backwards, and must instead check for | |
104 | * wrap-around with UINT_MAX. | |
105 | */ | |
106 | for (i = n - 1; i != UINT_MAX; i--) | |
107 | to[--pos[BUCKET_FOR(from, i, bits)]] = from[i]; | |
108 | ||
109 | /* | |
110 | * Now "to" contains the most sorted list, so we swap "from" and | |
111 | * "to" for the next iteration. | |
112 | */ | |
35d803bc | 113 | SWAP(from, to); |
8b8dfd51 JK |
114 | } |
115 | ||
116 | /* | |
117 | * If we ended with our data in the original array, great. If not, | |
118 | * we have to move it back from the temporary storage. | |
119 | */ | |
120 | if (from != entries) | |
45ccef87 | 121 | COPY_ARRAY(entries, tmp, n); |
8b8dfd51 JK |
122 | free(tmp); |
123 | free(pos); | |
124 | ||
125 | #undef BUCKET_FOR | |
126 | #undef BUCKETS | |
127 | #undef DIGIT_SIZE | |
3449f8c4 NP |
128 | } |
129 | ||
130 | /* | |
131 | * Ordered list of offsets of objects in the pack. | |
132 | */ | |
9d98bbf5 | 133 | static void create_pack_revindex(struct packed_git *p) |
3449f8c4 | 134 | { |
33de80b1 | 135 | const unsigned num_ent = p->num_objects; |
012b32bb | 136 | unsigned i; |
3449f8c4 | 137 | const char *index = p->index_data; |
fa130802 | 138 | const unsigned hashsz = the_hash_algo->rawsz; |
3449f8c4 | 139 | |
11529ece | 140 | ALLOC_ARRAY(p->revindex, num_ent + 1); |
3449f8c4 NP |
141 | index += 4 * 256; |
142 | ||
143 | if (p->index_version > 1) { | |
144 | const uint32_t *off_32 = | |
f86f7695 | 145 | (uint32_t *)(index + 8 + (size_t)p->num_objects * (hashsz + 4)); |
3449f8c4 NP |
146 | const uint32_t *off_64 = off_32 + p->num_objects; |
147 | for (i = 0; i < num_ent; i++) { | |
33de80b1 | 148 | const uint32_t off = ntohl(*off_32++); |
3449f8c4 | 149 | if (!(off & 0x80000000)) { |
9d98bbf5 | 150 | p->revindex[i].offset = off; |
3449f8c4 | 151 | } else { |
ad622a25 DS |
152 | p->revindex[i].offset = get_be64(off_64); |
153 | off_64 += 2; | |
3449f8c4 | 154 | } |
9d98bbf5 | 155 | p->revindex[i].nr = i; |
3449f8c4 NP |
156 | } |
157 | } else { | |
158 | for (i = 0; i < num_ent; i++) { | |
33de80b1 | 159 | const uint32_t hl = *((uint32_t *)(index + (hashsz + 4) * i)); |
9d98bbf5 JK |
160 | p->revindex[i].offset = ntohl(hl); |
161 | p->revindex[i].nr = i; | |
3449f8c4 NP |
162 | } |
163 | } | |
164 | ||
fa130802 | 165 | /* |
166 | * This knows the pack format -- the hash trailer | |
3449f8c4 NP |
167 | * follows immediately after the last object data. |
168 | */ | |
fa130802 | 169 | p->revindex[num_ent].offset = p->pack_size - hashsz; |
9d98bbf5 JK |
170 | p->revindex[num_ent].nr = -1; |
171 | sort_revindex(p->revindex, num_ent, p->pack_size); | |
3449f8c4 NP |
172 | } |
173 | ||
2f4ba2a8 | 174 | static int create_pack_revindex_in_memory(struct packed_git *p) |
3449f8c4 | 175 | { |
ec8e7760 TB |
176 | if (git_env_bool(GIT_TEST_REV_INDEX_DIE_IN_MEMORY, 0)) |
177 | die("dying as requested by '%s'", | |
178 | GIT_TEST_REV_INDEX_DIE_IN_MEMORY); | |
2f4ba2a8 TB |
179 | if (open_pack_index(p)) |
180 | return -1; | |
181 | create_pack_revindex(p); | |
4828ce98 | 182 | return 0; |
92e5c77c VM |
183 | } |
184 | ||
2f4ba2a8 TB |
185 | static char *pack_revindex_filename(struct packed_git *p) |
186 | { | |
187 | size_t len; | |
188 | if (!strip_suffix(p->pack_name, ".pack", &len)) | |
189 | BUG("pack_name does not end in .pack"); | |
190 | return xstrfmt("%.*s.rev", (int)len, p->pack_name); | |
191 | } | |
192 | ||
193 | #define RIDX_HEADER_SIZE (12) | |
194 | #define RIDX_MIN_SIZE (RIDX_HEADER_SIZE + (2 * the_hash_algo->rawsz)) | |
195 | ||
196 | struct revindex_header { | |
197 | uint32_t signature; | |
198 | uint32_t version; | |
199 | uint32_t hash_id; | |
200 | }; | |
201 | ||
202 | static int load_revindex_from_disk(char *revindex_name, | |
203 | uint32_t num_objects, | |
204 | const uint32_t **data_p, size_t *len_p) | |
205 | { | |
206 | int fd, ret = 0; | |
207 | struct stat st; | |
208 | void *data = NULL; | |
209 | size_t revindex_size; | |
210 | struct revindex_header *hdr; | |
211 | ||
2a250d61 TB |
212 | if (git_env_bool(GIT_TEST_REV_INDEX_DIE_ON_DISK, 0)) |
213 | die("dying as requested by '%s'", GIT_TEST_REV_INDEX_DIE_ON_DISK); | |
214 | ||
2f4ba2a8 TB |
215 | fd = git_open(revindex_name); |
216 | ||
217 | if (fd < 0) { | |
5a6072f6 DS |
218 | /* "No file" means return 1. */ |
219 | ret = 1; | |
2f4ba2a8 TB |
220 | goto cleanup; |
221 | } | |
222 | if (fstat(fd, &st)) { | |
223 | ret = error_errno(_("failed to read %s"), revindex_name); | |
224 | goto cleanup; | |
225 | } | |
226 | ||
227 | revindex_size = xsize_t(st.st_size); | |
228 | ||
229 | if (revindex_size < RIDX_MIN_SIZE) { | |
230 | ret = error(_("reverse-index file %s is too small"), revindex_name); | |
231 | goto cleanup; | |
232 | } | |
233 | ||
234 | if (revindex_size - RIDX_MIN_SIZE != st_mult(sizeof(uint32_t), num_objects)) { | |
235 | ret = error(_("reverse-index file %s is corrupt"), revindex_name); | |
236 | goto cleanup; | |
237 | } | |
238 | ||
239 | data = xmmap(NULL, revindex_size, PROT_READ, MAP_PRIVATE, fd, 0); | |
240 | hdr = data; | |
241 | ||
242 | if (ntohl(hdr->signature) != RIDX_SIGNATURE) { | |
243 | ret = error(_("reverse-index file %s has unknown signature"), revindex_name); | |
244 | goto cleanup; | |
245 | } | |
246 | if (ntohl(hdr->version) != 1) { | |
247 | ret = error(_("reverse-index file %s has unsupported version %"PRIu32), | |
248 | revindex_name, ntohl(hdr->version)); | |
249 | goto cleanup; | |
250 | } | |
251 | if (!(ntohl(hdr->hash_id) == 1 || ntohl(hdr->hash_id) == 2)) { | |
252 | ret = error(_("reverse-index file %s has unsupported hash id %"PRIu32), | |
253 | revindex_name, ntohl(hdr->hash_id)); | |
254 | goto cleanup; | |
255 | } | |
256 | ||
257 | cleanup: | |
258 | if (ret) { | |
259 | if (data) | |
260 | munmap(data, revindex_size); | |
261 | } else { | |
262 | *len_p = revindex_size; | |
263 | *data_p = (const uint32_t *)data; | |
264 | } | |
265 | ||
66f52fa2 TB |
266 | if (fd >= 0) |
267 | close(fd); | |
2f4ba2a8 TB |
268 | return ret; |
269 | } | |
270 | ||
5a6072f6 | 271 | int load_pack_revindex_from_disk(struct packed_git *p) |
2f4ba2a8 TB |
272 | { |
273 | char *revindex_name; | |
274 | int ret; | |
275 | if (open_pack_index(p)) | |
276 | return -1; | |
277 | ||
278 | revindex_name = pack_revindex_filename(p); | |
279 | ||
280 | ret = load_revindex_from_disk(revindex_name, | |
281 | p->num_objects, | |
282 | &p->revindex_map, | |
283 | &p->revindex_size); | |
284 | if (ret) | |
285 | goto cleanup; | |
286 | ||
287 | p->revindex_data = (const uint32_t *)((const char *)p->revindex_map + RIDX_HEADER_SIZE); | |
288 | ||
289 | cleanup: | |
290 | free(revindex_name); | |
291 | return ret; | |
292 | } | |
293 | ||
65308ad8 | 294 | int load_pack_revindex(struct repository *r, struct packed_git *p) |
2f4ba2a8 TB |
295 | { |
296 | if (p->revindex || p->revindex_data) | |
297 | return 0; | |
298 | ||
dbcf6116 TB |
299 | prepare_repo_settings(r); |
300 | ||
301 | if (r->settings.pack_read_reverse_index && | |
302 | !load_pack_revindex_from_disk(p)) | |
2f4ba2a8 TB |
303 | return 0; |
304 | else if (!create_pack_revindex_in_memory(p)) | |
305 | return 0; | |
306 | return -1; | |
307 | } | |
308 | ||
0d30feef DS |
309 | /* |
310 | * verify_pack_revindex verifies that the on-disk rev-index for the given | |
311 | * pack-file is the same that would be created if written from scratch. | |
312 | * | |
313 | * A negative number is returned on error. | |
314 | */ | |
315 | int verify_pack_revindex(struct packed_git *p) | |
316 | { | |
5f658d1b DS |
317 | int res = 0; |
318 | ||
d975fe1f | 319 | /* Do not bother checking if not initialized. */ |
5f658d1b DS |
320 | if (!p->revindex_map || !p->revindex_data) |
321 | return res; | |
d975fe1f DS |
322 | |
323 | if (!hashfile_checksum_valid((const unsigned char *)p->revindex_map, p->revindex_size)) { | |
324 | error(_("invalid checksum")); | |
5f658d1b | 325 | res = -1; |
d975fe1f DS |
326 | } |
327 | ||
5f658d1b DS |
328 | /* This may fail due to a broken .idx. */ |
329 | if (create_pack_revindex_in_memory(p)) | |
330 | return res; | |
331 | ||
332 | for (size_t i = 0; i < p->num_objects; i++) { | |
333 | uint32_t nr = p->revindex[i].nr; | |
334 | uint32_t rev_val = get_be32(p->revindex_data + i); | |
335 | ||
336 | if (nr != rev_val) { | |
337 | error(_("invalid rev-index position at %"PRIu64": %"PRIu32" != %"PRIu32""), | |
338 | (uint64_t)i, nr, rev_val); | |
339 | res = -1; | |
340 | } | |
341 | } | |
342 | ||
343 | return res; | |
0d30feef DS |
344 | } |
345 | ||
f894081d TB |
346 | int load_midx_revindex(struct multi_pack_index *m) |
347 | { | |
60980aed | 348 | struct strbuf revindex_name = STRBUF_INIT; |
f894081d | 349 | int ret; |
7f514b7a | 350 | |
f894081d TB |
351 | if (m->revindex_data) |
352 | return 0; | |
353 | ||
7f514b7a TB |
354 | if (m->chunk_revindex) { |
355 | /* | |
356 | * If the MIDX `m` has a `RIDX` chunk, then use its contents for | |
357 | * the reverse index instead of trying to load a separate `.rev` | |
358 | * file. | |
359 | * | |
360 | * Note that we do *not* set `m->revindex_map` here, since we do | |
361 | * not want to accidentally call munmap() in the middle of the | |
362 | * MIDX. | |
363 | */ | |
364 | trace2_data_string("load_midx_revindex", the_repository, | |
365 | "source", "midx"); | |
366 | m->revindex_data = (const uint32_t *)m->chunk_revindex; | |
367 | return 0; | |
368 | } | |
369 | ||
09a77999 TB |
370 | trace2_data_string("load_midx_revindex", the_repository, |
371 | "source", "rev"); | |
372 | ||
60980aed | 373 | get_midx_rev_filename(&revindex_name, m); |
f894081d | 374 | |
60980aed | 375 | ret = load_revindex_from_disk(revindex_name.buf, |
f894081d TB |
376 | m->num_objects, |
377 | &m->revindex_map, | |
378 | &m->revindex_len); | |
379 | if (ret) | |
380 | goto cleanup; | |
381 | ||
382 | m->revindex_data = (const uint32_t *)((const char *)m->revindex_map + RIDX_HEADER_SIZE); | |
383 | ||
384 | cleanup: | |
60980aed | 385 | strbuf_release(&revindex_name); |
f894081d TB |
386 | return ret; |
387 | } | |
388 | ||
389 | int close_midx_revindex(struct multi_pack_index *m) | |
390 | { | |
391 | if (!m || !m->revindex_map) | |
392 | return 0; | |
393 | ||
394 | munmap((void*)m->revindex_map, m->revindex_len); | |
395 | ||
396 | m->revindex_map = NULL; | |
397 | m->revindex_data = NULL; | |
398 | m->revindex_len = 0; | |
399 | ||
400 | return 0; | |
401 | } | |
402 | ||
8389855a | 403 | int offset_to_pack_pos(struct packed_git *p, off_t ofs, uint32_t *pos) |
92e5c77c | 404 | { |
8389855a | 405 | unsigned lo, hi; |
8389855a | 406 | |
65308ad8 | 407 | if (load_pack_revindex(the_repository, p) < 0) |
8389855a TB |
408 | return -1; |
409 | ||
410 | lo = 0; | |
411 | hi = p->num_objects + 1; | |
92e5c77c | 412 | |
3449f8c4 | 413 | do { |
33de80b1 | 414 | const unsigned mi = lo + (hi - lo) / 2; |
e5dcd784 TB |
415 | off_t got = pack_pos_to_offset(p, mi); |
416 | ||
417 | if (got == ofs) { | |
8389855a TB |
418 | *pos = mi; |
419 | return 0; | |
e5dcd784 | 420 | } else if (ofs < got) |
3449f8c4 NP |
421 | hi = mi; |
422 | else | |
423 | lo = mi + 1; | |
424 | } while (lo < hi); | |
92e5c77c | 425 | |
08698b1e | 426 | error("bad offset for revindex"); |
92e5c77c VM |
427 | return -1; |
428 | } | |
429 | ||
f33fb6e4 TB |
430 | uint32_t pack_pos_to_index(struct packed_git *p, uint32_t pos) |
431 | { | |
2f4ba2a8 | 432 | if (!(p->revindex || p->revindex_data)) |
f33fb6e4 TB |
433 | BUG("pack_pos_to_index: reverse index not yet loaded"); |
434 | if (p->num_objects <= pos) | |
435 | BUG("pack_pos_to_index: out-of-bounds object at %"PRIu32, pos); | |
2f4ba2a8 TB |
436 | |
437 | if (p->revindex) | |
438 | return p->revindex[pos].nr; | |
439 | else | |
440 | return get_be32(p->revindex_data + pos); | |
f33fb6e4 TB |
441 | } |
442 | ||
443 | off_t pack_pos_to_offset(struct packed_git *p, uint32_t pos) | |
444 | { | |
2f4ba2a8 | 445 | if (!(p->revindex || p->revindex_data)) |
f33fb6e4 TB |
446 | BUG("pack_pos_to_index: reverse index not yet loaded"); |
447 | if (p->num_objects < pos) | |
448 | BUG("pack_pos_to_offset: out-of-bounds object at %"PRIu32, pos); | |
2f4ba2a8 TB |
449 | |
450 | if (p->revindex) | |
451 | return p->revindex[pos].offset; | |
452 | else if (pos == p->num_objects) | |
453 | return p->pack_size - the_hash_algo->rawsz; | |
454 | else | |
455 | return nth_packed_object_offset(p, pack_pos_to_index(p, pos)); | |
f33fb6e4 | 456 | } |
f894081d TB |
457 | |
458 | uint32_t pack_pos_to_midx(struct multi_pack_index *m, uint32_t pos) | |
459 | { | |
460 | if (!m->revindex_data) | |
461 | BUG("pack_pos_to_midx: reverse index not yet loaded"); | |
462 | if (m->num_objects <= pos) | |
463 | BUG("pack_pos_to_midx: out-of-bounds object at %"PRIu32, pos); | |
464 | return get_be32(m->revindex_data + pos); | |
465 | } | |
466 | ||
467 | struct midx_pack_key { | |
468 | uint32_t pack; | |
469 | off_t offset; | |
470 | ||
471 | uint32_t preferred_pack; | |
472 | struct multi_pack_index *midx; | |
473 | }; | |
474 | ||
475 | static int midx_pack_order_cmp(const void *va, const void *vb) | |
476 | { | |
477 | const struct midx_pack_key *key = va; | |
478 | struct multi_pack_index *midx = key->midx; | |
479 | ||
480 | uint32_t versus = pack_pos_to_midx(midx, (uint32_t*)vb - (const uint32_t *)midx->revindex_data); | |
481 | uint32_t versus_pack = nth_midxed_pack_int_id(midx, versus); | |
482 | off_t versus_offset; | |
483 | ||
484 | uint32_t key_preferred = key->pack == key->preferred_pack; | |
485 | uint32_t versus_preferred = versus_pack == key->preferred_pack; | |
486 | ||
487 | /* | |
488 | * First, compare the preferred-ness, noting that the preferred pack | |
489 | * comes first. | |
490 | */ | |
491 | if (key_preferred && !versus_preferred) | |
492 | return -1; | |
493 | else if (!key_preferred && versus_preferred) | |
494 | return 1; | |
495 | ||
496 | /* Then, break ties first by comparing the pack IDs. */ | |
497 | if (key->pack < versus_pack) | |
498 | return -1; | |
499 | else if (key->pack > versus_pack) | |
500 | return 1; | |
501 | ||
502 | /* Finally, break ties by comparing offsets within a pack. */ | |
503 | versus_offset = nth_midxed_offset(midx, versus); | |
504 | if (key->offset < versus_offset) | |
505 | return -1; | |
506 | else if (key->offset > versus_offset) | |
507 | return 1; | |
508 | ||
509 | return 0; | |
510 | } | |
511 | ||
512 | int midx_to_pack_pos(struct multi_pack_index *m, uint32_t at, uint32_t *pos) | |
513 | { | |
514 | struct midx_pack_key key; | |
515 | uint32_t *found; | |
516 | ||
517 | if (!m->revindex_data) | |
518 | BUG("midx_to_pack_pos: reverse index not yet loaded"); | |
519 | if (m->num_objects <= at) | |
520 | BUG("midx_to_pack_pos: out-of-bounds object at %"PRIu32, at); | |
521 | ||
522 | key.pack = nth_midxed_pack_int_id(m, at); | |
523 | key.offset = nth_midxed_offset(m, at); | |
524 | key.midx = m; | |
525 | /* | |
526 | * The preferred pack sorts first, so determine its identifier by | |
527 | * looking at the first object in pseudo-pack order. | |
528 | * | |
529 | * Note that if no --preferred-pack is explicitly given when writing a | |
530 | * multi-pack index, then whichever pack has the lowest identifier | |
531 | * implicitly is preferred (and includes all its objects, since ties are | |
532 | * broken first by pack identifier). | |
533 | */ | |
534 | key.preferred_pack = nth_midxed_pack_int_id(m, pack_pos_to_midx(m, 0)); | |
535 | ||
536 | found = bsearch(&key, m->revindex_data, m->num_objects, | |
537 | sizeof(*m->revindex_data), midx_pack_order_cmp); | |
538 | ||
539 | if (!found) | |
540 | return error("bad offset for revindex"); | |
541 | ||
542 | *pos = found - m->revindex_data; | |
543 | return 0; | |
544 | } |