sha1_file.con commit pack-objects: do not reuse packfiles without --delta-base-offset (69e4b34)
   1/*
   2 * GIT - The information manager from hell
   3 *
   4 * Copyright (C) Linus Torvalds, 2005
   5 *
   6 * This handles basic git sha1 object files - packing, unpacking,
   7 * creation etc.
   8 */
   9#include "cache.h"
  10#include "string-list.h"
  11#include "delta.h"
  12#include "pack.h"
  13#include "blob.h"
  14#include "commit.h"
  15#include "run-command.h"
  16#include "tag.h"
  17#include "tree.h"
  18#include "tree-walk.h"
  19#include "refs.h"
  20#include "pack-revindex.h"
  21#include "sha1-lookup.h"
  22#include "bulk-checkin.h"
  23#include "streaming.h"
  24#include "dir.h"
  25
  26#ifndef O_NOATIME
  27#if defined(__linux__) && (defined(__i386__) || defined(__PPC__))
  28#define O_NOATIME 01000000
  29#else
  30#define O_NOATIME 0
  31#endif
  32#endif
  33
  34#define SZ_FMT PRIuMAX
  35static inline uintmax_t sz_fmt(size_t s) { return s; }
  36
  37const unsigned char null_sha1[20];
  38
  39static const char *no_log_pack_access = "no_log_pack_access";
  40static const char *log_pack_access;
  41
  42/*
  43 * This is meant to hold a *small* number of objects that you would
  44 * want read_sha1_file() to be able to return, but yet you do not want
  45 * to write them into the object store (e.g. a browse-only
  46 * application).
  47 */
  48static struct cached_object {
  49        unsigned char sha1[20];
  50        enum object_type type;
  51        void *buf;
  52        unsigned long size;
  53} *cached_objects;
  54static int cached_object_nr, cached_object_alloc;
  55
  56static struct cached_object empty_tree = {
  57        EMPTY_TREE_SHA1_BIN_LITERAL,
  58        OBJ_TREE,
  59        "",
  60        0
  61};
  62
  63static struct packed_git *last_found_pack;
  64
  65static struct cached_object *find_cached_object(const unsigned char *sha1)
  66{
  67        int i;
  68        struct cached_object *co = cached_objects;
  69
  70        for (i = 0; i < cached_object_nr; i++, co++) {
  71                if (!hashcmp(co->sha1, sha1))
  72                        return co;
  73        }
  74        if (!hashcmp(sha1, empty_tree.sha1))
  75                return &empty_tree;
  76        return NULL;
  77}
  78
  79int mkdir_in_gitdir(const char *path)
  80{
  81        if (mkdir(path, 0777)) {
  82                int saved_errno = errno;
  83                struct stat st;
  84                struct strbuf sb = STRBUF_INIT;
  85
  86                if (errno != EEXIST)
  87                        return -1;
  88                /*
  89                 * Are we looking at a path in a symlinked worktree
  90                 * whose original repository does not yet have it?
  91                 * e.g. .git/rr-cache pointing at its original
  92                 * repository in which the user hasn't performed any
  93                 * conflict resolution yet?
  94                 */
  95                if (lstat(path, &st) || !S_ISLNK(st.st_mode) ||
  96                    strbuf_readlink(&sb, path, st.st_size) ||
  97                    !is_absolute_path(sb.buf) ||
  98                    mkdir(sb.buf, 0777)) {
  99                        strbuf_release(&sb);
 100                        errno = saved_errno;
 101                        return -1;
 102                }
 103                strbuf_release(&sb);
 104        }
 105        return adjust_shared_perm(path);
 106}
 107
 108int safe_create_leading_directories(char *path)
 109{
 110        char *pos = path + offset_1st_component(path);
 111        struct stat st;
 112
 113        while (pos) {
 114                pos = strchr(pos, '/');
 115                if (!pos)
 116                        break;
 117                while (*++pos == '/')
 118                        ;
 119                if (!*pos)
 120                        break;
 121                *--pos = '\0';
 122                if (!stat(path, &st)) {
 123                        /* path exists */
 124                        if (!S_ISDIR(st.st_mode)) {
 125                                *pos = '/';
 126                                return -3;
 127                        }
 128                }
 129                else if (mkdir(path, 0777)) {
 130                        if (errno == EEXIST &&
 131                            !stat(path, &st) && S_ISDIR(st.st_mode)) {
 132                                ; /* somebody created it since we checked */
 133                        } else {
 134                                *pos = '/';
 135                                return -1;
 136                        }
 137                }
 138                else if (adjust_shared_perm(path)) {
 139                        *pos = '/';
 140                        return -2;
 141                }
 142                *pos++ = '/';
 143        }
 144        return 0;
 145}
 146
 147int safe_create_leading_directories_const(const char *path)
 148{
 149        /* path points to cache entries, so xstrdup before messing with it */
 150        char *buf = xstrdup(path);
 151        int result = safe_create_leading_directories(buf);
 152        free(buf);
 153        return result;
 154}
 155
 156static void fill_sha1_path(char *pathbuf, const unsigned char *sha1)
 157{
 158        int i;
 159        for (i = 0; i < 20; i++) {
 160                static char hex[] = "0123456789abcdef";
 161                unsigned int val = sha1[i];
 162                char *pos = pathbuf + i*2 + (i > 0);
 163                *pos++ = hex[val >> 4];
 164                *pos = hex[val & 0xf];
 165        }
 166}
 167
 168/*
 169 * NOTE! This returns a statically allocated buffer, so you have to be
 170 * careful about using it. Do an "xstrdup()" if you need to save the
 171 * filename.
 172 *
 173 * Also note that this returns the location for creating.  Reading
 174 * SHA1 file can happen from any alternate directory listed in the
 175 * DB_ENVIRONMENT environment variable if it is not found in
 176 * the primary object database.
 177 */
 178char *sha1_file_name(const unsigned char *sha1)
 179{
 180        static char buf[PATH_MAX];
 181        const char *objdir;
 182        int len;
 183
 184        objdir = get_object_directory();
 185        len = strlen(objdir);
 186
 187        /* '/' + sha1(2) + '/' + sha1(38) + '\0' */
 188        if (len + 43 > PATH_MAX)
 189                die("insanely long object directory %s", objdir);
 190        memcpy(buf, objdir, len);
 191        buf[len] = '/';
 192        buf[len+3] = '/';
 193        buf[len+42] = '\0';
 194        fill_sha1_path(buf + len + 1, sha1);
 195        return buf;
 196}
 197
 198static char *sha1_get_pack_name(const unsigned char *sha1,
 199                                char **name, char **base, const char *which)
 200{
 201        static const char hex[] = "0123456789abcdef";
 202        char *buf;
 203        int i;
 204
 205        if (!*base) {
 206                const char *sha1_file_directory = get_object_directory();
 207                int len = strlen(sha1_file_directory);
 208                *base = xmalloc(len + 60);
 209                sprintf(*base, "%s/pack/pack-1234567890123456789012345678901234567890.%s",
 210                        sha1_file_directory, which);
 211                *name = *base + len + 11;
 212        }
 213
 214        buf = *name;
 215
 216        for (i = 0; i < 20; i++) {
 217                unsigned int val = *sha1++;
 218                *buf++ = hex[val >> 4];
 219                *buf++ = hex[val & 0xf];
 220        }
 221
 222        return *base;
 223}
 224
 225char *sha1_pack_name(const unsigned char *sha1)
 226{
 227        static char *name, *base;
 228
 229        return sha1_get_pack_name(sha1, &name, &base, "pack");
 230}
 231
 232char *sha1_pack_index_name(const unsigned char *sha1)
 233{
 234        static char *name, *base;
 235
 236        return sha1_get_pack_name(sha1, &name, &base, "idx");
 237}
 238
 239struct alternate_object_database *alt_odb_list;
 240static struct alternate_object_database **alt_odb_tail;
 241
 242/*
 243 * Prepare alternate object database registry.
 244 *
 245 * The variable alt_odb_list points at the list of struct
 246 * alternate_object_database.  The elements on this list come from
 247 * non-empty elements from colon separated ALTERNATE_DB_ENVIRONMENT
 248 * environment variable, and $GIT_OBJECT_DIRECTORY/info/alternates,
 249 * whose contents is similar to that environment variable but can be
 250 * LF separated.  Its base points at a statically allocated buffer that
 251 * contains "/the/directory/corresponding/to/.git/objects/...", while
 252 * its name points just after the slash at the end of ".git/objects/"
 253 * in the example above, and has enough space to hold 40-byte hex
 254 * SHA1, an extra slash for the first level indirection, and the
 255 * terminating NUL.
 256 */
 257static int link_alt_odb_entry(const char *entry, const char *relative_base, int depth)
 258{
 259        const char *objdir = get_object_directory();
 260        struct alternate_object_database *ent;
 261        struct alternate_object_database *alt;
 262        int pfxlen, entlen;
 263        struct strbuf pathbuf = STRBUF_INIT;
 264
 265        if (!is_absolute_path(entry) && relative_base) {
 266                strbuf_addstr(&pathbuf, real_path(relative_base));
 267                strbuf_addch(&pathbuf, '/');
 268        }
 269        strbuf_addstr(&pathbuf, entry);
 270
 271        normalize_path_copy(pathbuf.buf, pathbuf.buf);
 272
 273        pfxlen = strlen(pathbuf.buf);
 274
 275        /*
 276         * The trailing slash after the directory name is given by
 277         * this function at the end. Remove duplicates.
 278         */
 279        while (pfxlen && pathbuf.buf[pfxlen-1] == '/')
 280                pfxlen -= 1;
 281
 282        entlen = pfxlen + 43; /* '/' + 2 hex + '/' + 38 hex + NUL */
 283        ent = xmalloc(sizeof(*ent) + entlen);
 284        memcpy(ent->base, pathbuf.buf, pfxlen);
 285        strbuf_release(&pathbuf);
 286
 287        ent->name = ent->base + pfxlen + 1;
 288        ent->base[pfxlen + 3] = '/';
 289        ent->base[pfxlen] = ent->base[entlen-1] = 0;
 290
 291        /* Detect cases where alternate disappeared */
 292        if (!is_directory(ent->base)) {
 293                error("object directory %s does not exist; "
 294                      "check .git/objects/info/alternates.",
 295                      ent->base);
 296                free(ent);
 297                return -1;
 298        }
 299
 300        /* Prevent the common mistake of listing the same
 301         * thing twice, or object directory itself.
 302         */
 303        for (alt = alt_odb_list; alt; alt = alt->next) {
 304                if (!memcmp(ent->base, alt->base, pfxlen)) {
 305                        free(ent);
 306                        return -1;
 307                }
 308        }
 309        if (!strcmp(ent->base, objdir)) {
 310                free(ent);
 311                return -1;
 312        }
 313
 314        /* add the alternate entry */
 315        *alt_odb_tail = ent;
 316        alt_odb_tail = &(ent->next);
 317        ent->next = NULL;
 318
 319        /* recursively add alternates */
 320        read_info_alternates(ent->base, depth + 1);
 321
 322        ent->base[pfxlen] = '/';
 323
 324        return 0;
 325}
 326
 327static void link_alt_odb_entries(const char *alt, int len, int sep,
 328                                 const char *relative_base, int depth)
 329{
 330        struct string_list entries = STRING_LIST_INIT_NODUP;
 331        char *alt_copy;
 332        int i;
 333
 334        if (depth > 5) {
 335                error("%s: ignoring alternate object stores, nesting too deep.",
 336                                relative_base);
 337                return;
 338        }
 339
 340        alt_copy = xmemdupz(alt, len);
 341        string_list_split_in_place(&entries, alt_copy, sep, -1);
 342        for (i = 0; i < entries.nr; i++) {
 343                const char *entry = entries.items[i].string;
 344                if (entry[0] == '\0' || entry[0] == '#')
 345                        continue;
 346                if (!is_absolute_path(entry) && depth) {
 347                        error("%s: ignoring relative alternate object store %s",
 348                                        relative_base, entry);
 349                } else {
 350                        link_alt_odb_entry(entry, relative_base, depth);
 351                }
 352        }
 353        string_list_clear(&entries, 0);
 354        free(alt_copy);
 355}
 356
 357void read_info_alternates(const char * relative_base, int depth)
 358{
 359        char *map;
 360        size_t mapsz;
 361        struct stat st;
 362        const char alt_file_name[] = "info/alternates";
 363        /* Given that relative_base is no longer than PATH_MAX,
 364           ensure that "path" has enough space to append "/", the
 365           file name, "info/alternates", and a trailing NUL.  */
 366        char path[PATH_MAX + 1 + sizeof alt_file_name];
 367        int fd;
 368
 369        sprintf(path, "%s/%s", relative_base, alt_file_name);
 370        fd = git_open_noatime(path);
 371        if (fd < 0)
 372                return;
 373        if (fstat(fd, &st) || (st.st_size == 0)) {
 374                close(fd);
 375                return;
 376        }
 377        mapsz = xsize_t(st.st_size);
 378        map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
 379        close(fd);
 380
 381        link_alt_odb_entries(map, mapsz, '\n', relative_base, depth);
 382
 383        munmap(map, mapsz);
 384}
 385
 386void add_to_alternates_file(const char *reference)
 387{
 388        struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
 389        int fd = hold_lock_file_for_append(lock, git_path("objects/info/alternates"), LOCK_DIE_ON_ERROR);
 390        char *alt = mkpath("%s\n", reference);
 391        write_or_die(fd, alt, strlen(alt));
 392        if (commit_lock_file(lock))
 393                die("could not close alternates file");
 394        if (alt_odb_tail)
 395                link_alt_odb_entries(alt, strlen(alt), '\n', NULL, 0);
 396}
 397
 398void foreach_alt_odb(alt_odb_fn fn, void *cb)
 399{
 400        struct alternate_object_database *ent;
 401
 402        prepare_alt_odb();
 403        for (ent = alt_odb_list; ent; ent = ent->next)
 404                if (fn(ent, cb))
 405                        return;
 406}
 407
 408void prepare_alt_odb(void)
 409{
 410        const char *alt;
 411
 412        if (alt_odb_tail)
 413                return;
 414
 415        alt = getenv(ALTERNATE_DB_ENVIRONMENT);
 416        if (!alt) alt = "";
 417
 418        alt_odb_tail = &alt_odb_list;
 419        link_alt_odb_entries(alt, strlen(alt), PATH_SEP, NULL, 0);
 420
 421        read_info_alternates(get_object_directory(), 0);
 422}
 423
 424static int has_loose_object_local(const unsigned char *sha1)
 425{
 426        char *name = sha1_file_name(sha1);
 427        return !access(name, F_OK);
 428}
 429
 430int has_loose_object_nonlocal(const unsigned char *sha1)
 431{
 432        struct alternate_object_database *alt;
 433        prepare_alt_odb();
 434        for (alt = alt_odb_list; alt; alt = alt->next) {
 435                fill_sha1_path(alt->name, sha1);
 436                if (!access(alt->base, F_OK))
 437                        return 1;
 438        }
 439        return 0;
 440}
 441
 442static int has_loose_object(const unsigned char *sha1)
 443{
 444        return has_loose_object_local(sha1) ||
 445               has_loose_object_nonlocal(sha1);
 446}
 447
 448static unsigned int pack_used_ctr;
 449static unsigned int pack_mmap_calls;
 450static unsigned int peak_pack_open_windows;
 451static unsigned int pack_open_windows;
 452static unsigned int pack_open_fds;
 453static unsigned int pack_max_fds;
 454static size_t peak_pack_mapped;
 455static size_t pack_mapped;
 456struct packed_git *packed_git;
 457
 458void pack_report(void)
 459{
 460        fprintf(stderr,
 461                "pack_report: getpagesize()            = %10" SZ_FMT "\n"
 462                "pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
 463                "pack_report: core.packedGitLimit      = %10" SZ_FMT "\n",
 464                sz_fmt(getpagesize()),
 465                sz_fmt(packed_git_window_size),
 466                sz_fmt(packed_git_limit));
 467        fprintf(stderr,
 468                "pack_report: pack_used_ctr            = %10u\n"
 469                "pack_report: pack_mmap_calls          = %10u\n"
 470                "pack_report: pack_open_windows        = %10u / %10u\n"
 471                "pack_report: pack_mapped              = "
 472                        "%10" SZ_FMT " / %10" SZ_FMT "\n",
 473                pack_used_ctr,
 474                pack_mmap_calls,
 475                pack_open_windows, peak_pack_open_windows,
 476                sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
 477}
 478
 479static int check_packed_git_idx(const char *path,  struct packed_git *p)
 480{
 481        void *idx_map;
 482        struct pack_idx_header *hdr;
 483        size_t idx_size;
 484        uint32_t version, nr, i, *index;
 485        int fd = git_open_noatime(path);
 486        struct stat st;
 487
 488        if (fd < 0)
 489                return -1;
 490        if (fstat(fd, &st)) {
 491                close(fd);
 492                return -1;
 493        }
 494        idx_size = xsize_t(st.st_size);
 495        if (idx_size < 4 * 256 + 20 + 20) {
 496                close(fd);
 497                return error("index file %s is too small", path);
 498        }
 499        idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
 500        close(fd);
 501
 502        hdr = idx_map;
 503        if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
 504                version = ntohl(hdr->idx_version);
 505                if (version < 2 || version > 2) {
 506                        munmap(idx_map, idx_size);
 507                        return error("index file %s is version %"PRIu32
 508                                     " and is not supported by this binary"
 509                                     " (try upgrading GIT to a newer version)",
 510                                     path, version);
 511                }
 512        } else
 513                version = 1;
 514
 515        nr = 0;
 516        index = idx_map;
 517        if (version > 1)
 518                index += 2;  /* skip index header */
 519        for (i = 0; i < 256; i++) {
 520                uint32_t n = ntohl(index[i]);
 521                if (n < nr) {
 522                        munmap(idx_map, idx_size);
 523                        return error("non-monotonic index %s", path);
 524                }
 525                nr = n;
 526        }
 527
 528        if (version == 1) {
 529                /*
 530                 * Total size:
 531                 *  - 256 index entries 4 bytes each
 532                 *  - 24-byte entries * nr (20-byte sha1 + 4-byte offset)
 533                 *  - 20-byte SHA1 of the packfile
 534                 *  - 20-byte SHA1 file checksum
 535                 */
 536                if (idx_size != 4*256 + nr * 24 + 20 + 20) {
 537                        munmap(idx_map, idx_size);
 538                        return error("wrong index v1 file size in %s", path);
 539                }
 540        } else if (version == 2) {
 541                /*
 542                 * Minimum size:
 543                 *  - 8 bytes of header
 544                 *  - 256 index entries 4 bytes each
 545                 *  - 20-byte sha1 entry * nr
 546                 *  - 4-byte crc entry * nr
 547                 *  - 4-byte offset entry * nr
 548                 *  - 20-byte SHA1 of the packfile
 549                 *  - 20-byte SHA1 file checksum
 550                 * And after the 4-byte offset table might be a
 551                 * variable sized table containing 8-byte entries
 552                 * for offsets larger than 2^31.
 553                 */
 554                unsigned long min_size = 8 + 4*256 + nr*(20 + 4 + 4) + 20 + 20;
 555                unsigned long max_size = min_size;
 556                if (nr)
 557                        max_size += (nr - 1)*8;
 558                if (idx_size < min_size || idx_size > max_size) {
 559                        munmap(idx_map, idx_size);
 560                        return error("wrong index v2 file size in %s", path);
 561                }
 562                if (idx_size != min_size &&
 563                    /*
 564                     * make sure we can deal with large pack offsets.
 565                     * 31-bit signed offset won't be enough, neither
 566                     * 32-bit unsigned one will be.
 567                     */
 568                    (sizeof(off_t) <= 4)) {
 569                        munmap(idx_map, idx_size);
 570                        return error("pack too large for current definition of off_t in %s", path);
 571                }
 572        }
 573
 574        p->index_version = version;
 575        p->index_data = idx_map;
 576        p->index_size = idx_size;
 577        p->num_objects = nr;
 578        return 0;
 579}
 580
 581int open_pack_index(struct packed_git *p)
 582{
 583        char *idx_name;
 584        int ret;
 585
 586        if (p->index_data)
 587                return 0;
 588
 589        idx_name = xstrdup(p->pack_name);
 590        strcpy(idx_name + strlen(idx_name) - strlen(".pack"), ".idx");
 591        ret = check_packed_git_idx(idx_name, p);
 592        free(idx_name);
 593        return ret;
 594}
 595
 596static void scan_windows(struct packed_git *p,
 597        struct packed_git **lru_p,
 598        struct pack_window **lru_w,
 599        struct pack_window **lru_l)
 600{
 601        struct pack_window *w, *w_l;
 602
 603        for (w_l = NULL, w = p->windows; w; w = w->next) {
 604                if (!w->inuse_cnt) {
 605                        if (!*lru_w || w->last_used < (*lru_w)->last_used) {
 606                                *lru_p = p;
 607                                *lru_w = w;
 608                                *lru_l = w_l;
 609                        }
 610                }
 611                w_l = w;
 612        }
 613}
 614
 615static int unuse_one_window(struct packed_git *current)
 616{
 617        struct packed_git *p, *lru_p = NULL;
 618        struct pack_window *lru_w = NULL, *lru_l = NULL;
 619
 620        if (current)
 621                scan_windows(current, &lru_p, &lru_w, &lru_l);
 622        for (p = packed_git; p; p = p->next)
 623                scan_windows(p, &lru_p, &lru_w, &lru_l);
 624        if (lru_p) {
 625                munmap(lru_w->base, lru_w->len);
 626                pack_mapped -= lru_w->len;
 627                if (lru_l)
 628                        lru_l->next = lru_w->next;
 629                else
 630                        lru_p->windows = lru_w->next;
 631                free(lru_w);
 632                pack_open_windows--;
 633                return 1;
 634        }
 635        return 0;
 636}
 637
 638void release_pack_memory(size_t need)
 639{
 640        size_t cur = pack_mapped;
 641        while (need >= (cur - pack_mapped) && unuse_one_window(NULL))
 642                ; /* nothing */
 643}
 644
 645void *xmmap(void *start, size_t length,
 646        int prot, int flags, int fd, off_t offset)
 647{
 648        void *ret = mmap(start, length, prot, flags, fd, offset);
 649        if (ret == MAP_FAILED) {
 650                if (!length)
 651                        return NULL;
 652                release_pack_memory(length);
 653                ret = mmap(start, length, prot, flags, fd, offset);
 654                if (ret == MAP_FAILED)
 655                        die_errno("Out of memory? mmap failed");
 656        }
 657        return ret;
 658}
 659
 660void close_pack_windows(struct packed_git *p)
 661{
 662        while (p->windows) {
 663                struct pack_window *w = p->windows;
 664
 665                if (w->inuse_cnt)
 666                        die("pack '%s' still has open windows to it",
 667                            p->pack_name);
 668                munmap(w->base, w->len);
 669                pack_mapped -= w->len;
 670                pack_open_windows--;
 671                p->windows = w->next;
 672                free(w);
 673        }
 674}
 675
 676/*
 677 * The LRU pack is the one with the oldest MRU window, preferring packs
 678 * with no used windows, or the oldest mtime if it has no windows allocated.
 679 */
 680static void find_lru_pack(struct packed_git *p, struct packed_git **lru_p, struct pack_window **mru_w, int *accept_windows_inuse)
 681{
 682        struct pack_window *w, *this_mru_w;
 683        int has_windows_inuse = 0;
 684
 685        /*
 686         * Reject this pack if it has windows and the previously selected
 687         * one does not.  If this pack does not have windows, reject
 688         * it if the pack file is newer than the previously selected one.
 689         */
 690        if (*lru_p && !*mru_w && (p->windows || p->mtime > (*lru_p)->mtime))
 691                return;
 692
 693        for (w = this_mru_w = p->windows; w; w = w->next) {
 694                /*
 695                 * Reject this pack if any of its windows are in use,
 696                 * but the previously selected pack did not have any
 697                 * inuse windows.  Otherwise, record that this pack
 698                 * has windows in use.
 699                 */
 700                if (w->inuse_cnt) {
 701                        if (*accept_windows_inuse)
 702                                has_windows_inuse = 1;
 703                        else
 704                                return;
 705                }
 706
 707                if (w->last_used > this_mru_w->last_used)
 708                        this_mru_w = w;
 709
 710                /*
 711                 * Reject this pack if it has windows that have been
 712                 * used more recently than the previously selected pack.
 713                 * If the previously selected pack had windows inuse and
 714                 * we have not encountered a window in this pack that is
 715                 * inuse, skip this check since we prefer a pack with no
 716                 * inuse windows to one that has inuse windows.
 717                 */
 718                if (*mru_w && *accept_windows_inuse == has_windows_inuse &&
 719                    this_mru_w->last_used > (*mru_w)->last_used)
 720                        return;
 721        }
 722
 723        /*
 724         * Select this pack.
 725         */
 726        *mru_w = this_mru_w;
 727        *lru_p = p;
 728        *accept_windows_inuse = has_windows_inuse;
 729}
 730
 731static int close_one_pack(void)
 732{
 733        struct packed_git *p, *lru_p = NULL;
 734        struct pack_window *mru_w = NULL;
 735        int accept_windows_inuse = 1;
 736
 737        for (p = packed_git; p; p = p->next) {
 738                if (p->pack_fd == -1)
 739                        continue;
 740                find_lru_pack(p, &lru_p, &mru_w, &accept_windows_inuse);
 741        }
 742
 743        if (lru_p) {
 744                close(lru_p->pack_fd);
 745                pack_open_fds--;
 746                lru_p->pack_fd = -1;
 747                return 1;
 748        }
 749
 750        return 0;
 751}
 752
 753void unuse_pack(struct pack_window **w_cursor)
 754{
 755        struct pack_window *w = *w_cursor;
 756        if (w) {
 757                w->inuse_cnt--;
 758                *w_cursor = NULL;
 759        }
 760}
 761
 762void close_pack_index(struct packed_git *p)
 763{
 764        if (p->index_data) {
 765                munmap((void *)p->index_data, p->index_size);
 766                p->index_data = NULL;
 767        }
 768}
 769
 770/*
 771 * This is used by git-repack in case a newly created pack happens to
 772 * contain the same set of objects as an existing one.  In that case
 773 * the resulting file might be different even if its name would be the
 774 * same.  It is best to close any reference to the old pack before it is
 775 * replaced on disk.  Of course no index pointers nor windows for given pack
 776 * must subsist at this point.  If ever objects from this pack are requested
 777 * again, the new version of the pack will be reinitialized through
 778 * reprepare_packed_git().
 779 */
 780void free_pack_by_name(const char *pack_name)
 781{
 782        struct packed_git *p, **pp = &packed_git;
 783
 784        while (*pp) {
 785                p = *pp;
 786                if (strcmp(pack_name, p->pack_name) == 0) {
 787                        clear_delta_base_cache();
 788                        close_pack_windows(p);
 789                        if (p->pack_fd != -1) {
 790                                close(p->pack_fd);
 791                                pack_open_fds--;
 792                        }
 793                        close_pack_index(p);
 794                        free(p->bad_object_sha1);
 795                        *pp = p->next;
 796                        if (last_found_pack == p)
 797                                last_found_pack = NULL;
 798                        free(p);
 799                        return;
 800                }
 801                pp = &p->next;
 802        }
 803}
 804
 805static unsigned int get_max_fd_limit(void)
 806{
 807#ifdef RLIMIT_NOFILE
 808        struct rlimit lim;
 809
 810        if (getrlimit(RLIMIT_NOFILE, &lim))
 811                die_errno("cannot get RLIMIT_NOFILE");
 812
 813        return lim.rlim_cur;
 814#elif defined(_SC_OPEN_MAX)
 815        return sysconf(_SC_OPEN_MAX);
 816#elif defined(OPEN_MAX)
 817        return OPEN_MAX;
 818#else
 819        return 1; /* see the caller ;-) */
 820#endif
 821}
 822
 823/*
 824 * Do not call this directly as this leaks p->pack_fd on error return;
 825 * call open_packed_git() instead.
 826 */
 827static int open_packed_git_1(struct packed_git *p)
 828{
 829        struct stat st;
 830        struct pack_header hdr;
 831        unsigned char sha1[20];
 832        unsigned char *idx_sha1;
 833        long fd_flag;
 834
 835        if (!p->index_data && open_pack_index(p))
 836                return error("packfile %s index unavailable", p->pack_name);
 837
 838        if (!pack_max_fds) {
 839                unsigned int max_fds = get_max_fd_limit();
 840
 841                /* Save 3 for stdin/stdout/stderr, 22 for work */
 842                if (25 < max_fds)
 843                        pack_max_fds = max_fds - 25;
 844                else
 845                        pack_max_fds = 1;
 846        }
 847
 848        while (pack_max_fds <= pack_open_fds && close_one_pack())
 849                ; /* nothing */
 850
 851        p->pack_fd = git_open_noatime(p->pack_name);
 852        if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
 853                return -1;
 854        pack_open_fds++;
 855
 856        /* If we created the struct before we had the pack we lack size. */
 857        if (!p->pack_size) {
 858                if (!S_ISREG(st.st_mode))
 859                        return error("packfile %s not a regular file", p->pack_name);
 860                p->pack_size = st.st_size;
 861        } else if (p->pack_size != st.st_size)
 862                return error("packfile %s size changed", p->pack_name);
 863
 864        /* We leave these file descriptors open with sliding mmap;
 865         * there is no point keeping them open across exec(), though.
 866         */
 867        fd_flag = fcntl(p->pack_fd, F_GETFD, 0);
 868        if (fd_flag < 0)
 869                return error("cannot determine file descriptor flags");
 870        fd_flag |= FD_CLOEXEC;
 871        if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
 872                return error("cannot set FD_CLOEXEC");
 873
 874        /* Verify we recognize this pack file format. */
 875        if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
 876                return error("file %s is far too short to be a packfile", p->pack_name);
 877        if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
 878                return error("file %s is not a GIT packfile", p->pack_name);
 879        if (!pack_version_ok(hdr.hdr_version))
 880                return error("packfile %s is version %"PRIu32" and not"
 881                        " supported (try upgrading GIT to a newer version)",
 882                        p->pack_name, ntohl(hdr.hdr_version));
 883
 884        /* Verify the pack matches its index. */
 885        if (p->num_objects != ntohl(hdr.hdr_entries))
 886                return error("packfile %s claims to have %"PRIu32" objects"
 887                             " while index indicates %"PRIu32" objects",
 888                             p->pack_name, ntohl(hdr.hdr_entries),
 889                             p->num_objects);
 890        if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
 891                return error("end of packfile %s is unavailable", p->pack_name);
 892        if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
 893                return error("packfile %s signature is unavailable", p->pack_name);
 894        idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
 895        if (hashcmp(sha1, idx_sha1))
 896                return error("packfile %s does not match index", p->pack_name);
 897        return 0;
 898}
 899
 900static int open_packed_git(struct packed_git *p)
 901{
 902        if (!open_packed_git_1(p))
 903                return 0;
 904        if (p->pack_fd != -1) {
 905                close(p->pack_fd);
 906                pack_open_fds--;
 907                p->pack_fd = -1;
 908        }
 909        return -1;
 910}
 911
 912static int in_window(struct pack_window *win, off_t offset)
 913{
 914        /* We must promise at least 20 bytes (one hash) after the
 915         * offset is available from this window, otherwise the offset
 916         * is not actually in this window and a different window (which
 917         * has that one hash excess) must be used.  This is to support
 918         * the object header and delta base parsing routines below.
 919         */
 920        off_t win_off = win->offset;
 921        return win_off <= offset
 922                && (offset + 20) <= (win_off + win->len);
 923}
 924
 925unsigned char *use_pack(struct packed_git *p,
 926                struct pack_window **w_cursor,
 927                off_t offset,
 928                unsigned long *left)
 929{
 930        struct pack_window *win = *w_cursor;
 931
 932        /* Since packfiles end in a hash of their content and it's
 933         * pointless to ask for an offset into the middle of that
 934         * hash, and the in_window function above wouldn't match
 935         * don't allow an offset too close to the end of the file.
 936         */
 937        if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p))
 938                die("packfile %s cannot be accessed", p->pack_name);
 939        if (offset > (p->pack_size - 20))
 940                die("offset beyond end of packfile (truncated pack?)");
 941
 942        if (!win || !in_window(win, offset)) {
 943                if (win)
 944                        win->inuse_cnt--;
 945                for (win = p->windows; win; win = win->next) {
 946                        if (in_window(win, offset))
 947                                break;
 948                }
 949                if (!win) {
 950                        size_t window_align = packed_git_window_size / 2;
 951                        off_t len;
 952
 953                        if (p->pack_fd == -1 && open_packed_git(p))
 954                                die("packfile %s cannot be accessed", p->pack_name);
 955
 956                        win = xcalloc(1, sizeof(*win));
 957                        win->offset = (offset / window_align) * window_align;
 958                        len = p->pack_size - win->offset;
 959                        if (len > packed_git_window_size)
 960                                len = packed_git_window_size;
 961                        win->len = (size_t)len;
 962                        pack_mapped += win->len;
 963                        while (packed_git_limit < pack_mapped
 964                                && unuse_one_window(p))
 965                                ; /* nothing */
 966                        win->base = xmmap(NULL, win->len,
 967                                PROT_READ, MAP_PRIVATE,
 968                                p->pack_fd, win->offset);
 969                        if (win->base == MAP_FAILED)
 970                                die("packfile %s cannot be mapped: %s",
 971                                        p->pack_name,
 972                                        strerror(errno));
 973                        if (!win->offset && win->len == p->pack_size
 974                                && !p->do_not_close) {
 975                                close(p->pack_fd);
 976                                pack_open_fds--;
 977                                p->pack_fd = -1;
 978                        }
 979                        pack_mmap_calls++;
 980                        pack_open_windows++;
 981                        if (pack_mapped > peak_pack_mapped)
 982                                peak_pack_mapped = pack_mapped;
 983                        if (pack_open_windows > peak_pack_open_windows)
 984                                peak_pack_open_windows = pack_open_windows;
 985                        win->next = p->windows;
 986                        p->windows = win;
 987                }
 988        }
 989        if (win != *w_cursor) {
 990                win->last_used = pack_used_ctr++;
 991                win->inuse_cnt++;
 992                *w_cursor = win;
 993        }
 994        offset -= win->offset;
 995        if (left)
 996                *left = win->len - xsize_t(offset);
 997        return win->base + offset;
 998}
 999
1000static struct packed_git *alloc_packed_git(int extra)
1001{
1002        struct packed_git *p = xmalloc(sizeof(*p) + extra);
1003        memset(p, 0, sizeof(*p));
1004        p->pack_fd = -1;
1005        return p;
1006}
1007
1008static void try_to_free_pack_memory(size_t size)
1009{
1010        release_pack_memory(size);
1011}
1012
1013struct packed_git *add_packed_git(const char *path, int path_len, int local)
1014{
1015        static int have_set_try_to_free_routine;
1016        struct stat st;
1017        struct packed_git *p = alloc_packed_git(path_len + 2);
1018
1019        if (!have_set_try_to_free_routine) {
1020                have_set_try_to_free_routine = 1;
1021                set_try_to_free_routine(try_to_free_pack_memory);
1022        }
1023
1024        /*
1025         * Make sure a corresponding .pack file exists and that
1026         * the index looks sane.
1027         */
1028        path_len -= strlen(".idx");
1029        if (path_len < 1) {
1030                free(p);
1031                return NULL;
1032        }
1033        memcpy(p->pack_name, path, path_len);
1034
1035        strcpy(p->pack_name + path_len, ".keep");
1036        if (!access(p->pack_name, F_OK))
1037                p->pack_keep = 1;
1038
1039        strcpy(p->pack_name + path_len, ".pack");
1040        if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
1041                free(p);
1042                return NULL;
1043        }
1044
1045        /* ok, it looks sane as far as we can check without
1046         * actually mapping the pack file.
1047         */
1048        p->pack_size = st.st_size;
1049        p->pack_local = local;
1050        p->mtime = st.st_mtime;
1051        if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
1052                hashclr(p->sha1);
1053        return p;
1054}
1055
1056struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
1057{
1058        const char *path = sha1_pack_name(sha1);
1059        struct packed_git *p = alloc_packed_git(strlen(path) + 1);
1060
1061        strcpy(p->pack_name, path);
1062        hashcpy(p->sha1, sha1);
1063        if (check_packed_git_idx(idx_path, p)) {
1064                free(p);
1065                return NULL;
1066        }
1067
1068        return p;
1069}
1070
1071void install_packed_git(struct packed_git *pack)
1072{
1073        if (pack->pack_fd != -1)
1074                pack_open_fds++;
1075
1076        pack->next = packed_git;
1077        packed_git = pack;
1078}
1079
1080void (*report_garbage)(const char *desc, const char *path);
1081
1082static void report_helper(const struct string_list *list,
1083                          int seen_bits, int first, int last)
1084{
1085        const char *msg;
1086        switch (seen_bits) {
1087        case 0:
1088                msg = "no corresponding .idx nor .pack";
1089                break;
1090        case 1:
1091                msg = "no corresponding .idx";
1092                break;
1093        case 2:
1094                msg = "no corresponding .pack";
1095                break;
1096        default:
1097                return;
1098        }
1099        for (; first < last; first++)
1100                report_garbage(msg, list->items[first].string);
1101}
1102
1103static void report_pack_garbage(struct string_list *list)
1104{
1105        int i, baselen = -1, first = 0, seen_bits = 0;
1106
1107        if (!report_garbage)
1108                return;
1109
1110        sort_string_list(list);
1111
1112        for (i = 0; i < list->nr; i++) {
1113                const char *path = list->items[i].string;
1114                if (baselen != -1 &&
1115                    strncmp(path, list->items[first].string, baselen)) {
1116                        report_helper(list, seen_bits, first, i);
1117                        baselen = -1;
1118                        seen_bits = 0;
1119                }
1120                if (baselen == -1) {
1121                        const char *dot = strrchr(path, '.');
1122                        if (!dot) {
1123                                report_garbage("garbage found", path);
1124                                continue;
1125                        }
1126                        baselen = dot - path + 1;
1127                        first = i;
1128                }
1129                if (!strcmp(path + baselen, "pack"))
1130                        seen_bits |= 1;
1131                else if (!strcmp(path + baselen, "idx"))
1132                        seen_bits |= 2;
1133        }
1134        report_helper(list, seen_bits, first, list->nr);
1135}
1136
1137static void prepare_packed_git_one(char *objdir, int local)
1138{
1139        /* Ensure that this buffer is large enough so that we can
1140           append "/pack/" without clobbering the stack even if
1141           strlen(objdir) were PATH_MAX.  */
1142        char path[PATH_MAX + 1 + 4 + 1 + 1];
1143        int len;
1144        DIR *dir;
1145        struct dirent *de;
1146        struct string_list garbage = STRING_LIST_INIT_DUP;
1147
1148        sprintf(path, "%s/pack", objdir);
1149        len = strlen(path);
1150        dir = opendir(path);
1151        if (!dir) {
1152                if (errno != ENOENT)
1153                        error("unable to open object pack directory: %s: %s",
1154                              path, strerror(errno));
1155                return;
1156        }
1157        path[len++] = '/';
1158        while ((de = readdir(dir)) != NULL) {
1159                int namelen = strlen(de->d_name);
1160                struct packed_git *p;
1161
1162                if (len + namelen + 1 > sizeof(path)) {
1163                        if (report_garbage) {
1164                                struct strbuf sb = STRBUF_INIT;
1165                                strbuf_addf(&sb, "%.*s/%s", len - 1, path, de->d_name);
1166                                report_garbage("path too long", sb.buf);
1167                                strbuf_release(&sb);
1168                        }
1169                        continue;
1170                }
1171
1172                if (is_dot_or_dotdot(de->d_name))
1173                        continue;
1174
1175                strcpy(path + len, de->d_name);
1176
1177                if (has_extension(de->d_name, ".idx")) {
1178                        /* Don't reopen a pack we already have. */
1179                        for (p = packed_git; p; p = p->next) {
1180                                if (!memcmp(path, p->pack_name, len + namelen - 4))
1181                                        break;
1182                        }
1183                        if (p == NULL &&
1184                            /*
1185                             * See if it really is a valid .idx file with
1186                             * corresponding .pack file that we can map.
1187                             */
1188                            (p = add_packed_git(path, len + namelen, local)) != NULL)
1189                                install_packed_git(p);
1190                }
1191
1192                if (!report_garbage)
1193                        continue;
1194
1195                if (has_extension(de->d_name, ".idx") ||
1196                    has_extension(de->d_name, ".pack") ||
1197                    has_extension(de->d_name, ".bitmap") ||
1198                    has_extension(de->d_name, ".keep"))
1199                        string_list_append(&garbage, path);
1200                else
1201                        report_garbage("garbage found", path);
1202        }
1203        closedir(dir);
1204        report_pack_garbage(&garbage);
1205        string_list_clear(&garbage, 0);
1206}
1207
1208static int sort_pack(const void *a_, const void *b_)
1209{
1210        struct packed_git *a = *((struct packed_git **)a_);
1211        struct packed_git *b = *((struct packed_git **)b_);
1212        int st;
1213
1214        /*
1215         * Local packs tend to contain objects specific to our
1216         * variant of the project than remote ones.  In addition,
1217         * remote ones could be on a network mounted filesystem.
1218         * Favor local ones for these reasons.
1219         */
1220        st = a->pack_local - b->pack_local;
1221        if (st)
1222                return -st;
1223
1224        /*
1225         * Younger packs tend to contain more recent objects,
1226         * and more recent objects tend to get accessed more
1227         * often.
1228         */
1229        if (a->mtime < b->mtime)
1230                return 1;
1231        else if (a->mtime == b->mtime)
1232                return 0;
1233        return -1;
1234}
1235
1236static void rearrange_packed_git(void)
1237{
1238        struct packed_git **ary, *p;
1239        int i, n;
1240
1241        for (n = 0, p = packed_git; p; p = p->next)
1242                n++;
1243        if (n < 2)
1244                return;
1245
1246        /* prepare an array of packed_git for easier sorting */
1247        ary = xcalloc(n, sizeof(struct packed_git *));
1248        for (n = 0, p = packed_git; p; p = p->next)
1249                ary[n++] = p;
1250
1251        qsort(ary, n, sizeof(struct packed_git *), sort_pack);
1252
1253        /* link them back again */
1254        for (i = 0; i < n - 1; i++)
1255                ary[i]->next = ary[i + 1];
1256        ary[n - 1]->next = NULL;
1257        packed_git = ary[0];
1258
1259        free(ary);
1260}
1261
1262static int prepare_packed_git_run_once = 0;
1263void prepare_packed_git(void)
1264{
1265        struct alternate_object_database *alt;
1266
1267        if (prepare_packed_git_run_once)
1268                return;
1269        prepare_packed_git_one(get_object_directory(), 1);
1270        prepare_alt_odb();
1271        for (alt = alt_odb_list; alt; alt = alt->next) {
1272                alt->name[-1] = 0;
1273                prepare_packed_git_one(alt->base, 0);
1274                alt->name[-1] = '/';
1275        }
1276        rearrange_packed_git();
1277        prepare_packed_git_run_once = 1;
1278}
1279
1280void reprepare_packed_git(void)
1281{
1282        prepare_packed_git_run_once = 0;
1283        prepare_packed_git();
1284}
1285
1286static void mark_bad_packed_object(struct packed_git *p,
1287                                   const unsigned char *sha1)
1288{
1289        unsigned i;
1290        for (i = 0; i < p->num_bad_objects; i++)
1291                if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1292                        return;
1293        p->bad_object_sha1 = xrealloc(p->bad_object_sha1, 20 * (p->num_bad_objects + 1));
1294        hashcpy(p->bad_object_sha1 + 20 * p->num_bad_objects, sha1);
1295        p->num_bad_objects++;
1296}
1297
1298static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1299{
1300        struct packed_git *p;
1301        unsigned i;
1302
1303        for (p = packed_git; p; p = p->next)
1304                for (i = 0; i < p->num_bad_objects; i++)
1305                        if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1306                                return p;
1307        return NULL;
1308}
1309
1310/*
1311 * With an in-core object data in "map", rehash it to make sure the
1312 * object name actually matches "sha1" to detect object corruption.
1313 * With "map" == NULL, try reading the object named with "sha1" using
1314 * the streaming interface and rehash it to do the same.
1315 */
1316int check_sha1_signature(const unsigned char *sha1, void *map,
1317                         unsigned long size, const char *type)
1318{
1319        unsigned char real_sha1[20];
1320        enum object_type obj_type;
1321        struct git_istream *st;
1322        git_SHA_CTX c;
1323        char hdr[32];
1324        int hdrlen;
1325
1326        if (map) {
1327                hash_sha1_file(map, size, type, real_sha1);
1328                return hashcmp(sha1, real_sha1) ? -1 : 0;
1329        }
1330
1331        st = open_istream(sha1, &obj_type, &size, NULL);
1332        if (!st)
1333                return -1;
1334
1335        /* Generate the header */
1336        hdrlen = sprintf(hdr, "%s %lu", typename(obj_type), size) + 1;
1337
1338        /* Sha1.. */
1339        git_SHA1_Init(&c);
1340        git_SHA1_Update(&c, hdr, hdrlen);
1341        for (;;) {
1342                char buf[1024 * 16];
1343                ssize_t readlen = read_istream(st, buf, sizeof(buf));
1344
1345                if (readlen < 0) {
1346                        close_istream(st);
1347                        return -1;
1348                }
1349                if (!readlen)
1350                        break;
1351                git_SHA1_Update(&c, buf, readlen);
1352        }
1353        git_SHA1_Final(real_sha1, &c);
1354        close_istream(st);
1355        return hashcmp(sha1, real_sha1) ? -1 : 0;
1356}
1357
1358int git_open_noatime(const char *name)
1359{
1360        static int sha1_file_open_flag = O_NOATIME;
1361
1362        for (;;) {
1363                int fd = open(name, O_RDONLY | sha1_file_open_flag);
1364                if (fd >= 0)
1365                        return fd;
1366
1367                /* Might the failure be due to O_NOATIME? */
1368                if (errno != ENOENT && sha1_file_open_flag) {
1369                        sha1_file_open_flag = 0;
1370                        continue;
1371                }
1372
1373                return -1;
1374        }
1375}
1376
1377static int stat_sha1_file(const unsigned char *sha1, struct stat *st)
1378{
1379        char *name = sha1_file_name(sha1);
1380        struct alternate_object_database *alt;
1381
1382        if (!lstat(name, st))
1383                return 0;
1384
1385        prepare_alt_odb();
1386        errno = ENOENT;
1387        for (alt = alt_odb_list; alt; alt = alt->next) {
1388                name = alt->name;
1389                fill_sha1_path(name, sha1);
1390                if (!lstat(alt->base, st))
1391                        return 0;
1392        }
1393
1394        return -1;
1395}
1396
1397static int open_sha1_file(const unsigned char *sha1)
1398{
1399        int fd;
1400        char *name = sha1_file_name(sha1);
1401        struct alternate_object_database *alt;
1402
1403        fd = git_open_noatime(name);
1404        if (fd >= 0)
1405                return fd;
1406
1407        prepare_alt_odb();
1408        errno = ENOENT;
1409        for (alt = alt_odb_list; alt; alt = alt->next) {
1410                name = alt->name;
1411                fill_sha1_path(name, sha1);
1412                fd = git_open_noatime(alt->base);
1413                if (fd >= 0)
1414                        return fd;
1415        }
1416        return -1;
1417}
1418
1419void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1420{
1421        void *map;
1422        int fd;
1423
1424        fd = open_sha1_file(sha1);
1425        map = NULL;
1426        if (fd >= 0) {
1427                struct stat st;
1428
1429                if (!fstat(fd, &st)) {
1430                        *size = xsize_t(st.st_size);
1431                        if (!*size) {
1432                                /* mmap() is forbidden on empty files */
1433                                error("object file %s is empty", sha1_file_name(sha1));
1434                                return NULL;
1435                        }
1436                        map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1437                }
1438                close(fd);
1439        }
1440        return map;
1441}
1442
1443/*
1444 * There used to be a second loose object header format which
1445 * was meant to mimic the in-pack format, allowing for direct
1446 * copy of the object data.  This format turned up not to be
1447 * really worth it and we no longer write loose objects in that
1448 * format.
1449 */
1450static int experimental_loose_object(unsigned char *map)
1451{
1452        unsigned int word;
1453
1454        /*
1455         * We must determine if the buffer contains the standard
1456         * zlib-deflated stream or the experimental format based
1457         * on the in-pack object format. Compare the header byte
1458         * for each format:
1459         *
1460         * RFC1950 zlib w/ deflate : 0www1000 : 0 <= www <= 7
1461         * Experimental pack-based : Stttssss : ttt = 1,2,3,4
1462         *
1463         * If bit 7 is clear and bits 0-3 equal 8, the buffer MUST be
1464         * in standard loose-object format, UNLESS it is a Git-pack
1465         * format object *exactly* 8 bytes in size when inflated.
1466         *
1467         * However, RFC1950 also specifies that the 1st 16-bit word
1468         * must be divisible by 31 - this checksum tells us our buffer
1469         * is in the standard format, giving a false positive only if
1470         * the 1st word of the Git-pack format object happens to be
1471         * divisible by 31, ie:
1472         *      ((byte0 * 256) + byte1) % 31 = 0
1473         *   =>        0ttt10000www1000 % 31 = 0
1474         *
1475         * As it happens, this case can only arise for www=3 & ttt=1
1476         * - ie, a Commit object, which would have to be 8 bytes in
1477         * size. As no Commit can be that small, we find that the
1478         * combination of these two criteria (bitmask & checksum)
1479         * can always correctly determine the buffer format.
1480         */
1481        word = (map[0] << 8) + map[1];
1482        if ((map[0] & 0x8F) == 0x08 && !(word % 31))
1483                return 0;
1484        else
1485                return 1;
1486}
1487
1488unsigned long unpack_object_header_buffer(const unsigned char *buf,
1489                unsigned long len, enum object_type *type, unsigned long *sizep)
1490{
1491        unsigned shift;
1492        unsigned long size, c;
1493        unsigned long used = 0;
1494
1495        c = buf[used++];
1496        *type = (c >> 4) & 7;
1497        size = c & 15;
1498        shift = 4;
1499        while (c & 0x80) {
1500                if (len <= used || bitsizeof(long) <= shift) {
1501                        error("bad object header");
1502                        size = used = 0;
1503                        break;
1504                }
1505                c = buf[used++];
1506                size += (c & 0x7f) << shift;
1507                shift += 7;
1508        }
1509        *sizep = size;
1510        return used;
1511}
1512
1513int unpack_sha1_header(git_zstream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
1514{
1515        unsigned long size, used;
1516        static const char valid_loose_object_type[8] = {
1517                0, /* OBJ_EXT */
1518                1, 1, 1, 1, /* "commit", "tree", "blob", "tag" */
1519                0, /* "delta" and others are invalid in a loose object */
1520        };
1521        enum object_type type;
1522
1523        /* Get the data stream */
1524        memset(stream, 0, sizeof(*stream));
1525        stream->next_in = map;
1526        stream->avail_in = mapsize;
1527        stream->next_out = buffer;
1528        stream->avail_out = bufsiz;
1529
1530        if (experimental_loose_object(map)) {
1531                /*
1532                 * The old experimental format we no longer produce;
1533                 * we can still read it.
1534                 */
1535                used = unpack_object_header_buffer(map, mapsize, &type, &size);
1536                if (!used || !valid_loose_object_type[type])
1537                        return -1;
1538                map += used;
1539                mapsize -= used;
1540
1541                /* Set up the stream for the rest.. */
1542                stream->next_in = map;
1543                stream->avail_in = mapsize;
1544                git_inflate_init(stream);
1545
1546                /* And generate the fake traditional header */
1547                stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu",
1548                                                 typename(type), size);
1549                return 0;
1550        }
1551        git_inflate_init(stream);
1552        return git_inflate(stream, 0);
1553}
1554
1555static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1556{
1557        int bytes = strlen(buffer) + 1;
1558        unsigned char *buf = xmallocz(size);
1559        unsigned long n;
1560        int status = Z_OK;
1561
1562        n = stream->total_out - bytes;
1563        if (n > size)
1564                n = size;
1565        memcpy(buf, (char *) buffer + bytes, n);
1566        bytes = n;
1567        if (bytes <= size) {
1568                /*
1569                 * The above condition must be (bytes <= size), not
1570                 * (bytes < size).  In other words, even though we
1571                 * expect no more output and set avail_out to zero,
1572                 * the input zlib stream may have bytes that express
1573                 * "this concludes the stream", and we *do* want to
1574                 * eat that input.
1575                 *
1576                 * Otherwise we would not be able to test that we
1577                 * consumed all the input to reach the expected size;
1578                 * we also want to check that zlib tells us that all
1579                 * went well with status == Z_STREAM_END at the end.
1580                 */
1581                stream->next_out = buf + bytes;
1582                stream->avail_out = size - bytes;
1583                while (status == Z_OK)
1584                        status = git_inflate(stream, Z_FINISH);
1585        }
1586        if (status == Z_STREAM_END && !stream->avail_in) {
1587                git_inflate_end(stream);
1588                return buf;
1589        }
1590
1591        if (status < 0)
1592                error("corrupt loose object '%s'", sha1_to_hex(sha1));
1593        else if (stream->avail_in)
1594                error("garbage at end of loose object '%s'",
1595                      sha1_to_hex(sha1));
1596        free(buf);
1597        return NULL;
1598}
1599
1600/*
1601 * We used to just use "sscanf()", but that's actually way
1602 * too permissive for what we want to check. So do an anal
1603 * object header parse by hand.
1604 */
1605int parse_sha1_header(const char *hdr, unsigned long *sizep)
1606{
1607        char type[10];
1608        int i;
1609        unsigned long size;
1610
1611        /*
1612         * The type can be at most ten bytes (including the
1613         * terminating '\0' that we add), and is followed by
1614         * a space.
1615         */
1616        i = 0;
1617        for (;;) {
1618                char c = *hdr++;
1619                if (c == ' ')
1620                        break;
1621                type[i++] = c;
1622                if (i >= sizeof(type))
1623                        return -1;
1624        }
1625        type[i] = 0;
1626
1627        /*
1628         * The length must follow immediately, and be in canonical
1629         * decimal format (ie "010" is not valid).
1630         */
1631        size = *hdr++ - '0';
1632        if (size > 9)
1633                return -1;
1634        if (size) {
1635                for (;;) {
1636                        unsigned long c = *hdr - '0';
1637                        if (c > 9)
1638                                break;
1639                        hdr++;
1640                        size = size * 10 + c;
1641                }
1642        }
1643        *sizep = size;
1644
1645        /*
1646         * The length must be followed by a zero byte
1647         */
1648        return *hdr ? -1 : type_from_string(type);
1649}
1650
1651static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1652{
1653        int ret;
1654        git_zstream stream;
1655        char hdr[8192];
1656
1657        ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1658        if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1659                return NULL;
1660
1661        return unpack_sha1_rest(&stream, hdr, *size, sha1);
1662}
1663
1664unsigned long get_size_from_delta(struct packed_git *p,
1665                                  struct pack_window **w_curs,
1666                                  off_t curpos)
1667{
1668        const unsigned char *data;
1669        unsigned char delta_head[20], *in;
1670        git_zstream stream;
1671        int st;
1672
1673        memset(&stream, 0, sizeof(stream));
1674        stream.next_out = delta_head;
1675        stream.avail_out = sizeof(delta_head);
1676
1677        git_inflate_init(&stream);
1678        do {
1679                in = use_pack(p, w_curs, curpos, &stream.avail_in);
1680                stream.next_in = in;
1681                st = git_inflate(&stream, Z_FINISH);
1682                curpos += stream.next_in - in;
1683        } while ((st == Z_OK || st == Z_BUF_ERROR) &&
1684                 stream.total_out < sizeof(delta_head));
1685        git_inflate_end(&stream);
1686        if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
1687                error("delta data unpack-initial failed");
1688                return 0;
1689        }
1690
1691        /* Examine the initial part of the delta to figure out
1692         * the result size.
1693         */
1694        data = delta_head;
1695
1696        /* ignore base size */
1697        get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1698
1699        /* Read the result size */
1700        return get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1701}
1702
1703static off_t get_delta_base(struct packed_git *p,
1704                                    struct pack_window **w_curs,
1705                                    off_t *curpos,
1706                                    enum object_type type,
1707                                    off_t delta_obj_offset)
1708{
1709        unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1710        off_t base_offset;
1711
1712        /* use_pack() assured us we have [base_info, base_info + 20)
1713         * as a range that we can look at without walking off the
1714         * end of the mapped window.  Its actually the hash size
1715         * that is assured.  An OFS_DELTA longer than the hash size
1716         * is stupid, as then a REF_DELTA would be smaller to store.
1717         */
1718        if (type == OBJ_OFS_DELTA) {
1719                unsigned used = 0;
1720                unsigned char c = base_info[used++];
1721                base_offset = c & 127;
1722                while (c & 128) {
1723                        base_offset += 1;
1724                        if (!base_offset || MSB(base_offset, 7))
1725                                return 0;  /* overflow */
1726                        c = base_info[used++];
1727                        base_offset = (base_offset << 7) + (c & 127);
1728                }
1729                base_offset = delta_obj_offset - base_offset;
1730                if (base_offset <= 0 || base_offset >= delta_obj_offset)
1731                        return 0;  /* out of bound */
1732                *curpos += used;
1733        } else if (type == OBJ_REF_DELTA) {
1734                /* The base entry _must_ be in the same pack */
1735                base_offset = find_pack_entry_one(base_info, p);
1736                *curpos += 20;
1737        } else
1738                die("I am totally screwed");
1739        return base_offset;
1740}
1741
1742int unpack_object_header(struct packed_git *p,
1743                         struct pack_window **w_curs,
1744                         off_t *curpos,
1745                         unsigned long *sizep)
1746{
1747        unsigned char *base;
1748        unsigned long left;
1749        unsigned long used;
1750        enum object_type type;
1751
1752        /* use_pack() assures us we have [base, base + 20) available
1753         * as a range that we can look at.  (Its actually the hash
1754         * size that is assured.)  With our object header encoding
1755         * the maximum deflated object size is 2^137, which is just
1756         * insane, so we know won't exceed what we have been given.
1757         */
1758        base = use_pack(p, w_curs, *curpos, &left);
1759        used = unpack_object_header_buffer(base, left, &type, sizep);
1760        if (!used) {
1761                type = OBJ_BAD;
1762        } else
1763                *curpos += used;
1764
1765        return type;
1766}
1767
1768static int retry_bad_packed_offset(struct packed_git *p, off_t obj_offset)
1769{
1770        int type;
1771        struct revindex_entry *revidx;
1772        const unsigned char *sha1;
1773        revidx = find_pack_revindex(p, obj_offset);
1774        if (!revidx)
1775                return OBJ_BAD;
1776        sha1 = nth_packed_object_sha1(p, revidx->nr);
1777        mark_bad_packed_object(p, sha1);
1778        type = sha1_object_info(sha1, NULL);
1779        if (type <= OBJ_NONE)
1780                return OBJ_BAD;
1781        return type;
1782}
1783
1784#define POI_STACK_PREALLOC 64
1785
1786static enum object_type packed_to_object_type(struct packed_git *p,
1787                                              off_t obj_offset,
1788                                              enum object_type type,
1789                                              struct pack_window **w_curs,
1790                                              off_t curpos)
1791{
1792        off_t small_poi_stack[POI_STACK_PREALLOC];
1793        off_t *poi_stack = small_poi_stack;
1794        int poi_stack_nr = 0, poi_stack_alloc = POI_STACK_PREALLOC;
1795
1796        while (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1797                off_t base_offset;
1798                unsigned long size;
1799                /* Push the object we're going to leave behind */
1800                if (poi_stack_nr >= poi_stack_alloc && poi_stack == small_poi_stack) {
1801                        poi_stack_alloc = alloc_nr(poi_stack_nr);
1802                        poi_stack = xmalloc(sizeof(off_t)*poi_stack_alloc);
1803                        memcpy(poi_stack, small_poi_stack, sizeof(off_t)*poi_stack_nr);
1804                } else {
1805                        ALLOC_GROW(poi_stack, poi_stack_nr+1, poi_stack_alloc);
1806                }
1807                poi_stack[poi_stack_nr++] = obj_offset;
1808                /* If parsing the base offset fails, just unwind */
1809                base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1810                if (!base_offset)
1811                        goto unwind;
1812                curpos = obj_offset = base_offset;
1813                type = unpack_object_header(p, w_curs, &curpos, &size);
1814                if (type <= OBJ_NONE) {
1815                        /* If getting the base itself fails, we first
1816                         * retry the base, otherwise unwind */
1817                        type = retry_bad_packed_offset(p, base_offset);
1818                        if (type > OBJ_NONE)
1819                                goto out;
1820                        goto unwind;
1821                }
1822        }
1823
1824        switch (type) {
1825        case OBJ_BAD:
1826        case OBJ_COMMIT:
1827        case OBJ_TREE:
1828        case OBJ_BLOB:
1829        case OBJ_TAG:
1830                break;
1831        default:
1832                error("unknown object type %i at offset %"PRIuMAX" in %s",
1833                      type, (uintmax_t)obj_offset, p->pack_name);
1834                type = OBJ_BAD;
1835        }
1836
1837out:
1838        if (poi_stack != small_poi_stack)
1839                free(poi_stack);
1840        return type;
1841
1842unwind:
1843        while (poi_stack_nr) {
1844                obj_offset = poi_stack[--poi_stack_nr];
1845                type = retry_bad_packed_offset(p, obj_offset);
1846                if (type > OBJ_NONE)
1847                        goto out;
1848        }
1849        type = OBJ_BAD;
1850        goto out;
1851}
1852
1853static int packed_object_info(struct packed_git *p, off_t obj_offset,
1854                              struct object_info *oi)
1855{
1856        struct pack_window *w_curs = NULL;
1857        unsigned long size;
1858        off_t curpos = obj_offset;
1859        enum object_type type;
1860
1861        /*
1862         * We always get the representation type, but only convert it to
1863         * a "real" type later if the caller is interested.
1864         */
1865        type = unpack_object_header(p, &w_curs, &curpos, &size);
1866
1867        if (oi->sizep) {
1868                if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1869                        off_t tmp_pos = curpos;
1870                        off_t base_offset = get_delta_base(p, &w_curs, &tmp_pos,
1871                                                           type, obj_offset);
1872                        if (!base_offset) {
1873                                type = OBJ_BAD;
1874                                goto out;
1875                        }
1876                        *oi->sizep = get_size_from_delta(p, &w_curs, tmp_pos);
1877                        if (*oi->sizep == 0) {
1878                                type = OBJ_BAD;
1879                                goto out;
1880                        }
1881                } else {
1882                        *oi->sizep = size;
1883                }
1884        }
1885
1886        if (oi->disk_sizep) {
1887                struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
1888                *oi->disk_sizep = revidx[1].offset - obj_offset;
1889        }
1890
1891        if (oi->typep) {
1892                *oi->typep = packed_to_object_type(p, obj_offset, type, &w_curs, curpos);
1893                if (*oi->typep < 0) {
1894                        type = OBJ_BAD;
1895                        goto out;
1896                }
1897        }
1898
1899out:
1900        unuse_pack(&w_curs);
1901        return type;
1902}
1903
1904static void *unpack_compressed_entry(struct packed_git *p,
1905                                    struct pack_window **w_curs,
1906                                    off_t curpos,
1907                                    unsigned long size)
1908{
1909        int st;
1910        git_zstream stream;
1911        unsigned char *buffer, *in;
1912
1913        buffer = xmallocz(size);
1914        memset(&stream, 0, sizeof(stream));
1915        stream.next_out = buffer;
1916        stream.avail_out = size + 1;
1917
1918        git_inflate_init(&stream);
1919        do {
1920                in = use_pack(p, w_curs, curpos, &stream.avail_in);
1921                stream.next_in = in;
1922                st = git_inflate(&stream, Z_FINISH);
1923                if (!stream.avail_out)
1924                        break; /* the payload is larger than it should be */
1925                curpos += stream.next_in - in;
1926        } while (st == Z_OK || st == Z_BUF_ERROR);
1927        git_inflate_end(&stream);
1928        if ((st != Z_STREAM_END) || stream.total_out != size) {
1929                free(buffer);
1930                return NULL;
1931        }
1932
1933        return buffer;
1934}
1935
1936#define MAX_DELTA_CACHE (256)
1937
1938static size_t delta_base_cached;
1939
1940static struct delta_base_cache_lru_list {
1941        struct delta_base_cache_lru_list *prev;
1942        struct delta_base_cache_lru_list *next;
1943} delta_base_cache_lru = { &delta_base_cache_lru, &delta_base_cache_lru };
1944
1945static struct delta_base_cache_entry {
1946        struct delta_base_cache_lru_list lru;
1947        void *data;
1948        struct packed_git *p;
1949        off_t base_offset;
1950        unsigned long size;
1951        enum object_type type;
1952} delta_base_cache[MAX_DELTA_CACHE];
1953
1954static unsigned long pack_entry_hash(struct packed_git *p, off_t base_offset)
1955{
1956        unsigned long hash;
1957
1958        hash = (unsigned long)p + (unsigned long)base_offset;
1959        hash += (hash >> 8) + (hash >> 16);
1960        return hash % MAX_DELTA_CACHE;
1961}
1962
1963static struct delta_base_cache_entry *
1964get_delta_base_cache_entry(struct packed_git *p, off_t base_offset)
1965{
1966        unsigned long hash = pack_entry_hash(p, base_offset);
1967        return delta_base_cache + hash;
1968}
1969
1970static int eq_delta_base_cache_entry(struct delta_base_cache_entry *ent,
1971                                     struct packed_git *p, off_t base_offset)
1972{
1973        return (ent->data && ent->p == p && ent->base_offset == base_offset);
1974}
1975
1976static int in_delta_base_cache(struct packed_git *p, off_t base_offset)
1977{
1978        struct delta_base_cache_entry *ent;
1979        ent = get_delta_base_cache_entry(p, base_offset);
1980        return eq_delta_base_cache_entry(ent, p, base_offset);
1981}
1982
1983static void clear_delta_base_cache_entry(struct delta_base_cache_entry *ent)
1984{
1985        ent->data = NULL;
1986        ent->lru.next->prev = ent->lru.prev;
1987        ent->lru.prev->next = ent->lru.next;
1988        delta_base_cached -= ent->size;
1989}
1990
1991static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
1992        unsigned long *base_size, enum object_type *type, int keep_cache)
1993{
1994        struct delta_base_cache_entry *ent;
1995        void *ret;
1996
1997        ent = get_delta_base_cache_entry(p, base_offset);
1998
1999        if (!eq_delta_base_cache_entry(ent, p, base_offset))
2000                return unpack_entry(p, base_offset, type, base_size);
2001
2002        ret = ent->data;
2003
2004        if (!keep_cache)
2005                clear_delta_base_cache_entry(ent);
2006        else
2007                ret = xmemdupz(ent->data, ent->size);
2008        *type = ent->type;
2009        *base_size = ent->size;
2010        return ret;
2011}
2012
2013static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
2014{
2015        if (ent->data) {
2016                free(ent->data);
2017                ent->data = NULL;
2018                ent->lru.next->prev = ent->lru.prev;
2019                ent->lru.prev->next = ent->lru.next;
2020                delta_base_cached -= ent->size;
2021        }
2022}
2023
2024void clear_delta_base_cache(void)
2025{
2026        unsigned long p;
2027        for (p = 0; p < MAX_DELTA_CACHE; p++)
2028                release_delta_base_cache(&delta_base_cache[p]);
2029}
2030
2031static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
2032        void *base, unsigned long base_size, enum object_type type)
2033{
2034        unsigned long hash = pack_entry_hash(p, base_offset);
2035        struct delta_base_cache_entry *ent = delta_base_cache + hash;
2036        struct delta_base_cache_lru_list *lru;
2037
2038        release_delta_base_cache(ent);
2039        delta_base_cached += base_size;
2040
2041        for (lru = delta_base_cache_lru.next;
2042             delta_base_cached > delta_base_cache_limit
2043             && lru != &delta_base_cache_lru;
2044             lru = lru->next) {
2045                struct delta_base_cache_entry *f = (void *)lru;
2046                if (f->type == OBJ_BLOB)
2047                        release_delta_base_cache(f);
2048        }
2049        for (lru = delta_base_cache_lru.next;
2050             delta_base_cached > delta_base_cache_limit
2051             && lru != &delta_base_cache_lru;
2052             lru = lru->next) {
2053                struct delta_base_cache_entry *f = (void *)lru;
2054                release_delta_base_cache(f);
2055        }
2056
2057        ent->p = p;
2058        ent->base_offset = base_offset;
2059        ent->type = type;
2060        ent->data = base;
2061        ent->size = base_size;
2062        ent->lru.next = &delta_base_cache_lru;
2063        ent->lru.prev = delta_base_cache_lru.prev;
2064        delta_base_cache_lru.prev->next = &ent->lru;
2065        delta_base_cache_lru.prev = &ent->lru;
2066}
2067
2068static void *read_object(const unsigned char *sha1, enum object_type *type,
2069                         unsigned long *size);
2070
2071static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
2072{
2073        static FILE *log_file;
2074
2075        if (!log_pack_access)
2076                log_pack_access = getenv("GIT_TRACE_PACK_ACCESS");
2077        if (!log_pack_access)
2078                log_pack_access = no_log_pack_access;
2079        if (log_pack_access == no_log_pack_access)
2080                return;
2081
2082        if (!log_file) {
2083                log_file = fopen(log_pack_access, "w");
2084                if (!log_file) {
2085                        error("cannot open pack access log '%s' for writing: %s",
2086                              log_pack_access, strerror(errno));
2087                        log_pack_access = no_log_pack_access;
2088                        return;
2089                }
2090        }
2091        fprintf(log_file, "%s %"PRIuMAX"\n",
2092                p->pack_name, (uintmax_t)obj_offset);
2093        fflush(log_file);
2094}
2095
2096int do_check_packed_object_crc;
2097
2098#define UNPACK_ENTRY_STACK_PREALLOC 64
2099struct unpack_entry_stack_ent {
2100        off_t obj_offset;
2101        off_t curpos;
2102        unsigned long size;
2103};
2104
2105void *unpack_entry(struct packed_git *p, off_t obj_offset,
2106                   enum object_type *final_type, unsigned long *final_size)
2107{
2108        struct pack_window *w_curs = NULL;
2109        off_t curpos = obj_offset;
2110        void *data = NULL;
2111        unsigned long size;
2112        enum object_type type;
2113        struct unpack_entry_stack_ent small_delta_stack[UNPACK_ENTRY_STACK_PREALLOC];
2114        struct unpack_entry_stack_ent *delta_stack = small_delta_stack;
2115        int delta_stack_nr = 0, delta_stack_alloc = UNPACK_ENTRY_STACK_PREALLOC;
2116        int base_from_cache = 0;
2117
2118        if (log_pack_access != no_log_pack_access)
2119                write_pack_access_log(p, obj_offset);
2120
2121        /* PHASE 1: drill down to the innermost base object */
2122        for (;;) {
2123                off_t base_offset;
2124                int i;
2125                struct delta_base_cache_entry *ent;
2126
2127                ent = get_delta_base_cache_entry(p, curpos);
2128                if (eq_delta_base_cache_entry(ent, p, curpos)) {
2129                        type = ent->type;
2130                        data = ent->data;
2131                        size = ent->size;
2132                        clear_delta_base_cache_entry(ent);
2133                        base_from_cache = 1;
2134                        break;
2135                }
2136
2137                if (do_check_packed_object_crc && p->index_version > 1) {
2138                        struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2139                        unsigned long len = revidx[1].offset - obj_offset;
2140                        if (check_pack_crc(p, &w_curs, obj_offset, len, revidx->nr)) {
2141                                const unsigned char *sha1 =
2142                                        nth_packed_object_sha1(p, revidx->nr);
2143                                error("bad packed object CRC for %s",
2144                                      sha1_to_hex(sha1));
2145                                mark_bad_packed_object(p, sha1);
2146                                unuse_pack(&w_curs);
2147                                return NULL;
2148                        }
2149                }
2150
2151                type = unpack_object_header(p, &w_curs, &curpos, &size);
2152                if (type != OBJ_OFS_DELTA && type != OBJ_REF_DELTA)
2153                        break;
2154
2155                base_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
2156                if (!base_offset) {
2157                        error("failed to validate delta base reference "
2158                              "at offset %"PRIuMAX" from %s",
2159                              (uintmax_t)curpos, p->pack_name);
2160                        /* bail to phase 2, in hopes of recovery */
2161                        data = NULL;
2162                        break;
2163                }
2164
2165                /* push object, proceed to base */
2166                if (delta_stack_nr >= delta_stack_alloc
2167                    && delta_stack == small_delta_stack) {
2168                        delta_stack_alloc = alloc_nr(delta_stack_nr);
2169                        delta_stack = xmalloc(sizeof(*delta_stack)*delta_stack_alloc);
2170                        memcpy(delta_stack, small_delta_stack,
2171                               sizeof(*delta_stack)*delta_stack_nr);
2172                } else {
2173                        ALLOC_GROW(delta_stack, delta_stack_nr+1, delta_stack_alloc);
2174                }
2175                i = delta_stack_nr++;
2176                delta_stack[i].obj_offset = obj_offset;
2177                delta_stack[i].curpos = curpos;
2178                delta_stack[i].size = size;
2179
2180                curpos = obj_offset = base_offset;
2181        }
2182
2183        /* PHASE 2: handle the base */
2184        switch (type) {
2185        case OBJ_OFS_DELTA:
2186        case OBJ_REF_DELTA:
2187                if (data)
2188                        die("BUG in unpack_entry: left loop at a valid delta");
2189                break;
2190        case OBJ_COMMIT:
2191        case OBJ_TREE:
2192        case OBJ_BLOB:
2193        case OBJ_TAG:
2194                if (!base_from_cache)
2195                        data = unpack_compressed_entry(p, &w_curs, curpos, size);
2196                break;
2197        default:
2198                data = NULL;
2199                error("unknown object type %i at offset %"PRIuMAX" in %s",
2200                      type, (uintmax_t)obj_offset, p->pack_name);
2201        }
2202
2203        /* PHASE 3: apply deltas in order */
2204
2205        /* invariants:
2206         *   'data' holds the base data, or NULL if there was corruption
2207         */
2208        while (delta_stack_nr) {
2209                void *delta_data;
2210                void *base = data;
2211                unsigned long delta_size, base_size = size;
2212                int i;
2213
2214                data = NULL;
2215
2216                if (base)
2217                        add_delta_base_cache(p, obj_offset, base, base_size, type);
2218
2219                if (!base) {
2220                        /*
2221                         * We're probably in deep shit, but let's try to fetch
2222                         * the required base anyway from another pack or loose.
2223                         * This is costly but should happen only in the presence
2224                         * of a corrupted pack, and is better than failing outright.
2225                         */
2226                        struct revindex_entry *revidx;
2227                        const unsigned char *base_sha1;
2228                        revidx = find_pack_revindex(p, obj_offset);
2229                        if (revidx) {
2230                                base_sha1 = nth_packed_object_sha1(p, revidx->nr);
2231                                error("failed to read delta base object %s"
2232                                      " at offset %"PRIuMAX" from %s",
2233                                      sha1_to_hex(base_sha1), (uintmax_t)obj_offset,
2234                                      p->pack_name);
2235                                mark_bad_packed_object(p, base_sha1);
2236                                base = read_object(base_sha1, &type, &base_size);
2237                        }
2238                }
2239
2240                i = --delta_stack_nr;
2241                obj_offset = delta_stack[i].obj_offset;
2242                curpos = delta_stack[i].curpos;
2243                delta_size = delta_stack[i].size;
2244
2245                if (!base)
2246                        continue;
2247
2248                delta_data = unpack_compressed_entry(p, &w_curs, curpos, delta_size);
2249
2250                if (!delta_data) {
2251                        error("failed to unpack compressed delta "
2252                              "at offset %"PRIuMAX" from %s",
2253                              (uintmax_t)curpos, p->pack_name);
2254                        data = NULL;
2255                        continue;
2256                }
2257
2258                data = patch_delta(base, base_size,
2259                                   delta_data, delta_size,
2260                                   &size);
2261
2262                /*
2263                 * We could not apply the delta; warn the user, but keep going.
2264                 * Our failure will be noticed either in the next iteration of
2265                 * the loop, or if this is the final delta, in the caller when
2266                 * we return NULL. Those code paths will take care of making
2267                 * a more explicit warning and retrying with another copy of
2268                 * the object.
2269                 */
2270                if (!data)
2271                        error("failed to apply delta");
2272
2273                free(delta_data);
2274        }
2275
2276        *final_type = type;
2277        *final_size = size;
2278
2279        unuse_pack(&w_curs);
2280        return data;
2281}
2282
2283const unsigned char *nth_packed_object_sha1(struct packed_git *p,
2284                                            uint32_t n)
2285{
2286        const unsigned char *index = p->index_data;
2287        if (!index) {
2288                if (open_pack_index(p))
2289                        return NULL;
2290                index = p->index_data;
2291        }
2292        if (n >= p->num_objects)
2293                return NULL;
2294        index += 4 * 256;
2295        if (p->index_version == 1) {
2296                return index + 24 * n + 4;
2297        } else {
2298                index += 8;
2299                return index + 20 * n;
2300        }
2301}
2302
2303off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
2304{
2305        const unsigned char *index = p->index_data;
2306        index += 4 * 256;
2307        if (p->index_version == 1) {
2308                return ntohl(*((uint32_t *)(index + 24 * n)));
2309        } else {
2310                uint32_t off;
2311                index += 8 + p->num_objects * (20 + 4);
2312                off = ntohl(*((uint32_t *)(index + 4 * n)));
2313                if (!(off & 0x80000000))
2314                        return off;
2315                index += p->num_objects * 4 + (off & 0x7fffffff) * 8;
2316                return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
2317                                   ntohl(*((uint32_t *)(index + 4)));
2318        }
2319}
2320
2321off_t find_pack_entry_one(const unsigned char *sha1,
2322                                  struct packed_git *p)
2323{
2324        const uint32_t *level1_ofs = p->index_data;
2325        const unsigned char *index = p->index_data;
2326        unsigned hi, lo, stride;
2327        static int use_lookup = -1;
2328        static int debug_lookup = -1;
2329
2330        if (debug_lookup < 0)
2331                debug_lookup = !!getenv("GIT_DEBUG_LOOKUP");
2332
2333        if (!index) {
2334                if (open_pack_index(p))
2335                        return 0;
2336                level1_ofs = p->index_data;
2337                index = p->index_data;
2338        }
2339        if (p->index_version > 1) {
2340                level1_ofs += 2;
2341                index += 8;
2342        }
2343        index += 4 * 256;
2344        hi = ntohl(level1_ofs[*sha1]);
2345        lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
2346        if (p->index_version > 1) {
2347                stride = 20;
2348        } else {
2349                stride = 24;
2350                index += 4;
2351        }
2352
2353        if (debug_lookup)
2354                printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
2355                       sha1[0], sha1[1], sha1[2], lo, hi, p->num_objects);
2356
2357        if (use_lookup < 0)
2358                use_lookup = !!getenv("GIT_USE_LOOKUP");
2359        if (use_lookup) {
2360                int pos = sha1_entry_pos(index, stride, 0,
2361                                         lo, hi, p->num_objects, sha1);
2362                if (pos < 0)
2363                        return 0;
2364                return nth_packed_object_offset(p, pos);
2365        }
2366
2367        do {
2368                unsigned mi = (lo + hi) / 2;
2369                int cmp = hashcmp(index + mi * stride, sha1);
2370
2371                if (debug_lookup)
2372                        printf("lo %u hi %u rg %u mi %u\n",
2373                               lo, hi, hi - lo, mi);
2374                if (!cmp)
2375                        return nth_packed_object_offset(p, mi);
2376                if (cmp > 0)
2377                        hi = mi;
2378                else
2379                        lo = mi+1;
2380        } while (lo < hi);
2381        return 0;
2382}
2383
2384int is_pack_valid(struct packed_git *p)
2385{
2386        /* An already open pack is known to be valid. */
2387        if (p->pack_fd != -1)
2388                return 1;
2389
2390        /* If the pack has one window completely covering the
2391         * file size, the pack is known to be valid even if
2392         * the descriptor is not currently open.
2393         */
2394        if (p->windows) {
2395                struct pack_window *w = p->windows;
2396
2397                if (!w->offset && w->len == p->pack_size)
2398                        return 1;
2399        }
2400
2401        /* Force the pack to open to prove its valid. */
2402        return !open_packed_git(p);
2403}
2404
2405static int fill_pack_entry(const unsigned char *sha1,
2406                           struct pack_entry *e,
2407                           struct packed_git *p)
2408{
2409        off_t offset;
2410
2411        if (p->num_bad_objects) {
2412                unsigned i;
2413                for (i = 0; i < p->num_bad_objects; i++)
2414                        if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
2415                                return 0;
2416        }
2417
2418        offset = find_pack_entry_one(sha1, p);
2419        if (!offset)
2420                return 0;
2421
2422        /*
2423         * We are about to tell the caller where they can locate the
2424         * requested object.  We better make sure the packfile is
2425         * still here and can be accessed before supplying that
2426         * answer, as it may have been deleted since the index was
2427         * loaded!
2428         */
2429        if (!is_pack_valid(p)) {
2430                warning("packfile %s cannot be accessed", p->pack_name);
2431                return 0;
2432        }
2433        e->offset = offset;
2434        e->p = p;
2435        hashcpy(e->sha1, sha1);
2436        return 1;
2437}
2438
2439static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e)
2440{
2441        struct packed_git *p;
2442
2443        prepare_packed_git();
2444        if (!packed_git)
2445                return 0;
2446
2447        if (last_found_pack && fill_pack_entry(sha1, e, last_found_pack))
2448                return 1;
2449
2450        for (p = packed_git; p; p = p->next) {
2451                if (p == last_found_pack || !fill_pack_entry(sha1, e, p))
2452                        continue;
2453
2454                last_found_pack = p;
2455                return 1;
2456        }
2457        return 0;
2458}
2459
2460struct packed_git *find_sha1_pack(const unsigned char *sha1,
2461                                  struct packed_git *packs)
2462{
2463        struct packed_git *p;
2464
2465        for (p = packs; p; p = p->next) {
2466                if (find_pack_entry_one(sha1, p))
2467                        return p;
2468        }
2469        return NULL;
2470
2471}
2472
2473static int sha1_loose_object_info(const unsigned char *sha1,
2474                                  struct object_info *oi)
2475{
2476        int status;
2477        unsigned long mapsize, size;
2478        void *map;
2479        git_zstream stream;
2480        char hdr[32];
2481
2482        /*
2483         * If we don't care about type or size, then we don't
2484         * need to look inside the object at all.
2485         */
2486        if (!oi->typep && !oi->sizep) {
2487                if (oi->disk_sizep) {
2488                        struct stat st;
2489                        if (stat_sha1_file(sha1, &st) < 0)
2490                                return -1;
2491                        *oi->disk_sizep = st.st_size;
2492                }
2493                return 0;
2494        }
2495
2496        map = map_sha1_file(sha1, &mapsize);
2497        if (!map)
2498                return -1;
2499        if (oi->disk_sizep)
2500                *oi->disk_sizep = mapsize;
2501        if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
2502                status = error("unable to unpack %s header",
2503                               sha1_to_hex(sha1));
2504        else if ((status = parse_sha1_header(hdr, &size)) < 0)
2505                status = error("unable to parse %s header", sha1_to_hex(sha1));
2506        else if (oi->sizep)
2507                *oi->sizep = size;
2508        git_inflate_end(&stream);
2509        munmap(map, mapsize);
2510        if (oi->typep)
2511                *oi->typep = status;
2512        return 0;
2513}
2514
2515/* returns enum object_type or negative */
2516int sha1_object_info_extended(const unsigned char *sha1, struct object_info *oi)
2517{
2518        struct cached_object *co;
2519        struct pack_entry e;
2520        int rtype;
2521
2522        co = find_cached_object(sha1);
2523        if (co) {
2524                if (oi->typep)
2525                        *(oi->typep) = co->type;
2526                if (oi->sizep)
2527                        *(oi->sizep) = co->size;
2528                if (oi->disk_sizep)
2529                        *(oi->disk_sizep) = 0;
2530                oi->whence = OI_CACHED;
2531                return 0;
2532        }
2533
2534        if (!find_pack_entry(sha1, &e)) {
2535                /* Most likely it's a loose object. */
2536                if (!sha1_loose_object_info(sha1, oi)) {
2537                        oi->whence = OI_LOOSE;
2538                        return 0;
2539                }
2540
2541                /* Not a loose object; someone else may have just packed it. */
2542                reprepare_packed_git();
2543                if (!find_pack_entry(sha1, &e))
2544                        return -1;
2545        }
2546
2547        rtype = packed_object_info(e.p, e.offset, oi);
2548        if (rtype < 0) {
2549                mark_bad_packed_object(e.p, sha1);
2550                return sha1_object_info_extended(sha1, oi);
2551        } else if (in_delta_base_cache(e.p, e.offset)) {
2552                oi->whence = OI_DBCACHED;
2553        } else {
2554                oi->whence = OI_PACKED;
2555                oi->u.packed.offset = e.offset;
2556                oi->u.packed.pack = e.p;
2557                oi->u.packed.is_delta = (rtype == OBJ_REF_DELTA ||
2558                                         rtype == OBJ_OFS_DELTA);
2559        }
2560
2561        return 0;
2562}
2563
2564int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
2565{
2566        enum object_type type;
2567        struct object_info oi = {NULL};
2568
2569        oi.typep = &type;
2570        oi.sizep = sizep;
2571        if (sha1_object_info_extended(sha1, &oi) < 0)
2572                return -1;
2573        return type;
2574}
2575
2576static void *read_packed_sha1(const unsigned char *sha1,
2577                              enum object_type *type, unsigned long *size)
2578{
2579        struct pack_entry e;
2580        void *data;
2581
2582        if (!find_pack_entry(sha1, &e))
2583                return NULL;
2584        data = cache_or_unpack_entry(e.p, e.offset, size, type, 1);
2585        if (!data) {
2586                /*
2587                 * We're probably in deep shit, but let's try to fetch
2588                 * the required object anyway from another pack or loose.
2589                 * This should happen only in the presence of a corrupted
2590                 * pack, and is better than failing outright.
2591                 */
2592                error("failed to read object %s at offset %"PRIuMAX" from %s",
2593                      sha1_to_hex(sha1), (uintmax_t)e.offset, e.p->pack_name);
2594                mark_bad_packed_object(e.p, sha1);
2595                data = read_object(sha1, type, size);
2596        }
2597        return data;
2598}
2599
2600int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
2601                      unsigned char *sha1)
2602{
2603        struct cached_object *co;
2604
2605        hash_sha1_file(buf, len, typename(type), sha1);
2606        if (has_sha1_file(sha1) || find_cached_object(sha1))
2607                return 0;
2608        if (cached_object_alloc <= cached_object_nr) {
2609                cached_object_alloc = alloc_nr(cached_object_alloc);
2610                cached_objects = xrealloc(cached_objects,
2611                                          sizeof(*cached_objects) *
2612                                          cached_object_alloc);
2613        }
2614        co = &cached_objects[cached_object_nr++];
2615        co->size = len;
2616        co->type = type;
2617        co->buf = xmalloc(len);
2618        memcpy(co->buf, buf, len);
2619        hashcpy(co->sha1, sha1);
2620        return 0;
2621}
2622
2623static void *read_object(const unsigned char *sha1, enum object_type *type,
2624                         unsigned long *size)
2625{
2626        unsigned long mapsize;
2627        void *map, *buf;
2628        struct cached_object *co;
2629
2630        co = find_cached_object(sha1);
2631        if (co) {
2632                *type = co->type;
2633                *size = co->size;
2634                return xmemdupz(co->buf, co->size);
2635        }
2636
2637        buf = read_packed_sha1(sha1, type, size);
2638        if (buf)
2639                return buf;
2640        map = map_sha1_file(sha1, &mapsize);
2641        if (map) {
2642                buf = unpack_sha1_file(map, mapsize, type, size, sha1);
2643                munmap(map, mapsize);
2644                return buf;
2645        }
2646        reprepare_packed_git();
2647        return read_packed_sha1(sha1, type, size);
2648}
2649
2650/*
2651 * This function dies on corrupt objects; the callers who want to
2652 * deal with them should arrange to call read_object() and give error
2653 * messages themselves.
2654 */
2655void *read_sha1_file_extended(const unsigned char *sha1,
2656                              enum object_type *type,
2657                              unsigned long *size,
2658                              unsigned flag)
2659{
2660        void *data;
2661        char *path;
2662        const struct packed_git *p;
2663        const unsigned char *repl = (flag & READ_SHA1_FILE_REPLACE)
2664                ? lookup_replace_object(sha1) : sha1;
2665
2666        errno = 0;
2667        data = read_object(repl, type, size);
2668        if (data)
2669                return data;
2670
2671        if (errno && errno != ENOENT)
2672                die_errno("failed to read object %s", sha1_to_hex(sha1));
2673
2674        /* die if we replaced an object with one that does not exist */
2675        if (repl != sha1)
2676                die("replacement %s not found for %s",
2677                    sha1_to_hex(repl), sha1_to_hex(sha1));
2678
2679        if (has_loose_object(repl)) {
2680                path = sha1_file_name(sha1);
2681                die("loose object %s (stored in %s) is corrupt",
2682                    sha1_to_hex(repl), path);
2683        }
2684
2685        if ((p = has_packed_and_bad(repl)) != NULL)
2686                die("packed object %s (stored in %s) is corrupt",
2687                    sha1_to_hex(repl), p->pack_name);
2688
2689        return NULL;
2690}
2691
2692void *read_object_with_reference(const unsigned char *sha1,
2693                                 const char *required_type_name,
2694                                 unsigned long *size,
2695                                 unsigned char *actual_sha1_return)
2696{
2697        enum object_type type, required_type;
2698        void *buffer;
2699        unsigned long isize;
2700        unsigned char actual_sha1[20];
2701
2702        required_type = type_from_string(required_type_name);
2703        hashcpy(actual_sha1, sha1);
2704        while (1) {
2705                int ref_length = -1;
2706                const char *ref_type = NULL;
2707
2708                buffer = read_sha1_file(actual_sha1, &type, &isize);
2709                if (!buffer)
2710                        return NULL;
2711                if (type == required_type) {
2712                        *size = isize;
2713                        if (actual_sha1_return)
2714                                hashcpy(actual_sha1_return, actual_sha1);
2715                        return buffer;
2716                }
2717                /* Handle references */
2718                else if (type == OBJ_COMMIT)
2719                        ref_type = "tree ";
2720                else if (type == OBJ_TAG)
2721                        ref_type = "object ";
2722                else {
2723                        free(buffer);
2724                        return NULL;
2725                }
2726                ref_length = strlen(ref_type);
2727
2728                if (ref_length + 40 > isize ||
2729                    memcmp(buffer, ref_type, ref_length) ||
2730                    get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
2731                        free(buffer);
2732                        return NULL;
2733                }
2734                free(buffer);
2735                /* Now we have the ID of the referred-to object in
2736                 * actual_sha1.  Check again. */
2737        }
2738}
2739
2740static void write_sha1_file_prepare(const void *buf, unsigned long len,
2741                                    const char *type, unsigned char *sha1,
2742                                    char *hdr, int *hdrlen)
2743{
2744        git_SHA_CTX c;
2745
2746        /* Generate the header */
2747        *hdrlen = sprintf(hdr, "%s %lu", type, len)+1;
2748
2749        /* Sha1.. */
2750        git_SHA1_Init(&c);
2751        git_SHA1_Update(&c, hdr, *hdrlen);
2752        git_SHA1_Update(&c, buf, len);
2753        git_SHA1_Final(sha1, &c);
2754}
2755
2756/*
2757 * Move the just written object into its final resting place.
2758 * NEEDSWORK: this should be renamed to finalize_temp_file() as
2759 * "moving" is only a part of what it does, when no patch between
2760 * master to pu changes the call sites of this function.
2761 */
2762int move_temp_to_file(const char *tmpfile, const char *filename)
2763{
2764        int ret = 0;
2765
2766        if (object_creation_mode == OBJECT_CREATION_USES_RENAMES)
2767                goto try_rename;
2768        else if (link(tmpfile, filename))
2769                ret = errno;
2770
2771        /*
2772         * Coda hack - coda doesn't like cross-directory links,
2773         * so we fall back to a rename, which will mean that it
2774         * won't be able to check collisions, but that's not a
2775         * big deal.
2776         *
2777         * The same holds for FAT formatted media.
2778         *
2779         * When this succeeds, we just return.  We have nothing
2780         * left to unlink.
2781         */
2782        if (ret && ret != EEXIST) {
2783        try_rename:
2784                if (!rename(tmpfile, filename))
2785                        goto out;
2786                ret = errno;
2787        }
2788        unlink_or_warn(tmpfile);
2789        if (ret) {
2790                if (ret != EEXIST) {
2791                        return error("unable to write sha1 filename %s: %s", filename, strerror(ret));
2792                }
2793                /* FIXME!!! Collision check here ? */
2794        }
2795
2796out:
2797        if (adjust_shared_perm(filename))
2798                return error("unable to set permission to '%s'", filename);
2799        return 0;
2800}
2801
2802static int write_buffer(int fd, const void *buf, size_t len)
2803{
2804        if (write_in_full(fd, buf, len) < 0)
2805                return error("file write error (%s)", strerror(errno));
2806        return 0;
2807}
2808
2809int hash_sha1_file(const void *buf, unsigned long len, const char *type,
2810                   unsigned char *sha1)
2811{
2812        char hdr[32];
2813        int hdrlen;
2814        write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2815        return 0;
2816}
2817
2818/* Finalize a file on disk, and close it. */
2819static void close_sha1_file(int fd)
2820{
2821        if (fsync_object_files)
2822                fsync_or_die(fd, "sha1 file");
2823        if (close(fd) != 0)
2824                die_errno("error when closing sha1 file");
2825}
2826
2827/* Size of directory component, including the ending '/' */
2828static inline int directory_size(const char *filename)
2829{
2830        const char *s = strrchr(filename, '/');
2831        if (!s)
2832                return 0;
2833        return s - filename + 1;
2834}
2835
2836/*
2837 * This creates a temporary file in the same directory as the final
2838 * 'filename'
2839 *
2840 * We want to avoid cross-directory filename renames, because those
2841 * can have problems on various filesystems (FAT, NFS, Coda).
2842 */
2843static int create_tmpfile(char *buffer, size_t bufsiz, const char *filename)
2844{
2845        int fd, dirlen = directory_size(filename);
2846
2847        if (dirlen + 20 > bufsiz) {
2848                errno = ENAMETOOLONG;
2849                return -1;
2850        }
2851        memcpy(buffer, filename, dirlen);
2852        strcpy(buffer + dirlen, "tmp_obj_XXXXXX");
2853        fd = git_mkstemp_mode(buffer, 0444);
2854        if (fd < 0 && dirlen && errno == ENOENT) {
2855                /* Make sure the directory exists */
2856                memcpy(buffer, filename, dirlen);
2857                buffer[dirlen-1] = 0;
2858                if (mkdir(buffer, 0777) || adjust_shared_perm(buffer))
2859                        return -1;
2860
2861                /* Try again */
2862                strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX");
2863                fd = git_mkstemp_mode(buffer, 0444);
2864        }
2865        return fd;
2866}
2867
2868static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
2869                              const void *buf, unsigned long len, time_t mtime)
2870{
2871        int fd, ret;
2872        unsigned char compressed[4096];
2873        git_zstream stream;
2874        git_SHA_CTX c;
2875        unsigned char parano_sha1[20];
2876        char *filename;
2877        static char tmp_file[PATH_MAX];
2878
2879        filename = sha1_file_name(sha1);
2880        fd = create_tmpfile(tmp_file, sizeof(tmp_file), filename);
2881        if (fd < 0) {
2882                if (errno == EACCES)
2883                        return error("insufficient permission for adding an object to repository database %s", get_object_directory());
2884                else
2885                        return error("unable to create temporary file: %s", strerror(errno));
2886        }
2887
2888        /* Set it up */
2889        memset(&stream, 0, sizeof(stream));
2890        git_deflate_init(&stream, zlib_compression_level);
2891        stream.next_out = compressed;
2892        stream.avail_out = sizeof(compressed);
2893        git_SHA1_Init(&c);
2894
2895        /* First header.. */
2896        stream.next_in = (unsigned char *)hdr;
2897        stream.avail_in = hdrlen;
2898        while (git_deflate(&stream, 0) == Z_OK)
2899                ; /* nothing */
2900        git_SHA1_Update(&c, hdr, hdrlen);
2901
2902        /* Then the data itself.. */
2903        stream.next_in = (void *)buf;
2904        stream.avail_in = len;
2905        do {
2906                unsigned char *in0 = stream.next_in;
2907                ret = git_deflate(&stream, Z_FINISH);
2908                git_SHA1_Update(&c, in0, stream.next_in - in0);
2909                if (write_buffer(fd, compressed, stream.next_out - compressed) < 0)
2910                        die("unable to write sha1 file");
2911                stream.next_out = compressed;
2912                stream.avail_out = sizeof(compressed);
2913        } while (ret == Z_OK);
2914
2915        if (ret != Z_STREAM_END)
2916                die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
2917        ret = git_deflate_end_gently(&stream);
2918        if (ret != Z_OK)
2919                die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
2920        git_SHA1_Final(parano_sha1, &c);
2921        if (hashcmp(sha1, parano_sha1) != 0)
2922                die("confused by unstable object source data for %s", sha1_to_hex(sha1));
2923
2924        close_sha1_file(fd);
2925
2926        if (mtime) {
2927                struct utimbuf utb;
2928                utb.actime = mtime;
2929                utb.modtime = mtime;
2930                if (utime(tmp_file, &utb) < 0)
2931                        warning("failed utime() on %s: %s",
2932                                tmp_file, strerror(errno));
2933        }
2934
2935        return move_temp_to_file(tmp_file, filename);
2936}
2937
2938int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2939{
2940        unsigned char sha1[20];
2941        char hdr[32];
2942        int hdrlen;
2943
2944        /* Normally if we have it in the pack then we do not bother writing
2945         * it out into .git/objects/??/?{38} file.
2946         */
2947        write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2948        if (returnsha1)
2949                hashcpy(returnsha1, sha1);
2950        if (has_sha1_file(sha1))
2951                return 0;
2952        return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
2953}
2954
2955int force_object_loose(const unsigned char *sha1, time_t mtime)
2956{
2957        void *buf;
2958        unsigned long len;
2959        enum object_type type;
2960        char hdr[32];
2961        int hdrlen;
2962        int ret;
2963
2964        if (has_loose_object(sha1))
2965                return 0;
2966        buf = read_packed_sha1(sha1, &type, &len);
2967        if (!buf)
2968                return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
2969        hdrlen = sprintf(hdr, "%s %lu", typename(type), len) + 1;
2970        ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
2971        free(buf);
2972
2973        return ret;
2974}
2975
2976int has_pack_index(const unsigned char *sha1)
2977{
2978        struct stat st;
2979        if (stat(sha1_pack_index_name(sha1), &st))
2980                return 0;
2981        return 1;
2982}
2983
2984int has_sha1_pack(const unsigned char *sha1)
2985{
2986        struct pack_entry e;
2987        return find_pack_entry(sha1, &e);
2988}
2989
2990int has_sha1_file(const unsigned char *sha1)
2991{
2992        struct pack_entry e;
2993
2994        if (find_pack_entry(sha1, &e))
2995                return 1;
2996        if (has_loose_object(sha1))
2997                return 1;
2998        reprepare_packed_git();
2999        return find_pack_entry(sha1, &e);
3000}
3001
3002static void check_tree(const void *buf, size_t size)
3003{
3004        struct tree_desc desc;
3005        struct name_entry entry;
3006
3007        init_tree_desc(&desc, buf, size);
3008        while (tree_entry(&desc, &entry))
3009                /* do nothing
3010                 * tree_entry() will die() on malformed entries */
3011                ;
3012}
3013
3014static void check_commit(const void *buf, size_t size)
3015{
3016        struct commit c;
3017        memset(&c, 0, sizeof(c));
3018        if (parse_commit_buffer(&c, buf, size))
3019                die("corrupt commit");
3020}
3021
3022static void check_tag(const void *buf, size_t size)
3023{
3024        struct tag t;
3025        memset(&t, 0, sizeof(t));
3026        if (parse_tag_buffer(&t, buf, size))
3027                die("corrupt tag");
3028}
3029
3030static int index_mem(unsigned char *sha1, void *buf, size_t size,
3031                     enum object_type type,
3032                     const char *path, unsigned flags)
3033{
3034        int ret, re_allocated = 0;
3035        int write_object = flags & HASH_WRITE_OBJECT;
3036
3037        if (!type)
3038                type = OBJ_BLOB;
3039
3040        /*
3041         * Convert blobs to git internal format
3042         */
3043        if ((type == OBJ_BLOB) && path) {
3044                struct strbuf nbuf = STRBUF_INIT;
3045                if (convert_to_git(path, buf, size, &nbuf,
3046                                   write_object ? safe_crlf : SAFE_CRLF_FALSE)) {
3047                        buf = strbuf_detach(&nbuf, &size);
3048                        re_allocated = 1;
3049                }
3050        }
3051        if (flags & HASH_FORMAT_CHECK) {
3052                if (type == OBJ_TREE)
3053                        check_tree(buf, size);
3054                if (type == OBJ_COMMIT)
3055                        check_commit(buf, size);
3056                if (type == OBJ_TAG)
3057                        check_tag(buf, size);
3058        }
3059
3060        if (write_object)
3061                ret = write_sha1_file(buf, size, typename(type), sha1);
3062        else
3063                ret = hash_sha1_file(buf, size, typename(type), sha1);
3064        if (re_allocated)
3065                free(buf);
3066        return ret;
3067}
3068
3069static int index_pipe(unsigned char *sha1, int fd, enum object_type type,
3070                      const char *path, unsigned flags)
3071{
3072        struct strbuf sbuf = STRBUF_INIT;
3073        int ret;
3074
3075        if (strbuf_read(&sbuf, fd, 4096) >= 0)
3076                ret = index_mem(sha1, sbuf.buf, sbuf.len, type, path, flags);
3077        else
3078                ret = -1;
3079        strbuf_release(&sbuf);
3080        return ret;
3081}
3082
3083#define SMALL_FILE_SIZE (32*1024)
3084
3085static int index_core(unsigned char *sha1, int fd, size_t size,
3086                      enum object_type type, const char *path,
3087                      unsigned flags)
3088{
3089        int ret;
3090
3091        if (!size) {
3092                ret = index_mem(sha1, NULL, size, type, path, flags);
3093        } else if (size <= SMALL_FILE_SIZE) {
3094                char *buf = xmalloc(size);
3095                if (size == read_in_full(fd, buf, size))
3096                        ret = index_mem(sha1, buf, size, type, path, flags);
3097                else
3098                        ret = error("short read %s", strerror(errno));
3099                free(buf);
3100        } else {
3101                void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
3102                ret = index_mem(sha1, buf, size, type, path, flags);
3103                munmap(buf, size);
3104        }
3105        return ret;
3106}
3107
3108/*
3109 * This creates one packfile per large blob unless bulk-checkin
3110 * machinery is "plugged".
3111 *
3112 * This also bypasses the usual "convert-to-git" dance, and that is on
3113 * purpose. We could write a streaming version of the converting
3114 * functions and insert that before feeding the data to fast-import
3115 * (or equivalent in-core API described above). However, that is
3116 * somewhat complicated, as we do not know the size of the filter
3117 * result, which we need to know beforehand when writing a git object.
3118 * Since the primary motivation for trying to stream from the working
3119 * tree file and to avoid mmaping it in core is to deal with large
3120 * binary blobs, they generally do not want to get any conversion, and
3121 * callers should avoid this code path when filters are requested.
3122 */
3123static int index_stream(unsigned char *sha1, int fd, size_t size,
3124                        enum object_type type, const char *path,
3125                        unsigned flags)
3126{
3127        return index_bulk_checkin(sha1, fd, size, type, path, flags);
3128}
3129
3130int index_fd(unsigned char *sha1, int fd, struct stat *st,
3131             enum object_type type, const char *path, unsigned flags)
3132{
3133        int ret;
3134        size_t size = xsize_t(st->st_size);
3135
3136        if (!S_ISREG(st->st_mode))
3137                ret = index_pipe(sha1, fd, type, path, flags);
3138        else if (size <= big_file_threshold || type != OBJ_BLOB ||
3139                 (path && would_convert_to_git(path, NULL, 0, 0)))
3140                ret = index_core(sha1, fd, size, type, path, flags);
3141        else
3142                ret = index_stream(sha1, fd, size, type, path, flags);
3143        close(fd);
3144        return ret;
3145}
3146
3147int index_path(unsigned char *sha1, const char *path, struct stat *st, unsigned flags)
3148{
3149        int fd;
3150        struct strbuf sb = STRBUF_INIT;
3151
3152        switch (st->st_mode & S_IFMT) {
3153        case S_IFREG:
3154                fd = open(path, O_RDONLY);
3155                if (fd < 0)
3156                        return error("open(\"%s\"): %s", path,
3157                                     strerror(errno));
3158                if (index_fd(sha1, fd, st, OBJ_BLOB, path, flags) < 0)
3159                        return error("%s: failed to insert into database",
3160                                     path);
3161                break;
3162        case S_IFLNK:
3163                if (strbuf_readlink(&sb, path, st->st_size)) {
3164                        char *errstr = strerror(errno);
3165                        return error("readlink(\"%s\"): %s", path,
3166                                     errstr);
3167                }
3168                if (!(flags & HASH_WRITE_OBJECT))
3169                        hash_sha1_file(sb.buf, sb.len, blob_type, sha1);
3170                else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1))
3171                        return error("%s: failed to insert into database",
3172                                     path);
3173                strbuf_release(&sb);
3174                break;
3175        case S_IFDIR:
3176                return resolve_gitlink_ref(path, "HEAD", sha1);
3177        default:
3178                return error("%s: unsupported file type", path);
3179        }
3180        return 0;
3181}
3182
3183int read_pack_header(int fd, struct pack_header *header)
3184{
3185        if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
3186                /* "eof before pack header was fully read" */
3187                return PH_ERROR_EOF;
3188
3189        if (header->hdr_signature != htonl(PACK_SIGNATURE))
3190                /* "protocol error (pack signature mismatch detected)" */
3191                return PH_ERROR_PACK_SIGNATURE;
3192        if (!pack_version_ok(header->hdr_version))
3193                /* "protocol error (pack version unsupported)" */
3194                return PH_ERROR_PROTOCOL;
3195        return 0;
3196}
3197
3198void assert_sha1_type(const unsigned char *sha1, enum object_type expect)
3199{
3200        enum object_type type = sha1_object_info(sha1, NULL);
3201        if (type < 0)
3202                die("%s is not a valid object", sha1_to_hex(sha1));
3203        if (type != expect)
3204                die("%s is not a valid '%s' object", sha1_to_hex(sha1),
3205                    typename(expect));
3206}