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