remove_dir_recurse(): handle disappearing files and directories
[git/gitweb.git] / sha1_file.c
blobed814e546f809ac190a294220fd678b8f45459fb
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
819 struct rlimit lim;
821 if (getrlimit(RLIMIT_NOFILE, &lim))
822 die_errno("cannot get RLIMIT_NOFILE");
824 return lim.rlim_cur;
825 #elif defined(_SC_OPEN_MAX)
826 return sysconf(_SC_OPEN_MAX);
827 #elif defined(OPEN_MAX)
828 return OPEN_MAX;
829 #else
830 return 1; /* see the caller ;-) */
831 #endif
835 * Do not call this directly as this leaks p->pack_fd on error return;
836 * call open_packed_git() instead.
838 static int open_packed_git_1(struct packed_git *p)
840 struct stat st;
841 struct pack_header hdr;
842 unsigned char sha1[20];
843 unsigned char *idx_sha1;
844 long fd_flag;
846 if (!p->index_data && open_pack_index(p))
847 return error("packfile %s index unavailable", p->pack_name);
849 if (!pack_max_fds) {
850 unsigned int max_fds = get_max_fd_limit();
852 /* Save 3 for stdin/stdout/stderr, 22 for work */
853 if (25 < max_fds)
854 pack_max_fds = max_fds - 25;
855 else
856 pack_max_fds = 1;
859 while (pack_max_fds <= pack_open_fds && close_one_pack())
860 ; /* nothing */
862 p->pack_fd = git_open_noatime(p->pack_name);
863 if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
864 return -1;
865 pack_open_fds++;
867 /* If we created the struct before we had the pack we lack size. */
868 if (!p->pack_size) {
869 if (!S_ISREG(st.st_mode))
870 return error("packfile %s not a regular file", p->pack_name);
871 p->pack_size = st.st_size;
872 } else if (p->pack_size != st.st_size)
873 return error("packfile %s size changed", p->pack_name);
875 /* We leave these file descriptors open with sliding mmap;
876 * there is no point keeping them open across exec(), though.
878 fd_flag = fcntl(p->pack_fd, F_GETFD, 0);
879 if (fd_flag < 0)
880 return error("cannot determine file descriptor flags");
881 fd_flag |= FD_CLOEXEC;
882 if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
883 return error("cannot set FD_CLOEXEC");
885 /* Verify we recognize this pack file format. */
886 if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
887 return error("file %s is far too short to be a packfile", p->pack_name);
888 if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
889 return error("file %s is not a GIT packfile", p->pack_name);
890 if (!pack_version_ok(hdr.hdr_version))
891 return error("packfile %s is version %"PRIu32" and not"
892 " supported (try upgrading GIT to a newer version)",
893 p->pack_name, ntohl(hdr.hdr_version));
895 /* Verify the pack matches its index. */
896 if (p->num_objects != ntohl(hdr.hdr_entries))
897 return error("packfile %s claims to have %"PRIu32" objects"
898 " while index indicates %"PRIu32" objects",
899 p->pack_name, ntohl(hdr.hdr_entries),
900 p->num_objects);
901 if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
902 return error("end of packfile %s is unavailable", p->pack_name);
903 if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
904 return error("packfile %s signature is unavailable", p->pack_name);
905 idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
906 if (hashcmp(sha1, idx_sha1))
907 return error("packfile %s does not match index", p->pack_name);
908 return 0;
911 static int open_packed_git(struct packed_git *p)
913 if (!open_packed_git_1(p))
914 return 0;
915 if (p->pack_fd != -1) {
916 close(p->pack_fd);
917 pack_open_fds--;
918 p->pack_fd = -1;
920 return -1;
923 static int in_window(struct pack_window *win, off_t offset)
925 /* We must promise at least 20 bytes (one hash) after the
926 * offset is available from this window, otherwise the offset
927 * is not actually in this window and a different window (which
928 * has that one hash excess) must be used. This is to support
929 * the object header and delta base parsing routines below.
931 off_t win_off = win->offset;
932 return win_off <= offset
933 && (offset + 20) <= (win_off + win->len);
936 unsigned char *use_pack(struct packed_git *p,
937 struct pack_window **w_cursor,
938 off_t offset,
939 unsigned long *left)
941 struct pack_window *win = *w_cursor;
943 /* Since packfiles end in a hash of their content and it's
944 * pointless to ask for an offset into the middle of that
945 * hash, and the in_window function above wouldn't match
946 * don't allow an offset too close to the end of the file.
948 if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p))
949 die("packfile %s cannot be accessed", p->pack_name);
950 if (offset > (p->pack_size - 20))
951 die("offset beyond end of packfile (truncated pack?)");
953 if (!win || !in_window(win, offset)) {
954 if (win)
955 win->inuse_cnt--;
956 for (win = p->windows; win; win = win->next) {
957 if (in_window(win, offset))
958 break;
960 if (!win) {
961 size_t window_align = packed_git_window_size / 2;
962 off_t len;
964 if (p->pack_fd == -1 && open_packed_git(p))
965 die("packfile %s cannot be accessed", p->pack_name);
967 win = xcalloc(1, sizeof(*win));
968 win->offset = (offset / window_align) * window_align;
969 len = p->pack_size - win->offset;
970 if (len > packed_git_window_size)
971 len = packed_git_window_size;
972 win->len = (size_t)len;
973 pack_mapped += win->len;
974 while (packed_git_limit < pack_mapped
975 && unuse_one_window(p))
976 ; /* nothing */
977 win->base = xmmap(NULL, win->len,
978 PROT_READ, MAP_PRIVATE,
979 p->pack_fd, win->offset);
980 if (win->base == MAP_FAILED)
981 die("packfile %s cannot be mapped: %s",
982 p->pack_name,
983 strerror(errno));
984 if (!win->offset && win->len == p->pack_size
985 && !p->do_not_close) {
986 close(p->pack_fd);
987 pack_open_fds--;
988 p->pack_fd = -1;
990 pack_mmap_calls++;
991 pack_open_windows++;
992 if (pack_mapped > peak_pack_mapped)
993 peak_pack_mapped = pack_mapped;
994 if (pack_open_windows > peak_pack_open_windows)
995 peak_pack_open_windows = pack_open_windows;
996 win->next = p->windows;
997 p->windows = win;
1000 if (win != *w_cursor) {
1001 win->last_used = pack_used_ctr++;
1002 win->inuse_cnt++;
1003 *w_cursor = win;
1005 offset -= win->offset;
1006 if (left)
1007 *left = win->len - xsize_t(offset);
1008 return win->base + offset;
1011 static struct packed_git *alloc_packed_git(int extra)
1013 struct packed_git *p = xmalloc(sizeof(*p) + extra);
1014 memset(p, 0, sizeof(*p));
1015 p->pack_fd = -1;
1016 return p;
1019 static void try_to_free_pack_memory(size_t size)
1021 release_pack_memory(size);
1024 struct packed_git *add_packed_git(const char *path, int path_len, int local)
1026 static int have_set_try_to_free_routine;
1027 struct stat st;
1028 struct packed_git *p = alloc_packed_git(path_len + 2);
1030 if (!have_set_try_to_free_routine) {
1031 have_set_try_to_free_routine = 1;
1032 set_try_to_free_routine(try_to_free_pack_memory);
1036 * Make sure a corresponding .pack file exists and that
1037 * the index looks sane.
1039 path_len -= strlen(".idx");
1040 if (path_len < 1) {
1041 free(p);
1042 return NULL;
1044 memcpy(p->pack_name, path, path_len);
1046 strcpy(p->pack_name + path_len, ".keep");
1047 if (!access(p->pack_name, F_OK))
1048 p->pack_keep = 1;
1050 strcpy(p->pack_name + path_len, ".pack");
1051 if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
1052 free(p);
1053 return NULL;
1056 /* ok, it looks sane as far as we can check without
1057 * actually mapping the pack file.
1059 p->pack_size = st.st_size;
1060 p->pack_local = local;
1061 p->mtime = st.st_mtime;
1062 if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
1063 hashclr(p->sha1);
1064 return p;
1067 struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
1069 const char *path = sha1_pack_name(sha1);
1070 struct packed_git *p = alloc_packed_git(strlen(path) + 1);
1072 strcpy(p->pack_name, path);
1073 hashcpy(p->sha1, sha1);
1074 if (check_packed_git_idx(idx_path, p)) {
1075 free(p);
1076 return NULL;
1079 return p;
1082 void install_packed_git(struct packed_git *pack)
1084 if (pack->pack_fd != -1)
1085 pack_open_fds++;
1087 pack->next = packed_git;
1088 packed_git = pack;
1091 void (*report_garbage)(const char *desc, const char *path);
1093 static void report_helper(const struct string_list *list,
1094 int seen_bits, int first, int last)
1096 const char *msg;
1097 switch (seen_bits) {
1098 case 0:
1099 msg = "no corresponding .idx nor .pack";
1100 break;
1101 case 1:
1102 msg = "no corresponding .idx";
1103 break;
1104 case 2:
1105 msg = "no corresponding .pack";
1106 break;
1107 default:
1108 return;
1110 for (; first < last; first++)
1111 report_garbage(msg, list->items[first].string);
1114 static void report_pack_garbage(struct string_list *list)
1116 int i, baselen = -1, first = 0, seen_bits = 0;
1118 if (!report_garbage)
1119 return;
1121 sort_string_list(list);
1123 for (i = 0; i < list->nr; i++) {
1124 const char *path = list->items[i].string;
1125 if (baselen != -1 &&
1126 strncmp(path, list->items[first].string, baselen)) {
1127 report_helper(list, seen_bits, first, i);
1128 baselen = -1;
1129 seen_bits = 0;
1131 if (baselen == -1) {
1132 const char *dot = strrchr(path, '.');
1133 if (!dot) {
1134 report_garbage("garbage found", path);
1135 continue;
1137 baselen = dot - path + 1;
1138 first = i;
1140 if (!strcmp(path + baselen, "pack"))
1141 seen_bits |= 1;
1142 else if (!strcmp(path + baselen, "idx"))
1143 seen_bits |= 2;
1145 report_helper(list, seen_bits, first, list->nr);
1148 static void prepare_packed_git_one(char *objdir, int local)
1150 /* Ensure that this buffer is large enough so that we can
1151 append "/pack/" without clobbering the stack even if
1152 strlen(objdir) were PATH_MAX. */
1153 char path[PATH_MAX + 1 + 4 + 1 + 1];
1154 int len;
1155 DIR *dir;
1156 struct dirent *de;
1157 struct string_list garbage = STRING_LIST_INIT_DUP;
1159 sprintf(path, "%s/pack", objdir);
1160 len = strlen(path);
1161 dir = opendir(path);
1162 if (!dir) {
1163 if (errno != ENOENT)
1164 error("unable to open object pack directory: %s: %s",
1165 path, strerror(errno));
1166 return;
1168 path[len++] = '/';
1169 while ((de = readdir(dir)) != NULL) {
1170 int namelen = strlen(de->d_name);
1171 struct packed_git *p;
1173 if (len + namelen + 1 > sizeof(path)) {
1174 if (report_garbage) {
1175 struct strbuf sb = STRBUF_INIT;
1176 strbuf_addf(&sb, "%.*s/%s", len - 1, path, de->d_name);
1177 report_garbage("path too long", sb.buf);
1178 strbuf_release(&sb);
1180 continue;
1183 if (is_dot_or_dotdot(de->d_name))
1184 continue;
1186 strcpy(path + len, de->d_name);
1188 if (has_extension(de->d_name, ".idx")) {
1189 /* Don't reopen a pack we already have. */
1190 for (p = packed_git; p; p = p->next) {
1191 if (!memcmp(path, p->pack_name, len + namelen - 4))
1192 break;
1194 if (p == NULL &&
1196 * See if it really is a valid .idx file with
1197 * corresponding .pack file that we can map.
1199 (p = add_packed_git(path, len + namelen, local)) != NULL)
1200 install_packed_git(p);
1203 if (!report_garbage)
1204 continue;
1206 if (has_extension(de->d_name, ".idx") ||
1207 has_extension(de->d_name, ".pack") ||
1208 has_extension(de->d_name, ".keep"))
1209 string_list_append(&garbage, path);
1210 else
1211 report_garbage("garbage found", path);
1213 closedir(dir);
1214 report_pack_garbage(&garbage);
1215 string_list_clear(&garbage, 0);
1218 static int sort_pack(const void *a_, const void *b_)
1220 struct packed_git *a = *((struct packed_git **)a_);
1221 struct packed_git *b = *((struct packed_git **)b_);
1222 int st;
1225 * Local packs tend to contain objects specific to our
1226 * variant of the project than remote ones. In addition,
1227 * remote ones could be on a network mounted filesystem.
1228 * Favor local ones for these reasons.
1230 st = a->pack_local - b->pack_local;
1231 if (st)
1232 return -st;
1235 * Younger packs tend to contain more recent objects,
1236 * and more recent objects tend to get accessed more
1237 * often.
1239 if (a->mtime < b->mtime)
1240 return 1;
1241 else if (a->mtime == b->mtime)
1242 return 0;
1243 return -1;
1246 static void rearrange_packed_git(void)
1248 struct packed_git **ary, *p;
1249 int i, n;
1251 for (n = 0, p = packed_git; p; p = p->next)
1252 n++;
1253 if (n < 2)
1254 return;
1256 /* prepare an array of packed_git for easier sorting */
1257 ary = xcalloc(n, sizeof(struct packed_git *));
1258 for (n = 0, p = packed_git; p; p = p->next)
1259 ary[n++] = p;
1261 qsort(ary, n, sizeof(struct packed_git *), sort_pack);
1263 /* link them back again */
1264 for (i = 0; i < n - 1; i++)
1265 ary[i]->next = ary[i + 1];
1266 ary[n - 1]->next = NULL;
1267 packed_git = ary[0];
1269 free(ary);
1272 static int prepare_packed_git_run_once = 0;
1273 void prepare_packed_git(void)
1275 struct alternate_object_database *alt;
1277 if (prepare_packed_git_run_once)
1278 return;
1279 prepare_packed_git_one(get_object_directory(), 1);
1280 prepare_alt_odb();
1281 for (alt = alt_odb_list; alt; alt = alt->next) {
1282 alt->name[-1] = 0;
1283 prepare_packed_git_one(alt->base, 0);
1284 alt->name[-1] = '/';
1286 rearrange_packed_git();
1287 prepare_packed_git_run_once = 1;
1290 void reprepare_packed_git(void)
1292 discard_revindex();
1293 prepare_packed_git_run_once = 0;
1294 prepare_packed_git();
1297 static void mark_bad_packed_object(struct packed_git *p,
1298 const unsigned char *sha1)
1300 unsigned i;
1301 for (i = 0; i < p->num_bad_objects; i++)
1302 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1303 return;
1304 p->bad_object_sha1 = xrealloc(p->bad_object_sha1, 20 * (p->num_bad_objects + 1));
1305 hashcpy(p->bad_object_sha1 + 20 * p->num_bad_objects, sha1);
1306 p->num_bad_objects++;
1309 static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1311 struct packed_git *p;
1312 unsigned i;
1314 for (p = packed_git; p; p = p->next)
1315 for (i = 0; i < p->num_bad_objects; i++)
1316 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1317 return p;
1318 return NULL;
1322 * With an in-core object data in "map", rehash it to make sure the
1323 * object name actually matches "sha1" to detect object corruption.
1324 * With "map" == NULL, try reading the object named with "sha1" using
1325 * the streaming interface and rehash it to do the same.
1327 int check_sha1_signature(const unsigned char *sha1, void *map,
1328 unsigned long size, const char *type)
1330 unsigned char real_sha1[20];
1331 enum object_type obj_type;
1332 struct git_istream *st;
1333 git_SHA_CTX c;
1334 char hdr[32];
1335 int hdrlen;
1337 if (map) {
1338 hash_sha1_file(map, size, type, real_sha1);
1339 return hashcmp(sha1, real_sha1) ? -1 : 0;
1342 st = open_istream(sha1, &obj_type, &size, NULL);
1343 if (!st)
1344 return -1;
1346 /* Generate the header */
1347 hdrlen = sprintf(hdr, "%s %lu", typename(obj_type), size) + 1;
1349 /* Sha1.. */
1350 git_SHA1_Init(&c);
1351 git_SHA1_Update(&c, hdr, hdrlen);
1352 for (;;) {
1353 char buf[1024 * 16];
1354 ssize_t readlen = read_istream(st, buf, sizeof(buf));
1356 if (readlen < 0) {
1357 close_istream(st);
1358 return -1;
1360 if (!readlen)
1361 break;
1362 git_SHA1_Update(&c, buf, readlen);
1364 git_SHA1_Final(real_sha1, &c);
1365 close_istream(st);
1366 return hashcmp(sha1, real_sha1) ? -1 : 0;
1369 static int git_open_noatime(const char *name)
1371 static int sha1_file_open_flag = O_NOATIME;
1373 for (;;) {
1374 int fd = open(name, O_RDONLY | sha1_file_open_flag);
1375 if (fd >= 0)
1376 return fd;
1378 /* Might the failure be due to O_NOATIME? */
1379 if (errno != ENOENT && sha1_file_open_flag) {
1380 sha1_file_open_flag = 0;
1381 continue;
1384 return -1;
1388 static int stat_sha1_file(const unsigned char *sha1, struct stat *st)
1390 char *name = sha1_file_name(sha1);
1391 struct alternate_object_database *alt;
1393 if (!lstat(name, st))
1394 return 0;
1396 prepare_alt_odb();
1397 errno = ENOENT;
1398 for (alt = alt_odb_list; alt; alt = alt->next) {
1399 name = alt->name;
1400 fill_sha1_path(name, sha1);
1401 if (!lstat(alt->base, st))
1402 return 0;
1405 return -1;
1408 static int open_sha1_file(const unsigned char *sha1)
1410 int fd;
1411 char *name = sha1_file_name(sha1);
1412 struct alternate_object_database *alt;
1414 fd = git_open_noatime(name);
1415 if (fd >= 0)
1416 return fd;
1418 prepare_alt_odb();
1419 errno = ENOENT;
1420 for (alt = alt_odb_list; alt; alt = alt->next) {
1421 name = alt->name;
1422 fill_sha1_path(name, sha1);
1423 fd = git_open_noatime(alt->base);
1424 if (fd >= 0)
1425 return fd;
1427 return -1;
1430 void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1432 void *map;
1433 int fd;
1435 fd = open_sha1_file(sha1);
1436 map = NULL;
1437 if (fd >= 0) {
1438 struct stat st;
1440 if (!fstat(fd, &st)) {
1441 *size = xsize_t(st.st_size);
1442 if (!*size) {
1443 /* mmap() is forbidden on empty files */
1444 error("object file %s is empty", sha1_file_name(sha1));
1445 return NULL;
1447 map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1449 close(fd);
1451 return map;
1455 * There used to be a second loose object header format which
1456 * was meant to mimic the in-pack format, allowing for direct
1457 * copy of the object data. This format turned up not to be
1458 * really worth it and we no longer write loose objects in that
1459 * format.
1461 static int experimental_loose_object(unsigned char *map)
1463 unsigned int word;
1466 * We must determine if the buffer contains the standard
1467 * zlib-deflated stream or the experimental format based
1468 * on the in-pack object format. Compare the header byte
1469 * for each format:
1471 * RFC1950 zlib w/ deflate : 0www1000 : 0 <= www <= 7
1472 * Experimental pack-based : Stttssss : ttt = 1,2,3,4
1474 * If bit 7 is clear and bits 0-3 equal 8, the buffer MUST be
1475 * in standard loose-object format, UNLESS it is a Git-pack
1476 * format object *exactly* 8 bytes in size when inflated.
1478 * However, RFC1950 also specifies that the 1st 16-bit word
1479 * must be divisible by 31 - this checksum tells us our buffer
1480 * is in the standard format, giving a false positive only if
1481 * the 1st word of the Git-pack format object happens to be
1482 * divisible by 31, ie:
1483 * ((byte0 * 256) + byte1) % 31 = 0
1484 * => 0ttt10000www1000 % 31 = 0
1486 * As it happens, this case can only arise for www=3 & ttt=1
1487 * - ie, a Commit object, which would have to be 8 bytes in
1488 * size. As no Commit can be that small, we find that the
1489 * combination of these two criteria (bitmask & checksum)
1490 * can always correctly determine the buffer format.
1492 word = (map[0] << 8) + map[1];
1493 if ((map[0] & 0x8F) == 0x08 && !(word % 31))
1494 return 0;
1495 else
1496 return 1;
1499 unsigned long unpack_object_header_buffer(const unsigned char *buf,
1500 unsigned long len, enum object_type *type, unsigned long *sizep)
1502 unsigned shift;
1503 unsigned long size, c;
1504 unsigned long used = 0;
1506 c = buf[used++];
1507 *type = (c >> 4) & 7;
1508 size = c & 15;
1509 shift = 4;
1510 while (c & 0x80) {
1511 if (len <= used || bitsizeof(long) <= shift) {
1512 error("bad object header");
1513 size = used = 0;
1514 break;
1516 c = buf[used++];
1517 size += (c & 0x7f) << shift;
1518 shift += 7;
1520 *sizep = size;
1521 return used;
1524 int unpack_sha1_header(git_zstream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
1526 unsigned long size, used;
1527 static const char valid_loose_object_type[8] = {
1528 0, /* OBJ_EXT */
1529 1, 1, 1, 1, /* "commit", "tree", "blob", "tag" */
1530 0, /* "delta" and others are invalid in a loose object */
1532 enum object_type type;
1534 /* Get the data stream */
1535 memset(stream, 0, sizeof(*stream));
1536 stream->next_in = map;
1537 stream->avail_in = mapsize;
1538 stream->next_out = buffer;
1539 stream->avail_out = bufsiz;
1541 if (experimental_loose_object(map)) {
1543 * The old experimental format we no longer produce;
1544 * we can still read it.
1546 used = unpack_object_header_buffer(map, mapsize, &type, &size);
1547 if (!used || !valid_loose_object_type[type])
1548 return -1;
1549 map += used;
1550 mapsize -= used;
1552 /* Set up the stream for the rest.. */
1553 stream->next_in = map;
1554 stream->avail_in = mapsize;
1555 git_inflate_init(stream);
1557 /* And generate the fake traditional header */
1558 stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu",
1559 typename(type), size);
1560 return 0;
1562 git_inflate_init(stream);
1563 return git_inflate(stream, 0);
1566 static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1568 int bytes = strlen(buffer) + 1;
1569 unsigned char *buf = xmallocz(size);
1570 unsigned long n;
1571 int status = Z_OK;
1573 n = stream->total_out - bytes;
1574 if (n > size)
1575 n = size;
1576 memcpy(buf, (char *) buffer + bytes, n);
1577 bytes = n;
1578 if (bytes <= size) {
1580 * The above condition must be (bytes <= size), not
1581 * (bytes < size). In other words, even though we
1582 * expect no more output and set avail_out to zero,
1583 * the input zlib stream may have bytes that express
1584 * "this concludes the stream", and we *do* want to
1585 * eat that input.
1587 * Otherwise we would not be able to test that we
1588 * consumed all the input to reach the expected size;
1589 * we also want to check that zlib tells us that all
1590 * went well with status == Z_STREAM_END at the end.
1592 stream->next_out = buf + bytes;
1593 stream->avail_out = size - bytes;
1594 while (status == Z_OK)
1595 status = git_inflate(stream, Z_FINISH);
1597 if (status == Z_STREAM_END && !stream->avail_in) {
1598 git_inflate_end(stream);
1599 return buf;
1602 if (status < 0)
1603 error("corrupt loose object '%s'", sha1_to_hex(sha1));
1604 else if (stream->avail_in)
1605 error("garbage at end of loose object '%s'",
1606 sha1_to_hex(sha1));
1607 free(buf);
1608 return NULL;
1612 * We used to just use "sscanf()", but that's actually way
1613 * too permissive for what we want to check. So do an anal
1614 * object header parse by hand.
1616 int parse_sha1_header(const char *hdr, unsigned long *sizep)
1618 char type[10];
1619 int i;
1620 unsigned long size;
1623 * The type can be at most ten bytes (including the
1624 * terminating '\0' that we add), and is followed by
1625 * a space.
1627 i = 0;
1628 for (;;) {
1629 char c = *hdr++;
1630 if (c == ' ')
1631 break;
1632 type[i++] = c;
1633 if (i >= sizeof(type))
1634 return -1;
1636 type[i] = 0;
1639 * The length must follow immediately, and be in canonical
1640 * decimal format (ie "010" is not valid).
1642 size = *hdr++ - '0';
1643 if (size > 9)
1644 return -1;
1645 if (size) {
1646 for (;;) {
1647 unsigned long c = *hdr - '0';
1648 if (c > 9)
1649 break;
1650 hdr++;
1651 size = size * 10 + c;
1654 *sizep = size;
1657 * The length must be followed by a zero byte
1659 return *hdr ? -1 : type_from_string(type);
1662 static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1664 int ret;
1665 git_zstream stream;
1666 char hdr[8192];
1668 ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1669 if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1670 return NULL;
1672 return unpack_sha1_rest(&stream, hdr, *size, sha1);
1675 unsigned long get_size_from_delta(struct packed_git *p,
1676 struct pack_window **w_curs,
1677 off_t curpos)
1679 const unsigned char *data;
1680 unsigned char delta_head[20], *in;
1681 git_zstream stream;
1682 int st;
1684 memset(&stream, 0, sizeof(stream));
1685 stream.next_out = delta_head;
1686 stream.avail_out = sizeof(delta_head);
1688 git_inflate_init(&stream);
1689 do {
1690 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1691 stream.next_in = in;
1692 st = git_inflate(&stream, Z_FINISH);
1693 curpos += stream.next_in - in;
1694 } while ((st == Z_OK || st == Z_BUF_ERROR) &&
1695 stream.total_out < sizeof(delta_head));
1696 git_inflate_end(&stream);
1697 if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
1698 error("delta data unpack-initial failed");
1699 return 0;
1702 /* Examine the initial part of the delta to figure out
1703 * the result size.
1705 data = delta_head;
1707 /* ignore base size */
1708 get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1710 /* Read the result size */
1711 return get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1714 static off_t get_delta_base(struct packed_git *p,
1715 struct pack_window **w_curs,
1716 off_t *curpos,
1717 enum object_type type,
1718 off_t delta_obj_offset)
1720 unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1721 off_t base_offset;
1723 /* use_pack() assured us we have [base_info, base_info + 20)
1724 * as a range that we can look at without walking off the
1725 * end of the mapped window. Its actually the hash size
1726 * that is assured. An OFS_DELTA longer than the hash size
1727 * is stupid, as then a REF_DELTA would be smaller to store.
1729 if (type == OBJ_OFS_DELTA) {
1730 unsigned used = 0;
1731 unsigned char c = base_info[used++];
1732 base_offset = c & 127;
1733 while (c & 128) {
1734 base_offset += 1;
1735 if (!base_offset || MSB(base_offset, 7))
1736 return 0; /* overflow */
1737 c = base_info[used++];
1738 base_offset = (base_offset << 7) + (c & 127);
1740 base_offset = delta_obj_offset - base_offset;
1741 if (base_offset <= 0 || base_offset >= delta_obj_offset)
1742 return 0; /* out of bound */
1743 *curpos += used;
1744 } else if (type == OBJ_REF_DELTA) {
1745 /* The base entry _must_ be in the same pack */
1746 base_offset = find_pack_entry_one(base_info, p);
1747 *curpos += 20;
1748 } else
1749 die("I am totally screwed");
1750 return base_offset;
1753 int unpack_object_header(struct packed_git *p,
1754 struct pack_window **w_curs,
1755 off_t *curpos,
1756 unsigned long *sizep)
1758 unsigned char *base;
1759 unsigned long left;
1760 unsigned long used;
1761 enum object_type type;
1763 /* use_pack() assures us we have [base, base + 20) available
1764 * as a range that we can look at. (Its actually the hash
1765 * size that is assured.) With our object header encoding
1766 * the maximum deflated object size is 2^137, which is just
1767 * insane, so we know won't exceed what we have been given.
1769 base = use_pack(p, w_curs, *curpos, &left);
1770 used = unpack_object_header_buffer(base, left, &type, sizep);
1771 if (!used) {
1772 type = OBJ_BAD;
1773 } else
1774 *curpos += used;
1776 return type;
1779 static int retry_bad_packed_offset(struct packed_git *p, off_t obj_offset)
1781 int type;
1782 struct revindex_entry *revidx;
1783 const unsigned char *sha1;
1784 revidx = find_pack_revindex(p, obj_offset);
1785 if (!revidx)
1786 return OBJ_BAD;
1787 sha1 = nth_packed_object_sha1(p, revidx->nr);
1788 mark_bad_packed_object(p, sha1);
1789 type = sha1_object_info(sha1, NULL);
1790 if (type <= OBJ_NONE)
1791 return OBJ_BAD;
1792 return type;
1795 #define POI_STACK_PREALLOC 64
1797 static enum object_type packed_to_object_type(struct packed_git *p,
1798 off_t obj_offset,
1799 enum object_type type,
1800 struct pack_window **w_curs,
1801 off_t curpos)
1803 off_t small_poi_stack[POI_STACK_PREALLOC];
1804 off_t *poi_stack = small_poi_stack;
1805 int poi_stack_nr = 0, poi_stack_alloc = POI_STACK_PREALLOC;
1807 while (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1808 off_t base_offset;
1809 unsigned long size;
1810 /* Push the object we're going to leave behind */
1811 if (poi_stack_nr >= poi_stack_alloc && poi_stack == small_poi_stack) {
1812 poi_stack_alloc = alloc_nr(poi_stack_nr);
1813 poi_stack = xmalloc(sizeof(off_t)*poi_stack_alloc);
1814 memcpy(poi_stack, small_poi_stack, sizeof(off_t)*poi_stack_nr);
1815 } else {
1816 ALLOC_GROW(poi_stack, poi_stack_nr+1, poi_stack_alloc);
1818 poi_stack[poi_stack_nr++] = obj_offset;
1819 /* If parsing the base offset fails, just unwind */
1820 base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1821 if (!base_offset)
1822 goto unwind;
1823 curpos = obj_offset = base_offset;
1824 type = unpack_object_header(p, w_curs, &curpos, &size);
1825 if (type <= OBJ_NONE) {
1826 /* If getting the base itself fails, we first
1827 * retry the base, otherwise unwind */
1828 type = retry_bad_packed_offset(p, base_offset);
1829 if (type > OBJ_NONE)
1830 goto out;
1831 goto unwind;
1835 switch (type) {
1836 case OBJ_BAD:
1837 case OBJ_COMMIT:
1838 case OBJ_TREE:
1839 case OBJ_BLOB:
1840 case OBJ_TAG:
1841 break;
1842 default:
1843 error("unknown object type %i at offset %"PRIuMAX" in %s",
1844 type, (uintmax_t)obj_offset, p->pack_name);
1845 type = OBJ_BAD;
1848 out:
1849 if (poi_stack != small_poi_stack)
1850 free(poi_stack);
1851 return type;
1853 unwind:
1854 while (poi_stack_nr) {
1855 obj_offset = poi_stack[--poi_stack_nr];
1856 type = retry_bad_packed_offset(p, obj_offset);
1857 if (type > OBJ_NONE)
1858 goto out;
1860 type = OBJ_BAD;
1861 goto out;
1864 static int packed_object_info(struct packed_git *p, off_t obj_offset,
1865 struct object_info *oi)
1867 struct pack_window *w_curs = NULL;
1868 unsigned long size;
1869 off_t curpos = obj_offset;
1870 enum object_type type;
1873 * We always get the representation type, but only convert it to
1874 * a "real" type later if the caller is interested.
1876 type = unpack_object_header(p, &w_curs, &curpos, &size);
1878 if (oi->sizep) {
1879 if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1880 off_t tmp_pos = curpos;
1881 off_t base_offset = get_delta_base(p, &w_curs, &tmp_pos,
1882 type, obj_offset);
1883 if (!base_offset) {
1884 type = OBJ_BAD;
1885 goto out;
1887 *oi->sizep = get_size_from_delta(p, &w_curs, tmp_pos);
1888 if (*oi->sizep == 0) {
1889 type = OBJ_BAD;
1890 goto out;
1892 } else {
1893 *oi->sizep = size;
1897 if (oi->disk_sizep) {
1898 struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
1899 *oi->disk_sizep = revidx[1].offset - obj_offset;
1902 if (oi->typep) {
1903 *oi->typep = packed_to_object_type(p, obj_offset, type, &w_curs, curpos);
1904 if (*oi->typep < 0) {
1905 type = OBJ_BAD;
1906 goto out;
1910 out:
1911 unuse_pack(&w_curs);
1912 return type;
1915 static void *unpack_compressed_entry(struct packed_git *p,
1916 struct pack_window **w_curs,
1917 off_t curpos,
1918 unsigned long size)
1920 int st;
1921 git_zstream stream;
1922 unsigned char *buffer, *in;
1924 buffer = xmallocz(size);
1925 memset(&stream, 0, sizeof(stream));
1926 stream.next_out = buffer;
1927 stream.avail_out = size + 1;
1929 git_inflate_init(&stream);
1930 do {
1931 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1932 stream.next_in = in;
1933 st = git_inflate(&stream, Z_FINISH);
1934 if (!stream.avail_out)
1935 break; /* the payload is larger than it should be */
1936 curpos += stream.next_in - in;
1937 } while (st == Z_OK || st == Z_BUF_ERROR);
1938 git_inflate_end(&stream);
1939 if ((st != Z_STREAM_END) || stream.total_out != size) {
1940 free(buffer);
1941 return NULL;
1944 return buffer;
1947 #define MAX_DELTA_CACHE (256)
1949 static size_t delta_base_cached;
1951 static struct delta_base_cache_lru_list {
1952 struct delta_base_cache_lru_list *prev;
1953 struct delta_base_cache_lru_list *next;
1954 } delta_base_cache_lru = { &delta_base_cache_lru, &delta_base_cache_lru };
1956 static struct delta_base_cache_entry {
1957 struct delta_base_cache_lru_list lru;
1958 void *data;
1959 struct packed_git *p;
1960 off_t base_offset;
1961 unsigned long size;
1962 enum object_type type;
1963 } delta_base_cache[MAX_DELTA_CACHE];
1965 static unsigned long pack_entry_hash(struct packed_git *p, off_t base_offset)
1967 unsigned long hash;
1969 hash = (unsigned long)p + (unsigned long)base_offset;
1970 hash += (hash >> 8) + (hash >> 16);
1971 return hash % MAX_DELTA_CACHE;
1974 static struct delta_base_cache_entry *
1975 get_delta_base_cache_entry(struct packed_git *p, off_t base_offset)
1977 unsigned long hash = pack_entry_hash(p, base_offset);
1978 return delta_base_cache + hash;
1981 static int eq_delta_base_cache_entry(struct delta_base_cache_entry *ent,
1982 struct packed_git *p, off_t base_offset)
1984 return (ent->data && ent->p == p && ent->base_offset == base_offset);
1987 static int in_delta_base_cache(struct packed_git *p, off_t base_offset)
1989 struct delta_base_cache_entry *ent;
1990 ent = get_delta_base_cache_entry(p, base_offset);
1991 return eq_delta_base_cache_entry(ent, p, base_offset);
1994 static void clear_delta_base_cache_entry(struct delta_base_cache_entry *ent)
1996 ent->data = NULL;
1997 ent->lru.next->prev = ent->lru.prev;
1998 ent->lru.prev->next = ent->lru.next;
1999 delta_base_cached -= ent->size;
2002 static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
2003 unsigned long *base_size, enum object_type *type, int keep_cache)
2005 struct delta_base_cache_entry *ent;
2006 void *ret;
2008 ent = get_delta_base_cache_entry(p, base_offset);
2010 if (!eq_delta_base_cache_entry(ent, p, base_offset))
2011 return unpack_entry(p, base_offset, type, base_size);
2013 ret = ent->data;
2015 if (!keep_cache)
2016 clear_delta_base_cache_entry(ent);
2017 else
2018 ret = xmemdupz(ent->data, ent->size);
2019 *type = ent->type;
2020 *base_size = ent->size;
2021 return ret;
2024 static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
2026 if (ent->data) {
2027 free(ent->data);
2028 ent->data = NULL;
2029 ent->lru.next->prev = ent->lru.prev;
2030 ent->lru.prev->next = ent->lru.next;
2031 delta_base_cached -= ent->size;
2035 void clear_delta_base_cache(void)
2037 unsigned long p;
2038 for (p = 0; p < MAX_DELTA_CACHE; p++)
2039 release_delta_base_cache(&delta_base_cache[p]);
2042 static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
2043 void *base, unsigned long base_size, enum object_type type)
2045 unsigned long hash = pack_entry_hash(p, base_offset);
2046 struct delta_base_cache_entry *ent = delta_base_cache + hash;
2047 struct delta_base_cache_lru_list *lru;
2049 release_delta_base_cache(ent);
2050 delta_base_cached += base_size;
2052 for (lru = delta_base_cache_lru.next;
2053 delta_base_cached > delta_base_cache_limit
2054 && lru != &delta_base_cache_lru;
2055 lru = lru->next) {
2056 struct delta_base_cache_entry *f = (void *)lru;
2057 if (f->type == OBJ_BLOB)
2058 release_delta_base_cache(f);
2060 for (lru = delta_base_cache_lru.next;
2061 delta_base_cached > delta_base_cache_limit
2062 && lru != &delta_base_cache_lru;
2063 lru = lru->next) {
2064 struct delta_base_cache_entry *f = (void *)lru;
2065 release_delta_base_cache(f);
2068 ent->p = p;
2069 ent->base_offset = base_offset;
2070 ent->type = type;
2071 ent->data = base;
2072 ent->size = base_size;
2073 ent->lru.next = &delta_base_cache_lru;
2074 ent->lru.prev = delta_base_cache_lru.prev;
2075 delta_base_cache_lru.prev->next = &ent->lru;
2076 delta_base_cache_lru.prev = &ent->lru;
2079 static void *read_object(const unsigned char *sha1, enum object_type *type,
2080 unsigned long *size);
2082 static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
2084 static FILE *log_file;
2086 if (!log_pack_access)
2087 log_pack_access = getenv("GIT_TRACE_PACK_ACCESS");
2088 if (!log_pack_access)
2089 log_pack_access = no_log_pack_access;
2090 if (log_pack_access == no_log_pack_access)
2091 return;
2093 if (!log_file) {
2094 log_file = fopen(log_pack_access, "w");
2095 if (!log_file) {
2096 error("cannot open pack access log '%s' for writing: %s",
2097 log_pack_access, strerror(errno));
2098 log_pack_access = no_log_pack_access;
2099 return;
2102 fprintf(log_file, "%s %"PRIuMAX"\n",
2103 p->pack_name, (uintmax_t)obj_offset);
2104 fflush(log_file);
2107 int do_check_packed_object_crc;
2109 #define UNPACK_ENTRY_STACK_PREALLOC 64
2110 struct unpack_entry_stack_ent {
2111 off_t obj_offset;
2112 off_t curpos;
2113 unsigned long size;
2116 void *unpack_entry(struct packed_git *p, off_t obj_offset,
2117 enum object_type *final_type, unsigned long *final_size)
2119 struct pack_window *w_curs = NULL;
2120 off_t curpos = obj_offset;
2121 void *data = NULL;
2122 unsigned long size;
2123 enum object_type type;
2124 struct unpack_entry_stack_ent small_delta_stack[UNPACK_ENTRY_STACK_PREALLOC];
2125 struct unpack_entry_stack_ent *delta_stack = small_delta_stack;
2126 int delta_stack_nr = 0, delta_stack_alloc = UNPACK_ENTRY_STACK_PREALLOC;
2127 int base_from_cache = 0;
2129 if (log_pack_access != no_log_pack_access)
2130 write_pack_access_log(p, obj_offset);
2132 /* PHASE 1: drill down to the innermost base object */
2133 for (;;) {
2134 off_t base_offset;
2135 int i;
2136 struct delta_base_cache_entry *ent;
2138 ent = get_delta_base_cache_entry(p, curpos);
2139 if (eq_delta_base_cache_entry(ent, p, curpos)) {
2140 type = ent->type;
2141 data = ent->data;
2142 size = ent->size;
2143 clear_delta_base_cache_entry(ent);
2144 base_from_cache = 1;
2145 break;
2148 if (do_check_packed_object_crc && p->index_version > 1) {
2149 struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2150 unsigned long len = revidx[1].offset - obj_offset;
2151 if (check_pack_crc(p, &w_curs, obj_offset, len, revidx->nr)) {
2152 const unsigned char *sha1 =
2153 nth_packed_object_sha1(p, revidx->nr);
2154 error("bad packed object CRC for %s",
2155 sha1_to_hex(sha1));
2156 mark_bad_packed_object(p, sha1);
2157 unuse_pack(&w_curs);
2158 return NULL;
2162 type = unpack_object_header(p, &w_curs, &curpos, &size);
2163 if (type != OBJ_OFS_DELTA && type != OBJ_REF_DELTA)
2164 break;
2166 base_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
2167 if (!base_offset) {
2168 error("failed to validate delta base reference "
2169 "at offset %"PRIuMAX" from %s",
2170 (uintmax_t)curpos, p->pack_name);
2171 /* bail to phase 2, in hopes of recovery */
2172 data = NULL;
2173 break;
2176 /* push object, proceed to base */
2177 if (delta_stack_nr >= delta_stack_alloc
2178 && delta_stack == small_delta_stack) {
2179 delta_stack_alloc = alloc_nr(delta_stack_nr);
2180 delta_stack = xmalloc(sizeof(*delta_stack)*delta_stack_alloc);
2181 memcpy(delta_stack, small_delta_stack,
2182 sizeof(*delta_stack)*delta_stack_nr);
2183 } else {
2184 ALLOC_GROW(delta_stack, delta_stack_nr+1, delta_stack_alloc);
2186 i = delta_stack_nr++;
2187 delta_stack[i].obj_offset = obj_offset;
2188 delta_stack[i].curpos = curpos;
2189 delta_stack[i].size = size;
2191 curpos = obj_offset = base_offset;
2194 /* PHASE 2: handle the base */
2195 switch (type) {
2196 case OBJ_OFS_DELTA:
2197 case OBJ_REF_DELTA:
2198 if (data)
2199 die("BUG in unpack_entry: left loop at a valid delta");
2200 break;
2201 case OBJ_COMMIT:
2202 case OBJ_TREE:
2203 case OBJ_BLOB:
2204 case OBJ_TAG:
2205 if (!base_from_cache)
2206 data = unpack_compressed_entry(p, &w_curs, curpos, size);
2207 break;
2208 default:
2209 data = NULL;
2210 error("unknown object type %i at offset %"PRIuMAX" in %s",
2211 type, (uintmax_t)obj_offset, p->pack_name);
2214 /* PHASE 3: apply deltas in order */
2216 /* invariants:
2217 * 'data' holds the base data, or NULL if there was corruption
2219 while (delta_stack_nr) {
2220 void *delta_data;
2221 void *base = data;
2222 unsigned long delta_size, base_size = size;
2223 int i;
2225 data = NULL;
2227 if (base)
2228 add_delta_base_cache(p, obj_offset, base, base_size, type);
2230 if (!base) {
2232 * We're probably in deep shit, but let's try to fetch
2233 * the required base anyway from another pack or loose.
2234 * This is costly but should happen only in the presence
2235 * of a corrupted pack, and is better than failing outright.
2237 struct revindex_entry *revidx;
2238 const unsigned char *base_sha1;
2239 revidx = find_pack_revindex(p, obj_offset);
2240 if (revidx) {
2241 base_sha1 = nth_packed_object_sha1(p, revidx->nr);
2242 error("failed to read delta base object %s"
2243 " at offset %"PRIuMAX" from %s",
2244 sha1_to_hex(base_sha1), (uintmax_t)obj_offset,
2245 p->pack_name);
2246 mark_bad_packed_object(p, base_sha1);
2247 base = read_object(base_sha1, &type, &base_size);
2251 i = --delta_stack_nr;
2252 obj_offset = delta_stack[i].obj_offset;
2253 curpos = delta_stack[i].curpos;
2254 delta_size = delta_stack[i].size;
2256 if (!base)
2257 continue;
2259 delta_data = unpack_compressed_entry(p, &w_curs, curpos, delta_size);
2261 if (!delta_data) {
2262 error("failed to unpack compressed delta "
2263 "at offset %"PRIuMAX" from %s",
2264 (uintmax_t)curpos, p->pack_name);
2265 data = NULL;
2266 continue;
2269 data = patch_delta(base, base_size,
2270 delta_data, delta_size,
2271 &size);
2274 * We could not apply the delta; warn the user, but keep going.
2275 * Our failure will be noticed either in the next iteration of
2276 * the loop, or if this is the final delta, in the caller when
2277 * we return NULL. Those code paths will take care of making
2278 * a more explicit warning and retrying with another copy of
2279 * the object.
2281 if (!data)
2282 error("failed to apply delta");
2284 free(delta_data);
2287 *final_type = type;
2288 *final_size = size;
2290 unuse_pack(&w_curs);
2291 return data;
2294 const unsigned char *nth_packed_object_sha1(struct packed_git *p,
2295 uint32_t n)
2297 const unsigned char *index = p->index_data;
2298 if (!index) {
2299 if (open_pack_index(p))
2300 return NULL;
2301 index = p->index_data;
2303 if (n >= p->num_objects)
2304 return NULL;
2305 index += 4 * 256;
2306 if (p->index_version == 1) {
2307 return index + 24 * n + 4;
2308 } else {
2309 index += 8;
2310 return index + 20 * n;
2314 off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
2316 const unsigned char *index = p->index_data;
2317 index += 4 * 256;
2318 if (p->index_version == 1) {
2319 return ntohl(*((uint32_t *)(index + 24 * n)));
2320 } else {
2321 uint32_t off;
2322 index += 8 + p->num_objects * (20 + 4);
2323 off = ntohl(*((uint32_t *)(index + 4 * n)));
2324 if (!(off & 0x80000000))
2325 return off;
2326 index += p->num_objects * 4 + (off & 0x7fffffff) * 8;
2327 return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
2328 ntohl(*((uint32_t *)(index + 4)));
2332 off_t find_pack_entry_one(const unsigned char *sha1,
2333 struct packed_git *p)
2335 const uint32_t *level1_ofs = p->index_data;
2336 const unsigned char *index = p->index_data;
2337 unsigned hi, lo, stride;
2338 static int use_lookup = -1;
2339 static int debug_lookup = -1;
2341 if (debug_lookup < 0)
2342 debug_lookup = !!getenv("GIT_DEBUG_LOOKUP");
2344 if (!index) {
2345 if (open_pack_index(p))
2346 return 0;
2347 level1_ofs = p->index_data;
2348 index = p->index_data;
2350 if (p->index_version > 1) {
2351 level1_ofs += 2;
2352 index += 8;
2354 index += 4 * 256;
2355 hi = ntohl(level1_ofs[*sha1]);
2356 lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
2357 if (p->index_version > 1) {
2358 stride = 20;
2359 } else {
2360 stride = 24;
2361 index += 4;
2364 if (debug_lookup)
2365 printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
2366 sha1[0], sha1[1], sha1[2], lo, hi, p->num_objects);
2368 if (use_lookup < 0)
2369 use_lookup = !!getenv("GIT_USE_LOOKUP");
2370 if (use_lookup) {
2371 int pos = sha1_entry_pos(index, stride, 0,
2372 lo, hi, p->num_objects, sha1);
2373 if (pos < 0)
2374 return 0;
2375 return nth_packed_object_offset(p, pos);
2378 do {
2379 unsigned mi = (lo + hi) / 2;
2380 int cmp = hashcmp(index + mi * stride, sha1);
2382 if (debug_lookup)
2383 printf("lo %u hi %u rg %u mi %u\n",
2384 lo, hi, hi - lo, mi);
2385 if (!cmp)
2386 return nth_packed_object_offset(p, mi);
2387 if (cmp > 0)
2388 hi = mi;
2389 else
2390 lo = mi+1;
2391 } while (lo < hi);
2392 return 0;
2395 int is_pack_valid(struct packed_git *p)
2397 /* An already open pack is known to be valid. */
2398 if (p->pack_fd != -1)
2399 return 1;
2401 /* If the pack has one window completely covering the
2402 * file size, the pack is known to be valid even if
2403 * the descriptor is not currently open.
2405 if (p->windows) {
2406 struct pack_window *w = p->windows;
2408 if (!w->offset && w->len == p->pack_size)
2409 return 1;
2412 /* Force the pack to open to prove its valid. */
2413 return !open_packed_git(p);
2416 static int fill_pack_entry(const unsigned char *sha1,
2417 struct pack_entry *e,
2418 struct packed_git *p)
2420 off_t offset;
2422 if (p->num_bad_objects) {
2423 unsigned i;
2424 for (i = 0; i < p->num_bad_objects; i++)
2425 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
2426 return 0;
2429 offset = find_pack_entry_one(sha1, p);
2430 if (!offset)
2431 return 0;
2434 * We are about to tell the caller where they can locate the
2435 * requested object. We better make sure the packfile is
2436 * still here and can be accessed before supplying that
2437 * answer, as it may have been deleted since the index was
2438 * loaded!
2440 if (!is_pack_valid(p)) {
2441 warning("packfile %s cannot be accessed", p->pack_name);
2442 return 0;
2444 e->offset = offset;
2445 e->p = p;
2446 hashcpy(e->sha1, sha1);
2447 return 1;
2450 static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e)
2452 struct packed_git *p;
2454 prepare_packed_git();
2455 if (!packed_git)
2456 return 0;
2458 if (last_found_pack && fill_pack_entry(sha1, e, last_found_pack))
2459 return 1;
2461 for (p = packed_git; p; p = p->next) {
2462 if (p == last_found_pack || !fill_pack_entry(sha1, e, p))
2463 continue;
2465 last_found_pack = p;
2466 return 1;
2468 return 0;
2471 struct packed_git *find_sha1_pack(const unsigned char *sha1,
2472 struct packed_git *packs)
2474 struct packed_git *p;
2476 for (p = packs; p; p = p->next) {
2477 if (find_pack_entry_one(sha1, p))
2478 return p;
2480 return NULL;
2484 static int sha1_loose_object_info(const unsigned char *sha1,
2485 struct object_info *oi)
2487 int status;
2488 unsigned long mapsize, size;
2489 void *map;
2490 git_zstream stream;
2491 char hdr[32];
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)
2531 struct cached_object *co;
2532 struct pack_entry e;
2533 int rtype;
2535 co = find_cached_object(sha1);
2536 if (co) {
2537 if (oi->typep)
2538 *(oi->typep) = co->type;
2539 if (oi->sizep)
2540 *(oi->sizep) = co->size;
2541 if (oi->disk_sizep)
2542 *(oi->disk_sizep) = 0;
2543 oi->whence = OI_CACHED;
2544 return 0;
2547 if (!find_pack_entry(sha1, &e)) {
2548 /* Most likely it's a loose object. */
2549 if (!sha1_loose_object_info(sha1, oi)) {
2550 oi->whence = OI_LOOSE;
2551 return 0;
2554 /* Not a loose object; someone else may have just packed it. */
2555 reprepare_packed_git();
2556 if (!find_pack_entry(sha1, &e))
2557 return -1;
2560 rtype = packed_object_info(e.p, e.offset, oi);
2561 if (rtype < 0) {
2562 mark_bad_packed_object(e.p, sha1);
2563 return sha1_object_info_extended(sha1, oi);
2564 } else if (in_delta_base_cache(e.p, e.offset)) {
2565 oi->whence = OI_DBCACHED;
2566 } else {
2567 oi->whence = OI_PACKED;
2568 oi->u.packed.offset = e.offset;
2569 oi->u.packed.pack = e.p;
2570 oi->u.packed.is_delta = (rtype == OBJ_REF_DELTA ||
2571 rtype == OBJ_OFS_DELTA);
2574 return 0;
2577 /* returns enum object_type or negative */
2578 int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
2580 enum object_type type;
2581 struct object_info oi = {NULL};
2583 oi.typep = &type;
2584 oi.sizep = sizep;
2585 if (sha1_object_info_extended(sha1, &oi) < 0)
2586 return -1;
2587 return type;
2590 static void *read_packed_sha1(const unsigned char *sha1,
2591 enum object_type *type, unsigned long *size)
2593 struct pack_entry e;
2594 void *data;
2596 if (!find_pack_entry(sha1, &e))
2597 return NULL;
2598 data = cache_or_unpack_entry(e.p, e.offset, size, type, 1);
2599 if (!data) {
2601 * We're probably in deep shit, but let's try to fetch
2602 * the required object anyway from another pack or loose.
2603 * This should happen only in the presence of a corrupted
2604 * pack, and is better than failing outright.
2606 error("failed to read object %s at offset %"PRIuMAX" from %s",
2607 sha1_to_hex(sha1), (uintmax_t)e.offset, e.p->pack_name);
2608 mark_bad_packed_object(e.p, sha1);
2609 data = read_object(sha1, type, size);
2611 return data;
2614 int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
2615 unsigned char *sha1)
2617 struct cached_object *co;
2619 hash_sha1_file(buf, len, typename(type), sha1);
2620 if (has_sha1_file(sha1) || find_cached_object(sha1))
2621 return 0;
2622 if (cached_object_alloc <= cached_object_nr) {
2623 cached_object_alloc = alloc_nr(cached_object_alloc);
2624 cached_objects = xrealloc(cached_objects,
2625 sizeof(*cached_objects) *
2626 cached_object_alloc);
2628 co = &cached_objects[cached_object_nr++];
2629 co->size = len;
2630 co->type = type;
2631 co->buf = xmalloc(len);
2632 memcpy(co->buf, buf, len);
2633 hashcpy(co->sha1, sha1);
2634 return 0;
2637 static void *read_object(const unsigned char *sha1, enum object_type *type,
2638 unsigned long *size)
2640 unsigned long mapsize;
2641 void *map, *buf;
2642 struct cached_object *co;
2644 co = find_cached_object(sha1);
2645 if (co) {
2646 *type = co->type;
2647 *size = co->size;
2648 return xmemdupz(co->buf, co->size);
2651 buf = read_packed_sha1(sha1, type, size);
2652 if (buf)
2653 return buf;
2654 map = map_sha1_file(sha1, &mapsize);
2655 if (map) {
2656 buf = unpack_sha1_file(map, mapsize, type, size, sha1);
2657 munmap(map, mapsize);
2658 return buf;
2660 reprepare_packed_git();
2661 return read_packed_sha1(sha1, type, size);
2665 * This function dies on corrupt objects; the callers who want to
2666 * deal with them should arrange to call read_object() and give error
2667 * messages themselves.
2669 void *read_sha1_file_extended(const unsigned char *sha1,
2670 enum object_type *type,
2671 unsigned long *size,
2672 unsigned flag)
2674 void *data;
2675 char *path;
2676 const struct packed_git *p;
2677 const unsigned char *repl = (flag & READ_SHA1_FILE_REPLACE)
2678 ? lookup_replace_object(sha1) : sha1;
2680 errno = 0;
2681 data = read_object(repl, type, size);
2682 if (data)
2683 return data;
2685 if (errno && errno != ENOENT)
2686 die_errno("failed to read object %s", sha1_to_hex(sha1));
2688 /* die if we replaced an object with one that does not exist */
2689 if (repl != sha1)
2690 die("replacement %s not found for %s",
2691 sha1_to_hex(repl), sha1_to_hex(sha1));
2693 if (has_loose_object(repl)) {
2694 path = sha1_file_name(sha1);
2695 die("loose object %s (stored in %s) is corrupt",
2696 sha1_to_hex(repl), path);
2699 if ((p = has_packed_and_bad(repl)) != NULL)
2700 die("packed object %s (stored in %s) is corrupt",
2701 sha1_to_hex(repl), p->pack_name);
2703 return NULL;
2706 void *read_object_with_reference(const unsigned char *sha1,
2707 const char *required_type_name,
2708 unsigned long *size,
2709 unsigned char *actual_sha1_return)
2711 enum object_type type, required_type;
2712 void *buffer;
2713 unsigned long isize;
2714 unsigned char actual_sha1[20];
2716 required_type = type_from_string(required_type_name);
2717 hashcpy(actual_sha1, sha1);
2718 while (1) {
2719 int ref_length = -1;
2720 const char *ref_type = NULL;
2722 buffer = read_sha1_file(actual_sha1, &type, &isize);
2723 if (!buffer)
2724 return NULL;
2725 if (type == required_type) {
2726 *size = isize;
2727 if (actual_sha1_return)
2728 hashcpy(actual_sha1_return, actual_sha1);
2729 return buffer;
2731 /* Handle references */
2732 else if (type == OBJ_COMMIT)
2733 ref_type = "tree ";
2734 else if (type == OBJ_TAG)
2735 ref_type = "object ";
2736 else {
2737 free(buffer);
2738 return NULL;
2740 ref_length = strlen(ref_type);
2742 if (ref_length + 40 > isize ||
2743 memcmp(buffer, ref_type, ref_length) ||
2744 get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
2745 free(buffer);
2746 return NULL;
2748 free(buffer);
2749 /* Now we have the ID of the referred-to object in
2750 * actual_sha1. Check again. */
2754 static void write_sha1_file_prepare(const void *buf, unsigned long len,
2755 const char *type, unsigned char *sha1,
2756 char *hdr, int *hdrlen)
2758 git_SHA_CTX c;
2760 /* Generate the header */
2761 *hdrlen = sprintf(hdr, "%s %lu", type, len)+1;
2763 /* Sha1.. */
2764 git_SHA1_Init(&c);
2765 git_SHA1_Update(&c, hdr, *hdrlen);
2766 git_SHA1_Update(&c, buf, len);
2767 git_SHA1_Final(sha1, &c);
2771 * Move the just written object into its final resting place.
2772 * NEEDSWORK: this should be renamed to finalize_temp_file() as
2773 * "moving" is only a part of what it does, when no patch between
2774 * master to pu changes the call sites of this function.
2776 int move_temp_to_file(const char *tmpfile, const char *filename)
2778 int ret = 0;
2780 if (object_creation_mode == OBJECT_CREATION_USES_RENAMES)
2781 goto try_rename;
2782 else if (link(tmpfile, filename))
2783 ret = errno;
2786 * Coda hack - coda doesn't like cross-directory links,
2787 * so we fall back to a rename, which will mean that it
2788 * won't be able to check collisions, but that's not a
2789 * big deal.
2791 * The same holds for FAT formatted media.
2793 * When this succeeds, we just return. We have nothing
2794 * left to unlink.
2796 if (ret && ret != EEXIST) {
2797 try_rename:
2798 if (!rename(tmpfile, filename))
2799 goto out;
2800 ret = errno;
2802 unlink_or_warn(tmpfile);
2803 if (ret) {
2804 if (ret != EEXIST) {
2805 return error("unable to write sha1 filename %s: %s", filename, strerror(ret));
2807 /* FIXME!!! Collision check here ? */
2810 out:
2811 if (adjust_shared_perm(filename))
2812 return error("unable to set permission to '%s'", filename);
2813 return 0;
2816 static int write_buffer(int fd, const void *buf, size_t len)
2818 if (write_in_full(fd, buf, len) < 0)
2819 return error("file write error (%s)", strerror(errno));
2820 return 0;
2823 int hash_sha1_file(const void *buf, unsigned long len, const char *type,
2824 unsigned char *sha1)
2826 char hdr[32];
2827 int hdrlen;
2828 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2829 return 0;
2832 /* Finalize a file on disk, and close it. */
2833 static void close_sha1_file(int fd)
2835 if (fsync_object_files)
2836 fsync_or_die(fd, "sha1 file");
2837 if (close(fd) != 0)
2838 die_errno("error when closing sha1 file");
2841 /* Size of directory component, including the ending '/' */
2842 static inline int directory_size(const char *filename)
2844 const char *s = strrchr(filename, '/');
2845 if (!s)
2846 return 0;
2847 return s - filename + 1;
2851 * This creates a temporary file in the same directory as the final
2852 * 'filename'
2854 * We want to avoid cross-directory filename renames, because those
2855 * can have problems on various filesystems (FAT, NFS, Coda).
2857 static int create_tmpfile(char *buffer, size_t bufsiz, const char *filename)
2859 int fd, dirlen = directory_size(filename);
2861 if (dirlen + 20 > bufsiz) {
2862 errno = ENAMETOOLONG;
2863 return -1;
2865 memcpy(buffer, filename, dirlen);
2866 strcpy(buffer + dirlen, "tmp_obj_XXXXXX");
2867 fd = git_mkstemp_mode(buffer, 0444);
2868 if (fd < 0 && dirlen && errno == ENOENT) {
2869 /* Make sure the directory exists */
2870 memcpy(buffer, filename, dirlen);
2871 buffer[dirlen-1] = 0;
2872 if (mkdir(buffer, 0777) && errno != EEXIST)
2873 return -1;
2874 if (adjust_shared_perm(buffer))
2875 return -1;
2877 /* Try again */
2878 strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX");
2879 fd = git_mkstemp_mode(buffer, 0444);
2881 return fd;
2884 static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
2885 const void *buf, unsigned long len, time_t mtime)
2887 int fd, ret;
2888 unsigned char compressed[4096];
2889 git_zstream stream;
2890 git_SHA_CTX c;
2891 unsigned char parano_sha1[20];
2892 char *filename;
2893 static char tmp_file[PATH_MAX];
2895 filename = sha1_file_name(sha1);
2896 fd = create_tmpfile(tmp_file, sizeof(tmp_file), filename);
2897 if (fd < 0) {
2898 if (errno == EACCES)
2899 return error("insufficient permission for adding an object to repository database %s", get_object_directory());
2900 else
2901 return error("unable to create temporary file: %s", strerror(errno));
2904 /* Set it up */
2905 memset(&stream, 0, sizeof(stream));
2906 git_deflate_init(&stream, zlib_compression_level);
2907 stream.next_out = compressed;
2908 stream.avail_out = sizeof(compressed);
2909 git_SHA1_Init(&c);
2911 /* First header.. */
2912 stream.next_in = (unsigned char *)hdr;
2913 stream.avail_in = hdrlen;
2914 while (git_deflate(&stream, 0) == Z_OK)
2915 ; /* nothing */
2916 git_SHA1_Update(&c, hdr, hdrlen);
2918 /* Then the data itself.. */
2919 stream.next_in = (void *)buf;
2920 stream.avail_in = len;
2921 do {
2922 unsigned char *in0 = stream.next_in;
2923 ret = git_deflate(&stream, Z_FINISH);
2924 git_SHA1_Update(&c, in0, stream.next_in - in0);
2925 if (write_buffer(fd, compressed, stream.next_out - compressed) < 0)
2926 die("unable to write sha1 file");
2927 stream.next_out = compressed;
2928 stream.avail_out = sizeof(compressed);
2929 } while (ret == Z_OK);
2931 if (ret != Z_STREAM_END)
2932 die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
2933 ret = git_deflate_end_gently(&stream);
2934 if (ret != Z_OK)
2935 die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
2936 git_SHA1_Final(parano_sha1, &c);
2937 if (hashcmp(sha1, parano_sha1) != 0)
2938 die("confused by unstable object source data for %s", sha1_to_hex(sha1));
2940 close_sha1_file(fd);
2942 if (mtime) {
2943 struct utimbuf utb;
2944 utb.actime = mtime;
2945 utb.modtime = mtime;
2946 if (utime(tmp_file, &utb) < 0)
2947 warning("failed utime() on %s: %s",
2948 tmp_file, strerror(errno));
2951 return move_temp_to_file(tmp_file, filename);
2954 int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2956 unsigned char sha1[20];
2957 char hdr[32];
2958 int hdrlen;
2960 /* Normally if we have it in the pack then we do not bother writing
2961 * it out into .git/objects/??/?{38} file.
2963 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2964 if (returnsha1)
2965 hashcpy(returnsha1, sha1);
2966 if (has_sha1_file(sha1))
2967 return 0;
2968 return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
2971 int force_object_loose(const unsigned char *sha1, time_t mtime)
2973 void *buf;
2974 unsigned long len;
2975 enum object_type type;
2976 char hdr[32];
2977 int hdrlen;
2978 int ret;
2980 if (has_loose_object(sha1))
2981 return 0;
2982 buf = read_packed_sha1(sha1, &type, &len);
2983 if (!buf)
2984 return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
2985 hdrlen = sprintf(hdr, "%s %lu", typename(type), len) + 1;
2986 ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
2987 free(buf);
2989 return ret;
2992 int has_pack_index(const unsigned char *sha1)
2994 struct stat st;
2995 if (stat(sha1_pack_index_name(sha1), &st))
2996 return 0;
2997 return 1;
3000 int has_sha1_pack(const unsigned char *sha1)
3002 struct pack_entry e;
3003 return find_pack_entry(sha1, &e);
3006 int has_sha1_file(const unsigned char *sha1)
3008 struct pack_entry e;
3010 if (find_pack_entry(sha1, &e))
3011 return 1;
3012 if (has_loose_object(sha1))
3013 return 1;
3014 reprepare_packed_git();
3015 return find_pack_entry(sha1, &e);
3018 static void check_tree(const void *buf, size_t size)
3020 struct tree_desc desc;
3021 struct name_entry entry;
3023 init_tree_desc(&desc, buf, size);
3024 while (tree_entry(&desc, &entry))
3025 /* do nothing
3026 * tree_entry() will die() on malformed entries */
3030 static void check_commit(const void *buf, size_t size)
3032 struct commit c;
3033 memset(&c, 0, sizeof(c));
3034 if (parse_commit_buffer(&c, buf, size))
3035 die("corrupt commit");
3038 static void check_tag(const void *buf, size_t size)
3040 struct tag t;
3041 memset(&t, 0, sizeof(t));
3042 if (parse_tag_buffer(&t, buf, size))
3043 die("corrupt tag");
3046 static int index_mem(unsigned char *sha1, void *buf, size_t size,
3047 enum object_type type,
3048 const char *path, unsigned flags)
3050 int ret, re_allocated = 0;
3051 int write_object = flags & HASH_WRITE_OBJECT;
3053 if (!type)
3054 type = OBJ_BLOB;
3057 * Convert blobs to git internal format
3059 if ((type == OBJ_BLOB) && path) {
3060 struct strbuf nbuf = STRBUF_INIT;
3061 if (convert_to_git(path, buf, size, &nbuf,
3062 write_object ? safe_crlf : SAFE_CRLF_FALSE)) {
3063 buf = strbuf_detach(&nbuf, &size);
3064 re_allocated = 1;
3067 if (flags & HASH_FORMAT_CHECK) {
3068 if (type == OBJ_TREE)
3069 check_tree(buf, size);
3070 if (type == OBJ_COMMIT)
3071 check_commit(buf, size);
3072 if (type == OBJ_TAG)
3073 check_tag(buf, size);
3076 if (write_object)
3077 ret = write_sha1_file(buf, size, typename(type), sha1);
3078 else
3079 ret = hash_sha1_file(buf, size, typename(type), sha1);
3080 if (re_allocated)
3081 free(buf);
3082 return ret;
3085 static int index_pipe(unsigned char *sha1, int fd, enum object_type type,
3086 const char *path, unsigned flags)
3088 struct strbuf sbuf = STRBUF_INIT;
3089 int ret;
3091 if (strbuf_read(&sbuf, fd, 4096) >= 0)
3092 ret = index_mem(sha1, sbuf.buf, sbuf.len, type, path, flags);
3093 else
3094 ret = -1;
3095 strbuf_release(&sbuf);
3096 return ret;
3099 #define SMALL_FILE_SIZE (32*1024)
3101 static int index_core(unsigned char *sha1, int fd, size_t size,
3102 enum object_type type, const char *path,
3103 unsigned flags)
3105 int ret;
3107 if (!size) {
3108 ret = index_mem(sha1, NULL, size, type, path, flags);
3109 } else if (size <= SMALL_FILE_SIZE) {
3110 char *buf = xmalloc(size);
3111 if (size == read_in_full(fd, buf, size))
3112 ret = index_mem(sha1, buf, size, type, path, flags);
3113 else
3114 ret = error("short read %s", strerror(errno));
3115 free(buf);
3116 } else {
3117 void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
3118 ret = index_mem(sha1, buf, size, type, path, flags);
3119 munmap(buf, size);
3121 return ret;
3125 * This creates one packfile per large blob unless bulk-checkin
3126 * machinery is "plugged".
3128 * This also bypasses the usual "convert-to-git" dance, and that is on
3129 * purpose. We could write a streaming version of the converting
3130 * functions and insert that before feeding the data to fast-import
3131 * (or equivalent in-core API described above). However, that is
3132 * somewhat complicated, as we do not know the size of the filter
3133 * result, which we need to know beforehand when writing a git object.
3134 * Since the primary motivation for trying to stream from the working
3135 * tree file and to avoid mmaping it in core is to deal with large
3136 * binary blobs, they generally do not want to get any conversion, and
3137 * callers should avoid this code path when filters are requested.
3139 static int index_stream(unsigned char *sha1, int fd, size_t size,
3140 enum object_type type, const char *path,
3141 unsigned flags)
3143 return index_bulk_checkin(sha1, fd, size, type, path, flags);
3146 int index_fd(unsigned char *sha1, int fd, struct stat *st,
3147 enum object_type type, const char *path, unsigned flags)
3149 int ret;
3150 size_t size = xsize_t(st->st_size);
3152 if (!S_ISREG(st->st_mode))
3153 ret = index_pipe(sha1, fd, type, path, flags);
3154 else if (size <= big_file_threshold || type != OBJ_BLOB ||
3155 (path && would_convert_to_git(path, NULL, 0, 0)))
3156 ret = index_core(sha1, fd, size, type, path, flags);
3157 else
3158 ret = index_stream(sha1, fd, size, type, path, flags);
3159 close(fd);
3160 return ret;
3163 int index_path(unsigned char *sha1, const char *path, struct stat *st, unsigned flags)
3165 int fd;
3166 struct strbuf sb = STRBUF_INIT;
3168 switch (st->st_mode & S_IFMT) {
3169 case S_IFREG:
3170 fd = open(path, O_RDONLY);
3171 if (fd < 0)
3172 return error("open(\"%s\"): %s", path,
3173 strerror(errno));
3174 if (index_fd(sha1, fd, st, OBJ_BLOB, path, flags) < 0)
3175 return error("%s: failed to insert into database",
3176 path);
3177 break;
3178 case S_IFLNK:
3179 if (strbuf_readlink(&sb, path, st->st_size)) {
3180 char *errstr = strerror(errno);
3181 return error("readlink(\"%s\"): %s", path,
3182 errstr);
3184 if (!(flags & HASH_WRITE_OBJECT))
3185 hash_sha1_file(sb.buf, sb.len, blob_type, sha1);
3186 else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1))
3187 return error("%s: failed to insert into database",
3188 path);
3189 strbuf_release(&sb);
3190 break;
3191 case S_IFDIR:
3192 return resolve_gitlink_ref(path, "HEAD", sha1);
3193 default:
3194 return error("%s: unsupported file type", path);
3196 return 0;
3199 int read_pack_header(int fd, struct pack_header *header)
3201 if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
3202 /* "eof before pack header was fully read" */
3203 return PH_ERROR_EOF;
3205 if (header->hdr_signature != htonl(PACK_SIGNATURE))
3206 /* "protocol error (pack signature mismatch detected)" */
3207 return PH_ERROR_PACK_SIGNATURE;
3208 if (!pack_version_ok(header->hdr_version))
3209 /* "protocol error (pack version unsupported)" */
3210 return PH_ERROR_PROTOCOL;
3211 return 0;
3214 void assert_sha1_type(const unsigned char *sha1, enum object_type expect)
3216 enum object_type type = sha1_object_info(sha1, NULL);
3217 if (type < 0)
3218 die("%s is not a valid object", sha1_to_hex(sha1));
3219 if (type != expect)
3220 die("%s is not a valid '%s' object", sha1_to_hex(sha1),
3221 typename(expect));