git.oblomov.eu Git - git/blob - packfile.c

   1 #include "cache.h"
   2 #include "list.h"
   3 #include "pack.h"
   4 #include "repository.h"
   5 #include "dir.h"
   6 #include "mergesort.h"
   7 #include "packfile.h"
   8 #include "delta.h"
   9 #include "list.h"
  10 #include "streaming.h"
  11 #include "sha1-lookup.h"
  12 #include "commit.h"
  13 #include "object.h"
  14 #include "tag.h"
  15 #include "tree-walk.h"
  16 #include "tree.h"
  17 #include "object-store.h"
  18 #include "midx.h"
  19
  20 char *odb_pack_name(struct strbuf *buf,
  21                     const unsigned char *sha1,
  22                     const char *ext)
  23 {
  24         strbuf_reset(buf);
  25         strbuf_addf(buf, "%s/pack/pack-%s.%s", get_object_directory(),
  26                     sha1_to_hex(sha1), ext);
  27         return buf->buf;
  28 }
  29
  30 char *sha1_pack_name(const unsigned char *sha1)
  31 {
  32         static struct strbuf buf = STRBUF_INIT;
  33         return odb_pack_name(&buf, sha1, "pack");
  34 }
  35
  36 char *sha1_pack_index_name(const unsigned char *sha1)
  37 {
  38         static struct strbuf buf = STRBUF_INIT;
  39         return odb_pack_name(&buf, sha1, "idx");
  40 }
  41
  42 static unsigned int pack_used_ctr;
  43 static unsigned int pack_mmap_calls;
  44 static unsigned int peak_pack_open_windows;
  45 static unsigned int pack_open_windows;
  46 static unsigned int pack_open_fds;
  47 static unsigned int pack_max_fds;
  48 static size_t peak_pack_mapped;
  49 static size_t pack_mapped;
  50
  51 #define SZ_FMT PRIuMAX
  52 static inline uintmax_t sz_fmt(size_t s) { return s; }
  53
  54 void pack_report(void)
  55 {
  56         fprintf(stderr,
  57                 "pack_report: getpagesize()            = %10" SZ_FMT "\n"
  58                 "pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
  59                 "pack_report: core.packedGitLimit      = %10" SZ_FMT "\n",
  60                 sz_fmt(getpagesize()),
  61                 sz_fmt(packed_git_window_size),
  62                 sz_fmt(packed_git_limit));
  63         fprintf(stderr,
  64                 "pack_report: pack_used_ctr            = %10u\n"
  65                 "pack_report: pack_mmap_calls          = %10u\n"
  66                 "pack_report: pack_open_windows        = %10u / %10u\n"
  67                 "pack_report: pack_mapped              = "
  68                         "%10" SZ_FMT " / %10" SZ_FMT "\n",
  69                 pack_used_ctr,
  70                 pack_mmap_calls,
  71                 pack_open_windows, peak_pack_open_windows,
  72                 sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
  73 }
  74
  75 /*
  76  * Open and mmap the index file at path, perform a couple of
  77  * consistency checks, then record its information to p.  Return 0 on
  78  * success.
  79  */
  80 static int check_packed_git_idx(const char *path, struct packed_git *p)
  81 {
  82         void *idx_map;
  83         struct pack_idx_header *hdr;
  84         size_t idx_size;
  85         uint32_t version, nr, i, *index;
  86         int fd = git_open(path);
  87         struct stat st;
  88         const unsigned int hashsz = the_hash_algo->rawsz;
  89
  90         if (fd < 0)
  91                 return -1;
  92         if (fstat(fd, &st)) {
  93                 close(fd);
  94                 return -1;
  95         }
  96         idx_size = xsize_t(st.st_size);
  97         if (idx_size < 4 * 256 + hashsz + hashsz) {
  98                 close(fd);
  99                 return error("index file %s is too small", path);
 100         }
 101         idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
 102         close(fd);
 103
 104         hdr = idx_map;
 105         if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
 106                 version = ntohl(hdr->idx_version);
 107                 if (version < 2 || version > 2) {
 108                         munmap(idx_map, idx_size);
 109                         return error("index file %s is version %"PRIu32
 110                                      " and is not supported by this binary"
 111                                      " (try upgrading GIT to a newer version)",
 112                                      path, version);
 113                 }
 114         } else
 115                 version = 1;
 116
 117         nr = 0;
 118         index = idx_map;
 119         if (version > 1)
 120                 index += 2;  /* skip index header */
 121         for (i = 0; i < 256; i++) {
 122                 uint32_t n = ntohl(index[i]);
 123                 if (n < nr) {
 124                         munmap(idx_map, idx_size);
 125                         return error("non-monotonic index %s", path);
 126                 }
 127                 nr = n;
 128         }
 129
 130         if (version == 1) {
 131                 /*
 132                  * Total size:
 133                  *  - 256 index entries 4 bytes each
 134                  *  - 24-byte entries * nr (object ID + 4-byte offset)
 135                  *  - hash of the packfile
 136                  *  - file checksum
 137                  */
 138                 if (idx_size != 4*256 + nr * (hashsz + 4) + hashsz + hashsz) {
 139                         munmap(idx_map, idx_size);
 140                         return error("wrong index v1 file size in %s", path);
 141                 }
 142         } else if (version == 2) {
 143                 /*
 144                  * Minimum size:
 145                  *  - 8 bytes of header
 146                  *  - 256 index entries 4 bytes each
 147                  *  - object ID entry * nr
 148                  *  - 4-byte crc entry * nr
 149                  *  - 4-byte offset entry * nr
 150                  *  - hash of the packfile
 151                  *  - file checksum
 152                  * And after the 4-byte offset table might be a
 153                  * variable sized table containing 8-byte entries
 154                  * for offsets larger than 2^31.
 155                  */
 156                 unsigned long min_size = 8 + 4*256 + nr*(hashsz + 4 + 4) + hashsz + hashsz;
 157                 unsigned long max_size = min_size;
 158                 if (nr)
 159                         max_size += (nr - 1)*8;
 160                 if (idx_size < min_size || idx_size > max_size) {
 161                         munmap(idx_map, idx_size);
 162                         return error("wrong index v2 file size in %s", path);
 163                 }
 164                 if (idx_size != min_size &&
 165                     /*
 166                      * make sure we can deal with large pack offsets.
 167                      * 31-bit signed offset won't be enough, neither
 168                      * 32-bit unsigned one will be.
 169                      */
 170                     (sizeof(off_t) <= 4)) {
 171                         munmap(idx_map, idx_size);
 172                         return error("pack too large for current definition of off_t in %s", path);
 173                 }
 174         }
 175
 176         p->index_version = version;
 177         p->index_data = idx_map;
 178         p->index_size = idx_size;
 179         p->num_objects = nr;
 180         return 0;
 181 }
 182
 183 int open_pack_index(struct packed_git *p)
 184 {
 185         char *idx_name;
 186         size_t len;
 187         int ret;
 188
 189         if (p->index_data)
 190                 return 0;
 191
 192         if (!strip_suffix(p->pack_name, ".pack", &len))
 193                 BUG("pack_name does not end in .pack");
 194         idx_name = xstrfmt("%.*s.idx", (int)len, p->pack_name);
 195         ret = check_packed_git_idx(idx_name, p);
 196         free(idx_name);
 197         return ret;
 198 }
 199
 200 uint32_t get_pack_fanout(struct packed_git *p, uint32_t value)
 201 {
 202         const uint32_t *level1_ofs = p->index_data;
 203
 204         if (!level1_ofs) {
 205                 if (open_pack_index(p))
 206                         return 0;
 207                 level1_ofs = p->index_data;
 208         }
 209
 210         if (p->index_version > 1) {
 211                 level1_ofs += 2;
 212         }
 213
 214         return ntohl(level1_ofs[value]);
 215 }
 216
 217 static struct packed_git *alloc_packed_git(int extra)
 218 {
 219         struct packed_git *p = xmalloc(st_add(sizeof(*p), extra));
 220         memset(p, 0, sizeof(*p));
 221         p->pack_fd = -1;
 222         return p;
 223 }
 224
 225 struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
 226 {
 227         const char *path = sha1_pack_name(sha1);
 228         size_t alloc = st_add(strlen(path), 1);
 229         struct packed_git *p = alloc_packed_git(alloc);
 230
 231         memcpy(p->pack_name, path, alloc); /* includes NUL */
 232         hashcpy(p->sha1, sha1);
 233         if (check_packed_git_idx(idx_path, p)) {
 234                 free(p);
 235                 return NULL;
 236         }
 237
 238         return p;
 239 }
 240
 241 static void scan_windows(struct packed_git *p,
 242         struct packed_git **lru_p,
 243         struct pack_window **lru_w,
 244         struct pack_window **lru_l)
 245 {
 246         struct pack_window *w, *w_l;
 247
 248         for (w_l = NULL, w = p->windows; w; w = w->next) {
 249                 if (!w->inuse_cnt) {
 250                         if (!*lru_w || w->last_used < (*lru_w)->last_used) {
 251                                 *lru_p = p;
 252                                 *lru_w = w;
 253                                 *lru_l = w_l;
 254                         }
 255                 }
 256                 w_l = w;
 257         }
 258 }
 259
 260 static int unuse_one_window(struct packed_git *current)
 261 {
 262         struct packed_git *p, *lru_p = NULL;
 263         struct pack_window *lru_w = NULL, *lru_l = NULL;
 264
 265         if (current)
 266                 scan_windows(current, &lru_p, &lru_w, &lru_l);
 267         for (p = the_repository->objects->packed_git; p; p = p->next)
 268                 scan_windows(p, &lru_p, &lru_w, &lru_l);
 269         if (lru_p) {
 270                 munmap(lru_w->base, lru_w->len);
 271                 pack_mapped -= lru_w->len;
 272                 if (lru_l)
 273                         lru_l->next = lru_w->next;
 274                 else
 275                         lru_p->windows = lru_w->next;
 276                 free(lru_w);
 277                 pack_open_windows--;
 278                 return 1;
 279         }
 280         return 0;
 281 }
 282
 283 void release_pack_memory(size_t need)
 284 {
 285         size_t cur = pack_mapped;
 286         while (need >= (cur - pack_mapped) && unuse_one_window(NULL))
 287                 ; /* nothing */
 288 }
 289
 290 void close_pack_windows(struct packed_git *p)
 291 {
 292         while (p->windows) {
 293                 struct pack_window *w = p->windows;
 294
 295                 if (w->inuse_cnt)
 296                         die("pack '%s' still has open windows to it",
 297                             p->pack_name);
 298                 munmap(w->base, w->len);
 299                 pack_mapped -= w->len;
 300                 pack_open_windows--;
 301                 p->windows = w->next;
 302                 free(w);
 303         }
 304 }
 305
 306 static int close_pack_fd(struct packed_git *p)
 307 {
 308         if (p->pack_fd < 0)
 309                 return 0;
 310
 311         close(p->pack_fd);
 312         pack_open_fds--;
 313         p->pack_fd = -1;
 314
 315         return 1;
 316 }
 317
 318 void close_pack_index(struct packed_git *p)
 319 {
 320         if (p->index_data) {
 321                 munmap((void *)p->index_data, p->index_size);
 322                 p->index_data = NULL;
 323         }
 324 }
 325
 326 void close_pack(struct packed_git *p)
 327 {
 328         close_pack_windows(p);
 329         close_pack_fd(p);
 330         close_pack_index(p);
 331 }
 332
 333 void close_all_packs(struct raw_object_store *o)
 334 {
 335         struct packed_git *p;
 336
 337         for (p = o->packed_git; p; p = p->next)
 338                 if (p->do_not_close)
 339                         BUG("want to close pack marked 'do-not-close'");
 340                 else
 341                         close_pack(p);
 342 }
 343
 344 /*
 345  * The LRU pack is the one with the oldest MRU window, preferring packs
 346  * with no used windows, or the oldest mtime if it has no windows allocated.
 347  */
 348 static void find_lru_pack(struct packed_git *p, struct packed_git **lru_p, struct pack_window **mru_w, int *accept_windows_inuse)
 349 {
 350         struct pack_window *w, *this_mru_w;
 351         int has_windows_inuse = 0;
 352
 353         /*
 354          * Reject this pack if it has windows and the previously selected
 355          * one does not.  If this pack does not have windows, reject
 356          * it if the pack file is newer than the previously selected one.
 357          */
 358         if (*lru_p && !*mru_w && (p->windows || p->mtime > (*lru_p)->mtime))
 359                 return;
 360
 361         for (w = this_mru_w = p->windows; w; w = w->next) {
 362                 /*
 363                  * Reject this pack if any of its windows are in use,
 364                  * but the previously selected pack did not have any
 365                  * inuse windows.  Otherwise, record that this pack
 366                  * has windows in use.
 367                  */
 368                 if (w->inuse_cnt) {
 369                         if (*accept_windows_inuse)
 370                                 has_windows_inuse = 1;
 371                         else
 372                                 return;
 373                 }
 374
 375                 if (w->last_used > this_mru_w->last_used)
 376                         this_mru_w = w;
 377
 378                 /*
 379                  * Reject this pack if it has windows that have been
 380                  * used more recently than the previously selected pack.
 381                  * If the previously selected pack had windows inuse and
 382                  * we have not encountered a window in this pack that is
 383                  * inuse, skip this check since we prefer a pack with no
 384                  * inuse windows to one that has inuse windows.
 385                  */
 386                 if (*mru_w && *accept_windows_inuse == has_windows_inuse &&
 387                     this_mru_w->last_used > (*mru_w)->last_used)
 388                         return;
 389         }
 390
 391         /*
 392          * Select this pack.
 393          */
 394         *mru_w = this_mru_w;
 395         *lru_p = p;
 396         *accept_windows_inuse = has_windows_inuse;
 397 }
 398
 399 static int close_one_pack(void)
 400 {
 401         struct packed_git *p, *lru_p = NULL;
 402         struct pack_window *mru_w = NULL;
 403         int accept_windows_inuse = 1;
 404
 405         for (p = the_repository->objects->packed_git; p; p = p->next) {
 406                 if (p->pack_fd == -1)
 407                         continue;
 408                 find_lru_pack(p, &lru_p, &mru_w, &accept_windows_inuse);
 409         }
 410
 411         if (lru_p)
 412                 return close_pack_fd(lru_p);
 413
 414         return 0;
 415 }
 416
 417 static unsigned int get_max_fd_limit(void)
 418 {
 419 #ifdef RLIMIT_NOFILE
 420         {
 421                 struct rlimit lim;
 422
 423                 if (!getrlimit(RLIMIT_NOFILE, &lim))
 424                         return lim.rlim_cur;
 425         }
 426 #endif
 427
 428 #ifdef _SC_OPEN_MAX
 429         {
 430                 long open_max = sysconf(_SC_OPEN_MAX);
 431                 if (0 < open_max)
 432                         return open_max;
 433                 /*
 434                  * Otherwise, we got -1 for one of the two
 435                  * reasons:
 436                  *
 437                  * (1) sysconf() did not understand _SC_OPEN_MAX
 438                  *     and signaled an error with -1; or
 439                  * (2) sysconf() said there is no limit.
 440                  *
 441                  * We _could_ clear errno before calling sysconf() to
 442                  * tell these two cases apart and return a huge number
 443                  * in the latter case to let the caller cap it to a
 444                  * value that is not so selfish, but letting the
 445                  * fallback OPEN_MAX codepath take care of these cases
 446                  * is a lot simpler.
 447                  */
 448         }
 449 #endif
 450
 451 #ifdef OPEN_MAX
 452         return OPEN_MAX;
 453 #else
 454         return 1; /* see the caller ;-) */
 455 #endif
 456 }
 457
 458 /*
 459  * Do not call this directly as this leaks p->pack_fd on error return;
 460  * call open_packed_git() instead.
 461  */
 462 static int open_packed_git_1(struct packed_git *p)
 463 {
 464         struct stat st;
 465         struct pack_header hdr;
 466         unsigned char hash[GIT_MAX_RAWSZ];
 467         unsigned char *idx_hash;
 468         long fd_flag;
 469         ssize_t read_result;
 470         const unsigned hashsz = the_hash_algo->rawsz;
 471
 472         if (!p->index_data) {
 473                 struct multi_pack_index *m;
 474                 const char *pack_name = strrchr(p->pack_name, '/');
 475
 476                 for (m = the_repository->objects->multi_pack_index;
 477                      m; m = m->next) {
 478                         if (midx_contains_pack(m, pack_name))
 479                                 break;
 480                 }
 481
 482                 if (!m && open_pack_index(p))
 483                         return error("packfile %s index unavailable", p->pack_name);
 484         }
 485
 486         if (!pack_max_fds) {
 487                 unsigned int max_fds = get_max_fd_limit();
 488
 489                 /* Save 3 for stdin/stdout/stderr, 22 for work */
 490                 if (25 < max_fds)
 491                         pack_max_fds = max_fds - 25;
 492                 else
 493                         pack_max_fds = 1;
 494         }
 495
 496         while (pack_max_fds <= pack_open_fds && close_one_pack())
 497                 ; /* nothing */
 498
 499         p->pack_fd = git_open(p->pack_name);
 500         if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
 501                 return -1;
 502         pack_open_fds++;
 503
 504         /* If we created the struct before we had the pack we lack size. */
 505         if (!p->pack_size) {
 506                 if (!S_ISREG(st.st_mode))
 507                         return error("packfile %s not a regular file", p->pack_name);
 508                 p->pack_size = st.st_size;
 509         } else if (p->pack_size != st.st_size)
 510                 return error("packfile %s size changed", p->pack_name);
 511
 512         /* We leave these file descriptors open with sliding mmap;
 513          * there is no point keeping them open across exec(), though.
 514          */
 515         fd_flag = fcntl(p->pack_fd, F_GETFD, 0);
 516         if (fd_flag < 0)
 517                 return error("cannot determine file descriptor flags");
 518         fd_flag |= FD_CLOEXEC;
 519         if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
 520                 return error("cannot set FD_CLOEXEC");
 521
 522         /* Verify we recognize this pack file format. */
 523         read_result = read_in_full(p->pack_fd, &hdr, sizeof(hdr));
 524         if (read_result < 0)
 525                 return error_errno("error reading from %s", p->pack_name);
 526         if (read_result != sizeof(hdr))
 527                 return error("file %s is far too short to be a packfile", p->pack_name);
 528         if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
 529                 return error("file %s is not a GIT packfile", p->pack_name);
 530         if (!pack_version_ok(hdr.hdr_version))
 531                 return error("packfile %s is version %"PRIu32" and not"
 532                         " supported (try upgrading GIT to a newer version)",
 533                         p->pack_name, ntohl(hdr.hdr_version));
 534
 535         /* Skip index checking if in multi-pack-index */
 536         if (!p->index_data)
 537                 return 0;
 538
 539         /* Verify the pack matches its index. */
 540         if (p->num_objects != ntohl(hdr.hdr_entries))
 541                 return error("packfile %s claims to have %"PRIu32" objects"
 542                              " while index indicates %"PRIu32" objects",
 543                              p->pack_name, ntohl(hdr.hdr_entries),
 544                              p->num_objects);
 545         if (lseek(p->pack_fd, p->pack_size - hashsz, SEEK_SET) == -1)
 546                 return error("end of packfile %s is unavailable", p->pack_name);
 547         read_result = read_in_full(p->pack_fd, hash, hashsz);
 548         if (read_result < 0)
 549                 return error_errno("error reading from %s", p->pack_name);
 550         if (read_result != hashsz)
 551                 return error("packfile %s signature is unavailable", p->pack_name);
 552         idx_hash = ((unsigned char *)p->index_data) + p->index_size - hashsz * 2;
 553         if (!hasheq(hash, idx_hash))
 554                 return error("packfile %s does not match index", p->pack_name);
 555         return 0;
 556 }
 557
 558 static int open_packed_git(struct packed_git *p)
 559 {
 560         if (!open_packed_git_1(p))
 561                 return 0;
 562         close_pack_fd(p);
 563         return -1;
 564 }
 565
 566 static int in_window(struct pack_window *win, off_t offset)
 567 {
 568         /* We must promise at least one full hash after the
 569          * offset is available from this window, otherwise the offset
 570          * is not actually in this window and a different window (which
 571          * has that one hash excess) must be used.  This is to support
 572          * the object header and delta base parsing routines below.
 573          */
 574         off_t win_off = win->offset;
 575         return win_off <= offset
 576                 && (offset + the_hash_algo->rawsz) <= (win_off + win->len);
 577 }
 578
 579 unsigned char *use_pack(struct packed_git *p,
 580                 struct pack_window **w_cursor,
 581                 off_t offset,
 582                 unsigned long *left)
 583 {
 584         struct pack_window *win = *w_cursor;
 585
 586         /* Since packfiles end in a hash of their content and it's
 587          * pointless to ask for an offset into the middle of that
 588          * hash, and the in_window function above wouldn't match
 589          * don't allow an offset too close to the end of the file.
 590          */
 591         if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p))
 592                 die("packfile %s cannot be accessed", p->pack_name);
 593         if (offset > (p->pack_size - the_hash_algo->rawsz))
 594                 die("offset beyond end of packfile (truncated pack?)");
 595         if (offset < 0)
 596                 die(_("offset before end of packfile (broken .idx?)"));
 597
 598         if (!win || !in_window(win, offset)) {
 599                 if (win)
 600                         win->inuse_cnt--;
 601                 for (win = p->windows; win; win = win->next) {
 602                         if (in_window(win, offset))
 603                                 break;
 604                 }
 605                 if (!win) {
 606                         size_t window_align = packed_git_window_size / 2;
 607                         off_t len;
 608
 609                         if (p->pack_fd == -1 && open_packed_git(p))
 610                                 die("packfile %s cannot be accessed", p->pack_name);
 611
 612                         win = xcalloc(1, sizeof(*win));
 613                         win->offset = (offset / window_align) * window_align;
 614                         len = p->pack_size - win->offset;
 615                         if (len > packed_git_window_size)
 616                                 len = packed_git_window_size;
 617                         win->len = (size_t)len;
 618                         pack_mapped += win->len;
 619                         while (packed_git_limit < pack_mapped
 620                                 && unuse_one_window(p))
 621                                 ; /* nothing */
 622                         win->base = xmmap(NULL, win->len,
 623                                 PROT_READ, MAP_PRIVATE,
 624                                 p->pack_fd, win->offset);
 625                         if (win->base == MAP_FAILED)
 626                                 die_errno("packfile %s cannot be mapped",
 627                                           p->pack_name);
 628                         if (!win->offset && win->len == p->pack_size
 629                                 && !p->do_not_close)
 630                                 close_pack_fd(p);
 631                         pack_mmap_calls++;
 632                         pack_open_windows++;
 633                         if (pack_mapped > peak_pack_mapped)
 634                                 peak_pack_mapped = pack_mapped;
 635                         if (pack_open_windows > peak_pack_open_windows)
 636                                 peak_pack_open_windows = pack_open_windows;
 637                         win->next = p->windows;
 638                         p->windows = win;
 639                 }
 640         }
 641         if (win != *w_cursor) {
 642                 win->last_used = pack_used_ctr++;
 643                 win->inuse_cnt++;
 644                 *w_cursor = win;
 645         }
 646         offset -= win->offset;
 647         if (left)
 648                 *left = win->len - xsize_t(offset);
 649         return win->base + offset;
 650 }
 651
 652 void unuse_pack(struct pack_window **w_cursor)
 653 {
 654         struct pack_window *w = *w_cursor;
 655         if (w) {
 656                 w->inuse_cnt--;
 657                 *w_cursor = NULL;
 658         }
 659 }
 660
 661 static void try_to_free_pack_memory(size_t size)
 662 {
 663         release_pack_memory(size);
 664 }
 665
 666 struct packed_git *add_packed_git(const char *path, size_t path_len, int local)
 667 {
 668         static int have_set_try_to_free_routine;
 669         struct stat st;
 670         size_t alloc;
 671         struct packed_git *p;
 672
 673         if (!have_set_try_to_free_routine) {
 674                 have_set_try_to_free_routine = 1;
 675                 set_try_to_free_routine(try_to_free_pack_memory);
 676         }
 677
 678         /*
 679          * Make sure a corresponding .pack file exists and that
 680          * the index looks sane.
 681          */
 682         if (!strip_suffix_mem(path, &path_len, ".idx"))
 683                 return NULL;
 684
 685         /*
 686          * ".promisor" is long enough to hold any suffix we're adding (and
 687          * the use xsnprintf double-checks that)
 688          */
 689         alloc = st_add3(path_len, strlen(".promisor"), 1);
 690         p = alloc_packed_git(alloc);
 691         memcpy(p->pack_name, path, path_len);
 692
 693         xsnprintf(p->pack_name + path_len, alloc - path_len, ".keep");
 694         if (!access(p->pack_name, F_OK))
 695                 p->pack_keep = 1;
 696
 697         xsnprintf(p->pack_name + path_len, alloc - path_len, ".promisor");
 698         if (!access(p->pack_name, F_OK))
 699                 p->pack_promisor = 1;
 700
 701         xsnprintf(p->pack_name + path_len, alloc - path_len, ".pack");
 702         if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
 703                 free(p);
 704                 return NULL;
 705         }
 706
 707         /* ok, it looks sane as far as we can check without
 708          * actually mapping the pack file.
 709          */
 710         p->pack_size = st.st_size;
 711         p->pack_local = local;
 712         p->mtime = st.st_mtime;
 713         if (path_len < the_hash_algo->hexsz ||
 714             get_sha1_hex(path + path_len - the_hash_algo->hexsz, p->sha1))
 715                 hashclr(p->sha1);
 716         return p;
 717 }
 718
 719 void install_packed_git(struct repository *r, struct packed_git *pack)
 720 {
 721         if (pack->pack_fd != -1)
 722                 pack_open_fds++;
 723
 724         pack->next = r->objects->packed_git;
 725         r->objects->packed_git = pack;
 726 }
 727
 728 void (*report_garbage)(unsigned seen_bits, const char *path);
 729
 730 static void report_helper(const struct string_list *list,
 731                           int seen_bits, int first, int last)
 732 {
 733         if (seen_bits == (PACKDIR_FILE_PACK|PACKDIR_FILE_IDX))
 734                 return;
 735
 736         for (; first < last; first++)
 737                 report_garbage(seen_bits, list->items[first].string);
 738 }
 739
 740 static void report_pack_garbage(struct string_list *list)
 741 {
 742         int i, baselen = -1, first = 0, seen_bits = 0;
 743
 744         if (!report_garbage)
 745                 return;
 746
 747         string_list_sort(list);
 748
 749         for (i = 0; i < list->nr; i++) {
 750                 const char *path = list->items[i].string;
 751                 if (baselen != -1 &&
 752                     strncmp(path, list->items[first].string, baselen)) {
 753                         report_helper(list, seen_bits, first, i);
 754                         baselen = -1;
 755                         seen_bits = 0;
 756                 }
 757                 if (baselen == -1) {
 758                         const char *dot = strrchr(path, '.');
 759                         if (!dot) {
 760                                 report_garbage(PACKDIR_FILE_GARBAGE, path);
 761                                 continue;
 762                         }
 763                         baselen = dot - path + 1;
 764                         first = i;
 765                 }
 766                 if (!strcmp(path + baselen, "pack"))
 767                         seen_bits |= 1;
 768                 else if (!strcmp(path + baselen, "idx"))
 769                         seen_bits |= 2;
 770         }
 771         report_helper(list, seen_bits, first, list->nr);
 772 }
 773
 774 void for_each_file_in_pack_dir(const char *objdir,
 775                                each_file_in_pack_dir_fn fn,
 776                                void *data)
 777 {
 778         struct strbuf path = STRBUF_INIT;
 779         size_t dirnamelen;
 780         DIR *dir;
 781         struct dirent *de;
 782
 783         strbuf_addstr(&path, objdir);
 784         strbuf_addstr(&path, "/pack");
 785         dir = opendir(path.buf);
 786         if (!dir) {
 787                 if (errno != ENOENT)
 788                         error_errno("unable to open object pack directory: %s",
 789                                     path.buf);
 790                 strbuf_release(&path);
 791                 return;
 792         }
 793         strbuf_addch(&path, '/');
 794         dirnamelen = path.len;
 795         while ((de = readdir(dir)) != NULL) {
 796                 if (is_dot_or_dotdot(de->d_name))
 797                         continue;
 798
 799                 strbuf_setlen(&path, dirnamelen);
 800                 strbuf_addstr(&path, de->d_name);
 801
 802                 fn(path.buf, path.len, de->d_name, data);
 803         }
 804
 805         closedir(dir);
 806         strbuf_release(&path);
 807 }
 808
 809 struct prepare_pack_data {
 810         struct repository *r;
 811         struct string_list *garbage;
 812         int local;
 813         struct multi_pack_index *m;
 814 };
 815
 816 static void prepare_pack(const char *full_name, size_t full_name_len,
 817                          const char *file_name, void *_data)
 818 {
 819         struct prepare_pack_data *data = (struct prepare_pack_data *)_data;
 820         struct packed_git *p;
 821         size_t base_len = full_name_len;
 822
 823         if (strip_suffix_mem(full_name, &base_len, ".idx") &&
 824             !(data->m && midx_contains_pack(data->m, file_name))) {
 825                 /* Don't reopen a pack we already have. */
 826                 for (p = data->r->objects->packed_git; p; p = p->next) {
 827                         size_t len;
 828                         if (strip_suffix(p->pack_name, ".pack", &len) &&
 829                             len == base_len &&
 830                             !memcmp(p->pack_name, full_name, len))
 831                                 break;
 832                 }
 833
 834                 if (!p) {
 835                         p = add_packed_git(full_name, full_name_len, data->local);
 836                         if (p)
 837                                 install_packed_git(data->r, p);
 838                 }
 839         }
 840
 841         if (!report_garbage)
 842                 return;
 843
 844         if (!strcmp(file_name, "multi-pack-index"))
 845                 return;
 846         if (ends_with(file_name, ".idx") ||
 847             ends_with(file_name, ".pack") ||
 848             ends_with(file_name, ".bitmap") ||
 849             ends_with(file_name, ".keep") ||
 850             ends_with(file_name, ".promisor"))
 851                 string_list_append(data->garbage, full_name);
 852         else
 853                 report_garbage(PACKDIR_FILE_GARBAGE, full_name);
 854 }
 855
 856 static void prepare_packed_git_one(struct repository *r, char *objdir, int local)
 857 {
 858         struct prepare_pack_data data;
 859         struct string_list garbage = STRING_LIST_INIT_DUP;
 860
 861         data.m = r->objects->multi_pack_index;
 862
 863         /* look for the multi-pack-index for this object directory */
 864         while (data.m && strcmp(data.m->object_dir, objdir))
 865                 data.m = data.m->next;
 866
 867         data.r = r;
 868         data.garbage = &garbage;
 869         data.local = local;
 870
 871         for_each_file_in_pack_dir(objdir, prepare_pack, &data);
 872
 873         report_pack_garbage(data.garbage);
 874         string_list_clear(data.garbage, 0);
 875 }
 876
 877 static void prepare_packed_git(struct repository *r);
 878 /*
 879  * Give a fast, rough count of the number of objects in the repository. This
 880  * ignores loose objects completely. If you have a lot of them, then either
 881  * you should repack because your performance will be awful, or they are
 882  * all unreachable objects about to be pruned, in which case they're not really
 883  * interesting as a measure of repo size in the first place.
 884  */
 885 unsigned long approximate_object_count(void)
 886 {
 887         if (!the_repository->objects->approximate_object_count_valid) {
 888                 unsigned long count;
 889                 struct multi_pack_index *m;
 890                 struct packed_git *p;
 891
 892                 prepare_packed_git(the_repository);
 893                 count = 0;
 894                 for (m = get_multi_pack_index(the_repository); m; m = m->next)
 895                         count += m->num_objects;
 896                 for (p = the_repository->objects->packed_git; p; p = p->next) {
 897                         if (open_pack_index(p))
 898                                 continue;
 899                         count += p->num_objects;
 900                 }
 901                 the_repository->objects->approximate_object_count = count;
 902         }
 903         return the_repository->objects->approximate_object_count;
 904 }
 905
 906 static void *get_next_packed_git(const void *p)
 907 {
 908         return ((const struct packed_git *)p)->next;
 909 }
 910
 911 static void set_next_packed_git(void *p, void *next)
 912 {
 913         ((struct packed_git *)p)->next = next;
 914 }
 915
 916 static int sort_pack(const void *a_, const void *b_)
 917 {
 918         const struct packed_git *a = a_;
 919         const struct packed_git *b = b_;
 920         int st;
 921
 922         /*
 923          * Local packs tend to contain objects specific to our
 924          * variant of the project than remote ones.  In addition,
 925          * remote ones could be on a network mounted filesystem.
 926          * Favor local ones for these reasons.
 927          */
 928         st = a->pack_local - b->pack_local;
 929         if (st)
 930                 return -st;
 931
 932         /*
 933          * Younger packs tend to contain more recent objects,
 934          * and more recent objects tend to get accessed more
 935          * often.
 936          */
 937         if (a->mtime < b->mtime)
 938                 return 1;
 939         else if (a->mtime == b->mtime)
 940                 return 0;
 941         return -1;
 942 }
 943
 944 static void rearrange_packed_git(struct repository *r)
 945 {
 946         r->objects->packed_git = llist_mergesort(
 947                 r->objects->packed_git, get_next_packed_git,
 948                 set_next_packed_git, sort_pack);
 949 }
 950
 951 static void prepare_packed_git_mru(struct repository *r)
 952 {
 953         struct packed_git *p;
 954
 955         INIT_LIST_HEAD(&r->objects->packed_git_mru);
 956
 957         for (p = r->objects->packed_git; p; p = p->next)
 958                 list_add_tail(&p->mru, &r->objects->packed_git_mru);
 959 }
 960
 961 static void prepare_packed_git(struct repository *r)
 962 {
 963         struct alternate_object_database *alt;
 964
 965         if (r->objects->packed_git_initialized)
 966                 return;
 967         prepare_multi_pack_index_one(r, r->objects->objectdir, 1);
 968         prepare_packed_git_one(r, r->objects->objectdir, 1);
 969         prepare_alt_odb(r);
 970         for (alt = r->objects->alt_odb_list; alt; alt = alt->next) {
 971                 prepare_multi_pack_index_one(r, alt->path, 0);
 972                 prepare_packed_git_one(r, alt->path, 0);
 973         }
 974         rearrange_packed_git(r);
 975
 976         r->objects->all_packs = NULL;
 977
 978         prepare_packed_git_mru(r);
 979         r->objects->packed_git_initialized = 1;
 980 }
 981
 982 void reprepare_packed_git(struct repository *r)
 983 {
 984         r->objects->approximate_object_count_valid = 0;
 985         r->objects->packed_git_initialized = 0;
 986         prepare_packed_git(r);
 987 }
 988
 989 struct packed_git *get_packed_git(struct repository *r)
 990 {
 991         prepare_packed_git(r);
 992         return r->objects->packed_git;
 993 }
 994
 995 struct multi_pack_index *get_multi_pack_index(struct repository *r)
 996 {
 997         prepare_packed_git(r);
 998         return r->objects->multi_pack_index;
 999 }
1000
1001 struct packed_git *get_all_packs(struct repository *r)
1002 {
1003         prepare_packed_git(r);
1004
1005         if (!r->objects->all_packs) {
1006                 struct packed_git *p = r->objects->packed_git;
1007                 struct multi_pack_index *m;
1008
1009                 for (m = r->objects->multi_pack_index; m; m = m->next) {
1010                         uint32_t i;
1011                         for (i = 0; i < m->num_packs; i++) {
1012                                 if (!prepare_midx_pack(m, i)) {
1013                                         m->packs[i]->next = p;
1014                                         p = m->packs[i];
1015                                 }
1016                         }
1017                 }
1018
1019                 r->objects->all_packs = p;
1020         }
1021
1022         return r->objects->all_packs;
1023 }
1024
1025 struct list_head *get_packed_git_mru(struct repository *r)
1026 {
1027         prepare_packed_git(r);
1028         return &r->objects->packed_git_mru;
1029 }
1030
1031 unsigned long unpack_object_header_buffer(const unsigned char *buf,
1032                 unsigned long len, enum object_type *type, unsigned long *sizep)
1033 {
1034         unsigned shift;
1035         unsigned long size, c;
1036         unsigned long used = 0;
1037
1038         c = buf[used++];
1039         *type = (c >> 4) & 7;
1040         size = c & 15;
1041         shift = 4;
1042         while (c & 0x80) {
1043                 if (len <= used || bitsizeof(long) <= shift) {
1044                         error("bad object header");
1045                         size = used = 0;
1046                         break;
1047                 }
1048                 c = buf[used++];
1049                 size += (c & 0x7f) << shift;
1050                 shift += 7;
1051         }
1052         *sizep = size;
1053         return used;
1054 }
1055
1056 unsigned long get_size_from_delta(struct packed_git *p,
1057                                   struct pack_window **w_curs,
1058                                   off_t curpos)
1059 {
1060         const unsigned char *data;
1061         unsigned char delta_head[20], *in;
1062         git_zstream stream;
1063         int st;
1064
1065         memset(&stream, 0, sizeof(stream));
1066         stream.next_out = delta_head;
1067         stream.avail_out = sizeof(delta_head);
1068
1069         git_inflate_init(&stream);
1070         do {
1071                 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1072                 stream.next_in = in;
1073                 st = git_inflate(&stream, Z_FINISH);
1074                 curpos += stream.next_in - in;
1075         } while ((st == Z_OK || st == Z_BUF_ERROR) &&
1076                  stream.total_out < sizeof(delta_head));
1077         git_inflate_end(&stream);
1078         if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
1079                 error("delta data unpack-initial failed");
1080                 return 0;
1081         }
1082
1083         /* Examine the initial part of the delta to figure out
1084          * the result size.
1085          */
1086         data = delta_head;
1087
1088         /* ignore base size */
1089         get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1090
1091         /* Read the result size */
1092         return get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1093 }
1094
1095 int unpack_object_header(struct packed_git *p,
1096                          struct pack_window **w_curs,
1097                          off_t *curpos,
1098                          unsigned long *sizep)
1099 {
1100         unsigned char *base;
1101         unsigned long left;
1102         unsigned long used;
1103         enum object_type type;
1104
1105         /* use_pack() assures us we have [base, base + 20) available
1106          * as a range that we can look at.  (Its actually the hash
1107          * size that is assured.)  With our object header encoding
1108          * the maximum deflated object size is 2^137, which is just
1109          * insane, so we know won't exceed what we have been given.
1110          */
1111         base = use_pack(p, w_curs, *curpos, &left);
1112         used = unpack_object_header_buffer(base, left, &type, sizep);
1113         if (!used) {
1114                 type = OBJ_BAD;
1115         } else
1116                 *curpos += used;
1117
1118         return type;
1119 }
1120
1121 void mark_bad_packed_object(struct packed_git *p, const unsigned char *sha1)
1122 {
1123         unsigned i;
1124         for (i = 0; i < p->num_bad_objects; i++)
1125                 if (hasheq(sha1, p->bad_object_sha1 + GIT_SHA1_RAWSZ * i))
1126                         return;
1127         p->bad_object_sha1 = xrealloc(p->bad_object_sha1,
1128                                       st_mult(GIT_MAX_RAWSZ,
1129                                               st_add(p->num_bad_objects, 1)));
1130         hashcpy(p->bad_object_sha1 + GIT_SHA1_RAWSZ * p->num_bad_objects, sha1);
1131         p->num_bad_objects++;
1132 }
1133
1134 const struct packed_git *has_packed_and_bad(struct repository *r,
1135                                             const unsigned char *sha1)
1136 {
1137         struct packed_git *p;
1138         unsigned i;
1139
1140         for (p = r->objects->packed_git; p; p = p->next)
1141                 for (i = 0; i < p->num_bad_objects; i++)
1142                         if (hasheq(sha1,
1143                                    p->bad_object_sha1 + the_hash_algo->rawsz * i))
1144                                 return p;
1145         return NULL;
1146 }
1147
1148 static off_t get_delta_base(struct packed_git *p,
1149                                     struct pack_window **w_curs,
1150                                     off_t *curpos,
1151                                     enum object_type type,
1152                                     off_t delta_obj_offset)
1153 {
1154         unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1155         off_t base_offset;
1156
1157         /* use_pack() assured us we have [base_info, base_info + 20)
1158          * as a range that we can look at without walking off the
1159          * end of the mapped window.  Its actually the hash size
1160          * that is assured.  An OFS_DELTA longer than the hash size
1161          * is stupid, as then a REF_DELTA would be smaller to store.
1162          */
1163         if (type == OBJ_OFS_DELTA) {
1164                 unsigned used = 0;
1165                 unsigned char c = base_info[used++];
1166                 base_offset = c & 127;
1167                 while (c & 128) {
1168                         base_offset += 1;
1169                         if (!base_offset || MSB(base_offset, 7))
1170                                 return 0;  /* overflow */
1171                         c = base_info[used++];
1172                         base_offset = (base_offset << 7) + (c & 127);
1173                 }
1174                 base_offset = delta_obj_offset - base_offset;
1175                 if (base_offset <= 0 || base_offset >= delta_obj_offset)
1176                         return 0;  /* out of bound */
1177                 *curpos += used;
1178         } else if (type == OBJ_REF_DELTA) {
1179                 /* The base entry _must_ be in the same pack */
1180                 base_offset = find_pack_entry_one(base_info, p);
1181                 *curpos += the_hash_algo->rawsz;
1182         } else
1183                 die("I am totally screwed");
1184         return base_offset;
1185 }
1186
1187 /*
1188  * Like get_delta_base above, but we return the sha1 instead of the pack
1189  * offset. This means it is cheaper for REF deltas (we do not have to do
1190  * the final object lookup), but more expensive for OFS deltas (we
1191  * have to load the revidx to convert the offset back into a sha1).
1192  */
1193 static const unsigned char *get_delta_base_sha1(struct packed_git *p,
1194                                                 struct pack_window **w_curs,
1195                                                 off_t curpos,
1196                                                 enum object_type type,
1197                                                 off_t delta_obj_offset)
1198 {
1199         if (type == OBJ_REF_DELTA) {
1200                 unsigned char *base = use_pack(p, w_curs, curpos, NULL);
1201                 return base;
1202         } else if (type == OBJ_OFS_DELTA) {
1203                 struct revindex_entry *revidx;
1204                 off_t base_offset = get_delta_base(p, w_curs, &curpos,
1205                                                    type, delta_obj_offset);
1206
1207                 if (!base_offset)
1208                         return NULL;
1209
1210                 revidx = find_pack_revindex(p, base_offset);
1211                 if (!revidx)
1212                         return NULL;
1213
1214                 return nth_packed_object_sha1(p, revidx->nr);
1215         } else
1216                 return NULL;
1217 }
1218
1219 static int retry_bad_packed_offset(struct repository *r,
1220                                    struct packed_git *p,
1221                                    off_t obj_offset)
1222 {
1223         int type;
1224         struct revindex_entry *revidx;
1225         struct object_id oid;
1226         revidx = find_pack_revindex(p, obj_offset);
1227         if (!revidx)
1228                 return OBJ_BAD;
1229         nth_packed_object_oid(&oid, p, revidx->nr);
1230         mark_bad_packed_object(p, oid.hash);
1231         type = oid_object_info(r, &oid, NULL);
1232         if (type <= OBJ_NONE)
1233                 return OBJ_BAD;
1234         return type;
1235 }
1236
1237 #define POI_STACK_PREALLOC 64
1238
1239 static enum object_type packed_to_object_type(struct repository *r,
1240                                               struct packed_git *p,
1241                                               off_t obj_offset,
1242                                               enum object_type type,
1243                                               struct pack_window **w_curs,
1244                                               off_t curpos)
1245 {
1246         off_t small_poi_stack[POI_STACK_PREALLOC];
1247         off_t *poi_stack = small_poi_stack;
1248         int poi_stack_nr = 0, poi_stack_alloc = POI_STACK_PREALLOC;
1249
1250         while (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1251                 off_t base_offset;
1252                 unsigned long size;
1253                 /* Push the object we're going to leave behind */
1254                 if (poi_stack_nr >= poi_stack_alloc && poi_stack == small_poi_stack) {
1255                         poi_stack_alloc = alloc_nr(poi_stack_nr);
1256                         ALLOC_ARRAY(poi_stack, poi_stack_alloc);
1257                         memcpy(poi_stack, small_poi_stack, sizeof(off_t)*poi_stack_nr);
1258                 } else {
1259                         ALLOC_GROW(poi_stack, poi_stack_nr+1, poi_stack_alloc);
1260                 }
1261                 poi_stack[poi_stack_nr++] = obj_offset;
1262                 /* If parsing the base offset fails, just unwind */
1263                 base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1264                 if (!base_offset)
1265                         goto unwind;
1266                 curpos = obj_offset = base_offset;
1267                 type = unpack_object_header(p, w_curs, &curpos, &size);
1268                 if (type <= OBJ_NONE) {
1269                         /* If getting the base itself fails, we first
1270                          * retry the base, otherwise unwind */
1271                         type = retry_bad_packed_offset(r, p, base_offset);
1272                         if (type > OBJ_NONE)
1273                                 goto out;
1274                         goto unwind;
1275                 }
1276         }
1277
1278         switch (type) {
1279         case OBJ_BAD:
1280         case OBJ_COMMIT:
1281         case OBJ_TREE:
1282         case OBJ_BLOB:
1283         case OBJ_TAG:
1284                 break;
1285         default:
1286                 error("unknown object type %i at offset %"PRIuMAX" in %s",
1287                       type, (uintmax_t)obj_offset, p->pack_name);
1288                 type = OBJ_BAD;
1289         }
1290
1291 out:
1292         if (poi_stack != small_poi_stack)
1293                 free(poi_stack);
1294         return type;
1295
1296 unwind:
1297         while (poi_stack_nr) {
1298                 obj_offset = poi_stack[--poi_stack_nr];
1299                 type = retry_bad_packed_offset(r, p, obj_offset);
1300                 if (type > OBJ_NONE)
1301                         goto out;
1302         }
1303         type = OBJ_BAD;
1304         goto out;
1305 }
1306
1307 static struct hashmap delta_base_cache;
1308 static size_t delta_base_cached;
1309
1310 static LIST_HEAD(delta_base_cache_lru);
1311
1312 struct delta_base_cache_key {
1313         struct packed_git *p;
1314         off_t base_offset;
1315 };
1316
1317 struct delta_base_cache_entry {
1318         struct hashmap hash;
1319         struct delta_base_cache_key key;
1320         struct list_head lru;
1321         void *data;
1322         unsigned long size;
1323         enum object_type type;
1324 };
1325
1326 static unsigned int pack_entry_hash(struct packed_git *p, off_t base_offset)
1327 {
1328         unsigned int hash;
1329
1330         hash = (unsigned int)(intptr_t)p + (unsigned int)base_offset;
1331         hash += (hash >> 8) + (hash >> 16);
1332         return hash;
1333 }
1334
1335 static struct delta_base_cache_entry *
1336 get_delta_base_cache_entry(struct packed_git *p, off_t base_offset)
1337 {
1338         struct hashmap_entry entry;
1339         struct delta_base_cache_key key;
1340
1341         if (!delta_base_cache.cmpfn)
1342                 return NULL;
1343
1344         hashmap_entry_init(&entry, pack_entry_hash(p, base_offset));
1345         key.p = p;
1346         key.base_offset = base_offset;
1347         return hashmap_get(&delta_base_cache, &entry, &key);
1348 }
1349
1350 static int delta_base_cache_key_eq(const struct delta_base_cache_key *a,
1351                                    const struct delta_base_cache_key *b)
1352 {
1353         return a->p == b->p && a->base_offset == b->base_offset;
1354 }
1355
1356 static int delta_base_cache_hash_cmp(const void *unused_cmp_data,
1357                                      const void *va, const void *vb,
1358                                      const void *vkey)
1359 {
1360         const struct delta_base_cache_entry *a = va, *b = vb;
1361         const struct delta_base_cache_key *key = vkey;
1362         if (key)
1363                 return !delta_base_cache_key_eq(&a->key, key);
1364         else
1365                 return !delta_base_cache_key_eq(&a->key, &b->key);
1366 }
1367
1368 static int in_delta_base_cache(struct packed_git *p, off_t base_offset)
1369 {
1370         return !!get_delta_base_cache_entry(p, base_offset);
1371 }
1372
1373 /*
1374  * Remove the entry from the cache, but do _not_ free the associated
1375  * entry data. The caller takes ownership of the "data" buffer, and
1376  * should copy out any fields it wants before detaching.
1377  */
1378 static void detach_delta_base_cache_entry(struct delta_base_cache_entry *ent)
1379 {
1380         hashmap_remove(&delta_base_cache, ent, &ent->key);
1381         list_del(&ent->lru);
1382         delta_base_cached -= ent->size;
1383         free(ent);
1384 }
1385
1386 static void *cache_or_unpack_entry(struct repository *r, struct packed_git *p,
1387                                    off_t base_offset, unsigned long *base_size,
1388                                    enum object_type *type)
1389 {
1390         struct delta_base_cache_entry *ent;
1391
1392         ent = get_delta_base_cache_entry(p, base_offset);
1393         if (!ent)
1394                 return unpack_entry(r, p, base_offset, type, base_size);
1395
1396         if (type)
1397                 *type = ent->type;
1398         if (base_size)
1399                 *base_size = ent->size;
1400         return xmemdupz(ent->data, ent->size);
1401 }
1402
1403 static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
1404 {
1405         free(ent->data);
1406         detach_delta_base_cache_entry(ent);
1407 }
1408
1409 void clear_delta_base_cache(void)
1410 {
1411         struct list_head *lru, *tmp;
1412         list_for_each_safe(lru, tmp, &delta_base_cache_lru) {
1413                 struct delta_base_cache_entry *entry =
1414                         list_entry(lru, struct delta_base_cache_entry, lru);
1415                 release_delta_base_cache(entry);
1416         }
1417 }
1418
1419 static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
1420         void *base, unsigned long base_size, enum object_type type)
1421 {
1422         struct delta_base_cache_entry *ent = xmalloc(sizeof(*ent));
1423         struct list_head *lru, *tmp;
1424
1425         delta_base_cached += base_size;
1426
1427         list_for_each_safe(lru, tmp, &delta_base_cache_lru) {
1428                 struct delta_base_cache_entry *f =
1429                         list_entry(lru, struct delta_base_cache_entry, lru);
1430                 if (delta_base_cached <= delta_base_cache_limit)
1431                         break;
1432                 release_delta_base_cache(f);
1433         }
1434
1435         ent->key.p = p;
1436         ent->key.base_offset = base_offset;
1437         ent->type = type;
1438         ent->data = base;
1439         ent->size = base_size;
1440         list_add_tail(&ent->lru, &delta_base_cache_lru);
1441
1442         if (!delta_base_cache.cmpfn)
1443                 hashmap_init(&delta_base_cache, delta_base_cache_hash_cmp, NULL, 0);
1444         hashmap_entry_init(ent, pack_entry_hash(p, base_offset));
1445         hashmap_add(&delta_base_cache, ent);
1446 }
1447
1448 int packed_object_info(struct repository *r, struct packed_git *p,
1449                        off_t obj_offset, struct object_info *oi)
1450 {
1451         struct pack_window *w_curs = NULL;
1452         unsigned long size;
1453         off_t curpos = obj_offset;
1454         enum object_type type;
1455
1456         /*
1457          * We always get the representation type, but only convert it to
1458          * a "real" type later if the caller is interested.
1459          */
1460         if (oi->contentp) {
1461                 *oi->contentp = cache_or_unpack_entry(r, p, obj_offset, oi->sizep,
1462                                                       &type);
1463                 if (!*oi->contentp)
1464                         type = OBJ_BAD;
1465         } else {
1466                 type = unpack_object_header(p, &w_curs, &curpos, &size);
1467         }
1468
1469         if (!oi->contentp && oi->sizep) {
1470                 if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1471                         off_t tmp_pos = curpos;
1472                         off_t base_offset = get_delta_base(p, &w_curs, &tmp_pos,
1473                                                            type, obj_offset);
1474                         if (!base_offset) {
1475                                 type = OBJ_BAD;
1476                                 goto out;
1477                         }
1478                         *oi->sizep = get_size_from_delta(p, &w_curs, tmp_pos);
1479                         if (*oi->sizep == 0) {
1480                                 type = OBJ_BAD;
1481                                 goto out;
1482                         }
1483                 } else {
1484                         *oi->sizep = size;
1485                 }
1486         }
1487
1488         if (oi->disk_sizep) {
1489                 struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
1490                 *oi->disk_sizep = revidx[1].offset - obj_offset;
1491         }
1492
1493         if (oi->typep || oi->type_name) {
1494                 enum object_type ptot;
1495                 ptot = packed_to_object_type(r, p, obj_offset,
1496                                              type, &w_curs, curpos);
1497                 if (oi->typep)
1498                         *oi->typep = ptot;
1499                 if (oi->type_name) {
1500                         const char *tn = type_name(ptot);
1501                         if (tn)
1502                                 strbuf_addstr(oi->type_name, tn);
1503                 }
1504                 if (ptot < 0) {
1505                         type = OBJ_BAD;
1506                         goto out;
1507                 }
1508         }
1509
1510         if (oi->delta_base_sha1) {
1511                 if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1512                         const unsigned char *base;
1513
1514                         base = get_delta_base_sha1(p, &w_curs, curpos,
1515                                                    type, obj_offset);
1516                         if (!base) {
1517                                 type = OBJ_BAD;
1518                                 goto out;
1519                         }
1520
1521                         hashcpy(oi->delta_base_sha1, base);
1522                 } else
1523                         hashclr(oi->delta_base_sha1);
1524         }
1525
1526         oi->whence = in_delta_base_cache(p, obj_offset) ? OI_DBCACHED :
1527                                                           OI_PACKED;
1528
1529 out:
1530         unuse_pack(&w_curs);
1531         return type;
1532 }
1533
1534 static void *unpack_compressed_entry(struct packed_git *p,
1535                                     struct pack_window **w_curs,
1536                                     off_t curpos,
1537                                     unsigned long size)
1538 {
1539         int st;
1540         git_zstream stream;
1541         unsigned char *buffer, *in;
1542
1543         buffer = xmallocz_gently(size);
1544         if (!buffer)
1545                 return NULL;
1546         memset(&stream, 0, sizeof(stream));
1547         stream.next_out = buffer;
1548         stream.avail_out = size + 1;
1549
1550         git_inflate_init(&stream);
1551         do {
1552                 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1553                 stream.next_in = in;
1554                 st = git_inflate(&stream, Z_FINISH);
1555                 if (!stream.avail_out)
1556                         break; /* the payload is larger than it should be */
1557                 curpos += stream.next_in - in;
1558         } while (st == Z_OK || st == Z_BUF_ERROR);
1559         git_inflate_end(&stream);
1560         if ((st != Z_STREAM_END) || stream.total_out != size) {
1561                 free(buffer);
1562                 return NULL;
1563         }
1564
1565         /* versions of zlib can clobber unconsumed portion of outbuf */
1566         buffer[size] = '\0';
1567
1568         return buffer;
1569 }
1570
1571 static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
1572 {
1573         static struct trace_key pack_access = TRACE_KEY_INIT(PACK_ACCESS);
1574         trace_printf_key(&pack_access, "%s %"PRIuMAX"\n",
1575                          p->pack_name, (uintmax_t)obj_offset);
1576 }
1577
1578 int do_check_packed_object_crc;
1579
1580 #define UNPACK_ENTRY_STACK_PREALLOC 64
1581 struct unpack_entry_stack_ent {
1582         off_t obj_offset;
1583         off_t curpos;
1584         unsigned long size;
1585 };
1586
1587 static void *read_object(struct repository *r,
1588                          const struct object_id *oid,
1589                          enum object_type *type,
1590                          unsigned long *size)
1591 {
1592         struct object_info oi = OBJECT_INFO_INIT;
1593         void *content;
1594         oi.typep = type;
1595         oi.sizep = size;
1596         oi.contentp = &content;
1597
1598         if (oid_object_info_extended(r, oid, &oi, 0) < 0)
1599                 return NULL;
1600         return content;
1601 }
1602
1603 void *unpack_entry(struct repository *r, struct packed_git *p, off_t obj_offset,
1604                    enum object_type *final_type, unsigned long *final_size)
1605 {
1606         struct pack_window *w_curs = NULL;
1607         off_t curpos = obj_offset;
1608         void *data = NULL;
1609         unsigned long size;
1610         enum object_type type;
1611         struct unpack_entry_stack_ent small_delta_stack[UNPACK_ENTRY_STACK_PREALLOC];
1612         struct unpack_entry_stack_ent *delta_stack = small_delta_stack;
1613         int delta_stack_nr = 0, delta_stack_alloc = UNPACK_ENTRY_STACK_PREALLOC;
1614         int base_from_cache = 0;
1615
1616         write_pack_access_log(p, obj_offset);
1617
1618         /* PHASE 1: drill down to the innermost base object */
1619         for (;;) {
1620                 off_t base_offset;
1621                 int i;
1622                 struct delta_base_cache_entry *ent;
1623
1624                 ent = get_delta_base_cache_entry(p, curpos);
1625                 if (ent) {
1626                         type = ent->type;
1627                         data = ent->data;
1628                         size = ent->size;
1629                         detach_delta_base_cache_entry(ent);
1630                         base_from_cache = 1;
1631                         break;
1632                 }
1633
1634                 if (do_check_packed_object_crc && p->index_version > 1) {
1635                         struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
1636                         off_t len = revidx[1].offset - obj_offset;
1637                         if (check_pack_crc(p, &w_curs, obj_offset, len, revidx->nr)) {
1638                                 struct object_id oid;
1639                                 nth_packed_object_oid(&oid, p, revidx->nr);
1640                                 error("bad packed object CRC for %s",
1641                                       oid_to_hex(&oid));
1642                                 mark_bad_packed_object(p, oid.hash);
1643                                 data = NULL;
1644                                 goto out;
1645                         }
1646                 }
1647
1648                 type = unpack_object_header(p, &w_curs, &curpos, &size);
1649                 if (type != OBJ_OFS_DELTA && type != OBJ_REF_DELTA)
1650                         break;
1651
1652                 base_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
1653                 if (!base_offset) {
1654                         error("failed to validate delta base reference "
1655                               "at offset %"PRIuMAX" from %s",
1656                               (uintmax_t)curpos, p->pack_name);
1657                         /* bail to phase 2, in hopes of recovery */
1658                         data = NULL;
1659                         break;
1660                 }
1661
1662                 /* push object, proceed to base */
1663                 if (delta_stack_nr >= delta_stack_alloc
1664                     && delta_stack == small_delta_stack) {
1665                         delta_stack_alloc = alloc_nr(delta_stack_nr);
1666                         ALLOC_ARRAY(delta_stack, delta_stack_alloc);
1667                         memcpy(delta_stack, small_delta_stack,
1668                                sizeof(*delta_stack)*delta_stack_nr);
1669                 } else {
1670                         ALLOC_GROW(delta_stack, delta_stack_nr+1, delta_stack_alloc);
1671                 }
1672                 i = delta_stack_nr++;
1673                 delta_stack[i].obj_offset = obj_offset;
1674                 delta_stack[i].curpos = curpos;
1675                 delta_stack[i].size = size;
1676
1677                 curpos = obj_offset = base_offset;
1678         }
1679
1680         /* PHASE 2: handle the base */
1681         switch (type) {
1682         case OBJ_OFS_DELTA:
1683         case OBJ_REF_DELTA:
1684                 if (data)
1685                         BUG("unpack_entry: left loop at a valid delta");
1686                 break;
1687         case OBJ_COMMIT:
1688         case OBJ_TREE:
1689         case OBJ_BLOB:
1690         case OBJ_TAG:
1691                 if (!base_from_cache)
1692                         data = unpack_compressed_entry(p, &w_curs, curpos, size);
1693                 break;
1694         default:
1695                 data = NULL;
1696                 error("unknown object type %i at offset %"PRIuMAX" in %s",
1697                       type, (uintmax_t)obj_offset, p->pack_name);
1698         }
1699
1700         /* PHASE 3: apply deltas in order */
1701
1702         /* invariants:
1703          *   'data' holds the base data, or NULL if there was corruption
1704          */
1705         while (delta_stack_nr) {
1706                 void *delta_data;
1707                 void *base = data;
1708                 void *external_base = NULL;
1709                 unsigned long delta_size, base_size = size;
1710                 int i;
1711
1712                 data = NULL;
1713
1714                 if (base)
1715                         add_delta_base_cache(p, obj_offset, base, base_size, type);
1716
1717                 if (!base) {
1718                         /*
1719                          * We're probably in deep shit, but let's try to fetch
1720                          * the required base anyway from another pack or loose.
1721                          * This is costly but should happen only in the presence
1722                          * of a corrupted pack, and is better than failing outright.
1723                          */
1724                         struct revindex_entry *revidx;
1725                         struct object_id base_oid;
1726                         revidx = find_pack_revindex(p, obj_offset);
1727                         if (revidx) {
1728                                 nth_packed_object_oid(&base_oid, p, revidx->nr);
1729                                 error("failed to read delta base object %s"
1730                                       " at offset %"PRIuMAX" from %s",
1731                                       oid_to_hex(&base_oid), (uintmax_t)obj_offset,
1732                                       p->pack_name);
1733                                 mark_bad_packed_object(p, base_oid.hash);
1734                                 base = read_object(r, &base_oid, &type, &base_size);
1735                                 external_base = base;
1736                         }
1737                 }
1738
1739                 i = --delta_stack_nr;
1740                 obj_offset = delta_stack[i].obj_offset;
1741                 curpos = delta_stack[i].curpos;
1742                 delta_size = delta_stack[i].size;
1743
1744                 if (!base)
1745                         continue;
1746
1747                 delta_data = unpack_compressed_entry(p, &w_curs, curpos, delta_size);
1748
1749                 if (!delta_data) {
1750                         error("failed to unpack compressed delta "
1751                               "at offset %"PRIuMAX" from %s",
1752                               (uintmax_t)curpos, p->pack_name);
1753                         data = NULL;
1754                         free(external_base);
1755                         continue;
1756                 }
1757
1758                 data = patch_delta(base, base_size,
1759                                    delta_data, delta_size,
1760                                    &size);
1761
1762                 /*
1763                  * We could not apply the delta; warn the user, but keep going.
1764                  * Our failure will be noticed either in the next iteration of
1765                  * the loop, or if this is the final delta, in the caller when
1766                  * we return NULL. Those code paths will take care of making
1767                  * a more explicit warning and retrying with another copy of
1768                  * the object.
1769                  */
1770                 if (!data)
1771                         error("failed to apply delta");
1772
1773                 free(delta_data);
1774                 free(external_base);
1775         }
1776
1777         if (final_type)
1778                 *final_type = type;
1779         if (final_size)
1780                 *final_size = size;
1781
1782 out:
1783         unuse_pack(&w_curs);
1784
1785         if (delta_stack != small_delta_stack)
1786                 free(delta_stack);
1787
1788         return data;
1789 }
1790
1791 int bsearch_pack(const struct object_id *oid, const struct packed_git *p, uint32_t *result)
1792 {
1793         const unsigned char *index_fanout = p->index_data;
1794         const unsigned char *index_lookup;
1795         const unsigned int hashsz = the_hash_algo->rawsz;
1796         int index_lookup_width;
1797
1798         if (!index_fanout)
1799                 BUG("bsearch_pack called without a valid pack-index");
1800
1801         index_lookup = index_fanout + 4 * 256;
1802         if (p->index_version == 1) {
1803                 index_lookup_width = hashsz + 4;
1804                 index_lookup += 4;
1805         } else {
1806                 index_lookup_width = hashsz;
1807                 index_fanout += 8;
1808                 index_lookup += 8;
1809         }
1810
1811         return bsearch_hash(oid->hash, (const uint32_t*)index_fanout,
1812                             index_lookup, index_lookup_width, result);
1813 }
1814
1815 const unsigned char *nth_packed_object_sha1(struct packed_git *p,
1816                                             uint32_t n)
1817 {
1818         const unsigned char *index = p->index_data;
1819         const unsigned int hashsz = the_hash_algo->rawsz;
1820         if (!index) {
1821                 if (open_pack_index(p))
1822                         return NULL;
1823                 index = p->index_data;
1824         }
1825         if (n >= p->num_objects)
1826                 return NULL;
1827         index += 4 * 256;
1828         if (p->index_version == 1) {
1829                 return index + (hashsz + 4) * n + 4;
1830         } else {
1831                 index += 8;
1832                 return index + hashsz * n;
1833         }
1834 }
1835
1836 const struct object_id *nth_packed_object_oid(struct object_id *oid,
1837                                               struct packed_git *p,
1838                                               uint32_t n)
1839 {
1840         const unsigned char *hash = nth_packed_object_sha1(p, n);
1841         if (!hash)
1842                 return NULL;
1843         hashcpy(oid->hash, hash);
1844         return oid;
1845 }
1846
1847 void check_pack_index_ptr(const struct packed_git *p, const void *vptr)
1848 {
1849         const unsigned char *ptr = vptr;
1850         const unsigned char *start = p->index_data;
1851         const unsigned char *end = start + p->index_size;
1852         if (ptr < start)
1853                 die(_("offset before start of pack index for %s (corrupt index?)"),
1854                     p->pack_name);
1855         /* No need to check for underflow; .idx files must be at least 8 bytes */
1856         if (ptr >= end - 8)
1857                 die(_("offset beyond end of pack index for %s (truncated index?)"),
1858                     p->pack_name);
1859 }
1860
1861 off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
1862 {
1863         const unsigned char *index = p->index_data;
1864         const unsigned int hashsz = the_hash_algo->rawsz;
1865         index += 4 * 256;
1866         if (p->index_version == 1) {
1867                 return ntohl(*((uint32_t *)(index + (hashsz + 4) * n)));
1868         } else {
1869                 uint32_t off;
1870                 index += 8 + p->num_objects * (hashsz + 4);
1871                 off = ntohl(*((uint32_t *)(index + 4 * n)));
1872                 if (!(off & 0x80000000))
1873                         return off;
1874                 index += p->num_objects * 4 + (off & 0x7fffffff) * 8;
1875                 check_pack_index_ptr(p, index);
1876                 return get_be64(index);
1877         }
1878 }
1879
1880 off_t find_pack_entry_one(const unsigned char *sha1,
1881                                   struct packed_git *p)
1882 {
1883         const unsigned char *index = p->index_data;
1884         struct object_id oid;
1885         uint32_t result;
1886
1887         if (!index) {
1888                 if (open_pack_index(p))
1889                         return 0;
1890         }
1891
1892         hashcpy(oid.hash, sha1);
1893         if (bsearch_pack(&oid, p, &result))
1894                 return nth_packed_object_offset(p, result);
1895         return 0;
1896 }
1897
1898 int is_pack_valid(struct packed_git *p)
1899 {
1900         /* An already open pack is known to be valid. */
1901         if (p->pack_fd != -1)
1902                 return 1;
1903
1904         /* If the pack has one window completely covering the
1905          * file size, the pack is known to be valid even if
1906          * the descriptor is not currently open.
1907          */
1908         if (p->windows) {
1909                 struct pack_window *w = p->windows;
1910
1911                 if (!w->offset && w->len == p->pack_size)
1912                         return 1;
1913         }
1914
1915         /* Force the pack to open to prove its valid. */
1916         return !open_packed_git(p);
1917 }
1918
1919 struct packed_git *find_sha1_pack(const unsigned char *sha1,
1920                                   struct packed_git *packs)
1921 {
1922         struct packed_git *p;
1923
1924         for (p = packs; p; p = p->next) {
1925                 if (find_pack_entry_one(sha1, p))
1926                         return p;
1927         }
1928         return NULL;
1929
1930 }
1931
1932 static int fill_pack_entry(const struct object_id *oid,
1933                            struct pack_entry *e,
1934                            struct packed_git *p)
1935 {
1936         off_t offset;
1937
1938         if (p->num_bad_objects) {
1939                 unsigned i;
1940                 for (i = 0; i < p->num_bad_objects; i++)
1941                         if (hasheq(oid->hash,
1942                                    p->bad_object_sha1 + the_hash_algo->rawsz * i))
1943                                 return 0;
1944         }
1945
1946         offset = find_pack_entry_one(oid->hash, p);
1947         if (!offset)
1948                 return 0;
1949
1950         /*
1951          * We are about to tell the caller where they can locate the
1952          * requested object.  We better make sure the packfile is
1953          * still here and can be accessed before supplying that
1954          * answer, as it may have been deleted since the index was
1955          * loaded!
1956          */
1957         if (!is_pack_valid(p))
1958                 return 0;
1959         e->offset = offset;
1960         e->p = p;
1961         return 1;
1962 }
1963
1964 int find_pack_entry(struct repository *r, const struct object_id *oid, struct pack_entry *e)
1965 {
1966         struct list_head *pos;
1967         struct multi_pack_index *m;
1968
1969         prepare_packed_git(r);
1970         if (!r->objects->packed_git && !r->objects->multi_pack_index)
1971                 return 0;
1972
1973         for (m = r->objects->multi_pack_index; m; m = m->next) {
1974                 if (fill_midx_entry(oid, e, m))
1975                         return 1;
1976         }
1977
1978         list_for_each(pos, &r->objects->packed_git_mru) {
1979                 struct packed_git *p = list_entry(pos, struct packed_git, mru);
1980                 if (fill_pack_entry(oid, e, p)) {
1981                         list_move(&p->mru, &r->objects->packed_git_mru);
1982                         return 1;
1983                 }
1984         }
1985         return 0;
1986 }
1987
1988 int has_object_pack(const struct object_id *oid)
1989 {
1990         struct pack_entry e;
1991         return find_pack_entry(the_repository, oid, &e);
1992 }
1993
1994 int has_pack_index(const unsigned char *sha1)
1995 {
1996         struct stat st;
1997         if (stat(sha1_pack_index_name(sha1), &st))
1998                 return 0;
1999         return 1;
2000 }
2001
2002 int for_each_object_in_pack(struct packed_git *p,
2003                             each_packed_object_fn cb, void *data,
2004                             enum for_each_object_flags flags)
2005 {
2006         uint32_t i;
2007         int r = 0;
2008
2009         if (flags & FOR_EACH_OBJECT_PACK_ORDER)
2010                 load_pack_revindex(p);
2011
2012         for (i = 0; i < p->num_objects; i++) {
2013                 uint32_t pos;
2014                 struct object_id oid;
2015
2016                 if (flags & FOR_EACH_OBJECT_PACK_ORDER)
2017                         pos = p->revindex[i].nr;
2018                 else
2019                         pos = i;
2020
2021                 if (!nth_packed_object_oid(&oid, p, pos))
2022                         return error("unable to get sha1 of object %u in %s",
2023                                      pos, p->pack_name);
2024
2025                 r = cb(&oid, p, pos, data);
2026                 if (r)
2027                         break;
2028         }
2029         return r;
2030 }
2031
2032 int for_each_packed_object(each_packed_object_fn cb, void *data,
2033                            enum for_each_object_flags flags)
2034 {
2035         struct packed_git *p;
2036         int r = 0;
2037         int pack_errors = 0;
2038
2039         prepare_packed_git(the_repository);
2040         for (p = get_all_packs(the_repository); p; p = p->next) {
2041                 if ((flags & FOR_EACH_OBJECT_LOCAL_ONLY) && !p->pack_local)
2042                         continue;
2043                 if ((flags & FOR_EACH_OBJECT_PROMISOR_ONLY) &&
2044                     !p->pack_promisor)
2045                         continue;
2046                 if (open_pack_index(p)) {
2047                         pack_errors = 1;
2048                         continue;
2049                 }
2050                 r = for_each_object_in_pack(p, cb, data, flags);
2051                 if (r)
2052                         break;
2053         }
2054         return r ? r : pack_errors;
2055 }
2056
2057 static int add_promisor_object(const struct object_id *oid,
2058                                struct packed_git *pack,
2059                                uint32_t pos,
2060                                void *set_)
2061 {
2062         struct oidset *set = set_;
2063         struct object *obj = parse_object(the_repository, oid);
2064         if (!obj)
2065                 return 1;
2066
2067         oidset_insert(set, oid);
2068
2069         /*
2070          * If this is a tree, commit, or tag, the objects it refers
2071          * to are also promisor objects. (Blobs refer to no objects->)
2072          */
2073         if (obj->type == OBJ_TREE) {
2074                 struct tree *tree = (struct tree *)obj;
2075                 struct tree_desc desc;
2076                 struct name_entry entry;
2077                 if (init_tree_desc_gently(&desc, tree->buffer, tree->size))
2078                         /*
2079                          * Error messages are given when packs are
2080                          * verified, so do not print any here.
2081                          */
2082                         return 0;
2083                 while (tree_entry_gently(&desc, &entry))
2084                         oidset_insert(set, entry.oid);
2085         } else if (obj->type == OBJ_COMMIT) {
2086                 struct commit *commit = (struct commit *) obj;
2087                 struct commit_list *parents = commit->parents;
2088
2089                 oidset_insert(set, get_commit_tree_oid(commit));
2090                 for (; parents; parents = parents->next)
2091                         oidset_insert(set, &parents->item->object.oid);
2092         } else if (obj->type == OBJ_TAG) {
2093                 struct tag *tag = (struct tag *) obj;
2094                 oidset_insert(set, &tag->tagged->oid);
2095         }
2096         return 0;
2097 }
2098
2099 int is_promisor_object(const struct object_id *oid)
2100 {
2101         static struct oidset promisor_objects;
2102         static int promisor_objects_prepared;
2103
2104         if (!promisor_objects_prepared) {
2105                 if (repository_format_partial_clone) {
2106                         for_each_packed_object(add_promisor_object,
2107                                                &promisor_objects,
2108                                                FOR_EACH_OBJECT_PROMISOR_ONLY);
2109                 }
2110                 promisor_objects_prepared = 1;
2111         }
2112         return oidset_contains(&promisor_objects, oid);
2113 }