move duplicated ref_newer() to remote.c
[git/jnareb-git/bp-gitweb.git] / sha1_file.c
blob032300c4c6434701e802df729cd74245e543de20
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 "delta.h"
11 #include "pack.h"
12 #include "blob.h"
13 #include "commit.h"
14 #include "tag.h"
15 #include "tree.h"
16 #include "refs.h"
17 #include "pack-revindex.h"
18 #include "sha1-lookup.h"
20 #ifndef O_NOATIME
21 #if defined(__linux__) && (defined(__i386__) || defined(__PPC__))
22 #define O_NOATIME 01000000
23 #else
24 #define O_NOATIME 0
25 #endif
26 #endif
28 #ifdef NO_C99_FORMAT
29 #define SZ_FMT "lu"
30 static unsigned long sz_fmt(size_t s) { return (unsigned long)s; }
31 #else
32 #define SZ_FMT "zu"
33 static size_t sz_fmt(size_t s) { return s; }
34 #endif
36 const unsigned char null_sha1[20];
38 const signed char hexval_table[256] = {
39 -1, -1, -1, -1, -1, -1, -1, -1, /* 00-07 */
40 -1, -1, -1, -1, -1, -1, -1, -1, /* 08-0f */
41 -1, -1, -1, -1, -1, -1, -1, -1, /* 10-17 */
42 -1, -1, -1, -1, -1, -1, -1, -1, /* 18-1f */
43 -1, -1, -1, -1, -1, -1, -1, -1, /* 20-27 */
44 -1, -1, -1, -1, -1, -1, -1, -1, /* 28-2f */
45 0, 1, 2, 3, 4, 5, 6, 7, /* 30-37 */
46 8, 9, -1, -1, -1, -1, -1, -1, /* 38-3f */
47 -1, 10, 11, 12, 13, 14, 15, -1, /* 40-47 */
48 -1, -1, -1, -1, -1, -1, -1, -1, /* 48-4f */
49 -1, -1, -1, -1, -1, -1, -1, -1, /* 50-57 */
50 -1, -1, -1, -1, -1, -1, -1, -1, /* 58-5f */
51 -1, 10, 11, 12, 13, 14, 15, -1, /* 60-67 */
52 -1, -1, -1, -1, -1, -1, -1, -1, /* 68-67 */
53 -1, -1, -1, -1, -1, -1, -1, -1, /* 70-77 */
54 -1, -1, -1, -1, -1, -1, -1, -1, /* 78-7f */
55 -1, -1, -1, -1, -1, -1, -1, -1, /* 80-87 */
56 -1, -1, -1, -1, -1, -1, -1, -1, /* 88-8f */
57 -1, -1, -1, -1, -1, -1, -1, -1, /* 90-97 */
58 -1, -1, -1, -1, -1, -1, -1, -1, /* 98-9f */
59 -1, -1, -1, -1, -1, -1, -1, -1, /* a0-a7 */
60 -1, -1, -1, -1, -1, -1, -1, -1, /* a8-af */
61 -1, -1, -1, -1, -1, -1, -1, -1, /* b0-b7 */
62 -1, -1, -1, -1, -1, -1, -1, -1, /* b8-bf */
63 -1, -1, -1, -1, -1, -1, -1, -1, /* c0-c7 */
64 -1, -1, -1, -1, -1, -1, -1, -1, /* c8-cf */
65 -1, -1, -1, -1, -1, -1, -1, -1, /* d0-d7 */
66 -1, -1, -1, -1, -1, -1, -1, -1, /* d8-df */
67 -1, -1, -1, -1, -1, -1, -1, -1, /* e0-e7 */
68 -1, -1, -1, -1, -1, -1, -1, -1, /* e8-ef */
69 -1, -1, -1, -1, -1, -1, -1, -1, /* f0-f7 */
70 -1, -1, -1, -1, -1, -1, -1, -1, /* f8-ff */
73 int get_sha1_hex(const char *hex, unsigned char *sha1)
75 int i;
76 for (i = 0; i < 20; i++) {
77 unsigned int val = (hexval(hex[0]) << 4) | hexval(hex[1]);
78 if (val & ~0xff)
79 return -1;
80 *sha1++ = val;
81 hex += 2;
83 return 0;
86 static inline int offset_1st_component(const char *path)
88 if (has_dos_drive_prefix(path))
89 return 2 + (path[2] == '/');
90 return *path == '/';
93 int safe_create_leading_directories(char *path)
95 char *pos = path + offset_1st_component(path);
96 struct stat st;
98 while (pos) {
99 pos = strchr(pos, '/');
100 if (!pos)
101 break;
102 while (*++pos == '/')
104 if (!*pos)
105 break;
106 *--pos = '\0';
107 if (!stat(path, &st)) {
108 /* path exists */
109 if (!S_ISDIR(st.st_mode)) {
110 *pos = '/';
111 return -3;
114 else if (mkdir(path, 0777)) {
115 *pos = '/';
116 return -1;
118 else if (adjust_shared_perm(path)) {
119 *pos = '/';
120 return -2;
122 *pos++ = '/';
124 return 0;
127 int safe_create_leading_directories_const(const char *path)
129 /* path points to cache entries, so xstrdup before messing with it */
130 char *buf = xstrdup(path);
131 int result = safe_create_leading_directories(buf);
132 free(buf);
133 return result;
136 char *sha1_to_hex(const unsigned char *sha1)
138 static int bufno;
139 static char hexbuffer[4][50];
140 static const char hex[] = "0123456789abcdef";
141 char *buffer = hexbuffer[3 & ++bufno], *buf = buffer;
142 int i;
144 for (i = 0; i < 20; i++) {
145 unsigned int val = *sha1++;
146 *buf++ = hex[val >> 4];
147 *buf++ = hex[val & 0xf];
149 *buf = '\0';
151 return buffer;
154 static void fill_sha1_path(char *pathbuf, const unsigned char *sha1)
156 int i;
157 for (i = 0; i < 20; i++) {
158 static char hex[] = "0123456789abcdef";
159 unsigned int val = sha1[i];
160 char *pos = pathbuf + i*2 + (i > 0);
161 *pos++ = hex[val >> 4];
162 *pos = hex[val & 0xf];
167 * NOTE! This returns a statically allocated buffer, so you have to be
168 * careful about using it. Do an "xstrdup()" if you need to save the
169 * filename.
171 * Also note that this returns the location for creating. Reading
172 * SHA1 file can happen from any alternate directory listed in the
173 * DB_ENVIRONMENT environment variable if it is not found in
174 * the primary object database.
176 char *sha1_file_name(const unsigned char *sha1)
178 static char *name, *base;
180 if (!base) {
181 const char *sha1_file_directory = get_object_directory();
182 int len = strlen(sha1_file_directory);
183 base = xmalloc(len + 60);
184 memcpy(base, sha1_file_directory, len);
185 memset(base+len, 0, 60);
186 base[len] = '/';
187 base[len+3] = '/';
188 name = base + len + 1;
190 fill_sha1_path(name, sha1);
191 return base;
194 static char *sha1_get_pack_name(const unsigned char *sha1,
195 char **name, char **base, const char *which)
197 static const char hex[] = "0123456789abcdef";
198 char *buf;
199 int i;
201 if (!*base) {
202 const char *sha1_file_directory = get_object_directory();
203 int len = strlen(sha1_file_directory);
204 *base = xmalloc(len + 60);
205 sprintf(*base, "%s/pack/pack-1234567890123456789012345678901234567890.%s",
206 sha1_file_directory, which);
207 *name = *base + len + 11;
210 buf = *name;
212 for (i = 0; i < 20; i++) {
213 unsigned int val = *sha1++;
214 *buf++ = hex[val >> 4];
215 *buf++ = hex[val & 0xf];
218 return *base;
221 char *sha1_pack_name(const unsigned char *sha1)
223 static char *name, *base;
225 return sha1_get_pack_name(sha1, &name, &base, "pack");
228 char *sha1_pack_index_name(const unsigned char *sha1)
230 static char *name, *base;
232 return sha1_get_pack_name(sha1, &name, &base, "idx");
235 struct alternate_object_database *alt_odb_list;
236 static struct alternate_object_database **alt_odb_tail;
238 static void read_info_alternates(const char * alternates, int depth);
241 * Prepare alternate object database registry.
243 * The variable alt_odb_list points at the list of struct
244 * alternate_object_database. The elements on this list come from
245 * non-empty elements from colon separated ALTERNATE_DB_ENVIRONMENT
246 * environment variable, and $GIT_OBJECT_DIRECTORY/info/alternates,
247 * whose contents is similar to that environment variable but can be
248 * LF separated. Its base points at a statically allocated buffer that
249 * contains "/the/directory/corresponding/to/.git/objects/...", while
250 * its name points just after the slash at the end of ".git/objects/"
251 * in the example above, and has enough space to hold 40-byte hex
252 * SHA1, an extra slash for the first level indirection, and the
253 * terminating NUL.
255 static int link_alt_odb_entry(const char * entry, int len, const char * relative_base, int depth)
257 const char *objdir = get_object_directory();
258 struct alternate_object_database *ent;
259 struct alternate_object_database *alt;
260 /* 43 = 40-byte + 2 '/' + terminating NUL */
261 int pfxlen = len;
262 int entlen = pfxlen + 43;
263 int base_len = -1;
265 if (!is_absolute_path(entry) && relative_base) {
266 /* Relative alt-odb */
267 if (base_len < 0)
268 base_len = strlen(relative_base) + 1;
269 entlen += base_len;
270 pfxlen += base_len;
272 ent = xmalloc(sizeof(*ent) + entlen);
274 if (!is_absolute_path(entry) && relative_base) {
275 memcpy(ent->base, relative_base, base_len - 1);
276 ent->base[base_len - 1] = '/';
277 memcpy(ent->base + base_len, entry, len);
279 else
280 memcpy(ent->base, entry, pfxlen);
282 ent->name = ent->base + pfxlen + 1;
283 ent->base[pfxlen + 3] = '/';
284 ent->base[pfxlen] = ent->base[entlen-1] = 0;
286 /* Detect cases where alternate disappeared */
287 if (!is_directory(ent->base)) {
288 error("object directory %s does not exist; "
289 "check .git/objects/info/alternates.",
290 ent->base);
291 free(ent);
292 return -1;
295 /* Prevent the common mistake of listing the same
296 * thing twice, or object directory itself.
298 for (alt = alt_odb_list; alt; alt = alt->next) {
299 if (!memcmp(ent->base, alt->base, pfxlen)) {
300 free(ent);
301 return -1;
304 if (!memcmp(ent->base, objdir, pfxlen)) {
305 free(ent);
306 return -1;
309 /* add the alternate entry */
310 *alt_odb_tail = ent;
311 alt_odb_tail = &(ent->next);
312 ent->next = NULL;
314 /* recursively add alternates */
315 read_info_alternates(ent->base, depth + 1);
317 ent->base[pfxlen] = '/';
319 return 0;
322 static void link_alt_odb_entries(const char *alt, const char *ep, int sep,
323 const char *relative_base, int depth)
325 const char *cp, *last;
327 if (depth > 5) {
328 error("%s: ignoring alternate object stores, nesting too deep.",
329 relative_base);
330 return;
333 last = alt;
334 while (last < ep) {
335 cp = last;
336 if (cp < ep && *cp == '#') {
337 while (cp < ep && *cp != sep)
338 cp++;
339 last = cp + 1;
340 continue;
342 while (cp < ep && *cp != sep)
343 cp++;
344 if (last != cp) {
345 if (!is_absolute_path(last) && depth) {
346 error("%s: ignoring relative alternate object store %s",
347 relative_base, last);
348 } else {
349 link_alt_odb_entry(last, cp - last,
350 relative_base, depth);
353 while (cp < ep && *cp == sep)
354 cp++;
355 last = cp;
359 static 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 = open(path, O_RDONLY);
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, 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/objects\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, 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, 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 size_t peak_pack_mapped;
455 static size_t pack_mapped;
456 struct packed_git *packed_git;
458 void pack_report(void)
460 fprintf(stderr,
461 "pack_report: getpagesize() = %10" SZ_FMT "\n"
462 "pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
463 "pack_report: core.packedGitLimit = %10" SZ_FMT "\n",
464 sz_fmt(getpagesize()),
465 sz_fmt(packed_git_window_size),
466 sz_fmt(packed_git_limit));
467 fprintf(stderr,
468 "pack_report: pack_used_ctr = %10u\n"
469 "pack_report: pack_mmap_calls = %10u\n"
470 "pack_report: pack_open_windows = %10u / %10u\n"
471 "pack_report: pack_mapped = "
472 "%10" SZ_FMT " / %10" SZ_FMT "\n",
473 pack_used_ctr,
474 pack_mmap_calls,
475 pack_open_windows, peak_pack_open_windows,
476 sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
479 static int check_packed_git_idx(const char *path, struct packed_git *p)
481 void *idx_map;
482 struct pack_idx_header *hdr;
483 size_t idx_size;
484 uint32_t version, nr, i, *index;
485 int fd = open(path, O_RDONLY);
486 struct stat st;
488 if (fd < 0)
489 return -1;
490 if (fstat(fd, &st)) {
491 close(fd);
492 return -1;
494 idx_size = xsize_t(st.st_size);
495 if (idx_size < 4 * 256 + 20 + 20) {
496 close(fd);
497 return error("index file %s is too small", path);
499 idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
500 close(fd);
502 hdr = idx_map;
503 if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
504 version = ntohl(hdr->idx_version);
505 if (version < 2 || version > 2) {
506 munmap(idx_map, idx_size);
507 return error("index file %s is version %"PRIu32
508 " and is not supported by this binary"
509 " (try upgrading GIT to a newer version)",
510 path, version);
512 } else
513 version = 1;
515 nr = 0;
516 index = idx_map;
517 if (version > 1)
518 index += 2; /* skip index header */
519 for (i = 0; i < 256; i++) {
520 uint32_t n = ntohl(index[i]);
521 if (n < nr) {
522 munmap(idx_map, idx_size);
523 return error("non-monotonic index %s", path);
525 nr = n;
528 if (version == 1) {
530 * Total size:
531 * - 256 index entries 4 bytes each
532 * - 24-byte entries * nr (20-byte sha1 + 4-byte offset)
533 * - 20-byte SHA1 of the packfile
534 * - 20-byte SHA1 file checksum
536 if (idx_size != 4*256 + nr * 24 + 20 + 20) {
537 munmap(idx_map, idx_size);
538 return error("wrong index v1 file size in %s", path);
540 } else if (version == 2) {
542 * Minimum size:
543 * - 8 bytes of header
544 * - 256 index entries 4 bytes each
545 * - 20-byte sha1 entry * nr
546 * - 4-byte crc entry * nr
547 * - 4-byte offset entry * nr
548 * - 20-byte SHA1 of the packfile
549 * - 20-byte SHA1 file checksum
550 * And after the 4-byte offset table might be a
551 * variable sized table containing 8-byte entries
552 * for offsets larger than 2^31.
554 unsigned long min_size = 8 + 4*256 + nr*(20 + 4 + 4) + 20 + 20;
555 unsigned long max_size = min_size;
556 if (nr)
557 max_size += (nr - 1)*8;
558 if (idx_size < min_size || idx_size > max_size) {
559 munmap(idx_map, idx_size);
560 return error("wrong index v2 file size in %s", path);
562 if (idx_size != min_size &&
564 * make sure we can deal with large pack offsets.
565 * 31-bit signed offset won't be enough, neither
566 * 32-bit unsigned one will be.
568 (sizeof(off_t) <= 4)) {
569 munmap(idx_map, idx_size);
570 return error("pack too large for current definition of off_t in %s", path);
574 p->index_version = version;
575 p->index_data = idx_map;
576 p->index_size = idx_size;
577 p->num_objects = nr;
578 return 0;
581 int open_pack_index(struct packed_git *p)
583 char *idx_name;
584 int ret;
586 if (p->index_data)
587 return 0;
589 idx_name = xstrdup(p->pack_name);
590 strcpy(idx_name + strlen(idx_name) - strlen(".pack"), ".idx");
591 ret = check_packed_git_idx(idx_name, p);
592 free(idx_name);
593 return ret;
596 static void scan_windows(struct packed_git *p,
597 struct packed_git **lru_p,
598 struct pack_window **lru_w,
599 struct pack_window **lru_l)
601 struct pack_window *w, *w_l;
603 for (w_l = NULL, w = p->windows; w; w = w->next) {
604 if (!w->inuse_cnt) {
605 if (!*lru_w || w->last_used < (*lru_w)->last_used) {
606 *lru_p = p;
607 *lru_w = w;
608 *lru_l = w_l;
611 w_l = w;
615 static int unuse_one_window(struct packed_git *current, int keep_fd)
617 struct packed_git *p, *lru_p = NULL;
618 struct pack_window *lru_w = NULL, *lru_l = NULL;
620 if (current)
621 scan_windows(current, &lru_p, &lru_w, &lru_l);
622 for (p = packed_git; p; p = p->next)
623 scan_windows(p, &lru_p, &lru_w, &lru_l);
624 if (lru_p) {
625 munmap(lru_w->base, lru_w->len);
626 pack_mapped -= lru_w->len;
627 if (lru_l)
628 lru_l->next = lru_w->next;
629 else {
630 lru_p->windows = lru_w->next;
631 if (!lru_p->windows && lru_p->pack_fd != keep_fd) {
632 close(lru_p->pack_fd);
633 lru_p->pack_fd = -1;
636 free(lru_w);
637 pack_open_windows--;
638 return 1;
640 return 0;
643 void release_pack_memory(size_t need, int fd)
645 size_t cur = pack_mapped;
646 while (need >= (cur - pack_mapped) && unuse_one_window(NULL, fd))
647 ; /* nothing */
650 void close_pack_windows(struct packed_git *p)
652 while (p->windows) {
653 struct pack_window *w = p->windows;
655 if (w->inuse_cnt)
656 die("pack '%s' still has open windows to it",
657 p->pack_name);
658 munmap(w->base, w->len);
659 pack_mapped -= w->len;
660 pack_open_windows--;
661 p->windows = w->next;
662 free(w);
666 void unuse_pack(struct pack_window **w_cursor)
668 struct pack_window *w = *w_cursor;
669 if (w) {
670 w->inuse_cnt--;
671 *w_cursor = NULL;
676 * This is used by git-repack in case a newly created pack happens to
677 * contain the same set of objects as an existing one. In that case
678 * the resulting file might be different even if its name would be the
679 * same. It is best to close any reference to the old pack before it is
680 * replaced on disk. Of course no index pointers nor windows for given pack
681 * must subsist at this point. If ever objects from this pack are requested
682 * again, the new version of the pack will be reinitialized through
683 * reprepare_packed_git().
685 void free_pack_by_name(const char *pack_name)
687 struct packed_git *p, **pp = &packed_git;
689 while (*pp) {
690 p = *pp;
691 if (strcmp(pack_name, p->pack_name) == 0) {
692 clear_delta_base_cache();
693 close_pack_windows(p);
694 if (p->pack_fd != -1)
695 close(p->pack_fd);
696 if (p->index_data)
697 munmap((void *)p->index_data, p->index_size);
698 free(p->bad_object_sha1);
699 *pp = p->next;
700 free(p);
701 return;
703 pp = &p->next;
708 * Do not call this directly as this leaks p->pack_fd on error return;
709 * call open_packed_git() instead.
711 static int open_packed_git_1(struct packed_git *p)
713 struct stat st;
714 struct pack_header hdr;
715 unsigned char sha1[20];
716 unsigned char *idx_sha1;
717 long fd_flag;
719 if (!p->index_data && open_pack_index(p))
720 return error("packfile %s index unavailable", p->pack_name);
722 p->pack_fd = open(p->pack_name, O_RDONLY);
723 if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
724 return -1;
726 /* If we created the struct before we had the pack we lack size. */
727 if (!p->pack_size) {
728 if (!S_ISREG(st.st_mode))
729 return error("packfile %s not a regular file", p->pack_name);
730 p->pack_size = st.st_size;
731 } else if (p->pack_size != st.st_size)
732 return error("packfile %s size changed", p->pack_name);
734 /* We leave these file descriptors open with sliding mmap;
735 * there is no point keeping them open across exec(), though.
737 fd_flag = fcntl(p->pack_fd, F_GETFD, 0);
738 if (fd_flag < 0)
739 return error("cannot determine file descriptor flags");
740 fd_flag |= FD_CLOEXEC;
741 if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
742 return error("cannot set FD_CLOEXEC");
744 /* Verify we recognize this pack file format. */
745 if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
746 return error("file %s is far too short to be a packfile", p->pack_name);
747 if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
748 return error("file %s is not a GIT packfile", p->pack_name);
749 if (!pack_version_ok(hdr.hdr_version))
750 return error("packfile %s is version %"PRIu32" and not"
751 " supported (try upgrading GIT to a newer version)",
752 p->pack_name, ntohl(hdr.hdr_version));
754 /* Verify the pack matches its index. */
755 if (p->num_objects != ntohl(hdr.hdr_entries))
756 return error("packfile %s claims to have %"PRIu32" objects"
757 " while index indicates %"PRIu32" objects",
758 p->pack_name, ntohl(hdr.hdr_entries),
759 p->num_objects);
760 if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
761 return error("end of packfile %s is unavailable", p->pack_name);
762 if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
763 return error("packfile %s signature is unavailable", p->pack_name);
764 idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
765 if (hashcmp(sha1, idx_sha1))
766 return error("packfile %s does not match index", p->pack_name);
767 return 0;
770 static int open_packed_git(struct packed_git *p)
772 if (!open_packed_git_1(p))
773 return 0;
774 if (p->pack_fd != -1) {
775 close(p->pack_fd);
776 p->pack_fd = -1;
778 return -1;
781 static int in_window(struct pack_window *win, off_t offset)
783 /* We must promise at least 20 bytes (one hash) after the
784 * offset is available from this window, otherwise the offset
785 * is not actually in this window and a different window (which
786 * has that one hash excess) must be used. This is to support
787 * the object header and delta base parsing routines below.
789 off_t win_off = win->offset;
790 return win_off <= offset
791 && (offset + 20) <= (win_off + win->len);
794 unsigned char* use_pack(struct packed_git *p,
795 struct pack_window **w_cursor,
796 off_t offset,
797 unsigned int *left)
799 struct pack_window *win = *w_cursor;
801 if (p->pack_fd == -1 && open_packed_git(p))
802 die("packfile %s cannot be accessed", p->pack_name);
804 /* Since packfiles end in a hash of their content and it's
805 * pointless to ask for an offset into the middle of that
806 * hash, and the in_window function above wouldn't match
807 * don't allow an offset too close to the end of the file.
809 if (offset > (p->pack_size - 20))
810 die("offset beyond end of packfile (truncated pack?)");
812 if (!win || !in_window(win, offset)) {
813 if (win)
814 win->inuse_cnt--;
815 for (win = p->windows; win; win = win->next) {
816 if (in_window(win, offset))
817 break;
819 if (!win) {
820 size_t window_align = packed_git_window_size / 2;
821 off_t len;
822 win = xcalloc(1, sizeof(*win));
823 win->offset = (offset / window_align) * window_align;
824 len = p->pack_size - win->offset;
825 if (len > packed_git_window_size)
826 len = packed_git_window_size;
827 win->len = (size_t)len;
828 pack_mapped += win->len;
829 while (packed_git_limit < pack_mapped
830 && unuse_one_window(p, p->pack_fd))
831 ; /* nothing */
832 win->base = xmmap(NULL, win->len,
833 PROT_READ, MAP_PRIVATE,
834 p->pack_fd, win->offset);
835 if (win->base == MAP_FAILED)
836 die("packfile %s cannot be mapped: %s",
837 p->pack_name,
838 strerror(errno));
839 pack_mmap_calls++;
840 pack_open_windows++;
841 if (pack_mapped > peak_pack_mapped)
842 peak_pack_mapped = pack_mapped;
843 if (pack_open_windows > peak_pack_open_windows)
844 peak_pack_open_windows = pack_open_windows;
845 win->next = p->windows;
846 p->windows = win;
849 if (win != *w_cursor) {
850 win->last_used = pack_used_ctr++;
851 win->inuse_cnt++;
852 *w_cursor = win;
854 offset -= win->offset;
855 if (left)
856 *left = win->len - xsize_t(offset);
857 return win->base + offset;
860 static struct packed_git *alloc_packed_git(int extra)
862 struct packed_git *p = xmalloc(sizeof(*p) + extra);
863 memset(p, 0, sizeof(*p));
864 p->pack_fd = -1;
865 return p;
868 struct packed_git *add_packed_git(const char *path, int path_len, int local)
870 struct stat st;
871 struct packed_git *p = alloc_packed_git(path_len + 2);
874 * Make sure a corresponding .pack file exists and that
875 * the index looks sane.
877 path_len -= strlen(".idx");
878 if (path_len < 1) {
879 free(p);
880 return NULL;
882 memcpy(p->pack_name, path, path_len);
884 strcpy(p->pack_name + path_len, ".keep");
885 if (!access(p->pack_name, F_OK))
886 p->pack_keep = 1;
888 strcpy(p->pack_name + path_len, ".pack");
889 if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
890 free(p);
891 return NULL;
894 /* ok, it looks sane as far as we can check without
895 * actually mapping the pack file.
897 p->pack_size = st.st_size;
898 p->pack_local = local;
899 p->mtime = st.st_mtime;
900 if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
901 hashclr(p->sha1);
902 return p;
905 struct packed_git *parse_pack_index(unsigned char *sha1)
907 const char *idx_path = sha1_pack_index_name(sha1);
908 const char *path = sha1_pack_name(sha1);
909 struct packed_git *p = alloc_packed_git(strlen(path) + 1);
911 strcpy(p->pack_name, path);
912 hashcpy(p->sha1, sha1);
913 if (check_packed_git_idx(idx_path, p)) {
914 free(p);
915 return NULL;
918 return p;
921 void install_packed_git(struct packed_git *pack)
923 pack->next = packed_git;
924 packed_git = pack;
927 static void prepare_packed_git_one(char *objdir, int local)
929 /* Ensure that this buffer is large enough so that we can
930 append "/pack/" without clobbering the stack even if
931 strlen(objdir) were PATH_MAX. */
932 char path[PATH_MAX + 1 + 4 + 1 + 1];
933 int len;
934 DIR *dir;
935 struct dirent *de;
937 sprintf(path, "%s/pack", objdir);
938 len = strlen(path);
939 dir = opendir(path);
940 if (!dir) {
941 if (errno != ENOENT)
942 error("unable to open object pack directory: %s: %s",
943 path, strerror(errno));
944 return;
946 path[len++] = '/';
947 while ((de = readdir(dir)) != NULL) {
948 int namelen = strlen(de->d_name);
949 struct packed_git *p;
951 if (!has_extension(de->d_name, ".idx"))
952 continue;
954 if (len + namelen + 1 > sizeof(path))
955 continue;
957 /* Don't reopen a pack we already have. */
958 strcpy(path + len, de->d_name);
959 for (p = packed_git; p; p = p->next) {
960 if (!memcmp(path, p->pack_name, len + namelen - 4))
961 break;
963 if (p)
964 continue;
965 /* See if it really is a valid .idx file with corresponding
966 * .pack file that we can map.
968 p = add_packed_git(path, len + namelen, local);
969 if (!p)
970 continue;
971 install_packed_git(p);
973 closedir(dir);
976 static int sort_pack(const void *a_, const void *b_)
978 struct packed_git *a = *((struct packed_git **)a_);
979 struct packed_git *b = *((struct packed_git **)b_);
980 int st;
983 * Local packs tend to contain objects specific to our
984 * variant of the project than remote ones. In addition,
985 * remote ones could be on a network mounted filesystem.
986 * Favor local ones for these reasons.
988 st = a->pack_local - b->pack_local;
989 if (st)
990 return -st;
993 * Younger packs tend to contain more recent objects,
994 * and more recent objects tend to get accessed more
995 * often.
997 if (a->mtime < b->mtime)
998 return 1;
999 else if (a->mtime == b->mtime)
1000 return 0;
1001 return -1;
1004 static void rearrange_packed_git(void)
1006 struct packed_git **ary, *p;
1007 int i, n;
1009 for (n = 0, p = packed_git; p; p = p->next)
1010 n++;
1011 if (n < 2)
1012 return;
1014 /* prepare an array of packed_git for easier sorting */
1015 ary = xcalloc(n, sizeof(struct packed_git *));
1016 for (n = 0, p = packed_git; p; p = p->next)
1017 ary[n++] = p;
1019 qsort(ary, n, sizeof(struct packed_git *), sort_pack);
1021 /* link them back again */
1022 for (i = 0; i < n - 1; i++)
1023 ary[i]->next = ary[i + 1];
1024 ary[n - 1]->next = NULL;
1025 packed_git = ary[0];
1027 free(ary);
1030 static int prepare_packed_git_run_once = 0;
1031 void prepare_packed_git(void)
1033 struct alternate_object_database *alt;
1035 if (prepare_packed_git_run_once)
1036 return;
1037 prepare_packed_git_one(get_object_directory(), 1);
1038 prepare_alt_odb();
1039 for (alt = alt_odb_list; alt; alt = alt->next) {
1040 alt->name[-1] = 0;
1041 prepare_packed_git_one(alt->base, 0);
1042 alt->name[-1] = '/';
1044 rearrange_packed_git();
1045 prepare_packed_git_run_once = 1;
1048 void reprepare_packed_git(void)
1050 discard_revindex();
1051 prepare_packed_git_run_once = 0;
1052 prepare_packed_git();
1055 static void mark_bad_packed_object(struct packed_git *p,
1056 const unsigned char *sha1)
1058 unsigned i;
1059 for (i = 0; i < p->num_bad_objects; i++)
1060 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1061 return;
1062 p->bad_object_sha1 = xrealloc(p->bad_object_sha1, 20 * (p->num_bad_objects + 1));
1063 hashcpy(p->bad_object_sha1 + 20 * p->num_bad_objects, sha1);
1064 p->num_bad_objects++;
1067 static int has_packed_and_bad(const unsigned char *sha1)
1069 struct packed_git *p;
1070 unsigned i;
1072 for (p = packed_git; p; p = p->next)
1073 for (i = 0; i < p->num_bad_objects; i++)
1074 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1075 return 1;
1076 return 0;
1079 int check_sha1_signature(const unsigned char *sha1, void *map, unsigned long size, const char *type)
1081 unsigned char real_sha1[20];
1082 hash_sha1_file(map, size, type, real_sha1);
1083 return hashcmp(sha1, real_sha1) ? -1 : 0;
1086 static int git_open_noatime(const char *name)
1088 static int sha1_file_open_flag = O_NOATIME;
1089 int fd = open(name, O_RDONLY | sha1_file_open_flag);
1091 /* Might the failure be due to O_NOATIME? */
1092 if (fd < 0 && errno != ENOENT && sha1_file_open_flag) {
1093 fd = open(name, O_RDONLY);
1094 if (fd >= 0)
1095 sha1_file_open_flag = 0;
1097 return fd;
1100 static int open_sha1_file(const unsigned char *sha1)
1102 int fd;
1103 char *name = sha1_file_name(sha1);
1104 struct alternate_object_database *alt;
1106 fd = git_open_noatime(name);
1107 if (fd >= 0)
1108 return fd;
1110 prepare_alt_odb();
1111 errno = ENOENT;
1112 for (alt = alt_odb_list; alt; alt = alt->next) {
1113 name = alt->name;
1114 fill_sha1_path(name, sha1);
1115 fd = git_open_noatime(alt->base);
1116 if (fd >= 0)
1117 return fd;
1119 return -1;
1122 static void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1124 void *map;
1125 int fd;
1127 fd = open_sha1_file(sha1);
1128 map = NULL;
1129 if (fd >= 0) {
1130 struct stat st;
1132 if (!fstat(fd, &st)) {
1133 *size = xsize_t(st.st_size);
1134 map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1136 close(fd);
1138 return map;
1141 static int legacy_loose_object(unsigned char *map)
1143 unsigned int word;
1146 * Is it a zlib-compressed buffer? If so, the first byte
1147 * must be 0x78 (15-bit window size, deflated), and the
1148 * first 16-bit word is evenly divisible by 31
1150 word = (map[0] << 8) + map[1];
1151 if (map[0] == 0x78 && !(word % 31))
1152 return 1;
1153 else
1154 return 0;
1157 unsigned long unpack_object_header_buffer(const unsigned char *buf,
1158 unsigned long len, enum object_type *type, unsigned long *sizep)
1160 unsigned shift;
1161 unsigned char c;
1162 unsigned long size;
1163 unsigned long used = 0;
1165 c = buf[used++];
1166 *type = (c >> 4) & 7;
1167 size = c & 15;
1168 shift = 4;
1169 while (c & 0x80) {
1170 if (len <= used || sizeof(long) * 8 <= shift) {
1171 error("bad object header");
1172 return 0;
1174 c = buf[used++];
1175 size += (c & 0x7f) << shift;
1176 shift += 7;
1178 *sizep = size;
1179 return used;
1182 static int unpack_sha1_header(z_stream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
1184 unsigned long size, used;
1185 static const char valid_loose_object_type[8] = {
1186 0, /* OBJ_EXT */
1187 1, 1, 1, 1, /* "commit", "tree", "blob", "tag" */
1188 0, /* "delta" and others are invalid in a loose object */
1190 enum object_type type;
1192 /* Get the data stream */
1193 memset(stream, 0, sizeof(*stream));
1194 stream->next_in = map;
1195 stream->avail_in = mapsize;
1196 stream->next_out = buffer;
1197 stream->avail_out = bufsiz;
1199 if (legacy_loose_object(map)) {
1200 git_inflate_init(stream);
1201 return git_inflate(stream, 0);
1206 * There used to be a second loose object header format which
1207 * was meant to mimic the in-pack format, allowing for direct
1208 * copy of the object data. This format turned up not to be
1209 * really worth it and we don't write it any longer. But we
1210 * can still read it.
1212 used = unpack_object_header_buffer(map, mapsize, &type, &size);
1213 if (!used || !valid_loose_object_type[type])
1214 return -1;
1215 map += used;
1216 mapsize -= used;
1218 /* Set up the stream for the rest.. */
1219 stream->next_in = map;
1220 stream->avail_in = mapsize;
1221 git_inflate_init(stream);
1223 /* And generate the fake traditional header */
1224 stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu",
1225 typename(type), size);
1226 return 0;
1229 static void *unpack_sha1_rest(z_stream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1231 int bytes = strlen(buffer) + 1;
1232 unsigned char *buf = xmalloc(1+size);
1233 unsigned long n;
1234 int status = Z_OK;
1236 n = stream->total_out - bytes;
1237 if (n > size)
1238 n = size;
1239 memcpy(buf, (char *) buffer + bytes, n);
1240 bytes = n;
1241 if (bytes <= size) {
1243 * The above condition must be (bytes <= size), not
1244 * (bytes < size). In other words, even though we
1245 * expect no more output and set avail_out to zer0,
1246 * the input zlib stream may have bytes that express
1247 * "this concludes the stream", and we *do* want to
1248 * eat that input.
1250 * Otherwise we would not be able to test that we
1251 * consumed all the input to reach the expected size;
1252 * we also want to check that zlib tells us that all
1253 * went well with status == Z_STREAM_END at the end.
1255 stream->next_out = buf + bytes;
1256 stream->avail_out = size - bytes;
1257 while (status == Z_OK)
1258 status = git_inflate(stream, Z_FINISH);
1260 buf[size] = 0;
1261 if (status == Z_STREAM_END && !stream->avail_in) {
1262 git_inflate_end(stream);
1263 return buf;
1266 if (status < 0)
1267 error("corrupt loose object '%s'", sha1_to_hex(sha1));
1268 else if (stream->avail_in)
1269 error("garbage at end of loose object '%s'",
1270 sha1_to_hex(sha1));
1271 free(buf);
1272 return NULL;
1276 * We used to just use "sscanf()", but that's actually way
1277 * too permissive for what we want to check. So do an anal
1278 * object header parse by hand.
1280 static int parse_sha1_header(const char *hdr, unsigned long *sizep)
1282 char type[10];
1283 int i;
1284 unsigned long size;
1287 * The type can be at most ten bytes (including the
1288 * terminating '\0' that we add), and is followed by
1289 * a space.
1291 i = 0;
1292 for (;;) {
1293 char c = *hdr++;
1294 if (c == ' ')
1295 break;
1296 type[i++] = c;
1297 if (i >= sizeof(type))
1298 return -1;
1300 type[i] = 0;
1303 * The length must follow immediately, and be in canonical
1304 * decimal format (ie "010" is not valid).
1306 size = *hdr++ - '0';
1307 if (size > 9)
1308 return -1;
1309 if (size) {
1310 for (;;) {
1311 unsigned long c = *hdr - '0';
1312 if (c > 9)
1313 break;
1314 hdr++;
1315 size = size * 10 + c;
1318 *sizep = size;
1321 * The length must be followed by a zero byte
1323 return *hdr ? -1 : type_from_string(type);
1326 static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1328 int ret;
1329 z_stream stream;
1330 char hdr[8192];
1332 ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1333 if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1334 return NULL;
1336 return unpack_sha1_rest(&stream, hdr, *size, sha1);
1339 unsigned long get_size_from_delta(struct packed_git *p,
1340 struct pack_window **w_curs,
1341 off_t curpos)
1343 const unsigned char *data;
1344 unsigned char delta_head[20], *in;
1345 z_stream stream;
1346 int st;
1348 memset(&stream, 0, sizeof(stream));
1349 stream.next_out = delta_head;
1350 stream.avail_out = sizeof(delta_head);
1352 git_inflate_init(&stream);
1353 do {
1354 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1355 stream.next_in = in;
1356 st = git_inflate(&stream, Z_FINISH);
1357 curpos += stream.next_in - in;
1358 } while ((st == Z_OK || st == Z_BUF_ERROR) &&
1359 stream.total_out < sizeof(delta_head));
1360 git_inflate_end(&stream);
1361 if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
1362 error("delta data unpack-initial failed");
1363 return 0;
1366 /* Examine the initial part of the delta to figure out
1367 * the result size.
1369 data = delta_head;
1371 /* ignore base size */
1372 get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1374 /* Read the result size */
1375 return get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1378 static off_t get_delta_base(struct packed_git *p,
1379 struct pack_window **w_curs,
1380 off_t *curpos,
1381 enum object_type type,
1382 off_t delta_obj_offset)
1384 unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1385 off_t base_offset;
1387 /* use_pack() assured us we have [base_info, base_info + 20)
1388 * as a range that we can look at without walking off the
1389 * end of the mapped window. Its actually the hash size
1390 * that is assured. An OFS_DELTA longer than the hash size
1391 * is stupid, as then a REF_DELTA would be smaller to store.
1393 if (type == OBJ_OFS_DELTA) {
1394 unsigned used = 0;
1395 unsigned char c = base_info[used++];
1396 base_offset = c & 127;
1397 while (c & 128) {
1398 base_offset += 1;
1399 if (!base_offset || MSB(base_offset, 7))
1400 return 0; /* overflow */
1401 c = base_info[used++];
1402 base_offset = (base_offset << 7) + (c & 127);
1404 base_offset = delta_obj_offset - base_offset;
1405 if (base_offset <= 0 || base_offset >= delta_obj_offset)
1406 return 0; /* out of bound */
1407 *curpos += used;
1408 } else if (type == OBJ_REF_DELTA) {
1409 /* The base entry _must_ be in the same pack */
1410 base_offset = find_pack_entry_one(base_info, p);
1411 *curpos += 20;
1412 } else
1413 die("I am totally screwed");
1414 return base_offset;
1417 /* forward declaration for a mutually recursive function */
1418 static int packed_object_info(struct packed_git *p, off_t offset,
1419 unsigned long *sizep);
1421 static int packed_delta_info(struct packed_git *p,
1422 struct pack_window **w_curs,
1423 off_t curpos,
1424 enum object_type type,
1425 off_t obj_offset,
1426 unsigned long *sizep)
1428 off_t base_offset;
1430 base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1431 if (!base_offset)
1432 return OBJ_BAD;
1433 type = packed_object_info(p, base_offset, NULL);
1434 if (type <= OBJ_NONE) {
1435 struct revindex_entry *revidx;
1436 const unsigned char *base_sha1;
1437 revidx = find_pack_revindex(p, base_offset);
1438 if (!revidx)
1439 return OBJ_BAD;
1440 base_sha1 = nth_packed_object_sha1(p, revidx->nr);
1441 mark_bad_packed_object(p, base_sha1);
1442 type = sha1_object_info(base_sha1, NULL);
1443 if (type <= OBJ_NONE)
1444 return OBJ_BAD;
1447 /* We choose to only get the type of the base object and
1448 * ignore potentially corrupt pack file that expects the delta
1449 * based on a base with a wrong size. This saves tons of
1450 * inflate() calls.
1452 if (sizep) {
1453 *sizep = get_size_from_delta(p, w_curs, curpos);
1454 if (*sizep == 0)
1455 type = OBJ_BAD;
1458 return type;
1461 static int unpack_object_header(struct packed_git *p,
1462 struct pack_window **w_curs,
1463 off_t *curpos,
1464 unsigned long *sizep)
1466 unsigned char *base;
1467 unsigned int left;
1468 unsigned long used;
1469 enum object_type type;
1471 /* use_pack() assures us we have [base, base + 20) available
1472 * as a range that we can look at at. (Its actually the hash
1473 * size that is assured.) With our object header encoding
1474 * the maximum deflated object size is 2^137, which is just
1475 * insane, so we know won't exceed what we have been given.
1477 base = use_pack(p, w_curs, *curpos, &left);
1478 used = unpack_object_header_buffer(base, left, &type, sizep);
1479 if (!used) {
1480 type = OBJ_BAD;
1481 } else
1482 *curpos += used;
1484 return type;
1487 const char *packed_object_info_detail(struct packed_git *p,
1488 off_t obj_offset,
1489 unsigned long *size,
1490 unsigned long *store_size,
1491 unsigned int *delta_chain_length,
1492 unsigned char *base_sha1)
1494 struct pack_window *w_curs = NULL;
1495 off_t curpos;
1496 unsigned long dummy;
1497 unsigned char *next_sha1;
1498 enum object_type type;
1499 struct revindex_entry *revidx;
1501 *delta_chain_length = 0;
1502 curpos = obj_offset;
1503 type = unpack_object_header(p, &w_curs, &curpos, size);
1505 revidx = find_pack_revindex(p, obj_offset);
1506 *store_size = revidx[1].offset - obj_offset;
1508 for (;;) {
1509 switch (type) {
1510 default:
1511 die("pack %s contains unknown object type %d",
1512 p->pack_name, type);
1513 case OBJ_COMMIT:
1514 case OBJ_TREE:
1515 case OBJ_BLOB:
1516 case OBJ_TAG:
1517 unuse_pack(&w_curs);
1518 return typename(type);
1519 case OBJ_OFS_DELTA:
1520 obj_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
1521 if (!obj_offset)
1522 die("pack %s contains bad delta base reference of type %s",
1523 p->pack_name, typename(type));
1524 if (*delta_chain_length == 0) {
1525 revidx = find_pack_revindex(p, obj_offset);
1526 hashcpy(base_sha1, nth_packed_object_sha1(p, revidx->nr));
1528 break;
1529 case OBJ_REF_DELTA:
1530 next_sha1 = use_pack(p, &w_curs, curpos, NULL);
1531 if (*delta_chain_length == 0)
1532 hashcpy(base_sha1, next_sha1);
1533 obj_offset = find_pack_entry_one(next_sha1, p);
1534 break;
1536 (*delta_chain_length)++;
1537 curpos = obj_offset;
1538 type = unpack_object_header(p, &w_curs, &curpos, &dummy);
1542 static int packed_object_info(struct packed_git *p, off_t obj_offset,
1543 unsigned long *sizep)
1545 struct pack_window *w_curs = NULL;
1546 unsigned long size;
1547 off_t curpos = obj_offset;
1548 enum object_type type;
1550 type = unpack_object_header(p, &w_curs, &curpos, &size);
1552 switch (type) {
1553 case OBJ_OFS_DELTA:
1554 case OBJ_REF_DELTA:
1555 type = packed_delta_info(p, &w_curs, curpos,
1556 type, obj_offset, sizep);
1557 break;
1558 case OBJ_COMMIT:
1559 case OBJ_TREE:
1560 case OBJ_BLOB:
1561 case OBJ_TAG:
1562 if (sizep)
1563 *sizep = size;
1564 break;
1565 default:
1566 error("unknown object type %i at offset %"PRIuMAX" in %s",
1567 type, (uintmax_t)obj_offset, p->pack_name);
1568 type = OBJ_BAD;
1570 unuse_pack(&w_curs);
1571 return type;
1574 static void *unpack_compressed_entry(struct packed_git *p,
1575 struct pack_window **w_curs,
1576 off_t curpos,
1577 unsigned long size)
1579 int st;
1580 z_stream stream;
1581 unsigned char *buffer, *in;
1583 buffer = xmalloc(size + 1);
1584 buffer[size] = 0;
1585 memset(&stream, 0, sizeof(stream));
1586 stream.next_out = buffer;
1587 stream.avail_out = size;
1589 git_inflate_init(&stream);
1590 do {
1591 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1592 stream.next_in = in;
1593 st = git_inflate(&stream, Z_FINISH);
1594 curpos += stream.next_in - in;
1595 } while (st == Z_OK || st == Z_BUF_ERROR);
1596 git_inflate_end(&stream);
1597 if ((st != Z_STREAM_END) || stream.total_out != size) {
1598 free(buffer);
1599 return NULL;
1602 return buffer;
1605 #define MAX_DELTA_CACHE (256)
1607 static size_t delta_base_cached;
1609 static struct delta_base_cache_lru_list {
1610 struct delta_base_cache_lru_list *prev;
1611 struct delta_base_cache_lru_list *next;
1612 } delta_base_cache_lru = { &delta_base_cache_lru, &delta_base_cache_lru };
1614 static struct delta_base_cache_entry {
1615 struct delta_base_cache_lru_list lru;
1616 void *data;
1617 struct packed_git *p;
1618 off_t base_offset;
1619 unsigned long size;
1620 enum object_type type;
1621 } delta_base_cache[MAX_DELTA_CACHE];
1623 static unsigned long pack_entry_hash(struct packed_git *p, off_t base_offset)
1625 unsigned long hash;
1627 hash = (unsigned long)p + (unsigned long)base_offset;
1628 hash += (hash >> 8) + (hash >> 16);
1629 return hash % MAX_DELTA_CACHE;
1632 static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
1633 unsigned long *base_size, enum object_type *type, int keep_cache)
1635 void *ret;
1636 unsigned long hash = pack_entry_hash(p, base_offset);
1637 struct delta_base_cache_entry *ent = delta_base_cache + hash;
1639 ret = ent->data;
1640 if (!ret || ent->p != p || ent->base_offset != base_offset)
1641 return unpack_entry(p, base_offset, type, base_size);
1643 if (!keep_cache) {
1644 ent->data = NULL;
1645 ent->lru.next->prev = ent->lru.prev;
1646 ent->lru.prev->next = ent->lru.next;
1647 delta_base_cached -= ent->size;
1648 } else {
1649 ret = xmemdupz(ent->data, ent->size);
1651 *type = ent->type;
1652 *base_size = ent->size;
1653 return ret;
1656 static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
1658 if (ent->data) {
1659 free(ent->data);
1660 ent->data = NULL;
1661 ent->lru.next->prev = ent->lru.prev;
1662 ent->lru.prev->next = ent->lru.next;
1663 delta_base_cached -= ent->size;
1667 void clear_delta_base_cache(void)
1669 unsigned long p;
1670 for (p = 0; p < MAX_DELTA_CACHE; p++)
1671 release_delta_base_cache(&delta_base_cache[p]);
1674 static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
1675 void *base, unsigned long base_size, enum object_type type)
1677 unsigned long hash = pack_entry_hash(p, base_offset);
1678 struct delta_base_cache_entry *ent = delta_base_cache + hash;
1679 struct delta_base_cache_lru_list *lru;
1681 release_delta_base_cache(ent);
1682 delta_base_cached += base_size;
1684 for (lru = delta_base_cache_lru.next;
1685 delta_base_cached > delta_base_cache_limit
1686 && lru != &delta_base_cache_lru;
1687 lru = lru->next) {
1688 struct delta_base_cache_entry *f = (void *)lru;
1689 if (f->type == OBJ_BLOB)
1690 release_delta_base_cache(f);
1692 for (lru = delta_base_cache_lru.next;
1693 delta_base_cached > delta_base_cache_limit
1694 && lru != &delta_base_cache_lru;
1695 lru = lru->next) {
1696 struct delta_base_cache_entry *f = (void *)lru;
1697 release_delta_base_cache(f);
1700 ent->p = p;
1701 ent->base_offset = base_offset;
1702 ent->type = type;
1703 ent->data = base;
1704 ent->size = base_size;
1705 ent->lru.next = &delta_base_cache_lru;
1706 ent->lru.prev = delta_base_cache_lru.prev;
1707 delta_base_cache_lru.prev->next = &ent->lru;
1708 delta_base_cache_lru.prev = &ent->lru;
1711 static void *read_object(const unsigned char *sha1, enum object_type *type,
1712 unsigned long *size);
1714 static void *unpack_delta_entry(struct packed_git *p,
1715 struct pack_window **w_curs,
1716 off_t curpos,
1717 unsigned long delta_size,
1718 off_t obj_offset,
1719 enum object_type *type,
1720 unsigned long *sizep)
1722 void *delta_data, *result, *base;
1723 unsigned long base_size;
1724 off_t base_offset;
1726 base_offset = get_delta_base(p, w_curs, &curpos, *type, obj_offset);
1727 if (!base_offset) {
1728 error("failed to validate delta base reference "
1729 "at offset %"PRIuMAX" from %s",
1730 (uintmax_t)curpos, p->pack_name);
1731 return NULL;
1733 unuse_pack(w_curs);
1734 base = cache_or_unpack_entry(p, base_offset, &base_size, type, 0);
1735 if (!base) {
1737 * We're probably in deep shit, but let's try to fetch
1738 * the required base anyway from another pack or loose.
1739 * This is costly but should happen only in the presence
1740 * of a corrupted pack, and is better than failing outright.
1742 struct revindex_entry *revidx;
1743 const unsigned char *base_sha1;
1744 revidx = find_pack_revindex(p, base_offset);
1745 if (!revidx)
1746 return NULL;
1747 base_sha1 = nth_packed_object_sha1(p, revidx->nr);
1748 error("failed to read delta base object %s"
1749 " at offset %"PRIuMAX" from %s",
1750 sha1_to_hex(base_sha1), (uintmax_t)base_offset,
1751 p->pack_name);
1752 mark_bad_packed_object(p, base_sha1);
1753 base = read_object(base_sha1, type, &base_size);
1754 if (!base)
1755 return NULL;
1758 delta_data = unpack_compressed_entry(p, w_curs, curpos, delta_size);
1759 if (!delta_data) {
1760 error("failed to unpack compressed delta "
1761 "at offset %"PRIuMAX" from %s",
1762 (uintmax_t)curpos, p->pack_name);
1763 free(base);
1764 return NULL;
1766 result = patch_delta(base, base_size,
1767 delta_data, delta_size,
1768 sizep);
1769 if (!result)
1770 die("failed to apply delta");
1771 free(delta_data);
1772 add_delta_base_cache(p, base_offset, base, base_size, *type);
1773 return result;
1776 int do_check_packed_object_crc;
1778 void *unpack_entry(struct packed_git *p, off_t obj_offset,
1779 enum object_type *type, unsigned long *sizep)
1781 struct pack_window *w_curs = NULL;
1782 off_t curpos = obj_offset;
1783 void *data;
1785 if (do_check_packed_object_crc && p->index_version > 1) {
1786 struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
1787 unsigned long len = revidx[1].offset - obj_offset;
1788 if (check_pack_crc(p, &w_curs, obj_offset, len, revidx->nr)) {
1789 const unsigned char *sha1 =
1790 nth_packed_object_sha1(p, revidx->nr);
1791 error("bad packed object CRC for %s",
1792 sha1_to_hex(sha1));
1793 mark_bad_packed_object(p, sha1);
1794 unuse_pack(&w_curs);
1795 return NULL;
1799 *type = unpack_object_header(p, &w_curs, &curpos, sizep);
1800 switch (*type) {
1801 case OBJ_OFS_DELTA:
1802 case OBJ_REF_DELTA:
1803 data = unpack_delta_entry(p, &w_curs, curpos, *sizep,
1804 obj_offset, type, sizep);
1805 break;
1806 case OBJ_COMMIT:
1807 case OBJ_TREE:
1808 case OBJ_BLOB:
1809 case OBJ_TAG:
1810 data = unpack_compressed_entry(p, &w_curs, curpos, *sizep);
1811 break;
1812 default:
1813 data = NULL;
1814 error("unknown object type %i at offset %"PRIuMAX" in %s",
1815 *type, (uintmax_t)obj_offset, p->pack_name);
1817 unuse_pack(&w_curs);
1818 return data;
1821 const unsigned char *nth_packed_object_sha1(struct packed_git *p,
1822 uint32_t n)
1824 const unsigned char *index = p->index_data;
1825 if (!index) {
1826 if (open_pack_index(p))
1827 return NULL;
1828 index = p->index_data;
1830 if (n >= p->num_objects)
1831 return NULL;
1832 index += 4 * 256;
1833 if (p->index_version == 1) {
1834 return index + 24 * n + 4;
1835 } else {
1836 index += 8;
1837 return index + 20 * n;
1841 off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
1843 const unsigned char *index = p->index_data;
1844 index += 4 * 256;
1845 if (p->index_version == 1) {
1846 return ntohl(*((uint32_t *)(index + 24 * n)));
1847 } else {
1848 uint32_t off;
1849 index += 8 + p->num_objects * (20 + 4);
1850 off = ntohl(*((uint32_t *)(index + 4 * n)));
1851 if (!(off & 0x80000000))
1852 return off;
1853 index += p->num_objects * 4 + (off & 0x7fffffff) * 8;
1854 return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
1855 ntohl(*((uint32_t *)(index + 4)));
1859 off_t find_pack_entry_one(const unsigned char *sha1,
1860 struct packed_git *p)
1862 const uint32_t *level1_ofs = p->index_data;
1863 const unsigned char *index = p->index_data;
1864 unsigned hi, lo, stride;
1865 static int use_lookup = -1;
1866 static int debug_lookup = -1;
1868 if (debug_lookup < 0)
1869 debug_lookup = !!getenv("GIT_DEBUG_LOOKUP");
1871 if (!index) {
1872 if (open_pack_index(p))
1873 return 0;
1874 level1_ofs = p->index_data;
1875 index = p->index_data;
1877 if (p->index_version > 1) {
1878 level1_ofs += 2;
1879 index += 8;
1881 index += 4 * 256;
1882 hi = ntohl(level1_ofs[*sha1]);
1883 lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
1884 if (p->index_version > 1) {
1885 stride = 20;
1886 } else {
1887 stride = 24;
1888 index += 4;
1891 if (debug_lookup)
1892 printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
1893 sha1[0], sha1[1], sha1[2], lo, hi, p->num_objects);
1895 if (use_lookup < 0)
1896 use_lookup = !!getenv("GIT_USE_LOOKUP");
1897 if (use_lookup) {
1898 int pos = sha1_entry_pos(index, stride, 0,
1899 lo, hi, p->num_objects, sha1);
1900 if (pos < 0)
1901 return 0;
1902 return nth_packed_object_offset(p, pos);
1905 do {
1906 unsigned mi = (lo + hi) / 2;
1907 int cmp = hashcmp(index + mi * stride, sha1);
1909 if (debug_lookup)
1910 printf("lo %u hi %u rg %u mi %u\n",
1911 lo, hi, hi - lo, mi);
1912 if (!cmp)
1913 return nth_packed_object_offset(p, mi);
1914 if (cmp > 0)
1915 hi = mi;
1916 else
1917 lo = mi+1;
1918 } while (lo < hi);
1919 return 0;
1922 int matches_pack_name(struct packed_git *p, const char *name)
1924 const char *last_c, *c;
1926 if (!strcmp(p->pack_name, name))
1927 return 1;
1929 for (c = p->pack_name, last_c = c; *c;)
1930 if (*c == '/')
1931 last_c = ++c;
1932 else
1933 ++c;
1934 if (!strcmp(last_c, name))
1935 return 1;
1937 return 0;
1940 static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e, const char **ignore_packed)
1942 static struct packed_git *last_found = (void *)1;
1943 struct packed_git *p;
1944 off_t offset;
1946 prepare_packed_git();
1947 if (!packed_git)
1948 return 0;
1949 p = (last_found == (void *)1) ? packed_git : last_found;
1951 do {
1952 if (ignore_packed) {
1953 const char **ig;
1954 for (ig = ignore_packed; *ig; ig++)
1955 if (matches_pack_name(p, *ig))
1956 break;
1957 if (*ig)
1958 goto next;
1961 if (p->num_bad_objects) {
1962 unsigned i;
1963 for (i = 0; i < p->num_bad_objects; i++)
1964 if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1965 goto next;
1968 offset = find_pack_entry_one(sha1, p);
1969 if (offset) {
1971 * We are about to tell the caller where they can
1972 * locate the requested object. We better make
1973 * sure the packfile is still here and can be
1974 * accessed before supplying that answer, as
1975 * it may have been deleted since the index
1976 * was loaded!
1978 if (p->pack_fd == -1 && open_packed_git(p)) {
1979 error("packfile %s cannot be accessed", p->pack_name);
1980 goto next;
1982 e->offset = offset;
1983 e->p = p;
1984 hashcpy(e->sha1, sha1);
1985 last_found = p;
1986 return 1;
1989 next:
1990 if (p == last_found)
1991 p = packed_git;
1992 else
1993 p = p->next;
1994 if (p == last_found)
1995 p = p->next;
1996 } while (p);
1997 return 0;
2000 struct packed_git *find_sha1_pack(const unsigned char *sha1,
2001 struct packed_git *packs)
2003 struct packed_git *p;
2005 for (p = packs; p; p = p->next) {
2006 if (find_pack_entry_one(sha1, p))
2007 return p;
2009 return NULL;
2013 static int sha1_loose_object_info(const unsigned char *sha1, unsigned long *sizep)
2015 int status;
2016 unsigned long mapsize, size;
2017 void *map;
2018 z_stream stream;
2019 char hdr[32];
2021 map = map_sha1_file(sha1, &mapsize);
2022 if (!map)
2023 return error("unable to find %s", sha1_to_hex(sha1));
2024 if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
2025 status = error("unable to unpack %s header",
2026 sha1_to_hex(sha1));
2027 else if ((status = parse_sha1_header(hdr, &size)) < 0)
2028 status = error("unable to parse %s header", sha1_to_hex(sha1));
2029 else if (sizep)
2030 *sizep = size;
2031 git_inflate_end(&stream);
2032 munmap(map, mapsize);
2033 return status;
2036 int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
2038 struct pack_entry e;
2039 int status;
2041 if (!find_pack_entry(sha1, &e, NULL)) {
2042 /* Most likely it's a loose object. */
2043 status = sha1_loose_object_info(sha1, sizep);
2044 if (status >= 0)
2045 return status;
2047 /* Not a loose object; someone else may have just packed it. */
2048 reprepare_packed_git();
2049 if (!find_pack_entry(sha1, &e, NULL))
2050 return status;
2053 status = packed_object_info(e.p, e.offset, sizep);
2054 if (status < 0) {
2055 mark_bad_packed_object(e.p, sha1);
2056 status = sha1_object_info(sha1, sizep);
2059 return status;
2062 static void *read_packed_sha1(const unsigned char *sha1,
2063 enum object_type *type, unsigned long *size)
2065 struct pack_entry e;
2066 void *data;
2068 if (!find_pack_entry(sha1, &e, NULL))
2069 return NULL;
2070 data = cache_or_unpack_entry(e.p, e.offset, size, type, 1);
2071 if (!data) {
2073 * We're probably in deep shit, but let's try to fetch
2074 * the required object anyway from another pack or loose.
2075 * This should happen only in the presence of a corrupted
2076 * pack, and is better than failing outright.
2078 error("failed to read object %s at offset %"PRIuMAX" from %s",
2079 sha1_to_hex(sha1), (uintmax_t)e.offset, e.p->pack_name);
2080 mark_bad_packed_object(e.p, sha1);
2081 data = read_object(sha1, type, size);
2083 return data;
2087 * This is meant to hold a *small* number of objects that you would
2088 * want read_sha1_file() to be able to return, but yet you do not want
2089 * to write them into the object store (e.g. a browse-only
2090 * application).
2092 static struct cached_object {
2093 unsigned char sha1[20];
2094 enum object_type type;
2095 void *buf;
2096 unsigned long size;
2097 } *cached_objects;
2098 static int cached_object_nr, cached_object_alloc;
2100 static struct cached_object empty_tree = {
2101 EMPTY_TREE_SHA1_BIN,
2102 OBJ_TREE,
2107 static struct cached_object *find_cached_object(const unsigned char *sha1)
2109 int i;
2110 struct cached_object *co = cached_objects;
2112 for (i = 0; i < cached_object_nr; i++, co++) {
2113 if (!hashcmp(co->sha1, sha1))
2114 return co;
2116 if (!hashcmp(sha1, empty_tree.sha1))
2117 return &empty_tree;
2118 return NULL;
2121 int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
2122 unsigned char *sha1)
2124 struct cached_object *co;
2126 hash_sha1_file(buf, len, typename(type), sha1);
2127 if (has_sha1_file(sha1) || find_cached_object(sha1))
2128 return 0;
2129 if (cached_object_alloc <= cached_object_nr) {
2130 cached_object_alloc = alloc_nr(cached_object_alloc);
2131 cached_objects = xrealloc(cached_objects,
2132 sizeof(*cached_objects) *
2133 cached_object_alloc);
2135 co = &cached_objects[cached_object_nr++];
2136 co->size = len;
2137 co->type = type;
2138 co->buf = xmalloc(len);
2139 memcpy(co->buf, buf, len);
2140 hashcpy(co->sha1, sha1);
2141 return 0;
2144 static void *read_object(const unsigned char *sha1, enum object_type *type,
2145 unsigned long *size)
2147 unsigned long mapsize;
2148 void *map, *buf;
2149 struct cached_object *co;
2151 co = find_cached_object(sha1);
2152 if (co) {
2153 *type = co->type;
2154 *size = co->size;
2155 return xmemdupz(co->buf, co->size);
2158 buf = read_packed_sha1(sha1, type, size);
2159 if (buf)
2160 return buf;
2161 map = map_sha1_file(sha1, &mapsize);
2162 if (map) {
2163 buf = unpack_sha1_file(map, mapsize, type, size, sha1);
2164 munmap(map, mapsize);
2165 return buf;
2167 reprepare_packed_git();
2168 return read_packed_sha1(sha1, type, size);
2171 void *read_sha1_file(const unsigned char *sha1, enum object_type *type,
2172 unsigned long *size)
2174 void *data = read_object(sha1, type, size);
2175 /* legacy behavior is to die on corrupted objects */
2176 if (!data && (has_loose_object(sha1) || has_packed_and_bad(sha1)))
2177 die("object %s is corrupted", sha1_to_hex(sha1));
2178 return data;
2181 void *read_object_with_reference(const unsigned char *sha1,
2182 const char *required_type_name,
2183 unsigned long *size,
2184 unsigned char *actual_sha1_return)
2186 enum object_type type, required_type;
2187 void *buffer;
2188 unsigned long isize;
2189 unsigned char actual_sha1[20];
2191 required_type = type_from_string(required_type_name);
2192 hashcpy(actual_sha1, sha1);
2193 while (1) {
2194 int ref_length = -1;
2195 const char *ref_type = NULL;
2197 buffer = read_sha1_file(actual_sha1, &type, &isize);
2198 if (!buffer)
2199 return NULL;
2200 if (type == required_type) {
2201 *size = isize;
2202 if (actual_sha1_return)
2203 hashcpy(actual_sha1_return, actual_sha1);
2204 return buffer;
2206 /* Handle references */
2207 else if (type == OBJ_COMMIT)
2208 ref_type = "tree ";
2209 else if (type == OBJ_TAG)
2210 ref_type = "object ";
2211 else {
2212 free(buffer);
2213 return NULL;
2215 ref_length = strlen(ref_type);
2217 if (ref_length + 40 > isize ||
2218 memcmp(buffer, ref_type, ref_length) ||
2219 get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
2220 free(buffer);
2221 return NULL;
2223 free(buffer);
2224 /* Now we have the ID of the referred-to object in
2225 * actual_sha1. Check again. */
2229 static void write_sha1_file_prepare(const void *buf, unsigned long len,
2230 const char *type, unsigned char *sha1,
2231 char *hdr, int *hdrlen)
2233 git_SHA_CTX c;
2235 /* Generate the header */
2236 *hdrlen = sprintf(hdr, "%s %lu", type, len)+1;
2238 /* Sha1.. */
2239 git_SHA1_Init(&c);
2240 git_SHA1_Update(&c, hdr, *hdrlen);
2241 git_SHA1_Update(&c, buf, len);
2242 git_SHA1_Final(sha1, &c);
2246 * Move the just written object into its final resting place
2248 int move_temp_to_file(const char *tmpfile, const char *filename)
2250 int ret = 0;
2251 if (link(tmpfile, filename))
2252 ret = errno;
2255 * Coda hack - coda doesn't like cross-directory links,
2256 * so we fall back to a rename, which will mean that it
2257 * won't be able to check collisions, but that's not a
2258 * big deal.
2260 * The same holds for FAT formatted media.
2262 * When this succeeds, we just return 0. We have nothing
2263 * left to unlink.
2265 if (ret && ret != EEXIST) {
2266 if (!rename(tmpfile, filename))
2267 return 0;
2268 ret = errno;
2270 unlink(tmpfile);
2271 if (ret) {
2272 if (ret != EEXIST) {
2273 return error("unable to write sha1 filename %s: %s\n", filename, strerror(ret));
2275 /* FIXME!!! Collision check here ? */
2278 return 0;
2281 static int write_buffer(int fd, const void *buf, size_t len)
2283 if (write_in_full(fd, buf, len) < 0)
2284 return error("file write error (%s)", strerror(errno));
2285 return 0;
2288 int hash_sha1_file(const void *buf, unsigned long len, const char *type,
2289 unsigned char *sha1)
2291 char hdr[32];
2292 int hdrlen;
2293 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2294 return 0;
2297 /* Finalize a file on disk, and close it. */
2298 static void close_sha1_file(int fd)
2300 if (fsync_object_files)
2301 fsync_or_die(fd, "sha1 file");
2302 fchmod(fd, 0444);
2303 if (close(fd) != 0)
2304 die("unable to write sha1 file");
2307 /* Size of directory component, including the ending '/' */
2308 static inline int directory_size(const char *filename)
2310 const char *s = strrchr(filename, '/');
2311 if (!s)
2312 return 0;
2313 return s - filename + 1;
2317 * This creates a temporary file in the same directory as the final
2318 * 'filename'
2320 * We want to avoid cross-directory filename renames, because those
2321 * can have problems on various filesystems (FAT, NFS, Coda).
2323 static int create_tmpfile(char *buffer, size_t bufsiz, const char *filename)
2325 int fd, dirlen = directory_size(filename);
2327 if (dirlen + 20 > bufsiz) {
2328 errno = ENAMETOOLONG;
2329 return -1;
2331 memcpy(buffer, filename, dirlen);
2332 strcpy(buffer + dirlen, "tmp_obj_XXXXXX");
2333 fd = mkstemp(buffer);
2334 if (fd < 0 && dirlen && errno == ENOENT) {
2335 /* Make sure the directory exists */
2336 memcpy(buffer, filename, dirlen);
2337 buffer[dirlen-1] = 0;
2338 if (mkdir(buffer, 0777) || adjust_shared_perm(buffer))
2339 return -1;
2341 /* Try again */
2342 strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX");
2343 fd = mkstemp(buffer);
2345 return fd;
2348 static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
2349 void *buf, unsigned long len, time_t mtime)
2351 int fd, ret;
2352 size_t size;
2353 unsigned char *compressed;
2354 z_stream stream;
2355 char *filename;
2356 static char tmpfile[PATH_MAX];
2358 filename = sha1_file_name(sha1);
2359 fd = create_tmpfile(tmpfile, sizeof(tmpfile), filename);
2360 if (fd < 0) {
2361 if (errno == EACCES)
2362 return error("insufficient permission for adding an object to repository database %s\n", get_object_directory());
2363 else
2364 return error("unable to create temporary sha1 filename %s: %s\n", tmpfile, strerror(errno));
2367 /* Set it up */
2368 memset(&stream, 0, sizeof(stream));
2369 deflateInit(&stream, zlib_compression_level);
2370 size = 8 + deflateBound(&stream, len+hdrlen);
2371 compressed = xmalloc(size);
2373 /* Compress it */
2374 stream.next_out = compressed;
2375 stream.avail_out = size;
2377 /* First header.. */
2378 stream.next_in = (unsigned char *)hdr;
2379 stream.avail_in = hdrlen;
2380 while (deflate(&stream, 0) == Z_OK)
2381 /* nothing */;
2383 /* Then the data itself.. */
2384 stream.next_in = buf;
2385 stream.avail_in = len;
2386 ret = deflate(&stream, Z_FINISH);
2387 if (ret != Z_STREAM_END)
2388 die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
2390 ret = deflateEnd(&stream);
2391 if (ret != Z_OK)
2392 die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
2394 size = stream.total_out;
2396 if (write_buffer(fd, compressed, size) < 0)
2397 die("unable to write sha1 file");
2398 close_sha1_file(fd);
2399 free(compressed);
2401 if (mtime) {
2402 struct utimbuf utb;
2403 utb.actime = mtime;
2404 utb.modtime = mtime;
2405 if (utime(tmpfile, &utb) < 0)
2406 warning("failed utime() on %s: %s",
2407 tmpfile, strerror(errno));
2410 return move_temp_to_file(tmpfile, filename);
2413 int write_sha1_file(void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2415 unsigned char sha1[20];
2416 char hdr[32];
2417 int hdrlen;
2419 /* Normally if we have it in the pack then we do not bother writing
2420 * it out into .git/objects/??/?{38} file.
2422 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2423 if (returnsha1)
2424 hashcpy(returnsha1, sha1);
2425 if (has_sha1_file(sha1))
2426 return 0;
2427 return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
2430 int force_object_loose(const unsigned char *sha1, time_t mtime)
2432 void *buf;
2433 unsigned long len;
2434 enum object_type type;
2435 char hdr[32];
2436 int hdrlen;
2437 int ret;
2439 if (has_loose_object(sha1))
2440 return 0;
2441 buf = read_packed_sha1(sha1, &type, &len);
2442 if (!buf)
2443 return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
2444 hdrlen = sprintf(hdr, "%s %lu", typename(type), len) + 1;
2445 ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
2446 free(buf);
2448 return ret;
2451 int has_pack_index(const unsigned char *sha1)
2453 struct stat st;
2454 if (stat(sha1_pack_index_name(sha1), &st))
2455 return 0;
2456 return 1;
2459 int has_pack_file(const unsigned char *sha1)
2461 struct stat st;
2462 if (stat(sha1_pack_name(sha1), &st))
2463 return 0;
2464 return 1;
2467 int has_sha1_pack(const unsigned char *sha1, const char **ignore_packed)
2469 struct pack_entry e;
2470 return find_pack_entry(sha1, &e, ignore_packed);
2473 int has_sha1_file(const unsigned char *sha1)
2475 struct pack_entry e;
2477 if (find_pack_entry(sha1, &e, NULL))
2478 return 1;
2479 return has_loose_object(sha1);
2482 static int index_mem(unsigned char *sha1, void *buf, size_t size,
2483 int write_object, enum object_type type, const char *path)
2485 int ret, re_allocated = 0;
2487 if (!type)
2488 type = OBJ_BLOB;
2491 * Convert blobs to git internal format
2493 if ((type == OBJ_BLOB) && path) {
2494 struct strbuf nbuf = STRBUF_INIT;
2495 if (convert_to_git(path, buf, size, &nbuf,
2496 write_object ? safe_crlf : 0)) {
2497 buf = strbuf_detach(&nbuf, &size);
2498 re_allocated = 1;
2502 if (write_object)
2503 ret = write_sha1_file(buf, size, typename(type), sha1);
2504 else
2505 ret = hash_sha1_file(buf, size, typename(type), sha1);
2506 if (re_allocated)
2507 free(buf);
2508 return ret;
2511 int index_fd(unsigned char *sha1, int fd, struct stat *st, int write_object,
2512 enum object_type type, const char *path)
2514 int ret;
2515 size_t size = xsize_t(st->st_size);
2517 if (!S_ISREG(st->st_mode)) {
2518 struct strbuf sbuf = STRBUF_INIT;
2519 if (strbuf_read(&sbuf, fd, 4096) >= 0)
2520 ret = index_mem(sha1, sbuf.buf, sbuf.len, write_object,
2521 type, path);
2522 else
2523 ret = -1;
2524 strbuf_release(&sbuf);
2525 } else if (size) {
2526 void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
2527 ret = index_mem(sha1, buf, size, write_object, type, path);
2528 munmap(buf, size);
2529 } else
2530 ret = index_mem(sha1, NULL, size, write_object, type, path);
2531 close(fd);
2532 return ret;
2535 int index_path(unsigned char *sha1, const char *path, struct stat *st, int write_object)
2537 int fd;
2538 struct strbuf sb = STRBUF_INIT;
2540 switch (st->st_mode & S_IFMT) {
2541 case S_IFREG:
2542 fd = open(path, O_RDONLY);
2543 if (fd < 0)
2544 return error("open(\"%s\"): %s", path,
2545 strerror(errno));
2546 if (index_fd(sha1, fd, st, write_object, OBJ_BLOB, path) < 0)
2547 return error("%s: failed to insert into database",
2548 path);
2549 break;
2550 case S_IFLNK:
2551 if (strbuf_readlink(&sb, path, st->st_size)) {
2552 char *errstr = strerror(errno);
2553 return error("readlink(\"%s\"): %s", path,
2554 errstr);
2556 if (!write_object)
2557 hash_sha1_file(sb.buf, sb.len, blob_type, sha1);
2558 else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1))
2559 return error("%s: failed to insert into database",
2560 path);
2561 strbuf_release(&sb);
2562 break;
2563 case S_IFDIR:
2564 return resolve_gitlink_ref(path, "HEAD", sha1);
2565 default:
2566 return error("%s: unsupported file type", path);
2568 return 0;
2571 int read_pack_header(int fd, struct pack_header *header)
2573 if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
2574 /* "eof before pack header was fully read" */
2575 return PH_ERROR_EOF;
2577 if (header->hdr_signature != htonl(PACK_SIGNATURE))
2578 /* "protocol error (pack signature mismatch detected)" */
2579 return PH_ERROR_PACK_SIGNATURE;
2580 if (!pack_version_ok(header->hdr_version))
2581 /* "protocol error (pack version unsupported)" */
2582 return PH_ERROR_PROTOCOL;
2583 return 0;