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