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