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