Merge branch 'mh/safe-create-leading-directories'
[git/git-svn.git] / sha1_file.c
blob8b0849f931c5a2f9eea47594b50560fe4526969c
1 /*
2 * GIT - The information manager from hell
4 * Copyright (C) Linus Torvalds, 2005
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 "delta.h"
12 #include "pack.h"
13 #include "blob.h"
14 #include "commit.h"
15 #include "run-command.h"
16 #include "tag.h"
17 #include "tree.h"
18 #include "tree-walk.h"
19 #include "refs.h"
20 #include "pack-revindex.h"
21 #include "sha1-lookup.h"
22 #include "bulk-checkin.h"
23 #include "streaming.h"
24 #include "dir.h"
26 #ifndef O_NOATIME
27 #if defined(__linux__) && (defined(__i386__) || defined(__PPC__))
28 #define O_NOATIME 01000000
29 #else
30 #define O_NOATIME 0
31 #endif
32 #endif
34 #define SZ_FMT PRIuMAX
35 static inline uintmax_t sz_fmt(size_t s) { return s; }
37 const unsigned char null_sha1[20];
39 static const char *no_log_pack_access = "no_log_pack_access";
40 static const char *log_pack_access;
43 * This is meant to hold a *small* number of objects that you would
44 * want read_sha1_file() to be able to return, but yet you do not want
45 * to write them into the object store (e.g. a browse-only
46 * application).
48 static struct cached_object {
49 unsigned char sha1[20];
50 enum object_type type;
51 void *buf;
52 unsigned long size;
53 } *cached_objects;
54 static int cached_object_nr, cached_object_alloc;
56 static struct cached_object empty_tree = {
57 EMPTY_TREE_SHA1_BIN_LITERAL,
58 OBJ_TREE,
59 "",
63 static struct packed_git *last_found_pack;
65 static struct cached_object *find_cached_object(const unsigned char *sha1)
67 int i;
68 struct cached_object *co = cached_objects;
70 for (i = 0; i < cached_object_nr; i++, co++) {
71 if (!hashcmp(co->sha1, sha1))
72 return co;
74 if (!hashcmp(sha1, empty_tree.sha1))
75 return &empty_tree;
76 return NULL;
79 int mkdir_in_gitdir(const char *path)
81 if (mkdir(path, 0777)) {
82 int saved_errno = errno;
83 struct stat st;
84 struct strbuf sb = STRBUF_INIT;
86 if (errno != EEXIST)
87 return -1;
89 * Are we looking at a path in a symlinked worktree
90 * whose original repository does not yet have it?
91 * e.g. .git/rr-cache pointing at its original
92 * repository in which the user hasn't performed any
93 * conflict resolution yet?
95 if (lstat(path, &st) || !S_ISLNK(st.st_mode) ||
96 strbuf_readlink(&sb, path, st.st_size) ||
97 !is_absolute_path(sb.buf) ||
98 mkdir(sb.buf, 0777)) {
99 strbuf_release(&sb);
100 errno = saved_errno;
101 return -1;
103 strbuf_release(&sb);
105 return adjust_shared_perm(path);
108 enum scld_error safe_create_leading_directories(char *path)
110 char *next_component = path + offset_1st_component(path);
111 enum scld_error ret = SCLD_OK;
113 while (ret == SCLD_OK && next_component) {
114 struct stat st;
115 char *slash = strchr(next_component, '/');
117 if (!slash)
118 break;
120 next_component = slash + 1;
121 while (*next_component == '/')
122 next_component++;
123 if (!*next_component)
124 break;
126 *slash = '\0';
127 if (!stat(path, &st)) {
128 /* path exists */
129 if (!S_ISDIR(st.st_mode))
130 ret = SCLD_EXISTS;
131 } else if (mkdir(path, 0777)) {
132 if (errno == EEXIST &&
133 !stat(path, &st) && S_ISDIR(st.st_mode))
134 ; /* somebody created it since we checked */
135 else if (errno == ENOENT)
137 * Either mkdir() failed because
138 * somebody just pruned the containing
139 * directory, or stat() failed because
140 * the file that was in our way was
141 * just removed. Either way, inform
142 * the caller that it might be worth
143 * trying again:
145 ret = SCLD_VANISHED;
146 else
147 ret = SCLD_FAILED;
148 } else if (adjust_shared_perm(path)) {
149 ret = SCLD_PERMS;
151 *slash = '/';
153 return ret;
156 enum scld_error safe_create_leading_directories_const(const char *path)
158 /* path points to cache entries, so xstrdup before messing with it */
159 char *buf = xstrdup(path);
160 enum scld_error result = safe_create_leading_directories(buf);
161 free(buf);
162 return result;
165 static void fill_sha1_path(char *pathbuf, const unsigned char *sha1)
167 int i;
168 for (i = 0; i < 20; i++) {
169 static char hex[] = "0123456789abcdef";
170 unsigned int val = sha1[i];
171 char *pos = pathbuf + i*2 + (i > 0);
172 *pos++ = hex[val >> 4];
173 *pos = hex[val & 0xf];
178 * NOTE! This returns a statically allocated buffer, so you have to be
179 * careful about using it. Do an "xstrdup()" if you need to save the
180 * filename.
182 * Also note that this returns the location for creating. Reading
183 * SHA1 file can happen from any alternate directory listed in the
184 * DB_ENVIRONMENT environment variable if it is not found in
185 * the primary object database.
187 char *sha1_file_name(const unsigned char *sha1)
189 static char buf[PATH_MAX];
190 const char *objdir;
191 int len;
193 objdir = get_object_directory();
194 len = strlen(objdir);
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;
207 static char *sha1_get_pack_name(const unsigned char *sha1,
208 char **name, char **base, const char *which)
210 static const char hex[] = "0123456789abcdef";
211 char *buf;
212 int i;
214 if (!*base) {
215 const char *sha1_file_directory = get_object_directory();
216 int len = strlen(sha1_file_directory);
217 *base = xmalloc(len + 60);
218 sprintf(*base, "%s/pack/pack-1234567890123456789012345678901234567890.%s",
219 sha1_file_directory, which);
220 *name = *base + len + 11;
223 buf = *name;
225 for (i = 0; i < 20; i++) {
226 unsigned int val = *sha1++;
227 *buf++ = hex[val >> 4];
228 *buf++ = hex[val & 0xf];
231 return *base;
234 char *sha1_pack_name(const unsigned char *sha1)
236 static char *name, *base;
238 return sha1_get_pack_name(sha1, &name, &base, "pack");
241 char *sha1_pack_index_name(const unsigned char *sha1)
243 static char *name, *base;
245 return sha1_get_pack_name(sha1, &name, &base, "idx");
248 struct alternate_object_database *alt_odb_list;
249 static struct alternate_object_database **alt_odb_tail;
251 static int git_open_noatime(const char *name);
254 * Prepare alternate object database registry.
256 * The variable alt_odb_list points at the list of struct
257 * alternate_object_database. The elements on this list come from
258 * non-empty elements from colon separated ALTERNATE_DB_ENVIRONMENT
259 * environment variable, and $GIT_OBJECT_DIRECTORY/info/alternates,
260 * whose contents is similar to that environment variable but can be
261 * LF separated. Its base points at a statically allocated buffer that
262 * contains "/the/directory/corresponding/to/.git/objects/...", while
263 * its name points just after the slash at the end of ".git/objects/"
264 * in the example above, and has enough space to hold 40-byte hex
265 * SHA1, an extra slash for the first level indirection, and the
266 * terminating NUL.
268 static int link_alt_odb_entry(const char *entry, const char *relative_base, int depth)
270 const char *objdir = get_object_directory();
271 struct alternate_object_database *ent;
272 struct alternate_object_database *alt;
273 int pfxlen, entlen;
274 struct strbuf pathbuf = STRBUF_INIT;
276 if (!is_absolute_path(entry) && relative_base) {
277 strbuf_addstr(&pathbuf, real_path(relative_base));
278 strbuf_addch(&pathbuf, '/');
280 strbuf_addstr(&pathbuf, entry);
282 normalize_path_copy(pathbuf.buf, pathbuf.buf);
284 pfxlen = strlen(pathbuf.buf);
287 * The trailing slash after the directory name is given by
288 * this function at the end. Remove duplicates.
290 while (pfxlen && pathbuf.buf[pfxlen-1] == '/')
291 pfxlen -= 1;
293 entlen = pfxlen + 43; /* '/' + 2 hex + '/' + 38 hex + NUL */
294 ent = xmalloc(sizeof(*ent) + entlen);
295 memcpy(ent->base, pathbuf.buf, pfxlen);
296 strbuf_release(&pathbuf);
298 ent->name = ent->base + pfxlen + 1;
299 ent->base[pfxlen + 3] = '/';
300 ent->base[pfxlen] = ent->base[entlen-1] = 0;
302 /* Detect cases where alternate disappeared */
303 if (!is_directory(ent->base)) {
304 error("object directory %s does not exist; "
305 "check .git/objects/info/alternates.",
306 ent->base);
307 free(ent);
308 return -1;
311 /* Prevent the common mistake of listing the same
312 * thing twice, or object directory itself.
314 for (alt = alt_odb_list; alt; alt = alt->next) {
315 if (!memcmp(ent->base, alt->base, pfxlen)) {
316 free(ent);
317 return -1;
320 if (!strcmp(ent->base, objdir)) {
321 free(ent);
322 return -1;
325 /* add the alternate entry */
326 *alt_odb_tail = ent;
327 alt_odb_tail = &(ent->next);
328 ent->next = NULL;
330 /* recursively add alternates */
331 read_info_alternates(ent->base, depth + 1);
333 ent->base[pfxlen] = '/';
335 return 0;
338 static void link_alt_odb_entries(const char *alt, int len, int sep,
339 const char *relative_base, int depth)
341 struct string_list entries = STRING_LIST_INIT_NODUP;
342 char *alt_copy;
343 int i;
345 if (depth > 5) {
346 error("%s: ignoring alternate object stores, nesting too deep.",
347 relative_base);
348 return;
351 alt_copy = xmemdupz(alt, len);
352 string_list_split_in_place(&entries, alt_copy, sep, -1);
353 for (i = 0; i < entries.nr; i++) {
354 const char *entry = entries.items[i].string;
355 if (entry[0] == '\0' || entry[0] == '#')
356 continue;
357 if (!is_absolute_path(entry) && depth) {
358 error("%s: ignoring relative alternate object store %s",
359 relative_base, entry);
360 } else {
361 link_alt_odb_entry(entry, relative_base, depth);
364 string_list_clear(&entries, 0);
365 free(alt_copy);
368 void read_info_alternates(const char * relative_base, int depth)
370 char *map;
371 size_t mapsz;
372 struct stat st;
373 const char alt_file_name[] = "info/alternates";
374 /* Given that relative_base is no longer than PATH_MAX,
375 ensure that "path" has enough space to append "/", the
376 file name, "info/alternates", and a trailing NUL. */
377 char path[PATH_MAX + 1 + sizeof alt_file_name];
378 int fd;
380 sprintf(path, "%s/%s", relative_base, alt_file_name);
381 fd = git_open_noatime(path);
382 if (fd < 0)
383 return;
384 if (fstat(fd, &st) || (st.st_size == 0)) {
385 close(fd);
386 return;
388 mapsz = xsize_t(st.st_size);
389 map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
390 close(fd);
392 link_alt_odb_entries(map, mapsz, '\n', relative_base, depth);
394 munmap(map, mapsz);
397 void add_to_alternates_file(const char *reference)
399 struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
400 int fd = hold_lock_file_for_append(lock, git_path("objects/info/alternates"), LOCK_DIE_ON_ERROR);
401 char *alt = mkpath("%s\n", reference);
402 write_or_die(fd, alt, strlen(alt));
403 if (commit_lock_file(lock))
404 die("could not close alternates file");
405 if (alt_odb_tail)
406 link_alt_odb_entries(alt, strlen(alt), '\n', NULL, 0);
409 void foreach_alt_odb(alt_odb_fn fn, void *cb)
411 struct alternate_object_database *ent;
413 prepare_alt_odb();
414 for (ent = alt_odb_list; ent; ent = ent->next)
415 if (fn(ent, cb))
416 return;
419 void prepare_alt_odb(void)
421 const char *alt;
423 if (alt_odb_tail)
424 return;
426 alt = getenv(ALTERNATE_DB_ENVIRONMENT);
427 if (!alt) alt = "";
429 alt_odb_tail = &alt_odb_list;
430 link_alt_odb_entries(alt, strlen(alt), PATH_SEP, NULL, 0);
432 read_info_alternates(get_object_directory(), 0);
435 static int has_loose_object_local(const unsigned char *sha1)
437 char *name = sha1_file_name(sha1);
438 return !access(name, F_OK);
441 int has_loose_object_nonlocal(const unsigned char *sha1)
443 struct alternate_object_database *alt;
444 prepare_alt_odb();
445 for (alt = alt_odb_list; alt; alt = alt->next) {
446 fill_sha1_path(alt->name, sha1);
447 if (!access(alt->base, F_OK))
448 return 1;
450 return 0;
453 static int has_loose_object(const unsigned char *sha1)
455 return has_loose_object_local(sha1) ||
456 has_loose_object_nonlocal(sha1);
459 static unsigned int pack_used_ctr;
460 static unsigned int pack_mmap_calls;
461 static unsigned int peak_pack_open_windows;
462 static unsigned int pack_open_windows;
463 static unsigned int pack_open_fds;
464 static unsigned int pack_max_fds;
465 static size_t peak_pack_mapped;
466 static size_t pack_mapped;
467 struct packed_git *packed_git;
469 void pack_report(void)
471 fprintf(stderr,
472 "pack_report: getpagesize() = %10" SZ_FMT "\n"
473 "pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
474 "pack_report: core.packedGitLimit = %10" SZ_FMT "\n",
475 sz_fmt(getpagesize()),
476 sz_fmt(packed_git_window_size),
477 sz_fmt(packed_git_limit));
478 fprintf(stderr,
479 "pack_report: pack_used_ctr = %10u\n"
480 "pack_report: pack_mmap_calls = %10u\n"
481 "pack_report: pack_open_windows = %10u / %10u\n"
482 "pack_report: pack_mapped = "
483 "%10" SZ_FMT " / %10" SZ_FMT "\n",
484 pack_used_ctr,
485 pack_mmap_calls,
486 pack_open_windows, peak_pack_open_windows,
487 sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
490 static int check_packed_git_idx(const char *path, struct packed_git *p)
492 void *idx_map;
493 struct pack_idx_header *hdr;
494 size_t idx_size;
495 uint32_t version, nr, i, *index;
496 int fd = git_open_noatime(path);
497 struct stat st;
499 if (fd < 0)
500 return -1;
501 if (fstat(fd, &st)) {
502 close(fd);
503 return -1;
505 idx_size = xsize_t(st.st_size);
506 if (idx_size < 4 * 256 + 20 + 20) {
507 close(fd);
508 return error("index file %s is too small", path);
510 idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
511 close(fd);
513 hdr = idx_map;
514 if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
515 version = ntohl(hdr->idx_version);
516 if (version < 2 || version > 2) {
517 munmap(idx_map, idx_size);
518 return error("index file %s is version %"PRIu32
519 " and is not supported by this binary"
520 " (try upgrading GIT to a newer version)",
521 path, version);
523 } else
524 version = 1;
526 nr = 0;
527 index = idx_map;
528 if (version > 1)
529 index += 2; /* skip index header */
530 for (i = 0; i < 256; i++) {
531 uint32_t n = ntohl(index[i]);
532 if (n < nr) {
533 munmap(idx_map, idx_size);
534 return error("non-monotonic index %s", path);
536 nr = n;
539 if (version == 1) {
541 * Total size:
542 * - 256 index entries 4 bytes each
543 * - 24-byte entries * nr (20-byte sha1 + 4-byte offset)
544 * - 20-byte SHA1 of the packfile
545 * - 20-byte SHA1 file checksum
547 if (idx_size != 4*256 + nr * 24 + 20 + 20) {
548 munmap(idx_map, idx_size);
549 return error("wrong index v1 file size in %s", path);
551 } else if (version == 2) {
553 * Minimum size:
554 * - 8 bytes of header
555 * - 256 index entries 4 bytes each
556 * - 20-byte sha1 entry * nr
557 * - 4-byte crc entry * nr
558 * - 4-byte offset entry * nr
559 * - 20-byte SHA1 of the packfile
560 * - 20-byte SHA1 file checksum
561 * And after the 4-byte offset table might be a
562 * variable sized table containing 8-byte entries
563 * for offsets larger than 2^31.
565 unsigned long min_size = 8 + 4*256 + nr*(20 + 4 + 4) + 20 + 20;
566 unsigned long max_size = min_size;
567 if (nr)
568 max_size += (nr - 1)*8;
569 if (idx_size < min_size || idx_size > max_size) {
570 munmap(idx_map, idx_size);
571 return error("wrong index v2 file size in %s", path);
573 if (idx_size != min_size &&
575 * make sure we can deal with large pack offsets.
576 * 31-bit signed offset won't be enough, neither
577 * 32-bit unsigned one will be.
579 (sizeof(off_t) <= 4)) {
580 munmap(idx_map, idx_size);
581 return error("pack too large for current definition of off_t in %s", path);
585 p->index_version = version;
586 p->index_data = idx_map;
587 p->index_size = idx_size;
588 p->num_objects = nr;
589 return 0;
592 int open_pack_index(struct packed_git *p)
594 char *idx_name;
595 int ret;
597 if (p->index_data)
598 return 0;
600 idx_name = xstrdup(p->pack_name);
601 strcpy(idx_name + strlen(idx_name) - strlen(".pack"), ".idx");
602 ret = check_packed_git_idx(idx_name, p);
603 free(idx_name);
604 return ret;
607 static void scan_windows(struct packed_git *p,
608 struct packed_git **lru_p,
609 struct pack_window **lru_w,
610 struct pack_window **lru_l)
612 struct pack_window *w, *w_l;
614 for (w_l = NULL, w = p->windows; w; w = w->next) {
615 if (!w->inuse_cnt) {
616 if (!*lru_w || w->last_used < (*lru_w)->last_used) {
617 *lru_p = p;
618 *lru_w = w;
619 *lru_l = w_l;
622 w_l = w;
626 static int unuse_one_window(struct packed_git *current)
628 struct packed_git *p, *lru_p = NULL;
629 struct pack_window *lru_w = NULL, *lru_l = NULL;
631 if (current)
632 scan_windows(current, &lru_p, &lru_w, &lru_l);
633 for (p = packed_git; p; p = p->next)
634 scan_windows(p, &lru_p, &lru_w, &lru_l);
635 if (lru_p) {
636 munmap(lru_w->base, lru_w->len);
637 pack_mapped -= lru_w->len;
638 if (lru_l)
639 lru_l->next = lru_w->next;
640 else
641 lru_p->windows = lru_w->next;
642 free(lru_w);
643 pack_open_windows--;
644 return 1;
646 return 0;
649 void release_pack_memory(size_t need)
651 size_t cur = pack_mapped;
652 while (need >= (cur - pack_mapped) && unuse_one_window(NULL))
653 ; /* nothing */
656 void *xmmap(void *start, size_t length,
657 int prot, int flags, int fd, off_t offset)
659 void *ret = mmap(start, length, prot, flags, fd, offset);
660 if (ret == MAP_FAILED) {
661 if (!length)
662 return NULL;
663 release_pack_memory(length);
664 ret = mmap(start, length, prot, flags, fd, offset);
665 if (ret == MAP_FAILED)
666 die_errno("Out of memory? mmap failed");
668 return ret;
671 void close_pack_windows(struct packed_git *p)
673 while (p->windows) {
674 struct pack_window *w = p->windows;
676 if (w->inuse_cnt)
677 die("pack '%s' still has open windows to it",
678 p->pack_name);
679 munmap(w->base, w->len);
680 pack_mapped -= w->len;
681 pack_open_windows--;
682 p->windows = w->next;
683 free(w);
688 * The LRU pack is the one with the oldest MRU window, preferring packs
689 * with no used windows, or the oldest mtime if it has no windows allocated.
691 static void find_lru_pack(struct packed_git *p, struct packed_git **lru_p, struct pack_window **mru_w, int *accept_windows_inuse)
693 struct pack_window *w, *this_mru_w;
694 int has_windows_inuse = 0;
697 * Reject this pack if it has windows and the previously selected
698 * one does not. If this pack does not have windows, reject
699 * it if the pack file is newer than the previously selected one.
701 if (*lru_p && !*mru_w && (p->windows || p->mtime > (*lru_p)->mtime))
702 return;
704 for (w = this_mru_w = p->windows; w; w = w->next) {
706 * Reject this pack if any of its windows are in use,
707 * but the previously selected pack did not have any
708 * inuse windows. Otherwise, record that this pack
709 * has windows in use.
711 if (w->inuse_cnt) {
712 if (*accept_windows_inuse)
713 has_windows_inuse = 1;
714 else
715 return;
718 if (w->last_used > this_mru_w->last_used)
719 this_mru_w = w;
722 * Reject this pack if it has windows that have been
723 * used more recently than the previously selected pack.
724 * If the previously selected pack had windows inuse and
725 * we have not encountered a window in this pack that is
726 * inuse, skip this check since we prefer a pack with no
727 * inuse windows to one that has inuse windows.
729 if (*mru_w && *accept_windows_inuse == has_windows_inuse &&
730 this_mru_w->last_used > (*mru_w)->last_used)
731 return;
735 * Select this pack.
737 *mru_w = this_mru_w;
738 *lru_p = p;
739 *accept_windows_inuse = has_windows_inuse;
742 static int close_one_pack(void)
744 struct packed_git *p, *lru_p = NULL;
745 struct pack_window *mru_w = NULL;
746 int accept_windows_inuse = 1;
748 for (p = packed_git; p; p = p->next) {
749 if (p->pack_fd == -1)
750 continue;
751 find_lru_pack(p, &lru_p, &mru_w, &accept_windows_inuse);
754 if (lru_p) {
755 close(lru_p->pack_fd);
756 pack_open_fds--;
757 lru_p->pack_fd = -1;
758 return 1;
761 return 0;
764 void unuse_pack(struct pack_window **w_cursor)
766 struct pack_window *w = *w_cursor;
767 if (w) {
768 w->inuse_cnt--;
769 *w_cursor = NULL;
773 void close_pack_index(struct packed_git *p)
775 if (p->index_data) {
776 munmap((void *)p->index_data, p->index_size);
777 p->index_data = NULL;
782 * This is used by git-repack in case a newly created pack happens to
783 * contain the same set of objects as an existing one. In that case
784 * the resulting file might be different even if its name would be the
785 * same. It is best to close any reference to the old pack before it is
786 * replaced on disk. Of course no index pointers nor windows for given pack
787 * must subsist at this point. If ever objects from this pack are requested
788 * again, the new version of the pack will be reinitialized through
789 * reprepare_packed_git().
791 void free_pack_by_name(const char *pack_name)
793 struct packed_git *p, **pp = &packed_git;
795 while (*pp) {
796 p = *pp;
797 if (strcmp(pack_name, p->pack_name) == 0) {
798 clear_delta_base_cache();
799 close_pack_windows(p);
800 if (p->pack_fd != -1) {
801 close(p->pack_fd);
802 pack_open_fds--;
804 close_pack_index(p);
805 free(p->bad_object_sha1);
806 *pp = p->next;
807 if (last_found_pack == p)
808 last_found_pack = NULL;
809 free(p);
810 return;
812 pp = &p->next;
816 static unsigned int get_max_fd_limit(void)
818 #ifdef RLIMIT_NOFILE
820 struct rlimit lim;
822 if (!getrlimit(RLIMIT_NOFILE, &lim))
823 return lim.rlim_cur;
825 #endif
827 #ifdef _SC_OPEN_MAX
829 long open_max = sysconf(_SC_OPEN_MAX);
830 if (0 < open_max)
831 return open_max;
833 * Otherwise, we got -1 for one of the two
834 * reasons:
836 * (1) sysconf() did not understand _SC_OPEN_MAX
837 * and signaled an error with -1; or
838 * (2) sysconf() said there is no limit.
840 * We _could_ clear errno before calling sysconf() to
841 * tell these two cases apart and return a huge number
842 * in the latter case to let the caller cap it to a
843 * value that is not so selfish, but letting the
844 * fallback OPEN_MAX codepath take care of these cases
845 * is a lot simpler.
848 #endif
850 #ifdef OPEN_MAX
851 return OPEN_MAX;
852 #else
853 return 1; /* see the caller ;-) */
854 #endif
858 * Do not call this directly as this leaks p->pack_fd on error return;
859 * call open_packed_git() instead.
861 static int open_packed_git_1(struct packed_git *p)
863 struct stat st;
864 struct pack_header hdr;
865 unsigned char sha1[20];
866 unsigned char *idx_sha1;
867 long fd_flag;
869 if (!p->index_data && open_pack_index(p))
870 return error("packfile %s index unavailable", p->pack_name);
872 if (!pack_max_fds) {
873 unsigned int max_fds = get_max_fd_limit();
875 /* Save 3 for stdin/stdout/stderr, 22 for work */
876 if (25 < max_fds)
877 pack_max_fds = max_fds - 25;
878 else
879 pack_max_fds = 1;
882 while (pack_max_fds <= pack_open_fds && close_one_pack())
883 ; /* nothing */
885 p->pack_fd = git_open_noatime(p->pack_name);
886 if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
887 return -1;
888 pack_open_fds++;
890 /* If we created the struct before we had the pack we lack size. */
891 if (!p->pack_size) {
892 if (!S_ISREG(st.st_mode))
893 return error("packfile %s not a regular file", p->pack_name);
894 p->pack_size = st.st_size;
895 } else if (p->pack_size != st.st_size)
896 return error("packfile %s size changed", p->pack_name);
898 /* We leave these file descriptors open with sliding mmap;
899 * there is no point keeping them open across exec(), though.
901 fd_flag = fcntl(p->pack_fd, F_GETFD, 0);
902 if (fd_flag < 0)
903 return error("cannot determine file descriptor flags");
904 fd_flag |= FD_CLOEXEC;
905 if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
906 return error("cannot set FD_CLOEXEC");
908 /* Verify we recognize this pack file format. */
909 if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
910 return error("file %s is far too short to be a packfile", p->pack_name);
911 if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
912 return error("file %s is not a GIT packfile", p->pack_name);
913 if (!pack_version_ok(hdr.hdr_version))
914 return error("packfile %s is version %"PRIu32" and not"
915 " supported (try upgrading GIT to a newer version)",
916 p->pack_name, ntohl(hdr.hdr_version));
918 /* Verify the pack matches its index. */
919 if (p->num_objects != ntohl(hdr.hdr_entries))
920 return error("packfile %s claims to have %"PRIu32" objects"
921 " while index indicates %"PRIu32" objects",
922 p->pack_name, ntohl(hdr.hdr_entries),
923 p->num_objects);
924 if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
925 return error("end of packfile %s is unavailable", p->pack_name);
926 if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
927 return error("packfile %s signature is unavailable", p->pack_name);
928 idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
929 if (hashcmp(sha1, idx_sha1))
930 return error("packfile %s does not match index", p->pack_name);
931 return 0;
934 static int open_packed_git(struct packed_git *p)
936 if (!open_packed_git_1(p))
937 return 0;
938 if (p->pack_fd != -1) {
939 close(p->pack_fd);
940 pack_open_fds--;
941 p->pack_fd = -1;
943 return -1;
946 static int in_window(struct pack_window *win, off_t offset)
948 /* We must promise at least 20 bytes (one hash) after the
949 * offset is available from this window, otherwise the offset
950 * is not actually in this window and a different window (which
951 * has that one hash excess) must be used. This is to support
952 * the object header and delta base parsing routines below.
954 off_t win_off = win->offset;
955 return win_off <= offset
956 && (offset + 20) <= (win_off + win->len);
959 unsigned char *use_pack(struct packed_git *p,
960 struct pack_window **w_cursor,
961 off_t offset,
962 unsigned long *left)
964 struct pack_window *win = *w_cursor;
966 /* Since packfiles end in a hash of their content and it's
967 * pointless to ask for an offset into the middle of that
968 * hash, and the in_window function above wouldn't match
969 * don't allow an offset too close to the end of the file.
971 if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p))
972 die("packfile %s cannot be accessed", p->pack_name);
973 if (offset > (p->pack_size - 20))
974 die("offset beyond end of packfile (truncated pack?)");
976 if (!win || !in_window(win, offset)) {
977 if (win)
978 win->inuse_cnt--;
979 for (win = p->windows; win; win = win->next) {
980 if (in_window(win, offset))
981 break;
983 if (!win) {
984 size_t window_align = packed_git_window_size / 2;
985 off_t len;
987 if (p->pack_fd == -1 && open_packed_git(p))
988 die("packfile %s cannot be accessed", p->pack_name);
990 win = xcalloc(1, sizeof(*win));
991 win->offset = (offset / window_align) * window_align;
992 len = p->pack_size - win->offset;
993 if (len > packed_git_window_size)
994 len = packed_git_window_size;
995 win->len = (size_t)len;
996 pack_mapped += win->len;
997 while (packed_git_limit < pack_mapped
998 && unuse_one_window(p))
999 ; /* nothing */
1000 win->base = xmmap(NULL, win->len,
1001 PROT_READ, MAP_PRIVATE,
1002 p->pack_fd, win->offset);
1003 if (win->base == MAP_FAILED)
1004 die("packfile %s cannot be mapped: %s",
1005 p->pack_name,
1006 strerror(errno));
1007 if (!win->offset && win->len == p->pack_size
1008 && !p->do_not_close) {
1009 close(p->pack_fd);
1010 pack_open_fds--;
1011 p->pack_fd = -1;
1013 pack_mmap_calls++;
1014 pack_open_windows++;
1015 if (pack_mapped > peak_pack_mapped)
1016 peak_pack_mapped = pack_mapped;
1017 if (pack_open_windows > peak_pack_open_windows)
1018 peak_pack_open_windows = pack_open_windows;
1019 win->next = p->windows;
1020 p->windows = win;
1023 if (win != *w_cursor) {
1024 win->last_used = pack_used_ctr++;
1025 win->inuse_cnt++;
1026 *w_cursor = win;
1028 offset -= win->offset;
1029 if (left)
1030 *left = win->len - xsize_t(offset);
1031 return win->base + offset;
1034 static struct packed_git *alloc_packed_git(int extra)
1036 struct packed_git *p = xmalloc(sizeof(*p) + extra);
1037 memset(p, 0, sizeof(*p));
1038 p->pack_fd = -1;
1039 return p;
1042 static void try_to_free_pack_memory(size_t size)
1044 release_pack_memory(size);
1047 struct packed_git *add_packed_git(const char *path, int path_len, int local)
1049 static int have_set_try_to_free_routine;
1050 struct stat st;
1051 struct packed_git *p = alloc_packed_git(path_len + 2);
1053 if (!have_set_try_to_free_routine) {
1054 have_set_try_to_free_routine = 1;
1055 set_try_to_free_routine(try_to_free_pack_memory);
1059 * Make sure a corresponding .pack file exists and that
1060 * the index looks sane.
1062 path_len -= strlen(".idx");
1063 if (path_len < 1) {
1064 free(p);
1065 return NULL;
1067 memcpy(p->pack_name, path, path_len);
1069 strcpy(p->pack_name + path_len, ".keep");
1070 if (!access(p->pack_name, F_OK))
1071 p->pack_keep = 1;
1073 strcpy(p->pack_name + path_len, ".pack");
1074 if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
1075 free(p);
1076 return NULL;
1079 /* ok, it looks sane as far as we can check without
1080 * actually mapping the pack file.
1082 p->pack_size = st.st_size;
1083 p->pack_local = local;
1084 p->mtime = st.st_mtime;
1085 if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
1086 hashclr(p->sha1);
1087 return p;
1090 struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
1092 const char *path = sha1_pack_name(sha1);
1093 struct packed_git *p = alloc_packed_git(strlen(path) + 1);
1095 strcpy(p->pack_name, path);
1096 hashcpy(p->sha1, sha1);
1097 if (check_packed_git_idx(idx_path, p)) {
1098 free(p);
1099 return NULL;
1102 return p;
1105 void install_packed_git(struct packed_git *pack)
1107 if (pack->pack_fd != -1)
1108 pack_open_fds++;
1110 pack->next = packed_git;
1111 packed_git = pack;
1114 void (*report_garbage)(const char *desc, const char *path);
1116 static void report_helper(const struct string_list *list,
1117 int seen_bits, int first, int last)
1119 const char *msg;
1120 switch (seen_bits) {
1121 case 0:
1122 msg = "no corresponding .idx nor .pack";
1123 break;
1124 case 1:
1125 msg = "no corresponding .idx";
1126 break;
1127 case 2:
1128 msg = "no corresponding .pack";
1129 break;
1130 default:
1131 return;
1133 for (; first < last; first++)
1134 report_garbage(msg, list->items[first].string);
1137 static void report_pack_garbage(struct string_list *list)
1139 int i, baselen = -1, first = 0, seen_bits = 0;
1141 if (!report_garbage)
1142 return;
1144 sort_string_list(list);
1146 for (i = 0; i < list->nr; i++) {
1147 const char *path = list->items[i].string;
1148 if (baselen != -1 &&
1149 strncmp(path, list->items[first].string, baselen)) {
1150 report_helper(list, seen_bits, first, i);
1151 baselen = -1;
1152 seen_bits = 0;
1154 if (baselen == -1) {
1155 const char *dot = strrchr(path, '.');
1156 if (!dot) {
1157 report_garbage("garbage found", path);
1158 continue;
1160 baselen = dot - path + 1;
1161 first = i;
1163 if (!strcmp(path + baselen, "pack"))
1164 seen_bits |= 1;
1165 else if (!strcmp(path + baselen, "idx"))
1166 seen_bits |= 2;
1168 report_helper(list, seen_bits, first, list->nr);
1171 static void prepare_packed_git_one(char *objdir, int local)
1173 /* Ensure that this buffer is large enough so that we can
1174 append "/pack/" without clobbering the stack even if
1175 strlen(objdir) were PATH_MAX. */
1176 char path[PATH_MAX + 1 + 4 + 1 + 1];
1177 int len;
1178 DIR *dir;
1179 struct dirent *de;
1180 struct string_list garbage = STRING_LIST_INIT_DUP;
1182 sprintf(path, "%s/pack", objdir);
1183 len = strlen(path);
1184 dir = opendir(path);
1185 if (!dir) {
1186 if (errno != ENOENT)
1187 error("unable to open object pack directory: %s: %s",
1188 path, strerror(errno));
1189 return;
1191 path[len++] = '/';
1192 while ((de = readdir(dir)) != NULL) {
1193 int namelen = strlen(de->d_name);
1194 struct packed_git *p;
1196 if (len + namelen + 1 > sizeof(path)) {
1197 if (report_garbage) {
1198 struct strbuf sb = STRBUF_INIT;
1199 strbuf_addf(&sb, "%.*s/%s", len - 1, path, de->d_name);
1200 report_garbage("path too long", sb.buf);
1201 strbuf_release(&sb);
1203 continue;
1206 if (is_dot_or_dotdot(de->d_name))
1207 continue;
1209 strcpy(path + len, de->d_name);
1211 if (has_extension(de->d_name, ".idx")) {
1212 /* Don't reopen a pack we already have. */
1213 for (p = packed_git; p; p = p->next) {
1214 if (!memcmp(path, p->pack_name, len + namelen - 4))
1215 break;
1217 if (p == NULL &&
1219 * See if it really is a valid .idx file with
1220 * corresponding .pack file that we can map.
1222 (p = add_packed_git(path, len + namelen, local)) != NULL)
1223 install_packed_git(p);
1226 if (!report_garbage)
1227 continue;
1229 if (has_extension(de->d_name, ".idx") ||
1230 has_extension(de->d_name, ".pack") ||
1231 has_extension(de->d_name, ".keep"))
1232 string_list_append(&garbage, path);
1233 else
1234 report_garbage("garbage found", path);
1236 closedir(dir);
1237 report_pack_garbage(&garbage);
1238 string_list_clear(&garbage, 0);
1241 static int sort_pack(const void *a_, const void *b_)
1243 struct packed_git *a = *((struct packed_git **)a_);
1244 struct packed_git *b = *((struct packed_git **)b_);
1245 int st;
1248 * Local packs tend to contain objects specific to our
1249 * variant of the project than remote ones. In addition,
1250 * remote ones could be on a network mounted filesystem.
1251 * Favor local ones for these reasons.
1253 st = a->pack_local - b->pack_local;
1254 if (st)
1255 return -st;
1258 * Younger packs tend to contain more recent objects,
1259 * and more recent objects tend to get accessed more
1260 * often.
1262 if (a->mtime < b->mtime)
1263 return 1;
1264 else if (a->mtime == b->mtime)
1265 return 0;
1266 return -1;
1269 static void rearrange_packed_git(void)
1271 struct packed_git **ary, *p;
1272 int i, n;
1274 for (n = 0, p = packed_git; p; p = p->next)
1275 n++;
1276 if (n < 2)
1277 return;
1279 /* prepare an array of packed_git for easier sorting */
1280 ary = xcalloc(n, sizeof(struct packed_git *));
1281 for (n = 0, p = packed_git; p; p = p->next)
1282 ary[n++] = p;
1284 qsort(ary, n, sizeof(struct packed_git *), sort_pack);
1286 /* link them back again */
1287 for (i = 0; i < n - 1; i++)
1288 ary[i]->next = ary[i + 1];
1289 ary[n - 1]->next = NULL;
1290 packed_git = ary[0];
1292 free(ary);
1295 static int prepare_packed_git_run_once = 0;
1296 void prepare_packed_git(void)
1298 struct alternate_object_database *alt;
1300 if (prepare_packed_git_run_once)
1301 return;
1302 prepare_packed_git_one(get_object_directory(), 1);
1303 prepare_alt_odb();
1304 for (alt = alt_odb_list; alt; alt = alt->next) {
1305 alt->name[-1] = 0;
1306 prepare_packed_git_one(alt->base, 0);
1307 alt->name[-1] = '/';
1309 rearrange_packed_git();
1310 prepare_packed_git_run_once = 1;
1313 void reprepare_packed_git(void)
1315 discard_revindex();
1316 prepare_packed_git_run_once = 0;
1317 prepare_packed_git();
1320 static void mark_bad_packed_object(struct packed_git *p,
1321 const unsigned char *sha1)
1323 unsigned i;
1324 for (i = 0; i < p->num_bad_objects; i++)
1325 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1326 return;
1327 p->bad_object_sha1 = xrealloc(p->bad_object_sha1, 20 * (p->num_bad_objects + 1));
1328 hashcpy(p->bad_object_sha1 + 20 * p->num_bad_objects, sha1);
1329 p->num_bad_objects++;
1332 static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1334 struct packed_git *p;
1335 unsigned i;
1337 for (p = packed_git; p; p = p->next)
1338 for (i = 0; i < p->num_bad_objects; i++)
1339 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1340 return p;
1341 return NULL;
1345 * With an in-core object data in "map", rehash it to make sure the
1346 * object name actually matches "sha1" to detect object corruption.
1347 * With "map" == NULL, try reading the object named with "sha1" using
1348 * the streaming interface and rehash it to do the same.
1350 int check_sha1_signature(const unsigned char *sha1, void *map,
1351 unsigned long size, const char *type)
1353 unsigned char real_sha1[20];
1354 enum object_type obj_type;
1355 struct git_istream *st;
1356 git_SHA_CTX c;
1357 char hdr[32];
1358 int hdrlen;
1360 if (map) {
1361 hash_sha1_file(map, size, type, real_sha1);
1362 return hashcmp(sha1, real_sha1) ? -1 : 0;
1365 st = open_istream(sha1, &obj_type, &size, NULL);
1366 if (!st)
1367 return -1;
1369 /* Generate the header */
1370 hdrlen = sprintf(hdr, "%s %lu", typename(obj_type), size) + 1;
1372 /* Sha1.. */
1373 git_SHA1_Init(&c);
1374 git_SHA1_Update(&c, hdr, hdrlen);
1375 for (;;) {
1376 char buf[1024 * 16];
1377 ssize_t readlen = read_istream(st, buf, sizeof(buf));
1379 if (readlen < 0) {
1380 close_istream(st);
1381 return -1;
1383 if (!readlen)
1384 break;
1385 git_SHA1_Update(&c, buf, readlen);
1387 git_SHA1_Final(real_sha1, &c);
1388 close_istream(st);
1389 return hashcmp(sha1, real_sha1) ? -1 : 0;
1392 static int git_open_noatime(const char *name)
1394 static int sha1_file_open_flag = O_NOATIME;
1396 for (;;) {
1397 int fd = open(name, O_RDONLY | sha1_file_open_flag);
1398 if (fd >= 0)
1399 return fd;
1401 /* Might the failure be due to O_NOATIME? */
1402 if (errno != ENOENT && sha1_file_open_flag) {
1403 sha1_file_open_flag = 0;
1404 continue;
1407 return -1;
1411 static int stat_sha1_file(const unsigned char *sha1, struct stat *st)
1413 char *name = sha1_file_name(sha1);
1414 struct alternate_object_database *alt;
1416 if (!lstat(name, st))
1417 return 0;
1419 prepare_alt_odb();
1420 errno = ENOENT;
1421 for (alt = alt_odb_list; alt; alt = alt->next) {
1422 name = alt->name;
1423 fill_sha1_path(name, sha1);
1424 if (!lstat(alt->base, st))
1425 return 0;
1428 return -1;
1431 static int open_sha1_file(const unsigned char *sha1)
1433 int fd;
1434 char *name = sha1_file_name(sha1);
1435 struct alternate_object_database *alt;
1437 fd = git_open_noatime(name);
1438 if (fd >= 0)
1439 return fd;
1441 prepare_alt_odb();
1442 errno = ENOENT;
1443 for (alt = alt_odb_list; alt; alt = alt->next) {
1444 name = alt->name;
1445 fill_sha1_path(name, sha1);
1446 fd = git_open_noatime(alt->base);
1447 if (fd >= 0)
1448 return fd;
1450 return -1;
1453 void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1455 void *map;
1456 int fd;
1458 fd = open_sha1_file(sha1);
1459 map = NULL;
1460 if (fd >= 0) {
1461 struct stat st;
1463 if (!fstat(fd, &st)) {
1464 *size = xsize_t(st.st_size);
1465 if (!*size) {
1466 /* mmap() is forbidden on empty files */
1467 error("object file %s is empty", sha1_file_name(sha1));
1468 return NULL;
1470 map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1472 close(fd);
1474 return map;
1477 unsigned long unpack_object_header_buffer(const unsigned char *buf,
1478 unsigned long len, enum object_type *type, unsigned long *sizep)
1480 unsigned shift;
1481 unsigned long size, c;
1482 unsigned long used = 0;
1484 c = buf[used++];
1485 *type = (c >> 4) & 7;
1486 size = c & 15;
1487 shift = 4;
1488 while (c & 0x80) {
1489 if (len <= used || bitsizeof(long) <= shift) {
1490 error("bad object header");
1491 size = used = 0;
1492 break;
1494 c = buf[used++];
1495 size += (c & 0x7f) << shift;
1496 shift += 7;
1498 *sizep = size;
1499 return used;
1502 int unpack_sha1_header(git_zstream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
1504 /* Get the data stream */
1505 memset(stream, 0, sizeof(*stream));
1506 stream->next_in = map;
1507 stream->avail_in = mapsize;
1508 stream->next_out = buffer;
1509 stream->avail_out = bufsiz;
1511 git_inflate_init(stream);
1512 return git_inflate(stream, 0);
1515 static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1517 int bytes = strlen(buffer) + 1;
1518 unsigned char *buf = xmallocz(size);
1519 unsigned long n;
1520 int status = Z_OK;
1522 n = stream->total_out - bytes;
1523 if (n > size)
1524 n = size;
1525 memcpy(buf, (char *) buffer + bytes, n);
1526 bytes = n;
1527 if (bytes <= size) {
1529 * The above condition must be (bytes <= size), not
1530 * (bytes < size). In other words, even though we
1531 * expect no more output and set avail_out to zero,
1532 * the input zlib stream may have bytes that express
1533 * "this concludes the stream", and we *do* want to
1534 * eat that input.
1536 * Otherwise we would not be able to test that we
1537 * consumed all the input to reach the expected size;
1538 * we also want to check that zlib tells us that all
1539 * went well with status == Z_STREAM_END at the end.
1541 stream->next_out = buf + bytes;
1542 stream->avail_out = size - bytes;
1543 while (status == Z_OK)
1544 status = git_inflate(stream, Z_FINISH);
1546 if (status == Z_STREAM_END && !stream->avail_in) {
1547 git_inflate_end(stream);
1548 return buf;
1551 if (status < 0)
1552 error("corrupt loose object '%s'", sha1_to_hex(sha1));
1553 else if (stream->avail_in)
1554 error("garbage at end of loose object '%s'",
1555 sha1_to_hex(sha1));
1556 free(buf);
1557 return NULL;
1561 * We used to just use "sscanf()", but that's actually way
1562 * too permissive for what we want to check. So do an anal
1563 * object header parse by hand.
1565 int parse_sha1_header(const char *hdr, unsigned long *sizep)
1567 char type[10];
1568 int i;
1569 unsigned long size;
1572 * The type can be at most ten bytes (including the
1573 * terminating '\0' that we add), and is followed by
1574 * a space.
1576 i = 0;
1577 for (;;) {
1578 char c = *hdr++;
1579 if (c == ' ')
1580 break;
1581 type[i++] = c;
1582 if (i >= sizeof(type))
1583 return -1;
1585 type[i] = 0;
1588 * The length must follow immediately, and be in canonical
1589 * decimal format (ie "010" is not valid).
1591 size = *hdr++ - '0';
1592 if (size > 9)
1593 return -1;
1594 if (size) {
1595 for (;;) {
1596 unsigned long c = *hdr - '0';
1597 if (c > 9)
1598 break;
1599 hdr++;
1600 size = size * 10 + c;
1603 *sizep = size;
1606 * The length must be followed by a zero byte
1608 return *hdr ? -1 : type_from_string(type);
1611 static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1613 int ret;
1614 git_zstream stream;
1615 char hdr[8192];
1617 ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1618 if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1619 return NULL;
1621 return unpack_sha1_rest(&stream, hdr, *size, sha1);
1624 unsigned long get_size_from_delta(struct packed_git *p,
1625 struct pack_window **w_curs,
1626 off_t curpos)
1628 const unsigned char *data;
1629 unsigned char delta_head[20], *in;
1630 git_zstream stream;
1631 int st;
1633 memset(&stream, 0, sizeof(stream));
1634 stream.next_out = delta_head;
1635 stream.avail_out = sizeof(delta_head);
1637 git_inflate_init(&stream);
1638 do {
1639 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1640 stream.next_in = in;
1641 st = git_inflate(&stream, Z_FINISH);
1642 curpos += stream.next_in - in;
1643 } while ((st == Z_OK || st == Z_BUF_ERROR) &&
1644 stream.total_out < sizeof(delta_head));
1645 git_inflate_end(&stream);
1646 if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
1647 error("delta data unpack-initial failed");
1648 return 0;
1651 /* Examine the initial part of the delta to figure out
1652 * the result size.
1654 data = delta_head;
1656 /* ignore base size */
1657 get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1659 /* Read the result size */
1660 return get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1663 static off_t get_delta_base(struct packed_git *p,
1664 struct pack_window **w_curs,
1665 off_t *curpos,
1666 enum object_type type,
1667 off_t delta_obj_offset)
1669 unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1670 off_t base_offset;
1672 /* use_pack() assured us we have [base_info, base_info + 20)
1673 * as a range that we can look at without walking off the
1674 * end of the mapped window. Its actually the hash size
1675 * that is assured. An OFS_DELTA longer than the hash size
1676 * is stupid, as then a REF_DELTA would be smaller to store.
1678 if (type == OBJ_OFS_DELTA) {
1679 unsigned used = 0;
1680 unsigned char c = base_info[used++];
1681 base_offset = c & 127;
1682 while (c & 128) {
1683 base_offset += 1;
1684 if (!base_offset || MSB(base_offset, 7))
1685 return 0; /* overflow */
1686 c = base_info[used++];
1687 base_offset = (base_offset << 7) + (c & 127);
1689 base_offset = delta_obj_offset - base_offset;
1690 if (base_offset <= 0 || base_offset >= delta_obj_offset)
1691 return 0; /* out of bound */
1692 *curpos += used;
1693 } else if (type == OBJ_REF_DELTA) {
1694 /* The base entry _must_ be in the same pack */
1695 base_offset = find_pack_entry_one(base_info, p);
1696 *curpos += 20;
1697 } else
1698 die("I am totally screwed");
1699 return base_offset;
1703 * Like get_delta_base above, but we return the sha1 instead of the pack
1704 * offset. This means it is cheaper for REF deltas (we do not have to do
1705 * the final object lookup), but more expensive for OFS deltas (we
1706 * have to load the revidx to convert the offset back into a sha1).
1708 static const unsigned char *get_delta_base_sha1(struct packed_git *p,
1709 struct pack_window **w_curs,
1710 off_t curpos,
1711 enum object_type type,
1712 off_t delta_obj_offset)
1714 if (type == OBJ_REF_DELTA) {
1715 unsigned char *base = use_pack(p, w_curs, curpos, NULL);
1716 return base;
1717 } else if (type == OBJ_OFS_DELTA) {
1718 struct revindex_entry *revidx;
1719 off_t base_offset = get_delta_base(p, w_curs, &curpos,
1720 type, delta_obj_offset);
1722 if (!base_offset)
1723 return NULL;
1725 revidx = find_pack_revindex(p, base_offset);
1726 if (!revidx)
1727 return NULL;
1729 return nth_packed_object_sha1(p, revidx->nr);
1730 } else
1731 return NULL;
1734 int unpack_object_header(struct packed_git *p,
1735 struct pack_window **w_curs,
1736 off_t *curpos,
1737 unsigned long *sizep)
1739 unsigned char *base;
1740 unsigned long left;
1741 unsigned long used;
1742 enum object_type type;
1744 /* use_pack() assures us we have [base, base + 20) available
1745 * as a range that we can look at. (Its actually the hash
1746 * size that is assured.) With our object header encoding
1747 * the maximum deflated object size is 2^137, which is just
1748 * insane, so we know won't exceed what we have been given.
1750 base = use_pack(p, w_curs, *curpos, &left);
1751 used = unpack_object_header_buffer(base, left, &type, sizep);
1752 if (!used) {
1753 type = OBJ_BAD;
1754 } else
1755 *curpos += used;
1757 return type;
1760 static int retry_bad_packed_offset(struct packed_git *p, off_t obj_offset)
1762 int type;
1763 struct revindex_entry *revidx;
1764 const unsigned char *sha1;
1765 revidx = find_pack_revindex(p, obj_offset);
1766 if (!revidx)
1767 return OBJ_BAD;
1768 sha1 = nth_packed_object_sha1(p, revidx->nr);
1769 mark_bad_packed_object(p, sha1);
1770 type = sha1_object_info(sha1, NULL);
1771 if (type <= OBJ_NONE)
1772 return OBJ_BAD;
1773 return type;
1776 #define POI_STACK_PREALLOC 64
1778 static enum object_type packed_to_object_type(struct packed_git *p,
1779 off_t obj_offset,
1780 enum object_type type,
1781 struct pack_window **w_curs,
1782 off_t curpos)
1784 off_t small_poi_stack[POI_STACK_PREALLOC];
1785 off_t *poi_stack = small_poi_stack;
1786 int poi_stack_nr = 0, poi_stack_alloc = POI_STACK_PREALLOC;
1788 while (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1789 off_t base_offset;
1790 unsigned long size;
1791 /* Push the object we're going to leave behind */
1792 if (poi_stack_nr >= poi_stack_alloc && poi_stack == small_poi_stack) {
1793 poi_stack_alloc = alloc_nr(poi_stack_nr);
1794 poi_stack = xmalloc(sizeof(off_t)*poi_stack_alloc);
1795 memcpy(poi_stack, small_poi_stack, sizeof(off_t)*poi_stack_nr);
1796 } else {
1797 ALLOC_GROW(poi_stack, poi_stack_nr+1, poi_stack_alloc);
1799 poi_stack[poi_stack_nr++] = obj_offset;
1800 /* If parsing the base offset fails, just unwind */
1801 base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1802 if (!base_offset)
1803 goto unwind;
1804 curpos = obj_offset = base_offset;
1805 type = unpack_object_header(p, w_curs, &curpos, &size);
1806 if (type <= OBJ_NONE) {
1807 /* If getting the base itself fails, we first
1808 * retry the base, otherwise unwind */
1809 type = retry_bad_packed_offset(p, base_offset);
1810 if (type > OBJ_NONE)
1811 goto out;
1812 goto unwind;
1816 switch (type) {
1817 case OBJ_BAD:
1818 case OBJ_COMMIT:
1819 case OBJ_TREE:
1820 case OBJ_BLOB:
1821 case OBJ_TAG:
1822 break;
1823 default:
1824 error("unknown object type %i at offset %"PRIuMAX" in %s",
1825 type, (uintmax_t)obj_offset, p->pack_name);
1826 type = OBJ_BAD;
1829 out:
1830 if (poi_stack != small_poi_stack)
1831 free(poi_stack);
1832 return type;
1834 unwind:
1835 while (poi_stack_nr) {
1836 obj_offset = poi_stack[--poi_stack_nr];
1837 type = retry_bad_packed_offset(p, obj_offset);
1838 if (type > OBJ_NONE)
1839 goto out;
1841 type = OBJ_BAD;
1842 goto out;
1845 static int packed_object_info(struct packed_git *p, off_t obj_offset,
1846 struct object_info *oi)
1848 struct pack_window *w_curs = NULL;
1849 unsigned long size;
1850 off_t curpos = obj_offset;
1851 enum object_type type;
1854 * We always get the representation type, but only convert it to
1855 * a "real" type later if the caller is interested.
1857 type = unpack_object_header(p, &w_curs, &curpos, &size);
1859 if (oi->sizep) {
1860 if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1861 off_t tmp_pos = curpos;
1862 off_t base_offset = get_delta_base(p, &w_curs, &tmp_pos,
1863 type, obj_offset);
1864 if (!base_offset) {
1865 type = OBJ_BAD;
1866 goto out;
1868 *oi->sizep = get_size_from_delta(p, &w_curs, tmp_pos);
1869 if (*oi->sizep == 0) {
1870 type = OBJ_BAD;
1871 goto out;
1873 } else {
1874 *oi->sizep = size;
1878 if (oi->disk_sizep) {
1879 struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
1880 *oi->disk_sizep = revidx[1].offset - obj_offset;
1883 if (oi->typep) {
1884 *oi->typep = packed_to_object_type(p, obj_offset, type, &w_curs, curpos);
1885 if (*oi->typep < 0) {
1886 type = OBJ_BAD;
1887 goto out;
1891 if (oi->delta_base_sha1) {
1892 if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1893 const unsigned char *base;
1895 base = get_delta_base_sha1(p, &w_curs, curpos,
1896 type, obj_offset);
1897 if (!base) {
1898 type = OBJ_BAD;
1899 goto out;
1902 hashcpy(oi->delta_base_sha1, base);
1903 } else
1904 hashclr(oi->delta_base_sha1);
1907 out:
1908 unuse_pack(&w_curs);
1909 return type;
1912 static void *unpack_compressed_entry(struct packed_git *p,
1913 struct pack_window **w_curs,
1914 off_t curpos,
1915 unsigned long size)
1917 int st;
1918 git_zstream stream;
1919 unsigned char *buffer, *in;
1921 buffer = xmallocz(size);
1922 memset(&stream, 0, sizeof(stream));
1923 stream.next_out = buffer;
1924 stream.avail_out = size + 1;
1926 git_inflate_init(&stream);
1927 do {
1928 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1929 stream.next_in = in;
1930 st = git_inflate(&stream, Z_FINISH);
1931 if (!stream.avail_out)
1932 break; /* the payload is larger than it should be */
1933 curpos += stream.next_in - in;
1934 } while (st == Z_OK || st == Z_BUF_ERROR);
1935 git_inflate_end(&stream);
1936 if ((st != Z_STREAM_END) || stream.total_out != size) {
1937 free(buffer);
1938 return NULL;
1941 return buffer;
1944 #define MAX_DELTA_CACHE (256)
1946 static size_t delta_base_cached;
1948 static struct delta_base_cache_lru_list {
1949 struct delta_base_cache_lru_list *prev;
1950 struct delta_base_cache_lru_list *next;
1951 } delta_base_cache_lru = { &delta_base_cache_lru, &delta_base_cache_lru };
1953 static struct delta_base_cache_entry {
1954 struct delta_base_cache_lru_list lru;
1955 void *data;
1956 struct packed_git *p;
1957 off_t base_offset;
1958 unsigned long size;
1959 enum object_type type;
1960 } delta_base_cache[MAX_DELTA_CACHE];
1962 static unsigned long pack_entry_hash(struct packed_git *p, off_t base_offset)
1964 unsigned long hash;
1966 hash = (unsigned long)p + (unsigned long)base_offset;
1967 hash += (hash >> 8) + (hash >> 16);
1968 return hash % MAX_DELTA_CACHE;
1971 static struct delta_base_cache_entry *
1972 get_delta_base_cache_entry(struct packed_git *p, off_t base_offset)
1974 unsigned long hash = pack_entry_hash(p, base_offset);
1975 return delta_base_cache + hash;
1978 static int eq_delta_base_cache_entry(struct delta_base_cache_entry *ent,
1979 struct packed_git *p, off_t base_offset)
1981 return (ent->data && ent->p == p && ent->base_offset == base_offset);
1984 static int in_delta_base_cache(struct packed_git *p, off_t base_offset)
1986 struct delta_base_cache_entry *ent;
1987 ent = get_delta_base_cache_entry(p, base_offset);
1988 return eq_delta_base_cache_entry(ent, p, base_offset);
1991 static void clear_delta_base_cache_entry(struct delta_base_cache_entry *ent)
1993 ent->data = NULL;
1994 ent->lru.next->prev = ent->lru.prev;
1995 ent->lru.prev->next = ent->lru.next;
1996 delta_base_cached -= ent->size;
1999 static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
2000 unsigned long *base_size, enum object_type *type, int keep_cache)
2002 struct delta_base_cache_entry *ent;
2003 void *ret;
2005 ent = get_delta_base_cache_entry(p, base_offset);
2007 if (!eq_delta_base_cache_entry(ent, p, base_offset))
2008 return unpack_entry(p, base_offset, type, base_size);
2010 ret = ent->data;
2012 if (!keep_cache)
2013 clear_delta_base_cache_entry(ent);
2014 else
2015 ret = xmemdupz(ent->data, ent->size);
2016 *type = ent->type;
2017 *base_size = ent->size;
2018 return ret;
2021 static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
2023 if (ent->data) {
2024 free(ent->data);
2025 ent->data = NULL;
2026 ent->lru.next->prev = ent->lru.prev;
2027 ent->lru.prev->next = ent->lru.next;
2028 delta_base_cached -= ent->size;
2032 void clear_delta_base_cache(void)
2034 unsigned long p;
2035 for (p = 0; p < MAX_DELTA_CACHE; p++)
2036 release_delta_base_cache(&delta_base_cache[p]);
2039 static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
2040 void *base, unsigned long base_size, enum object_type type)
2042 unsigned long hash = pack_entry_hash(p, base_offset);
2043 struct delta_base_cache_entry *ent = delta_base_cache + hash;
2044 struct delta_base_cache_lru_list *lru;
2046 release_delta_base_cache(ent);
2047 delta_base_cached += base_size;
2049 for (lru = delta_base_cache_lru.next;
2050 delta_base_cached > delta_base_cache_limit
2051 && lru != &delta_base_cache_lru;
2052 lru = lru->next) {
2053 struct delta_base_cache_entry *f = (void *)lru;
2054 if (f->type == OBJ_BLOB)
2055 release_delta_base_cache(f);
2057 for (lru = delta_base_cache_lru.next;
2058 delta_base_cached > delta_base_cache_limit
2059 && lru != &delta_base_cache_lru;
2060 lru = lru->next) {
2061 struct delta_base_cache_entry *f = (void *)lru;
2062 release_delta_base_cache(f);
2065 ent->p = p;
2066 ent->base_offset = base_offset;
2067 ent->type = type;
2068 ent->data = base;
2069 ent->size = base_size;
2070 ent->lru.next = &delta_base_cache_lru;
2071 ent->lru.prev = delta_base_cache_lru.prev;
2072 delta_base_cache_lru.prev->next = &ent->lru;
2073 delta_base_cache_lru.prev = &ent->lru;
2076 static void *read_object(const unsigned char *sha1, enum object_type *type,
2077 unsigned long *size);
2079 static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
2081 static FILE *log_file;
2083 if (!log_pack_access)
2084 log_pack_access = getenv("GIT_TRACE_PACK_ACCESS");
2085 if (!log_pack_access)
2086 log_pack_access = no_log_pack_access;
2087 if (log_pack_access == no_log_pack_access)
2088 return;
2090 if (!log_file) {
2091 log_file = fopen(log_pack_access, "w");
2092 if (!log_file) {
2093 error("cannot open pack access log '%s' for writing: %s",
2094 log_pack_access, strerror(errno));
2095 log_pack_access = no_log_pack_access;
2096 return;
2099 fprintf(log_file, "%s %"PRIuMAX"\n",
2100 p->pack_name, (uintmax_t)obj_offset);
2101 fflush(log_file);
2104 int do_check_packed_object_crc;
2106 #define UNPACK_ENTRY_STACK_PREALLOC 64
2107 struct unpack_entry_stack_ent {
2108 off_t obj_offset;
2109 off_t curpos;
2110 unsigned long size;
2113 void *unpack_entry(struct packed_git *p, off_t obj_offset,
2114 enum object_type *final_type, unsigned long *final_size)
2116 struct pack_window *w_curs = NULL;
2117 off_t curpos = obj_offset;
2118 void *data = NULL;
2119 unsigned long size;
2120 enum object_type type;
2121 struct unpack_entry_stack_ent small_delta_stack[UNPACK_ENTRY_STACK_PREALLOC];
2122 struct unpack_entry_stack_ent *delta_stack = small_delta_stack;
2123 int delta_stack_nr = 0, delta_stack_alloc = UNPACK_ENTRY_STACK_PREALLOC;
2124 int base_from_cache = 0;
2126 if (log_pack_access != no_log_pack_access)
2127 write_pack_access_log(p, obj_offset);
2129 /* PHASE 1: drill down to the innermost base object */
2130 for (;;) {
2131 off_t base_offset;
2132 int i;
2133 struct delta_base_cache_entry *ent;
2135 ent = get_delta_base_cache_entry(p, curpos);
2136 if (eq_delta_base_cache_entry(ent, p, curpos)) {
2137 type = ent->type;
2138 data = ent->data;
2139 size = ent->size;
2140 clear_delta_base_cache_entry(ent);
2141 base_from_cache = 1;
2142 break;
2145 if (do_check_packed_object_crc && p->index_version > 1) {
2146 struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2147 unsigned long len = revidx[1].offset - obj_offset;
2148 if (check_pack_crc(p, &w_curs, obj_offset, len, revidx->nr)) {
2149 const unsigned char *sha1 =
2150 nth_packed_object_sha1(p, revidx->nr);
2151 error("bad packed object CRC for %s",
2152 sha1_to_hex(sha1));
2153 mark_bad_packed_object(p, sha1);
2154 unuse_pack(&w_curs);
2155 return NULL;
2159 type = unpack_object_header(p, &w_curs, &curpos, &size);
2160 if (type != OBJ_OFS_DELTA && type != OBJ_REF_DELTA)
2161 break;
2163 base_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
2164 if (!base_offset) {
2165 error("failed to validate delta base reference "
2166 "at offset %"PRIuMAX" from %s",
2167 (uintmax_t)curpos, p->pack_name);
2168 /* bail to phase 2, in hopes of recovery */
2169 data = NULL;
2170 break;
2173 /* push object, proceed to base */
2174 if (delta_stack_nr >= delta_stack_alloc
2175 && delta_stack == small_delta_stack) {
2176 delta_stack_alloc = alloc_nr(delta_stack_nr);
2177 delta_stack = xmalloc(sizeof(*delta_stack)*delta_stack_alloc);
2178 memcpy(delta_stack, small_delta_stack,
2179 sizeof(*delta_stack)*delta_stack_nr);
2180 } else {
2181 ALLOC_GROW(delta_stack, delta_stack_nr+1, delta_stack_alloc);
2183 i = delta_stack_nr++;
2184 delta_stack[i].obj_offset = obj_offset;
2185 delta_stack[i].curpos = curpos;
2186 delta_stack[i].size = size;
2188 curpos = obj_offset = base_offset;
2191 /* PHASE 2: handle the base */
2192 switch (type) {
2193 case OBJ_OFS_DELTA:
2194 case OBJ_REF_DELTA:
2195 if (data)
2196 die("BUG in unpack_entry: left loop at a valid delta");
2197 break;
2198 case OBJ_COMMIT:
2199 case OBJ_TREE:
2200 case OBJ_BLOB:
2201 case OBJ_TAG:
2202 if (!base_from_cache)
2203 data = unpack_compressed_entry(p, &w_curs, curpos, size);
2204 break;
2205 default:
2206 data = NULL;
2207 error("unknown object type %i at offset %"PRIuMAX" in %s",
2208 type, (uintmax_t)obj_offset, p->pack_name);
2211 /* PHASE 3: apply deltas in order */
2213 /* invariants:
2214 * 'data' holds the base data, or NULL if there was corruption
2216 while (delta_stack_nr) {
2217 void *delta_data;
2218 void *base = data;
2219 unsigned long delta_size, base_size = size;
2220 int i;
2222 data = NULL;
2224 if (base)
2225 add_delta_base_cache(p, obj_offset, base, base_size, type);
2227 if (!base) {
2229 * We're probably in deep shit, but let's try to fetch
2230 * the required base anyway from another pack or loose.
2231 * This is costly but should happen only in the presence
2232 * of a corrupted pack, and is better than failing outright.
2234 struct revindex_entry *revidx;
2235 const unsigned char *base_sha1;
2236 revidx = find_pack_revindex(p, obj_offset);
2237 if (revidx) {
2238 base_sha1 = nth_packed_object_sha1(p, revidx->nr);
2239 error("failed to read delta base object %s"
2240 " at offset %"PRIuMAX" from %s",
2241 sha1_to_hex(base_sha1), (uintmax_t)obj_offset,
2242 p->pack_name);
2243 mark_bad_packed_object(p, base_sha1);
2244 base = read_object(base_sha1, &type, &base_size);
2248 i = --delta_stack_nr;
2249 obj_offset = delta_stack[i].obj_offset;
2250 curpos = delta_stack[i].curpos;
2251 delta_size = delta_stack[i].size;
2253 if (!base)
2254 continue;
2256 delta_data = unpack_compressed_entry(p, &w_curs, curpos, delta_size);
2258 if (!delta_data) {
2259 error("failed to unpack compressed delta "
2260 "at offset %"PRIuMAX" from %s",
2261 (uintmax_t)curpos, p->pack_name);
2262 data = NULL;
2263 continue;
2266 data = patch_delta(base, base_size,
2267 delta_data, delta_size,
2268 &size);
2271 * We could not apply the delta; warn the user, but keep going.
2272 * Our failure will be noticed either in the next iteration of
2273 * the loop, or if this is the final delta, in the caller when
2274 * we return NULL. Those code paths will take care of making
2275 * a more explicit warning and retrying with another copy of
2276 * the object.
2278 if (!data)
2279 error("failed to apply delta");
2281 free(delta_data);
2284 *final_type = type;
2285 *final_size = size;
2287 unuse_pack(&w_curs);
2288 return data;
2291 const unsigned char *nth_packed_object_sha1(struct packed_git *p,
2292 uint32_t n)
2294 const unsigned char *index = p->index_data;
2295 if (!index) {
2296 if (open_pack_index(p))
2297 return NULL;
2298 index = p->index_data;
2300 if (n >= p->num_objects)
2301 return NULL;
2302 index += 4 * 256;
2303 if (p->index_version == 1) {
2304 return index + 24 * n + 4;
2305 } else {
2306 index += 8;
2307 return index + 20 * n;
2311 off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
2313 const unsigned char *index = p->index_data;
2314 index += 4 * 256;
2315 if (p->index_version == 1) {
2316 return ntohl(*((uint32_t *)(index + 24 * n)));
2317 } else {
2318 uint32_t off;
2319 index += 8 + p->num_objects * (20 + 4);
2320 off = ntohl(*((uint32_t *)(index + 4 * n)));
2321 if (!(off & 0x80000000))
2322 return off;
2323 index += p->num_objects * 4 + (off & 0x7fffffff) * 8;
2324 return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
2325 ntohl(*((uint32_t *)(index + 4)));
2329 off_t find_pack_entry_one(const unsigned char *sha1,
2330 struct packed_git *p)
2332 const uint32_t *level1_ofs = p->index_data;
2333 const unsigned char *index = p->index_data;
2334 unsigned hi, lo, stride;
2335 static int use_lookup = -1;
2336 static int debug_lookup = -1;
2338 if (debug_lookup < 0)
2339 debug_lookup = !!getenv("GIT_DEBUG_LOOKUP");
2341 if (!index) {
2342 if (open_pack_index(p))
2343 return 0;
2344 level1_ofs = p->index_data;
2345 index = p->index_data;
2347 if (p->index_version > 1) {
2348 level1_ofs += 2;
2349 index += 8;
2351 index += 4 * 256;
2352 hi = ntohl(level1_ofs[*sha1]);
2353 lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
2354 if (p->index_version > 1) {
2355 stride = 20;
2356 } else {
2357 stride = 24;
2358 index += 4;
2361 if (debug_lookup)
2362 printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
2363 sha1[0], sha1[1], sha1[2], lo, hi, p->num_objects);
2365 if (use_lookup < 0)
2366 use_lookup = !!getenv("GIT_USE_LOOKUP");
2367 if (use_lookup) {
2368 int pos = sha1_entry_pos(index, stride, 0,
2369 lo, hi, p->num_objects, sha1);
2370 if (pos < 0)
2371 return 0;
2372 return nth_packed_object_offset(p, pos);
2375 do {
2376 unsigned mi = (lo + hi) / 2;
2377 int cmp = hashcmp(index + mi * stride, sha1);
2379 if (debug_lookup)
2380 printf("lo %u hi %u rg %u mi %u\n",
2381 lo, hi, hi - lo, mi);
2382 if (!cmp)
2383 return nth_packed_object_offset(p, mi);
2384 if (cmp > 0)
2385 hi = mi;
2386 else
2387 lo = mi+1;
2388 } while (lo < hi);
2389 return 0;
2392 int is_pack_valid(struct packed_git *p)
2394 /* An already open pack is known to be valid. */
2395 if (p->pack_fd != -1)
2396 return 1;
2398 /* If the pack has one window completely covering the
2399 * file size, the pack is known to be valid even if
2400 * the descriptor is not currently open.
2402 if (p->windows) {
2403 struct pack_window *w = p->windows;
2405 if (!w->offset && w->len == p->pack_size)
2406 return 1;
2409 /* Force the pack to open to prove its valid. */
2410 return !open_packed_git(p);
2413 static int fill_pack_entry(const unsigned char *sha1,
2414 struct pack_entry *e,
2415 struct packed_git *p)
2417 off_t offset;
2419 if (p->num_bad_objects) {
2420 unsigned i;
2421 for (i = 0; i < p->num_bad_objects; i++)
2422 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
2423 return 0;
2426 offset = find_pack_entry_one(sha1, p);
2427 if (!offset)
2428 return 0;
2431 * We are about to tell the caller where they can locate the
2432 * requested object. We better make sure the packfile is
2433 * still here and can be accessed before supplying that
2434 * answer, as it may have been deleted since the index was
2435 * loaded!
2437 if (!is_pack_valid(p)) {
2438 warning("packfile %s cannot be accessed", p->pack_name);
2439 return 0;
2441 e->offset = offset;
2442 e->p = p;
2443 hashcpy(e->sha1, sha1);
2444 return 1;
2447 static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e)
2449 struct packed_git *p;
2451 prepare_packed_git();
2452 if (!packed_git)
2453 return 0;
2455 if (last_found_pack && fill_pack_entry(sha1, e, last_found_pack))
2456 return 1;
2458 for (p = packed_git; p; p = p->next) {
2459 if (p == last_found_pack || !fill_pack_entry(sha1, e, p))
2460 continue;
2462 last_found_pack = p;
2463 return 1;
2465 return 0;
2468 struct packed_git *find_sha1_pack(const unsigned char *sha1,
2469 struct packed_git *packs)
2471 struct packed_git *p;
2473 for (p = packs; p; p = p->next) {
2474 if (find_pack_entry_one(sha1, p))
2475 return p;
2477 return NULL;
2481 static int sha1_loose_object_info(const unsigned char *sha1,
2482 struct object_info *oi)
2484 int status;
2485 unsigned long mapsize, size;
2486 void *map;
2487 git_zstream stream;
2488 char hdr[32];
2490 if (oi->delta_base_sha1)
2491 hashclr(oi->delta_base_sha1);
2494 * If we don't care about type or size, then we don't
2495 * need to look inside the object at all. Note that we
2496 * do not optimize out the stat call, even if the
2497 * caller doesn't care about the disk-size, since our
2498 * return value implicitly indicates whether the
2499 * object even exists.
2501 if (!oi->typep && !oi->sizep) {
2502 struct stat st;
2503 if (stat_sha1_file(sha1, &st) < 0)
2504 return -1;
2505 if (oi->disk_sizep)
2506 *oi->disk_sizep = st.st_size;
2507 return 0;
2510 map = map_sha1_file(sha1, &mapsize);
2511 if (!map)
2512 return -1;
2513 if (oi->disk_sizep)
2514 *oi->disk_sizep = mapsize;
2515 if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
2516 status = error("unable to unpack %s header",
2517 sha1_to_hex(sha1));
2518 else if ((status = parse_sha1_header(hdr, &size)) < 0)
2519 status = error("unable to parse %s header", sha1_to_hex(sha1));
2520 else if (oi->sizep)
2521 *oi->sizep = size;
2522 git_inflate_end(&stream);
2523 munmap(map, mapsize);
2524 if (oi->typep)
2525 *oi->typep = status;
2526 return 0;
2529 int sha1_object_info_extended(const unsigned char *sha1, struct object_info *oi, unsigned flags)
2531 struct cached_object *co;
2532 struct pack_entry e;
2533 int rtype;
2534 const unsigned char *real = lookup_replace_object_extended(sha1, flags);
2536 co = find_cached_object(real);
2537 if (co) {
2538 if (oi->typep)
2539 *(oi->typep) = co->type;
2540 if (oi->sizep)
2541 *(oi->sizep) = co->size;
2542 if (oi->disk_sizep)
2543 *(oi->disk_sizep) = 0;
2544 if (oi->delta_base_sha1)
2545 hashclr(oi->delta_base_sha1);
2546 oi->whence = OI_CACHED;
2547 return 0;
2550 if (!find_pack_entry(real, &e)) {
2551 /* Most likely it's a loose object. */
2552 if (!sha1_loose_object_info(real, oi)) {
2553 oi->whence = OI_LOOSE;
2554 return 0;
2557 /* Not a loose object; someone else may have just packed it. */
2558 reprepare_packed_git();
2559 if (!find_pack_entry(real, &e))
2560 return -1;
2563 rtype = packed_object_info(e.p, e.offset, oi);
2564 if (rtype < 0) {
2565 mark_bad_packed_object(e.p, real);
2566 return sha1_object_info_extended(real, oi, 0);
2567 } else if (in_delta_base_cache(e.p, e.offset)) {
2568 oi->whence = OI_DBCACHED;
2569 } else {
2570 oi->whence = OI_PACKED;
2571 oi->u.packed.offset = e.offset;
2572 oi->u.packed.pack = e.p;
2573 oi->u.packed.is_delta = (rtype == OBJ_REF_DELTA ||
2574 rtype == OBJ_OFS_DELTA);
2577 return 0;
2580 /* returns enum object_type or negative */
2581 int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
2583 enum object_type type;
2584 struct object_info oi = {NULL};
2586 oi.typep = &type;
2587 oi.sizep = sizep;
2588 if (sha1_object_info_extended(sha1, &oi, LOOKUP_REPLACE_OBJECT) < 0)
2589 return -1;
2590 return type;
2593 static void *read_packed_sha1(const unsigned char *sha1,
2594 enum object_type *type, unsigned long *size)
2596 struct pack_entry e;
2597 void *data;
2599 if (!find_pack_entry(sha1, &e))
2600 return NULL;
2601 data = cache_or_unpack_entry(e.p, e.offset, size, type, 1);
2602 if (!data) {
2604 * We're probably in deep shit, but let's try to fetch
2605 * the required object anyway from another pack or loose.
2606 * This should happen only in the presence of a corrupted
2607 * pack, and is better than failing outright.
2609 error("failed to read object %s at offset %"PRIuMAX" from %s",
2610 sha1_to_hex(sha1), (uintmax_t)e.offset, e.p->pack_name);
2611 mark_bad_packed_object(e.p, sha1);
2612 data = read_object(sha1, type, size);
2614 return data;
2617 int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
2618 unsigned char *sha1)
2620 struct cached_object *co;
2622 hash_sha1_file(buf, len, typename(type), sha1);
2623 if (has_sha1_file(sha1) || find_cached_object(sha1))
2624 return 0;
2625 if (cached_object_alloc <= cached_object_nr) {
2626 cached_object_alloc = alloc_nr(cached_object_alloc);
2627 cached_objects = xrealloc(cached_objects,
2628 sizeof(*cached_objects) *
2629 cached_object_alloc);
2631 co = &cached_objects[cached_object_nr++];
2632 co->size = len;
2633 co->type = type;
2634 co->buf = xmalloc(len);
2635 memcpy(co->buf, buf, len);
2636 hashcpy(co->sha1, sha1);
2637 return 0;
2640 static void *read_object(const unsigned char *sha1, enum object_type *type,
2641 unsigned long *size)
2643 unsigned long mapsize;
2644 void *map, *buf;
2645 struct cached_object *co;
2647 co = find_cached_object(sha1);
2648 if (co) {
2649 *type = co->type;
2650 *size = co->size;
2651 return xmemdupz(co->buf, co->size);
2654 buf = read_packed_sha1(sha1, type, size);
2655 if (buf)
2656 return buf;
2657 map = map_sha1_file(sha1, &mapsize);
2658 if (map) {
2659 buf = unpack_sha1_file(map, mapsize, type, size, sha1);
2660 munmap(map, mapsize);
2661 return buf;
2663 reprepare_packed_git();
2664 return read_packed_sha1(sha1, type, size);
2668 * This function dies on corrupt objects; the callers who want to
2669 * deal with them should arrange to call read_object() and give error
2670 * messages themselves.
2672 void *read_sha1_file_extended(const unsigned char *sha1,
2673 enum object_type *type,
2674 unsigned long *size,
2675 unsigned flag)
2677 void *data;
2678 char *path;
2679 const struct packed_git *p;
2680 const unsigned char *repl = lookup_replace_object_extended(sha1, flag);
2682 errno = 0;
2683 data = read_object(repl, type, size);
2684 if (data)
2685 return data;
2687 if (errno && errno != ENOENT)
2688 die_errno("failed to read object %s", sha1_to_hex(sha1));
2690 /* die if we replaced an object with one that does not exist */
2691 if (repl != sha1)
2692 die("replacement %s not found for %s",
2693 sha1_to_hex(repl), sha1_to_hex(sha1));
2695 if (has_loose_object(repl)) {
2696 path = sha1_file_name(sha1);
2697 die("loose object %s (stored in %s) is corrupt",
2698 sha1_to_hex(repl), path);
2701 if ((p = has_packed_and_bad(repl)) != NULL)
2702 die("packed object %s (stored in %s) is corrupt",
2703 sha1_to_hex(repl), p->pack_name);
2705 return NULL;
2708 void *read_object_with_reference(const unsigned char *sha1,
2709 const char *required_type_name,
2710 unsigned long *size,
2711 unsigned char *actual_sha1_return)
2713 enum object_type type, required_type;
2714 void *buffer;
2715 unsigned long isize;
2716 unsigned char actual_sha1[20];
2718 required_type = type_from_string(required_type_name);
2719 hashcpy(actual_sha1, sha1);
2720 while (1) {
2721 int ref_length = -1;
2722 const char *ref_type = NULL;
2724 buffer = read_sha1_file(actual_sha1, &type, &isize);
2725 if (!buffer)
2726 return NULL;
2727 if (type == required_type) {
2728 *size = isize;
2729 if (actual_sha1_return)
2730 hashcpy(actual_sha1_return, actual_sha1);
2731 return buffer;
2733 /* Handle references */
2734 else if (type == OBJ_COMMIT)
2735 ref_type = "tree ";
2736 else if (type == OBJ_TAG)
2737 ref_type = "object ";
2738 else {
2739 free(buffer);
2740 return NULL;
2742 ref_length = strlen(ref_type);
2744 if (ref_length + 40 > isize ||
2745 memcmp(buffer, ref_type, ref_length) ||
2746 get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
2747 free(buffer);
2748 return NULL;
2750 free(buffer);
2751 /* Now we have the ID of the referred-to object in
2752 * actual_sha1. Check again. */
2756 static void write_sha1_file_prepare(const void *buf, unsigned long len,
2757 const char *type, unsigned char *sha1,
2758 char *hdr, int *hdrlen)
2760 git_SHA_CTX c;
2762 /* Generate the header */
2763 *hdrlen = sprintf(hdr, "%s %lu", type, len)+1;
2765 /* Sha1.. */
2766 git_SHA1_Init(&c);
2767 git_SHA1_Update(&c, hdr, *hdrlen);
2768 git_SHA1_Update(&c, buf, len);
2769 git_SHA1_Final(sha1, &c);
2773 * Move the just written object into its final resting place.
2774 * NEEDSWORK: this should be renamed to finalize_temp_file() as
2775 * "moving" is only a part of what it does, when no patch between
2776 * master to pu changes the call sites of this function.
2778 int move_temp_to_file(const char *tmpfile, const char *filename)
2780 int ret = 0;
2782 if (object_creation_mode == OBJECT_CREATION_USES_RENAMES)
2783 goto try_rename;
2784 else if (link(tmpfile, filename))
2785 ret = errno;
2788 * Coda hack - coda doesn't like cross-directory links,
2789 * so we fall back to a rename, which will mean that it
2790 * won't be able to check collisions, but that's not a
2791 * big deal.
2793 * The same holds for FAT formatted media.
2795 * When this succeeds, we just return. We have nothing
2796 * left to unlink.
2798 if (ret && ret != EEXIST) {
2799 try_rename:
2800 if (!rename(tmpfile, filename))
2801 goto out;
2802 ret = errno;
2804 unlink_or_warn(tmpfile);
2805 if (ret) {
2806 if (ret != EEXIST) {
2807 return error("unable to write sha1 filename %s: %s", filename, strerror(ret));
2809 /* FIXME!!! Collision check here ? */
2812 out:
2813 if (adjust_shared_perm(filename))
2814 return error("unable to set permission to '%s'", filename);
2815 return 0;
2818 static int write_buffer(int fd, const void *buf, size_t len)
2820 if (write_in_full(fd, buf, len) < 0)
2821 return error("file write error (%s)", strerror(errno));
2822 return 0;
2825 int hash_sha1_file(const void *buf, unsigned long len, const char *type,
2826 unsigned char *sha1)
2828 char hdr[32];
2829 int hdrlen;
2830 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2831 return 0;
2834 /* Finalize a file on disk, and close it. */
2835 static void close_sha1_file(int fd)
2837 if (fsync_object_files)
2838 fsync_or_die(fd, "sha1 file");
2839 if (close(fd) != 0)
2840 die_errno("error when closing sha1 file");
2843 /* Size of directory component, including the ending '/' */
2844 static inline int directory_size(const char *filename)
2846 const char *s = strrchr(filename, '/');
2847 if (!s)
2848 return 0;
2849 return s - filename + 1;
2853 * This creates a temporary file in the same directory as the final
2854 * 'filename'
2856 * We want to avoid cross-directory filename renames, because those
2857 * can have problems on various filesystems (FAT, NFS, Coda).
2859 static int create_tmpfile(char *buffer, size_t bufsiz, const char *filename)
2861 int fd, dirlen = directory_size(filename);
2863 if (dirlen + 20 > bufsiz) {
2864 errno = ENAMETOOLONG;
2865 return -1;
2867 memcpy(buffer, filename, dirlen);
2868 strcpy(buffer + dirlen, "tmp_obj_XXXXXX");
2869 fd = git_mkstemp_mode(buffer, 0444);
2870 if (fd < 0 && dirlen && errno == ENOENT) {
2871 /* Make sure the directory exists */
2872 memcpy(buffer, filename, dirlen);
2873 buffer[dirlen-1] = 0;
2874 if (mkdir(buffer, 0777) && errno != EEXIST)
2875 return -1;
2876 if (adjust_shared_perm(buffer))
2877 return -1;
2879 /* Try again */
2880 strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX");
2881 fd = git_mkstemp_mode(buffer, 0444);
2883 return fd;
2886 static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
2887 const void *buf, unsigned long len, time_t mtime)
2889 int fd, ret;
2890 unsigned char compressed[4096];
2891 git_zstream stream;
2892 git_SHA_CTX c;
2893 unsigned char parano_sha1[20];
2894 char *filename;
2895 static char tmp_file[PATH_MAX];
2897 filename = sha1_file_name(sha1);
2898 fd = create_tmpfile(tmp_file, sizeof(tmp_file), filename);
2899 if (fd < 0) {
2900 if (errno == EACCES)
2901 return error("insufficient permission for adding an object to repository database %s", get_object_directory());
2902 else
2903 return error("unable to create temporary file: %s", strerror(errno));
2906 /* Set it up */
2907 memset(&stream, 0, sizeof(stream));
2908 git_deflate_init(&stream, zlib_compression_level);
2909 stream.next_out = compressed;
2910 stream.avail_out = sizeof(compressed);
2911 git_SHA1_Init(&c);
2913 /* First header.. */
2914 stream.next_in = (unsigned char *)hdr;
2915 stream.avail_in = hdrlen;
2916 while (git_deflate(&stream, 0) == Z_OK)
2917 ; /* nothing */
2918 git_SHA1_Update(&c, hdr, hdrlen);
2920 /* Then the data itself.. */
2921 stream.next_in = (void *)buf;
2922 stream.avail_in = len;
2923 do {
2924 unsigned char *in0 = stream.next_in;
2925 ret = git_deflate(&stream, Z_FINISH);
2926 git_SHA1_Update(&c, in0, stream.next_in - in0);
2927 if (write_buffer(fd, compressed, stream.next_out - compressed) < 0)
2928 die("unable to write sha1 file");
2929 stream.next_out = compressed;
2930 stream.avail_out = sizeof(compressed);
2931 } while (ret == Z_OK);
2933 if (ret != Z_STREAM_END)
2934 die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
2935 ret = git_deflate_end_gently(&stream);
2936 if (ret != Z_OK)
2937 die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
2938 git_SHA1_Final(parano_sha1, &c);
2939 if (hashcmp(sha1, parano_sha1) != 0)
2940 die("confused by unstable object source data for %s", sha1_to_hex(sha1));
2942 close_sha1_file(fd);
2944 if (mtime) {
2945 struct utimbuf utb;
2946 utb.actime = mtime;
2947 utb.modtime = mtime;
2948 if (utime(tmp_file, &utb) < 0)
2949 warning("failed utime() on %s: %s",
2950 tmp_file, strerror(errno));
2953 return move_temp_to_file(tmp_file, filename);
2956 int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2958 unsigned char sha1[20];
2959 char hdr[32];
2960 int hdrlen;
2962 /* Normally if we have it in the pack then we do not bother writing
2963 * it out into .git/objects/??/?{38} file.
2965 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2966 if (returnsha1)
2967 hashcpy(returnsha1, sha1);
2968 if (has_sha1_file(sha1))
2969 return 0;
2970 return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
2973 int force_object_loose(const unsigned char *sha1, time_t mtime)
2975 void *buf;
2976 unsigned long len;
2977 enum object_type type;
2978 char hdr[32];
2979 int hdrlen;
2980 int ret;
2982 if (has_loose_object(sha1))
2983 return 0;
2984 buf = read_packed_sha1(sha1, &type, &len);
2985 if (!buf)
2986 return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
2987 hdrlen = sprintf(hdr, "%s %lu", typename(type), len) + 1;
2988 ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
2989 free(buf);
2991 return ret;
2994 int has_pack_index(const unsigned char *sha1)
2996 struct stat st;
2997 if (stat(sha1_pack_index_name(sha1), &st))
2998 return 0;
2999 return 1;
3002 int has_sha1_pack(const unsigned char *sha1)
3004 struct pack_entry e;
3005 return find_pack_entry(sha1, &e);
3008 int has_sha1_file(const unsigned char *sha1)
3010 struct pack_entry e;
3012 if (find_pack_entry(sha1, &e))
3013 return 1;
3014 if (has_loose_object(sha1))
3015 return 1;
3016 reprepare_packed_git();
3017 return find_pack_entry(sha1, &e);
3020 static void check_tree(const void *buf, size_t size)
3022 struct tree_desc desc;
3023 struct name_entry entry;
3025 init_tree_desc(&desc, buf, size);
3026 while (tree_entry(&desc, &entry))
3027 /* do nothing
3028 * tree_entry() will die() on malformed entries */
3032 static void check_commit(const void *buf, size_t size)
3034 struct commit c;
3035 memset(&c, 0, sizeof(c));
3036 if (parse_commit_buffer(&c, buf, size))
3037 die("corrupt commit");
3040 static void check_tag(const void *buf, size_t size)
3042 struct tag t;
3043 memset(&t, 0, sizeof(t));
3044 if (parse_tag_buffer(&t, buf, size))
3045 die("corrupt tag");
3048 static int index_mem(unsigned char *sha1, void *buf, size_t size,
3049 enum object_type type,
3050 const char *path, unsigned flags)
3052 int ret, re_allocated = 0;
3053 int write_object = flags & HASH_WRITE_OBJECT;
3055 if (!type)
3056 type = OBJ_BLOB;
3059 * Convert blobs to git internal format
3061 if ((type == OBJ_BLOB) && path) {
3062 struct strbuf nbuf = STRBUF_INIT;
3063 if (convert_to_git(path, buf, size, &nbuf,
3064 write_object ? safe_crlf : SAFE_CRLF_FALSE)) {
3065 buf = strbuf_detach(&nbuf, &size);
3066 re_allocated = 1;
3069 if (flags & HASH_FORMAT_CHECK) {
3070 if (type == OBJ_TREE)
3071 check_tree(buf, size);
3072 if (type == OBJ_COMMIT)
3073 check_commit(buf, size);
3074 if (type == OBJ_TAG)
3075 check_tag(buf, size);
3078 if (write_object)
3079 ret = write_sha1_file(buf, size, typename(type), sha1);
3080 else
3081 ret = hash_sha1_file(buf, size, typename(type), sha1);
3082 if (re_allocated)
3083 free(buf);
3084 return ret;
3087 static int index_pipe(unsigned char *sha1, int fd, enum object_type type,
3088 const char *path, unsigned flags)
3090 struct strbuf sbuf = STRBUF_INIT;
3091 int ret;
3093 if (strbuf_read(&sbuf, fd, 4096) >= 0)
3094 ret = index_mem(sha1, sbuf.buf, sbuf.len, type, path, flags);
3095 else
3096 ret = -1;
3097 strbuf_release(&sbuf);
3098 return ret;
3101 #define SMALL_FILE_SIZE (32*1024)
3103 static int index_core(unsigned char *sha1, int fd, size_t size,
3104 enum object_type type, const char *path,
3105 unsigned flags)
3107 int ret;
3109 if (!size) {
3110 ret = index_mem(sha1, NULL, size, type, path, flags);
3111 } else if (size <= SMALL_FILE_SIZE) {
3112 char *buf = xmalloc(size);
3113 if (size == read_in_full(fd, buf, size))
3114 ret = index_mem(sha1, buf, size, type, path, flags);
3115 else
3116 ret = error("short read %s", strerror(errno));
3117 free(buf);
3118 } else {
3119 void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
3120 ret = index_mem(sha1, buf, size, type, path, flags);
3121 munmap(buf, size);
3123 return ret;
3127 * This creates one packfile per large blob unless bulk-checkin
3128 * machinery is "plugged".
3130 * This also bypasses the usual "convert-to-git" dance, and that is on
3131 * purpose. We could write a streaming version of the converting
3132 * functions and insert that before feeding the data to fast-import
3133 * (or equivalent in-core API described above). However, that is
3134 * somewhat complicated, as we do not know the size of the filter
3135 * result, which we need to know beforehand when writing a git object.
3136 * Since the primary motivation for trying to stream from the working
3137 * tree file and to avoid mmaping it in core is to deal with large
3138 * binary blobs, they generally do not want to get any conversion, and
3139 * callers should avoid this code path when filters are requested.
3141 static int index_stream(unsigned char *sha1, int fd, size_t size,
3142 enum object_type type, const char *path,
3143 unsigned flags)
3145 return index_bulk_checkin(sha1, fd, size, type, path, flags);
3148 int index_fd(unsigned char *sha1, int fd, struct stat *st,
3149 enum object_type type, const char *path, unsigned flags)
3151 int ret;
3152 size_t size = xsize_t(st->st_size);
3154 if (!S_ISREG(st->st_mode))
3155 ret = index_pipe(sha1, fd, type, path, flags);
3156 else if (size <= big_file_threshold || type != OBJ_BLOB ||
3157 (path && would_convert_to_git(path, NULL, 0, 0)))
3158 ret = index_core(sha1, fd, size, type, path, flags);
3159 else
3160 ret = index_stream(sha1, fd, size, type, path, flags);
3161 close(fd);
3162 return ret;
3165 int index_path(unsigned char *sha1, const char *path, struct stat *st, unsigned flags)
3167 int fd;
3168 struct strbuf sb = STRBUF_INIT;
3170 switch (st->st_mode & S_IFMT) {
3171 case S_IFREG:
3172 fd = open(path, O_RDONLY);
3173 if (fd < 0)
3174 return error("open(\"%s\"): %s", path,
3175 strerror(errno));
3176 if (index_fd(sha1, fd, st, OBJ_BLOB, path, flags) < 0)
3177 return error("%s: failed to insert into database",
3178 path);
3179 break;
3180 case S_IFLNK:
3181 if (strbuf_readlink(&sb, path, st->st_size)) {
3182 char *errstr = strerror(errno);
3183 return error("readlink(\"%s\"): %s", path,
3184 errstr);
3186 if (!(flags & HASH_WRITE_OBJECT))
3187 hash_sha1_file(sb.buf, sb.len, blob_type, sha1);
3188 else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1))
3189 return error("%s: failed to insert into database",
3190 path);
3191 strbuf_release(&sb);
3192 break;
3193 case S_IFDIR:
3194 return resolve_gitlink_ref(path, "HEAD", sha1);
3195 default:
3196 return error("%s: unsupported file type", path);
3198 return 0;
3201 int read_pack_header(int fd, struct pack_header *header)
3203 if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
3204 /* "eof before pack header was fully read" */
3205 return PH_ERROR_EOF;
3207 if (header->hdr_signature != htonl(PACK_SIGNATURE))
3208 /* "protocol error (pack signature mismatch detected)" */
3209 return PH_ERROR_PACK_SIGNATURE;
3210 if (!pack_version_ok(header->hdr_version))
3211 /* "protocol error (pack version unsupported)" */
3212 return PH_ERROR_PROTOCOL;
3213 return 0;
3216 void assert_sha1_type(const unsigned char *sha1, enum object_type expect)
3218 enum object_type type = sha1_object_info(sha1, NULL);
3219 if (type < 0)
3220 die("%s is not a valid object", sha1_to_hex(sha1));
3221 if (type != expect)
3222 die("%s is not a valid '%s' object", sha1_to_hex(sha1),
3223 typename(expect));