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