b284cea8fb12b1407c275ecfbcbcaf8df2ede6a7
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->base;
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 (path->len == alt->name - alt->base - 1 &&
265 !memcmp(path->buf, alt->base, path->len))
266 return 0;
267 }
268 if (!fspathcmp(path->buf, normalized_objdir))
269 return 0;
270
271 return 1;
272}
273
274/*
275 * Prepare alternate object database registry.
276 *
277 * The variable alt_odb_list points at the list of struct
278 * alternate_object_database. The elements on this list come from
279 * non-empty elements from colon separated ALTERNATE_DB_ENVIRONMENT
280 * environment variable, and $GIT_OBJECT_DIRECTORY/info/alternates,
281 * whose contents is similar to that environment variable but can be
282 * LF separated. Its base points at a statically allocated buffer that
283 * contains "/the/directory/corresponding/to/.git/objects/...", while
284 * its name points just after the slash at the end of ".git/objects/"
285 * in the example above, and has enough space to hold 40-byte hex
286 * SHA1, an extra slash for the first level indirection, and the
287 * terminating NUL.
288 */
289static int link_alt_odb_entry(const char *entry, const char *relative_base,
290 int depth, const char *normalized_objdir)
291{
292 struct alternate_object_database *ent;
293 struct strbuf pathbuf = STRBUF_INIT;
294
295 if (!is_absolute_path(entry) && relative_base) {
296 strbuf_addstr(&pathbuf, real_path(relative_base));
297 strbuf_addch(&pathbuf, '/');
298 }
299 strbuf_addstr(&pathbuf, entry);
300
301 if (strbuf_normalize_path(&pathbuf) < 0) {
302 error("unable to normalize alternate object path: %s",
303 pathbuf.buf);
304 strbuf_release(&pathbuf);
305 return -1;
306 }
307
308 /*
309 * The trailing slash after the directory name is given by
310 * this function at the end. Remove duplicates.
311 */
312 while (pathbuf.len && pathbuf.buf[pathbuf.len - 1] == '/')
313 strbuf_setlen(&pathbuf, pathbuf.len - 1);
314
315 if (!alt_odb_usable(&pathbuf, normalized_objdir)) {
316 strbuf_release(&pathbuf);
317 return -1;
318 }
319
320 ent = alloc_alt_odb(pathbuf.buf);
321
322 /* add the alternate entry */
323 *alt_odb_tail = ent;
324 alt_odb_tail = &(ent->next);
325 ent->next = NULL;
326
327 /* recursively add alternates */
328 read_info_alternates(pathbuf.buf, depth + 1);
329
330 strbuf_release(&pathbuf);
331 return 0;
332}
333
334static void link_alt_odb_entries(const char *alt, int len, int sep,
335 const char *relative_base, int depth)
336{
337 struct string_list entries = STRING_LIST_INIT_NODUP;
338 char *alt_copy;
339 int i;
340 struct strbuf objdirbuf = STRBUF_INIT;
341
342 if (depth > 5) {
343 error("%s: ignoring alternate object stores, nesting too deep.",
344 relative_base);
345 return;
346 }
347
348 strbuf_add_absolute_path(&objdirbuf, get_object_directory());
349 if (strbuf_normalize_path(&objdirbuf) < 0)
350 die("unable to normalize object directory: %s",
351 objdirbuf.buf);
352
353 alt_copy = xmemdupz(alt, len);
354 string_list_split_in_place(&entries, alt_copy, sep, -1);
355 for (i = 0; i < entries.nr; i++) {
356 const char *entry = entries.items[i].string;
357 if (entry[0] == '\0' || entry[0] == '#')
358 continue;
359 if (!is_absolute_path(entry) && depth) {
360 error("%s: ignoring relative alternate object store %s",
361 relative_base, entry);
362 } else {
363 link_alt_odb_entry(entry, relative_base, depth, objdirbuf.buf);
364 }
365 }
366 string_list_clear(&entries, 0);
367 free(alt_copy);
368 strbuf_release(&objdirbuf);
369}
370
371void read_info_alternates(const char * relative_base, int depth)
372{
373 char *map;
374 size_t mapsz;
375 struct stat st;
376 char *path;
377 int fd;
378
379 path = xstrfmt("%s/info/alternates", relative_base);
380 fd = git_open_noatime(path);
381 free(path);
382 if (fd < 0)
383 return;
384 if (fstat(fd, &st) || (st.st_size == 0)) {
385 close(fd);
386 return;
387 }
388 mapsz = xsize_t(st.st_size);
389 map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
390 close(fd);
391
392 link_alt_odb_entries(map, mapsz, '\n', relative_base, depth);
393
394 munmap(map, mapsz);
395}
396
397struct alternate_object_database *alloc_alt_odb(const char *dir)
398{
399 struct alternate_object_database *ent;
400 size_t dirlen = strlen(dir);
401 size_t entlen;
402
403 entlen = st_add(dirlen, 43); /* '/' + 2 hex + '/' + 38 hex + NUL */
404 ent = xmalloc(st_add(sizeof(*ent), entlen));
405 memcpy(ent->base, dir, dirlen);
406
407 ent->name = ent->base + dirlen + 1;
408 ent->base[dirlen] = '/';
409 ent->base[dirlen + 3] = '/';
410 ent->base[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 alt->name[-1] = 0;
1490 prepare_packed_git_one(alt->base, 0);
1491 alt->name[-1] = '/';
1492 }
1493 rearrange_packed_git();
1494 prepare_packed_git_mru();
1495 prepare_packed_git_run_once = 1;
1496}
1497
1498void reprepare_packed_git(void)
1499{
1500 prepare_packed_git_run_once = 0;
1501 prepare_packed_git();
1502}
1503
1504static void mark_bad_packed_object(struct packed_git *p,
1505 const unsigned char *sha1)
1506{
1507 unsigned i;
1508 for (i = 0; i < p->num_bad_objects; i++)
1509 if (!hashcmp(sha1, p->bad_object_sha1 + GIT_SHA1_RAWSZ * i))
1510 return;
1511 p->bad_object_sha1 = xrealloc(p->bad_object_sha1,
1512 st_mult(GIT_SHA1_RAWSZ,
1513 st_add(p->num_bad_objects, 1)));
1514 hashcpy(p->bad_object_sha1 + GIT_SHA1_RAWSZ * p->num_bad_objects, sha1);
1515 p->num_bad_objects++;
1516}
1517
1518static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1519{
1520 struct packed_git *p;
1521 unsigned i;
1522
1523 for (p = packed_git; p; p = p->next)
1524 for (i = 0; i < p->num_bad_objects; i++)
1525 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1526 return p;
1527 return NULL;
1528}
1529
1530/*
1531 * With an in-core object data in "map", rehash it to make sure the
1532 * object name actually matches "sha1" to detect object corruption.
1533 * With "map" == NULL, try reading the object named with "sha1" using
1534 * the streaming interface and rehash it to do the same.
1535 */
1536int check_sha1_signature(const unsigned char *sha1, void *map,
1537 unsigned long size, const char *type)
1538{
1539 unsigned char real_sha1[20];
1540 enum object_type obj_type;
1541 struct git_istream *st;
1542 git_SHA_CTX c;
1543 char hdr[32];
1544 int hdrlen;
1545
1546 if (map) {
1547 hash_sha1_file(map, size, type, real_sha1);
1548 return hashcmp(sha1, real_sha1) ? -1 : 0;
1549 }
1550
1551 st = open_istream(sha1, &obj_type, &size, NULL);
1552 if (!st)
1553 return -1;
1554
1555 /* Generate the header */
1556 hdrlen = xsnprintf(hdr, sizeof(hdr), "%s %lu", typename(obj_type), size) + 1;
1557
1558 /* Sha1.. */
1559 git_SHA1_Init(&c);
1560 git_SHA1_Update(&c, hdr, hdrlen);
1561 for (;;) {
1562 char buf[1024 * 16];
1563 ssize_t readlen = read_istream(st, buf, sizeof(buf));
1564
1565 if (readlen < 0) {
1566 close_istream(st);
1567 return -1;
1568 }
1569 if (!readlen)
1570 break;
1571 git_SHA1_Update(&c, buf, readlen);
1572 }
1573 git_SHA1_Final(real_sha1, &c);
1574 close_istream(st);
1575 return hashcmp(sha1, real_sha1) ? -1 : 0;
1576}
1577
1578int git_open_noatime(const char *name)
1579{
1580 static int sha1_file_open_flag = O_NOATIME;
1581
1582 for (;;) {
1583 int fd;
1584
1585 errno = 0;
1586 fd = open(name, O_RDONLY | sha1_file_open_flag);
1587 if (fd >= 0)
1588 return fd;
1589
1590 /* Might the failure be due to O_NOATIME? */
1591 if (errno != ENOENT && sha1_file_open_flag) {
1592 sha1_file_open_flag = 0;
1593 continue;
1594 }
1595
1596 return -1;
1597 }
1598}
1599
1600static int stat_sha1_file(const unsigned char *sha1, struct stat *st)
1601{
1602 struct alternate_object_database *alt;
1603
1604 if (!lstat(sha1_file_name(sha1), st))
1605 return 0;
1606
1607 prepare_alt_odb();
1608 errno = ENOENT;
1609 for (alt = alt_odb_list; alt; alt = alt->next) {
1610 const char *path = alt_sha1_path(alt, sha1);
1611 if (!lstat(path, st))
1612 return 0;
1613 }
1614
1615 return -1;
1616}
1617
1618static int open_sha1_file(const unsigned char *sha1)
1619{
1620 int fd;
1621 struct alternate_object_database *alt;
1622 int most_interesting_errno;
1623
1624 fd = git_open_noatime(sha1_file_name(sha1));
1625 if (fd >= 0)
1626 return fd;
1627 most_interesting_errno = errno;
1628
1629 prepare_alt_odb();
1630 for (alt = alt_odb_list; alt; alt = alt->next) {
1631 const char *path = alt_sha1_path(alt, sha1);
1632 fd = git_open_noatime(path);
1633 if (fd >= 0)
1634 return fd;
1635 if (most_interesting_errno == ENOENT)
1636 most_interesting_errno = errno;
1637 }
1638 errno = most_interesting_errno;
1639 return -1;
1640}
1641
1642void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1643{
1644 void *map;
1645 int fd;
1646
1647 fd = open_sha1_file(sha1);
1648 map = NULL;
1649 if (fd >= 0) {
1650 struct stat st;
1651
1652 if (!fstat(fd, &st)) {
1653 *size = xsize_t(st.st_size);
1654 if (!*size) {
1655 /* mmap() is forbidden on empty files */
1656 error("object file %s is empty", sha1_file_name(sha1));
1657 return NULL;
1658 }
1659 map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1660 }
1661 close(fd);
1662 }
1663 return map;
1664}
1665
1666unsigned long unpack_object_header_buffer(const unsigned char *buf,
1667 unsigned long len, enum object_type *type, unsigned long *sizep)
1668{
1669 unsigned shift;
1670 unsigned long size, c;
1671 unsigned long used = 0;
1672
1673 c = buf[used++];
1674 *type = (c >> 4) & 7;
1675 size = c & 15;
1676 shift = 4;
1677 while (c & 0x80) {
1678 if (len <= used || bitsizeof(long) <= shift) {
1679 error("bad object header");
1680 size = used = 0;
1681 break;
1682 }
1683 c = buf[used++];
1684 size += (c & 0x7f) << shift;
1685 shift += 7;
1686 }
1687 *sizep = size;
1688 return used;
1689}
1690
1691static int unpack_sha1_short_header(git_zstream *stream,
1692 unsigned char *map, unsigned long mapsize,
1693 void *buffer, unsigned long bufsiz)
1694{
1695 /* Get the data stream */
1696 memset(stream, 0, sizeof(*stream));
1697 stream->next_in = map;
1698 stream->avail_in = mapsize;
1699 stream->next_out = buffer;
1700 stream->avail_out = bufsiz;
1701
1702 git_inflate_init(stream);
1703 return git_inflate(stream, 0);
1704}
1705
1706int unpack_sha1_header(git_zstream *stream,
1707 unsigned char *map, unsigned long mapsize,
1708 void *buffer, unsigned long bufsiz)
1709{
1710 int status = unpack_sha1_short_header(stream, map, mapsize,
1711 buffer, bufsiz);
1712
1713 if (status < Z_OK)
1714 return status;
1715
1716 /* Make sure we have the terminating NUL */
1717 if (!memchr(buffer, '\0', stream->next_out - (unsigned char *)buffer))
1718 return -1;
1719 return 0;
1720}
1721
1722static int unpack_sha1_header_to_strbuf(git_zstream *stream, unsigned char *map,
1723 unsigned long mapsize, void *buffer,
1724 unsigned long bufsiz, struct strbuf *header)
1725{
1726 int status;
1727
1728 status = unpack_sha1_short_header(stream, map, mapsize, buffer, bufsiz);
1729 if (status < Z_OK)
1730 return -1;
1731
1732 /*
1733 * Check if entire header is unpacked in the first iteration.
1734 */
1735 if (memchr(buffer, '\0', stream->next_out - (unsigned char *)buffer))
1736 return 0;
1737
1738 /*
1739 * buffer[0..bufsiz] was not large enough. Copy the partial
1740 * result out to header, and then append the result of further
1741 * reading the stream.
1742 */
1743 strbuf_add(header, buffer, stream->next_out - (unsigned char *)buffer);
1744 stream->next_out = buffer;
1745 stream->avail_out = bufsiz;
1746
1747 do {
1748 status = git_inflate(stream, 0);
1749 strbuf_add(header, buffer, stream->next_out - (unsigned char *)buffer);
1750 if (memchr(buffer, '\0', stream->next_out - (unsigned char *)buffer))
1751 return 0;
1752 stream->next_out = buffer;
1753 stream->avail_out = bufsiz;
1754 } while (status != Z_STREAM_END);
1755 return -1;
1756}
1757
1758static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1759{
1760 int bytes = strlen(buffer) + 1;
1761 unsigned char *buf = xmallocz(size);
1762 unsigned long n;
1763 int status = Z_OK;
1764
1765 n = stream->total_out - bytes;
1766 if (n > size)
1767 n = size;
1768 memcpy(buf, (char *) buffer + bytes, n);
1769 bytes = n;
1770 if (bytes <= size) {
1771 /*
1772 * The above condition must be (bytes <= size), not
1773 * (bytes < size). In other words, even though we
1774 * expect no more output and set avail_out to zero,
1775 * the input zlib stream may have bytes that express
1776 * "this concludes the stream", and we *do* want to
1777 * eat that input.
1778 *
1779 * Otherwise we would not be able to test that we
1780 * consumed all the input to reach the expected size;
1781 * we also want to check that zlib tells us that all
1782 * went well with status == Z_STREAM_END at the end.
1783 */
1784 stream->next_out = buf + bytes;
1785 stream->avail_out = size - bytes;
1786 while (status == Z_OK)
1787 status = git_inflate(stream, Z_FINISH);
1788 }
1789 if (status == Z_STREAM_END && !stream->avail_in) {
1790 git_inflate_end(stream);
1791 return buf;
1792 }
1793
1794 if (status < 0)
1795 error("corrupt loose object '%s'", sha1_to_hex(sha1));
1796 else if (stream->avail_in)
1797 error("garbage at end of loose object '%s'",
1798 sha1_to_hex(sha1));
1799 free(buf);
1800 return NULL;
1801}
1802
1803/*
1804 * We used to just use "sscanf()", but that's actually way
1805 * too permissive for what we want to check. So do an anal
1806 * object header parse by hand.
1807 */
1808static int parse_sha1_header_extended(const char *hdr, struct object_info *oi,
1809 unsigned int flags)
1810{
1811 const char *type_buf = hdr;
1812 unsigned long size;
1813 int type, type_len = 0;
1814
1815 /*
1816 * The type can be of any size but is followed by
1817 * a space.
1818 */
1819 for (;;) {
1820 char c = *hdr++;
1821 if (!c)
1822 return -1;
1823 if (c == ' ')
1824 break;
1825 type_len++;
1826 }
1827
1828 type = type_from_string_gently(type_buf, type_len, 1);
1829 if (oi->typename)
1830 strbuf_add(oi->typename, type_buf, type_len);
1831 /*
1832 * Set type to 0 if its an unknown object and
1833 * we're obtaining the type using '--allow-unknown-type'
1834 * option.
1835 */
1836 if ((flags & LOOKUP_UNKNOWN_OBJECT) && (type < 0))
1837 type = 0;
1838 else if (type < 0)
1839 die("invalid object type");
1840 if (oi->typep)
1841 *oi->typep = type;
1842
1843 /*
1844 * The length must follow immediately, and be in canonical
1845 * decimal format (ie "010" is not valid).
1846 */
1847 size = *hdr++ - '0';
1848 if (size > 9)
1849 return -1;
1850 if (size) {
1851 for (;;) {
1852 unsigned long c = *hdr - '0';
1853 if (c > 9)
1854 break;
1855 hdr++;
1856 size = size * 10 + c;
1857 }
1858 }
1859
1860 if (oi->sizep)
1861 *oi->sizep = size;
1862
1863 /*
1864 * The length must be followed by a zero byte
1865 */
1866 return *hdr ? -1 : type;
1867}
1868
1869int parse_sha1_header(const char *hdr, unsigned long *sizep)
1870{
1871 struct object_info oi;
1872
1873 oi.sizep = sizep;
1874 oi.typename = NULL;
1875 oi.typep = NULL;
1876 return parse_sha1_header_extended(hdr, &oi, LOOKUP_REPLACE_OBJECT);
1877}
1878
1879static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1880{
1881 int ret;
1882 git_zstream stream;
1883 char hdr[8192];
1884
1885 ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1886 if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1887 return NULL;
1888
1889 return unpack_sha1_rest(&stream, hdr, *size, sha1);
1890}
1891
1892unsigned long get_size_from_delta(struct packed_git *p,
1893 struct pack_window **w_curs,
1894 off_t curpos)
1895{
1896 const unsigned char *data;
1897 unsigned char delta_head[20], *in;
1898 git_zstream stream;
1899 int st;
1900
1901 memset(&stream, 0, sizeof(stream));
1902 stream.next_out = delta_head;
1903 stream.avail_out = sizeof(delta_head);
1904
1905 git_inflate_init(&stream);
1906 do {
1907 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1908 stream.next_in = in;
1909 st = git_inflate(&stream, Z_FINISH);
1910 curpos += stream.next_in - in;
1911 } while ((st == Z_OK || st == Z_BUF_ERROR) &&
1912 stream.total_out < sizeof(delta_head));
1913 git_inflate_end(&stream);
1914 if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
1915 error("delta data unpack-initial failed");
1916 return 0;
1917 }
1918
1919 /* Examine the initial part of the delta to figure out
1920 * the result size.
1921 */
1922 data = delta_head;
1923
1924 /* ignore base size */
1925 get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1926
1927 /* Read the result size */
1928 return get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1929}
1930
1931static off_t get_delta_base(struct packed_git *p,
1932 struct pack_window **w_curs,
1933 off_t *curpos,
1934 enum object_type type,
1935 off_t delta_obj_offset)
1936{
1937 unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1938 off_t base_offset;
1939
1940 /* use_pack() assured us we have [base_info, base_info + 20)
1941 * as a range that we can look at without walking off the
1942 * end of the mapped window. Its actually the hash size
1943 * that is assured. An OFS_DELTA longer than the hash size
1944 * is stupid, as then a REF_DELTA would be smaller to store.
1945 */
1946 if (type == OBJ_OFS_DELTA) {
1947 unsigned used = 0;
1948 unsigned char c = base_info[used++];
1949 base_offset = c & 127;
1950 while (c & 128) {
1951 base_offset += 1;
1952 if (!base_offset || MSB(base_offset, 7))
1953 return 0; /* overflow */
1954 c = base_info[used++];
1955 base_offset = (base_offset << 7) + (c & 127);
1956 }
1957 base_offset = delta_obj_offset - base_offset;
1958 if (base_offset <= 0 || base_offset >= delta_obj_offset)
1959 return 0; /* out of bound */
1960 *curpos += used;
1961 } else if (type == OBJ_REF_DELTA) {
1962 /* The base entry _must_ be in the same pack */
1963 base_offset = find_pack_entry_one(base_info, p);
1964 *curpos += 20;
1965 } else
1966 die("I am totally screwed");
1967 return base_offset;
1968}
1969
1970/*
1971 * Like get_delta_base above, but we return the sha1 instead of the pack
1972 * offset. This means it is cheaper for REF deltas (we do not have to do
1973 * the final object lookup), but more expensive for OFS deltas (we
1974 * have to load the revidx to convert the offset back into a sha1).
1975 */
1976static const unsigned char *get_delta_base_sha1(struct packed_git *p,
1977 struct pack_window **w_curs,
1978 off_t curpos,
1979 enum object_type type,
1980 off_t delta_obj_offset)
1981{
1982 if (type == OBJ_REF_DELTA) {
1983 unsigned char *base = use_pack(p, w_curs, curpos, NULL);
1984 return base;
1985 } else if (type == OBJ_OFS_DELTA) {
1986 struct revindex_entry *revidx;
1987 off_t base_offset = get_delta_base(p, w_curs, &curpos,
1988 type, delta_obj_offset);
1989
1990 if (!base_offset)
1991 return NULL;
1992
1993 revidx = find_pack_revindex(p, base_offset);
1994 if (!revidx)
1995 return NULL;
1996
1997 return nth_packed_object_sha1(p, revidx->nr);
1998 } else
1999 return NULL;
2000}
2001
2002int unpack_object_header(struct packed_git *p,
2003 struct pack_window **w_curs,
2004 off_t *curpos,
2005 unsigned long *sizep)
2006{
2007 unsigned char *base;
2008 unsigned long left;
2009 unsigned long used;
2010 enum object_type type;
2011
2012 /* use_pack() assures us we have [base, base + 20) available
2013 * as a range that we can look at. (Its actually the hash
2014 * size that is assured.) With our object header encoding
2015 * the maximum deflated object size is 2^137, which is just
2016 * insane, so we know won't exceed what we have been given.
2017 */
2018 base = use_pack(p, w_curs, *curpos, &left);
2019 used = unpack_object_header_buffer(base, left, &type, sizep);
2020 if (!used) {
2021 type = OBJ_BAD;
2022 } else
2023 *curpos += used;
2024
2025 return type;
2026}
2027
2028static int retry_bad_packed_offset(struct packed_git *p, off_t obj_offset)
2029{
2030 int type;
2031 struct revindex_entry *revidx;
2032 const unsigned char *sha1;
2033 revidx = find_pack_revindex(p, obj_offset);
2034 if (!revidx)
2035 return OBJ_BAD;
2036 sha1 = nth_packed_object_sha1(p, revidx->nr);
2037 mark_bad_packed_object(p, sha1);
2038 type = sha1_object_info(sha1, NULL);
2039 if (type <= OBJ_NONE)
2040 return OBJ_BAD;
2041 return type;
2042}
2043
2044#define POI_STACK_PREALLOC 64
2045
2046static enum object_type packed_to_object_type(struct packed_git *p,
2047 off_t obj_offset,
2048 enum object_type type,
2049 struct pack_window **w_curs,
2050 off_t curpos)
2051{
2052 off_t small_poi_stack[POI_STACK_PREALLOC];
2053 off_t *poi_stack = small_poi_stack;
2054 int poi_stack_nr = 0, poi_stack_alloc = POI_STACK_PREALLOC;
2055
2056 while (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
2057 off_t base_offset;
2058 unsigned long size;
2059 /* Push the object we're going to leave behind */
2060 if (poi_stack_nr >= poi_stack_alloc && poi_stack == small_poi_stack) {
2061 poi_stack_alloc = alloc_nr(poi_stack_nr);
2062 ALLOC_ARRAY(poi_stack, poi_stack_alloc);
2063 memcpy(poi_stack, small_poi_stack, sizeof(off_t)*poi_stack_nr);
2064 } else {
2065 ALLOC_GROW(poi_stack, poi_stack_nr+1, poi_stack_alloc);
2066 }
2067 poi_stack[poi_stack_nr++] = obj_offset;
2068 /* If parsing the base offset fails, just unwind */
2069 base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
2070 if (!base_offset)
2071 goto unwind;
2072 curpos = obj_offset = base_offset;
2073 type = unpack_object_header(p, w_curs, &curpos, &size);
2074 if (type <= OBJ_NONE) {
2075 /* If getting the base itself fails, we first
2076 * retry the base, otherwise unwind */
2077 type = retry_bad_packed_offset(p, base_offset);
2078 if (type > OBJ_NONE)
2079 goto out;
2080 goto unwind;
2081 }
2082 }
2083
2084 switch (type) {
2085 case OBJ_BAD:
2086 case OBJ_COMMIT:
2087 case OBJ_TREE:
2088 case OBJ_BLOB:
2089 case OBJ_TAG:
2090 break;
2091 default:
2092 error("unknown object type %i at offset %"PRIuMAX" in %s",
2093 type, (uintmax_t)obj_offset, p->pack_name);
2094 type = OBJ_BAD;
2095 }
2096
2097out:
2098 if (poi_stack != small_poi_stack)
2099 free(poi_stack);
2100 return type;
2101
2102unwind:
2103 while (poi_stack_nr) {
2104 obj_offset = poi_stack[--poi_stack_nr];
2105 type = retry_bad_packed_offset(p, obj_offset);
2106 if (type > OBJ_NONE)
2107 goto out;
2108 }
2109 type = OBJ_BAD;
2110 goto out;
2111}
2112
2113static int packed_object_info(struct packed_git *p, off_t obj_offset,
2114 struct object_info *oi)
2115{
2116 struct pack_window *w_curs = NULL;
2117 unsigned long size;
2118 off_t curpos = obj_offset;
2119 enum object_type type;
2120
2121 /*
2122 * We always get the representation type, but only convert it to
2123 * a "real" type later if the caller is interested.
2124 */
2125 type = unpack_object_header(p, &w_curs, &curpos, &size);
2126
2127 if (oi->sizep) {
2128 if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
2129 off_t tmp_pos = curpos;
2130 off_t base_offset = get_delta_base(p, &w_curs, &tmp_pos,
2131 type, obj_offset);
2132 if (!base_offset) {
2133 type = OBJ_BAD;
2134 goto out;
2135 }
2136 *oi->sizep = get_size_from_delta(p, &w_curs, tmp_pos);
2137 if (*oi->sizep == 0) {
2138 type = OBJ_BAD;
2139 goto out;
2140 }
2141 } else {
2142 *oi->sizep = size;
2143 }
2144 }
2145
2146 if (oi->disk_sizep) {
2147 struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2148 *oi->disk_sizep = revidx[1].offset - obj_offset;
2149 }
2150
2151 if (oi->typep) {
2152 *oi->typep = packed_to_object_type(p, obj_offset, type, &w_curs, curpos);
2153 if (*oi->typep < 0) {
2154 type = OBJ_BAD;
2155 goto out;
2156 }
2157 }
2158
2159 if (oi->delta_base_sha1) {
2160 if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
2161 const unsigned char *base;
2162
2163 base = get_delta_base_sha1(p, &w_curs, curpos,
2164 type, obj_offset);
2165 if (!base) {
2166 type = OBJ_BAD;
2167 goto out;
2168 }
2169
2170 hashcpy(oi->delta_base_sha1, base);
2171 } else
2172 hashclr(oi->delta_base_sha1);
2173 }
2174
2175out:
2176 unuse_pack(&w_curs);
2177 return type;
2178}
2179
2180static void *unpack_compressed_entry(struct packed_git *p,
2181 struct pack_window **w_curs,
2182 off_t curpos,
2183 unsigned long size)
2184{
2185 int st;
2186 git_zstream stream;
2187 unsigned char *buffer, *in;
2188
2189 buffer = xmallocz_gently(size);
2190 if (!buffer)
2191 return NULL;
2192 memset(&stream, 0, sizeof(stream));
2193 stream.next_out = buffer;
2194 stream.avail_out = size + 1;
2195
2196 git_inflate_init(&stream);
2197 do {
2198 in = use_pack(p, w_curs, curpos, &stream.avail_in);
2199 stream.next_in = in;
2200 st = git_inflate(&stream, Z_FINISH);
2201 if (!stream.avail_out)
2202 break; /* the payload is larger than it should be */
2203 curpos += stream.next_in - in;
2204 } while (st == Z_OK || st == Z_BUF_ERROR);
2205 git_inflate_end(&stream);
2206 if ((st != Z_STREAM_END) || stream.total_out != size) {
2207 free(buffer);
2208 return NULL;
2209 }
2210
2211 return buffer;
2212}
2213
2214static struct hashmap delta_base_cache;
2215static size_t delta_base_cached;
2216
2217static LIST_HEAD(delta_base_cache_lru);
2218
2219struct delta_base_cache_key {
2220 struct packed_git *p;
2221 off_t base_offset;
2222};
2223
2224struct delta_base_cache_entry {
2225 struct hashmap hash;
2226 struct delta_base_cache_key key;
2227 struct list_head lru;
2228 void *data;
2229 unsigned long size;
2230 enum object_type type;
2231};
2232
2233static unsigned int pack_entry_hash(struct packed_git *p, off_t base_offset)
2234{
2235 unsigned int hash;
2236
2237 hash = (unsigned int)(intptr_t)p + (unsigned int)base_offset;
2238 hash += (hash >> 8) + (hash >> 16);
2239 return hash;
2240}
2241
2242static struct delta_base_cache_entry *
2243get_delta_base_cache_entry(struct packed_git *p, off_t base_offset)
2244{
2245 struct hashmap_entry entry;
2246 struct delta_base_cache_key key;
2247
2248 if (!delta_base_cache.cmpfn)
2249 return NULL;
2250
2251 hashmap_entry_init(&entry, pack_entry_hash(p, base_offset));
2252 key.p = p;
2253 key.base_offset = base_offset;
2254 return hashmap_get(&delta_base_cache, &entry, &key);
2255}
2256
2257static int delta_base_cache_key_eq(const struct delta_base_cache_key *a,
2258 const struct delta_base_cache_key *b)
2259{
2260 return a->p == b->p && a->base_offset == b->base_offset;
2261}
2262
2263static int delta_base_cache_hash_cmp(const void *va, const void *vb,
2264 const void *vkey)
2265{
2266 const struct delta_base_cache_entry *a = va, *b = vb;
2267 const struct delta_base_cache_key *key = vkey;
2268 if (key)
2269 return !delta_base_cache_key_eq(&a->key, key);
2270 else
2271 return !delta_base_cache_key_eq(&a->key, &b->key);
2272}
2273
2274static int in_delta_base_cache(struct packed_git *p, off_t base_offset)
2275{
2276 return !!get_delta_base_cache_entry(p, base_offset);
2277}
2278
2279/*
2280 * Remove the entry from the cache, but do _not_ free the associated
2281 * entry data. The caller takes ownership of the "data" buffer, and
2282 * should copy out any fields it wants before detaching.
2283 */
2284static void detach_delta_base_cache_entry(struct delta_base_cache_entry *ent)
2285{
2286 hashmap_remove(&delta_base_cache, ent, &ent->key);
2287 list_del(&ent->lru);
2288 delta_base_cached -= ent->size;
2289 free(ent);
2290}
2291
2292static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
2293 unsigned long *base_size, enum object_type *type)
2294{
2295 struct delta_base_cache_entry *ent;
2296
2297 ent = get_delta_base_cache_entry(p, base_offset);
2298 if (!ent)
2299 return unpack_entry(p, base_offset, type, base_size);
2300
2301 *type = ent->type;
2302 *base_size = ent->size;
2303 return xmemdupz(ent->data, ent->size);
2304}
2305
2306static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
2307{
2308 free(ent->data);
2309 detach_delta_base_cache_entry(ent);
2310}
2311
2312void clear_delta_base_cache(void)
2313{
2314 struct hashmap_iter iter;
2315 struct delta_base_cache_entry *entry;
2316 for (entry = hashmap_iter_first(&delta_base_cache, &iter);
2317 entry;
2318 entry = hashmap_iter_next(&iter)) {
2319 release_delta_base_cache(entry);
2320 }
2321}
2322
2323static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
2324 void *base, unsigned long base_size, enum object_type type)
2325{
2326 struct delta_base_cache_entry *ent = xmalloc(sizeof(*ent));
2327 struct list_head *lru, *tmp;
2328
2329 delta_base_cached += base_size;
2330
2331 list_for_each_safe(lru, tmp, &delta_base_cache_lru) {
2332 struct delta_base_cache_entry *f =
2333 list_entry(lru, struct delta_base_cache_entry, lru);
2334 if (delta_base_cached <= delta_base_cache_limit)
2335 break;
2336 release_delta_base_cache(f);
2337 }
2338
2339 ent->key.p = p;
2340 ent->key.base_offset = base_offset;
2341 ent->type = type;
2342 ent->data = base;
2343 ent->size = base_size;
2344 list_add_tail(&ent->lru, &delta_base_cache_lru);
2345
2346 if (!delta_base_cache.cmpfn)
2347 hashmap_init(&delta_base_cache, delta_base_cache_hash_cmp, 0);
2348 hashmap_entry_init(ent, pack_entry_hash(p, base_offset));
2349 hashmap_add(&delta_base_cache, ent);
2350}
2351
2352static void *read_object(const unsigned char *sha1, enum object_type *type,
2353 unsigned long *size);
2354
2355static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
2356{
2357 static struct trace_key pack_access = TRACE_KEY_INIT(PACK_ACCESS);
2358 trace_printf_key(&pack_access, "%s %"PRIuMAX"\n",
2359 p->pack_name, (uintmax_t)obj_offset);
2360}
2361
2362int do_check_packed_object_crc;
2363
2364#define UNPACK_ENTRY_STACK_PREALLOC 64
2365struct unpack_entry_stack_ent {
2366 off_t obj_offset;
2367 off_t curpos;
2368 unsigned long size;
2369};
2370
2371void *unpack_entry(struct packed_git *p, off_t obj_offset,
2372 enum object_type *final_type, unsigned long *final_size)
2373{
2374 struct pack_window *w_curs = NULL;
2375 off_t curpos = obj_offset;
2376 void *data = NULL;
2377 unsigned long size;
2378 enum object_type type;
2379 struct unpack_entry_stack_ent small_delta_stack[UNPACK_ENTRY_STACK_PREALLOC];
2380 struct unpack_entry_stack_ent *delta_stack = small_delta_stack;
2381 int delta_stack_nr = 0, delta_stack_alloc = UNPACK_ENTRY_STACK_PREALLOC;
2382 int base_from_cache = 0;
2383
2384 write_pack_access_log(p, obj_offset);
2385
2386 /* PHASE 1: drill down to the innermost base object */
2387 for (;;) {
2388 off_t base_offset;
2389 int i;
2390 struct delta_base_cache_entry *ent;
2391
2392 ent = get_delta_base_cache_entry(p, curpos);
2393 if (ent) {
2394 type = ent->type;
2395 data = ent->data;
2396 size = ent->size;
2397 detach_delta_base_cache_entry(ent);
2398 base_from_cache = 1;
2399 break;
2400 }
2401
2402 if (do_check_packed_object_crc && p->index_version > 1) {
2403 struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2404 off_t len = revidx[1].offset - obj_offset;
2405 if (check_pack_crc(p, &w_curs, obj_offset, len, revidx->nr)) {
2406 const unsigned char *sha1 =
2407 nth_packed_object_sha1(p, revidx->nr);
2408 error("bad packed object CRC for %s",
2409 sha1_to_hex(sha1));
2410 mark_bad_packed_object(p, sha1);
2411 unuse_pack(&w_curs);
2412 return NULL;
2413 }
2414 }
2415
2416 type = unpack_object_header(p, &w_curs, &curpos, &size);
2417 if (type != OBJ_OFS_DELTA && type != OBJ_REF_DELTA)
2418 break;
2419
2420 base_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
2421 if (!base_offset) {
2422 error("failed to validate delta base reference "
2423 "at offset %"PRIuMAX" from %s",
2424 (uintmax_t)curpos, p->pack_name);
2425 /* bail to phase 2, in hopes of recovery */
2426 data = NULL;
2427 break;
2428 }
2429
2430 /* push object, proceed to base */
2431 if (delta_stack_nr >= delta_stack_alloc
2432 && delta_stack == small_delta_stack) {
2433 delta_stack_alloc = alloc_nr(delta_stack_nr);
2434 ALLOC_ARRAY(delta_stack, delta_stack_alloc);
2435 memcpy(delta_stack, small_delta_stack,
2436 sizeof(*delta_stack)*delta_stack_nr);
2437 } else {
2438 ALLOC_GROW(delta_stack, delta_stack_nr+1, delta_stack_alloc);
2439 }
2440 i = delta_stack_nr++;
2441 delta_stack[i].obj_offset = obj_offset;
2442 delta_stack[i].curpos = curpos;
2443 delta_stack[i].size = size;
2444
2445 curpos = obj_offset = base_offset;
2446 }
2447
2448 /* PHASE 2: handle the base */
2449 switch (type) {
2450 case OBJ_OFS_DELTA:
2451 case OBJ_REF_DELTA:
2452 if (data)
2453 die("BUG: unpack_entry: left loop at a valid delta");
2454 break;
2455 case OBJ_COMMIT:
2456 case OBJ_TREE:
2457 case OBJ_BLOB:
2458 case OBJ_TAG:
2459 if (!base_from_cache)
2460 data = unpack_compressed_entry(p, &w_curs, curpos, size);
2461 break;
2462 default:
2463 data = NULL;
2464 error("unknown object type %i at offset %"PRIuMAX" in %s",
2465 type, (uintmax_t)obj_offset, p->pack_name);
2466 }
2467
2468 /* PHASE 3: apply deltas in order */
2469
2470 /* invariants:
2471 * 'data' holds the base data, or NULL if there was corruption
2472 */
2473 while (delta_stack_nr) {
2474 void *delta_data;
2475 void *base = data;
2476 unsigned long delta_size, base_size = size;
2477 int i;
2478
2479 data = NULL;
2480
2481 if (base)
2482 add_delta_base_cache(p, obj_offset, base, base_size, type);
2483
2484 if (!base) {
2485 /*
2486 * We're probably in deep shit, but let's try to fetch
2487 * the required base anyway from another pack or loose.
2488 * This is costly but should happen only in the presence
2489 * of a corrupted pack, and is better than failing outright.
2490 */
2491 struct revindex_entry *revidx;
2492 const unsigned char *base_sha1;
2493 revidx = find_pack_revindex(p, obj_offset);
2494 if (revidx) {
2495 base_sha1 = nth_packed_object_sha1(p, revidx->nr);
2496 error("failed to read delta base object %s"
2497 " at offset %"PRIuMAX" from %s",
2498 sha1_to_hex(base_sha1), (uintmax_t)obj_offset,
2499 p->pack_name);
2500 mark_bad_packed_object(p, base_sha1);
2501 base = read_object(base_sha1, &type, &base_size);
2502 }
2503 }
2504
2505 i = --delta_stack_nr;
2506 obj_offset = delta_stack[i].obj_offset;
2507 curpos = delta_stack[i].curpos;
2508 delta_size = delta_stack[i].size;
2509
2510 if (!base)
2511 continue;
2512
2513 delta_data = unpack_compressed_entry(p, &w_curs, curpos, delta_size);
2514
2515 if (!delta_data) {
2516 error("failed to unpack compressed delta "
2517 "at offset %"PRIuMAX" from %s",
2518 (uintmax_t)curpos, p->pack_name);
2519 data = NULL;
2520 continue;
2521 }
2522
2523 data = patch_delta(base, base_size,
2524 delta_data, delta_size,
2525 &size);
2526
2527 /*
2528 * We could not apply the delta; warn the user, but keep going.
2529 * Our failure will be noticed either in the next iteration of
2530 * the loop, or if this is the final delta, in the caller when
2531 * we return NULL. Those code paths will take care of making
2532 * a more explicit warning and retrying with another copy of
2533 * the object.
2534 */
2535 if (!data)
2536 error("failed to apply delta");
2537
2538 free(delta_data);
2539 }
2540
2541 *final_type = type;
2542 *final_size = size;
2543
2544 unuse_pack(&w_curs);
2545
2546 if (delta_stack != small_delta_stack)
2547 free(delta_stack);
2548
2549 return data;
2550}
2551
2552const unsigned char *nth_packed_object_sha1(struct packed_git *p,
2553 uint32_t n)
2554{
2555 const unsigned char *index = p->index_data;
2556 if (!index) {
2557 if (open_pack_index(p))
2558 return NULL;
2559 index = p->index_data;
2560 }
2561 if (n >= p->num_objects)
2562 return NULL;
2563 index += 4 * 256;
2564 if (p->index_version == 1) {
2565 return index + 24 * n + 4;
2566 } else {
2567 index += 8;
2568 return index + 20 * n;
2569 }
2570}
2571
2572void check_pack_index_ptr(const struct packed_git *p, const void *vptr)
2573{
2574 const unsigned char *ptr = vptr;
2575 const unsigned char *start = p->index_data;
2576 const unsigned char *end = start + p->index_size;
2577 if (ptr < start)
2578 die(_("offset before start of pack index for %s (corrupt index?)"),
2579 p->pack_name);
2580 /* No need to check for underflow; .idx files must be at least 8 bytes */
2581 if (ptr >= end - 8)
2582 die(_("offset beyond end of pack index for %s (truncated index?)"),
2583 p->pack_name);
2584}
2585
2586off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
2587{
2588 const unsigned char *index = p->index_data;
2589 index += 4 * 256;
2590 if (p->index_version == 1) {
2591 return ntohl(*((uint32_t *)(index + 24 * n)));
2592 } else {
2593 uint32_t off;
2594 index += 8 + p->num_objects * (20 + 4);
2595 off = ntohl(*((uint32_t *)(index + 4 * n)));
2596 if (!(off & 0x80000000))
2597 return off;
2598 index += p->num_objects * 4 + (off & 0x7fffffff) * 8;
2599 check_pack_index_ptr(p, index);
2600 return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
2601 ntohl(*((uint32_t *)(index + 4)));
2602 }
2603}
2604
2605off_t find_pack_entry_one(const unsigned char *sha1,
2606 struct packed_git *p)
2607{
2608 const uint32_t *level1_ofs = p->index_data;
2609 const unsigned char *index = p->index_data;
2610 unsigned hi, lo, stride;
2611 static int use_lookup = -1;
2612 static int debug_lookup = -1;
2613
2614 if (debug_lookup < 0)
2615 debug_lookup = !!getenv("GIT_DEBUG_LOOKUP");
2616
2617 if (!index) {
2618 if (open_pack_index(p))
2619 return 0;
2620 level1_ofs = p->index_data;
2621 index = p->index_data;
2622 }
2623 if (p->index_version > 1) {
2624 level1_ofs += 2;
2625 index += 8;
2626 }
2627 index += 4 * 256;
2628 hi = ntohl(level1_ofs[*sha1]);
2629 lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
2630 if (p->index_version > 1) {
2631 stride = 20;
2632 } else {
2633 stride = 24;
2634 index += 4;
2635 }
2636
2637 if (debug_lookup)
2638 printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
2639 sha1[0], sha1[1], sha1[2], lo, hi, p->num_objects);
2640
2641 if (use_lookup < 0)
2642 use_lookup = !!getenv("GIT_USE_LOOKUP");
2643 if (use_lookup) {
2644 int pos = sha1_entry_pos(index, stride, 0,
2645 lo, hi, p->num_objects, sha1);
2646 if (pos < 0)
2647 return 0;
2648 return nth_packed_object_offset(p, pos);
2649 }
2650
2651 do {
2652 unsigned mi = (lo + hi) / 2;
2653 int cmp = hashcmp(index + mi * stride, sha1);
2654
2655 if (debug_lookup)
2656 printf("lo %u hi %u rg %u mi %u\n",
2657 lo, hi, hi - lo, mi);
2658 if (!cmp)
2659 return nth_packed_object_offset(p, mi);
2660 if (cmp > 0)
2661 hi = mi;
2662 else
2663 lo = mi+1;
2664 } while (lo < hi);
2665 return 0;
2666}
2667
2668int is_pack_valid(struct packed_git *p)
2669{
2670 /* An already open pack is known to be valid. */
2671 if (p->pack_fd != -1)
2672 return 1;
2673
2674 /* If the pack has one window completely covering the
2675 * file size, the pack is known to be valid even if
2676 * the descriptor is not currently open.
2677 */
2678 if (p->windows) {
2679 struct pack_window *w = p->windows;
2680
2681 if (!w->offset && w->len == p->pack_size)
2682 return 1;
2683 }
2684
2685 /* Force the pack to open to prove its valid. */
2686 return !open_packed_git(p);
2687}
2688
2689static int fill_pack_entry(const unsigned char *sha1,
2690 struct pack_entry *e,
2691 struct packed_git *p)
2692{
2693 off_t offset;
2694
2695 if (p->num_bad_objects) {
2696 unsigned i;
2697 for (i = 0; i < p->num_bad_objects; i++)
2698 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
2699 return 0;
2700 }
2701
2702 offset = find_pack_entry_one(sha1, p);
2703 if (!offset)
2704 return 0;
2705
2706 /*
2707 * We are about to tell the caller where they can locate the
2708 * requested object. We better make sure the packfile is
2709 * still here and can be accessed before supplying that
2710 * answer, as it may have been deleted since the index was
2711 * loaded!
2712 */
2713 if (!is_pack_valid(p))
2714 return 0;
2715 e->offset = offset;
2716 e->p = p;
2717 hashcpy(e->sha1, sha1);
2718 return 1;
2719}
2720
2721/*
2722 * Iff a pack file contains the object named by sha1, return true and
2723 * store its location to e.
2724 */
2725static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e)
2726{
2727 struct mru_entry *p;
2728
2729 prepare_packed_git();
2730 if (!packed_git)
2731 return 0;
2732
2733 for (p = packed_git_mru->head; p; p = p->next) {
2734 if (fill_pack_entry(sha1, e, p->item)) {
2735 mru_mark(packed_git_mru, p);
2736 return 1;
2737 }
2738 }
2739 return 0;
2740}
2741
2742struct packed_git *find_sha1_pack(const unsigned char *sha1,
2743 struct packed_git *packs)
2744{
2745 struct packed_git *p;
2746
2747 for (p = packs; p; p = p->next) {
2748 if (find_pack_entry_one(sha1, p))
2749 return p;
2750 }
2751 return NULL;
2752
2753}
2754
2755static int sha1_loose_object_info(const unsigned char *sha1,
2756 struct object_info *oi,
2757 int flags)
2758{
2759 int status = 0;
2760 unsigned long mapsize;
2761 void *map;
2762 git_zstream stream;
2763 char hdr[32];
2764 struct strbuf hdrbuf = STRBUF_INIT;
2765
2766 if (oi->delta_base_sha1)
2767 hashclr(oi->delta_base_sha1);
2768
2769 /*
2770 * If we don't care about type or size, then we don't
2771 * need to look inside the object at all. Note that we
2772 * do not optimize out the stat call, even if the
2773 * caller doesn't care about the disk-size, since our
2774 * return value implicitly indicates whether the
2775 * object even exists.
2776 */
2777 if (!oi->typep && !oi->typename && !oi->sizep) {
2778 struct stat st;
2779 if (stat_sha1_file(sha1, &st) < 0)
2780 return -1;
2781 if (oi->disk_sizep)
2782 *oi->disk_sizep = st.st_size;
2783 return 0;
2784 }
2785
2786 map = map_sha1_file(sha1, &mapsize);
2787 if (!map)
2788 return -1;
2789 if (oi->disk_sizep)
2790 *oi->disk_sizep = mapsize;
2791 if ((flags & LOOKUP_UNKNOWN_OBJECT)) {
2792 if (unpack_sha1_header_to_strbuf(&stream, map, mapsize, hdr, sizeof(hdr), &hdrbuf) < 0)
2793 status = error("unable to unpack %s header with --allow-unknown-type",
2794 sha1_to_hex(sha1));
2795 } else if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
2796 status = error("unable to unpack %s header",
2797 sha1_to_hex(sha1));
2798 if (status < 0)
2799 ; /* Do nothing */
2800 else if (hdrbuf.len) {
2801 if ((status = parse_sha1_header_extended(hdrbuf.buf, oi, flags)) < 0)
2802 status = error("unable to parse %s header with --allow-unknown-type",
2803 sha1_to_hex(sha1));
2804 } else if ((status = parse_sha1_header_extended(hdr, oi, flags)) < 0)
2805 status = error("unable to parse %s header", sha1_to_hex(sha1));
2806 git_inflate_end(&stream);
2807 munmap(map, mapsize);
2808 if (status && oi->typep)
2809 *oi->typep = status;
2810 strbuf_release(&hdrbuf);
2811 return 0;
2812}
2813
2814int sha1_object_info_extended(const unsigned char *sha1, struct object_info *oi, unsigned flags)
2815{
2816 struct cached_object *co;
2817 struct pack_entry e;
2818 int rtype;
2819 enum object_type real_type;
2820 const unsigned char *real = lookup_replace_object_extended(sha1, flags);
2821
2822 co = find_cached_object(real);
2823 if (co) {
2824 if (oi->typep)
2825 *(oi->typep) = co->type;
2826 if (oi->sizep)
2827 *(oi->sizep) = co->size;
2828 if (oi->disk_sizep)
2829 *(oi->disk_sizep) = 0;
2830 if (oi->delta_base_sha1)
2831 hashclr(oi->delta_base_sha1);
2832 if (oi->typename)
2833 strbuf_addstr(oi->typename, typename(co->type));
2834 oi->whence = OI_CACHED;
2835 return 0;
2836 }
2837
2838 if (!find_pack_entry(real, &e)) {
2839 /* Most likely it's a loose object. */
2840 if (!sha1_loose_object_info(real, oi, flags)) {
2841 oi->whence = OI_LOOSE;
2842 return 0;
2843 }
2844
2845 /* Not a loose object; someone else may have just packed it. */
2846 reprepare_packed_git();
2847 if (!find_pack_entry(real, &e))
2848 return -1;
2849 }
2850
2851 /*
2852 * packed_object_info() does not follow the delta chain to
2853 * find out the real type, unless it is given oi->typep.
2854 */
2855 if (oi->typename && !oi->typep)
2856 oi->typep = &real_type;
2857
2858 rtype = packed_object_info(e.p, e.offset, oi);
2859 if (rtype < 0) {
2860 mark_bad_packed_object(e.p, real);
2861 if (oi->typep == &real_type)
2862 oi->typep = NULL;
2863 return sha1_object_info_extended(real, oi, 0);
2864 } else if (in_delta_base_cache(e.p, e.offset)) {
2865 oi->whence = OI_DBCACHED;
2866 } else {
2867 oi->whence = OI_PACKED;
2868 oi->u.packed.offset = e.offset;
2869 oi->u.packed.pack = e.p;
2870 oi->u.packed.is_delta = (rtype == OBJ_REF_DELTA ||
2871 rtype == OBJ_OFS_DELTA);
2872 }
2873 if (oi->typename)
2874 strbuf_addstr(oi->typename, typename(*oi->typep));
2875 if (oi->typep == &real_type)
2876 oi->typep = NULL;
2877
2878 return 0;
2879}
2880
2881/* returns enum object_type or negative */
2882int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
2883{
2884 enum object_type type;
2885 struct object_info oi = {NULL};
2886
2887 oi.typep = &type;
2888 oi.sizep = sizep;
2889 if (sha1_object_info_extended(sha1, &oi, LOOKUP_REPLACE_OBJECT) < 0)
2890 return -1;
2891 return type;
2892}
2893
2894static void *read_packed_sha1(const unsigned char *sha1,
2895 enum object_type *type, unsigned long *size)
2896{
2897 struct pack_entry e;
2898 void *data;
2899
2900 if (!find_pack_entry(sha1, &e))
2901 return NULL;
2902 data = cache_or_unpack_entry(e.p, e.offset, size, type);
2903 if (!data) {
2904 /*
2905 * We're probably in deep shit, but let's try to fetch
2906 * the required object anyway from another pack or loose.
2907 * This should happen only in the presence of a corrupted
2908 * pack, and is better than failing outright.
2909 */
2910 error("failed to read object %s at offset %"PRIuMAX" from %s",
2911 sha1_to_hex(sha1), (uintmax_t)e.offset, e.p->pack_name);
2912 mark_bad_packed_object(e.p, sha1);
2913 data = read_object(sha1, type, size);
2914 }
2915 return data;
2916}
2917
2918int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
2919 unsigned char *sha1)
2920{
2921 struct cached_object *co;
2922
2923 hash_sha1_file(buf, len, typename(type), sha1);
2924 if (has_sha1_file(sha1) || find_cached_object(sha1))
2925 return 0;
2926 ALLOC_GROW(cached_objects, cached_object_nr + 1, cached_object_alloc);
2927 co = &cached_objects[cached_object_nr++];
2928 co->size = len;
2929 co->type = type;
2930 co->buf = xmalloc(len);
2931 memcpy(co->buf, buf, len);
2932 hashcpy(co->sha1, sha1);
2933 return 0;
2934}
2935
2936static void *read_object(const unsigned char *sha1, enum object_type *type,
2937 unsigned long *size)
2938{
2939 unsigned long mapsize;
2940 void *map, *buf;
2941 struct cached_object *co;
2942
2943 co = find_cached_object(sha1);
2944 if (co) {
2945 *type = co->type;
2946 *size = co->size;
2947 return xmemdupz(co->buf, co->size);
2948 }
2949
2950 buf = read_packed_sha1(sha1, type, size);
2951 if (buf)
2952 return buf;
2953 map = map_sha1_file(sha1, &mapsize);
2954 if (map) {
2955 buf = unpack_sha1_file(map, mapsize, type, size, sha1);
2956 munmap(map, mapsize);
2957 return buf;
2958 }
2959 reprepare_packed_git();
2960 return read_packed_sha1(sha1, type, size);
2961}
2962
2963/*
2964 * This function dies on corrupt objects; the callers who want to
2965 * deal with them should arrange to call read_object() and give error
2966 * messages themselves.
2967 */
2968void *read_sha1_file_extended(const unsigned char *sha1,
2969 enum object_type *type,
2970 unsigned long *size,
2971 unsigned flag)
2972{
2973 void *data;
2974 const struct packed_git *p;
2975 const unsigned char *repl = lookup_replace_object_extended(sha1, flag);
2976
2977 errno = 0;
2978 data = read_object(repl, type, size);
2979 if (data)
2980 return data;
2981
2982 if (errno && errno != ENOENT)
2983 die_errno("failed to read object %s", sha1_to_hex(sha1));
2984
2985 /* die if we replaced an object with one that does not exist */
2986 if (repl != sha1)
2987 die("replacement %s not found for %s",
2988 sha1_to_hex(repl), sha1_to_hex(sha1));
2989
2990 if (has_loose_object(repl)) {
2991 const char *path = sha1_file_name(sha1);
2992
2993 die("loose object %s (stored in %s) is corrupt",
2994 sha1_to_hex(repl), path);
2995 }
2996
2997 if ((p = has_packed_and_bad(repl)) != NULL)
2998 die("packed object %s (stored in %s) is corrupt",
2999 sha1_to_hex(repl), p->pack_name);
3000
3001 return NULL;
3002}
3003
3004void *read_object_with_reference(const unsigned char *sha1,
3005 const char *required_type_name,
3006 unsigned long *size,
3007 unsigned char *actual_sha1_return)
3008{
3009 enum object_type type, required_type;
3010 void *buffer;
3011 unsigned long isize;
3012 unsigned char actual_sha1[20];
3013
3014 required_type = type_from_string(required_type_name);
3015 hashcpy(actual_sha1, sha1);
3016 while (1) {
3017 int ref_length = -1;
3018 const char *ref_type = NULL;
3019
3020 buffer = read_sha1_file(actual_sha1, &type, &isize);
3021 if (!buffer)
3022 return NULL;
3023 if (type == required_type) {
3024 *size = isize;
3025 if (actual_sha1_return)
3026 hashcpy(actual_sha1_return, actual_sha1);
3027 return buffer;
3028 }
3029 /* Handle references */
3030 else if (type == OBJ_COMMIT)
3031 ref_type = "tree ";
3032 else if (type == OBJ_TAG)
3033 ref_type = "object ";
3034 else {
3035 free(buffer);
3036 return NULL;
3037 }
3038 ref_length = strlen(ref_type);
3039
3040 if (ref_length + 40 > isize ||
3041 memcmp(buffer, ref_type, ref_length) ||
3042 get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
3043 free(buffer);
3044 return NULL;
3045 }
3046 free(buffer);
3047 /* Now we have the ID of the referred-to object in
3048 * actual_sha1. Check again. */
3049 }
3050}
3051
3052static void write_sha1_file_prepare(const void *buf, unsigned long len,
3053 const char *type, unsigned char *sha1,
3054 char *hdr, int *hdrlen)
3055{
3056 git_SHA_CTX c;
3057
3058 /* Generate the header */
3059 *hdrlen = xsnprintf(hdr, *hdrlen, "%s %lu", type, len)+1;
3060
3061 /* Sha1.. */
3062 git_SHA1_Init(&c);
3063 git_SHA1_Update(&c, hdr, *hdrlen);
3064 git_SHA1_Update(&c, buf, len);
3065 git_SHA1_Final(sha1, &c);
3066}
3067
3068/*
3069 * Move the just written object into its final resting place.
3070 */
3071int finalize_object_file(const char *tmpfile, const char *filename)
3072{
3073 int ret = 0;
3074
3075 if (object_creation_mode == OBJECT_CREATION_USES_RENAMES)
3076 goto try_rename;
3077 else if (link(tmpfile, filename))
3078 ret = errno;
3079
3080 /*
3081 * Coda hack - coda doesn't like cross-directory links,
3082 * so we fall back to a rename, which will mean that it
3083 * won't be able to check collisions, but that's not a
3084 * big deal.
3085 *
3086 * The same holds for FAT formatted media.
3087 *
3088 * When this succeeds, we just return. We have nothing
3089 * left to unlink.
3090 */
3091 if (ret && ret != EEXIST) {
3092 try_rename:
3093 if (!rename(tmpfile, filename))
3094 goto out;
3095 ret = errno;
3096 }
3097 unlink_or_warn(tmpfile);
3098 if (ret) {
3099 if (ret != EEXIST) {
3100 return error_errno("unable to write sha1 filename %s", filename);
3101 }
3102 /* FIXME!!! Collision check here ? */
3103 }
3104
3105out:
3106 if (adjust_shared_perm(filename))
3107 return error("unable to set permission to '%s'", filename);
3108 return 0;
3109}
3110
3111static int write_buffer(int fd, const void *buf, size_t len)
3112{
3113 if (write_in_full(fd, buf, len) < 0)
3114 return error_errno("file write error");
3115 return 0;
3116}
3117
3118int hash_sha1_file(const void *buf, unsigned long len, const char *type,
3119 unsigned char *sha1)
3120{
3121 char hdr[32];
3122 int hdrlen = sizeof(hdr);
3123 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
3124 return 0;
3125}
3126
3127/* Finalize a file on disk, and close it. */
3128static void close_sha1_file(int fd)
3129{
3130 if (fsync_object_files)
3131 fsync_or_die(fd, "sha1 file");
3132 if (close(fd) != 0)
3133 die_errno("error when closing sha1 file");
3134}
3135
3136/* Size of directory component, including the ending '/' */
3137static inline int directory_size(const char *filename)
3138{
3139 const char *s = strrchr(filename, '/');
3140 if (!s)
3141 return 0;
3142 return s - filename + 1;
3143}
3144
3145/*
3146 * This creates a temporary file in the same directory as the final
3147 * 'filename'
3148 *
3149 * We want to avoid cross-directory filename renames, because those
3150 * can have problems on various filesystems (FAT, NFS, Coda).
3151 */
3152static int create_tmpfile(struct strbuf *tmp, const char *filename)
3153{
3154 int fd, dirlen = directory_size(filename);
3155
3156 strbuf_reset(tmp);
3157 strbuf_add(tmp, filename, dirlen);
3158 strbuf_addstr(tmp, "tmp_obj_XXXXXX");
3159 fd = git_mkstemp_mode(tmp->buf, 0444);
3160 if (fd < 0 && dirlen && errno == ENOENT) {
3161 /*
3162 * Make sure the directory exists; note that the contents
3163 * of the buffer are undefined after mkstemp returns an
3164 * error, so we have to rewrite the whole buffer from
3165 * scratch.
3166 */
3167 strbuf_reset(tmp);
3168 strbuf_add(tmp, filename, dirlen - 1);
3169 if (mkdir(tmp->buf, 0777) && errno != EEXIST)
3170 return -1;
3171 if (adjust_shared_perm(tmp->buf))
3172 return -1;
3173
3174 /* Try again */
3175 strbuf_addstr(tmp, "/tmp_obj_XXXXXX");
3176 fd = git_mkstemp_mode(tmp->buf, 0444);
3177 }
3178 return fd;
3179}
3180
3181static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
3182 const void *buf, unsigned long len, time_t mtime)
3183{
3184 int fd, ret;
3185 unsigned char compressed[4096];
3186 git_zstream stream;
3187 git_SHA_CTX c;
3188 unsigned char parano_sha1[20];
3189 static struct strbuf tmp_file = STRBUF_INIT;
3190 const char *filename = sha1_file_name(sha1);
3191
3192 fd = create_tmpfile(&tmp_file, filename);
3193 if (fd < 0) {
3194 if (errno == EACCES)
3195 return error("insufficient permission for adding an object to repository database %s", get_object_directory());
3196 else
3197 return error_errno("unable to create temporary file");
3198 }
3199
3200 /* Set it up */
3201 git_deflate_init(&stream, zlib_compression_level);
3202 stream.next_out = compressed;
3203 stream.avail_out = sizeof(compressed);
3204 git_SHA1_Init(&c);
3205
3206 /* First header.. */
3207 stream.next_in = (unsigned char *)hdr;
3208 stream.avail_in = hdrlen;
3209 while (git_deflate(&stream, 0) == Z_OK)
3210 ; /* nothing */
3211 git_SHA1_Update(&c, hdr, hdrlen);
3212
3213 /* Then the data itself.. */
3214 stream.next_in = (void *)buf;
3215 stream.avail_in = len;
3216 do {
3217 unsigned char *in0 = stream.next_in;
3218 ret = git_deflate(&stream, Z_FINISH);
3219 git_SHA1_Update(&c, in0, stream.next_in - in0);
3220 if (write_buffer(fd, compressed, stream.next_out - compressed) < 0)
3221 die("unable to write sha1 file");
3222 stream.next_out = compressed;
3223 stream.avail_out = sizeof(compressed);
3224 } while (ret == Z_OK);
3225
3226 if (ret != Z_STREAM_END)
3227 die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
3228 ret = git_deflate_end_gently(&stream);
3229 if (ret != Z_OK)
3230 die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
3231 git_SHA1_Final(parano_sha1, &c);
3232 if (hashcmp(sha1, parano_sha1) != 0)
3233 die("confused by unstable object source data for %s", sha1_to_hex(sha1));
3234
3235 close_sha1_file(fd);
3236
3237 if (mtime) {
3238 struct utimbuf utb;
3239 utb.actime = mtime;
3240 utb.modtime = mtime;
3241 if (utime(tmp_file.buf, &utb) < 0)
3242 warning_errno("failed utime() on %s", tmp_file.buf);
3243 }
3244
3245 return finalize_object_file(tmp_file.buf, filename);
3246}
3247
3248static int freshen_loose_object(const unsigned char *sha1)
3249{
3250 return check_and_freshen(sha1, 1);
3251}
3252
3253static int freshen_packed_object(const unsigned char *sha1)
3254{
3255 struct pack_entry e;
3256 if (!find_pack_entry(sha1, &e))
3257 return 0;
3258 if (e.p->freshened)
3259 return 1;
3260 if (!freshen_file(e.p->pack_name))
3261 return 0;
3262 e.p->freshened = 1;
3263 return 1;
3264}
3265
3266int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *sha1)
3267{
3268 char hdr[32];
3269 int hdrlen = sizeof(hdr);
3270
3271 /* Normally if we have it in the pack then we do not bother writing
3272 * it out into .git/objects/??/?{38} file.
3273 */
3274 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
3275 if (freshen_packed_object(sha1) || freshen_loose_object(sha1))
3276 return 0;
3277 return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
3278}
3279
3280int hash_sha1_file_literally(const void *buf, unsigned long len, const char *type,
3281 unsigned char *sha1, unsigned flags)
3282{
3283 char *header;
3284 int hdrlen, status = 0;
3285
3286 /* type string, SP, %lu of the length plus NUL must fit this */
3287 hdrlen = strlen(type) + 32;
3288 header = xmalloc(hdrlen);
3289 write_sha1_file_prepare(buf, len, type, sha1, header, &hdrlen);
3290
3291 if (!(flags & HASH_WRITE_OBJECT))
3292 goto cleanup;
3293 if (freshen_packed_object(sha1) || freshen_loose_object(sha1))
3294 goto cleanup;
3295 status = write_loose_object(sha1, header, hdrlen, buf, len, 0);
3296
3297cleanup:
3298 free(header);
3299 return status;
3300}
3301
3302int force_object_loose(const unsigned char *sha1, time_t mtime)
3303{
3304 void *buf;
3305 unsigned long len;
3306 enum object_type type;
3307 char hdr[32];
3308 int hdrlen;
3309 int ret;
3310
3311 if (has_loose_object(sha1))
3312 return 0;
3313 buf = read_packed_sha1(sha1, &type, &len);
3314 if (!buf)
3315 return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
3316 hdrlen = xsnprintf(hdr, sizeof(hdr), "%s %lu", typename(type), len) + 1;
3317 ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
3318 free(buf);
3319
3320 return ret;
3321}
3322
3323int has_pack_index(const unsigned char *sha1)
3324{
3325 struct stat st;
3326 if (stat(sha1_pack_index_name(sha1), &st))
3327 return 0;
3328 return 1;
3329}
3330
3331int has_sha1_pack(const unsigned char *sha1)
3332{
3333 struct pack_entry e;
3334 return find_pack_entry(sha1, &e);
3335}
3336
3337int has_sha1_file_with_flags(const unsigned char *sha1, int flags)
3338{
3339 struct pack_entry e;
3340
3341 if (find_pack_entry(sha1, &e))
3342 return 1;
3343 if (has_loose_object(sha1))
3344 return 1;
3345 if (flags & HAS_SHA1_QUICK)
3346 return 0;
3347 reprepare_packed_git();
3348 return find_pack_entry(sha1, &e);
3349}
3350
3351int has_object_file(const struct object_id *oid)
3352{
3353 return has_sha1_file(oid->hash);
3354}
3355
3356static void check_tree(const void *buf, size_t size)
3357{
3358 struct tree_desc desc;
3359 struct name_entry entry;
3360
3361 init_tree_desc(&desc, buf, size);
3362 while (tree_entry(&desc, &entry))
3363 /* do nothing
3364 * tree_entry() will die() on malformed entries */
3365 ;
3366}
3367
3368static void check_commit(const void *buf, size_t size)
3369{
3370 struct commit c;
3371 memset(&c, 0, sizeof(c));
3372 if (parse_commit_buffer(&c, buf, size))
3373 die("corrupt commit");
3374}
3375
3376static void check_tag(const void *buf, size_t size)
3377{
3378 struct tag t;
3379 memset(&t, 0, sizeof(t));
3380 if (parse_tag_buffer(&t, buf, size))
3381 die("corrupt tag");
3382}
3383
3384static int index_mem(unsigned char *sha1, void *buf, size_t size,
3385 enum object_type type,
3386 const char *path, unsigned flags)
3387{
3388 int ret, re_allocated = 0;
3389 int write_object = flags & HASH_WRITE_OBJECT;
3390
3391 if (!type)
3392 type = OBJ_BLOB;
3393
3394 /*
3395 * Convert blobs to git internal format
3396 */
3397 if ((type == OBJ_BLOB) && path) {
3398 struct strbuf nbuf = STRBUF_INIT;
3399 if (convert_to_git(path, buf, size, &nbuf,
3400 write_object ? safe_crlf : SAFE_CRLF_FALSE)) {
3401 buf = strbuf_detach(&nbuf, &size);
3402 re_allocated = 1;
3403 }
3404 }
3405 if (flags & HASH_FORMAT_CHECK) {
3406 if (type == OBJ_TREE)
3407 check_tree(buf, size);
3408 if (type == OBJ_COMMIT)
3409 check_commit(buf, size);
3410 if (type == OBJ_TAG)
3411 check_tag(buf, size);
3412 }
3413
3414 if (write_object)
3415 ret = write_sha1_file(buf, size, typename(type), sha1);
3416 else
3417 ret = hash_sha1_file(buf, size, typename(type), sha1);
3418 if (re_allocated)
3419 free(buf);
3420 return ret;
3421}
3422
3423static int index_stream_convert_blob(unsigned char *sha1, int fd,
3424 const char *path, unsigned flags)
3425{
3426 int ret;
3427 const int write_object = flags & HASH_WRITE_OBJECT;
3428 struct strbuf sbuf = STRBUF_INIT;
3429
3430 assert(path);
3431 assert(would_convert_to_git_filter_fd(path));
3432
3433 convert_to_git_filter_fd(path, fd, &sbuf,
3434 write_object ? safe_crlf : SAFE_CRLF_FALSE);
3435
3436 if (write_object)
3437 ret = write_sha1_file(sbuf.buf, sbuf.len, typename(OBJ_BLOB),
3438 sha1);
3439 else
3440 ret = hash_sha1_file(sbuf.buf, sbuf.len, typename(OBJ_BLOB),
3441 sha1);
3442 strbuf_release(&sbuf);
3443 return ret;
3444}
3445
3446static int index_pipe(unsigned char *sha1, int fd, enum object_type type,
3447 const char *path, unsigned flags)
3448{
3449 struct strbuf sbuf = STRBUF_INIT;
3450 int ret;
3451
3452 if (strbuf_read(&sbuf, fd, 4096) >= 0)
3453 ret = index_mem(sha1, sbuf.buf, sbuf.len, type, path, flags);
3454 else
3455 ret = -1;
3456 strbuf_release(&sbuf);
3457 return ret;
3458}
3459
3460#define SMALL_FILE_SIZE (32*1024)
3461
3462static int index_core(unsigned char *sha1, int fd, size_t size,
3463 enum object_type type, const char *path,
3464 unsigned flags)
3465{
3466 int ret;
3467
3468 if (!size) {
3469 ret = index_mem(sha1, "", size, type, path, flags);
3470 } else if (size <= SMALL_FILE_SIZE) {
3471 char *buf = xmalloc(size);
3472 if (size == read_in_full(fd, buf, size))
3473 ret = index_mem(sha1, buf, size, type, path, flags);
3474 else
3475 ret = error_errno("short read");
3476 free(buf);
3477 } else {
3478 void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
3479 ret = index_mem(sha1, buf, size, type, path, flags);
3480 munmap(buf, size);
3481 }
3482 return ret;
3483}
3484
3485/*
3486 * This creates one packfile per large blob unless bulk-checkin
3487 * machinery is "plugged".
3488 *
3489 * This also bypasses the usual "convert-to-git" dance, and that is on
3490 * purpose. We could write a streaming version of the converting
3491 * functions and insert that before feeding the data to fast-import
3492 * (or equivalent in-core API described above). However, that is
3493 * somewhat complicated, as we do not know the size of the filter
3494 * result, which we need to know beforehand when writing a git object.
3495 * Since the primary motivation for trying to stream from the working
3496 * tree file and to avoid mmaping it in core is to deal with large
3497 * binary blobs, they generally do not want to get any conversion, and
3498 * callers should avoid this code path when filters are requested.
3499 */
3500static int index_stream(unsigned char *sha1, int fd, size_t size,
3501 enum object_type type, const char *path,
3502 unsigned flags)
3503{
3504 return index_bulk_checkin(sha1, fd, size, type, path, flags);
3505}
3506
3507int index_fd(unsigned char *sha1, int fd, struct stat *st,
3508 enum object_type type, const char *path, unsigned flags)
3509{
3510 int ret;
3511
3512 /*
3513 * Call xsize_t() only when needed to avoid potentially unnecessary
3514 * die() for large files.
3515 */
3516 if (type == OBJ_BLOB && path && would_convert_to_git_filter_fd(path))
3517 ret = index_stream_convert_blob(sha1, fd, path, flags);
3518 else if (!S_ISREG(st->st_mode))
3519 ret = index_pipe(sha1, fd, type, path, flags);
3520 else if (st->st_size <= big_file_threshold || type != OBJ_BLOB ||
3521 (path && would_convert_to_git(path)))
3522 ret = index_core(sha1, fd, xsize_t(st->st_size), type, path,
3523 flags);
3524 else
3525 ret = index_stream(sha1, fd, xsize_t(st->st_size), type, path,
3526 flags);
3527 close(fd);
3528 return ret;
3529}
3530
3531int index_path(unsigned char *sha1, const char *path, struct stat *st, unsigned flags)
3532{
3533 int fd;
3534 struct strbuf sb = STRBUF_INIT;
3535
3536 switch (st->st_mode & S_IFMT) {
3537 case S_IFREG:
3538 fd = open(path, O_RDONLY);
3539 if (fd < 0)
3540 return error_errno("open(\"%s\")", path);
3541 if (index_fd(sha1, fd, st, OBJ_BLOB, path, flags) < 0)
3542 return error("%s: failed to insert into database",
3543 path);
3544 break;
3545 case S_IFLNK:
3546 if (strbuf_readlink(&sb, path, st->st_size))
3547 return error_errno("readlink(\"%s\")", path);
3548 if (!(flags & HASH_WRITE_OBJECT))
3549 hash_sha1_file(sb.buf, sb.len, blob_type, sha1);
3550 else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1))
3551 return error("%s: failed to insert into database",
3552 path);
3553 strbuf_release(&sb);
3554 break;
3555 case S_IFDIR:
3556 return resolve_gitlink_ref(path, "HEAD", sha1);
3557 default:
3558 return error("%s: unsupported file type", path);
3559 }
3560 return 0;
3561}
3562
3563int read_pack_header(int fd, struct pack_header *header)
3564{
3565 if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
3566 /* "eof before pack header was fully read" */
3567 return PH_ERROR_EOF;
3568
3569 if (header->hdr_signature != htonl(PACK_SIGNATURE))
3570 /* "protocol error (pack signature mismatch detected)" */
3571 return PH_ERROR_PACK_SIGNATURE;
3572 if (!pack_version_ok(header->hdr_version))
3573 /* "protocol error (pack version unsupported)" */
3574 return PH_ERROR_PROTOCOL;
3575 return 0;
3576}
3577
3578void assert_sha1_type(const unsigned char *sha1, enum object_type expect)
3579{
3580 enum object_type type = sha1_object_info(sha1, NULL);
3581 if (type < 0)
3582 die("%s is not a valid object", sha1_to_hex(sha1));
3583 if (type != expect)
3584 die("%s is not a valid '%s' object", sha1_to_hex(sha1),
3585 typename(expect));
3586}
3587
3588static int for_each_file_in_obj_subdir(int subdir_nr,
3589 struct strbuf *path,
3590 each_loose_object_fn obj_cb,
3591 each_loose_cruft_fn cruft_cb,
3592 each_loose_subdir_fn subdir_cb,
3593 void *data)
3594{
3595 size_t baselen = path->len;
3596 DIR *dir = opendir(path->buf);
3597 struct dirent *de;
3598 int r = 0;
3599
3600 if (!dir) {
3601 if (errno == ENOENT)
3602 return 0;
3603 return error_errno("unable to open %s", path->buf);
3604 }
3605
3606 while ((de = readdir(dir))) {
3607 if (is_dot_or_dotdot(de->d_name))
3608 continue;
3609
3610 strbuf_setlen(path, baselen);
3611 strbuf_addf(path, "/%s", de->d_name);
3612
3613 if (strlen(de->d_name) == 38) {
3614 char hex[41];
3615 unsigned char sha1[20];
3616
3617 snprintf(hex, sizeof(hex), "%02x%s",
3618 subdir_nr, de->d_name);
3619 if (!get_sha1_hex(hex, sha1)) {
3620 if (obj_cb) {
3621 r = obj_cb(sha1, path->buf, data);
3622 if (r)
3623 break;
3624 }
3625 continue;
3626 }
3627 }
3628
3629 if (cruft_cb) {
3630 r = cruft_cb(de->d_name, path->buf, data);
3631 if (r)
3632 break;
3633 }
3634 }
3635 closedir(dir);
3636
3637 strbuf_setlen(path, baselen);
3638 if (!r && subdir_cb)
3639 r = subdir_cb(subdir_nr, path->buf, data);
3640
3641 return r;
3642}
3643
3644int for_each_loose_file_in_objdir_buf(struct strbuf *path,
3645 each_loose_object_fn obj_cb,
3646 each_loose_cruft_fn cruft_cb,
3647 each_loose_subdir_fn subdir_cb,
3648 void *data)
3649{
3650 size_t baselen = path->len;
3651 int r = 0;
3652 int i;
3653
3654 for (i = 0; i < 256; i++) {
3655 strbuf_addf(path, "/%02x", i);
3656 r = for_each_file_in_obj_subdir(i, path, obj_cb, cruft_cb,
3657 subdir_cb, data);
3658 strbuf_setlen(path, baselen);
3659 if (r)
3660 break;
3661 }
3662
3663 return r;
3664}
3665
3666int for_each_loose_file_in_objdir(const char *path,
3667 each_loose_object_fn obj_cb,
3668 each_loose_cruft_fn cruft_cb,
3669 each_loose_subdir_fn subdir_cb,
3670 void *data)
3671{
3672 struct strbuf buf = STRBUF_INIT;
3673 int r;
3674
3675 strbuf_addstr(&buf, path);
3676 r = for_each_loose_file_in_objdir_buf(&buf, obj_cb, cruft_cb,
3677 subdir_cb, data);
3678 strbuf_release(&buf);
3679
3680 return r;
3681}
3682
3683struct loose_alt_odb_data {
3684 each_loose_object_fn *cb;
3685 void *data;
3686};
3687
3688static int loose_from_alt_odb(struct alternate_object_database *alt,
3689 void *vdata)
3690{
3691 struct loose_alt_odb_data *data = vdata;
3692 struct strbuf buf = STRBUF_INIT;
3693 int r;
3694
3695 /* copy base not including trailing '/' */
3696 strbuf_add(&buf, alt->base, alt->name - alt->base - 1);
3697 r = for_each_loose_file_in_objdir_buf(&buf,
3698 data->cb, NULL, NULL,
3699 data->data);
3700 strbuf_release(&buf);
3701 return r;
3702}
3703
3704int for_each_loose_object(each_loose_object_fn cb, void *data, unsigned flags)
3705{
3706 struct loose_alt_odb_data alt;
3707 int r;
3708
3709 r = for_each_loose_file_in_objdir(get_object_directory(),
3710 cb, NULL, NULL, data);
3711 if (r)
3712 return r;
3713
3714 if (flags & FOR_EACH_OBJECT_LOCAL_ONLY)
3715 return 0;
3716
3717 alt.cb = cb;
3718 alt.data = data;
3719 return foreach_alt_odb(loose_from_alt_odb, &alt);
3720}
3721
3722static int for_each_object_in_pack(struct packed_git *p, each_packed_object_fn cb, void *data)
3723{
3724 uint32_t i;
3725 int r = 0;
3726
3727 for (i = 0; i < p->num_objects; i++) {
3728 const unsigned char *sha1 = nth_packed_object_sha1(p, i);
3729
3730 if (!sha1)
3731 return error("unable to get sha1 of object %u in %s",
3732 i, p->pack_name);
3733
3734 r = cb(sha1, p, i, data);
3735 if (r)
3736 break;
3737 }
3738 return r;
3739}
3740
3741int for_each_packed_object(each_packed_object_fn cb, void *data, unsigned flags)
3742{
3743 struct packed_git *p;
3744 int r = 0;
3745 int pack_errors = 0;
3746
3747 prepare_packed_git();
3748 for (p = packed_git; p; p = p->next) {
3749 if ((flags & FOR_EACH_OBJECT_LOCAL_ONLY) && !p->pack_local)
3750 continue;
3751 if (open_pack_index(p)) {
3752 pack_errors = 1;
3753 continue;
3754 }
3755 r = for_each_object_in_pack(p, cb, data);
3756 if (r)
3757 break;
3758 }
3759 return r ? r : pack_errors;
3760}