Merge branch 'ef/mingw-write'
[git/debian.git] / sha1_file.c
blobe13bd2c3ee7edb4d157e499fbcea80535ec5752f
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 int safe_create_leading_directories(char *path)
110 char *pos = path + offset_1st_component(path);
111 struct stat st;
113 while (pos) {
114 pos = strchr(pos, '/');
115 if (!pos)
116 break;
117 while (*++pos == '/')
119 if (!*pos)
120 break;
121 *--pos = '\0';
122 if (!stat(path, &st)) {
123 /* path exists */
124 if (!S_ISDIR(st.st_mode)) {
125 *pos = '/';
126 return -3;
129 else if (mkdir(path, 0777)) {
130 if (errno == EEXIST &&
131 !stat(path, &st) && S_ISDIR(st.st_mode)) {
132 ; /* somebody created it since we checked */
133 } else {
134 *pos = '/';
135 return -1;
138 else if (adjust_shared_perm(path)) {
139 *pos = '/';
140 return -2;
142 *pos++ = '/';
144 return 0;
147 int safe_create_leading_directories_const(const char *path)
149 /* path points to cache entries, so xstrdup before messing with it */
150 char *buf = xstrdup(path);
151 int result = safe_create_leading_directories(buf);
152 free(buf);
153 return result;
156 static void fill_sha1_path(char *pathbuf, const unsigned char *sha1)
158 int i;
159 for (i = 0; i < 20; i++) {
160 static char hex[] = "0123456789abcdef";
161 unsigned int val = sha1[i];
162 char *pos = pathbuf + i*2 + (i > 0);
163 *pos++ = hex[val >> 4];
164 *pos = hex[val & 0xf];
169 * NOTE! This returns a statically allocated buffer, so you have to be
170 * careful about using it. Do an "xstrdup()" if you need to save the
171 * filename.
173 * Also note that this returns the location for creating. Reading
174 * SHA1 file can happen from any alternate directory listed in the
175 * DB_ENVIRONMENT environment variable if it is not found in
176 * the primary object database.
178 char *sha1_file_name(const unsigned char *sha1)
180 static char buf[PATH_MAX];
181 const char *objdir;
182 int len;
184 objdir = get_object_directory();
185 len = strlen(objdir);
187 /* '/' + sha1(2) + '/' + sha1(38) + '\0' */
188 if (len + 43 > PATH_MAX)
189 die("insanely long object directory %s", objdir);
190 memcpy(buf, objdir, len);
191 buf[len] = '/';
192 buf[len+3] = '/';
193 buf[len+42] = '\0';
194 fill_sha1_path(buf + len + 1, sha1);
195 return buf;
198 static char *sha1_get_pack_name(const unsigned char *sha1,
199 char **name, char **base, const char *which)
201 static const char hex[] = "0123456789abcdef";
202 char *buf;
203 int i;
205 if (!*base) {
206 const char *sha1_file_directory = get_object_directory();
207 int len = strlen(sha1_file_directory);
208 *base = xmalloc(len + 60);
209 sprintf(*base, "%s/pack/pack-1234567890123456789012345678901234567890.%s",
210 sha1_file_directory, which);
211 *name = *base + len + 11;
214 buf = *name;
216 for (i = 0; i < 20; i++) {
217 unsigned int val = *sha1++;
218 *buf++ = hex[val >> 4];
219 *buf++ = hex[val & 0xf];
222 return *base;
225 char *sha1_pack_name(const unsigned char *sha1)
227 static char *name, *base;
229 return sha1_get_pack_name(sha1, &name, &base, "pack");
232 char *sha1_pack_index_name(const unsigned char *sha1)
234 static char *name, *base;
236 return sha1_get_pack_name(sha1, &name, &base, "idx");
239 struct alternate_object_database *alt_odb_list;
240 static struct alternate_object_database **alt_odb_tail;
242 static int git_open_noatime(const char *name);
245 * Prepare alternate object database registry.
247 * The variable alt_odb_list points at the list of struct
248 * alternate_object_database. The elements on this list come from
249 * non-empty elements from colon separated ALTERNATE_DB_ENVIRONMENT
250 * environment variable, and $GIT_OBJECT_DIRECTORY/info/alternates,
251 * whose contents is similar to that environment variable but can be
252 * LF separated. Its base points at a statically allocated buffer that
253 * contains "/the/directory/corresponding/to/.git/objects/...", while
254 * its name points just after the slash at the end of ".git/objects/"
255 * in the example above, and has enough space to hold 40-byte hex
256 * SHA1, an extra slash for the first level indirection, and the
257 * terminating NUL.
259 static int link_alt_odb_entry(const char *entry, const char *relative_base, int depth)
261 const char *objdir = get_object_directory();
262 struct alternate_object_database *ent;
263 struct alternate_object_database *alt;
264 int pfxlen, entlen;
265 struct strbuf pathbuf = STRBUF_INIT;
267 if (!is_absolute_path(entry) && relative_base) {
268 strbuf_addstr(&pathbuf, real_path(relative_base));
269 strbuf_addch(&pathbuf, '/');
271 strbuf_addstr(&pathbuf, entry);
273 normalize_path_copy(pathbuf.buf, pathbuf.buf);
275 pfxlen = strlen(pathbuf.buf);
278 * The trailing slash after the directory name is given by
279 * this function at the end. Remove duplicates.
281 while (pfxlen && pathbuf.buf[pfxlen-1] == '/')
282 pfxlen -= 1;
284 entlen = pfxlen + 43; /* '/' + 2 hex + '/' + 38 hex + NUL */
285 ent = xmalloc(sizeof(*ent) + entlen);
286 memcpy(ent->base, pathbuf.buf, pfxlen);
287 strbuf_release(&pathbuf);
289 ent->name = ent->base + pfxlen + 1;
290 ent->base[pfxlen + 3] = '/';
291 ent->base[pfxlen] = ent->base[entlen-1] = 0;
293 /* Detect cases where alternate disappeared */
294 if (!is_directory(ent->base)) {
295 error("object directory %s does not exist; "
296 "check .git/objects/info/alternates.",
297 ent->base);
298 free(ent);
299 return -1;
302 /* Prevent the common mistake of listing the same
303 * thing twice, or object directory itself.
305 for (alt = alt_odb_list; alt; alt = alt->next) {
306 if (!memcmp(ent->base, alt->base, pfxlen)) {
307 free(ent);
308 return -1;
311 if (!strcmp(ent->base, objdir)) {
312 free(ent);
313 return -1;
316 /* add the alternate entry */
317 *alt_odb_tail = ent;
318 alt_odb_tail = &(ent->next);
319 ent->next = NULL;
321 /* recursively add alternates */
322 read_info_alternates(ent->base, depth + 1);
324 ent->base[pfxlen] = '/';
326 return 0;
329 static void link_alt_odb_entries(const char *alt, int len, int sep,
330 const char *relative_base, int depth)
332 struct string_list entries = STRING_LIST_INIT_NODUP;
333 char *alt_copy;
334 int i;
336 if (depth > 5) {
337 error("%s: ignoring alternate object stores, nesting too deep.",
338 relative_base);
339 return;
342 alt_copy = xmemdupz(alt, len);
343 string_list_split_in_place(&entries, alt_copy, sep, -1);
344 for (i = 0; i < entries.nr; i++) {
345 const char *entry = entries.items[i].string;
346 if (entry[0] == '\0' || entry[0] == '#')
347 continue;
348 if (!is_absolute_path(entry) && depth) {
349 error("%s: ignoring relative alternate object store %s",
350 relative_base, entry);
351 } else {
352 link_alt_odb_entry(entry, relative_base, depth);
355 string_list_clear(&entries, 0);
356 free(alt_copy);
359 void read_info_alternates(const char * relative_base, int depth)
361 char *map;
362 size_t mapsz;
363 struct stat st;
364 const char alt_file_name[] = "info/alternates";
365 /* Given that relative_base is no longer than PATH_MAX,
366 ensure that "path" has enough space to append "/", the
367 file name, "info/alternates", and a trailing NUL. */
368 char path[PATH_MAX + 1 + sizeof alt_file_name];
369 int fd;
371 sprintf(path, "%s/%s", relative_base, alt_file_name);
372 fd = git_open_noatime(path);
373 if (fd < 0)
374 return;
375 if (fstat(fd, &st) || (st.st_size == 0)) {
376 close(fd);
377 return;
379 mapsz = xsize_t(st.st_size);
380 map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
381 close(fd);
383 link_alt_odb_entries(map, mapsz, '\n', relative_base, depth);
385 munmap(map, mapsz);
388 void add_to_alternates_file(const char *reference)
390 struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
391 int fd = hold_lock_file_for_append(lock, git_path("objects/info/alternates"), LOCK_DIE_ON_ERROR);
392 char *alt = mkpath("%s\n", reference);
393 write_or_die(fd, alt, strlen(alt));
394 if (commit_lock_file(lock))
395 die("could not close alternates file");
396 if (alt_odb_tail)
397 link_alt_odb_entries(alt, strlen(alt), '\n', NULL, 0);
400 void foreach_alt_odb(alt_odb_fn fn, void *cb)
402 struct alternate_object_database *ent;
404 prepare_alt_odb();
405 for (ent = alt_odb_list; ent; ent = ent->next)
406 if (fn(ent, cb))
407 return;
410 void prepare_alt_odb(void)
412 const char *alt;
414 if (alt_odb_tail)
415 return;
417 alt = getenv(ALTERNATE_DB_ENVIRONMENT);
418 if (!alt) alt = "";
420 alt_odb_tail = &alt_odb_list;
421 link_alt_odb_entries(alt, strlen(alt), PATH_SEP, NULL, 0);
423 read_info_alternates(get_object_directory(), 0);
426 static int has_loose_object_local(const unsigned char *sha1)
428 char *name = sha1_file_name(sha1);
429 return !access(name, F_OK);
432 int has_loose_object_nonlocal(const unsigned char *sha1)
434 struct alternate_object_database *alt;
435 prepare_alt_odb();
436 for (alt = alt_odb_list; alt; alt = alt->next) {
437 fill_sha1_path(alt->name, sha1);
438 if (!access(alt->base, F_OK))
439 return 1;
441 return 0;
444 static int has_loose_object(const unsigned char *sha1)
446 return has_loose_object_local(sha1) ||
447 has_loose_object_nonlocal(sha1);
450 static unsigned int pack_used_ctr;
451 static unsigned int pack_mmap_calls;
452 static unsigned int peak_pack_open_windows;
453 static unsigned int pack_open_windows;
454 static unsigned int pack_open_fds;
455 static unsigned int pack_max_fds;
456 static size_t peak_pack_mapped;
457 static size_t pack_mapped;
458 struct packed_git *packed_git;
460 void pack_report(void)
462 fprintf(stderr,
463 "pack_report: getpagesize() = %10" SZ_FMT "\n"
464 "pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
465 "pack_report: core.packedGitLimit = %10" SZ_FMT "\n",
466 sz_fmt(getpagesize()),
467 sz_fmt(packed_git_window_size),
468 sz_fmt(packed_git_limit));
469 fprintf(stderr,
470 "pack_report: pack_used_ctr = %10u\n"
471 "pack_report: pack_mmap_calls = %10u\n"
472 "pack_report: pack_open_windows = %10u / %10u\n"
473 "pack_report: pack_mapped = "
474 "%10" SZ_FMT " / %10" SZ_FMT "\n",
475 pack_used_ctr,
476 pack_mmap_calls,
477 pack_open_windows, peak_pack_open_windows,
478 sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
481 static int check_packed_git_idx(const char *path, struct packed_git *p)
483 void *idx_map;
484 struct pack_idx_header *hdr;
485 size_t idx_size;
486 uint32_t version, nr, i, *index;
487 int fd = git_open_noatime(path);
488 struct stat st;
490 if (fd < 0)
491 return -1;
492 if (fstat(fd, &st)) {
493 close(fd);
494 return -1;
496 idx_size = xsize_t(st.st_size);
497 if (idx_size < 4 * 256 + 20 + 20) {
498 close(fd);
499 return error("index file %s is too small", path);
501 idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
502 close(fd);
504 hdr = idx_map;
505 if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
506 version = ntohl(hdr->idx_version);
507 if (version < 2 || version > 2) {
508 munmap(idx_map, idx_size);
509 return error("index file %s is version %"PRIu32
510 " and is not supported by this binary"
511 " (try upgrading GIT to a newer version)",
512 path, version);
514 } else
515 version = 1;
517 nr = 0;
518 index = idx_map;
519 if (version > 1)
520 index += 2; /* skip index header */
521 for (i = 0; i < 256; i++) {
522 uint32_t n = ntohl(index[i]);
523 if (n < nr) {
524 munmap(idx_map, idx_size);
525 return error("non-monotonic index %s", path);
527 nr = n;
530 if (version == 1) {
532 * Total size:
533 * - 256 index entries 4 bytes each
534 * - 24-byte entries * nr (20-byte sha1 + 4-byte offset)
535 * - 20-byte SHA1 of the packfile
536 * - 20-byte SHA1 file checksum
538 if (idx_size != 4*256 + nr * 24 + 20 + 20) {
539 munmap(idx_map, idx_size);
540 return error("wrong index v1 file size in %s", path);
542 } else if (version == 2) {
544 * Minimum size:
545 * - 8 bytes of header
546 * - 256 index entries 4 bytes each
547 * - 20-byte sha1 entry * nr
548 * - 4-byte crc entry * nr
549 * - 4-byte offset entry * nr
550 * - 20-byte SHA1 of the packfile
551 * - 20-byte SHA1 file checksum
552 * And after the 4-byte offset table might be a
553 * variable sized table containing 8-byte entries
554 * for offsets larger than 2^31.
556 unsigned long min_size = 8 + 4*256 + nr*(20 + 4 + 4) + 20 + 20;
557 unsigned long max_size = min_size;
558 if (nr)
559 max_size += (nr - 1)*8;
560 if (idx_size < min_size || idx_size > max_size) {
561 munmap(idx_map, idx_size);
562 return error("wrong index v2 file size in %s", path);
564 if (idx_size != min_size &&
566 * make sure we can deal with large pack offsets.
567 * 31-bit signed offset won't be enough, neither
568 * 32-bit unsigned one will be.
570 (sizeof(off_t) <= 4)) {
571 munmap(idx_map, idx_size);
572 return error("pack too large for current definition of off_t in %s", path);
576 p->index_version = version;
577 p->index_data = idx_map;
578 p->index_size = idx_size;
579 p->num_objects = nr;
580 return 0;
583 int open_pack_index(struct packed_git *p)
585 char *idx_name;
586 int ret;
588 if (p->index_data)
589 return 0;
591 idx_name = xstrdup(p->pack_name);
592 strcpy(idx_name + strlen(idx_name) - strlen(".pack"), ".idx");
593 ret = check_packed_git_idx(idx_name, p);
594 free(idx_name);
595 return ret;
598 static void scan_windows(struct packed_git *p,
599 struct packed_git **lru_p,
600 struct pack_window **lru_w,
601 struct pack_window **lru_l)
603 struct pack_window *w, *w_l;
605 for (w_l = NULL, w = p->windows; w; w = w->next) {
606 if (!w->inuse_cnt) {
607 if (!*lru_w || w->last_used < (*lru_w)->last_used) {
608 *lru_p = p;
609 *lru_w = w;
610 *lru_l = w_l;
613 w_l = w;
617 static int unuse_one_window(struct packed_git *current)
619 struct packed_git *p, *lru_p = NULL;
620 struct pack_window *lru_w = NULL, *lru_l = NULL;
622 if (current)
623 scan_windows(current, &lru_p, &lru_w, &lru_l);
624 for (p = packed_git; p; p = p->next)
625 scan_windows(p, &lru_p, &lru_w, &lru_l);
626 if (lru_p) {
627 munmap(lru_w->base, lru_w->len);
628 pack_mapped -= lru_w->len;
629 if (lru_l)
630 lru_l->next = lru_w->next;
631 else
632 lru_p->windows = lru_w->next;
633 free(lru_w);
634 pack_open_windows--;
635 return 1;
637 return 0;
640 void release_pack_memory(size_t need)
642 size_t cur = pack_mapped;
643 while (need >= (cur - pack_mapped) && unuse_one_window(NULL))
644 ; /* nothing */
647 void *xmmap(void *start, size_t length,
648 int prot, int flags, int fd, off_t offset)
650 void *ret = mmap(start, length, prot, flags, fd, offset);
651 if (ret == MAP_FAILED) {
652 if (!length)
653 return NULL;
654 release_pack_memory(length);
655 ret = mmap(start, length, prot, flags, fd, offset);
656 if (ret == MAP_FAILED)
657 die_errno("Out of memory? mmap failed");
659 return ret;
662 void close_pack_windows(struct packed_git *p)
664 while (p->windows) {
665 struct pack_window *w = p->windows;
667 if (w->inuse_cnt)
668 die("pack '%s' still has open windows to it",
669 p->pack_name);
670 munmap(w->base, w->len);
671 pack_mapped -= w->len;
672 pack_open_windows--;
673 p->windows = w->next;
674 free(w);
679 * The LRU pack is the one with the oldest MRU window, preferring packs
680 * with no used windows, or the oldest mtime if it has no windows allocated.
682 static void find_lru_pack(struct packed_git *p, struct packed_git **lru_p, struct pack_window **mru_w, int *accept_windows_inuse)
684 struct pack_window *w, *this_mru_w;
685 int has_windows_inuse = 0;
688 * Reject this pack if it has windows and the previously selected
689 * one does not. If this pack does not have windows, reject
690 * it if the pack file is newer than the previously selected one.
692 if (*lru_p && !*mru_w && (p->windows || p->mtime > (*lru_p)->mtime))
693 return;
695 for (w = this_mru_w = p->windows; w; w = w->next) {
697 * Reject this pack if any of its windows are in use,
698 * but the previously selected pack did not have any
699 * inuse windows. Otherwise, record that this pack
700 * has windows in use.
702 if (w->inuse_cnt) {
703 if (*accept_windows_inuse)
704 has_windows_inuse = 1;
705 else
706 return;
709 if (w->last_used > this_mru_w->last_used)
710 this_mru_w = w;
713 * Reject this pack if it has windows that have been
714 * used more recently than the previously selected pack.
715 * If the previously selected pack had windows inuse and
716 * we have not encountered a window in this pack that is
717 * inuse, skip this check since we prefer a pack with no
718 * inuse windows to one that has inuse windows.
720 if (*mru_w && *accept_windows_inuse == has_windows_inuse &&
721 this_mru_w->last_used > (*mru_w)->last_used)
722 return;
726 * Select this pack.
728 *mru_w = this_mru_w;
729 *lru_p = p;
730 *accept_windows_inuse = has_windows_inuse;
733 static int close_one_pack(void)
735 struct packed_git *p, *lru_p = NULL;
736 struct pack_window *mru_w = NULL;
737 int accept_windows_inuse = 1;
739 for (p = packed_git; p; p = p->next) {
740 if (p->pack_fd == -1)
741 continue;
742 find_lru_pack(p, &lru_p, &mru_w, &accept_windows_inuse);
745 if (lru_p) {
746 close(lru_p->pack_fd);
747 pack_open_fds--;
748 lru_p->pack_fd = -1;
749 return 1;
752 return 0;
755 void unuse_pack(struct pack_window **w_cursor)
757 struct pack_window *w = *w_cursor;
758 if (w) {
759 w->inuse_cnt--;
760 *w_cursor = NULL;
764 void close_pack_index(struct packed_git *p)
766 if (p->index_data) {
767 munmap((void *)p->index_data, p->index_size);
768 p->index_data = NULL;
773 * This is used by git-repack in case a newly created pack happens to
774 * contain the same set of objects as an existing one. In that case
775 * the resulting file might be different even if its name would be the
776 * same. It is best to close any reference to the old pack before it is
777 * replaced on disk. Of course no index pointers nor windows for given pack
778 * must subsist at this point. If ever objects from this pack are requested
779 * again, the new version of the pack will be reinitialized through
780 * reprepare_packed_git().
782 void free_pack_by_name(const char *pack_name)
784 struct packed_git *p, **pp = &packed_git;
786 while (*pp) {
787 p = *pp;
788 if (strcmp(pack_name, p->pack_name) == 0) {
789 clear_delta_base_cache();
790 close_pack_windows(p);
791 if (p->pack_fd != -1) {
792 close(p->pack_fd);
793 pack_open_fds--;
795 close_pack_index(p);
796 free(p->bad_object_sha1);
797 *pp = p->next;
798 if (last_found_pack == p)
799 last_found_pack = NULL;
800 free(p);
801 return;
803 pp = &p->next;
807 static unsigned int get_max_fd_limit(void)
809 #ifdef RLIMIT_NOFILE
811 struct rlimit lim;
813 if (!getrlimit(RLIMIT_NOFILE, &lim))
814 return lim.rlim_cur;
816 #endif
818 #ifdef _SC_OPEN_MAX
820 long open_max = sysconf(_SC_OPEN_MAX);
821 if (0 < open_max)
822 return open_max;
824 * Otherwise, we got -1 for one of the two
825 * reasons:
827 * (1) sysconf() did not understand _SC_OPEN_MAX
828 * and signaled an error with -1; or
829 * (2) sysconf() said there is no limit.
831 * We _could_ clear errno before calling sysconf() to
832 * tell these two cases apart and return a huge number
833 * in the latter case to let the caller cap it to a
834 * value that is not so selfish, but letting the
835 * fallback OPEN_MAX codepath take care of these cases
836 * is a lot simpler.
839 #endif
841 #ifdef OPEN_MAX
842 return OPEN_MAX;
843 #else
844 return 1; /* see the caller ;-) */
845 #endif
849 * Do not call this directly as this leaks p->pack_fd on error return;
850 * call open_packed_git() instead.
852 static int open_packed_git_1(struct packed_git *p)
854 struct stat st;
855 struct pack_header hdr;
856 unsigned char sha1[20];
857 unsigned char *idx_sha1;
858 long fd_flag;
860 if (!p->index_data && open_pack_index(p))
861 return error("packfile %s index unavailable", p->pack_name);
863 if (!pack_max_fds) {
864 unsigned int max_fds = get_max_fd_limit();
866 /* Save 3 for stdin/stdout/stderr, 22 for work */
867 if (25 < max_fds)
868 pack_max_fds = max_fds - 25;
869 else
870 pack_max_fds = 1;
873 while (pack_max_fds <= pack_open_fds && close_one_pack())
874 ; /* nothing */
876 p->pack_fd = git_open_noatime(p->pack_name);
877 if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
878 return -1;
879 pack_open_fds++;
881 /* If we created the struct before we had the pack we lack size. */
882 if (!p->pack_size) {
883 if (!S_ISREG(st.st_mode))
884 return error("packfile %s not a regular file", p->pack_name);
885 p->pack_size = st.st_size;
886 } else if (p->pack_size != st.st_size)
887 return error("packfile %s size changed", p->pack_name);
889 /* We leave these file descriptors open with sliding mmap;
890 * there is no point keeping them open across exec(), though.
892 fd_flag = fcntl(p->pack_fd, F_GETFD, 0);
893 if (fd_flag < 0)
894 return error("cannot determine file descriptor flags");
895 fd_flag |= FD_CLOEXEC;
896 if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
897 return error("cannot set FD_CLOEXEC");
899 /* Verify we recognize this pack file format. */
900 if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
901 return error("file %s is far too short to be a packfile", p->pack_name);
902 if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
903 return error("file %s is not a GIT packfile", p->pack_name);
904 if (!pack_version_ok(hdr.hdr_version))
905 return error("packfile %s is version %"PRIu32" and not"
906 " supported (try upgrading GIT to a newer version)",
907 p->pack_name, ntohl(hdr.hdr_version));
909 /* Verify the pack matches its index. */
910 if (p->num_objects != ntohl(hdr.hdr_entries))
911 return error("packfile %s claims to have %"PRIu32" objects"
912 " while index indicates %"PRIu32" objects",
913 p->pack_name, ntohl(hdr.hdr_entries),
914 p->num_objects);
915 if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
916 return error("end of packfile %s is unavailable", p->pack_name);
917 if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
918 return error("packfile %s signature is unavailable", p->pack_name);
919 idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
920 if (hashcmp(sha1, idx_sha1))
921 return error("packfile %s does not match index", p->pack_name);
922 return 0;
925 static int open_packed_git(struct packed_git *p)
927 if (!open_packed_git_1(p))
928 return 0;
929 if (p->pack_fd != -1) {
930 close(p->pack_fd);
931 pack_open_fds--;
932 p->pack_fd = -1;
934 return -1;
937 static int in_window(struct pack_window *win, off_t offset)
939 /* We must promise at least 20 bytes (one hash) after the
940 * offset is available from this window, otherwise the offset
941 * is not actually in this window and a different window (which
942 * has that one hash excess) must be used. This is to support
943 * the object header and delta base parsing routines below.
945 off_t win_off = win->offset;
946 return win_off <= offset
947 && (offset + 20) <= (win_off + win->len);
950 unsigned char *use_pack(struct packed_git *p,
951 struct pack_window **w_cursor,
952 off_t offset,
953 unsigned long *left)
955 struct pack_window *win = *w_cursor;
957 /* Since packfiles end in a hash of their content and it's
958 * pointless to ask for an offset into the middle of that
959 * hash, and the in_window function above wouldn't match
960 * don't allow an offset too close to the end of the file.
962 if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p))
963 die("packfile %s cannot be accessed", p->pack_name);
964 if (offset > (p->pack_size - 20))
965 die("offset beyond end of packfile (truncated pack?)");
967 if (!win || !in_window(win, offset)) {
968 if (win)
969 win->inuse_cnt--;
970 for (win = p->windows; win; win = win->next) {
971 if (in_window(win, offset))
972 break;
974 if (!win) {
975 size_t window_align = packed_git_window_size / 2;
976 off_t len;
978 if (p->pack_fd == -1 && open_packed_git(p))
979 die("packfile %s cannot be accessed", p->pack_name);
981 win = xcalloc(1, sizeof(*win));
982 win->offset = (offset / window_align) * window_align;
983 len = p->pack_size - win->offset;
984 if (len > packed_git_window_size)
985 len = packed_git_window_size;
986 win->len = (size_t)len;
987 pack_mapped += win->len;
988 while (packed_git_limit < pack_mapped
989 && unuse_one_window(p))
990 ; /* nothing */
991 win->base = xmmap(NULL, win->len,
992 PROT_READ, MAP_PRIVATE,
993 p->pack_fd, win->offset);
994 if (win->base == MAP_FAILED)
995 die("packfile %s cannot be mapped: %s",
996 p->pack_name,
997 strerror(errno));
998 if (!win->offset && win->len == p->pack_size
999 && !p->do_not_close) {
1000 close(p->pack_fd);
1001 pack_open_fds--;
1002 p->pack_fd = -1;
1004 pack_mmap_calls++;
1005 pack_open_windows++;
1006 if (pack_mapped > peak_pack_mapped)
1007 peak_pack_mapped = pack_mapped;
1008 if (pack_open_windows > peak_pack_open_windows)
1009 peak_pack_open_windows = pack_open_windows;
1010 win->next = p->windows;
1011 p->windows = win;
1014 if (win != *w_cursor) {
1015 win->last_used = pack_used_ctr++;
1016 win->inuse_cnt++;
1017 *w_cursor = win;
1019 offset -= win->offset;
1020 if (left)
1021 *left = win->len - xsize_t(offset);
1022 return win->base + offset;
1025 static struct packed_git *alloc_packed_git(int extra)
1027 struct packed_git *p = xmalloc(sizeof(*p) + extra);
1028 memset(p, 0, sizeof(*p));
1029 p->pack_fd = -1;
1030 return p;
1033 static void try_to_free_pack_memory(size_t size)
1035 release_pack_memory(size);
1038 struct packed_git *add_packed_git(const char *path, int path_len, int local)
1040 static int have_set_try_to_free_routine;
1041 struct stat st;
1042 struct packed_git *p = alloc_packed_git(path_len + 2);
1044 if (!have_set_try_to_free_routine) {
1045 have_set_try_to_free_routine = 1;
1046 set_try_to_free_routine(try_to_free_pack_memory);
1050 * Make sure a corresponding .pack file exists and that
1051 * the index looks sane.
1053 path_len -= strlen(".idx");
1054 if (path_len < 1) {
1055 free(p);
1056 return NULL;
1058 memcpy(p->pack_name, path, path_len);
1060 strcpy(p->pack_name + path_len, ".keep");
1061 if (!access(p->pack_name, F_OK))
1062 p->pack_keep = 1;
1064 strcpy(p->pack_name + path_len, ".pack");
1065 if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
1066 free(p);
1067 return NULL;
1070 /* ok, it looks sane as far as we can check without
1071 * actually mapping the pack file.
1073 p->pack_size = st.st_size;
1074 p->pack_local = local;
1075 p->mtime = st.st_mtime;
1076 if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
1077 hashclr(p->sha1);
1078 return p;
1081 struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
1083 const char *path = sha1_pack_name(sha1);
1084 struct packed_git *p = alloc_packed_git(strlen(path) + 1);
1086 strcpy(p->pack_name, path);
1087 hashcpy(p->sha1, sha1);
1088 if (check_packed_git_idx(idx_path, p)) {
1089 free(p);
1090 return NULL;
1093 return p;
1096 void install_packed_git(struct packed_git *pack)
1098 if (pack->pack_fd != -1)
1099 pack_open_fds++;
1101 pack->next = packed_git;
1102 packed_git = pack;
1105 void (*report_garbage)(const char *desc, const char *path);
1107 static void report_helper(const struct string_list *list,
1108 int seen_bits, int first, int last)
1110 const char *msg;
1111 switch (seen_bits) {
1112 case 0:
1113 msg = "no corresponding .idx nor .pack";
1114 break;
1115 case 1:
1116 msg = "no corresponding .idx";
1117 break;
1118 case 2:
1119 msg = "no corresponding .pack";
1120 break;
1121 default:
1122 return;
1124 for (; first < last; first++)
1125 report_garbage(msg, list->items[first].string);
1128 static void report_pack_garbage(struct string_list *list)
1130 int i, baselen = -1, first = 0, seen_bits = 0;
1132 if (!report_garbage)
1133 return;
1135 sort_string_list(list);
1137 for (i = 0; i < list->nr; i++) {
1138 const char *path = list->items[i].string;
1139 if (baselen != -1 &&
1140 strncmp(path, list->items[first].string, baselen)) {
1141 report_helper(list, seen_bits, first, i);
1142 baselen = -1;
1143 seen_bits = 0;
1145 if (baselen == -1) {
1146 const char *dot = strrchr(path, '.');
1147 if (!dot) {
1148 report_garbage("garbage found", path);
1149 continue;
1151 baselen = dot - path + 1;
1152 first = i;
1154 if (!strcmp(path + baselen, "pack"))
1155 seen_bits |= 1;
1156 else if (!strcmp(path + baselen, "idx"))
1157 seen_bits |= 2;
1159 report_helper(list, seen_bits, first, list->nr);
1162 static void prepare_packed_git_one(char *objdir, int local)
1164 /* Ensure that this buffer is large enough so that we can
1165 append "/pack/" without clobbering the stack even if
1166 strlen(objdir) were PATH_MAX. */
1167 char path[PATH_MAX + 1 + 4 + 1 + 1];
1168 int len;
1169 DIR *dir;
1170 struct dirent *de;
1171 struct string_list garbage = STRING_LIST_INIT_DUP;
1173 sprintf(path, "%s/pack", objdir);
1174 len = strlen(path);
1175 dir = opendir(path);
1176 if (!dir) {
1177 if (errno != ENOENT)
1178 error("unable to open object pack directory: %s: %s",
1179 path, strerror(errno));
1180 return;
1182 path[len++] = '/';
1183 while ((de = readdir(dir)) != NULL) {
1184 int namelen = strlen(de->d_name);
1185 struct packed_git *p;
1187 if (len + namelen + 1 > sizeof(path)) {
1188 if (report_garbage) {
1189 struct strbuf sb = STRBUF_INIT;
1190 strbuf_addf(&sb, "%.*s/%s", len - 1, path, de->d_name);
1191 report_garbage("path too long", sb.buf);
1192 strbuf_release(&sb);
1194 continue;
1197 if (is_dot_or_dotdot(de->d_name))
1198 continue;
1200 strcpy(path + len, de->d_name);
1202 if (has_extension(de->d_name, ".idx")) {
1203 /* Don't reopen a pack we already have. */
1204 for (p = packed_git; p; p = p->next) {
1205 if (!memcmp(path, p->pack_name, len + namelen - 4))
1206 break;
1208 if (p == NULL &&
1210 * See if it really is a valid .idx file with
1211 * corresponding .pack file that we can map.
1213 (p = add_packed_git(path, len + namelen, local)) != NULL)
1214 install_packed_git(p);
1217 if (!report_garbage)
1218 continue;
1220 if (has_extension(de->d_name, ".idx") ||
1221 has_extension(de->d_name, ".pack") ||
1222 has_extension(de->d_name, ".keep"))
1223 string_list_append(&garbage, path);
1224 else
1225 report_garbage("garbage found", path);
1227 closedir(dir);
1228 report_pack_garbage(&garbage);
1229 string_list_clear(&garbage, 0);
1232 static int sort_pack(const void *a_, const void *b_)
1234 struct packed_git *a = *((struct packed_git **)a_);
1235 struct packed_git *b = *((struct packed_git **)b_);
1236 int st;
1239 * Local packs tend to contain objects specific to our
1240 * variant of the project than remote ones. In addition,
1241 * remote ones could be on a network mounted filesystem.
1242 * Favor local ones for these reasons.
1244 st = a->pack_local - b->pack_local;
1245 if (st)
1246 return -st;
1249 * Younger packs tend to contain more recent objects,
1250 * and more recent objects tend to get accessed more
1251 * often.
1253 if (a->mtime < b->mtime)
1254 return 1;
1255 else if (a->mtime == b->mtime)
1256 return 0;
1257 return -1;
1260 static void rearrange_packed_git(void)
1262 struct packed_git **ary, *p;
1263 int i, n;
1265 for (n = 0, p = packed_git; p; p = p->next)
1266 n++;
1267 if (n < 2)
1268 return;
1270 /* prepare an array of packed_git for easier sorting */
1271 ary = xcalloc(n, sizeof(struct packed_git *));
1272 for (n = 0, p = packed_git; p; p = p->next)
1273 ary[n++] = p;
1275 qsort(ary, n, sizeof(struct packed_git *), sort_pack);
1277 /* link them back again */
1278 for (i = 0; i < n - 1; i++)
1279 ary[i]->next = ary[i + 1];
1280 ary[n - 1]->next = NULL;
1281 packed_git = ary[0];
1283 free(ary);
1286 static int prepare_packed_git_run_once = 0;
1287 void prepare_packed_git(void)
1289 struct alternate_object_database *alt;
1291 if (prepare_packed_git_run_once)
1292 return;
1293 prepare_packed_git_one(get_object_directory(), 1);
1294 prepare_alt_odb();
1295 for (alt = alt_odb_list; alt; alt = alt->next) {
1296 alt->name[-1] = 0;
1297 prepare_packed_git_one(alt->base, 0);
1298 alt->name[-1] = '/';
1300 rearrange_packed_git();
1301 prepare_packed_git_run_once = 1;
1304 void reprepare_packed_git(void)
1306 discard_revindex();
1307 prepare_packed_git_run_once = 0;
1308 prepare_packed_git();
1311 static void mark_bad_packed_object(struct packed_git *p,
1312 const unsigned char *sha1)
1314 unsigned i;
1315 for (i = 0; i < p->num_bad_objects; i++)
1316 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1317 return;
1318 p->bad_object_sha1 = xrealloc(p->bad_object_sha1, 20 * (p->num_bad_objects + 1));
1319 hashcpy(p->bad_object_sha1 + 20 * p->num_bad_objects, sha1);
1320 p->num_bad_objects++;
1323 static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1325 struct packed_git *p;
1326 unsigned i;
1328 for (p = packed_git; p; p = p->next)
1329 for (i = 0; i < p->num_bad_objects; i++)
1330 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1331 return p;
1332 return NULL;
1336 * With an in-core object data in "map", rehash it to make sure the
1337 * object name actually matches "sha1" to detect object corruption.
1338 * With "map" == NULL, try reading the object named with "sha1" using
1339 * the streaming interface and rehash it to do the same.
1341 int check_sha1_signature(const unsigned char *sha1, void *map,
1342 unsigned long size, const char *type)
1344 unsigned char real_sha1[20];
1345 enum object_type obj_type;
1346 struct git_istream *st;
1347 git_SHA_CTX c;
1348 char hdr[32];
1349 int hdrlen;
1351 if (map) {
1352 hash_sha1_file(map, size, type, real_sha1);
1353 return hashcmp(sha1, real_sha1) ? -1 : 0;
1356 st = open_istream(sha1, &obj_type, &size, NULL);
1357 if (!st)
1358 return -1;
1360 /* Generate the header */
1361 hdrlen = sprintf(hdr, "%s %lu", typename(obj_type), size) + 1;
1363 /* Sha1.. */
1364 git_SHA1_Init(&c);
1365 git_SHA1_Update(&c, hdr, hdrlen);
1366 for (;;) {
1367 char buf[1024 * 16];
1368 ssize_t readlen = read_istream(st, buf, sizeof(buf));
1370 if (readlen < 0) {
1371 close_istream(st);
1372 return -1;
1374 if (!readlen)
1375 break;
1376 git_SHA1_Update(&c, buf, readlen);
1378 git_SHA1_Final(real_sha1, &c);
1379 close_istream(st);
1380 return hashcmp(sha1, real_sha1) ? -1 : 0;
1383 static int git_open_noatime(const char *name)
1385 static int sha1_file_open_flag = O_NOATIME;
1387 for (;;) {
1388 int fd = open(name, O_RDONLY | sha1_file_open_flag);
1389 if (fd >= 0)
1390 return fd;
1392 /* Might the failure be due to O_NOATIME? */
1393 if (errno != ENOENT && sha1_file_open_flag) {
1394 sha1_file_open_flag = 0;
1395 continue;
1398 return -1;
1402 static int stat_sha1_file(const unsigned char *sha1, struct stat *st)
1404 char *name = sha1_file_name(sha1);
1405 struct alternate_object_database *alt;
1407 if (!lstat(name, st))
1408 return 0;
1410 prepare_alt_odb();
1411 errno = ENOENT;
1412 for (alt = alt_odb_list; alt; alt = alt->next) {
1413 name = alt->name;
1414 fill_sha1_path(name, sha1);
1415 if (!lstat(alt->base, st))
1416 return 0;
1419 return -1;
1422 static int open_sha1_file(const unsigned char *sha1)
1424 int fd;
1425 char *name = sha1_file_name(sha1);
1426 struct alternate_object_database *alt;
1428 fd = git_open_noatime(name);
1429 if (fd >= 0)
1430 return fd;
1432 prepare_alt_odb();
1433 errno = ENOENT;
1434 for (alt = alt_odb_list; alt; alt = alt->next) {
1435 name = alt->name;
1436 fill_sha1_path(name, sha1);
1437 fd = git_open_noatime(alt->base);
1438 if (fd >= 0)
1439 return fd;
1441 return -1;
1444 void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1446 void *map;
1447 int fd;
1449 fd = open_sha1_file(sha1);
1450 map = NULL;
1451 if (fd >= 0) {
1452 struct stat st;
1454 if (!fstat(fd, &st)) {
1455 *size = xsize_t(st.st_size);
1456 if (!*size) {
1457 /* mmap() is forbidden on empty files */
1458 error("object file %s is empty", sha1_file_name(sha1));
1459 return NULL;
1461 map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1463 close(fd);
1465 return map;
1468 unsigned long unpack_object_header_buffer(const unsigned char *buf,
1469 unsigned long len, enum object_type *type, unsigned long *sizep)
1471 unsigned shift;
1472 unsigned long size, c;
1473 unsigned long used = 0;
1475 c = buf[used++];
1476 *type = (c >> 4) & 7;
1477 size = c & 15;
1478 shift = 4;
1479 while (c & 0x80) {
1480 if (len <= used || bitsizeof(long) <= shift) {
1481 error("bad object header");
1482 size = used = 0;
1483 break;
1485 c = buf[used++];
1486 size += (c & 0x7f) << shift;
1487 shift += 7;
1489 *sizep = size;
1490 return used;
1493 int unpack_sha1_header(git_zstream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
1495 /* Get the data stream */
1496 memset(stream, 0, sizeof(*stream));
1497 stream->next_in = map;
1498 stream->avail_in = mapsize;
1499 stream->next_out = buffer;
1500 stream->avail_out = bufsiz;
1502 git_inflate_init(stream);
1503 return git_inflate(stream, 0);
1506 static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1508 int bytes = strlen(buffer) + 1;
1509 unsigned char *buf = xmallocz(size);
1510 unsigned long n;
1511 int status = Z_OK;
1513 n = stream->total_out - bytes;
1514 if (n > size)
1515 n = size;
1516 memcpy(buf, (char *) buffer + bytes, n);
1517 bytes = n;
1518 if (bytes <= size) {
1520 * The above condition must be (bytes <= size), not
1521 * (bytes < size). In other words, even though we
1522 * expect no more output and set avail_out to zero,
1523 * the input zlib stream may have bytes that express
1524 * "this concludes the stream", and we *do* want to
1525 * eat that input.
1527 * Otherwise we would not be able to test that we
1528 * consumed all the input to reach the expected size;
1529 * we also want to check that zlib tells us that all
1530 * went well with status == Z_STREAM_END at the end.
1532 stream->next_out = buf + bytes;
1533 stream->avail_out = size - bytes;
1534 while (status == Z_OK)
1535 status = git_inflate(stream, Z_FINISH);
1537 if (status == Z_STREAM_END && !stream->avail_in) {
1538 git_inflate_end(stream);
1539 return buf;
1542 if (status < 0)
1543 error("corrupt loose object '%s'", sha1_to_hex(sha1));
1544 else if (stream->avail_in)
1545 error("garbage at end of loose object '%s'",
1546 sha1_to_hex(sha1));
1547 free(buf);
1548 return NULL;
1552 * We used to just use "sscanf()", but that's actually way
1553 * too permissive for what we want to check. So do an anal
1554 * object header parse by hand.
1556 int parse_sha1_header(const char *hdr, unsigned long *sizep)
1558 char type[10];
1559 int i;
1560 unsigned long size;
1563 * The type can be at most ten bytes (including the
1564 * terminating '\0' that we add), and is followed by
1565 * a space.
1567 i = 0;
1568 for (;;) {
1569 char c = *hdr++;
1570 if (c == ' ')
1571 break;
1572 type[i++] = c;
1573 if (i >= sizeof(type))
1574 return -1;
1576 type[i] = 0;
1579 * The length must follow immediately, and be in canonical
1580 * decimal format (ie "010" is not valid).
1582 size = *hdr++ - '0';
1583 if (size > 9)
1584 return -1;
1585 if (size) {
1586 for (;;) {
1587 unsigned long c = *hdr - '0';
1588 if (c > 9)
1589 break;
1590 hdr++;
1591 size = size * 10 + c;
1594 *sizep = size;
1597 * The length must be followed by a zero byte
1599 return *hdr ? -1 : type_from_string(type);
1602 static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1604 int ret;
1605 git_zstream stream;
1606 char hdr[8192];
1608 ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1609 if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1610 return NULL;
1612 return unpack_sha1_rest(&stream, hdr, *size, sha1);
1615 unsigned long get_size_from_delta(struct packed_git *p,
1616 struct pack_window **w_curs,
1617 off_t curpos)
1619 const unsigned char *data;
1620 unsigned char delta_head[20], *in;
1621 git_zstream stream;
1622 int st;
1624 memset(&stream, 0, sizeof(stream));
1625 stream.next_out = delta_head;
1626 stream.avail_out = sizeof(delta_head);
1628 git_inflate_init(&stream);
1629 do {
1630 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1631 stream.next_in = in;
1632 st = git_inflate(&stream, Z_FINISH);
1633 curpos += stream.next_in - in;
1634 } while ((st == Z_OK || st == Z_BUF_ERROR) &&
1635 stream.total_out < sizeof(delta_head));
1636 git_inflate_end(&stream);
1637 if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
1638 error("delta data unpack-initial failed");
1639 return 0;
1642 /* Examine the initial part of the delta to figure out
1643 * the result size.
1645 data = delta_head;
1647 /* ignore base size */
1648 get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1650 /* Read the result size */
1651 return get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1654 static off_t get_delta_base(struct packed_git *p,
1655 struct pack_window **w_curs,
1656 off_t *curpos,
1657 enum object_type type,
1658 off_t delta_obj_offset)
1660 unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1661 off_t base_offset;
1663 /* use_pack() assured us we have [base_info, base_info + 20)
1664 * as a range that we can look at without walking off the
1665 * end of the mapped window. Its actually the hash size
1666 * that is assured. An OFS_DELTA longer than the hash size
1667 * is stupid, as then a REF_DELTA would be smaller to store.
1669 if (type == OBJ_OFS_DELTA) {
1670 unsigned used = 0;
1671 unsigned char c = base_info[used++];
1672 base_offset = c & 127;
1673 while (c & 128) {
1674 base_offset += 1;
1675 if (!base_offset || MSB(base_offset, 7))
1676 return 0; /* overflow */
1677 c = base_info[used++];
1678 base_offset = (base_offset << 7) + (c & 127);
1680 base_offset = delta_obj_offset - base_offset;
1681 if (base_offset <= 0 || base_offset >= delta_obj_offset)
1682 return 0; /* out of bound */
1683 *curpos += used;
1684 } else if (type == OBJ_REF_DELTA) {
1685 /* The base entry _must_ be in the same pack */
1686 base_offset = find_pack_entry_one(base_info, p);
1687 *curpos += 20;
1688 } else
1689 die("I am totally screwed");
1690 return base_offset;
1694 * Like get_delta_base above, but we return the sha1 instead of the pack
1695 * offset. This means it is cheaper for REF deltas (we do not have to do
1696 * the final object lookup), but more expensive for OFS deltas (we
1697 * have to load the revidx to convert the offset back into a sha1).
1699 static const unsigned char *get_delta_base_sha1(struct packed_git *p,
1700 struct pack_window **w_curs,
1701 off_t curpos,
1702 enum object_type type,
1703 off_t delta_obj_offset)
1705 if (type == OBJ_REF_DELTA) {
1706 unsigned char *base = use_pack(p, w_curs, curpos, NULL);
1707 return base;
1708 } else if (type == OBJ_OFS_DELTA) {
1709 struct revindex_entry *revidx;
1710 off_t base_offset = get_delta_base(p, w_curs, &curpos,
1711 type, delta_obj_offset);
1713 if (!base_offset)
1714 return NULL;
1716 revidx = find_pack_revindex(p, base_offset);
1717 if (!revidx)
1718 return NULL;
1720 return nth_packed_object_sha1(p, revidx->nr);
1721 } else
1722 return NULL;
1725 int unpack_object_header(struct packed_git *p,
1726 struct pack_window **w_curs,
1727 off_t *curpos,
1728 unsigned long *sizep)
1730 unsigned char *base;
1731 unsigned long left;
1732 unsigned long used;
1733 enum object_type type;
1735 /* use_pack() assures us we have [base, base + 20) available
1736 * as a range that we can look at. (Its actually the hash
1737 * size that is assured.) With our object header encoding
1738 * the maximum deflated object size is 2^137, which is just
1739 * insane, so we know won't exceed what we have been given.
1741 base = use_pack(p, w_curs, *curpos, &left);
1742 used = unpack_object_header_buffer(base, left, &type, sizep);
1743 if (!used) {
1744 type = OBJ_BAD;
1745 } else
1746 *curpos += used;
1748 return type;
1751 static int retry_bad_packed_offset(struct packed_git *p, off_t obj_offset)
1753 int type;
1754 struct revindex_entry *revidx;
1755 const unsigned char *sha1;
1756 revidx = find_pack_revindex(p, obj_offset);
1757 if (!revidx)
1758 return OBJ_BAD;
1759 sha1 = nth_packed_object_sha1(p, revidx->nr);
1760 mark_bad_packed_object(p, sha1);
1761 type = sha1_object_info(sha1, NULL);
1762 if (type <= OBJ_NONE)
1763 return OBJ_BAD;
1764 return type;
1767 #define POI_STACK_PREALLOC 64
1769 static enum object_type packed_to_object_type(struct packed_git *p,
1770 off_t obj_offset,
1771 enum object_type type,
1772 struct pack_window **w_curs,
1773 off_t curpos)
1775 off_t small_poi_stack[POI_STACK_PREALLOC];
1776 off_t *poi_stack = small_poi_stack;
1777 int poi_stack_nr = 0, poi_stack_alloc = POI_STACK_PREALLOC;
1779 while (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1780 off_t base_offset;
1781 unsigned long size;
1782 /* Push the object we're going to leave behind */
1783 if (poi_stack_nr >= poi_stack_alloc && poi_stack == small_poi_stack) {
1784 poi_stack_alloc = alloc_nr(poi_stack_nr);
1785 poi_stack = xmalloc(sizeof(off_t)*poi_stack_alloc);
1786 memcpy(poi_stack, small_poi_stack, sizeof(off_t)*poi_stack_nr);
1787 } else {
1788 ALLOC_GROW(poi_stack, poi_stack_nr+1, poi_stack_alloc);
1790 poi_stack[poi_stack_nr++] = obj_offset;
1791 /* If parsing the base offset fails, just unwind */
1792 base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1793 if (!base_offset)
1794 goto unwind;
1795 curpos = obj_offset = base_offset;
1796 type = unpack_object_header(p, w_curs, &curpos, &size);
1797 if (type <= OBJ_NONE) {
1798 /* If getting the base itself fails, we first
1799 * retry the base, otherwise unwind */
1800 type = retry_bad_packed_offset(p, base_offset);
1801 if (type > OBJ_NONE)
1802 goto out;
1803 goto unwind;
1807 switch (type) {
1808 case OBJ_BAD:
1809 case OBJ_COMMIT:
1810 case OBJ_TREE:
1811 case OBJ_BLOB:
1812 case OBJ_TAG:
1813 break;
1814 default:
1815 error("unknown object type %i at offset %"PRIuMAX" in %s",
1816 type, (uintmax_t)obj_offset, p->pack_name);
1817 type = OBJ_BAD;
1820 out:
1821 if (poi_stack != small_poi_stack)
1822 free(poi_stack);
1823 return type;
1825 unwind:
1826 while (poi_stack_nr) {
1827 obj_offset = poi_stack[--poi_stack_nr];
1828 type = retry_bad_packed_offset(p, obj_offset);
1829 if (type > OBJ_NONE)
1830 goto out;
1832 type = OBJ_BAD;
1833 goto out;
1836 static int packed_object_info(struct packed_git *p, off_t obj_offset,
1837 struct object_info *oi)
1839 struct pack_window *w_curs = NULL;
1840 unsigned long size;
1841 off_t curpos = obj_offset;
1842 enum object_type type;
1845 * We always get the representation type, but only convert it to
1846 * a "real" type later if the caller is interested.
1848 type = unpack_object_header(p, &w_curs, &curpos, &size);
1850 if (oi->sizep) {
1851 if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1852 off_t tmp_pos = curpos;
1853 off_t base_offset = get_delta_base(p, &w_curs, &tmp_pos,
1854 type, obj_offset);
1855 if (!base_offset) {
1856 type = OBJ_BAD;
1857 goto out;
1859 *oi->sizep = get_size_from_delta(p, &w_curs, tmp_pos);
1860 if (*oi->sizep == 0) {
1861 type = OBJ_BAD;
1862 goto out;
1864 } else {
1865 *oi->sizep = size;
1869 if (oi->disk_sizep) {
1870 struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
1871 *oi->disk_sizep = revidx[1].offset - obj_offset;
1874 if (oi->typep) {
1875 *oi->typep = packed_to_object_type(p, obj_offset, type, &w_curs, curpos);
1876 if (*oi->typep < 0) {
1877 type = OBJ_BAD;
1878 goto out;
1882 if (oi->delta_base_sha1) {
1883 if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
1884 const unsigned char *base;
1886 base = get_delta_base_sha1(p, &w_curs, curpos,
1887 type, obj_offset);
1888 if (!base) {
1889 type = OBJ_BAD;
1890 goto out;
1893 hashcpy(oi->delta_base_sha1, base);
1894 } else
1895 hashclr(oi->delta_base_sha1);
1898 out:
1899 unuse_pack(&w_curs);
1900 return type;
1903 static void *unpack_compressed_entry(struct packed_git *p,
1904 struct pack_window **w_curs,
1905 off_t curpos,
1906 unsigned long size)
1908 int st;
1909 git_zstream stream;
1910 unsigned char *buffer, *in;
1912 buffer = xmallocz(size);
1913 memset(&stream, 0, sizeof(stream));
1914 stream.next_out = buffer;
1915 stream.avail_out = size + 1;
1917 git_inflate_init(&stream);
1918 do {
1919 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1920 stream.next_in = in;
1921 st = git_inflate(&stream, Z_FINISH);
1922 if (!stream.avail_out)
1923 break; /* the payload is larger than it should be */
1924 curpos += stream.next_in - in;
1925 } while (st == Z_OK || st == Z_BUF_ERROR);
1926 git_inflate_end(&stream);
1927 if ((st != Z_STREAM_END) || stream.total_out != size) {
1928 free(buffer);
1929 return NULL;
1932 return buffer;
1935 #define MAX_DELTA_CACHE (256)
1937 static size_t delta_base_cached;
1939 static struct delta_base_cache_lru_list {
1940 struct delta_base_cache_lru_list *prev;
1941 struct delta_base_cache_lru_list *next;
1942 } delta_base_cache_lru = { &delta_base_cache_lru, &delta_base_cache_lru };
1944 static struct delta_base_cache_entry {
1945 struct delta_base_cache_lru_list lru;
1946 void *data;
1947 struct packed_git *p;
1948 off_t base_offset;
1949 unsigned long size;
1950 enum object_type type;
1951 } delta_base_cache[MAX_DELTA_CACHE];
1953 static unsigned long pack_entry_hash(struct packed_git *p, off_t base_offset)
1955 unsigned long hash;
1957 hash = (unsigned long)p + (unsigned long)base_offset;
1958 hash += (hash >> 8) + (hash >> 16);
1959 return hash % MAX_DELTA_CACHE;
1962 static struct delta_base_cache_entry *
1963 get_delta_base_cache_entry(struct packed_git *p, off_t base_offset)
1965 unsigned long hash = pack_entry_hash(p, base_offset);
1966 return delta_base_cache + hash;
1969 static int eq_delta_base_cache_entry(struct delta_base_cache_entry *ent,
1970 struct packed_git *p, off_t base_offset)
1972 return (ent->data && ent->p == p && ent->base_offset == base_offset);
1975 static int in_delta_base_cache(struct packed_git *p, off_t base_offset)
1977 struct delta_base_cache_entry *ent;
1978 ent = get_delta_base_cache_entry(p, base_offset);
1979 return eq_delta_base_cache_entry(ent, p, base_offset);
1982 static void clear_delta_base_cache_entry(struct delta_base_cache_entry *ent)
1984 ent->data = NULL;
1985 ent->lru.next->prev = ent->lru.prev;
1986 ent->lru.prev->next = ent->lru.next;
1987 delta_base_cached -= ent->size;
1990 static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
1991 unsigned long *base_size, enum object_type *type, int keep_cache)
1993 struct delta_base_cache_entry *ent;
1994 void *ret;
1996 ent = get_delta_base_cache_entry(p, base_offset);
1998 if (!eq_delta_base_cache_entry(ent, p, base_offset))
1999 return unpack_entry(p, base_offset, type, base_size);
2001 ret = ent->data;
2003 if (!keep_cache)
2004 clear_delta_base_cache_entry(ent);
2005 else
2006 ret = xmemdupz(ent->data, ent->size);
2007 *type = ent->type;
2008 *base_size = ent->size;
2009 return ret;
2012 static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
2014 if (ent->data) {
2015 free(ent->data);
2016 ent->data = NULL;
2017 ent->lru.next->prev = ent->lru.prev;
2018 ent->lru.prev->next = ent->lru.next;
2019 delta_base_cached -= ent->size;
2023 void clear_delta_base_cache(void)
2025 unsigned long p;
2026 for (p = 0; p < MAX_DELTA_CACHE; p++)
2027 release_delta_base_cache(&delta_base_cache[p]);
2030 static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
2031 void *base, unsigned long base_size, enum object_type type)
2033 unsigned long hash = pack_entry_hash(p, base_offset);
2034 struct delta_base_cache_entry *ent = delta_base_cache + hash;
2035 struct delta_base_cache_lru_list *lru;
2037 release_delta_base_cache(ent);
2038 delta_base_cached += base_size;
2040 for (lru = delta_base_cache_lru.next;
2041 delta_base_cached > delta_base_cache_limit
2042 && lru != &delta_base_cache_lru;
2043 lru = lru->next) {
2044 struct delta_base_cache_entry *f = (void *)lru;
2045 if (f->type == OBJ_BLOB)
2046 release_delta_base_cache(f);
2048 for (lru = delta_base_cache_lru.next;
2049 delta_base_cached > delta_base_cache_limit
2050 && lru != &delta_base_cache_lru;
2051 lru = lru->next) {
2052 struct delta_base_cache_entry *f = (void *)lru;
2053 release_delta_base_cache(f);
2056 ent->p = p;
2057 ent->base_offset = base_offset;
2058 ent->type = type;
2059 ent->data = base;
2060 ent->size = base_size;
2061 ent->lru.next = &delta_base_cache_lru;
2062 ent->lru.prev = delta_base_cache_lru.prev;
2063 delta_base_cache_lru.prev->next = &ent->lru;
2064 delta_base_cache_lru.prev = &ent->lru;
2067 static void *read_object(const unsigned char *sha1, enum object_type *type,
2068 unsigned long *size);
2070 static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
2072 static FILE *log_file;
2074 if (!log_pack_access)
2075 log_pack_access = getenv("GIT_TRACE_PACK_ACCESS");
2076 if (!log_pack_access)
2077 log_pack_access = no_log_pack_access;
2078 if (log_pack_access == no_log_pack_access)
2079 return;
2081 if (!log_file) {
2082 log_file = fopen(log_pack_access, "w");
2083 if (!log_file) {
2084 error("cannot open pack access log '%s' for writing: %s",
2085 log_pack_access, strerror(errno));
2086 log_pack_access = no_log_pack_access;
2087 return;
2090 fprintf(log_file, "%s %"PRIuMAX"\n",
2091 p->pack_name, (uintmax_t)obj_offset);
2092 fflush(log_file);
2095 int do_check_packed_object_crc;
2097 #define UNPACK_ENTRY_STACK_PREALLOC 64
2098 struct unpack_entry_stack_ent {
2099 off_t obj_offset;
2100 off_t curpos;
2101 unsigned long size;
2104 void *unpack_entry(struct packed_git *p, off_t obj_offset,
2105 enum object_type *final_type, unsigned long *final_size)
2107 struct pack_window *w_curs = NULL;
2108 off_t curpos = obj_offset;
2109 void *data = NULL;
2110 unsigned long size;
2111 enum object_type type;
2112 struct unpack_entry_stack_ent small_delta_stack[UNPACK_ENTRY_STACK_PREALLOC];
2113 struct unpack_entry_stack_ent *delta_stack = small_delta_stack;
2114 int delta_stack_nr = 0, delta_stack_alloc = UNPACK_ENTRY_STACK_PREALLOC;
2115 int base_from_cache = 0;
2117 if (log_pack_access != no_log_pack_access)
2118 write_pack_access_log(p, obj_offset);
2120 /* PHASE 1: drill down to the innermost base object */
2121 for (;;) {
2122 off_t base_offset;
2123 int i;
2124 struct delta_base_cache_entry *ent;
2126 ent = get_delta_base_cache_entry(p, curpos);
2127 if (eq_delta_base_cache_entry(ent, p, curpos)) {
2128 type = ent->type;
2129 data = ent->data;
2130 size = ent->size;
2131 clear_delta_base_cache_entry(ent);
2132 base_from_cache = 1;
2133 break;
2136 if (do_check_packed_object_crc && p->index_version > 1) {
2137 struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2138 unsigned long len = revidx[1].offset - obj_offset;
2139 if (check_pack_crc(p, &w_curs, obj_offset, len, revidx->nr)) {
2140 const unsigned char *sha1 =
2141 nth_packed_object_sha1(p, revidx->nr);
2142 error("bad packed object CRC for %s",
2143 sha1_to_hex(sha1));
2144 mark_bad_packed_object(p, sha1);
2145 unuse_pack(&w_curs);
2146 return NULL;
2150 type = unpack_object_header(p, &w_curs, &curpos, &size);
2151 if (type != OBJ_OFS_DELTA && type != OBJ_REF_DELTA)
2152 break;
2154 base_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
2155 if (!base_offset) {
2156 error("failed to validate delta base reference "
2157 "at offset %"PRIuMAX" from %s",
2158 (uintmax_t)curpos, p->pack_name);
2159 /* bail to phase 2, in hopes of recovery */
2160 data = NULL;
2161 break;
2164 /* push object, proceed to base */
2165 if (delta_stack_nr >= delta_stack_alloc
2166 && delta_stack == small_delta_stack) {
2167 delta_stack_alloc = alloc_nr(delta_stack_nr);
2168 delta_stack = xmalloc(sizeof(*delta_stack)*delta_stack_alloc);
2169 memcpy(delta_stack, small_delta_stack,
2170 sizeof(*delta_stack)*delta_stack_nr);
2171 } else {
2172 ALLOC_GROW(delta_stack, delta_stack_nr+1, delta_stack_alloc);
2174 i = delta_stack_nr++;
2175 delta_stack[i].obj_offset = obj_offset;
2176 delta_stack[i].curpos = curpos;
2177 delta_stack[i].size = size;
2179 curpos = obj_offset = base_offset;
2182 /* PHASE 2: handle the base */
2183 switch (type) {
2184 case OBJ_OFS_DELTA:
2185 case OBJ_REF_DELTA:
2186 if (data)
2187 die("BUG in unpack_entry: left loop at a valid delta");
2188 break;
2189 case OBJ_COMMIT:
2190 case OBJ_TREE:
2191 case OBJ_BLOB:
2192 case OBJ_TAG:
2193 if (!base_from_cache)
2194 data = unpack_compressed_entry(p, &w_curs, curpos, size);
2195 break;
2196 default:
2197 data = NULL;
2198 error("unknown object type %i at offset %"PRIuMAX" in %s",
2199 type, (uintmax_t)obj_offset, p->pack_name);
2202 /* PHASE 3: apply deltas in order */
2204 /* invariants:
2205 * 'data' holds the base data, or NULL if there was corruption
2207 while (delta_stack_nr) {
2208 void *delta_data;
2209 void *base = data;
2210 unsigned long delta_size, base_size = size;
2211 int i;
2213 data = NULL;
2215 if (base)
2216 add_delta_base_cache(p, obj_offset, base, base_size, type);
2218 if (!base) {
2220 * We're probably in deep shit, but let's try to fetch
2221 * the required base anyway from another pack or loose.
2222 * This is costly but should happen only in the presence
2223 * of a corrupted pack, and is better than failing outright.
2225 struct revindex_entry *revidx;
2226 const unsigned char *base_sha1;
2227 revidx = find_pack_revindex(p, obj_offset);
2228 if (revidx) {
2229 base_sha1 = nth_packed_object_sha1(p, revidx->nr);
2230 error("failed to read delta base object %s"
2231 " at offset %"PRIuMAX" from %s",
2232 sha1_to_hex(base_sha1), (uintmax_t)obj_offset,
2233 p->pack_name);
2234 mark_bad_packed_object(p, base_sha1);
2235 base = read_object(base_sha1, &type, &base_size);
2239 i = --delta_stack_nr;
2240 obj_offset = delta_stack[i].obj_offset;
2241 curpos = delta_stack[i].curpos;
2242 delta_size = delta_stack[i].size;
2244 if (!base)
2245 continue;
2247 delta_data = unpack_compressed_entry(p, &w_curs, curpos, delta_size);
2249 if (!delta_data) {
2250 error("failed to unpack compressed delta "
2251 "at offset %"PRIuMAX" from %s",
2252 (uintmax_t)curpos, p->pack_name);
2253 data = NULL;
2254 continue;
2257 data = patch_delta(base, base_size,
2258 delta_data, delta_size,
2259 &size);
2262 * We could not apply the delta; warn the user, but keep going.
2263 * Our failure will be noticed either in the next iteration of
2264 * the loop, or if this is the final delta, in the caller when
2265 * we return NULL. Those code paths will take care of making
2266 * a more explicit warning and retrying with another copy of
2267 * the object.
2269 if (!data)
2270 error("failed to apply delta");
2272 free(delta_data);
2275 *final_type = type;
2276 *final_size = size;
2278 unuse_pack(&w_curs);
2279 return data;
2282 const unsigned char *nth_packed_object_sha1(struct packed_git *p,
2283 uint32_t n)
2285 const unsigned char *index = p->index_data;
2286 if (!index) {
2287 if (open_pack_index(p))
2288 return NULL;
2289 index = p->index_data;
2291 if (n >= p->num_objects)
2292 return NULL;
2293 index += 4 * 256;
2294 if (p->index_version == 1) {
2295 return index + 24 * n + 4;
2296 } else {
2297 index += 8;
2298 return index + 20 * n;
2302 off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
2304 const unsigned char *index = p->index_data;
2305 index += 4 * 256;
2306 if (p->index_version == 1) {
2307 return ntohl(*((uint32_t *)(index + 24 * n)));
2308 } else {
2309 uint32_t off;
2310 index += 8 + p->num_objects * (20 + 4);
2311 off = ntohl(*((uint32_t *)(index + 4 * n)));
2312 if (!(off & 0x80000000))
2313 return off;
2314 index += p->num_objects * 4 + (off & 0x7fffffff) * 8;
2315 return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
2316 ntohl(*((uint32_t *)(index + 4)));
2320 off_t find_pack_entry_one(const unsigned char *sha1,
2321 struct packed_git *p)
2323 const uint32_t *level1_ofs = p->index_data;
2324 const unsigned char *index = p->index_data;
2325 unsigned hi, lo, stride;
2326 static int use_lookup = -1;
2327 static int debug_lookup = -1;
2329 if (debug_lookup < 0)
2330 debug_lookup = !!getenv("GIT_DEBUG_LOOKUP");
2332 if (!index) {
2333 if (open_pack_index(p))
2334 return 0;
2335 level1_ofs = p->index_data;
2336 index = p->index_data;
2338 if (p->index_version > 1) {
2339 level1_ofs += 2;
2340 index += 8;
2342 index += 4 * 256;
2343 hi = ntohl(level1_ofs[*sha1]);
2344 lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
2345 if (p->index_version > 1) {
2346 stride = 20;
2347 } else {
2348 stride = 24;
2349 index += 4;
2352 if (debug_lookup)
2353 printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
2354 sha1[0], sha1[1], sha1[2], lo, hi, p->num_objects);
2356 if (use_lookup < 0)
2357 use_lookup = !!getenv("GIT_USE_LOOKUP");
2358 if (use_lookup) {
2359 int pos = sha1_entry_pos(index, stride, 0,
2360 lo, hi, p->num_objects, sha1);
2361 if (pos < 0)
2362 return 0;
2363 return nth_packed_object_offset(p, pos);
2366 do {
2367 unsigned mi = (lo + hi) / 2;
2368 int cmp = hashcmp(index + mi * stride, sha1);
2370 if (debug_lookup)
2371 printf("lo %u hi %u rg %u mi %u\n",
2372 lo, hi, hi - lo, mi);
2373 if (!cmp)
2374 return nth_packed_object_offset(p, mi);
2375 if (cmp > 0)
2376 hi = mi;
2377 else
2378 lo = mi+1;
2379 } while (lo < hi);
2380 return 0;
2383 int is_pack_valid(struct packed_git *p)
2385 /* An already open pack is known to be valid. */
2386 if (p->pack_fd != -1)
2387 return 1;
2389 /* If the pack has one window completely covering the
2390 * file size, the pack is known to be valid even if
2391 * the descriptor is not currently open.
2393 if (p->windows) {
2394 struct pack_window *w = p->windows;
2396 if (!w->offset && w->len == p->pack_size)
2397 return 1;
2400 /* Force the pack to open to prove its valid. */
2401 return !open_packed_git(p);
2404 static int fill_pack_entry(const unsigned char *sha1,
2405 struct pack_entry *e,
2406 struct packed_git *p)
2408 off_t offset;
2410 if (p->num_bad_objects) {
2411 unsigned i;
2412 for (i = 0; i < p->num_bad_objects; i++)
2413 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
2414 return 0;
2417 offset = find_pack_entry_one(sha1, p);
2418 if (!offset)
2419 return 0;
2422 * We are about to tell the caller where they can locate the
2423 * requested object. We better make sure the packfile is
2424 * still here and can be accessed before supplying that
2425 * answer, as it may have been deleted since the index was
2426 * loaded!
2428 if (!is_pack_valid(p)) {
2429 warning("packfile %s cannot be accessed", p->pack_name);
2430 return 0;
2432 e->offset = offset;
2433 e->p = p;
2434 hashcpy(e->sha1, sha1);
2435 return 1;
2438 static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e)
2440 struct packed_git *p;
2442 prepare_packed_git();
2443 if (!packed_git)
2444 return 0;
2446 if (last_found_pack && fill_pack_entry(sha1, e, last_found_pack))
2447 return 1;
2449 for (p = packed_git; p; p = p->next) {
2450 if (p == last_found_pack || !fill_pack_entry(sha1, e, p))
2451 continue;
2453 last_found_pack = p;
2454 return 1;
2456 return 0;
2459 struct packed_git *find_sha1_pack(const unsigned char *sha1,
2460 struct packed_git *packs)
2462 struct packed_git *p;
2464 for (p = packs; p; p = p->next) {
2465 if (find_pack_entry_one(sha1, p))
2466 return p;
2468 return NULL;
2472 static int sha1_loose_object_info(const unsigned char *sha1,
2473 struct object_info *oi)
2475 int status;
2476 unsigned long mapsize, size;
2477 void *map;
2478 git_zstream stream;
2479 char hdr[32];
2481 if (oi->delta_base_sha1)
2482 hashclr(oi->delta_base_sha1);
2485 * If we don't care about type or size, then we don't
2486 * need to look inside the object at all. Note that we
2487 * do not optimize out the stat call, even if the
2488 * caller doesn't care about the disk-size, since our
2489 * return value implicitly indicates whether the
2490 * object even exists.
2492 if (!oi->typep && !oi->sizep) {
2493 struct stat st;
2494 if (stat_sha1_file(sha1, &st) < 0)
2495 return -1;
2496 if (oi->disk_sizep)
2497 *oi->disk_sizep = st.st_size;
2498 return 0;
2501 map = map_sha1_file(sha1, &mapsize);
2502 if (!map)
2503 return -1;
2504 if (oi->disk_sizep)
2505 *oi->disk_sizep = mapsize;
2506 if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
2507 status = error("unable to unpack %s header",
2508 sha1_to_hex(sha1));
2509 else if ((status = parse_sha1_header(hdr, &size)) < 0)
2510 status = error("unable to parse %s header", sha1_to_hex(sha1));
2511 else if (oi->sizep)
2512 *oi->sizep = size;
2513 git_inflate_end(&stream);
2514 munmap(map, mapsize);
2515 if (oi->typep)
2516 *oi->typep = status;
2517 return 0;
2520 int sha1_object_info_extended(const unsigned char *sha1, struct object_info *oi, unsigned flags)
2522 struct cached_object *co;
2523 struct pack_entry e;
2524 int rtype;
2525 const unsigned char *real = lookup_replace_object_extended(sha1, flags);
2527 co = find_cached_object(real);
2528 if (co) {
2529 if (oi->typep)
2530 *(oi->typep) = co->type;
2531 if (oi->sizep)
2532 *(oi->sizep) = co->size;
2533 if (oi->disk_sizep)
2534 *(oi->disk_sizep) = 0;
2535 if (oi->delta_base_sha1)
2536 hashclr(oi->delta_base_sha1);
2537 oi->whence = OI_CACHED;
2538 return 0;
2541 if (!find_pack_entry(real, &e)) {
2542 /* Most likely it's a loose object. */
2543 if (!sha1_loose_object_info(real, oi)) {
2544 oi->whence = OI_LOOSE;
2545 return 0;
2548 /* Not a loose object; someone else may have just packed it. */
2549 reprepare_packed_git();
2550 if (!find_pack_entry(real, &e))
2551 return -1;
2554 rtype = packed_object_info(e.p, e.offset, oi);
2555 if (rtype < 0) {
2556 mark_bad_packed_object(e.p, real);
2557 return sha1_object_info_extended(real, oi, 0);
2558 } else if (in_delta_base_cache(e.p, e.offset)) {
2559 oi->whence = OI_DBCACHED;
2560 } else {
2561 oi->whence = OI_PACKED;
2562 oi->u.packed.offset = e.offset;
2563 oi->u.packed.pack = e.p;
2564 oi->u.packed.is_delta = (rtype == OBJ_REF_DELTA ||
2565 rtype == OBJ_OFS_DELTA);
2568 return 0;
2571 /* returns enum object_type or negative */
2572 int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
2574 enum object_type type;
2575 struct object_info oi = {NULL};
2577 oi.typep = &type;
2578 oi.sizep = sizep;
2579 if (sha1_object_info_extended(sha1, &oi, LOOKUP_REPLACE_OBJECT) < 0)
2580 return -1;
2581 return type;
2584 static void *read_packed_sha1(const unsigned char *sha1,
2585 enum object_type *type, unsigned long *size)
2587 struct pack_entry e;
2588 void *data;
2590 if (!find_pack_entry(sha1, &e))
2591 return NULL;
2592 data = cache_or_unpack_entry(e.p, e.offset, size, type, 1);
2593 if (!data) {
2595 * We're probably in deep shit, but let's try to fetch
2596 * the required object anyway from another pack or loose.
2597 * This should happen only in the presence of a corrupted
2598 * pack, and is better than failing outright.
2600 error("failed to read object %s at offset %"PRIuMAX" from %s",
2601 sha1_to_hex(sha1), (uintmax_t)e.offset, e.p->pack_name);
2602 mark_bad_packed_object(e.p, sha1);
2603 data = read_object(sha1, type, size);
2605 return data;
2608 int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
2609 unsigned char *sha1)
2611 struct cached_object *co;
2613 hash_sha1_file(buf, len, typename(type), sha1);
2614 if (has_sha1_file(sha1) || find_cached_object(sha1))
2615 return 0;
2616 if (cached_object_alloc <= cached_object_nr) {
2617 cached_object_alloc = alloc_nr(cached_object_alloc);
2618 cached_objects = xrealloc(cached_objects,
2619 sizeof(*cached_objects) *
2620 cached_object_alloc);
2622 co = &cached_objects[cached_object_nr++];
2623 co->size = len;
2624 co->type = type;
2625 co->buf = xmalloc(len);
2626 memcpy(co->buf, buf, len);
2627 hashcpy(co->sha1, sha1);
2628 return 0;
2631 static void *read_object(const unsigned char *sha1, enum object_type *type,
2632 unsigned long *size)
2634 unsigned long mapsize;
2635 void *map, *buf;
2636 struct cached_object *co;
2638 co = find_cached_object(sha1);
2639 if (co) {
2640 *type = co->type;
2641 *size = co->size;
2642 return xmemdupz(co->buf, co->size);
2645 buf = read_packed_sha1(sha1, type, size);
2646 if (buf)
2647 return buf;
2648 map = map_sha1_file(sha1, &mapsize);
2649 if (map) {
2650 buf = unpack_sha1_file(map, mapsize, type, size, sha1);
2651 munmap(map, mapsize);
2652 return buf;
2654 reprepare_packed_git();
2655 return read_packed_sha1(sha1, type, size);
2659 * This function dies on corrupt objects; the callers who want to
2660 * deal with them should arrange to call read_object() and give error
2661 * messages themselves.
2663 void *read_sha1_file_extended(const unsigned char *sha1,
2664 enum object_type *type,
2665 unsigned long *size,
2666 unsigned flag)
2668 void *data;
2669 char *path;
2670 const struct packed_git *p;
2671 const unsigned char *repl = lookup_replace_object_extended(sha1, flag);
2673 errno = 0;
2674 data = read_object(repl, type, size);
2675 if (data)
2676 return data;
2678 if (errno && errno != ENOENT)
2679 die_errno("failed to read object %s", sha1_to_hex(sha1));
2681 /* die if we replaced an object with one that does not exist */
2682 if (repl != sha1)
2683 die("replacement %s not found for %s",
2684 sha1_to_hex(repl), sha1_to_hex(sha1));
2686 if (has_loose_object(repl)) {
2687 path = sha1_file_name(sha1);
2688 die("loose object %s (stored in %s) is corrupt",
2689 sha1_to_hex(repl), path);
2692 if ((p = has_packed_and_bad(repl)) != NULL)
2693 die("packed object %s (stored in %s) is corrupt",
2694 sha1_to_hex(repl), p->pack_name);
2696 return NULL;
2699 void *read_object_with_reference(const unsigned char *sha1,
2700 const char *required_type_name,
2701 unsigned long *size,
2702 unsigned char *actual_sha1_return)
2704 enum object_type type, required_type;
2705 void *buffer;
2706 unsigned long isize;
2707 unsigned char actual_sha1[20];
2709 required_type = type_from_string(required_type_name);
2710 hashcpy(actual_sha1, sha1);
2711 while (1) {
2712 int ref_length = -1;
2713 const char *ref_type = NULL;
2715 buffer = read_sha1_file(actual_sha1, &type, &isize);
2716 if (!buffer)
2717 return NULL;
2718 if (type == required_type) {
2719 *size = isize;
2720 if (actual_sha1_return)
2721 hashcpy(actual_sha1_return, actual_sha1);
2722 return buffer;
2724 /* Handle references */
2725 else if (type == OBJ_COMMIT)
2726 ref_type = "tree ";
2727 else if (type == OBJ_TAG)
2728 ref_type = "object ";
2729 else {
2730 free(buffer);
2731 return NULL;
2733 ref_length = strlen(ref_type);
2735 if (ref_length + 40 > isize ||
2736 memcmp(buffer, ref_type, ref_length) ||
2737 get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
2738 free(buffer);
2739 return NULL;
2741 free(buffer);
2742 /* Now we have the ID of the referred-to object in
2743 * actual_sha1. Check again. */
2747 static void write_sha1_file_prepare(const void *buf, unsigned long len,
2748 const char *type, unsigned char *sha1,
2749 char *hdr, int *hdrlen)
2751 git_SHA_CTX c;
2753 /* Generate the header */
2754 *hdrlen = sprintf(hdr, "%s %lu", type, len)+1;
2756 /* Sha1.. */
2757 git_SHA1_Init(&c);
2758 git_SHA1_Update(&c, hdr, *hdrlen);
2759 git_SHA1_Update(&c, buf, len);
2760 git_SHA1_Final(sha1, &c);
2764 * Move the just written object into its final resting place.
2765 * NEEDSWORK: this should be renamed to finalize_temp_file() as
2766 * "moving" is only a part of what it does, when no patch between
2767 * master to pu changes the call sites of this function.
2769 int move_temp_to_file(const char *tmpfile, const char *filename)
2771 int ret = 0;
2773 if (object_creation_mode == OBJECT_CREATION_USES_RENAMES)
2774 goto try_rename;
2775 else if (link(tmpfile, filename))
2776 ret = errno;
2779 * Coda hack - coda doesn't like cross-directory links,
2780 * so we fall back to a rename, which will mean that it
2781 * won't be able to check collisions, but that's not a
2782 * big deal.
2784 * The same holds for FAT formatted media.
2786 * When this succeeds, we just return. We have nothing
2787 * left to unlink.
2789 if (ret && ret != EEXIST) {
2790 try_rename:
2791 if (!rename(tmpfile, filename))
2792 goto out;
2793 ret = errno;
2795 unlink_or_warn(tmpfile);
2796 if (ret) {
2797 if (ret != EEXIST) {
2798 return error("unable to write sha1 filename %s: %s", filename, strerror(ret));
2800 /* FIXME!!! Collision check here ? */
2803 out:
2804 if (adjust_shared_perm(filename))
2805 return error("unable to set permission to '%s'", filename);
2806 return 0;
2809 static int write_buffer(int fd, const void *buf, size_t len)
2811 if (write_in_full(fd, buf, len) < 0)
2812 return error("file write error (%s)", strerror(errno));
2813 return 0;
2816 int hash_sha1_file(const void *buf, unsigned long len, const char *type,
2817 unsigned char *sha1)
2819 char hdr[32];
2820 int hdrlen;
2821 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2822 return 0;
2825 /* Finalize a file on disk, and close it. */
2826 static void close_sha1_file(int fd)
2828 if (fsync_object_files)
2829 fsync_or_die(fd, "sha1 file");
2830 if (close(fd) != 0)
2831 die_errno("error when closing sha1 file");
2834 /* Size of directory component, including the ending '/' */
2835 static inline int directory_size(const char *filename)
2837 const char *s = strrchr(filename, '/');
2838 if (!s)
2839 return 0;
2840 return s - filename + 1;
2844 * This creates a temporary file in the same directory as the final
2845 * 'filename'
2847 * We want to avoid cross-directory filename renames, because those
2848 * can have problems on various filesystems (FAT, NFS, Coda).
2850 static int create_tmpfile(char *buffer, size_t bufsiz, const char *filename)
2852 int fd, dirlen = directory_size(filename);
2854 if (dirlen + 20 > bufsiz) {
2855 errno = ENAMETOOLONG;
2856 return -1;
2858 memcpy(buffer, filename, dirlen);
2859 strcpy(buffer + dirlen, "tmp_obj_XXXXXX");
2860 fd = git_mkstemp_mode(buffer, 0444);
2861 if (fd < 0 && dirlen && errno == ENOENT) {
2862 /* Make sure the directory exists */
2863 memcpy(buffer, filename, dirlen);
2864 buffer[dirlen-1] = 0;
2865 if (mkdir(buffer, 0777) && errno != EEXIST)
2866 return -1;
2867 if (adjust_shared_perm(buffer))
2868 return -1;
2870 /* Try again */
2871 strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX");
2872 fd = git_mkstemp_mode(buffer, 0444);
2874 return fd;
2877 static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
2878 const void *buf, unsigned long len, time_t mtime)
2880 int fd, ret;
2881 unsigned char compressed[4096];
2882 git_zstream stream;
2883 git_SHA_CTX c;
2884 unsigned char parano_sha1[20];
2885 char *filename;
2886 static char tmp_file[PATH_MAX];
2888 filename = sha1_file_name(sha1);
2889 fd = create_tmpfile(tmp_file, sizeof(tmp_file), filename);
2890 if (fd < 0) {
2891 if (errno == EACCES)
2892 return error("insufficient permission for adding an object to repository database %s", get_object_directory());
2893 else
2894 return error("unable to create temporary file: %s", strerror(errno));
2897 /* Set it up */
2898 memset(&stream, 0, sizeof(stream));
2899 git_deflate_init(&stream, zlib_compression_level);
2900 stream.next_out = compressed;
2901 stream.avail_out = sizeof(compressed);
2902 git_SHA1_Init(&c);
2904 /* First header.. */
2905 stream.next_in = (unsigned char *)hdr;
2906 stream.avail_in = hdrlen;
2907 while (git_deflate(&stream, 0) == Z_OK)
2908 ; /* nothing */
2909 git_SHA1_Update(&c, hdr, hdrlen);
2911 /* Then the data itself.. */
2912 stream.next_in = (void *)buf;
2913 stream.avail_in = len;
2914 do {
2915 unsigned char *in0 = stream.next_in;
2916 ret = git_deflate(&stream, Z_FINISH);
2917 git_SHA1_Update(&c, in0, stream.next_in - in0);
2918 if (write_buffer(fd, compressed, stream.next_out - compressed) < 0)
2919 die("unable to write sha1 file");
2920 stream.next_out = compressed;
2921 stream.avail_out = sizeof(compressed);
2922 } while (ret == Z_OK);
2924 if (ret != Z_STREAM_END)
2925 die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
2926 ret = git_deflate_end_gently(&stream);
2927 if (ret != Z_OK)
2928 die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
2929 git_SHA1_Final(parano_sha1, &c);
2930 if (hashcmp(sha1, parano_sha1) != 0)
2931 die("confused by unstable object source data for %s", sha1_to_hex(sha1));
2933 close_sha1_file(fd);
2935 if (mtime) {
2936 struct utimbuf utb;
2937 utb.actime = mtime;
2938 utb.modtime = mtime;
2939 if (utime(tmp_file, &utb) < 0)
2940 warning("failed utime() on %s: %s",
2941 tmp_file, strerror(errno));
2944 return move_temp_to_file(tmp_file, filename);
2947 int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2949 unsigned char sha1[20];
2950 char hdr[32];
2951 int hdrlen;
2953 /* Normally if we have it in the pack then we do not bother writing
2954 * it out into .git/objects/??/?{38} file.
2956 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2957 if (returnsha1)
2958 hashcpy(returnsha1, sha1);
2959 if (has_sha1_file(sha1))
2960 return 0;
2961 return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
2964 int force_object_loose(const unsigned char *sha1, time_t mtime)
2966 void *buf;
2967 unsigned long len;
2968 enum object_type type;
2969 char hdr[32];
2970 int hdrlen;
2971 int ret;
2973 if (has_loose_object(sha1))
2974 return 0;
2975 buf = read_packed_sha1(sha1, &type, &len);
2976 if (!buf)
2977 return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
2978 hdrlen = sprintf(hdr, "%s %lu", typename(type), len) + 1;
2979 ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
2980 free(buf);
2982 return ret;
2985 int has_pack_index(const unsigned char *sha1)
2987 struct stat st;
2988 if (stat(sha1_pack_index_name(sha1), &st))
2989 return 0;
2990 return 1;
2993 int has_sha1_pack(const unsigned char *sha1)
2995 struct pack_entry e;
2996 return find_pack_entry(sha1, &e);
2999 int has_sha1_file(const unsigned char *sha1)
3001 struct pack_entry e;
3003 if (find_pack_entry(sha1, &e))
3004 return 1;
3005 if (has_loose_object(sha1))
3006 return 1;
3007 reprepare_packed_git();
3008 return find_pack_entry(sha1, &e);
3011 static void check_tree(const void *buf, size_t size)
3013 struct tree_desc desc;
3014 struct name_entry entry;
3016 init_tree_desc(&desc, buf, size);
3017 while (tree_entry(&desc, &entry))
3018 /* do nothing
3019 * tree_entry() will die() on malformed entries */
3023 static void check_commit(const void *buf, size_t size)
3025 struct commit c;
3026 memset(&c, 0, sizeof(c));
3027 if (parse_commit_buffer(&c, buf, size))
3028 die("corrupt commit");
3031 static void check_tag(const void *buf, size_t size)
3033 struct tag t;
3034 memset(&t, 0, sizeof(t));
3035 if (parse_tag_buffer(&t, buf, size))
3036 die("corrupt tag");
3039 static int index_mem(unsigned char *sha1, void *buf, size_t size,
3040 enum object_type type,
3041 const char *path, unsigned flags)
3043 int ret, re_allocated = 0;
3044 int write_object = flags & HASH_WRITE_OBJECT;
3046 if (!type)
3047 type = OBJ_BLOB;
3050 * Convert blobs to git internal format
3052 if ((type == OBJ_BLOB) && path) {
3053 struct strbuf nbuf = STRBUF_INIT;
3054 if (convert_to_git(path, buf, size, &nbuf,
3055 write_object ? safe_crlf : SAFE_CRLF_FALSE)) {
3056 buf = strbuf_detach(&nbuf, &size);
3057 re_allocated = 1;
3060 if (flags & HASH_FORMAT_CHECK) {
3061 if (type == OBJ_TREE)
3062 check_tree(buf, size);
3063 if (type == OBJ_COMMIT)
3064 check_commit(buf, size);
3065 if (type == OBJ_TAG)
3066 check_tag(buf, size);
3069 if (write_object)
3070 ret = write_sha1_file(buf, size, typename(type), sha1);
3071 else
3072 ret = hash_sha1_file(buf, size, typename(type), sha1);
3073 if (re_allocated)
3074 free(buf);
3075 return ret;
3078 static int index_pipe(unsigned char *sha1, int fd, enum object_type type,
3079 const char *path, unsigned flags)
3081 struct strbuf sbuf = STRBUF_INIT;
3082 int ret;
3084 if (strbuf_read(&sbuf, fd, 4096) >= 0)
3085 ret = index_mem(sha1, sbuf.buf, sbuf.len, type, path, flags);
3086 else
3087 ret = -1;
3088 strbuf_release(&sbuf);
3089 return ret;
3092 #define SMALL_FILE_SIZE (32*1024)
3094 static int index_core(unsigned char *sha1, int fd, size_t size,
3095 enum object_type type, const char *path,
3096 unsigned flags)
3098 int ret;
3100 if (!size) {
3101 ret = index_mem(sha1, NULL, size, type, path, flags);
3102 } else if (size <= SMALL_FILE_SIZE) {
3103 char *buf = xmalloc(size);
3104 if (size == read_in_full(fd, buf, size))
3105 ret = index_mem(sha1, buf, size, type, path, flags);
3106 else
3107 ret = error("short read %s", strerror(errno));
3108 free(buf);
3109 } else {
3110 void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
3111 ret = index_mem(sha1, buf, size, type, path, flags);
3112 munmap(buf, size);
3114 return ret;
3118 * This creates one packfile per large blob unless bulk-checkin
3119 * machinery is "plugged".
3121 * This also bypasses the usual "convert-to-git" dance, and that is on
3122 * purpose. We could write a streaming version of the converting
3123 * functions and insert that before feeding the data to fast-import
3124 * (or equivalent in-core API described above). However, that is
3125 * somewhat complicated, as we do not know the size of the filter
3126 * result, which we need to know beforehand when writing a git object.
3127 * Since the primary motivation for trying to stream from the working
3128 * tree file and to avoid mmaping it in core is to deal with large
3129 * binary blobs, they generally do not want to get any conversion, and
3130 * callers should avoid this code path when filters are requested.
3132 static int index_stream(unsigned char *sha1, int fd, size_t size,
3133 enum object_type type, const char *path,
3134 unsigned flags)
3136 return index_bulk_checkin(sha1, fd, size, type, path, flags);
3139 int index_fd(unsigned char *sha1, int fd, struct stat *st,
3140 enum object_type type, const char *path, unsigned flags)
3142 int ret;
3143 size_t size = xsize_t(st->st_size);
3145 if (!S_ISREG(st->st_mode))
3146 ret = index_pipe(sha1, fd, type, path, flags);
3147 else if (size <= big_file_threshold || type != OBJ_BLOB ||
3148 (path && would_convert_to_git(path, NULL, 0, 0)))
3149 ret = index_core(sha1, fd, size, type, path, flags);
3150 else
3151 ret = index_stream(sha1, fd, size, type, path, flags);
3152 close(fd);
3153 return ret;
3156 int index_path(unsigned char *sha1, const char *path, struct stat *st, unsigned flags)
3158 int fd;
3159 struct strbuf sb = STRBUF_INIT;
3161 switch (st->st_mode & S_IFMT) {
3162 case S_IFREG:
3163 fd = open(path, O_RDONLY);
3164 if (fd < 0)
3165 return error("open(\"%s\"): %s", path,
3166 strerror(errno));
3167 if (index_fd(sha1, fd, st, OBJ_BLOB, path, flags) < 0)
3168 return error("%s: failed to insert into database",
3169 path);
3170 break;
3171 case S_IFLNK:
3172 if (strbuf_readlink(&sb, path, st->st_size)) {
3173 char *errstr = strerror(errno);
3174 return error("readlink(\"%s\"): %s", path,
3175 errstr);
3177 if (!(flags & HASH_WRITE_OBJECT))
3178 hash_sha1_file(sb.buf, sb.len, blob_type, sha1);
3179 else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1))
3180 return error("%s: failed to insert into database",
3181 path);
3182 strbuf_release(&sb);
3183 break;
3184 case S_IFDIR:
3185 return resolve_gitlink_ref(path, "HEAD", sha1);
3186 default:
3187 return error("%s: unsupported file type", path);
3189 return 0;
3192 int read_pack_header(int fd, struct pack_header *header)
3194 if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
3195 /* "eof before pack header was fully read" */
3196 return PH_ERROR_EOF;
3198 if (header->hdr_signature != htonl(PACK_SIGNATURE))
3199 /* "protocol error (pack signature mismatch detected)" */
3200 return PH_ERROR_PACK_SIGNATURE;
3201 if (!pack_version_ok(header->hdr_version))
3202 /* "protocol error (pack version unsupported)" */
3203 return PH_ERROR_PROTOCOL;
3204 return 0;
3207 void assert_sha1_type(const unsigned char *sha1, enum object_type expect)
3209 enum object_type type = sha1_object_info(sha1, NULL);
3210 if (type < 0)
3211 die("%s is not a valid object", sha1_to_hex(sha1));
3212 if (type != expect)
3213 die("%s is not a valid '%s' object", sha1_to_hex(sha1),
3214 typename(expect));