reftable/reader.c

   1 /*
   2 Copyright 2020 Google LLC
   3
   4 Use of this source code is governed by a BSD-style
   5 license that can be found in the LICENSE file or at
   6 https://developers.google.com/open-source/licenses/bsd
   7 */
   8
   9 #include "reader.h"
  10
  11 #include "system.h"
  12 #include "block.h"
  13 #include "constants.h"
  14 #include "iter.h"
  15 #include "record.h"
  16 #include "reftable-error.h"
  17
  18 uint64_t block_source_size(struct reftable_block_source *source)
  19 {
  20         return source->ops->size(source->arg);
  21 }
  22
  23 int block_source_read_block(struct reftable_block_source *source,
  24                             struct reftable_block *dest, uint64_t off,
  25                             uint32_t size)
  26 {
  27         int result = source->ops->read_block(source->arg, dest, off, size);
  28         dest->source = *source;
  29         return result;
  30 }
  31
  32 void block_source_close(struct reftable_block_source *source)
  33 {
  34         if (!source->ops) {
  35                 return;
  36         }
  37
  38         source->ops->close(source->arg);
  39         source->ops = NULL;
  40 }
  41
  42 static struct reftable_reader_offsets *
  43 reader_offsets_for(struct reftable_reader *r, uint8_t typ)
  44 {
  45         switch (typ) {
  46         case BLOCK_TYPE_REF:
  47                 return &r->ref_offsets;
  48         case BLOCK_TYPE_LOG:
  49                 return &r->log_offsets;
  50         case BLOCK_TYPE_OBJ:
  51                 return &r->obj_offsets;
  52         }
  53         abort();
  54 }
  55
  56 static int reader_get_block(struct reftable_reader *r,
  57                             struct reftable_block *dest, uint64_t off,
  58                             uint32_t sz)
  59 {
  60         if (off >= r->size)
  61                 return 0;
  62
  63         if (off + sz > r->size) {
  64                 sz = r->size - off;
  65         }
  66
  67         return block_source_read_block(&r->source, dest, off, sz);
  68 }
  69
  70 uint32_t reftable_reader_hash_id(struct reftable_reader *r)
  71 {
  72         return r->hash_id;
  73 }
  74
  75 const char *reader_name(struct reftable_reader *r)
  76 {
  77         return r->name;
  78 }
  79
  80 static int parse_footer(struct reftable_reader *r, uint8_t *footer,
  81                         uint8_t *header)
  82 {
  83         uint8_t *f = footer;
  84         uint8_t first_block_typ;
  85         int err = 0;
  86         uint32_t computed_crc;
  87         uint32_t file_crc;
  88
  89         if (memcmp(f, "REFT", 4)) {
  90                 err = REFTABLE_FORMAT_ERROR;
  91                 goto done;
  92         }
  93         f += 4;
  94
  95         if (memcmp(footer, header, header_size(r->version))) {
  96                 err = REFTABLE_FORMAT_ERROR;
  97                 goto done;
  98         }
  99
 100         f++;
 101         r->block_size = get_be24(f);
 102
 103         f += 3;
 104         r->min_update_index = get_be64(f);
 105         f += 8;
 106         r->max_update_index = get_be64(f);
 107         f += 8;
 108
 109         if (r->version == 1) {
 110                 r->hash_id = GIT_SHA1_FORMAT_ID;
 111         } else {
 112                 r->hash_id = get_be32(f);
 113                 switch (r->hash_id) {
 114                 case GIT_SHA1_FORMAT_ID:
 115                         break;
 116                 case GIT_SHA256_FORMAT_ID:
 117                         break;
 118                 default:
 119                         err = REFTABLE_FORMAT_ERROR;
 120                         goto done;
 121                 }
 122                 f += 4;
 123         }
 124
 125         r->ref_offsets.index_offset = get_be64(f);
 126         f += 8;
 127
 128         r->obj_offsets.offset = get_be64(f);
 129         f += 8;
 130
 131         r->object_id_len = r->obj_offsets.offset & ((1 << 5) - 1);
 132         r->obj_offsets.offset >>= 5;
 133
 134         r->obj_offsets.index_offset = get_be64(f);
 135         f += 8;
 136         r->log_offsets.offset = get_be64(f);
 137         f += 8;
 138         r->log_offsets.index_offset = get_be64(f);
 139         f += 8;
 140
 141         computed_crc = crc32(0, footer, f - footer);
 142         file_crc = get_be32(f);
 143         f += 4;
 144         if (computed_crc != file_crc) {
 145                 err = REFTABLE_FORMAT_ERROR;
 146                 goto done;
 147         }
 148
 149         first_block_typ = header[header_size(r->version)];
 150         r->ref_offsets.is_present = (first_block_typ == BLOCK_TYPE_REF);
 151         r->ref_offsets.offset = 0;
 152         r->log_offsets.is_present = (first_block_typ == BLOCK_TYPE_LOG ||
 153                                      r->log_offsets.offset > 0);
 154         r->obj_offsets.is_present = r->obj_offsets.offset > 0;
 155         if (r->obj_offsets.is_present && !r->object_id_len) {
 156                 err = REFTABLE_FORMAT_ERROR;
 157                 goto done;
 158         }
 159
 160         err = 0;
 161 done:
 162         return err;
 163 }
 164
 165 struct table_iter {
 166         struct reftable_reader *r;
 167         uint8_t typ;
 168         uint64_t block_off;
 169         struct block_reader br;
 170         struct block_iter bi;
 171         int is_finished;
 172 };
 173
 174 static int table_iter_init(struct table_iter *ti, struct reftable_reader *r)
 175 {
 176         struct block_iter bi = BLOCK_ITER_INIT;
 177         memset(ti, 0, sizeof(*ti));
 178         reftable_reader_incref(r);
 179         ti->r = r;
 180         ti->bi = bi;
 181         return 0;
 182 }
 183
 184 static int table_iter_next_in_block(struct table_iter *ti,
 185                                     struct reftable_record *rec)
 186 {
 187         int res = block_iter_next(&ti->bi, rec);
 188         if (res == 0 && reftable_record_type(rec) == BLOCK_TYPE_REF) {
 189                 rec->u.ref.update_index += ti->r->min_update_index;
 190         }
 191
 192         return res;
 193 }
 194
 195 static void table_iter_block_done(struct table_iter *ti)
 196 {
 197         block_reader_release(&ti->br);
 198         block_iter_reset(&ti->bi);
 199 }
 200
 201 static int32_t extract_block_size(uint8_t *data, uint8_t *typ, uint64_t off,
 202                                   int version)
 203 {
 204         int32_t result = 0;
 205
 206         if (off == 0) {
 207                 data += header_size(version);
 208         }
 209
 210         *typ = data[0];
 211         if (reftable_is_block_type(*typ)) {
 212                 result = get_be24(data + 1);
 213         }
 214         return result;
 215 }
 216
 217 int reader_init_block_reader(struct reftable_reader *r, struct block_reader *br,
 218                              uint64_t next_off, uint8_t want_typ)
 219 {
 220         int32_t guess_block_size = r->block_size ? r->block_size :
 221                                                          DEFAULT_BLOCK_SIZE;
 222         struct reftable_block block = { NULL };
 223         uint8_t block_typ = 0;
 224         int err = 0;
 225         uint32_t header_off = next_off ? 0 : header_size(r->version);
 226         int32_t block_size = 0;
 227
 228         if (next_off >= r->size)
 229                 return 1;
 230
 231         err = reader_get_block(r, &block, next_off, guess_block_size);
 232         if (err < 0)
 233                 goto done;
 234
 235         block_size = extract_block_size(block.data, &block_typ, next_off,
 236                                         r->version);
 237         if (block_size < 0) {
 238                 err = block_size;
 239                 goto done;
 240         }
 241         if (want_typ != BLOCK_TYPE_ANY && block_typ != want_typ) {
 242                 err = 1;
 243                 goto done;
 244         }
 245
 246         if (block_size > guess_block_size) {
 247                 reftable_block_done(&block);
 248                 err = reader_get_block(r, &block, next_off, block_size);
 249                 if (err < 0) {
 250                         goto done;
 251                 }
 252         }
 253
 254         err = block_reader_init(br, &block, header_off, r->block_size,
 255                                 hash_size(r->hash_id));
 256 done:
 257         reftable_block_done(&block);
 258
 259         return err;
 260 }
 261
 262 static void table_iter_close(struct table_iter *ti)
 263 {
 264         table_iter_block_done(ti);
 265         block_iter_close(&ti->bi);
 266         reftable_reader_decref(ti->r);
 267 }
 268
 269 static int table_iter_next_block(struct table_iter *ti)
 270 {
 271         uint64_t next_block_off = ti->block_off + ti->br.full_block_size;
 272         int err;
 273
 274         err = reader_init_block_reader(ti->r, &ti->br, next_block_off, ti->typ);
 275         if (err > 0)
 276                 ti->is_finished = 1;
 277         if (err)
 278                 return err;
 279
 280         ti->block_off = next_block_off;
 281         ti->is_finished = 0;
 282         block_iter_seek_start(&ti->bi, &ti->br);
 283
 284         return 0;
 285 }
 286
 287 static int table_iter_next(struct table_iter *ti, struct reftable_record *rec)
 288 {
 289         if (reftable_record_type(rec) != ti->typ)
 290                 return REFTABLE_API_ERROR;
 291
 292         while (1) {
 293                 int err;
 294
 295                 if (ti->is_finished)
 296                         return 1;
 297
 298                 /*
 299                  * Check whether the current block still has more records. If
 300                  * so, return it. If the iterator returns positive then the
 301                  * current block has been exhausted.
 302                  */
 303                 err = table_iter_next_in_block(ti, rec);
 304                 if (err <= 0)
 305                         return err;
 306
 307                 /*
 308                  * Otherwise, we need to continue to the next block in the
 309                  * table and retry. If there are no more blocks then the
 310                  * iterator is drained.
 311                  */
 312                 err = table_iter_next_block(ti);
 313                 if (err) {
 314                         ti->is_finished = 1;
 315                         return err;
 316                 }
 317         }
 318 }
 319
 320 static int table_iter_seek_to(struct table_iter *ti, uint64_t off, uint8_t typ)
 321 {
 322         int err;
 323
 324         err = reader_init_block_reader(ti->r, &ti->br, off, typ);
 325         if (err != 0)
 326                 return err;
 327
 328         ti->typ = block_reader_type(&ti->br);
 329         ti->block_off = off;
 330         block_iter_seek_start(&ti->bi, &ti->br);
 331         return 0;
 332 }
 333
 334 static int table_iter_seek_start(struct table_iter *ti, uint8_t typ, int index)
 335 {
 336         struct reftable_reader_offsets *offs = reader_offsets_for(ti->r, typ);
 337         uint64_t off = offs->offset;
 338         if (index) {
 339                 off = offs->index_offset;
 340                 if (off == 0) {
 341                         return 1;
 342                 }
 343                 typ = BLOCK_TYPE_INDEX;
 344         }
 345
 346         return table_iter_seek_to(ti, off, typ);
 347 }
 348
 349 static int table_iter_seek_linear(struct table_iter *ti,
 350                                   struct reftable_record *want)
 351 {
 352         struct strbuf want_key = STRBUF_INIT;
 353         struct strbuf got_key = STRBUF_INIT;
 354         struct reftable_record rec;
 355         int err;
 356
 357         reftable_record_init(&rec, reftable_record_type(want));
 358         reftable_record_key(want, &want_key);
 359
 360         /*
 361          * First we need to locate the block that must contain our record. To
 362          * do so we scan through blocks linearly until we find the first block
 363          * whose first key is bigger than our wanted key. Once we have found
 364          * that block we know that the key must be contained in the preceding
 365          * block.
 366          *
 367          * This algorithm is somewhat unfortunate because it means that we
 368          * always have to seek one block too far and then back up. But as we
 369          * can only decode the _first_ key of a block but not its _last_ key we
 370          * have no other way to do this.
 371          */
 372         while (1) {
 373                 struct table_iter next = *ti;
 374
 375                 /*
 376                  * We must be careful to not modify underlying data of `ti`
 377                  * because we may find that `next` does not contain our desired
 378                  * block, but that `ti` does. In that case, we would discard
 379                  * `next` and continue with `ti`.
 380                  *
 381                  * This also means that we cannot reuse allocated memory for
 382                  * `next` here. While it would be great if we could, it should
 383                  * in practice not be too bad given that we should only ever
 384                  * end up doing linear seeks with at most three blocks. As soon
 385                  * as we have more than three blocks we would have an index, so
 386                  * we would not do a linear search there anymore.
 387                  */
 388                 memset(&next.br.block, 0, sizeof(next.br.block));
 389                 next.br.zstream = NULL;
 390                 next.br.uncompressed_data = NULL;
 391                 next.br.uncompressed_cap = 0;
 392
 393                 err = table_iter_next_block(&next);
 394                 if (err < 0)
 395                         goto done;
 396                 if (err > 0)
 397                         break;
 398
 399                 err = block_reader_first_key(&next.br, &got_key);
 400                 if (err < 0)
 401                         goto done;
 402
 403                 if (strbuf_cmp(&got_key, &want_key) > 0) {
 404                         table_iter_block_done(&next);
 405                         break;
 406                 }
 407
 408                 table_iter_block_done(ti);
 409                 *ti = next;
 410         }
 411
 412         /*
 413          * We have located the block that must contain our record, so we seek
 414          * the wanted key inside of it. If the block does not contain our key
 415          * we know that the corresponding record does not exist.
 416          */
 417         err = block_iter_seek_key(&ti->bi, &ti->br, &want_key);
 418         if (err < 0)
 419                 goto done;
 420         err = 0;
 421
 422 done:
 423         reftable_record_release(&rec);
 424         strbuf_release(&want_key);
 425         strbuf_release(&got_key);
 426         return err;
 427 }
 428
 429 static int table_iter_seek_indexed(struct table_iter *ti,
 430                                    struct reftable_record *rec)
 431 {
 432         struct reftable_record want_index = {
 433                 .type = BLOCK_TYPE_INDEX, .u.idx = { .last_key = STRBUF_INIT }
 434         };
 435         struct reftable_record index_result = {
 436                 .type = BLOCK_TYPE_INDEX,
 437                 .u.idx = { .last_key = STRBUF_INIT },
 438         };
 439         int err;
 440
 441         reftable_record_key(rec, &want_index.u.idx.last_key);
 442
 443         /*
 444          * The index may consist of multiple levels, where each level may have
 445          * multiple index blocks. We start by doing a linear search in the
 446          * highest layer that identifies the relevant index block as well as
 447          * the record inside that block that corresponds to our wanted key.
 448          */
 449         err = table_iter_seek_linear(ti, &want_index);
 450         if (err < 0)
 451                 goto done;
 452
 453         /*
 454          * Traverse down the levels until we find a non-index entry.
 455          */
 456         while (1) {
 457                 /*
 458                  * In case we seek a record that does not exist the index iter
 459                  * will tell us that the iterator is over. This works because
 460                  * the last index entry of the current level will contain the
 461                  * last key it knows about. So in case our seeked key is larger
 462                  * than the last indexed key we know that it won't exist.
 463                  *
 464                  * There is one subtlety in the layout of the index section
 465                  * that makes this work as expected: the highest-level index is
 466                  * at end of the section and will point backwards and thus we
 467                  * start reading from the end of the index section, not the
 468                  * beginning.
 469                  *
 470                  * If that wasn't the case and the order was reversed then the
 471                  * linear seek would seek into the lower levels and traverse
 472                  * all levels of the index only to find out that the key does
 473                  * not exist.
 474                  */
 475                 err = table_iter_next(ti, &index_result);
 476                 if (err != 0)
 477                         goto done;
 478
 479                 err = table_iter_seek_to(ti, index_result.u.idx.offset, 0);
 480                 if (err != 0)
 481                         goto done;
 482
 483                 err = block_iter_seek_key(&ti->bi, &ti->br, &want_index.u.idx.last_key);
 484                 if (err < 0)
 485                         goto done;
 486
 487                 if (ti->typ == reftable_record_type(rec)) {
 488                         err = 0;
 489                         break;
 490                 }
 491
 492                 if (ti->typ != BLOCK_TYPE_INDEX) {
 493                         err = REFTABLE_FORMAT_ERROR;
 494                         goto done;
 495                 }
 496         }
 497
 498 done:
 499         reftable_record_release(&want_index);
 500         reftable_record_release(&index_result);
 501         return err;
 502 }
 503
 504 static int table_iter_seek(struct table_iter *ti,
 505                            struct reftable_record *want)
 506 {
 507         uint8_t typ = reftable_record_type(want);
 508         struct reftable_reader_offsets *offs = reader_offsets_for(ti->r, typ);
 509         int err;
 510
 511         err = table_iter_seek_start(ti, reftable_record_type(want),
 512                                     !!offs->index_offset);
 513         if (err < 0)
 514                 goto out;
 515
 516         if (offs->index_offset)
 517                 err = table_iter_seek_indexed(ti, want);
 518         else
 519                 err = table_iter_seek_linear(ti, want);
 520         if (err)
 521                 goto out;
 522
 523 out:
 524         return err;
 525 }
 526
 527 static int table_iter_seek_void(void *ti, struct reftable_record *want)
 528 {
 529         return table_iter_seek(ti, want);
 530 }
 531
 532 static int table_iter_next_void(void *ti, struct reftable_record *rec)
 533 {
 534         return table_iter_next(ti, rec);
 535 }
 536
 537 static void table_iter_close_void(void *ti)
 538 {
 539         table_iter_close(ti);
 540 }
 541
 542 static struct reftable_iterator_vtable table_iter_vtable = {
 543         .seek = &table_iter_seek_void,
 544         .next = &table_iter_next_void,
 545         .close = &table_iter_close_void,
 546 };
 547
 548 static void iterator_from_table_iter(struct reftable_iterator *it,
 549                                      struct table_iter *ti)
 550 {
 551         assert(!it->ops);
 552         it->iter_arg = ti;
 553         it->ops = &table_iter_vtable;
 554 }
 555
 556 void reader_init_iter(struct reftable_reader *r,
 557                       struct reftable_iterator *it,
 558                       uint8_t typ)
 559 {
 560         struct reftable_reader_offsets *offs = reader_offsets_for(r, typ);
 561
 562         if (offs->is_present) {
 563                 struct table_iter *ti;
 564                 REFTABLE_ALLOC_ARRAY(ti, 1);
 565                 table_iter_init(ti, r);
 566                 iterator_from_table_iter(it, ti);
 567         } else {
 568                 iterator_set_empty(it);
 569         }
 570 }
 571
 572 void reftable_reader_init_ref_iterator(struct reftable_reader *r,
 573                                        struct reftable_iterator *it)
 574 {
 575         reader_init_iter(r, it, BLOCK_TYPE_REF);
 576 }
 577
 578 void reftable_reader_init_log_iterator(struct reftable_reader *r,
 579                                        struct reftable_iterator *it)
 580 {
 581         reader_init_iter(r, it, BLOCK_TYPE_LOG);
 582 }
 583
 584 int reftable_reader_new(struct reftable_reader **out,
 585                         struct reftable_block_source *source, char const *name)
 586 {
 587         struct reftable_block footer = { 0 };
 588         struct reftable_block header = { 0 };
 589         struct reftable_reader *r;
 590         uint64_t file_size = block_source_size(source);
 591         uint32_t read_size;
 592         int err;
 593
 594         REFTABLE_CALLOC_ARRAY(r, 1);
 595
 596         /*
 597          * We need one extra byte to read the type of first block. We also
 598          * pretend to always be reading v2 of the format because it is larger.
 599          */
 600         read_size = header_size(2) + 1;
 601         if (read_size > file_size) {
 602                 err = REFTABLE_FORMAT_ERROR;
 603                 goto done;
 604         }
 605
 606         err = block_source_read_block(source, &header, 0, read_size);
 607         if (err != read_size) {
 608                 err = REFTABLE_IO_ERROR;
 609                 goto done;
 610         }
 611
 612         if (memcmp(header.data, "REFT", 4)) {
 613                 err = REFTABLE_FORMAT_ERROR;
 614                 goto done;
 615         }
 616         r->version = header.data[4];
 617         if (r->version != 1 && r->version != 2) {
 618                 err = REFTABLE_FORMAT_ERROR;
 619                 goto done;
 620         }
 621
 622         r->size = file_size - footer_size(r->version);
 623         r->source = *source;
 624         r->name = xstrdup(name);
 625         r->hash_id = 0;
 626         r->refcount = 1;
 627
 628         err = block_source_read_block(source, &footer, r->size,
 629                                       footer_size(r->version));
 630         if (err != footer_size(r->version)) {
 631                 err = REFTABLE_IO_ERROR;
 632                 goto done;
 633         }
 634
 635         err = parse_footer(r, footer.data, header.data);
 636         if (err)
 637                 goto done;
 638
 639         *out = r;
 640
 641 done:
 642         reftable_block_done(&footer);
 643         reftable_block_done(&header);
 644         if (err) {
 645                 reftable_free(r);
 646                 block_source_close(source);
 647         }
 648         return err;
 649 }
 650
 651 void reftable_reader_incref(struct reftable_reader *r)
 652 {
 653         if (!r->refcount)
 654                 BUG("cannot increment ref counter of dead reader");
 655         r->refcount++;
 656 }
 657
 658 void reftable_reader_decref(struct reftable_reader *r)
 659 {
 660         if (!r)
 661                 return;
 662         if (!r->refcount)
 663                 BUG("cannot decrement ref counter of dead reader");
 664         if (--r->refcount)
 665                 return;
 666         block_source_close(&r->source);
 667         FREE_AND_NULL(r->name);
 668         reftable_free(r);
 669 }
 670
 671 static int reftable_reader_refs_for_indexed(struct reftable_reader *r,
 672                                             struct reftable_iterator *it,
 673                                             uint8_t *oid)
 674 {
 675         struct reftable_record want = {
 676                 .type = BLOCK_TYPE_OBJ,
 677                 .u.obj = {
 678                         .hash_prefix = oid,
 679                         .hash_prefix_len = r->object_id_len,
 680                 },
 681         };
 682         struct reftable_iterator oit = { NULL };
 683         struct reftable_record got = {
 684                 .type = BLOCK_TYPE_OBJ,
 685                 .u.obj = { 0 },
 686         };
 687         int err = 0;
 688         struct indexed_table_ref_iter *itr = NULL;
 689
 690         /* Look through the reverse index. */
 691         reader_init_iter(r, &oit, BLOCK_TYPE_OBJ);
 692         err = iterator_seek(&oit, &want);
 693         if (err != 0)
 694                 goto done;
 695
 696         /* read out the reftable_obj_record */
 697         err = iterator_next(&oit, &got);
 698         if (err < 0)
 699                 goto done;
 700
 701         if (err > 0 || memcmp(want.u.obj.hash_prefix, got.u.obj.hash_prefix,
 702                               r->object_id_len)) {
 703                 /* didn't find it; return empty iterator */
 704                 iterator_set_empty(it);
 705                 err = 0;
 706                 goto done;
 707         }
 708
 709         err = new_indexed_table_ref_iter(&itr, r, oid, hash_size(r->hash_id),
 710                                          got.u.obj.offsets,
 711                                          got.u.obj.offset_len);
 712         if (err < 0)
 713                 goto done;
 714         got.u.obj.offsets = NULL;
 715         iterator_from_indexed_table_ref_iter(it, itr);
 716
 717 done:
 718         reftable_iterator_destroy(&oit);
 719         reftable_record_release(&got);
 720         return err;
 721 }
 722
 723 static int reftable_reader_refs_for_unindexed(struct reftable_reader *r,
 724                                               struct reftable_iterator *it,
 725                                               uint8_t *oid)
 726 {
 727         struct table_iter *ti;
 728         struct filtering_ref_iterator *filter = NULL;
 729         struct filtering_ref_iterator empty = FILTERING_REF_ITERATOR_INIT;
 730         int oid_len = hash_size(r->hash_id);
 731         int err;
 732
 733         REFTABLE_ALLOC_ARRAY(ti, 1);
 734         table_iter_init(ti, r);
 735         err = table_iter_seek_start(ti, BLOCK_TYPE_REF, 0);
 736         if (err < 0) {
 737                 reftable_free(ti);
 738                 return err;
 739         }
 740
 741         filter = reftable_malloc(sizeof(struct filtering_ref_iterator));
 742         *filter = empty;
 743
 744         strbuf_add(&filter->oid, oid, oid_len);
 745         iterator_from_table_iter(&filter->it, ti);
 746
 747         iterator_from_filtering_ref_iterator(it, filter);
 748         return 0;
 749 }
 750
 751 int reftable_reader_refs_for(struct reftable_reader *r,
 752                              struct reftable_iterator *it, uint8_t *oid)
 753 {
 754         if (r->obj_offsets.is_present)
 755                 return reftable_reader_refs_for_indexed(r, it, oid);
 756         return reftable_reader_refs_for_unindexed(r, it, oid);
 757 }
 758
 759 uint64_t reftable_reader_max_update_index(struct reftable_reader *r)
 760 {
 761         return r->max_update_index;
 762 }
 763
 764 uint64_t reftable_reader_min_update_index(struct reftable_reader *r)
 765 {
 766         return r->min_update_index;
 767 }
 768
 769 int reftable_reader_print_blocks(const char *tablename)
 770 {
 771         struct {
 772                 const char *name;
 773                 int type;
 774         } sections[] = {
 775                 {
 776                         .name = "ref",
 777                         .type = BLOCK_TYPE_REF,
 778                 },
 779                 {
 780                         .name = "obj",
 781                         .type = BLOCK_TYPE_OBJ,
 782                 },
 783                 {
 784                         .name = "log",
 785                         .type = BLOCK_TYPE_LOG,
 786                 },
 787         };
 788         struct reftable_block_source src = { 0 };
 789         struct reftable_reader *r = NULL;
 790         struct table_iter ti = { 0 };
 791         size_t i;
 792         int err;
 793
 794         err = reftable_block_source_from_file(&src, tablename);
 795         if (err < 0)
 796                 goto done;
 797
 798         err = reftable_reader_new(&r, &src, tablename);
 799         if (err < 0)
 800                 goto done;
 801
 802         table_iter_init(&ti, r);
 803
 804         printf("header:\n");
 805         printf("  block_size: %d\n", r->block_size);
 806
 807         for (i = 0; i < ARRAY_SIZE(sections); i++) {
 808                 err = table_iter_seek_start(&ti, sections[i].type, 0);
 809                 if (err < 0)
 810                         goto done;
 811                 if (err > 0)
 812                         continue;
 813
 814                 printf("%s:\n", sections[i].name);
 815
 816                 while (1) {
 817                         printf("  - length: %u\n", ti.br.block_len);
 818                         printf("    restarts: %u\n", ti.br.restart_count);
 819
 820                         err = table_iter_next_block(&ti);
 821                         if (err < 0)
 822                                 goto done;
 823                         if (err > 0)
 824                                 break;
 825                 }
 826         }
 827
 828 done:
 829         reftable_reader_decref(r);
 830         table_iter_close(&ti);
 831         return err;
 832 }