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