safe_create_leading_directories(): introduce enum for return values
[git/raj.git] / sha1_file.c
blob2a86912e1410536ab9681b0655c14e495df8ddc0
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
136 ret = SCLD_FAILED;
137 } else if (adjust_shared_perm(path)) {
138 ret = SCLD_PERMS;
140 *slash = '/';
142 return ret;
145 enum scld_error safe_create_leading_directories_const(const char *path)
147 /* path points to cache entries, so xstrdup before messing with it */
148 char *buf = xstrdup(path);
149 enum scld_error result = safe_create_leading_directories(buf);
150 free(buf);
151 return result;
154 static void fill_sha1_path(char *pathbuf, const unsigned char *sha1)
156 int i;
157 for (i = 0; i < 20; i++) {
158 static char hex[] = "0123456789abcdef";
159 unsigned int val = sha1[i];
160 char *pos = pathbuf + i*2 + (i > 0);
161 *pos++ = hex[val >> 4];
162 *pos = hex[val & 0xf];
167 * NOTE! This returns a statically allocated buffer, so you have to be
168 * careful about using it. Do an "xstrdup()" if you need to save the
169 * filename.
171 * Also note that this returns the location for creating. Reading
172 * SHA1 file can happen from any alternate directory listed in the
173 * DB_ENVIRONMENT environment variable if it is not found in
174 * the primary object database.
176 char *sha1_file_name(const unsigned char *sha1)
178 static char buf[PATH_MAX];
179 const char *objdir;
180 int len;
182 objdir = get_object_directory();
183 len = strlen(objdir);
185 /* '/' + sha1(2) + '/' + sha1(38) + '\0' */
186 if (len + 43 > PATH_MAX)
187 die("insanely long object directory %s", objdir);
188 memcpy(buf, objdir, len);
189 buf[len] = '/';
190 buf[len+3] = '/';
191 buf[len+42] = '\0';
192 fill_sha1_path(buf + len + 1, sha1);
193 return buf;
196 static char *sha1_get_pack_name(const unsigned char *sha1,
197 char **name, char **base, const char *which)
199 static const char hex[] = "0123456789abcdef";
200 char *buf;
201 int i;
203 if (!*base) {
204 const char *sha1_file_directory = get_object_directory();
205 int len = strlen(sha1_file_directory);
206 *base = xmalloc(len + 60);
207 sprintf(*base, "%s/pack/pack-1234567890123456789012345678901234567890.%s",
208 sha1_file_directory, which);
209 *name = *base + len + 11;
212 buf = *name;
214 for (i = 0; i < 20; i++) {
215 unsigned int val = *sha1++;
216 *buf++ = hex[val >> 4];
217 *buf++ = hex[val & 0xf];
220 return *base;
223 char *sha1_pack_name(const unsigned char *sha1)
225 static char *name, *base;
227 return sha1_get_pack_name(sha1, &name, &base, "pack");
230 char *sha1_pack_index_name(const unsigned char *sha1)
232 static char *name, *base;
234 return sha1_get_pack_name(sha1, &name, &base, "idx");
237 struct alternate_object_database *alt_odb_list;
238 static struct alternate_object_database **alt_odb_tail;
240 static int git_open_noatime(const char *name);
243 * Prepare alternate object database registry.
245 * The variable alt_odb_list points at the list of struct
246 * alternate_object_database. The elements on this list come from
247 * non-empty elements from colon separated ALTERNATE_DB_ENVIRONMENT
248 * environment variable, and $GIT_OBJECT_DIRECTORY/info/alternates,
249 * whose contents is similar to that environment variable but can be
250 * LF separated. Its base points at a statically allocated buffer that
251 * contains "/the/directory/corresponding/to/.git/objects/...", while
252 * its name points just after the slash at the end of ".git/objects/"
253 * in the example above, and has enough space to hold 40-byte hex
254 * SHA1, an extra slash for the first level indirection, and the
255 * terminating NUL.
257 static int link_alt_odb_entry(const char *entry, const char *relative_base, int depth)
259 const char *objdir = get_object_directory();
260 struct alternate_object_database *ent;
261 struct alternate_object_database *alt;
262 int pfxlen, entlen;
263 struct strbuf pathbuf = STRBUF_INIT;
265 if (!is_absolute_path(entry) && relative_base) {
266 strbuf_addstr(&pathbuf, real_path(relative_base));
267 strbuf_addch(&pathbuf, '/');
269 strbuf_addstr(&pathbuf, entry);
271 normalize_path_copy(pathbuf.buf, pathbuf.buf);
273 pfxlen = strlen(pathbuf.buf);
276 * The trailing slash after the directory name is given by
277 * this function at the end. Remove duplicates.
279 while (pfxlen && pathbuf.buf[pfxlen-1] == '/')
280 pfxlen -= 1;
282 entlen = pfxlen + 43; /* '/' + 2 hex + '/' + 38 hex + NUL */
283 ent = xmalloc(sizeof(*ent) + entlen);
284 memcpy(ent->base, pathbuf.buf, pfxlen);
285 strbuf_release(&pathbuf);
287 ent->name = ent->base + pfxlen + 1;
288 ent->base[pfxlen + 3] = '/';
289 ent->base[pfxlen] = ent->base[entlen-1] = 0;
291 /* Detect cases where alternate disappeared */
292 if (!is_directory(ent->base)) {
293 error("object directory %s does not exist; "
294 "check .git/objects/info/alternates.",
295 ent->base);
296 free(ent);
297 return -1;
300 /* Prevent the common mistake of listing the same
301 * thing twice, or object directory itself.
303 for (alt = alt_odb_list; alt; alt = alt->next) {
304 if (!memcmp(ent->base, alt->base, pfxlen)) {
305 free(ent);
306 return -1;
309 if (!strcmp(ent->base, objdir)) {
310 free(ent);
311 return -1;
314 /* add the alternate entry */
315 *alt_odb_tail = ent;
316 alt_odb_tail = &(ent->next);
317 ent->next = NULL;
319 /* recursively add alternates */
320 read_info_alternates(ent->base, depth + 1);
322 ent->base[pfxlen] = '/';
324 return 0;
327 static void link_alt_odb_entries(const char *alt, int len, int sep,
328 const char *relative_base, int depth)
330 struct string_list entries = STRING_LIST_INIT_NODUP;
331 char *alt_copy;
332 int i;
334 if (depth > 5) {
335 error("%s: ignoring alternate object stores, nesting too deep.",
336 relative_base);
337 return;
340 alt_copy = xmemdupz(alt, len);
341 string_list_split_in_place(&entries, alt_copy, sep, -1);
342 for (i = 0; i < entries.nr; i++) {
343 const char *entry = entries.items[i].string;
344 if (entry[0] == '\0' || entry[0] == '#')
345 continue;
346 if (!is_absolute_path(entry) && depth) {
347 error("%s: ignoring relative alternate object store %s",
348 relative_base, entry);
349 } else {
350 link_alt_odb_entry(entry, relative_base, depth);
353 string_list_clear(&entries, 0);
354 free(alt_copy);
357 void read_info_alternates(const char * relative_base, int depth)
359 char *map;
360 size_t mapsz;
361 struct stat st;
362 const char alt_file_name[] = "info/alternates";
363 /* Given that relative_base is no longer than PATH_MAX,
364 ensure that "path" has enough space to append "/", the
365 file name, "info/alternates", and a trailing NUL. */
366 char path[PATH_MAX + 1 + sizeof alt_file_name];
367 int fd;
369 sprintf(path, "%s/%s", relative_base, alt_file_name);
370 fd = git_open_noatime(path);
371 if (fd < 0)
372 return;
373 if (fstat(fd, &st) || (st.st_size == 0)) {
374 close(fd);
375 return;
377 mapsz = xsize_t(st.st_size);
378 map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
379 close(fd);
381 link_alt_odb_entries(map, mapsz, '\n', relative_base, depth);
383 munmap(map, mapsz);
386 void add_to_alternates_file(const char *reference)
388 struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
389 int fd = hold_lock_file_for_append(lock, git_path("objects/info/alternates"), LOCK_DIE_ON_ERROR);
390 char *alt = mkpath("%s\n", reference);
391 write_or_die(fd, alt, strlen(alt));
392 if (commit_lock_file(lock))
393 die("could not close alternates file");
394 if (alt_odb_tail)
395 link_alt_odb_entries(alt, strlen(alt), '\n', NULL, 0);
398 void foreach_alt_odb(alt_odb_fn fn, void *cb)
400 struct alternate_object_database *ent;
402 prepare_alt_odb();
403 for (ent = alt_odb_list; ent; ent = ent->next)
404 if (fn(ent, cb))
405 return;
408 void prepare_alt_odb(void)
410 const char *alt;
412 if (alt_odb_tail)
413 return;
415 alt = getenv(ALTERNATE_DB_ENVIRONMENT);
416 if (!alt) alt = "";
418 alt_odb_tail = &alt_odb_list;
419 link_alt_odb_entries(alt, strlen(alt), PATH_SEP, NULL, 0);
421 read_info_alternates(get_object_directory(), 0);
424 static int has_loose_object_local(const unsigned char *sha1)
426 char *name = sha1_file_name(sha1);
427 return !access(name, F_OK);
430 int has_loose_object_nonlocal(const unsigned char *sha1)
432 struct alternate_object_database *alt;
433 prepare_alt_odb();
434 for (alt = alt_odb_list; alt; alt = alt->next) {
435 fill_sha1_path(alt->name, sha1);
436 if (!access(alt->base, F_OK))
437 return 1;
439 return 0;
442 static int has_loose_object(const unsigned char *sha1)
444 return has_loose_object_local(sha1) ||
445 has_loose_object_nonlocal(sha1);
448 static unsigned int pack_used_ctr;
449 static unsigned int pack_mmap_calls;
450 static unsigned int peak_pack_open_windows;
451 static unsigned int pack_open_windows;
452 static unsigned int pack_open_fds;
453 static unsigned int pack_max_fds;
454 static size_t peak_pack_mapped;
455 static size_t pack_mapped;
456 struct packed_git *packed_git;
458 void pack_report(void)
460 fprintf(stderr,
461 "pack_report: getpagesize() = %10" SZ_FMT "\n"
462 "pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
463 "pack_report: core.packedGitLimit = %10" SZ_FMT "\n",
464 sz_fmt(getpagesize()),
465 sz_fmt(packed_git_window_size),
466 sz_fmt(packed_git_limit));
467 fprintf(stderr,
468 "pack_report: pack_used_ctr = %10u\n"
469 "pack_report: pack_mmap_calls = %10u\n"
470 "pack_report: pack_open_windows = %10u / %10u\n"
471 "pack_report: pack_mapped = "
472 "%10" SZ_FMT " / %10" SZ_FMT "\n",
473 pack_used_ctr,
474 pack_mmap_calls,
475 pack_open_windows, peak_pack_open_windows,
476 sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
479 static int check_packed_git_idx(const char *path, struct packed_git *p)
481 void *idx_map;
482 struct pack_idx_header *hdr;
483 size_t idx_size;
484 uint32_t version, nr, i, *index;
485 int fd = git_open_noatime(path);
486 struct stat st;
488 if (fd < 0)
489 return -1;
490 if (fstat(fd, &st)) {
491 close(fd);
492 return -1;
494 idx_size = xsize_t(st.st_size);
495 if (idx_size < 4 * 256 + 20 + 20) {
496 close(fd);
497 return error("index file %s is too small", path);
499 idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
500 close(fd);
502 hdr = idx_map;
503 if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
504 version = ntohl(hdr->idx_version);
505 if (version < 2 || version > 2) {
506 munmap(idx_map, idx_size);
507 return error("index file %s is version %"PRIu32
508 " and is not supported by this binary"
509 " (try upgrading GIT to a newer version)",
510 path, version);
512 } else
513 version = 1;
515 nr = 0;
516 index = idx_map;
517 if (version > 1)
518 index += 2; /* skip index header */
519 for (i = 0; i < 256; i++) {
520 uint32_t n = ntohl(index[i]);
521 if (n < nr) {
522 munmap(idx_map, idx_size);
523 return error("non-monotonic index %s", path);
525 nr = n;
528 if (version == 1) {
530 * Total size:
531 * - 256 index entries 4 bytes each
532 * - 24-byte entries * nr (20-byte sha1 + 4-byte offset)
533 * - 20-byte SHA1 of the packfile
534 * - 20-byte SHA1 file checksum
536 if (idx_size != 4*256 + nr * 24 + 20 + 20) {
537 munmap(idx_map, idx_size);
538 return error("wrong index v1 file size in %s", path);
540 } else if (version == 2) {
542 * Minimum size:
543 * - 8 bytes of header
544 * - 256 index entries 4 bytes each
545 * - 20-byte sha1 entry * nr
546 * - 4-byte crc entry * nr
547 * - 4-byte offset entry * nr
548 * - 20-byte SHA1 of the packfile
549 * - 20-byte SHA1 file checksum
550 * And after the 4-byte offset table might be a
551 * variable sized table containing 8-byte entries
552 * for offsets larger than 2^31.
554 unsigned long min_size = 8 + 4*256 + nr*(20 + 4 + 4) + 20 + 20;
555 unsigned long max_size = min_size;
556 if (nr)
557 max_size += (nr - 1)*8;
558 if (idx_size < min_size || idx_size > max_size) {
559 munmap(idx_map, idx_size);
560 return error("wrong index v2 file size in %s", path);
562 if (idx_size != min_size &&
564 * make sure we can deal with large pack offsets.
565 * 31-bit signed offset won't be enough, neither
566 * 32-bit unsigned one will be.
568 (sizeof(off_t) <= 4)) {
569 munmap(idx_map, idx_size);
570 return error("pack too large for current definition of off_t in %s", path);
574 p->index_version = version;
575 p->index_data = idx_map;
576 p->index_size = idx_size;
577 p->num_objects = nr;
578 return 0;
581 int open_pack_index(struct packed_git *p)
583 char *idx_name;
584 int ret;
586 if (p->index_data)
587 return 0;
589 idx_name = xstrdup(p->pack_name);
590 strcpy(idx_name + strlen(idx_name) - strlen(".pack"), ".idx");
591 ret = check_packed_git_idx(idx_name, p);
592 free(idx_name);
593 return ret;
596 static void scan_windows(struct packed_git *p,
597 struct packed_git **lru_p,
598 struct pack_window **lru_w,
599 struct pack_window **lru_l)
601 struct pack_window *w, *w_l;
603 for (w_l = NULL, w = p->windows; w; w = w->next) {
604 if (!w->inuse_cnt) {
605 if (!*lru_w || w->last_used < (*lru_w)->last_used) {
606 *lru_p = p;
607 *lru_w = w;
608 *lru_l = w_l;
611 w_l = w;
615 static int unuse_one_window(struct packed_git *current)
617 struct packed_git *p, *lru_p = NULL;
618 struct pack_window *lru_w = NULL, *lru_l = NULL;
620 if (current)
621 scan_windows(current, &lru_p, &lru_w, &lru_l);
622 for (p = packed_git; p; p = p->next)
623 scan_windows(p, &lru_p, &lru_w, &lru_l);
624 if (lru_p) {
625 munmap(lru_w->base, lru_w->len);
626 pack_mapped -= lru_w->len;
627 if (lru_l)
628 lru_l->next = lru_w->next;
629 else
630 lru_p->windows = lru_w->next;
631 free(lru_w);
632 pack_open_windows--;
633 return 1;
635 return 0;
638 void release_pack_memory(size_t need)
640 size_t cur = pack_mapped;
641 while (need >= (cur - pack_mapped) && unuse_one_window(NULL))
642 ; /* nothing */
645 void *xmmap(void *start, size_t length,
646 int prot, int flags, int fd, off_t offset)
648 void *ret = mmap(start, length, prot, flags, fd, offset);
649 if (ret == MAP_FAILED) {
650 if (!length)
651 return NULL;
652 release_pack_memory(length);
653 ret = mmap(start, length, prot, flags, fd, offset);
654 if (ret == MAP_FAILED)
655 die_errno("Out of memory? mmap failed");
657 return ret;
660 void close_pack_windows(struct packed_git *p)
662 while (p->windows) {
663 struct pack_window *w = p->windows;
665 if (w->inuse_cnt)
666 die("pack '%s' still has open windows to it",
667 p->pack_name);
668 munmap(w->base, w->len);
669 pack_mapped -= w->len;
670 pack_open_windows--;
671 p->windows = w->next;
672 free(w);
677 * The LRU pack is the one with the oldest MRU window, preferring packs
678 * with no used windows, or the oldest mtime if it has no windows allocated.
680 static void find_lru_pack(struct packed_git *p, struct packed_git **lru_p, struct pack_window **mru_w, int *accept_windows_inuse)
682 struct pack_window *w, *this_mru_w;
683 int has_windows_inuse = 0;
686 * Reject this pack if it has windows and the previously selected
687 * one does not. If this pack does not have windows, reject
688 * it if the pack file is newer than the previously selected one.
690 if (*lru_p && !*mru_w && (p->windows || p->mtime > (*lru_p)->mtime))
691 return;
693 for (w = this_mru_w = p->windows; w; w = w->next) {
695 * Reject this pack if any of its windows are in use,
696 * but the previously selected pack did not have any
697 * inuse windows. Otherwise, record that this pack
698 * has windows in use.
700 if (w->inuse_cnt) {
701 if (*accept_windows_inuse)
702 has_windows_inuse = 1;
703 else
704 return;
707 if (w->last_used > this_mru_w->last_used)
708 this_mru_w = w;
711 * Reject this pack if it has windows that have been
712 * used more recently than the previously selected pack.
713 * If the previously selected pack had windows inuse and
714 * we have not encountered a window in this pack that is
715 * inuse, skip this check since we prefer a pack with no
716 * inuse windows to one that has inuse windows.
718 if (*mru_w && *accept_windows_inuse == has_windows_inuse &&
719 this_mru_w->last_used > (*mru_w)->last_used)
720 return;
724 * Select this pack.
726 *mru_w = this_mru_w;
727 *lru_p = p;
728 *accept_windows_inuse = has_windows_inuse;
731 static int close_one_pack(void)
733 struct packed_git *p, *lru_p = NULL;
734 struct pack_window *mru_w = NULL;
735 int accept_windows_inuse = 1;
737 for (p = packed_git; p; p = p->next) {
738 if (p->pack_fd == -1)
739 continue;
740 find_lru_pack(p, &lru_p, &mru_w, &accept_windows_inuse);
743 if (lru_p) {
744 close(lru_p->pack_fd);
745 pack_open_fds--;
746 lru_p->pack_fd = -1;
747 return 1;
750 return 0;
753 void unuse_pack(struct pack_window **w_cursor)
755 struct pack_window *w = *w_cursor;
756 if (w) {
757 w->inuse_cnt--;
758 *w_cursor = NULL;
762 void close_pack_index(struct packed_git *p)
764 if (p->index_data) {
765 munmap((void *)p->index_data, p->index_size);
766 p->index_data = NULL;
771 * This is used by git-repack in case a newly created pack happens to
772 * contain the same set of objects as an existing one. In that case
773 * the resulting file might be different even if its name would be the
774 * same. It is best to close any reference to the old pack before it is
775 * replaced on disk. Of course no index pointers nor windows for given pack
776 * must subsist at this point. If ever objects from this pack are requested
777 * again, the new version of the pack will be reinitialized through
778 * reprepare_packed_git().
780 void free_pack_by_name(const char *pack_name)
782 struct packed_git *p, **pp = &packed_git;
784 while (*pp) {
785 p = *pp;
786 if (strcmp(pack_name, p->pack_name) == 0) {
787 clear_delta_base_cache();
788 close_pack_windows(p);
789 if (p->pack_fd != -1) {
790 close(p->pack_fd);
791 pack_open_fds--;
793 close_pack_index(p);
794 free(p->bad_object_sha1);
795 *pp = p->next;
796 if (last_found_pack == p)
797 last_found_pack = NULL;
798 free(p);
799 return;
801 pp = &p->next;
805 static unsigned int get_max_fd_limit(void)
807 #ifdef RLIMIT_NOFILE
808 struct rlimit lim;
810 if (getrlimit(RLIMIT_NOFILE, &lim))
811 die_errno("cannot get RLIMIT_NOFILE");
813 return lim.rlim_cur;
814 #elif defined(_SC_OPEN_MAX)
815 return sysconf(_SC_OPEN_MAX);
816 #elif defined(OPEN_MAX)
817 return OPEN_MAX;
818 #else
819 return 1; /* see the caller ;-) */
820 #endif
824 * Do not call this directly as this leaks p->pack_fd on error return;
825 * call open_packed_git() instead.
827 static int open_packed_git_1(struct packed_git *p)
829 struct stat st;
830 struct pack_header hdr;
831 unsigned char sha1[20];
832 unsigned char *idx_sha1;
833 long fd_flag;
835 if (!p->index_data && open_pack_index(p))
836 return error("packfile %s index unavailable", p->pack_name);
838 if (!pack_max_fds) {
839 unsigned int max_fds = get_max_fd_limit();
841 /* Save 3 for stdin/stdout/stderr, 22 for work */
842 if (25 < max_fds)
843 pack_max_fds = max_fds - 25;
844 else
845 pack_max_fds = 1;
848 while (pack_max_fds <= pack_open_fds && close_one_pack())
849 ; /* nothing */
851 p->pack_fd = git_open_noatime(p->pack_name);
852 if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
853 return -1;
854 pack_open_fds++;
856 /* If we created the struct before we had the pack we lack size. */
857 if (!p->pack_size) {
858 if (!S_ISREG(st.st_mode))
859 return error("packfile %s not a regular file", p->pack_name);
860 p->pack_size = st.st_size;
861 } else if (p->pack_size != st.st_size)
862 return error("packfile %s size changed", p->pack_name);
864 /* We leave these file descriptors open with sliding mmap;
865 * there is no point keeping them open across exec(), though.
867 fd_flag = fcntl(p->pack_fd, F_GETFD, 0);
868 if (fd_flag < 0)
869 return error("cannot determine file descriptor flags");
870 fd_flag |= FD_CLOEXEC;
871 if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
872 return error("cannot set FD_CLOEXEC");
874 /* Verify we recognize this pack file format. */
875 if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
876 return error("file %s is far too short to be a packfile", p->pack_name);
877 if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
878 return error("file %s is not a GIT packfile", p->pack_name);
879 if (!pack_version_ok(hdr.hdr_version))
880 return error("packfile %s is version %"PRIu32" and not"
881 " supported (try upgrading GIT to a newer version)",
882 p->pack_name, ntohl(hdr.hdr_version));
884 /* Verify the pack matches its index. */
885 if (p->num_objects != ntohl(hdr.hdr_entries))
886 return error("packfile %s claims to have %"PRIu32" objects"
887 " while index indicates %"PRIu32" objects",
888 p->pack_name, ntohl(hdr.hdr_entries),
889 p->num_objects);
890 if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
891 return error("end of packfile %s is unavailable", p->pack_name);
892 if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
893 return error("packfile %s signature is unavailable", p->pack_name);
894 idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
895 if (hashcmp(sha1, idx_sha1))
896 return error("packfile %s does not match index", p->pack_name);
897 return 0;
900 static int open_packed_git(struct packed_git *p)
902 if (!open_packed_git_1(p))
903 return 0;
904 if (p->pack_fd != -1) {
905 close(p->pack_fd);
906 pack_open_fds--;
907 p->pack_fd = -1;
909 return -1;
912 static int in_window(struct pack_window *win, off_t offset)
914 /* We must promise at least 20 bytes (one hash) after the
915 * offset is available from this window, otherwise the offset
916 * is not actually in this window and a different window (which
917 * has that one hash excess) must be used. This is to support
918 * the object header and delta base parsing routines below.
920 off_t win_off = win->offset;
921 return win_off <= offset
922 && (offset + 20) <= (win_off + win->len);
925 unsigned char *use_pack(struct packed_git *p,
926 struct pack_window **w_cursor,
927 off_t offset,
928 unsigned long *left)
930 struct pack_window *win = *w_cursor;
932 /* Since packfiles end in a hash of their content and it's
933 * pointless to ask for an offset into the middle of that
934 * hash, and the in_window function above wouldn't match
935 * don't allow an offset too close to the end of the file.
937 if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p))
938 die("packfile %s cannot be accessed", p->pack_name);
939 if (offset > (p->pack_size - 20))
940 die("offset beyond end of packfile (truncated pack?)");
942 if (!win || !in_window(win, offset)) {
943 if (win)
944 win->inuse_cnt--;
945 for (win = p->windows; win; win = win->next) {
946 if (in_window(win, offset))
947 break;
949 if (!win) {
950 size_t window_align = packed_git_window_size / 2;
951 off_t len;
953 if (p->pack_fd == -1 && open_packed_git(p))
954 die("packfile %s cannot be accessed", p->pack_name);
956 win = xcalloc(1, sizeof(*win));
957 win->offset = (offset / window_align) * window_align;
958 len = p->pack_size - win->offset;
959 if (len > packed_git_window_size)
960 len = packed_git_window_size;
961 win->len = (size_t)len;
962 pack_mapped += win->len;
963 while (packed_git_limit < pack_mapped
964 && unuse_one_window(p))
965 ; /* nothing */
966 win->base = xmmap(NULL, win->len,
967 PROT_READ, MAP_PRIVATE,
968 p->pack_fd, win->offset);
969 if (win->base == MAP_FAILED)
970 die("packfile %s cannot be mapped: %s",
971 p->pack_name,
972 strerror(errno));
973 if (!win->offset && win->len == p->pack_size
974 && !p->do_not_close) {
975 close(p->pack_fd);
976 pack_open_fds--;
977 p->pack_fd = -1;
979 pack_mmap_calls++;
980 pack_open_windows++;
981 if (pack_mapped > peak_pack_mapped)
982 peak_pack_mapped = pack_mapped;
983 if (pack_open_windows > peak_pack_open_windows)
984 peak_pack_open_windows = pack_open_windows;
985 win->next = p->windows;
986 p->windows = win;
989 if (win != *w_cursor) {
990 win->last_used = pack_used_ctr++;
991 win->inuse_cnt++;
992 *w_cursor = win;
994 offset -= win->offset;
995 if (left)
996 *left = win->len - xsize_t(offset);
997 return win->base + offset;
1000 static struct packed_git *alloc_packed_git(int extra)
1002 struct packed_git *p = xmalloc(sizeof(*p) + extra);
1003 memset(p, 0, sizeof(*p));
1004 p->pack_fd = -1;
1005 return p;
1008 static void try_to_free_pack_memory(size_t size)
1010 release_pack_memory(size);
1013 struct packed_git *add_packed_git(const char *path, int path_len, int local)
1015 static int have_set_try_to_free_routine;
1016 struct stat st;
1017 struct packed_git *p = alloc_packed_git(path_len + 2);
1019 if (!have_set_try_to_free_routine) {
1020 have_set_try_to_free_routine = 1;
1021 set_try_to_free_routine(try_to_free_pack_memory);
1025 * Make sure a corresponding .pack file exists and that
1026 * the index looks sane.
1028 path_len -= strlen(".idx");
1029 if (path_len < 1) {
1030 free(p);
1031 return NULL;
1033 memcpy(p->pack_name, path, path_len);
1035 strcpy(p->pack_name + path_len, ".keep");
1036 if (!access(p->pack_name, F_OK))
1037 p->pack_keep = 1;
1039 strcpy(p->pack_name + path_len, ".pack");
1040 if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
1041 free(p);
1042 return NULL;
1045 /* ok, it looks sane as far as we can check without
1046 * actually mapping the pack file.
1048 p->pack_size = st.st_size;
1049 p->pack_local = local;
1050 p->mtime = st.st_mtime;
1051 if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
1052 hashclr(p->sha1);
1053 return p;
1056 struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
1058 const char *path = sha1_pack_name(sha1);
1059 struct packed_git *p = alloc_packed_git(strlen(path) + 1);
1061 strcpy(p->pack_name, path);
1062 hashcpy(p->sha1, sha1);
1063 if (check_packed_git_idx(idx_path, p)) {
1064 free(p);
1065 return NULL;
1068 return p;
1071 void install_packed_git(struct packed_git *pack)
1073 if (pack->pack_fd != -1)
1074 pack_open_fds++;
1076 pack->next = packed_git;
1077 packed_git = pack;
1080 void (*report_garbage)(const char *desc, const char *path);
1082 static void report_helper(const struct string_list *list,
1083 int seen_bits, int first, int last)
1085 const char *msg;
1086 switch (seen_bits) {
1087 case 0:
1088 msg = "no corresponding .idx nor .pack";
1089 break;
1090 case 1:
1091 msg = "no corresponding .idx";
1092 break;
1093 case 2:
1094 msg = "no corresponding .pack";
1095 break;
1096 default:
1097 return;
1099 for (; first < last; first++)
1100 report_garbage(msg, list->items[first].string);
1103 static void report_pack_garbage(struct string_list *list)
1105 int i, baselen = -1, first = 0, seen_bits = 0;
1107 if (!report_garbage)
1108 return;
1110 sort_string_list(list);
1112 for (i = 0; i < list->nr; i++) {
1113 const char *path = list->items[i].string;
1114 if (baselen != -1 &&
1115 strncmp(path, list->items[first].string, baselen)) {
1116 report_helper(list, seen_bits, first, i);
1117 baselen = -1;
1118 seen_bits = 0;
1120 if (baselen == -1) {
1121 const char *dot = strrchr(path, '.');
1122 if (!dot) {
1123 report_garbage("garbage found", path);
1124 continue;
1126 baselen = dot - path + 1;
1127 first = i;
1129 if (!strcmp(path + baselen, "pack"))
1130 seen_bits |= 1;
1131 else if (!strcmp(path + baselen, "idx"))
1132 seen_bits |= 2;
1134 report_helper(list, seen_bits, first, list->nr);
1137 static void prepare_packed_git_one(char *objdir, int local)
1139 /* Ensure that this buffer is large enough so that we can
1140 append "/pack/" without clobbering the stack even if
1141 strlen(objdir) were PATH_MAX. */
1142 char path[PATH_MAX + 1 + 4 + 1 + 1];
1143 int len;
1144 DIR *dir;
1145 struct dirent *de;
1146 struct string_list garbage = STRING_LIST_INIT_DUP;
1148 sprintf(path, "%s/pack", objdir);
1149 len = strlen(path);
1150 dir = opendir(path);
1151 if (!dir) {
1152 if (errno != ENOENT)
1153 error("unable to open object pack directory: %s: %s",
1154 path, strerror(errno));
1155 return;
1157 path[len++] = '/';
1158 while ((de = readdir(dir)) != NULL) {
1159 int namelen = strlen(de->d_name);
1160 struct packed_git *p;
1162 if (len + namelen + 1 > sizeof(path)) {
1163 if (report_garbage) {
1164 struct strbuf sb = STRBUF_INIT;
1165 strbuf_addf(&sb, "%.*s/%s", len - 1, path, de->d_name);
1166 report_garbage("path too long", sb.buf);
1167 strbuf_release(&sb);
1169 continue;
1172 if (is_dot_or_dotdot(de->d_name))
1173 continue;
1175 strcpy(path + len, de->d_name);
1177 if (has_extension(de->d_name, ".idx")) {
1178 /* Don't reopen a pack we already have. */
1179 for (p = packed_git; p; p = p->next) {
1180 if (!memcmp(path, p->pack_name, len + namelen - 4))
1181 break;
1183 if (p == NULL &&
1185 * See if it really is a valid .idx file with
1186 * corresponding .pack file that we can map.
1188 (p = add_packed_git(path, len + namelen, local)) != NULL)
1189 install_packed_git(p);
1192 if (!report_garbage)
1193 continue;
1195 if (has_extension(de->d_name, ".idx") ||
1196 has_extension(de->d_name, ".pack") ||
1197 has_extension(de->d_name, ".keep"))
1198 string_list_append(&garbage, path);
1199 else
1200 report_garbage("garbage found", path);
1202 closedir(dir);
1203 report_pack_garbage(&garbage);
1204 string_list_clear(&garbage, 0);
1207 static int sort_pack(const void *a_, const void *b_)
1209 struct packed_git *a = *((struct packed_git **)a_);
1210 struct packed_git *b = *((struct packed_git **)b_);
1211 int st;
1214 * Local packs tend to contain objects specific to our
1215 * variant of the project than remote ones. In addition,
1216 * remote ones could be on a network mounted filesystem.
1217 * Favor local ones for these reasons.
1219 st = a->pack_local - b->pack_local;
1220 if (st)
1221 return -st;
1224 * Younger packs tend to contain more recent objects,
1225 * and more recent objects tend to get accessed more
1226 * often.
1228 if (a->mtime < b->mtime)
1229 return 1;
1230 else if (a->mtime == b->mtime)
1231 return 0;
1232 return -1;
1235 static void rearrange_packed_git(void)
1237 struct packed_git **ary, *p;
1238 int i, n;
1240 for (n = 0, p = packed_git; p; p = p->next)
1241 n++;
1242 if (n < 2)
1243 return;
1245 /* prepare an array of packed_git for easier sorting */
1246 ary = xcalloc(n, sizeof(struct packed_git *));
1247 for (n = 0, p = packed_git; p; p = p->next)
1248 ary[n++] = p;
1250 qsort(ary, n, sizeof(struct packed_git *), sort_pack);
1252 /* link them back again */
1253 for (i = 0; i < n - 1; i++)
1254 ary[i]->next = ary[i + 1];
1255 ary[n - 1]->next = NULL;
1256 packed_git = ary[0];
1258 free(ary);
1261 static int prepare_packed_git_run_once = 0;
1262 void prepare_packed_git(void)
1264 struct alternate_object_database *alt;
1266 if (prepare_packed_git_run_once)
1267 return;
1268 prepare_packed_git_one(get_object_directory(), 1);
1269 prepare_alt_odb();
1270 for (alt = alt_odb_list; alt; alt = alt->next) {
1271 alt->name[-1] = 0;
1272 prepare_packed_git_one(alt->base, 0);
1273 alt->name[-1] = '/';
1275 rearrange_packed_git();
1276 prepare_packed_git_run_once = 1;
1279 void reprepare_packed_git(void)
1281 discard_revindex();
1282 prepare_packed_git_run_once = 0;
1283 prepare_packed_git();
1286 static void mark_bad_packed_object(struct packed_git *p,
1287 const unsigned char *sha1)
1289 unsigned i;
1290 for (i = 0; i < p->num_bad_objects; i++)
1291 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1292 return;
1293 p->bad_object_sha1 = xrealloc(p->bad_object_sha1, 20 * (p->num_bad_objects + 1));
1294 hashcpy(p->bad_object_sha1 + 20 * p->num_bad_objects, sha1);
1295 p->num_bad_objects++;
1298 static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1300 struct packed_git *p;
1301 unsigned i;
1303 for (p = packed_git; p; p = p->next)
1304 for (i = 0; i < p->num_bad_objects; i++)
1305 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1306 return p;
1307 return NULL;
1311 * With an in-core object data in "map", rehash it to make sure the
1312 * object name actually matches "sha1" to detect object corruption.
1313 * With "map" == NULL, try reading the object named with "sha1" using
1314 * the streaming interface and rehash it to do the same.
1316 int check_sha1_signature(const unsigned char *sha1, void *map,
1317 unsigned long size, const char *type)
1319 unsigned char real_sha1[20];
1320 enum object_type obj_type;
1321 struct git_istream *st;
1322 git_SHA_CTX c;
1323 char hdr[32];
1324 int hdrlen;
1326 if (map) {
1327 hash_sha1_file(map, size, type, real_sha1);
1328 return hashcmp(sha1, real_sha1) ? -1 : 0;
1331 st = open_istream(sha1, &obj_type, &size, NULL);
1332 if (!st)
1333 return -1;
1335 /* Generate the header */
1336 hdrlen = sprintf(hdr, "%s %lu", typename(obj_type), size) + 1;
1338 /* Sha1.. */
1339 git_SHA1_Init(&c);
1340 git_SHA1_Update(&c, hdr, hdrlen);
1341 for (;;) {
1342 char buf[1024 * 16];
1343 ssize_t readlen = read_istream(st, buf, sizeof(buf));
1345 if (readlen < 0) {
1346 close_istream(st);
1347 return -1;
1349 if (!readlen)
1350 break;
1351 git_SHA1_Update(&c, buf, readlen);
1353 git_SHA1_Final(real_sha1, &c);
1354 close_istream(st);
1355 return hashcmp(sha1, real_sha1) ? -1 : 0;
1358 static int git_open_noatime(const char *name)
1360 static int sha1_file_open_flag = O_NOATIME;
1362 for (;;) {
1363 int fd = open(name, O_RDONLY | sha1_file_open_flag);
1364 if (fd >= 0)
1365 return fd;
1367 /* Might the failure be due to O_NOATIME? */
1368 if (errno != ENOENT && sha1_file_open_flag) {
1369 sha1_file_open_flag = 0;
1370 continue;
1373 return -1;
1377 static int stat_sha1_file(const unsigned char *sha1, struct stat *st)
1379 char *name = sha1_file_name(sha1);
1380 struct alternate_object_database *alt;
1382 if (!lstat(name, st))
1383 return 0;
1385 prepare_alt_odb();
1386 errno = ENOENT;
1387 for (alt = alt_odb_list; alt; alt = alt->next) {
1388 name = alt->name;
1389 fill_sha1_path(name, sha1);
1390 if (!lstat(alt->base, st))
1391 return 0;
1394 return -1;
1397 static int open_sha1_file(const unsigned char *sha1)
1399 int fd;
1400 char *name = sha1_file_name(sha1);
1401 struct alternate_object_database *alt;
1403 fd = git_open_noatime(name);
1404 if (fd >= 0)
1405 return fd;
1407 prepare_alt_odb();
1408 errno = ENOENT;
1409 for (alt = alt_odb_list; alt; alt = alt->next) {
1410 name = alt->name;
1411 fill_sha1_path(name, sha1);
1412 fd = git_open_noatime(alt->base);
1413 if (fd >= 0)
1414 return fd;
1416 return -1;
1419 void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1421 void *map;
1422 int fd;
1424 fd = open_sha1_file(sha1);
1425 map = NULL;
1426 if (fd >= 0) {
1427 struct stat st;
1429 if (!fstat(fd, &st)) {
1430 *size = xsize_t(st.st_size);
1431 if (!*size) {
1432 /* mmap() is forbidden on empty files */
1433 error("object file %s is empty", sha1_file_name(sha1));
1434 return NULL;
1436 map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1438 close(fd);
1440 return map;
1444 * There used to be a second loose object header format which
1445 * was meant to mimic the in-pack format, allowing for direct
1446 * copy of the object data. This format turned up not to be
1447 * really worth it and we no longer write loose objects in that
1448 * format.
1450 static int experimental_loose_object(unsigned char *map)
1452 unsigned int word;
1455 * We must determine if the buffer contains the standard
1456 * zlib-deflated stream or the experimental format based
1457 * on the in-pack object format. Compare the header byte
1458 * for each format:
1460 * RFC1950 zlib w/ deflate : 0www1000 : 0 <= www <= 7
1461 * Experimental pack-based : Stttssss : ttt = 1,2,3,4
1463 * If bit 7 is clear and bits 0-3 equal 8, the buffer MUST be
1464 * in standard loose-object format, UNLESS it is a Git-pack
1465 * format object *exactly* 8 bytes in size when inflated.
1467 * However, RFC1950 also specifies that the 1st 16-bit word
1468 * must be divisible by 31 - this checksum tells us our buffer
1469 * is in the standard format, giving a false positive only if
1470 * the 1st word of the Git-pack format object happens to be
1471 * divisible by 31, ie:
1472 * ((byte0 * 256) + byte1) % 31 = 0
1473 * => 0ttt10000www1000 % 31 = 0
1475 * As it happens, this case can only arise for www=3 & ttt=1
1476 * - ie, a Commit object, which would have to be 8 bytes in
1477 * size. As no Commit can be that small, we find that the
1478 * combination of these two criteria (bitmask & checksum)
1479 * can always correctly determine the buffer format.
1481 word = (map[0] << 8) + map[1];
1482 if ((map[0] & 0x8F) == 0x08 && !(word % 31))
1483 return 0;
1484 else
1485 return 1;
1488 unsigned long unpack_object_header_buffer(const unsigned char *buf,
1489 unsigned long len, enum object_type *type, unsigned long *sizep)
1491 unsigned shift;
1492 unsigned long size, c;
1493 unsigned long used = 0;
1495 c = buf[used++];
1496 *type = (c >> 4) & 7;
1497 size = c & 15;
1498 shift = 4;
1499 while (c & 0x80) {
1500 if (len <= used || bitsizeof(long) <= shift) {
1501 error("bad object header");
1502 size = used = 0;
1503 break;
1505 c = buf[used++];
1506 size += (c & 0x7f) << shift;
1507 shift += 7;
1509 *sizep = size;
1510 return used;
1513 int unpack_sha1_header(git_zstream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
1515 unsigned long size, used;
1516 static const char valid_loose_object_type[8] = {
1517 0, /* OBJ_EXT */
1518 1, 1, 1, 1, /* "commit", "tree", "blob", "tag" */
1519 0, /* "delta" and others are invalid in a loose object */
1521 enum object_type type;
1523 /* Get the data stream */
1524 memset(stream, 0, sizeof(*stream));
1525 stream->next_in = map;
1526 stream->avail_in = mapsize;
1527 stream->next_out = buffer;
1528 stream->avail_out = bufsiz;
1530 if (experimental_loose_object(map)) {
1532 * The old experimental format we no longer produce;
1533 * we can still read it.
1535 used = unpack_object_header_buffer(map, mapsize, &type, &size);
1536 if (!used || !valid_loose_object_type[type])
1537 return -1;
1538 map += used;
1539 mapsize -= used;
1541 /* Set up the stream for the rest.. */
1542 stream->next_in = map;
1543 stream->avail_in = mapsize;
1544 git_inflate_init(stream);
1546 /* And generate the fake traditional header */
1547 stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu",
1548 typename(type), size);
1549 return 0;
1551 git_inflate_init(stream);
1552 return git_inflate(stream, 0);
1555 static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1557 int bytes = strlen(buffer) + 1;
1558 unsigned char *buf = xmallocz(size);
1559 unsigned long n;
1560 int status = Z_OK;
1562 n = stream->total_out - bytes;
1563 if (n > size)
1564 n = size;
1565 memcpy(buf, (char *) buffer + bytes, n);
1566 bytes = n;
1567 if (bytes <= size) {
1569 * The above condition must be (bytes <= size), not
1570 * (bytes < size). In other words, even though we
1571 * expect no more output and set avail_out to zero,
1572 * the input zlib stream may have bytes that express
1573 * "this concludes the stream", and we *do* want to
1574 * eat that input.
1576 * Otherwise we would not be able to test that we
1577 * consumed all the input to reach the expected size;
1578 * we also want to check that zlib tells us that all
1579 * went well with status == Z_STREAM_END at the end.
1581 stream->next_out = buf + bytes;
1582 stream->avail_out = size - bytes;
1583 while (status == Z_OK)
1584 status = git_inflate(stream, Z_FINISH);
1586 if (status == Z_STREAM_END && !stream->avail_in) {
1587 git_inflate_end(stream);
1588 return buf;
1591 if (status < 0)
1592 error("corrupt loose object '%s'", sha1_to_hex(sha1));
1593 else if (stream->avail_in)
1594 error("garbage at end of loose object '%s'",
1595 sha1_to_hex(sha1));
1596 free(buf);
1597 return NULL;
1601 * We used to just use "sscanf()", but that's actually way
1602 * too permissive for what we want to check. So do an anal
1603 * object header parse by hand.
1605 int parse_sha1_header(const char *hdr, unsigned long *sizep)
1607 char type[10];
1608 int i;
1609 unsigned long size;
1612 * The type can be at most ten bytes (including the
1613 * terminating '\0' that we add), and is followed by
1614 * a space.
1616 i = 0;
1617 for (;;) {
1618 char c = *hdr++;
1619 if (c == ' ')
1620 break;
1621 type[i++] = c;
1622 if (i >= sizeof(type))
1623 return -1;
1625 type[i] = 0;
1628 * The length must follow immediately, and be in canonical
1629 * decimal format (ie "010" is not valid).
1631 size = *hdr++ - '0';
1632 if (size > 9)
1633 return -1;
1634 if (size) {
1635 for (;;) {
1636 unsigned long c = *hdr - '0';
1637 if (c > 9)
1638 break;
1639 hdr++;
1640 size = size * 10 + c;
1643 *sizep = size;
1646 * The length must be followed by a zero byte
1648 return *hdr ? -1 : type_from_string(type);
1651 static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1653 int ret;
1654 git_zstream stream;
1655 char hdr[8192];
1657 ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1658 if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1659 return NULL;
1661 return unpack_sha1_rest(&stream, hdr, *size, sha1);
1664 unsigned long get_size_from_delta(struct packed_git *p,
1665 struct pack_window **w_curs,
1666 off_t curpos)
1668 const unsigned char *data;
1669 unsigned char delta_head[20], *in;
1670 git_zstream stream;
1671 int st;
1673 memset(&stream, 0, sizeof(stream));
1674 stream.next_out = delta_head;
1675 stream.avail_out = sizeof(delta_head);
1677 git_inflate_init(&stream);
1678 do {
1679 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1680 stream.next_in = in;
1681 st = git_inflate(&stream, Z_FINISH);
1682 curpos += stream.next_in - in;
1683 } while ((st == Z_OK || st == Z_BUF_ERROR) &&
1684 stream.total_out < sizeof(delta_head));
1685 git_inflate_end(&stream);
1686 if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
1687 error("delta data unpack-initial failed");
1688 return 0;
1691 /* Examine the initial part of the delta to figure out
1692 * the result size.
1694 data = delta_head;
1696 /* ignore base size */
1697 get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1699 /* Read the result size */
1700 return get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1703 static off_t get_delta_base(struct packed_git *p,
1704 struct pack_window **w_curs,
1705 off_t *curpos,
1706 enum object_type type,
1707 off_t delta_obj_offset)
1709 unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1710 off_t base_offset;
1712 /* use_pack() assured us we have [base_info, base_info + 20)
1713 * as a range that we can look at without walking off the
1714 * end of the mapped window. Its actually the hash size
1715 * that is assured. An OFS_DELTA longer than the hash size
1716 * is stupid, as then a REF_DELTA would be smaller to store.
1718 if (type == OBJ_OFS_DELTA) {
1719 unsigned used = 0;
1720 unsigned char c = base_info[used++];
1721 base_offset = c & 127;
1722 while (c & 128) {
1723 base_offset += 1;
1724 if (!base_offset || MSB(base_offset, 7))
1725 return 0; /* overflow */
1726 c = base_info[used++];
1727 base_offset = (base_offset << 7) + (c & 127);
1729 base_offset = delta_obj_offset - base_offset;
1730 if (base_offset <= 0 || base_offset >= delta_obj_offset)
1731 return 0; /* out of bound */
1732 *curpos += used;
1733 } else if (type == OBJ_REF_DELTA) {
1734 /* The base entry _must_ be in the same pack */
1735 base_offset = find_pack_entry_one(base_info, p);
1736 *curpos += 20;
1737 } else
1738 die("I am totally screwed");
1739 return base_offset;
1742 int unpack_object_header(struct packed_git *p,
1743 struct pack_window **w_curs,
1744 off_t *curpos,
1745 unsigned long *sizep)
1747 unsigned char *base;
1748 unsigned long left;
1749 unsigned long used;
1750 enum object_type type;
1752 /* use_pack() assures us we have [base, base + 20) available
1753 * as a range that we can look at. (Its actually the hash
1754 * size that is assured.) With our object header encoding
1755 * the maximum deflated object size is 2^137, which is just
1756 * insane, so we know won't exceed what we have been given.
1758 base = use_pack(p, w_curs, *curpos, &left);
1759 used = unpack_object_header_buffer(base, left, &type, sizep);
1760 if (!used) {
1761 type = OBJ_BAD;
1762 } else
1763 *curpos += used;
1765 return type;
1768 static int retry_bad_packed_offset(struct packed_git *p, off_t obj_offset)
1770 int type;
1771 struct revindex_entry *revidx;
1772 const unsigned char *sha1;
1773 revidx = find_pack_revindex(p, obj_offset);
1774 if (!revidx)
1775 return OBJ_BAD;
1776 sha1 = nth_packed_object_sha1(p, revidx->nr);
1777 mark_bad_packed_object(p, sha1);
1778 type = sha1_object_info(sha1, NULL);
1779 if (type <= OBJ_NONE)
1780 return OBJ_BAD;
1781 return type;
1784 #define POI_STACK_PREALLOC 64
1786 static enum object_type packed_to_object_type(struct packed_git *p,
1787 off_t obj_offset,
1788 enum object_type type,
1789 struct pack_window **w_curs,
1790 off_t curpos)
1792 off_t small_poi_stack[POI_STACK_PREALLOC];
1793 off_t *poi_stack = small_poi_stack;
1794 int poi_stack_nr = 0, poi_stack_alloc = POI_STACK_PREALLOC;
1796 while (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1797 off_t base_offset;
1798 unsigned long size;
1799 /* Push the object we're going to leave behind */
1800 if (poi_stack_nr >= poi_stack_alloc && poi_stack == small_poi_stack) {
1801 poi_stack_alloc = alloc_nr(poi_stack_nr);
1802 poi_stack = xmalloc(sizeof(off_t)*poi_stack_alloc);
1803 memcpy(poi_stack, small_poi_stack, sizeof(off_t)*poi_stack_nr);
1804 } else {
1805 ALLOC_GROW(poi_stack, poi_stack_nr+1, poi_stack_alloc);
1807 poi_stack[poi_stack_nr++] = obj_offset;
1808 /* If parsing the base offset fails, just unwind */
1809 base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1810 if (!base_offset)
1811 goto unwind;
1812 curpos = obj_offset = base_offset;
1813 type = unpack_object_header(p, w_curs, &curpos, &size);
1814 if (type <= OBJ_NONE) {
1815 /* If getting the base itself fails, we first
1816 * retry the base, otherwise unwind */
1817 type = retry_bad_packed_offset(p, base_offset);
1818 if (type > OBJ_NONE)
1819 goto out;
1820 goto unwind;
1824 switch (type) {
1825 case OBJ_BAD:
1826 case OBJ_COMMIT:
1827 case OBJ_TREE:
1828 case OBJ_BLOB:
1829 case OBJ_TAG:
1830 break;
1831 default:
1832 error("unknown object type %i at offset %"PRIuMAX" in %s",
1833 type, (uintmax_t)obj_offset, p->pack_name);
1834 type = OBJ_BAD;
1837 out:
1838 if (poi_stack != small_poi_stack)
1839 free(poi_stack);
1840 return type;
1842 unwind:
1843 while (poi_stack_nr) {
1844 obj_offset = poi_stack[--poi_stack_nr];
1845 type = retry_bad_packed_offset(p, obj_offset);
1846 if (type > OBJ_NONE)
1847 goto out;
1849 type = OBJ_BAD;
1850 goto out;
1853 static int packed_object_info(struct packed_git *p, off_t obj_offset,
1854 struct object_info *oi)
1856 struct pack_window *w_curs = NULL;
1857 unsigned long size;
1858 off_t curpos = obj_offset;
1859 enum object_type type;
1862 * We always get the representation type, but only convert it to
1863 * a "real" type later if the caller is interested.
1865 type = unpack_object_header(p, &w_curs, &curpos, &size);
1867 if (oi->sizep) {
1868 if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1869 off_t tmp_pos = curpos;
1870 off_t base_offset = get_delta_base(p, &w_curs, &tmp_pos,
1871 type, obj_offset);
1872 if (!base_offset) {
1873 type = OBJ_BAD;
1874 goto out;
1876 *oi->sizep = get_size_from_delta(p, &w_curs, tmp_pos);
1877 if (*oi->sizep == 0) {
1878 type = OBJ_BAD;
1879 goto out;
1881 } else {
1882 *oi->sizep = size;
1886 if (oi->disk_sizep) {
1887 struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
1888 *oi->disk_sizep = revidx[1].offset - obj_offset;
1891 if (oi->typep) {
1892 *oi->typep = packed_to_object_type(p, obj_offset, type, &w_curs, curpos);
1893 if (*oi->typep < 0) {
1894 type = OBJ_BAD;
1895 goto out;
1899 out:
1900 unuse_pack(&w_curs);
1901 return type;
1904 static void *unpack_compressed_entry(struct packed_git *p,
1905 struct pack_window **w_curs,
1906 off_t curpos,
1907 unsigned long size)
1909 int st;
1910 git_zstream stream;
1911 unsigned char *buffer, *in;
1913 buffer = xmallocz(size);
1914 memset(&stream, 0, sizeof(stream));
1915 stream.next_out = buffer;
1916 stream.avail_out = size + 1;
1918 git_inflate_init(&stream);
1919 do {
1920 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1921 stream.next_in = in;
1922 st = git_inflate(&stream, Z_FINISH);
1923 if (!stream.avail_out)
1924 break; /* the payload is larger than it should be */
1925 curpos += stream.next_in - in;
1926 } while (st == Z_OK || st == Z_BUF_ERROR);
1927 git_inflate_end(&stream);
1928 if ((st != Z_STREAM_END) || stream.total_out != size) {
1929 free(buffer);
1930 return NULL;
1933 return buffer;
1936 #define MAX_DELTA_CACHE (256)
1938 static size_t delta_base_cached;
1940 static struct delta_base_cache_lru_list {
1941 struct delta_base_cache_lru_list *prev;
1942 struct delta_base_cache_lru_list *next;
1943 } delta_base_cache_lru = { &delta_base_cache_lru, &delta_base_cache_lru };
1945 static struct delta_base_cache_entry {
1946 struct delta_base_cache_lru_list lru;
1947 void *data;
1948 struct packed_git *p;
1949 off_t base_offset;
1950 unsigned long size;
1951 enum object_type type;
1952 } delta_base_cache[MAX_DELTA_CACHE];
1954 static unsigned long pack_entry_hash(struct packed_git *p, off_t base_offset)
1956 unsigned long hash;
1958 hash = (unsigned long)p + (unsigned long)base_offset;
1959 hash += (hash >> 8) + (hash >> 16);
1960 return hash % MAX_DELTA_CACHE;
1963 static struct delta_base_cache_entry *
1964 get_delta_base_cache_entry(struct packed_git *p, off_t base_offset)
1966 unsigned long hash = pack_entry_hash(p, base_offset);
1967 return delta_base_cache + hash;
1970 static int eq_delta_base_cache_entry(struct delta_base_cache_entry *ent,
1971 struct packed_git *p, off_t base_offset)
1973 return (ent->data && ent->p == p && ent->base_offset == base_offset);
1976 static int in_delta_base_cache(struct packed_git *p, off_t base_offset)
1978 struct delta_base_cache_entry *ent;
1979 ent = get_delta_base_cache_entry(p, base_offset);
1980 return eq_delta_base_cache_entry(ent, p, base_offset);
1983 static void clear_delta_base_cache_entry(struct delta_base_cache_entry *ent)
1985 ent->data = NULL;
1986 ent->lru.next->prev = ent->lru.prev;
1987 ent->lru.prev->next = ent->lru.next;
1988 delta_base_cached -= ent->size;
1991 static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
1992 unsigned long *base_size, enum object_type *type, int keep_cache)
1994 struct delta_base_cache_entry *ent;
1995 void *ret;
1997 ent = get_delta_base_cache_entry(p, base_offset);
1999 if (!eq_delta_base_cache_entry(ent, p, base_offset))
2000 return unpack_entry(p, base_offset, type, base_size);
2002 ret = ent->data;
2004 if (!keep_cache)
2005 clear_delta_base_cache_entry(ent);
2006 else
2007 ret = xmemdupz(ent->data, ent->size);
2008 *type = ent->type;
2009 *base_size = ent->size;
2010 return ret;
2013 static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
2015 if (ent->data) {
2016 free(ent->data);
2017 ent->data = NULL;
2018 ent->lru.next->prev = ent->lru.prev;
2019 ent->lru.prev->next = ent->lru.next;
2020 delta_base_cached -= ent->size;
2024 void clear_delta_base_cache(void)
2026 unsigned long p;
2027 for (p = 0; p < MAX_DELTA_CACHE; p++)
2028 release_delta_base_cache(&delta_base_cache[p]);
2031 static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
2032 void *base, unsigned long base_size, enum object_type type)
2034 unsigned long hash = pack_entry_hash(p, base_offset);
2035 struct delta_base_cache_entry *ent = delta_base_cache + hash;
2036 struct delta_base_cache_lru_list *lru;
2038 release_delta_base_cache(ent);
2039 delta_base_cached += base_size;
2041 for (lru = delta_base_cache_lru.next;
2042 delta_base_cached > delta_base_cache_limit
2043 && lru != &delta_base_cache_lru;
2044 lru = lru->next) {
2045 struct delta_base_cache_entry *f = (void *)lru;
2046 if (f->type == OBJ_BLOB)
2047 release_delta_base_cache(f);
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 release_delta_base_cache(f);
2057 ent->p = p;
2058 ent->base_offset = base_offset;
2059 ent->type = type;
2060 ent->data = base;
2061 ent->size = base_size;
2062 ent->lru.next = &delta_base_cache_lru;
2063 ent->lru.prev = delta_base_cache_lru.prev;
2064 delta_base_cache_lru.prev->next = &ent->lru;
2065 delta_base_cache_lru.prev = &ent->lru;
2068 static void *read_object(const unsigned char *sha1, enum object_type *type,
2069 unsigned long *size);
2071 static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
2073 static FILE *log_file;
2075 if (!log_pack_access)
2076 log_pack_access = getenv("GIT_TRACE_PACK_ACCESS");
2077 if (!log_pack_access)
2078 log_pack_access = no_log_pack_access;
2079 if (log_pack_access == no_log_pack_access)
2080 return;
2082 if (!log_file) {
2083 log_file = fopen(log_pack_access, "w");
2084 if (!log_file) {
2085 error("cannot open pack access log '%s' for writing: %s",
2086 log_pack_access, strerror(errno));
2087 log_pack_access = no_log_pack_access;
2088 return;
2091 fprintf(log_file, "%s %"PRIuMAX"\n",
2092 p->pack_name, (uintmax_t)obj_offset);
2093 fflush(log_file);
2096 int do_check_packed_object_crc;
2098 #define UNPACK_ENTRY_STACK_PREALLOC 64
2099 struct unpack_entry_stack_ent {
2100 off_t obj_offset;
2101 off_t curpos;
2102 unsigned long size;
2105 void *unpack_entry(struct packed_git *p, off_t obj_offset,
2106 enum object_type *final_type, unsigned long *final_size)
2108 struct pack_window *w_curs = NULL;
2109 off_t curpos = obj_offset;
2110 void *data = NULL;
2111 unsigned long size;
2112 enum object_type type;
2113 struct unpack_entry_stack_ent small_delta_stack[UNPACK_ENTRY_STACK_PREALLOC];
2114 struct unpack_entry_stack_ent *delta_stack = small_delta_stack;
2115 int delta_stack_nr = 0, delta_stack_alloc = UNPACK_ENTRY_STACK_PREALLOC;
2116 int base_from_cache = 0;
2118 if (log_pack_access != no_log_pack_access)
2119 write_pack_access_log(p, obj_offset);
2121 /* PHASE 1: drill down to the innermost base object */
2122 for (;;) {
2123 off_t base_offset;
2124 int i;
2125 struct delta_base_cache_entry *ent;
2127 ent = get_delta_base_cache_entry(p, curpos);
2128 if (eq_delta_base_cache_entry(ent, p, curpos)) {
2129 type = ent->type;
2130 data = ent->data;
2131 size = ent->size;
2132 clear_delta_base_cache_entry(ent);
2133 base_from_cache = 1;
2134 break;
2137 if (do_check_packed_object_crc && p->index_version > 1) {
2138 struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2139 unsigned long len = revidx[1].offset - obj_offset;
2140 if (check_pack_crc(p, &w_curs, obj_offset, len, revidx->nr)) {
2141 const unsigned char *sha1 =
2142 nth_packed_object_sha1(p, revidx->nr);
2143 error("bad packed object CRC for %s",
2144 sha1_to_hex(sha1));
2145 mark_bad_packed_object(p, sha1);
2146 unuse_pack(&w_curs);
2147 return NULL;
2151 type = unpack_object_header(p, &w_curs, &curpos, &size);
2152 if (type != OBJ_OFS_DELTA && type != OBJ_REF_DELTA)
2153 break;
2155 base_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
2156 if (!base_offset) {
2157 error("failed to validate delta base reference "
2158 "at offset %"PRIuMAX" from %s",
2159 (uintmax_t)curpos, p->pack_name);
2160 /* bail to phase 2, in hopes of recovery */
2161 data = NULL;
2162 break;
2165 /* push object, proceed to base */
2166 if (delta_stack_nr >= delta_stack_alloc
2167 && delta_stack == small_delta_stack) {
2168 delta_stack_alloc = alloc_nr(delta_stack_nr);
2169 delta_stack = xmalloc(sizeof(*delta_stack)*delta_stack_alloc);
2170 memcpy(delta_stack, small_delta_stack,
2171 sizeof(*delta_stack)*delta_stack_nr);
2172 } else {
2173 ALLOC_GROW(delta_stack, delta_stack_nr+1, delta_stack_alloc);
2175 i = delta_stack_nr++;
2176 delta_stack[i].obj_offset = obj_offset;
2177 delta_stack[i].curpos = curpos;
2178 delta_stack[i].size = size;
2180 curpos = obj_offset = base_offset;
2183 /* PHASE 2: handle the base */
2184 switch (type) {
2185 case OBJ_OFS_DELTA:
2186 case OBJ_REF_DELTA:
2187 if (data)
2188 die("BUG in unpack_entry: left loop at a valid delta");
2189 break;
2190 case OBJ_COMMIT:
2191 case OBJ_TREE:
2192 case OBJ_BLOB:
2193 case OBJ_TAG:
2194 if (!base_from_cache)
2195 data = unpack_compressed_entry(p, &w_curs, curpos, size);
2196 break;
2197 default:
2198 data = NULL;
2199 error("unknown object type %i at offset %"PRIuMAX" in %s",
2200 type, (uintmax_t)obj_offset, p->pack_name);
2203 /* PHASE 3: apply deltas in order */
2205 /* invariants:
2206 * 'data' holds the base data, or NULL if there was corruption
2208 while (delta_stack_nr) {
2209 void *delta_data;
2210 void *base = data;
2211 unsigned long delta_size, base_size = size;
2212 int i;
2214 data = NULL;
2216 if (base)
2217 add_delta_base_cache(p, obj_offset, base, base_size, type);
2219 if (!base) {
2221 * We're probably in deep shit, but let's try to fetch
2222 * the required base anyway from another pack or loose.
2223 * This is costly but should happen only in the presence
2224 * of a corrupted pack, and is better than failing outright.
2226 struct revindex_entry *revidx;
2227 const unsigned char *base_sha1;
2228 revidx = find_pack_revindex(p, obj_offset);
2229 if (revidx) {
2230 base_sha1 = nth_packed_object_sha1(p, revidx->nr);
2231 error("failed to read delta base object %s"
2232 " at offset %"PRIuMAX" from %s",
2233 sha1_to_hex(base_sha1), (uintmax_t)obj_offset,
2234 p->pack_name);
2235 mark_bad_packed_object(p, base_sha1);
2236 base = read_object(base_sha1, &type, &base_size);
2240 i = --delta_stack_nr;
2241 obj_offset = delta_stack[i].obj_offset;
2242 curpos = delta_stack[i].curpos;
2243 delta_size = delta_stack[i].size;
2245 if (!base)
2246 continue;
2248 delta_data = unpack_compressed_entry(p, &w_curs, curpos, delta_size);
2250 if (!delta_data) {
2251 error("failed to unpack compressed delta "
2252 "at offset %"PRIuMAX" from %s",
2253 (uintmax_t)curpos, p->pack_name);
2254 data = NULL;
2255 continue;
2258 data = patch_delta(base, base_size,
2259 delta_data, delta_size,
2260 &size);
2263 * We could not apply the delta; warn the user, but keep going.
2264 * Our failure will be noticed either in the next iteration of
2265 * the loop, or if this is the final delta, in the caller when
2266 * we return NULL. Those code paths will take care of making
2267 * a more explicit warning and retrying with another copy of
2268 * the object.
2270 if (!data)
2271 error("failed to apply delta");
2273 free(delta_data);
2276 *final_type = type;
2277 *final_size = size;
2279 unuse_pack(&w_curs);
2280 return data;
2283 const unsigned char *nth_packed_object_sha1(struct packed_git *p,
2284 uint32_t n)
2286 const unsigned char *index = p->index_data;
2287 if (!index) {
2288 if (open_pack_index(p))
2289 return NULL;
2290 index = p->index_data;
2292 if (n >= p->num_objects)
2293 return NULL;
2294 index += 4 * 256;
2295 if (p->index_version == 1) {
2296 return index + 24 * n + 4;
2297 } else {
2298 index += 8;
2299 return index + 20 * n;
2303 off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
2305 const unsigned char *index = p->index_data;
2306 index += 4 * 256;
2307 if (p->index_version == 1) {
2308 return ntohl(*((uint32_t *)(index + 24 * n)));
2309 } else {
2310 uint32_t off;
2311 index += 8 + p->num_objects * (20 + 4);
2312 off = ntohl(*((uint32_t *)(index + 4 * n)));
2313 if (!(off & 0x80000000))
2314 return off;
2315 index += p->num_objects * 4 + (off & 0x7fffffff) * 8;
2316 return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
2317 ntohl(*((uint32_t *)(index + 4)));
2321 off_t find_pack_entry_one(const unsigned char *sha1,
2322 struct packed_git *p)
2324 const uint32_t *level1_ofs = p->index_data;
2325 const unsigned char *index = p->index_data;
2326 unsigned hi, lo, stride;
2327 static int use_lookup = -1;
2328 static int debug_lookup = -1;
2330 if (debug_lookup < 0)
2331 debug_lookup = !!getenv("GIT_DEBUG_LOOKUP");
2333 if (!index) {
2334 if (open_pack_index(p))
2335 return 0;
2336 level1_ofs = p->index_data;
2337 index = p->index_data;
2339 if (p->index_version > 1) {
2340 level1_ofs += 2;
2341 index += 8;
2343 index += 4 * 256;
2344 hi = ntohl(level1_ofs[*sha1]);
2345 lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
2346 if (p->index_version > 1) {
2347 stride = 20;
2348 } else {
2349 stride = 24;
2350 index += 4;
2353 if (debug_lookup)
2354 printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
2355 sha1[0], sha1[1], sha1[2], lo, hi, p->num_objects);
2357 if (use_lookup < 0)
2358 use_lookup = !!getenv("GIT_USE_LOOKUP");
2359 if (use_lookup) {
2360 int pos = sha1_entry_pos(index, stride, 0,
2361 lo, hi, p->num_objects, sha1);
2362 if (pos < 0)
2363 return 0;
2364 return nth_packed_object_offset(p, pos);
2367 do {
2368 unsigned mi = (lo + hi) / 2;
2369 int cmp = hashcmp(index + mi * stride, sha1);
2371 if (debug_lookup)
2372 printf("lo %u hi %u rg %u mi %u\n",
2373 lo, hi, hi - lo, mi);
2374 if (!cmp)
2375 return nth_packed_object_offset(p, mi);
2376 if (cmp > 0)
2377 hi = mi;
2378 else
2379 lo = mi+1;
2380 } while (lo < hi);
2381 return 0;
2384 int is_pack_valid(struct packed_git *p)
2386 /* An already open pack is known to be valid. */
2387 if (p->pack_fd != -1)
2388 return 1;
2390 /* If the pack has one window completely covering the
2391 * file size, the pack is known to be valid even if
2392 * the descriptor is not currently open.
2394 if (p->windows) {
2395 struct pack_window *w = p->windows;
2397 if (!w->offset && w->len == p->pack_size)
2398 return 1;
2401 /* Force the pack to open to prove its valid. */
2402 return !open_packed_git(p);
2405 static int fill_pack_entry(const unsigned char *sha1,
2406 struct pack_entry *e,
2407 struct packed_git *p)
2409 off_t offset;
2411 if (p->num_bad_objects) {
2412 unsigned i;
2413 for (i = 0; i < p->num_bad_objects; i++)
2414 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
2415 return 0;
2418 offset = find_pack_entry_one(sha1, p);
2419 if (!offset)
2420 return 0;
2423 * We are about to tell the caller where they can locate the
2424 * requested object. We better make sure the packfile is
2425 * still here and can be accessed before supplying that
2426 * answer, as it may have been deleted since the index was
2427 * loaded!
2429 if (!is_pack_valid(p)) {
2430 warning("packfile %s cannot be accessed", p->pack_name);
2431 return 0;
2433 e->offset = offset;
2434 e->p = p;
2435 hashcpy(e->sha1, sha1);
2436 return 1;
2439 static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e)
2441 struct packed_git *p;
2443 prepare_packed_git();
2444 if (!packed_git)
2445 return 0;
2447 if (last_found_pack && fill_pack_entry(sha1, e, last_found_pack))
2448 return 1;
2450 for (p = packed_git; p; p = p->next) {
2451 if (p == last_found_pack || !fill_pack_entry(sha1, e, p))
2452 continue;
2454 last_found_pack = p;
2455 return 1;
2457 return 0;
2460 struct packed_git *find_sha1_pack(const unsigned char *sha1,
2461 struct packed_git *packs)
2463 struct packed_git *p;
2465 for (p = packs; p; p = p->next) {
2466 if (find_pack_entry_one(sha1, p))
2467 return p;
2469 return NULL;
2473 static int sha1_loose_object_info(const unsigned char *sha1,
2474 struct object_info *oi)
2476 int status;
2477 unsigned long mapsize, size;
2478 void *map;
2479 git_zstream stream;
2480 char hdr[32];
2483 * If we don't care about type or size, then we don't
2484 * need to look inside the object at all. Note that we
2485 * do not optimize out the stat call, even if the
2486 * caller doesn't care about the disk-size, since our
2487 * return value implicitly indicates whether the
2488 * object even exists.
2490 if (!oi->typep && !oi->sizep) {
2491 struct stat st;
2492 if (stat_sha1_file(sha1, &st) < 0)
2493 return -1;
2494 if (oi->disk_sizep)
2495 *oi->disk_sizep = st.st_size;
2496 return 0;
2499 map = map_sha1_file(sha1, &mapsize);
2500 if (!map)
2501 return -1;
2502 if (oi->disk_sizep)
2503 *oi->disk_sizep = mapsize;
2504 if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
2505 status = error("unable to unpack %s header",
2506 sha1_to_hex(sha1));
2507 else if ((status = parse_sha1_header(hdr, &size)) < 0)
2508 status = error("unable to parse %s header", sha1_to_hex(sha1));
2509 else if (oi->sizep)
2510 *oi->sizep = size;
2511 git_inflate_end(&stream);
2512 munmap(map, mapsize);
2513 if (oi->typep)
2514 *oi->typep = status;
2515 return 0;
2518 int sha1_object_info_extended(const unsigned char *sha1, struct object_info *oi)
2520 struct cached_object *co;
2521 struct pack_entry e;
2522 int rtype;
2524 co = find_cached_object(sha1);
2525 if (co) {
2526 if (oi->typep)
2527 *(oi->typep) = co->type;
2528 if (oi->sizep)
2529 *(oi->sizep) = co->size;
2530 if (oi->disk_sizep)
2531 *(oi->disk_sizep) = 0;
2532 oi->whence = OI_CACHED;
2533 return 0;
2536 if (!find_pack_entry(sha1, &e)) {
2537 /* Most likely it's a loose object. */
2538 if (!sha1_loose_object_info(sha1, oi)) {
2539 oi->whence = OI_LOOSE;
2540 return 0;
2543 /* Not a loose object; someone else may have just packed it. */
2544 reprepare_packed_git();
2545 if (!find_pack_entry(sha1, &e))
2546 return -1;
2549 rtype = packed_object_info(e.p, e.offset, oi);
2550 if (rtype < 0) {
2551 mark_bad_packed_object(e.p, sha1);
2552 return sha1_object_info_extended(sha1, oi);
2553 } else if (in_delta_base_cache(e.p, e.offset)) {
2554 oi->whence = OI_DBCACHED;
2555 } else {
2556 oi->whence = OI_PACKED;
2557 oi->u.packed.offset = e.offset;
2558 oi->u.packed.pack = e.p;
2559 oi->u.packed.is_delta = (rtype == OBJ_REF_DELTA ||
2560 rtype == OBJ_OFS_DELTA);
2563 return 0;
2566 /* returns enum object_type or negative */
2567 int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
2569 enum object_type type;
2570 struct object_info oi = {NULL};
2572 oi.typep = &type;
2573 oi.sizep = sizep;
2574 if (sha1_object_info_extended(sha1, &oi) < 0)
2575 return -1;
2576 return type;
2579 static void *read_packed_sha1(const unsigned char *sha1,
2580 enum object_type *type, unsigned long *size)
2582 struct pack_entry e;
2583 void *data;
2585 if (!find_pack_entry(sha1, &e))
2586 return NULL;
2587 data = cache_or_unpack_entry(e.p, e.offset, size, type, 1);
2588 if (!data) {
2590 * We're probably in deep shit, but let's try to fetch
2591 * the required object anyway from another pack or loose.
2592 * This should happen only in the presence of a corrupted
2593 * pack, and is better than failing outright.
2595 error("failed to read object %s at offset %"PRIuMAX" from %s",
2596 sha1_to_hex(sha1), (uintmax_t)e.offset, e.p->pack_name);
2597 mark_bad_packed_object(e.p, sha1);
2598 data = read_object(sha1, type, size);
2600 return data;
2603 int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
2604 unsigned char *sha1)
2606 struct cached_object *co;
2608 hash_sha1_file(buf, len, typename(type), sha1);
2609 if (has_sha1_file(sha1) || find_cached_object(sha1))
2610 return 0;
2611 if (cached_object_alloc <= cached_object_nr) {
2612 cached_object_alloc = alloc_nr(cached_object_alloc);
2613 cached_objects = xrealloc(cached_objects,
2614 sizeof(*cached_objects) *
2615 cached_object_alloc);
2617 co = &cached_objects[cached_object_nr++];
2618 co->size = len;
2619 co->type = type;
2620 co->buf = xmalloc(len);
2621 memcpy(co->buf, buf, len);
2622 hashcpy(co->sha1, sha1);
2623 return 0;
2626 static void *read_object(const unsigned char *sha1, enum object_type *type,
2627 unsigned long *size)
2629 unsigned long mapsize;
2630 void *map, *buf;
2631 struct cached_object *co;
2633 co = find_cached_object(sha1);
2634 if (co) {
2635 *type = co->type;
2636 *size = co->size;
2637 return xmemdupz(co->buf, co->size);
2640 buf = read_packed_sha1(sha1, type, size);
2641 if (buf)
2642 return buf;
2643 map = map_sha1_file(sha1, &mapsize);
2644 if (map) {
2645 buf = unpack_sha1_file(map, mapsize, type, size, sha1);
2646 munmap(map, mapsize);
2647 return buf;
2649 reprepare_packed_git();
2650 return read_packed_sha1(sha1, type, size);
2654 * This function dies on corrupt objects; the callers who want to
2655 * deal with them should arrange to call read_object() and give error
2656 * messages themselves.
2658 void *read_sha1_file_extended(const unsigned char *sha1,
2659 enum object_type *type,
2660 unsigned long *size,
2661 unsigned flag)
2663 void *data;
2664 char *path;
2665 const struct packed_git *p;
2666 const unsigned char *repl = (flag & READ_SHA1_FILE_REPLACE)
2667 ? lookup_replace_object(sha1) : sha1;
2669 errno = 0;
2670 data = read_object(repl, type, size);
2671 if (data)
2672 return data;
2674 if (errno && errno != ENOENT)
2675 die_errno("failed to read object %s", sha1_to_hex(sha1));
2677 /* die if we replaced an object with one that does not exist */
2678 if (repl != sha1)
2679 die("replacement %s not found for %s",
2680 sha1_to_hex(repl), sha1_to_hex(sha1));
2682 if (has_loose_object(repl)) {
2683 path = sha1_file_name(sha1);
2684 die("loose object %s (stored in %s) is corrupt",
2685 sha1_to_hex(repl), path);
2688 if ((p = has_packed_and_bad(repl)) != NULL)
2689 die("packed object %s (stored in %s) is corrupt",
2690 sha1_to_hex(repl), p->pack_name);
2692 return NULL;
2695 void *read_object_with_reference(const unsigned char *sha1,
2696 const char *required_type_name,
2697 unsigned long *size,
2698 unsigned char *actual_sha1_return)
2700 enum object_type type, required_type;
2701 void *buffer;
2702 unsigned long isize;
2703 unsigned char actual_sha1[20];
2705 required_type = type_from_string(required_type_name);
2706 hashcpy(actual_sha1, sha1);
2707 while (1) {
2708 int ref_length = -1;
2709 const char *ref_type = NULL;
2711 buffer = read_sha1_file(actual_sha1, &type, &isize);
2712 if (!buffer)
2713 return NULL;
2714 if (type == required_type) {
2715 *size = isize;
2716 if (actual_sha1_return)
2717 hashcpy(actual_sha1_return, actual_sha1);
2718 return buffer;
2720 /* Handle references */
2721 else if (type == OBJ_COMMIT)
2722 ref_type = "tree ";
2723 else if (type == OBJ_TAG)
2724 ref_type = "object ";
2725 else {
2726 free(buffer);
2727 return NULL;
2729 ref_length = strlen(ref_type);
2731 if (ref_length + 40 > isize ||
2732 memcmp(buffer, ref_type, ref_length) ||
2733 get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
2734 free(buffer);
2735 return NULL;
2737 free(buffer);
2738 /* Now we have the ID of the referred-to object in
2739 * actual_sha1. Check again. */
2743 static void write_sha1_file_prepare(const void *buf, unsigned long len,
2744 const char *type, unsigned char *sha1,
2745 char *hdr, int *hdrlen)
2747 git_SHA_CTX c;
2749 /* Generate the header */
2750 *hdrlen = sprintf(hdr, "%s %lu", type, len)+1;
2752 /* Sha1.. */
2753 git_SHA1_Init(&c);
2754 git_SHA1_Update(&c, hdr, *hdrlen);
2755 git_SHA1_Update(&c, buf, len);
2756 git_SHA1_Final(sha1, &c);
2760 * Move the just written object into its final resting place.
2761 * NEEDSWORK: this should be renamed to finalize_temp_file() as
2762 * "moving" is only a part of what it does, when no patch between
2763 * master to pu changes the call sites of this function.
2765 int move_temp_to_file(const char *tmpfile, const char *filename)
2767 int ret = 0;
2769 if (object_creation_mode == OBJECT_CREATION_USES_RENAMES)
2770 goto try_rename;
2771 else if (link(tmpfile, filename))
2772 ret = errno;
2775 * Coda hack - coda doesn't like cross-directory links,
2776 * so we fall back to a rename, which will mean that it
2777 * won't be able to check collisions, but that's not a
2778 * big deal.
2780 * The same holds for FAT formatted media.
2782 * When this succeeds, we just return. We have nothing
2783 * left to unlink.
2785 if (ret && ret != EEXIST) {
2786 try_rename:
2787 if (!rename(tmpfile, filename))
2788 goto out;
2789 ret = errno;
2791 unlink_or_warn(tmpfile);
2792 if (ret) {
2793 if (ret != EEXIST) {
2794 return error("unable to write sha1 filename %s: %s", filename, strerror(ret));
2796 /* FIXME!!! Collision check here ? */
2799 out:
2800 if (adjust_shared_perm(filename))
2801 return error("unable to set permission to '%s'", filename);
2802 return 0;
2805 static int write_buffer(int fd, const void *buf, size_t len)
2807 if (write_in_full(fd, buf, len) < 0)
2808 return error("file write error (%s)", strerror(errno));
2809 return 0;
2812 int hash_sha1_file(const void *buf, unsigned long len, const char *type,
2813 unsigned char *sha1)
2815 char hdr[32];
2816 int hdrlen;
2817 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2818 return 0;
2821 /* Finalize a file on disk, and close it. */
2822 static void close_sha1_file(int fd)
2824 if (fsync_object_files)
2825 fsync_or_die(fd, "sha1 file");
2826 if (close(fd) != 0)
2827 die_errno("error when closing sha1 file");
2830 /* Size of directory component, including the ending '/' */
2831 static inline int directory_size(const char *filename)
2833 const char *s = strrchr(filename, '/');
2834 if (!s)
2835 return 0;
2836 return s - filename + 1;
2840 * This creates a temporary file in the same directory as the final
2841 * 'filename'
2843 * We want to avoid cross-directory filename renames, because those
2844 * can have problems on various filesystems (FAT, NFS, Coda).
2846 static int create_tmpfile(char *buffer, size_t bufsiz, const char *filename)
2848 int fd, dirlen = directory_size(filename);
2850 if (dirlen + 20 > bufsiz) {
2851 errno = ENAMETOOLONG;
2852 return -1;
2854 memcpy(buffer, filename, dirlen);
2855 strcpy(buffer + dirlen, "tmp_obj_XXXXXX");
2856 fd = git_mkstemp_mode(buffer, 0444);
2857 if (fd < 0 && dirlen && errno == ENOENT) {
2858 /* Make sure the directory exists */
2859 memcpy(buffer, filename, dirlen);
2860 buffer[dirlen-1] = 0;
2861 if (mkdir(buffer, 0777) && errno != EEXIST)
2862 return -1;
2863 if (adjust_shared_perm(buffer))
2864 return -1;
2866 /* Try again */
2867 strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX");
2868 fd = git_mkstemp_mode(buffer, 0444);
2870 return fd;
2873 static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
2874 const void *buf, unsigned long len, time_t mtime)
2876 int fd, ret;
2877 unsigned char compressed[4096];
2878 git_zstream stream;
2879 git_SHA_CTX c;
2880 unsigned char parano_sha1[20];
2881 char *filename;
2882 static char tmp_file[PATH_MAX];
2884 filename = sha1_file_name(sha1);
2885 fd = create_tmpfile(tmp_file, sizeof(tmp_file), filename);
2886 if (fd < 0) {
2887 if (errno == EACCES)
2888 return error("insufficient permission for adding an object to repository database %s", get_object_directory());
2889 else
2890 return error("unable to create temporary file: %s", strerror(errno));
2893 /* Set it up */
2894 memset(&stream, 0, sizeof(stream));
2895 git_deflate_init(&stream, zlib_compression_level);
2896 stream.next_out = compressed;
2897 stream.avail_out = sizeof(compressed);
2898 git_SHA1_Init(&c);
2900 /* First header.. */
2901 stream.next_in = (unsigned char *)hdr;
2902 stream.avail_in = hdrlen;
2903 while (git_deflate(&stream, 0) == Z_OK)
2904 ; /* nothing */
2905 git_SHA1_Update(&c, hdr, hdrlen);
2907 /* Then the data itself.. */
2908 stream.next_in = (void *)buf;
2909 stream.avail_in = len;
2910 do {
2911 unsigned char *in0 = stream.next_in;
2912 ret = git_deflate(&stream, Z_FINISH);
2913 git_SHA1_Update(&c, in0, stream.next_in - in0);
2914 if (write_buffer(fd, compressed, stream.next_out - compressed) < 0)
2915 die("unable to write sha1 file");
2916 stream.next_out = compressed;
2917 stream.avail_out = sizeof(compressed);
2918 } while (ret == Z_OK);
2920 if (ret != Z_STREAM_END)
2921 die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
2922 ret = git_deflate_end_gently(&stream);
2923 if (ret != Z_OK)
2924 die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
2925 git_SHA1_Final(parano_sha1, &c);
2926 if (hashcmp(sha1, parano_sha1) != 0)
2927 die("confused by unstable object source data for %s", sha1_to_hex(sha1));
2929 close_sha1_file(fd);
2931 if (mtime) {
2932 struct utimbuf utb;
2933 utb.actime = mtime;
2934 utb.modtime = mtime;
2935 if (utime(tmp_file, &utb) < 0)
2936 warning("failed utime() on %s: %s",
2937 tmp_file, strerror(errno));
2940 return move_temp_to_file(tmp_file, filename);
2943 int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2945 unsigned char sha1[20];
2946 char hdr[32];
2947 int hdrlen;
2949 /* Normally if we have it in the pack then we do not bother writing
2950 * it out into .git/objects/??/?{38} file.
2952 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2953 if (returnsha1)
2954 hashcpy(returnsha1, sha1);
2955 if (has_sha1_file(sha1))
2956 return 0;
2957 return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
2960 int force_object_loose(const unsigned char *sha1, time_t mtime)
2962 void *buf;
2963 unsigned long len;
2964 enum object_type type;
2965 char hdr[32];
2966 int hdrlen;
2967 int ret;
2969 if (has_loose_object(sha1))
2970 return 0;
2971 buf = read_packed_sha1(sha1, &type, &len);
2972 if (!buf)
2973 return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
2974 hdrlen = sprintf(hdr, "%s %lu", typename(type), len) + 1;
2975 ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
2976 free(buf);
2978 return ret;
2981 int has_pack_index(const unsigned char *sha1)
2983 struct stat st;
2984 if (stat(sha1_pack_index_name(sha1), &st))
2985 return 0;
2986 return 1;
2989 int has_sha1_pack(const unsigned char *sha1)
2991 struct pack_entry e;
2992 return find_pack_entry(sha1, &e);
2995 int has_sha1_file(const unsigned char *sha1)
2997 struct pack_entry e;
2999 if (find_pack_entry(sha1, &e))
3000 return 1;
3001 if (has_loose_object(sha1))
3002 return 1;
3003 reprepare_packed_git();
3004 return find_pack_entry(sha1, &e);
3007 static void check_tree(const void *buf, size_t size)
3009 struct tree_desc desc;
3010 struct name_entry entry;
3012 init_tree_desc(&desc, buf, size);
3013 while (tree_entry(&desc, &entry))
3014 /* do nothing
3015 * tree_entry() will die() on malformed entries */
3019 static void check_commit(const void *buf, size_t size)
3021 struct commit c;
3022 memset(&c, 0, sizeof(c));
3023 if (parse_commit_buffer(&c, buf, size))
3024 die("corrupt commit");
3027 static void check_tag(const void *buf, size_t size)
3029 struct tag t;
3030 memset(&t, 0, sizeof(t));
3031 if (parse_tag_buffer(&t, buf, size))
3032 die("corrupt tag");
3035 static int index_mem(unsigned char *sha1, void *buf, size_t size,
3036 enum object_type type,
3037 const char *path, unsigned flags)
3039 int ret, re_allocated = 0;
3040 int write_object = flags & HASH_WRITE_OBJECT;
3042 if (!type)
3043 type = OBJ_BLOB;
3046 * Convert blobs to git internal format
3048 if ((type == OBJ_BLOB) && path) {
3049 struct strbuf nbuf = STRBUF_INIT;
3050 if (convert_to_git(path, buf, size, &nbuf,
3051 write_object ? safe_crlf : SAFE_CRLF_FALSE)) {
3052 buf = strbuf_detach(&nbuf, &size);
3053 re_allocated = 1;
3056 if (flags & HASH_FORMAT_CHECK) {
3057 if (type == OBJ_TREE)
3058 check_tree(buf, size);
3059 if (type == OBJ_COMMIT)
3060 check_commit(buf, size);
3061 if (type == OBJ_TAG)
3062 check_tag(buf, size);
3065 if (write_object)
3066 ret = write_sha1_file(buf, size, typename(type), sha1);
3067 else
3068 ret = hash_sha1_file(buf, size, typename(type), sha1);
3069 if (re_allocated)
3070 free(buf);
3071 return ret;
3074 static int index_pipe(unsigned char *sha1, int fd, enum object_type type,
3075 const char *path, unsigned flags)
3077 struct strbuf sbuf = STRBUF_INIT;
3078 int ret;
3080 if (strbuf_read(&sbuf, fd, 4096) >= 0)
3081 ret = index_mem(sha1, sbuf.buf, sbuf.len, type, path, flags);
3082 else
3083 ret = -1;
3084 strbuf_release(&sbuf);
3085 return ret;
3088 #define SMALL_FILE_SIZE (32*1024)
3090 static int index_core(unsigned char *sha1, int fd, size_t size,
3091 enum object_type type, const char *path,
3092 unsigned flags)
3094 int ret;
3096 if (!size) {
3097 ret = index_mem(sha1, NULL, size, type, path, flags);
3098 } else if (size <= SMALL_FILE_SIZE) {
3099 char *buf = xmalloc(size);
3100 if (size == read_in_full(fd, buf, size))
3101 ret = index_mem(sha1, buf, size, type, path, flags);
3102 else
3103 ret = error("short read %s", strerror(errno));
3104 free(buf);
3105 } else {
3106 void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
3107 ret = index_mem(sha1, buf, size, type, path, flags);
3108 munmap(buf, size);
3110 return ret;
3114 * This creates one packfile per large blob unless bulk-checkin
3115 * machinery is "plugged".
3117 * This also bypasses the usual "convert-to-git" dance, and that is on
3118 * purpose. We could write a streaming version of the converting
3119 * functions and insert that before feeding the data to fast-import
3120 * (or equivalent in-core API described above). However, that is
3121 * somewhat complicated, as we do not know the size of the filter
3122 * result, which we need to know beforehand when writing a git object.
3123 * Since the primary motivation for trying to stream from the working
3124 * tree file and to avoid mmaping it in core is to deal with large
3125 * binary blobs, they generally do not want to get any conversion, and
3126 * callers should avoid this code path when filters are requested.
3128 static int index_stream(unsigned char *sha1, int fd, size_t size,
3129 enum object_type type, const char *path,
3130 unsigned flags)
3132 return index_bulk_checkin(sha1, fd, size, type, path, flags);
3135 int index_fd(unsigned char *sha1, int fd, struct stat *st,
3136 enum object_type type, const char *path, unsigned flags)
3138 int ret;
3139 size_t size = xsize_t(st->st_size);
3141 if (!S_ISREG(st->st_mode))
3142 ret = index_pipe(sha1, fd, type, path, flags);
3143 else if (size <= big_file_threshold || type != OBJ_BLOB ||
3144 (path && would_convert_to_git(path, NULL, 0, 0)))
3145 ret = index_core(sha1, fd, size, type, path, flags);
3146 else
3147 ret = index_stream(sha1, fd, size, type, path, flags);
3148 close(fd);
3149 return ret;
3152 int index_path(unsigned char *sha1, const char *path, struct stat *st, unsigned flags)
3154 int fd;
3155 struct strbuf sb = STRBUF_INIT;
3157 switch (st->st_mode & S_IFMT) {
3158 case S_IFREG:
3159 fd = open(path, O_RDONLY);
3160 if (fd < 0)
3161 return error("open(\"%s\"): %s", path,
3162 strerror(errno));
3163 if (index_fd(sha1, fd, st, OBJ_BLOB, path, flags) < 0)
3164 return error("%s: failed to insert into database",
3165 path);
3166 break;
3167 case S_IFLNK:
3168 if (strbuf_readlink(&sb, path, st->st_size)) {
3169 char *errstr = strerror(errno);
3170 return error("readlink(\"%s\"): %s", path,
3171 errstr);
3173 if (!(flags & HASH_WRITE_OBJECT))
3174 hash_sha1_file(sb.buf, sb.len, blob_type, sha1);
3175 else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1))
3176 return error("%s: failed to insert into database",
3177 path);
3178 strbuf_release(&sb);
3179 break;
3180 case S_IFDIR:
3181 return resolve_gitlink_ref(path, "HEAD", sha1);
3182 default:
3183 return error("%s: unsupported file type", path);
3185 return 0;
3188 int read_pack_header(int fd, struct pack_header *header)
3190 if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
3191 /* "eof before pack header was fully read" */
3192 return PH_ERROR_EOF;
3194 if (header->hdr_signature != htonl(PACK_SIGNATURE))
3195 /* "protocol error (pack signature mismatch detected)" */
3196 return PH_ERROR_PACK_SIGNATURE;
3197 if (!pack_version_ok(header->hdr_version))
3198 /* "protocol error (pack version unsupported)" */
3199 return PH_ERROR_PROTOCOL;
3200 return 0;
3203 void assert_sha1_type(const unsigned char *sha1, enum object_type expect)
3205 enum object_type type = sha1_object_info(sha1, NULL);
3206 if (type < 0)
3207 die("%s is not a valid object", sha1_to_hex(sha1));
3208 if (type != expect)
3209 die("%s is not a valid '%s' object", sha1_to_hex(sha1),
3210 typename(expect));