1/*
2 * GIT - The information manager from hell
3 *
4 * Copyright (C) Linus Torvalds, 2005
5 *
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"
19
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
27
28#ifdef NO_C99_FORMAT
29#define SZ_FMT "lu"
30static unsigned long sz_fmt(size_t s) { return (unsigned long)s; }
31#else
32#define SZ_FMT "zu"
33static size_t sz_fmt(size_t s) { return s; }
34#endif
35
36const unsigned char null_sha1[20];
37
38const 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 */
71};
72
73int get_sha1_hex(const char *hex, unsigned char *sha1)
74{
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;
82 }
83 return 0;
84}
85
86int safe_create_leading_directories(char *path)
87{
88 char *pos = path;
89 struct stat st;
90
91 if (is_absolute_path(path))
92 pos++;
93
94 while (pos) {
95 pos = strchr(pos, '/');
96 if (!pos)
97 break;
98 *pos = 0;
99 if (!stat(path, &st)) {
100 /* path exists */
101 if (!S_ISDIR(st.st_mode)) {
102 *pos = '/';
103 return -3;
104 }
105 }
106 else if (mkdir(path, 0777)) {
107 *pos = '/';
108 return -1;
109 }
110 else if (adjust_shared_perm(path)) {
111 *pos = '/';
112 return -2;
113 }
114 *pos++ = '/';
115 }
116 return 0;
117}
118
119char * sha1_to_hex(const unsigned char *sha1)
120{
121 static int bufno;
122 static char hexbuffer[4][50];
123 static const char hex[] = "0123456789abcdef";
124 char *buffer = hexbuffer[3 & ++bufno], *buf = buffer;
125 int i;
126
127 for (i = 0; i < 20; i++) {
128 unsigned int val = *sha1++;
129 *buf++ = hex[val >> 4];
130 *buf++ = hex[val & 0xf];
131 }
132 *buf = '\0';
133
134 return buffer;
135}
136
137static void fill_sha1_path(char *pathbuf, const unsigned char *sha1)
138{
139 int i;
140 for (i = 0; i < 20; i++) {
141 static char hex[] = "0123456789abcdef";
142 unsigned int val = sha1[i];
143 char *pos = pathbuf + i*2 + (i > 0);
144 *pos++ = hex[val >> 4];
145 *pos = hex[val & 0xf];
146 }
147}
148
149/*
150 * NOTE! This returns a statically allocated buffer, so you have to be
151 * careful about using it. Do an "xstrdup()" if you need to save the
152 * filename.
153 *
154 * Also note that this returns the location for creating. Reading
155 * SHA1 file can happen from any alternate directory listed in the
156 * DB_ENVIRONMENT environment variable if it is not found in
157 * the primary object database.
158 */
159char *sha1_file_name(const unsigned char *sha1)
160{
161 static char *name, *base;
162
163 if (!base) {
164 const char *sha1_file_directory = get_object_directory();
165 int len = strlen(sha1_file_directory);
166 base = xmalloc(len + 60);
167 memcpy(base, sha1_file_directory, len);
168 memset(base+len, 0, 60);
169 base[len] = '/';
170 base[len+3] = '/';
171 name = base + len + 1;
172 }
173 fill_sha1_path(name, sha1);
174 return base;
175}
176
177static char *sha1_get_pack_name(const unsigned char *sha1,
178 char **name, char **base, const char *which)
179{
180 static const char hex[] = "0123456789abcdef";
181 char *buf;
182 int i;
183
184 if (!*base) {
185 const char *sha1_file_directory = get_object_directory();
186 int len = strlen(sha1_file_directory);
187 *base = xmalloc(len + 60);
188 sprintf(*base, "%s/pack/pack-1234567890123456789012345678901234567890.%s",
189 sha1_file_directory, which);
190 *name = *base + len + 11;
191 }
192
193 buf = *name;
194
195 for (i = 0; i < 20; i++) {
196 unsigned int val = *sha1++;
197 *buf++ = hex[val >> 4];
198 *buf++ = hex[val & 0xf];
199 }
200
201 return *base;
202}
203
204char *sha1_pack_name(const unsigned char *sha1)
205{
206 static char *name, *base;
207
208 return sha1_get_pack_name(sha1, &name, &base, "pack");
209}
210
211char *sha1_pack_index_name(const unsigned char *sha1)
212{
213 static char *name, *base;
214
215 return sha1_get_pack_name(sha1, &name, &base, "idx");
216}
217
218struct alternate_object_database *alt_odb_list;
219static struct alternate_object_database **alt_odb_tail;
220
221static void read_info_alternates(const char * alternates, int depth);
222
223/*
224 * Prepare alternate object database registry.
225 *
226 * The variable alt_odb_list points at the list of struct
227 * alternate_object_database. The elements on this list come from
228 * non-empty elements from colon separated ALTERNATE_DB_ENVIRONMENT
229 * environment variable, and $GIT_OBJECT_DIRECTORY/info/alternates,
230 * whose contents is similar to that environment variable but can be
231 * LF separated. Its base points at a statically allocated buffer that
232 * contains "/the/directory/corresponding/to/.git/objects/...", while
233 * its name points just after the slash at the end of ".git/objects/"
234 * in the example above, and has enough space to hold 40-byte hex
235 * SHA1, an extra slash for the first level indirection, and the
236 * terminating NUL.
237 */
238static int link_alt_odb_entry(const char * entry, int len, const char * relative_base, int depth)
239{
240 struct stat st;
241 const char *objdir = get_object_directory();
242 struct alternate_object_database *ent;
243 struct alternate_object_database *alt;
244 /* 43 = 40-byte + 2 '/' + terminating NUL */
245 int pfxlen = len;
246 int entlen = pfxlen + 43;
247 int base_len = -1;
248
249 if (!is_absolute_path(entry) && relative_base) {
250 /* Relative alt-odb */
251 if (base_len < 0)
252 base_len = strlen(relative_base) + 1;
253 entlen += base_len;
254 pfxlen += base_len;
255 }
256 ent = xmalloc(sizeof(*ent) + entlen);
257
258 if (!is_absolute_path(entry) && relative_base) {
259 memcpy(ent->base, relative_base, base_len - 1);
260 ent->base[base_len - 1] = '/';
261 memcpy(ent->base + base_len, entry, len);
262 }
263 else
264 memcpy(ent->base, entry, pfxlen);
265
266 ent->name = ent->base + pfxlen + 1;
267 ent->base[pfxlen + 3] = '/';
268 ent->base[pfxlen] = ent->base[entlen-1] = 0;
269
270 /* Detect cases where alternate disappeared */
271 if (stat(ent->base, &st) || !S_ISDIR(st.st_mode)) {
272 error("object directory %s does not exist; "
273 "check .git/objects/info/alternates.",
274 ent->base);
275 free(ent);
276 return -1;
277 }
278
279 /* Prevent the common mistake of listing the same
280 * thing twice, or object directory itself.
281 */
282 for (alt = alt_odb_list; alt; alt = alt->next) {
283 if (!memcmp(ent->base, alt->base, pfxlen)) {
284 free(ent);
285 return -1;
286 }
287 }
288 if (!memcmp(ent->base, objdir, pfxlen)) {
289 free(ent);
290 return -1;
291 }
292
293 /* add the alternate entry */
294 *alt_odb_tail = ent;
295 alt_odb_tail = &(ent->next);
296 ent->next = NULL;
297
298 /* recursively add alternates */
299 read_info_alternates(ent->base, depth + 1);
300
301 ent->base[pfxlen] = '/';
302
303 return 0;
304}
305
306static void link_alt_odb_entries(const char *alt, const char *ep, int sep,
307 const char *relative_base, int depth)
308{
309 const char *cp, *last;
310
311 if (depth > 5) {
312 error("%s: ignoring alternate object stores, nesting too deep.",
313 relative_base);
314 return;
315 }
316
317 last = alt;
318 while (last < ep) {
319 cp = last;
320 if (cp < ep && *cp == '#') {
321 while (cp < ep && *cp != sep)
322 cp++;
323 last = cp + 1;
324 continue;
325 }
326 while (cp < ep && *cp != sep)
327 cp++;
328 if (last != cp) {
329 if (!is_absolute_path(last) && depth) {
330 error("%s: ignoring relative alternate object store %s",
331 relative_base, last);
332 } else {
333 link_alt_odb_entry(last, cp - last,
334 relative_base, depth);
335 }
336 }
337 while (cp < ep && *cp == sep)
338 cp++;
339 last = cp;
340 }
341}
342
343static void read_info_alternates(const char * relative_base, int depth)
344{
345 char *map;
346 size_t mapsz;
347 struct stat st;
348 const char alt_file_name[] = "info/alternates";
349 /* Given that relative_base is no longer than PATH_MAX,
350 ensure that "path" has enough space to append "/", the
351 file name, "info/alternates", and a trailing NUL. */
352 char path[PATH_MAX + 1 + sizeof alt_file_name];
353 int fd;
354
355 sprintf(path, "%s/%s", relative_base, alt_file_name);
356 fd = open(path, O_RDONLY);
357 if (fd < 0)
358 return;
359 if (fstat(fd, &st) || (st.st_size == 0)) {
360 close(fd);
361 return;
362 }
363 mapsz = xsize_t(st.st_size);
364 map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
365 close(fd);
366
367 link_alt_odb_entries(map, map + mapsz, '\n', relative_base, depth);
368
369 munmap(map, mapsz);
370}
371
372void add_to_alternates_file(const char *reference)
373{
374 struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
375 int fd = hold_lock_file_for_append(lock, git_path("objects/info/alternates"), 1);
376 char *alt = mkpath("%s/objects\n", reference);
377 write_or_die(fd, alt, strlen(alt));
378 if (commit_lock_file(lock))
379 die("could not close alternates file");
380 if (alt_odb_tail)
381 link_alt_odb_entries(alt, alt + strlen(alt), '\n', NULL, 0);
382}
383
384void prepare_alt_odb(void)
385{
386 const char *alt;
387
388 if (alt_odb_tail)
389 return;
390
391 alt = getenv(ALTERNATE_DB_ENVIRONMENT);
392 if (!alt) alt = "";
393
394 alt_odb_tail = &alt_odb_list;
395 link_alt_odb_entries(alt, alt + strlen(alt), ':', NULL, 0);
396
397 read_info_alternates(get_object_directory(), 0);
398}
399
400static int has_loose_object(const unsigned char *sha1)
401{
402 char *name = sha1_file_name(sha1);
403 struct alternate_object_database *alt;
404
405 if (!access(name, F_OK))
406 return 1;
407 prepare_alt_odb();
408 for (alt = alt_odb_list; alt; alt = alt->next) {
409 name = alt->name;
410 fill_sha1_path(name, sha1);
411 if (!access(alt->base, F_OK))
412 return 1;
413 }
414 return 0;
415}
416
417static unsigned int pack_used_ctr;
418static unsigned int pack_mmap_calls;
419static unsigned int peak_pack_open_windows;
420static unsigned int pack_open_windows;
421static size_t peak_pack_mapped;
422static size_t pack_mapped;
423struct packed_git *packed_git;
424
425void pack_report(void)
426{
427 fprintf(stderr,
428 "pack_report: getpagesize() = %10" SZ_FMT "\n"
429 "pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
430 "pack_report: core.packedGitLimit = %10" SZ_FMT "\n",
431 sz_fmt(getpagesize()),
432 sz_fmt(packed_git_window_size),
433 sz_fmt(packed_git_limit));
434 fprintf(stderr,
435 "pack_report: pack_used_ctr = %10u\n"
436 "pack_report: pack_mmap_calls = %10u\n"
437 "pack_report: pack_open_windows = %10u / %10u\n"
438 "pack_report: pack_mapped = "
439 "%10" SZ_FMT " / %10" SZ_FMT "\n",
440 pack_used_ctr,
441 pack_mmap_calls,
442 pack_open_windows, peak_pack_open_windows,
443 sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
444}
445
446static int check_packed_git_idx(const char *path, struct packed_git *p)
447{
448 void *idx_map;
449 struct pack_idx_header *hdr;
450 size_t idx_size;
451 uint32_t version, nr, i, *index;
452 int fd = open(path, O_RDONLY);
453 struct stat st;
454
455 if (fd < 0)
456 return -1;
457 if (fstat(fd, &st)) {
458 close(fd);
459 return -1;
460 }
461 idx_size = xsize_t(st.st_size);
462 if (idx_size < 4 * 256 + 20 + 20) {
463 close(fd);
464 return error("index file %s is too small", path);
465 }
466 idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
467 close(fd);
468
469 hdr = idx_map;
470 if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
471 version = ntohl(hdr->idx_version);
472 if (version < 2 || version > 2) {
473 munmap(idx_map, idx_size);
474 return error("index file %s is version %d"
475 " and is not supported by this binary"
476 " (try upgrading GIT to a newer version)",
477 path, version);
478 }
479 } else
480 version = 1;
481
482 nr = 0;
483 index = idx_map;
484 if (version > 1)
485 index += 2; /* skip index header */
486 for (i = 0; i < 256; i++) {
487 uint32_t n = ntohl(index[i]);
488 if (n < nr) {
489 munmap(idx_map, idx_size);
490 return error("non-monotonic index %s", path);
491 }
492 nr = n;
493 }
494
495 if (version == 1) {
496 /*
497 * Total size:
498 * - 256 index entries 4 bytes each
499 * - 24-byte entries * nr (20-byte sha1 + 4-byte offset)
500 * - 20-byte SHA1 of the packfile
501 * - 20-byte SHA1 file checksum
502 */
503 if (idx_size != 4*256 + nr * 24 + 20 + 20) {
504 munmap(idx_map, idx_size);
505 return error("wrong index v1 file size in %s", path);
506 }
507 } else if (version == 2) {
508 /*
509 * Minimum size:
510 * - 8 bytes of header
511 * - 256 index entries 4 bytes each
512 * - 20-byte sha1 entry * nr
513 * - 4-byte crc entry * nr
514 * - 4-byte offset entry * nr
515 * - 20-byte SHA1 of the packfile
516 * - 20-byte SHA1 file checksum
517 * And after the 4-byte offset table might be a
518 * variable sized table containing 8-byte entries
519 * for offsets larger than 2^31.
520 */
521 unsigned long min_size = 8 + 4*256 + nr*(20 + 4 + 4) + 20 + 20;
522 unsigned long max_size = min_size;
523 if (nr)
524 max_size += (nr - 1)*8;
525 if (idx_size < min_size || idx_size > max_size) {
526 munmap(idx_map, idx_size);
527 return error("wrong index v2 file size in %s", path);
528 }
529 if (idx_size != min_size &&
530 /*
531 * make sure we can deal with large pack offsets.
532 * 31-bit signed offset won't be enough, neither
533 * 32-bit unsigned one will be.
534 */
535 (sizeof(off_t) <= 4)) {
536 munmap(idx_map, idx_size);
537 return error("pack too large for current definition of off_t in %s", path);
538 }
539 }
540
541 p->index_version = version;
542 p->index_data = idx_map;
543 p->index_size = idx_size;
544 p->num_objects = nr;
545 return 0;
546}
547
548int open_pack_index(struct packed_git *p)
549{
550 char *idx_name;
551 int ret;
552
553 if (p->index_data)
554 return 0;
555
556 idx_name = xstrdup(p->pack_name);
557 strcpy(idx_name + strlen(idx_name) - strlen(".pack"), ".idx");
558 ret = check_packed_git_idx(idx_name, p);
559 free(idx_name);
560 return ret;
561}
562
563static void scan_windows(struct packed_git *p,
564 struct packed_git **lru_p,
565 struct pack_window **lru_w,
566 struct pack_window **lru_l)
567{
568 struct pack_window *w, *w_l;
569
570 for (w_l = NULL, w = p->windows; w; w = w->next) {
571 if (!w->inuse_cnt) {
572 if (!*lru_w || w->last_used < (*lru_w)->last_used) {
573 *lru_p = p;
574 *lru_w = w;
575 *lru_l = w_l;
576 }
577 }
578 w_l = w;
579 }
580}
581
582static int unuse_one_window(struct packed_git *current, int keep_fd)
583{
584 struct packed_git *p, *lru_p = NULL;
585 struct pack_window *lru_w = NULL, *lru_l = NULL;
586
587 if (current)
588 scan_windows(current, &lru_p, &lru_w, &lru_l);
589 for (p = packed_git; p; p = p->next)
590 scan_windows(p, &lru_p, &lru_w, &lru_l);
591 if (lru_p) {
592 munmap(lru_w->base, lru_w->len);
593 pack_mapped -= lru_w->len;
594 if (lru_l)
595 lru_l->next = lru_w->next;
596 else {
597 lru_p->windows = lru_w->next;
598 if (!lru_p->windows && lru_p->pack_fd != keep_fd) {
599 close(lru_p->pack_fd);
600 lru_p->pack_fd = -1;
601 }
602 }
603 free(lru_w);
604 pack_open_windows--;
605 return 1;
606 }
607 return 0;
608}
609
610void release_pack_memory(size_t need, int fd)
611{
612 size_t cur = pack_mapped;
613 while (need >= (cur - pack_mapped) && unuse_one_window(NULL, fd))
614 ; /* nothing */
615}
616
617void close_pack_windows(struct packed_git *p)
618{
619 while (p->windows) {
620 struct pack_window *w = p->windows;
621
622 if (w->inuse_cnt)
623 die("pack '%s' still has open windows to it",
624 p->pack_name);
625 munmap(w->base, w->len);
626 pack_mapped -= w->len;
627 pack_open_windows--;
628 p->windows = w->next;
629 free(w);
630 }
631}
632
633void unuse_pack(struct pack_window **w_cursor)
634{
635 struct pack_window *w = *w_cursor;
636 if (w) {
637 w->inuse_cnt--;
638 *w_cursor = NULL;
639 }
640}
641
642/*
643 * Do not call this directly as this leaks p->pack_fd on error return;
644 * call open_packed_git() instead.
645 */
646static int open_packed_git_1(struct packed_git *p)
647{
648 struct stat st;
649 struct pack_header hdr;
650 unsigned char sha1[20];
651 unsigned char *idx_sha1;
652 long fd_flag;
653
654 if (!p->index_data && open_pack_index(p))
655 return error("packfile %s index unavailable", p->pack_name);
656
657 p->pack_fd = open(p->pack_name, O_RDONLY);
658 if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
659 return -1;
660
661 /* If we created the struct before we had the pack we lack size. */
662 if (!p->pack_size) {
663 if (!S_ISREG(st.st_mode))
664 return error("packfile %s not a regular file", p->pack_name);
665 p->pack_size = st.st_size;
666 } else if (p->pack_size != st.st_size)
667 return error("packfile %s size changed", p->pack_name);
668
669 /* We leave these file descriptors open with sliding mmap;
670 * there is no point keeping them open across exec(), though.
671 */
672 fd_flag = fcntl(p->pack_fd, F_GETFD, 0);
673 if (fd_flag < 0)
674 return error("cannot determine file descriptor flags");
675 fd_flag |= FD_CLOEXEC;
676 if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
677 return error("cannot set FD_CLOEXEC");
678
679 /* Verify we recognize this pack file format. */
680 if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
681 return error("file %s is far too short to be a packfile", p->pack_name);
682 if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
683 return error("file %s is not a GIT packfile", p->pack_name);
684 if (!pack_version_ok(hdr.hdr_version))
685 return error("packfile %s is version %u and not supported"
686 " (try upgrading GIT to a newer version)",
687 p->pack_name, ntohl(hdr.hdr_version));
688
689 /* Verify the pack matches its index. */
690 if (p->num_objects != ntohl(hdr.hdr_entries))
691 return error("packfile %s claims to have %u objects"
692 " while index indicates %u objects",
693 p->pack_name, ntohl(hdr.hdr_entries),
694 p->num_objects);
695 if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
696 return error("end of packfile %s is unavailable", p->pack_name);
697 if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
698 return error("packfile %s signature is unavailable", p->pack_name);
699 idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
700 if (hashcmp(sha1, idx_sha1))
701 return error("packfile %s does not match index", p->pack_name);
702 return 0;
703}
704
705static int open_packed_git(struct packed_git *p)
706{
707 if (!open_packed_git_1(p))
708 return 0;
709 if (p->pack_fd != -1) {
710 close(p->pack_fd);
711 p->pack_fd = -1;
712 }
713 return -1;
714}
715
716static int in_window(struct pack_window *win, off_t offset)
717{
718 /* We must promise at least 20 bytes (one hash) after the
719 * offset is available from this window, otherwise the offset
720 * is not actually in this window and a different window (which
721 * has that one hash excess) must be used. This is to support
722 * the object header and delta base parsing routines below.
723 */
724 off_t win_off = win->offset;
725 return win_off <= offset
726 && (offset + 20) <= (win_off + win->len);
727}
728
729unsigned char* use_pack(struct packed_git *p,
730 struct pack_window **w_cursor,
731 off_t offset,
732 unsigned int *left)
733{
734 struct pack_window *win = *w_cursor;
735
736 if (p->pack_fd == -1 && open_packed_git(p))
737 die("packfile %s cannot be accessed", p->pack_name);
738
739 /* Since packfiles end in a hash of their content and its
740 * pointless to ask for an offset into the middle of that
741 * hash, and the in_window function above wouldn't match
742 * don't allow an offset too close to the end of the file.
743 */
744 if (offset > (p->pack_size - 20))
745 die("offset beyond end of packfile (truncated pack?)");
746
747 if (!win || !in_window(win, offset)) {
748 if (win)
749 win->inuse_cnt--;
750 for (win = p->windows; win; win = win->next) {
751 if (in_window(win, offset))
752 break;
753 }
754 if (!win) {
755 size_t window_align = packed_git_window_size / 2;
756 off_t len;
757 win = xcalloc(1, sizeof(*win));
758 win->offset = (offset / window_align) * window_align;
759 len = p->pack_size - win->offset;
760 if (len > packed_git_window_size)
761 len = packed_git_window_size;
762 win->len = (size_t)len;
763 pack_mapped += win->len;
764 while (packed_git_limit < pack_mapped
765 && unuse_one_window(p, p->pack_fd))
766 ; /* nothing */
767 win->base = xmmap(NULL, win->len,
768 PROT_READ, MAP_PRIVATE,
769 p->pack_fd, win->offset);
770 if (win->base == MAP_FAILED)
771 die("packfile %s cannot be mapped: %s",
772 p->pack_name,
773 strerror(errno));
774 pack_mmap_calls++;
775 pack_open_windows++;
776 if (pack_mapped > peak_pack_mapped)
777 peak_pack_mapped = pack_mapped;
778 if (pack_open_windows > peak_pack_open_windows)
779 peak_pack_open_windows = pack_open_windows;
780 win->next = p->windows;
781 p->windows = win;
782 }
783 }
784 if (win != *w_cursor) {
785 win->last_used = pack_used_ctr++;
786 win->inuse_cnt++;
787 *w_cursor = win;
788 }
789 offset -= win->offset;
790 if (left)
791 *left = win->len - xsize_t(offset);
792 return win->base + offset;
793}
794
795struct packed_git *add_packed_git(const char *path, int path_len, int local)
796{
797 struct stat st;
798 struct packed_git *p = xmalloc(sizeof(*p) + path_len + 2);
799
800 /*
801 * Make sure a corresponding .pack file exists and that
802 * the index looks sane.
803 */
804 path_len -= strlen(".idx");
805 if (path_len < 1)
806 return NULL;
807 memcpy(p->pack_name, path, path_len);
808 strcpy(p->pack_name + path_len, ".pack");
809 if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
810 free(p);
811 return NULL;
812 }
813
814 /* ok, it looks sane as far as we can check without
815 * actually mapping the pack file.
816 */
817 p->index_version = 0;
818 p->index_data = NULL;
819 p->index_size = 0;
820 p->num_objects = 0;
821 p->pack_size = st.st_size;
822 p->next = NULL;
823 p->windows = NULL;
824 p->pack_fd = -1;
825 p->pack_local = local;
826 p->mtime = st.st_mtime;
827 if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
828 hashclr(p->sha1);
829 return p;
830}
831
832struct packed_git *parse_pack_index(unsigned char *sha1)
833{
834 char *path = sha1_pack_index_name(sha1);
835 return parse_pack_index_file(sha1, path);
836}
837
838struct packed_git *parse_pack_index_file(const unsigned char *sha1,
839 const char *idx_path)
840{
841 const char *path = sha1_pack_name(sha1);
842 struct packed_git *p = xmalloc(sizeof(*p) + strlen(path) + 2);
843
844 if (check_packed_git_idx(idx_path, p)) {
845 free(p);
846 return NULL;
847 }
848
849 strcpy(p->pack_name, path);
850 p->pack_size = 0;
851 p->next = NULL;
852 p->windows = NULL;
853 p->pack_fd = -1;
854 hashcpy(p->sha1, sha1);
855 return p;
856}
857
858void install_packed_git(struct packed_git *pack)
859{
860 pack->next = packed_git;
861 packed_git = pack;
862}
863
864static void prepare_packed_git_one(char *objdir, int local)
865{
866 /* Ensure that this buffer is large enough so that we can
867 append "/pack/" without clobbering the stack even if
868 strlen(objdir) were PATH_MAX. */
869 char path[PATH_MAX + 1 + 4 + 1 + 1];
870 int len;
871 DIR *dir;
872 struct dirent *de;
873
874 sprintf(path, "%s/pack", objdir);
875 len = strlen(path);
876 dir = opendir(path);
877 if (!dir) {
878 if (errno != ENOENT)
879 error("unable to open object pack directory: %s: %s",
880 path, strerror(errno));
881 return;
882 }
883 path[len++] = '/';
884 while ((de = readdir(dir)) != NULL) {
885 int namelen = strlen(de->d_name);
886 struct packed_git *p;
887
888 if (!has_extension(de->d_name, ".idx"))
889 continue;
890
891 if (len + namelen + 1 > sizeof(path))
892 continue;
893
894 /* Don't reopen a pack we already have. */
895 strcpy(path + len, de->d_name);
896 for (p = packed_git; p; p = p->next) {
897 if (!memcmp(path, p->pack_name, len + namelen - 4))
898 break;
899 }
900 if (p)
901 continue;
902 /* See if it really is a valid .idx file with corresponding
903 * .pack file that we can map.
904 */
905 p = add_packed_git(path, len + namelen, local);
906 if (!p)
907 continue;
908 install_packed_git(p);
909 }
910 closedir(dir);
911}
912
913static int sort_pack(const void *a_, const void *b_)
914{
915 struct packed_git *a = *((struct packed_git **)a_);
916 struct packed_git *b = *((struct packed_git **)b_);
917 int st;
918
919 /*
920 * Local packs tend to contain objects specific to our
921 * variant of the project than remote ones. In addition,
922 * remote ones could be on a network mounted filesystem.
923 * Favor local ones for these reasons.
924 */
925 st = a->pack_local - b->pack_local;
926 if (st)
927 return -st;
928
929 /*
930 * Younger packs tend to contain more recent objects,
931 * and more recent objects tend to get accessed more
932 * often.
933 */
934 if (a->mtime < b->mtime)
935 return 1;
936 else if (a->mtime == b->mtime)
937 return 0;
938 return -1;
939}
940
941static void rearrange_packed_git(void)
942{
943 struct packed_git **ary, *p;
944 int i, n;
945
946 for (n = 0, p = packed_git; p; p = p->next)
947 n++;
948 if (n < 2)
949 return;
950
951 /* prepare an array of packed_git for easier sorting */
952 ary = xcalloc(n, sizeof(struct packed_git *));
953 for (n = 0, p = packed_git; p; p = p->next)
954 ary[n++] = p;
955
956 qsort(ary, n, sizeof(struct packed_git *), sort_pack);
957
958 /* link them back again */
959 for (i = 0; i < n - 1; i++)
960 ary[i]->next = ary[i + 1];
961 ary[n - 1]->next = NULL;
962 packed_git = ary[0];
963
964 free(ary);
965}
966
967static int prepare_packed_git_run_once = 0;
968void prepare_packed_git(void)
969{
970 struct alternate_object_database *alt;
971
972 if (prepare_packed_git_run_once)
973 return;
974 prepare_packed_git_one(get_object_directory(), 1);
975 prepare_alt_odb();
976 for (alt = alt_odb_list; alt; alt = alt->next) {
977 alt->name[-1] = 0;
978 prepare_packed_git_one(alt->base, 0);
979 alt->name[-1] = '/';
980 }
981 rearrange_packed_git();
982 prepare_packed_git_run_once = 1;
983}
984
985void reprepare_packed_git(void)
986{
987 prepare_packed_git_run_once = 0;
988 prepare_packed_git();
989}
990
991int check_sha1_signature(const unsigned char *sha1, void *map, unsigned long size, const char *type)
992{
993 unsigned char real_sha1[20];
994 hash_sha1_file(map, size, type, real_sha1);
995 return hashcmp(sha1, real_sha1) ? -1 : 0;
996}
997
998static int git_open_noatime(const char *name)
999{
1000 static int sha1_file_open_flag = O_NOATIME;
1001 int fd = open(name, O_RDONLY | sha1_file_open_flag);
1002
1003 /* Might the failure be due to O_NOATIME? */
1004 if (fd < 0 && errno != ENOENT && sha1_file_open_flag) {
1005 fd = open(name, O_RDONLY);
1006 if (fd >= 0)
1007 sha1_file_open_flag = 0;
1008 }
1009 return fd;
1010}
1011
1012static int open_sha1_file(const unsigned char *sha1)
1013{
1014 int fd;
1015 char *name = sha1_file_name(sha1);
1016 struct alternate_object_database *alt;
1017
1018 fd = git_open_noatime(name);
1019 if (fd >= 0)
1020 return fd;
1021
1022 prepare_alt_odb();
1023 errno = ENOENT;
1024 for (alt = alt_odb_list; alt; alt = alt->next) {
1025 name = alt->name;
1026 fill_sha1_path(name, sha1);
1027 fd = git_open_noatime(alt->base);
1028 if (fd >= 0)
1029 return fd;
1030 }
1031 return -1;
1032}
1033
1034static void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1035{
1036 void *map;
1037 int fd;
1038
1039 fd = open_sha1_file(sha1);
1040 map = NULL;
1041 if (fd >= 0) {
1042 struct stat st;
1043
1044 if (!fstat(fd, &st)) {
1045 *size = xsize_t(st.st_size);
1046 map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1047 }
1048 close(fd);
1049 }
1050 return map;
1051}
1052
1053static int legacy_loose_object(unsigned char *map)
1054{
1055 unsigned int word;
1056
1057 /*
1058 * Is it a zlib-compressed buffer? If so, the first byte
1059 * must be 0x78 (15-bit window size, deflated), and the
1060 * first 16-bit word is evenly divisible by 31
1061 */
1062 word = (map[0] << 8) + map[1];
1063 if (map[0] == 0x78 && !(word % 31))
1064 return 1;
1065 else
1066 return 0;
1067}
1068
1069unsigned long unpack_object_header_gently(const unsigned char *buf, unsigned long len, enum object_type *type, unsigned long *sizep)
1070{
1071 unsigned shift;
1072 unsigned char c;
1073 unsigned long size;
1074 unsigned long used = 0;
1075
1076 c = buf[used++];
1077 *type = (c >> 4) & 7;
1078 size = c & 15;
1079 shift = 4;
1080 while (c & 0x80) {
1081 if (len <= used)
1082 return 0;
1083 if (sizeof(long) * 8 <= shift)
1084 return 0;
1085 c = buf[used++];
1086 size += (c & 0x7f) << shift;
1087 shift += 7;
1088 }
1089 *sizep = size;
1090 return used;
1091}
1092
1093static int unpack_sha1_header(z_stream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
1094{
1095 unsigned long size, used;
1096 static const char valid_loose_object_type[8] = {
1097 0, /* OBJ_EXT */
1098 1, 1, 1, 1, /* "commit", "tree", "blob", "tag" */
1099 0, /* "delta" and others are invalid in a loose object */
1100 };
1101 enum object_type type;
1102
1103 /* Get the data stream */
1104 memset(stream, 0, sizeof(*stream));
1105 stream->next_in = map;
1106 stream->avail_in = mapsize;
1107 stream->next_out = buffer;
1108 stream->avail_out = bufsiz;
1109
1110 if (legacy_loose_object(map)) {
1111 inflateInit(stream);
1112 return inflate(stream, 0);
1113 }
1114
1115
1116 /*
1117 * There used to be a second loose object header format which
1118 * was meant to mimic the in-pack format, allowing for direct
1119 * copy of the object data. This format turned up not to be
1120 * really worth it and we don't write it any longer. But we
1121 * can still read it.
1122 */
1123 used = unpack_object_header_gently(map, mapsize, &type, &size);
1124 if (!used || !valid_loose_object_type[type])
1125 return -1;
1126 map += used;
1127 mapsize -= used;
1128
1129 /* Set up the stream for the rest.. */
1130 stream->next_in = map;
1131 stream->avail_in = mapsize;
1132 inflateInit(stream);
1133
1134 /* And generate the fake traditional header */
1135 stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu",
1136 typename(type), size);
1137 return 0;
1138}
1139
1140static void *unpack_sha1_rest(z_stream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1141{
1142 int bytes = strlen(buffer) + 1;
1143 unsigned char *buf = xmalloc(1+size);
1144 unsigned long n;
1145 int status = Z_OK;
1146
1147 n = stream->total_out - bytes;
1148 if (n > size)
1149 n = size;
1150 memcpy(buf, (char *) buffer + bytes, n);
1151 bytes = n;
1152 if (bytes <= size) {
1153 /*
1154 * The above condition must be (bytes <= size), not
1155 * (bytes < size). In other words, even though we
1156 * expect no more output and set avail_out to zer0,
1157 * the input zlib stream may have bytes that express
1158 * "this concludes the stream", and we *do* want to
1159 * eat that input.
1160 *
1161 * Otherwise we would not be able to test that we
1162 * consumed all the input to reach the expected size;
1163 * we also want to check that zlib tells us that all
1164 * went well with status == Z_STREAM_END at the end.
1165 */
1166 stream->next_out = buf + bytes;
1167 stream->avail_out = size - bytes;
1168 while (status == Z_OK)
1169 status = inflate(stream, Z_FINISH);
1170 }
1171 buf[size] = 0;
1172 if (status == Z_STREAM_END && !stream->avail_in) {
1173 inflateEnd(stream);
1174 return buf;
1175 }
1176
1177 if (status < 0)
1178 error("corrupt loose object '%s'", sha1_to_hex(sha1));
1179 else if (stream->avail_in)
1180 error("garbage at end of loose object '%s'",
1181 sha1_to_hex(sha1));
1182 free(buf);
1183 return NULL;
1184}
1185
1186/*
1187 * We used to just use "sscanf()", but that's actually way
1188 * too permissive for what we want to check. So do an anal
1189 * object header parse by hand.
1190 */
1191static int parse_sha1_header(const char *hdr, unsigned long *sizep)
1192{
1193 char type[10];
1194 int i;
1195 unsigned long size;
1196
1197 /*
1198 * The type can be at most ten bytes (including the
1199 * terminating '\0' that we add), and is followed by
1200 * a space.
1201 */
1202 i = 0;
1203 for (;;) {
1204 char c = *hdr++;
1205 if (c == ' ')
1206 break;
1207 type[i++] = c;
1208 if (i >= sizeof(type))
1209 return -1;
1210 }
1211 type[i] = 0;
1212
1213 /*
1214 * The length must follow immediately, and be in canonical
1215 * decimal format (ie "010" is not valid).
1216 */
1217 size = *hdr++ - '0';
1218 if (size > 9)
1219 return -1;
1220 if (size) {
1221 for (;;) {
1222 unsigned long c = *hdr - '0';
1223 if (c > 9)
1224 break;
1225 hdr++;
1226 size = size * 10 + c;
1227 }
1228 }
1229 *sizep = size;
1230
1231 /*
1232 * The length must be followed by a zero byte
1233 */
1234 return *hdr ? -1 : type_from_string(type);
1235}
1236
1237static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1238{
1239 int ret;
1240 z_stream stream;
1241 char hdr[8192];
1242
1243 ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1244 if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1245 return NULL;
1246
1247 return unpack_sha1_rest(&stream, hdr, *size, sha1);
1248}
1249
1250unsigned long get_size_from_delta(struct packed_git *p,
1251 struct pack_window **w_curs,
1252 off_t curpos)
1253{
1254 const unsigned char *data;
1255 unsigned char delta_head[20], *in;
1256 z_stream stream;
1257 int st;
1258
1259 memset(&stream, 0, sizeof(stream));
1260 stream.next_out = delta_head;
1261 stream.avail_out = sizeof(delta_head);
1262
1263 inflateInit(&stream);
1264 do {
1265 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1266 stream.next_in = in;
1267 st = inflate(&stream, Z_FINISH);
1268 curpos += stream.next_in - in;
1269 } while ((st == Z_OK || st == Z_BUF_ERROR) &&
1270 stream.total_out < sizeof(delta_head));
1271 inflateEnd(&stream);
1272 if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head))
1273 die("delta data unpack-initial failed");
1274
1275 /* Examine the initial part of the delta to figure out
1276 * the result size.
1277 */
1278 data = delta_head;
1279
1280 /* ignore base size */
1281 get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1282
1283 /* Read the result size */
1284 return get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1285}
1286
1287static off_t get_delta_base(struct packed_git *p,
1288 struct pack_window **w_curs,
1289 off_t *curpos,
1290 enum object_type type,
1291 off_t delta_obj_offset)
1292{
1293 unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1294 off_t base_offset;
1295
1296 /* use_pack() assured us we have [base_info, base_info + 20)
1297 * as a range that we can look at without walking off the
1298 * end of the mapped window. Its actually the hash size
1299 * that is assured. An OFS_DELTA longer than the hash size
1300 * is stupid, as then a REF_DELTA would be smaller to store.
1301 */
1302 if (type == OBJ_OFS_DELTA) {
1303 unsigned used = 0;
1304 unsigned char c = base_info[used++];
1305 base_offset = c & 127;
1306 while (c & 128) {
1307 base_offset += 1;
1308 if (!base_offset || MSB(base_offset, 7))
1309 die("offset value overflow for delta base object");
1310 c = base_info[used++];
1311 base_offset = (base_offset << 7) + (c & 127);
1312 }
1313 base_offset = delta_obj_offset - base_offset;
1314 if (base_offset >= delta_obj_offset)
1315 die("delta base offset out of bound");
1316 *curpos += used;
1317 } else if (type == OBJ_REF_DELTA) {
1318 /* The base entry _must_ be in the same pack */
1319 base_offset = find_pack_entry_one(base_info, p);
1320 if (!base_offset)
1321 die("failed to find delta-pack base object %s",
1322 sha1_to_hex(base_info));
1323 *curpos += 20;
1324 } else
1325 die("I am totally screwed");
1326 return base_offset;
1327}
1328
1329/* forward declaration for a mutually recursive function */
1330static int packed_object_info(struct packed_git *p, off_t offset,
1331 unsigned long *sizep);
1332
1333static int packed_delta_info(struct packed_git *p,
1334 struct pack_window **w_curs,
1335 off_t curpos,
1336 enum object_type type,
1337 off_t obj_offset,
1338 unsigned long *sizep)
1339{
1340 off_t base_offset;
1341
1342 base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1343 type = packed_object_info(p, base_offset, NULL);
1344
1345 /* We choose to only get the type of the base object and
1346 * ignore potentially corrupt pack file that expects the delta
1347 * based on a base with a wrong size. This saves tons of
1348 * inflate() calls.
1349 */
1350 if (sizep)
1351 *sizep = get_size_from_delta(p, w_curs, curpos);
1352
1353 return type;
1354}
1355
1356static int unpack_object_header(struct packed_git *p,
1357 struct pack_window **w_curs,
1358 off_t *curpos,
1359 unsigned long *sizep)
1360{
1361 unsigned char *base;
1362 unsigned int left;
1363 unsigned long used;
1364 enum object_type type;
1365
1366 /* use_pack() assures us we have [base, base + 20) available
1367 * as a range that we can look at at. (Its actually the hash
1368 * size that is assured.) With our object header encoding
1369 * the maximum deflated object size is 2^137, which is just
1370 * insane, so we know won't exceed what we have been given.
1371 */
1372 base = use_pack(p, w_curs, *curpos, &left);
1373 used = unpack_object_header_gently(base, left, &type, sizep);
1374 if (!used)
1375 die("object offset outside of pack file");
1376 *curpos += used;
1377
1378 return type;
1379}
1380
1381const char *packed_object_info_detail(struct packed_git *p,
1382 off_t obj_offset,
1383 unsigned long *size,
1384 unsigned long *store_size,
1385 unsigned int *delta_chain_length,
1386 unsigned char *base_sha1)
1387{
1388 struct pack_window *w_curs = NULL;
1389 off_t curpos;
1390 unsigned long dummy;
1391 unsigned char *next_sha1;
1392 enum object_type type;
1393 struct revindex_entry *revidx;
1394
1395 *delta_chain_length = 0;
1396 curpos = obj_offset;
1397 type = unpack_object_header(p, &w_curs, &curpos, size);
1398
1399 revidx = find_pack_revindex(p, obj_offset);
1400 *store_size = revidx[1].offset - obj_offset;
1401
1402 for (;;) {
1403 switch (type) {
1404 default:
1405 die("pack %s contains unknown object type %d",
1406 p->pack_name, type);
1407 case OBJ_COMMIT:
1408 case OBJ_TREE:
1409 case OBJ_BLOB:
1410 case OBJ_TAG:
1411 unuse_pack(&w_curs);
1412 return typename(type);
1413 case OBJ_OFS_DELTA:
1414 obj_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
1415 if (*delta_chain_length == 0) {
1416 revidx = find_pack_revindex(p, obj_offset);
1417 hashcpy(base_sha1, nth_packed_object_sha1(p, revidx->nr));
1418 }
1419 break;
1420 case OBJ_REF_DELTA:
1421 next_sha1 = use_pack(p, &w_curs, curpos, NULL);
1422 if (*delta_chain_length == 0)
1423 hashcpy(base_sha1, next_sha1);
1424 obj_offset = find_pack_entry_one(next_sha1, p);
1425 break;
1426 }
1427 (*delta_chain_length)++;
1428 curpos = obj_offset;
1429 type = unpack_object_header(p, &w_curs, &curpos, &dummy);
1430 }
1431}
1432
1433static int packed_object_info(struct packed_git *p, off_t obj_offset,
1434 unsigned long *sizep)
1435{
1436 struct pack_window *w_curs = NULL;
1437 unsigned long size;
1438 off_t curpos = obj_offset;
1439 enum object_type type;
1440
1441 type = unpack_object_header(p, &w_curs, &curpos, &size);
1442
1443 switch (type) {
1444 case OBJ_OFS_DELTA:
1445 case OBJ_REF_DELTA:
1446 type = packed_delta_info(p, &w_curs, curpos,
1447 type, obj_offset, sizep);
1448 break;
1449 case OBJ_COMMIT:
1450 case OBJ_TREE:
1451 case OBJ_BLOB:
1452 case OBJ_TAG:
1453 if (sizep)
1454 *sizep = size;
1455 break;
1456 default:
1457 die("pack %s contains unknown object type %d",
1458 p->pack_name, type);
1459 }
1460 unuse_pack(&w_curs);
1461 return type;
1462}
1463
1464static void *unpack_compressed_entry(struct packed_git *p,
1465 struct pack_window **w_curs,
1466 off_t curpos,
1467 unsigned long size)
1468{
1469 int st;
1470 z_stream stream;
1471 unsigned char *buffer, *in;
1472
1473 buffer = xmalloc(size + 1);
1474 buffer[size] = 0;
1475 memset(&stream, 0, sizeof(stream));
1476 stream.next_out = buffer;
1477 stream.avail_out = size;
1478
1479 inflateInit(&stream);
1480 do {
1481 in = use_pack(p, w_curs, curpos, &stream.avail_in);
1482 stream.next_in = in;
1483 st = inflate(&stream, Z_FINISH);
1484 curpos += stream.next_in - in;
1485 } while (st == Z_OK || st == Z_BUF_ERROR);
1486 inflateEnd(&stream);
1487 if ((st != Z_STREAM_END) || stream.total_out != size) {
1488 free(buffer);
1489 return NULL;
1490 }
1491
1492 return buffer;
1493}
1494
1495#define MAX_DELTA_CACHE (256)
1496
1497static size_t delta_base_cached;
1498
1499static struct delta_base_cache_lru_list {
1500 struct delta_base_cache_lru_list *prev;
1501 struct delta_base_cache_lru_list *next;
1502} delta_base_cache_lru = { &delta_base_cache_lru, &delta_base_cache_lru };
1503
1504static struct delta_base_cache_entry {
1505 struct delta_base_cache_lru_list lru;
1506 void *data;
1507 struct packed_git *p;
1508 off_t base_offset;
1509 unsigned long size;
1510 enum object_type type;
1511} delta_base_cache[MAX_DELTA_CACHE];
1512
1513static unsigned long pack_entry_hash(struct packed_git *p, off_t base_offset)
1514{
1515 unsigned long hash;
1516
1517 hash = (unsigned long)p + (unsigned long)base_offset;
1518 hash += (hash >> 8) + (hash >> 16);
1519 return hash % MAX_DELTA_CACHE;
1520}
1521
1522static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
1523 unsigned long *base_size, enum object_type *type, int keep_cache)
1524{
1525 void *ret;
1526 unsigned long hash = pack_entry_hash(p, base_offset);
1527 struct delta_base_cache_entry *ent = delta_base_cache + hash;
1528
1529 ret = ent->data;
1530 if (ret && ent->p == p && ent->base_offset == base_offset)
1531 goto found_cache_entry;
1532 return unpack_entry(p, base_offset, type, base_size);
1533
1534found_cache_entry:
1535 if (!keep_cache) {
1536 ent->data = NULL;
1537 ent->lru.next->prev = ent->lru.prev;
1538 ent->lru.prev->next = ent->lru.next;
1539 delta_base_cached -= ent->size;
1540 } else {
1541 ret = xmemdupz(ent->data, ent->size);
1542 }
1543 *type = ent->type;
1544 *base_size = ent->size;
1545 return ret;
1546}
1547
1548static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
1549{
1550 if (ent->data) {
1551 free(ent->data);
1552 ent->data = NULL;
1553 ent->lru.next->prev = ent->lru.prev;
1554 ent->lru.prev->next = ent->lru.next;
1555 delta_base_cached -= ent->size;
1556 }
1557}
1558
1559static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
1560 void *base, unsigned long base_size, enum object_type type)
1561{
1562 unsigned long hash = pack_entry_hash(p, base_offset);
1563 struct delta_base_cache_entry *ent = delta_base_cache + hash;
1564 struct delta_base_cache_lru_list *lru;
1565
1566 release_delta_base_cache(ent);
1567 delta_base_cached += base_size;
1568
1569 for (lru = delta_base_cache_lru.next;
1570 delta_base_cached > delta_base_cache_limit
1571 && lru != &delta_base_cache_lru;
1572 lru = lru->next) {
1573 struct delta_base_cache_entry *f = (void *)lru;
1574 if (f->type == OBJ_BLOB)
1575 release_delta_base_cache(f);
1576 }
1577 for (lru = delta_base_cache_lru.next;
1578 delta_base_cached > delta_base_cache_limit
1579 && lru != &delta_base_cache_lru;
1580 lru = lru->next) {
1581 struct delta_base_cache_entry *f = (void *)lru;
1582 release_delta_base_cache(f);
1583 }
1584
1585 ent->p = p;
1586 ent->base_offset = base_offset;
1587 ent->type = type;
1588 ent->data = base;
1589 ent->size = base_size;
1590 ent->lru.next = &delta_base_cache_lru;
1591 ent->lru.prev = delta_base_cache_lru.prev;
1592 delta_base_cache_lru.prev->next = &ent->lru;
1593 delta_base_cache_lru.prev = &ent->lru;
1594}
1595
1596static void *unpack_delta_entry(struct packed_git *p,
1597 struct pack_window **w_curs,
1598 off_t curpos,
1599 unsigned long delta_size,
1600 off_t obj_offset,
1601 enum object_type *type,
1602 unsigned long *sizep)
1603{
1604 void *delta_data, *result, *base;
1605 unsigned long base_size;
1606 off_t base_offset;
1607
1608 base_offset = get_delta_base(p, w_curs, &curpos, *type, obj_offset);
1609 base = cache_or_unpack_entry(p, base_offset, &base_size, type, 0);
1610 if (!base)
1611 die("failed to read delta base object"
1612 " at %"PRIuMAX" from %s",
1613 (uintmax_t)base_offset, p->pack_name);
1614
1615 delta_data = unpack_compressed_entry(p, w_curs, curpos, delta_size);
1616 if (!delta_data)
1617 die("failed to unpack compressed delta"
1618 " at %"PRIuMAX" from %s",
1619 (uintmax_t)curpos, p->pack_name);
1620 result = patch_delta(base, base_size,
1621 delta_data, delta_size,
1622 sizep);
1623 if (!result)
1624 die("failed to apply delta");
1625 free(delta_data);
1626 add_delta_base_cache(p, base_offset, base, base_size, *type);
1627 return result;
1628}
1629
1630void *unpack_entry(struct packed_git *p, off_t obj_offset,
1631 enum object_type *type, unsigned long *sizep)
1632{
1633 struct pack_window *w_curs = NULL;
1634 off_t curpos = obj_offset;
1635 void *data;
1636
1637 *type = unpack_object_header(p, &w_curs, &curpos, sizep);
1638 switch (*type) {
1639 case OBJ_OFS_DELTA:
1640 case OBJ_REF_DELTA:
1641 data = unpack_delta_entry(p, &w_curs, curpos, *sizep,
1642 obj_offset, type, sizep);
1643 break;
1644 case OBJ_COMMIT:
1645 case OBJ_TREE:
1646 case OBJ_BLOB:
1647 case OBJ_TAG:
1648 data = unpack_compressed_entry(p, &w_curs, curpos, *sizep);
1649 break;
1650 default:
1651 die("unknown object type %i in %s", *type, p->pack_name);
1652 }
1653 unuse_pack(&w_curs);
1654 return data;
1655}
1656
1657const unsigned char *nth_packed_object_sha1(struct packed_git *p,
1658 uint32_t n)
1659{
1660 const unsigned char *index = p->index_data;
1661 if (!index) {
1662 if (open_pack_index(p))
1663 return NULL;
1664 index = p->index_data;
1665 }
1666 if (n >= p->num_objects)
1667 return NULL;
1668 index += 4 * 256;
1669 if (p->index_version == 1) {
1670 return index + 24 * n + 4;
1671 } else {
1672 index += 8;
1673 return index + 20 * n;
1674 }
1675}
1676
1677static off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
1678{
1679 const unsigned char *index = p->index_data;
1680 index += 4 * 256;
1681 if (p->index_version == 1) {
1682 return ntohl(*((uint32_t *)(index + 24 * n)));
1683 } else {
1684 uint32_t off;
1685 index += 8 + p->num_objects * (20 + 4);
1686 off = ntohl(*((uint32_t *)(index + 4 * n)));
1687 if (!(off & 0x80000000))
1688 return off;
1689 index += p->num_objects * 4 + (off & 0x7fffffff) * 8;
1690 return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
1691 ntohl(*((uint32_t *)(index + 4)));
1692 }
1693}
1694
1695off_t find_pack_entry_one(const unsigned char *sha1,
1696 struct packed_git *p)
1697{
1698 const uint32_t *level1_ofs = p->index_data;
1699 const unsigned char *index = p->index_data;
1700 unsigned hi, lo, stride;
1701 static int use_lookup = -1;
1702 static int debug_lookup = -1;
1703
1704 if (debug_lookup < 0)
1705 debug_lookup = !!getenv("GIT_DEBUG_LOOKUP");
1706
1707 if (!index) {
1708 if (open_pack_index(p))
1709 return 0;
1710 level1_ofs = p->index_data;
1711 index = p->index_data;
1712 }
1713 if (p->index_version > 1) {
1714 level1_ofs += 2;
1715 index += 8;
1716 }
1717 index += 4 * 256;
1718 hi = ntohl(level1_ofs[*sha1]);
1719 lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
1720 if (p->index_version > 1) {
1721 stride = 20;
1722 } else {
1723 stride = 24;
1724 index += 4;
1725 }
1726
1727 if (debug_lookup)
1728 printf("%02x%02x%02x... lo %u hi %u nr %u\n",
1729 sha1[0], sha1[1], sha1[2], lo, hi, p->num_objects);
1730
1731 if (use_lookup < 0)
1732 use_lookup = !!getenv("GIT_USE_LOOKUP");
1733 if (use_lookup) {
1734 int pos = sha1_entry_pos(index, stride, 0,
1735 lo, hi, p->num_objects, sha1);
1736 if (pos < 0)
1737 return 0;
1738 return nth_packed_object_offset(p, pos);
1739 }
1740
1741 do {
1742 unsigned mi = (lo + hi) / 2;
1743 int cmp = hashcmp(index + mi * stride, sha1);
1744
1745 if (debug_lookup)
1746 printf("lo %u hi %u rg %u mi %u\n",
1747 lo, hi, hi - lo, mi);
1748 if (!cmp)
1749 return nth_packed_object_offset(p, mi);
1750 if (cmp > 0)
1751 hi = mi;
1752 else
1753 lo = mi+1;
1754 } while (lo < hi);
1755 return 0;
1756}
1757
1758int matches_pack_name(struct packed_git *p, const char *name)
1759{
1760 const char *last_c, *c;
1761
1762 if (!strcmp(p->pack_name, name))
1763 return 1;
1764
1765 for (c = p->pack_name, last_c = c; *c;)
1766 if (*c == '/')
1767 last_c = ++c;
1768 else
1769 ++c;
1770 if (!strcmp(last_c, name))
1771 return 1;
1772
1773 return 0;
1774}
1775
1776static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e, const char **ignore_packed)
1777{
1778 static struct packed_git *last_found = (void *)1;
1779 struct packed_git *p;
1780 off_t offset;
1781
1782 prepare_packed_git();
1783 if (!packed_git)
1784 return 0;
1785 p = (last_found == (void *)1) ? packed_git : last_found;
1786
1787 do {
1788 if (ignore_packed) {
1789 const char **ig;
1790 for (ig = ignore_packed; *ig; ig++)
1791 if (matches_pack_name(p, *ig))
1792 break;
1793 if (*ig)
1794 goto next;
1795 }
1796
1797 offset = find_pack_entry_one(sha1, p);
1798 if (offset) {
1799 /*
1800 * We are about to tell the caller where they can
1801 * locate the requested object. We better make
1802 * sure the packfile is still here and can be
1803 * accessed before supplying that answer, as
1804 * it may have been deleted since the index
1805 * was loaded!
1806 */
1807 if (p->pack_fd == -1 && open_packed_git(p)) {
1808 error("packfile %s cannot be accessed", p->pack_name);
1809 goto next;
1810 }
1811 e->offset = offset;
1812 e->p = p;
1813 hashcpy(e->sha1, sha1);
1814 last_found = p;
1815 return 1;
1816 }
1817
1818 next:
1819 if (p == last_found)
1820 p = packed_git;
1821 else
1822 p = p->next;
1823 if (p == last_found)
1824 p = p->next;
1825 } while (p);
1826 return 0;
1827}
1828
1829struct packed_git *find_sha1_pack(const unsigned char *sha1,
1830 struct packed_git *packs)
1831{
1832 struct packed_git *p;
1833
1834 for (p = packs; p; p = p->next) {
1835 if (find_pack_entry_one(sha1, p))
1836 return p;
1837 }
1838 return NULL;
1839
1840}
1841
1842static int sha1_loose_object_info(const unsigned char *sha1, unsigned long *sizep)
1843{
1844 int status;
1845 unsigned long mapsize, size;
1846 void *map;
1847 z_stream stream;
1848 char hdr[32];
1849
1850 map = map_sha1_file(sha1, &mapsize);
1851 if (!map)
1852 return error("unable to find %s", sha1_to_hex(sha1));
1853 if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
1854 status = error("unable to unpack %s header",
1855 sha1_to_hex(sha1));
1856 else if ((status = parse_sha1_header(hdr, &size)) < 0)
1857 status = error("unable to parse %s header", sha1_to_hex(sha1));
1858 else if (sizep)
1859 *sizep = size;
1860 inflateEnd(&stream);
1861 munmap(map, mapsize);
1862 return status;
1863}
1864
1865int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
1866{
1867 struct pack_entry e;
1868
1869 if (!find_pack_entry(sha1, &e, NULL)) {
1870 reprepare_packed_git();
1871 if (!find_pack_entry(sha1, &e, NULL))
1872 return sha1_loose_object_info(sha1, sizep);
1873 }
1874 return packed_object_info(e.p, e.offset, sizep);
1875}
1876
1877static void *read_packed_sha1(const unsigned char *sha1,
1878 enum object_type *type, unsigned long *size)
1879{
1880 struct pack_entry e;
1881
1882 if (!find_pack_entry(sha1, &e, NULL))
1883 return NULL;
1884 else
1885 return cache_or_unpack_entry(e.p, e.offset, size, type, 1);
1886}
1887
1888/*
1889 * This is meant to hold a *small* number of objects that you would
1890 * want read_sha1_file() to be able to return, but yet you do not want
1891 * to write them into the object store (e.g. a browse-only
1892 * application).
1893 */
1894static struct cached_object {
1895 unsigned char sha1[20];
1896 enum object_type type;
1897 void *buf;
1898 unsigned long size;
1899} *cached_objects;
1900static int cached_object_nr, cached_object_alloc;
1901
1902static struct cached_object empty_tree = {
1903 /* empty tree sha1: 4b825dc642cb6eb9a060e54bf8d69288fbee4904 */
1904 "\x4b\x82\x5d\xc6\x42\xcb\x6e\xb9\xa0\x60"
1905 "\xe5\x4b\xf8\xd6\x92\x88\xfb\xee\x49\x04",
1906 OBJ_TREE,
1907 "",
1908 0
1909};
1910
1911static struct cached_object *find_cached_object(const unsigned char *sha1)
1912{
1913 int i;
1914 struct cached_object *co = cached_objects;
1915
1916 for (i = 0; i < cached_object_nr; i++, co++) {
1917 if (!hashcmp(co->sha1, sha1))
1918 return co;
1919 }
1920 if (!hashcmp(sha1, empty_tree.sha1))
1921 return &empty_tree;
1922 return NULL;
1923}
1924
1925int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
1926 unsigned char *sha1)
1927{
1928 struct cached_object *co;
1929
1930 hash_sha1_file(buf, len, typename(type), sha1);
1931 if (has_sha1_file(sha1) || find_cached_object(sha1))
1932 return 0;
1933 if (cached_object_alloc <= cached_object_nr) {
1934 cached_object_alloc = alloc_nr(cached_object_alloc);
1935 cached_objects = xrealloc(cached_objects,
1936 sizeof(*cached_objects) *
1937 cached_object_alloc);
1938 }
1939 co = &cached_objects[cached_object_nr++];
1940 co->size = len;
1941 co->type = type;
1942 co->buf = xmalloc(len);
1943 memcpy(co->buf, buf, len);
1944 hashcpy(co->sha1, sha1);
1945 return 0;
1946}
1947
1948void *read_sha1_file(const unsigned char *sha1, enum object_type *type,
1949 unsigned long *size)
1950{
1951 unsigned long mapsize;
1952 void *map, *buf;
1953 struct cached_object *co;
1954
1955 co = find_cached_object(sha1);
1956 if (co) {
1957 *type = co->type;
1958 *size = co->size;
1959 return xmemdupz(co->buf, co->size);
1960 }
1961
1962 buf = read_packed_sha1(sha1, type, size);
1963 if (buf)
1964 return buf;
1965 map = map_sha1_file(sha1, &mapsize);
1966 if (map) {
1967 buf = unpack_sha1_file(map, mapsize, type, size, sha1);
1968 munmap(map, mapsize);
1969 return buf;
1970 }
1971 reprepare_packed_git();
1972 return read_packed_sha1(sha1, type, size);
1973}
1974
1975void *read_object_with_reference(const unsigned char *sha1,
1976 const char *required_type_name,
1977 unsigned long *size,
1978 unsigned char *actual_sha1_return)
1979{
1980 enum object_type type, required_type;
1981 void *buffer;
1982 unsigned long isize;
1983 unsigned char actual_sha1[20];
1984
1985 required_type = type_from_string(required_type_name);
1986 hashcpy(actual_sha1, sha1);
1987 while (1) {
1988 int ref_length = -1;
1989 const char *ref_type = NULL;
1990
1991 buffer = read_sha1_file(actual_sha1, &type, &isize);
1992 if (!buffer)
1993 return NULL;
1994 if (type == required_type) {
1995 *size = isize;
1996 if (actual_sha1_return)
1997 hashcpy(actual_sha1_return, actual_sha1);
1998 return buffer;
1999 }
2000 /* Handle references */
2001 else if (type == OBJ_COMMIT)
2002 ref_type = "tree ";
2003 else if (type == OBJ_TAG)
2004 ref_type = "object ";
2005 else {
2006 free(buffer);
2007 return NULL;
2008 }
2009 ref_length = strlen(ref_type);
2010
2011 if (ref_length + 40 > isize ||
2012 memcmp(buffer, ref_type, ref_length) ||
2013 get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
2014 free(buffer);
2015 return NULL;
2016 }
2017 free(buffer);
2018 /* Now we have the ID of the referred-to object in
2019 * actual_sha1. Check again. */
2020 }
2021}
2022
2023static void write_sha1_file_prepare(const void *buf, unsigned long len,
2024 const char *type, unsigned char *sha1,
2025 char *hdr, int *hdrlen)
2026{
2027 SHA_CTX c;
2028
2029 /* Generate the header */
2030 *hdrlen = sprintf(hdr, "%s %lu", type, len)+1;
2031
2032 /* Sha1.. */
2033 SHA1_Init(&c);
2034 SHA1_Update(&c, hdr, *hdrlen);
2035 SHA1_Update(&c, buf, len);
2036 SHA1_Final(sha1, &c);
2037}
2038
2039/*
2040 * Move the just written object into its final resting place
2041 */
2042int move_temp_to_file(const char *tmpfile, const char *filename)
2043{
2044 int ret = link(tmpfile, filename);
2045
2046 /*
2047 * Coda hack - coda doesn't like cross-directory links,
2048 * so we fall back to a rename, which will mean that it
2049 * won't be able to check collisions, but that's not a
2050 * big deal.
2051 *
2052 * The same holds for FAT formatted media.
2053 *
2054 * When this succeeds, we just return 0. We have nothing
2055 * left to unlink.
2056 */
2057 if (ret && ret != EEXIST) {
2058 if (!rename(tmpfile, filename))
2059 return 0;
2060 ret = errno;
2061 }
2062 unlink(tmpfile);
2063 if (ret) {
2064 if (ret != EEXIST) {
2065 return error("unable to write sha1 filename %s: %s\n", filename, strerror(ret));
2066 }
2067 /* FIXME!!! Collision check here ? */
2068 }
2069
2070 return 0;
2071}
2072
2073static int write_buffer(int fd, const void *buf, size_t len)
2074{
2075 if (write_in_full(fd, buf, len) < 0)
2076 return error("file write error (%s)", strerror(errno));
2077 return 0;
2078}
2079
2080int hash_sha1_file(const void *buf, unsigned long len, const char *type,
2081 unsigned char *sha1)
2082{
2083 char hdr[32];
2084 int hdrlen;
2085 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2086 return 0;
2087}
2088
2089/* Finalize a file on disk, and close it. */
2090static void close_sha1_file(int fd)
2091{
2092 /* For safe-mode, we could fsync_or_die(fd, "sha1 file") here */
2093 fchmod(fd, 0444);
2094 if (close(fd) != 0)
2095 die("unable to write sha1 file");
2096}
2097
2098/* Size of directory component, including the ending '/' */
2099static inline int directory_size(const char *filename)
2100{
2101 const char *s = strrchr(filename, '/');
2102 if (!s)
2103 return 0;
2104 return s - filename + 1;
2105}
2106
2107/*
2108 * This creates a temporary file in the same directory as the final
2109 * 'filename'
2110 *
2111 * We want to avoid cross-directory filename renames, because those
2112 * can have problems on various filesystems (FAT, NFS, Coda).
2113 */
2114static int create_tmpfile(char *buffer, size_t bufsiz, const char *filename)
2115{
2116 int fd, dirlen = directory_size(filename);
2117
2118 if (dirlen + 20 > bufsiz) {
2119 errno = ENAMETOOLONG;
2120 return -1;
2121 }
2122 memcpy(buffer, filename, dirlen);
2123 strcpy(buffer + dirlen, "tmp_obj_XXXXXX");
2124 fd = mkstemp(buffer);
2125 if (fd < 0 && dirlen) {
2126 /* Make sure the directory exists */
2127 buffer[dirlen-1] = 0;
2128 if (mkdir(buffer, 0777) && adjust_shared_perm(buffer))
2129 return -1;
2130
2131 /* Try again */
2132 strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX");
2133 fd = mkstemp(buffer);
2134 }
2135 return fd;
2136}
2137
2138static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
2139 void *buf, unsigned long len, time_t mtime)
2140{
2141 int fd, size, ret;
2142 unsigned char *compressed;
2143 z_stream stream;
2144 char *filename;
2145 static char tmpfile[PATH_MAX];
2146
2147 filename = sha1_file_name(sha1);
2148 fd = open(filename, O_RDONLY);
2149 if (fd >= 0) {
2150 /*
2151 * FIXME!!! We might do collision checking here, but we'd
2152 * need to uncompress the old file and check it. Later.
2153 */
2154 close(fd);
2155 return 0;
2156 }
2157
2158 if (errno != ENOENT) {
2159 return error("sha1 file %s: %s\n", filename, strerror(errno));
2160 }
2161
2162 fd = create_tmpfile(tmpfile, sizeof(tmpfile), filename);
2163 if (fd < 0) {
2164 if (errno == EPERM)
2165 return error("insufficient permission for adding an object to repository database %s\n", get_object_directory());
2166 else
2167 return error("unable to create temporary sha1 filename %s: %s\n", tmpfile, strerror(errno));
2168 }
2169
2170 /* Set it up */
2171 memset(&stream, 0, sizeof(stream));
2172 deflateInit(&stream, zlib_compression_level);
2173 size = 8 + deflateBound(&stream, len+hdrlen);
2174 compressed = xmalloc(size);
2175
2176 /* Compress it */
2177 stream.next_out = compressed;
2178 stream.avail_out = size;
2179
2180 /* First header.. */
2181 stream.next_in = (unsigned char *)hdr;
2182 stream.avail_in = hdrlen;
2183 while (deflate(&stream, 0) == Z_OK)
2184 /* nothing */;
2185
2186 /* Then the data itself.. */
2187 stream.next_in = buf;
2188 stream.avail_in = len;
2189 ret = deflate(&stream, Z_FINISH);
2190 if (ret != Z_STREAM_END)
2191 die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
2192
2193 ret = deflateEnd(&stream);
2194 if (ret != Z_OK)
2195 die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
2196
2197 size = stream.total_out;
2198
2199 if (write_buffer(fd, compressed, size) < 0)
2200 die("unable to write sha1 file");
2201 close_sha1_file(fd);
2202 free(compressed);
2203
2204 if (mtime) {
2205 struct utimbuf utb;
2206 utb.actime = mtime;
2207 utb.modtime = mtime;
2208 if (utime(tmpfile, &utb) < 0)
2209 warning("failed utime() on %s: %s",
2210 tmpfile, strerror(errno));
2211 }
2212
2213 return move_temp_to_file(tmpfile, filename);
2214}
2215
2216int write_sha1_file(void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2217{
2218 unsigned char sha1[20];
2219 char hdr[32];
2220 int hdrlen;
2221
2222 /* Normally if we have it in the pack then we do not bother writing
2223 * it out into .git/objects/??/?{38} file.
2224 */
2225 write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
2226 if (returnsha1)
2227 hashcpy(returnsha1, sha1);
2228 if (has_sha1_file(sha1))
2229 return 0;
2230 return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
2231}
2232
2233int force_object_loose(const unsigned char *sha1, time_t mtime)
2234{
2235 void *buf;
2236 unsigned long len;
2237 enum object_type type;
2238 char hdr[32];
2239 int hdrlen;
2240
2241 if (has_loose_object(sha1))
2242 return 0;
2243 buf = read_packed_sha1(sha1, &type, &len);
2244 if (!buf)
2245 return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
2246 hdrlen = sprintf(hdr, "%s %lu", typename(type), len) + 1;
2247 return write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
2248}
2249
2250int has_pack_index(const unsigned char *sha1)
2251{
2252 struct stat st;
2253 if (stat(sha1_pack_index_name(sha1), &st))
2254 return 0;
2255 return 1;
2256}
2257
2258int has_pack_file(const unsigned char *sha1)
2259{
2260 struct stat st;
2261 if (stat(sha1_pack_name(sha1), &st))
2262 return 0;
2263 return 1;
2264}
2265
2266int has_sha1_pack(const unsigned char *sha1, const char **ignore_packed)
2267{
2268 struct pack_entry e;
2269 return find_pack_entry(sha1, &e, ignore_packed);
2270}
2271
2272int has_sha1_file(const unsigned char *sha1)
2273{
2274 struct pack_entry e;
2275
2276 if (find_pack_entry(sha1, &e, NULL))
2277 return 1;
2278 return has_loose_object(sha1);
2279}
2280
2281int index_pipe(unsigned char *sha1, int fd, const char *type, int write_object)
2282{
2283 struct strbuf buf;
2284 int ret;
2285
2286 strbuf_init(&buf, 0);
2287 if (strbuf_read(&buf, fd, 4096) < 0) {
2288 strbuf_release(&buf);
2289 return -1;
2290 }
2291
2292 if (!type)
2293 type = blob_type;
2294 if (write_object)
2295 ret = write_sha1_file(buf.buf, buf.len, type, sha1);
2296 else
2297 ret = hash_sha1_file(buf.buf, buf.len, type, sha1);
2298 strbuf_release(&buf);
2299
2300 return ret;
2301}
2302
2303int index_fd(unsigned char *sha1, int fd, struct stat *st, int write_object,
2304 enum object_type type, const char *path)
2305{
2306 size_t size = xsize_t(st->st_size);
2307 void *buf = NULL;
2308 int ret, re_allocated = 0;
2309
2310 if (size)
2311 buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
2312 close(fd);
2313
2314 if (!type)
2315 type = OBJ_BLOB;
2316
2317 /*
2318 * Convert blobs to git internal format
2319 */
2320 if ((type == OBJ_BLOB) && S_ISREG(st->st_mode)) {
2321 struct strbuf nbuf;
2322 strbuf_init(&nbuf, 0);
2323 if (convert_to_git(path, buf, size, &nbuf,
2324 write_object ? safe_crlf : 0)) {
2325 munmap(buf, size);
2326 buf = strbuf_detach(&nbuf, &size);
2327 re_allocated = 1;
2328 }
2329 }
2330
2331 if (write_object)
2332 ret = write_sha1_file(buf, size, typename(type), sha1);
2333 else
2334 ret = hash_sha1_file(buf, size, typename(type), sha1);
2335 if (re_allocated) {
2336 free(buf);
2337 return ret;
2338 }
2339 if (size)
2340 munmap(buf, size);
2341 return ret;
2342}
2343
2344int index_path(unsigned char *sha1, const char *path, struct stat *st, int write_object)
2345{
2346 int fd;
2347 char *target;
2348 size_t len;
2349
2350 switch (st->st_mode & S_IFMT) {
2351 case S_IFREG:
2352 fd = open(path, O_RDONLY);
2353 if (fd < 0)
2354 return error("open(\"%s\"): %s", path,
2355 strerror(errno));
2356 if (index_fd(sha1, fd, st, write_object, OBJ_BLOB, path) < 0)
2357 return error("%s: failed to insert into database",
2358 path);
2359 break;
2360 case S_IFLNK:
2361 len = xsize_t(st->st_size);
2362 target = xmalloc(len + 1);
2363 if (readlink(path, target, len + 1) != st->st_size) {
2364 char *errstr = strerror(errno);
2365 free(target);
2366 return error("readlink(\"%s\"): %s", path,
2367 errstr);
2368 }
2369 if (!write_object)
2370 hash_sha1_file(target, len, blob_type, sha1);
2371 else if (write_sha1_file(target, len, blob_type, sha1))
2372 return error("%s: failed to insert into database",
2373 path);
2374 free(target);
2375 break;
2376 case S_IFDIR:
2377 return resolve_gitlink_ref(path, "HEAD", sha1);
2378 default:
2379 return error("%s: unsupported file type", path);
2380 }
2381 return 0;
2382}
2383
2384int read_pack_header(int fd, struct pack_header *header)
2385{
2386 if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
2387 /* "eof before pack header was fully read" */
2388 return PH_ERROR_EOF;
2389
2390 if (header->hdr_signature != htonl(PACK_SIGNATURE))
2391 /* "protocol error (pack signature mismatch detected)" */
2392 return PH_ERROR_PACK_SIGNATURE;
2393 if (!pack_version_ok(header->hdr_version))
2394 /* "protocol error (pack version unsupported)" */
2395 return PH_ERROR_PROTOCOL;
2396 return 0;
2397}