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