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