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