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