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