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