]>
Commit | Line | Data |
---|---|---|
0fcfd160 LT |
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 | */ | |
0fcfd160 | 9 | #include "cache.h" |
1f688557 | 10 | #include "delta.h" |
a733cb60 | 11 | #include "pack.h" |
8e440259 PE |
12 | #include "blob.h" |
13 | #include "commit.h" | |
14 | #include "tag.h" | |
15 | #include "tree.h" | |
c879daa2 | 16 | #include "tree-walk.h" |
f35a6d3b | 17 | #include "refs.h" |
70f5d5d3 | 18 | #include "pack-revindex.h" |
628522ec | 19 | #include "sha1-lookup.h" |
0fcfd160 | 20 | |
144bde78 LT |
21 | #ifndef O_NOATIME |
22 | #if defined(__linux__) && (defined(__i386__) || defined(__PPC__)) | |
23 | #define O_NOATIME 01000000 | |
24 | #else | |
25 | #define O_NOATIME 0 | |
26 | #endif | |
27 | #endif | |
28 | ||
e05db0fd PR |
29 | #ifdef NO_C99_FORMAT |
30 | #define SZ_FMT "lu" | |
9e42d6a1 | 31 | static unsigned long sz_fmt(size_t s) { return (unsigned long)s; } |
e05db0fd PR |
32 | #else |
33 | #define SZ_FMT "zu" | |
9e42d6a1 | 34 | static size_t sz_fmt(size_t s) { return s; } |
e05db0fd PR |
35 | #endif |
36 | ||
96f1e58f | 37 | const unsigned char null_sha1[20]; |
88cd621d | 38 | |
f2e872aa | 39 | static int git_open_noatime(const char *name, struct packed_git *p); |
4865d2b6 | 40 | |
c597ba80 NTND |
41 | /* |
42 | * This is meant to hold a *small* number of objects that you would | |
43 | * want read_sha1_file() to be able to return, but yet you do not want | |
44 | * to write them into the object store (e.g. a browse-only | |
45 | * application). | |
46 | */ | |
47 | static struct cached_object { | |
48 | unsigned char sha1[20]; | |
49 | enum object_type type; | |
50 | void *buf; | |
51 | unsigned long size; | |
52 | } *cached_objects; | |
53 | static int cached_object_nr, cached_object_alloc; | |
54 | ||
55 | static struct cached_object empty_tree = { | |
dab0d410 | 56 | EMPTY_TREE_SHA1_BIN_LITERAL, |
c597ba80 NTND |
57 | OBJ_TREE, |
58 | "", | |
59 | 0 | |
60 | }; | |
61 | ||
62 | static struct cached_object *find_cached_object(const unsigned char *sha1) | |
63 | { | |
64 | int i; | |
65 | struct cached_object *co = cached_objects; | |
66 | ||
67 | for (i = 0; i < cached_object_nr; i++, co++) { | |
68 | if (!hashcmp(co->sha1, sha1)) | |
69 | return co; | |
70 | } | |
71 | if (!hashcmp(sha1, empty_tree.sha1)) | |
72 | return &empty_tree; | |
73 | return NULL; | |
74 | } | |
75 | ||
b2cb9425 JH |
76 | int safe_create_leading_directories(char *path) |
77 | { | |
8385abfd | 78 | char *pos = path + offset_1st_component(path); |
67d42212 JR |
79 | struct stat st; |
80 | ||
b2cb9425 JH |
81 | while (pos) { |
82 | pos = strchr(pos, '/'); | |
83 | if (!pos) | |
84 | break; | |
5f0bdf50 JH |
85 | while (*++pos == '/') |
86 | ; | |
87 | if (!*pos) | |
88 | break; | |
89 | *--pos = '\0'; | |
67d42212 JR |
90 | if (!stat(path, &st)) { |
91 | /* path exists */ | |
92 | if (!S_ISDIR(st.st_mode)) { | |
b2cb9425 | 93 | *pos = '/'; |
67d42212 | 94 | return -3; |
b2cb9425 | 95 | } |
457f06d6 | 96 | } |
67d42212 JR |
97 | else if (mkdir(path, 0777)) { |
98 | *pos = '/'; | |
99 | return -1; | |
100 | } | |
457f06d6 JS |
101 | else if (adjust_shared_perm(path)) { |
102 | *pos = '/'; | |
103 | return -2; | |
104 | } | |
b2cb9425 JH |
105 | *pos++ = '/'; |
106 | } | |
107 | return 0; | |
108 | } | |
723c31fe | 109 | |
8e21d63b JK |
110 | int safe_create_leading_directories_const(const char *path) |
111 | { | |
112 | /* path points to cache entries, so xstrdup before messing with it */ | |
113 | char *buf = xstrdup(path); | |
114 | int result = safe_create_leading_directories(buf); | |
115 | free(buf); | |
116 | return result; | |
117 | } | |
118 | ||
ace1534d JH |
119 | static void fill_sha1_path(char *pathbuf, const unsigned char *sha1) |
120 | { | |
121 | int i; | |
122 | for (i = 0; i < 20; i++) { | |
123 | static char hex[] = "0123456789abcdef"; | |
124 | unsigned int val = sha1[i]; | |
125 | char *pos = pathbuf + i*2 + (i > 0); | |
126 | *pos++ = hex[val >> 4]; | |
127 | *pos = hex[val & 0xf]; | |
128 | } | |
129 | } | |
130 | ||
0fcfd160 LT |
131 | /* |
132 | * NOTE! This returns a statically allocated buffer, so you have to be | |
790296fd | 133 | * careful about using it. Do an "xstrdup()" if you need to save the |
0fcfd160 | 134 | * filename. |
ace1534d JH |
135 | * |
136 | * Also note that this returns the location for creating. Reading | |
137 | * SHA1 file can happen from any alternate directory listed in the | |
d19938ab | 138 | * DB_ENVIRONMENT environment variable if it is not found in |
ace1534d | 139 | * the primary object database. |
0fcfd160 LT |
140 | */ |
141 | char *sha1_file_name(const unsigned char *sha1) | |
142 | { | |
560fb6a1 JK |
143 | static char buf[PATH_MAX]; |
144 | const char *objdir; | |
145 | int len; | |
0fcfd160 | 146 | |
560fb6a1 JK |
147 | objdir = get_object_directory(); |
148 | len = strlen(objdir); | |
149 | ||
150 | /* '/' + sha1(2) + '/' + sha1(38) + '\0' */ | |
151 | if (len + 43 > PATH_MAX) | |
152 | die("insanely long object directory %s", objdir); | |
153 | memcpy(buf, objdir, len); | |
154 | buf[len] = '/'; | |
155 | buf[len+3] = '/'; | |
156 | buf[len+42] = '\0'; | |
157 | fill_sha1_path(buf + len + 1, sha1); | |
158 | return buf; | |
0fcfd160 LT |
159 | } |
160 | ||
633f43e1 | 161 | static char *sha1_get_pack_name(const unsigned char *sha1, |
6eec46bd | 162 | char **name, char **base, const char *which) |
bf592c50 DB |
163 | { |
164 | static const char hex[] = "0123456789abcdef"; | |
633f43e1 | 165 | char *buf; |
bf592c50 DB |
166 | int i; |
167 | ||
633f43e1 | 168 | if (!*base) { |
bf592c50 DB |
169 | const char *sha1_file_directory = get_object_directory(); |
170 | int len = strlen(sha1_file_directory); | |
633f43e1 | 171 | *base = xmalloc(len + 60); |
6eec46bd JH |
172 | sprintf(*base, "%s/pack/pack-1234567890123456789012345678901234567890.%s", |
173 | sha1_file_directory, which); | |
633f43e1 | 174 | *name = *base + len + 11; |
bf592c50 DB |
175 | } |
176 | ||
633f43e1 | 177 | buf = *name; |
bf592c50 DB |
178 | |
179 | for (i = 0; i < 20; i++) { | |
180 | unsigned int val = *sha1++; | |
181 | *buf++ = hex[val >> 4]; | |
182 | *buf++ = hex[val & 0xf]; | |
183 | } | |
a6080a0a | 184 | |
633f43e1 | 185 | return *base; |
bf592c50 DB |
186 | } |
187 | ||
633f43e1 | 188 | char *sha1_pack_name(const unsigned char *sha1) |
bf592c50 | 189 | { |
633f43e1 | 190 | static char *name, *base; |
bf592c50 | 191 | |
6eec46bd | 192 | return sha1_get_pack_name(sha1, &name, &base, "pack"); |
633f43e1 | 193 | } |
bf592c50 | 194 | |
633f43e1 HO |
195 | char *sha1_pack_index_name(const unsigned char *sha1) |
196 | { | |
197 | static char *name, *base; | |
a6080a0a | 198 | |
6eec46bd | 199 | return sha1_get_pack_name(sha1, &name, &base, "idx"); |
bf592c50 DB |
200 | } |
201 | ||
d5a63b99 JH |
202 | struct alternate_object_database *alt_odb_list; |
203 | static struct alternate_object_database **alt_odb_tail; | |
ace1534d | 204 | |
c2f493a4 MW |
205 | static void read_info_alternates(const char * alternates, int depth); |
206 | ||
ddd5d056 JH |
207 | /* |
208 | * Prepare alternate object database registry. | |
d5a63b99 JH |
209 | * |
210 | * The variable alt_odb_list points at the list of struct | |
211 | * alternate_object_database. The elements on this list come from | |
212 | * non-empty elements from colon separated ALTERNATE_DB_ENVIRONMENT | |
213 | * environment variable, and $GIT_OBJECT_DIRECTORY/info/alternates, | |
1494e038 JH |
214 | * whose contents is similar to that environment variable but can be |
215 | * LF separated. Its base points at a statically allocated buffer that | |
d5a63b99 JH |
216 | * contains "/the/directory/corresponding/to/.git/objects/...", while |
217 | * its name points just after the slash at the end of ".git/objects/" | |
218 | * in the example above, and has enough space to hold 40-byte hex | |
219 | * SHA1, an extra slash for the first level indirection, and the | |
220 | * terminating NUL. | |
ddd5d056 | 221 | */ |
c2f493a4 | 222 | static int link_alt_odb_entry(const char * entry, int len, const char * relative_base, int depth) |
ace1534d | 223 | { |
1494e038 | 224 | const char *objdir = get_object_directory(); |
c2f493a4 MW |
225 | struct alternate_object_database *ent; |
226 | struct alternate_object_database *alt; | |
227 | /* 43 = 40-byte + 2 '/' + terminating NUL */ | |
228 | int pfxlen = len; | |
229 | int entlen = pfxlen + 43; | |
ccfd3e99 | 230 | int base_len = -1; |
d5a63b99 | 231 | |
85dadc38 | 232 | if (!is_absolute_path(entry) && relative_base) { |
c2f493a4 MW |
233 | /* Relative alt-odb */ |
234 | if (base_len < 0) | |
235 | base_len = strlen(relative_base) + 1; | |
236 | entlen += base_len; | |
237 | pfxlen += base_len; | |
238 | } | |
239 | ent = xmalloc(sizeof(*ent) + entlen); | |
240 | ||
85dadc38 | 241 | if (!is_absolute_path(entry) && relative_base) { |
c2f493a4 MW |
242 | memcpy(ent->base, relative_base, base_len - 1); |
243 | ent->base[base_len - 1] = '/'; | |
244 | memcpy(ent->base + base_len, entry, len); | |
245 | } | |
246 | else | |
247 | memcpy(ent->base, entry, pfxlen); | |
248 | ||
249 | ent->name = ent->base + pfxlen + 1; | |
250 | ent->base[pfxlen + 3] = '/'; | |
251 | ent->base[pfxlen] = ent->base[entlen-1] = 0; | |
252 | ||
253 | /* Detect cases where alternate disappeared */ | |
90b4a71c | 254 | if (!is_directory(ent->base)) { |
c2f493a4 MW |
255 | error("object directory %s does not exist; " |
256 | "check .git/objects/info/alternates.", | |
257 | ent->base); | |
258 | free(ent); | |
259 | return -1; | |
260 | } | |
261 | ||
262 | /* Prevent the common mistake of listing the same | |
263 | * thing twice, or object directory itself. | |
264 | */ | |
265 | for (alt = alt_odb_list; alt; alt = alt->next) { | |
266 | if (!memcmp(ent->base, alt->base, pfxlen)) { | |
267 | free(ent); | |
268 | return -1; | |
269 | } | |
270 | } | |
271 | if (!memcmp(ent->base, objdir, pfxlen)) { | |
272 | free(ent); | |
273 | return -1; | |
274 | } | |
275 | ||
276 | /* add the alternate entry */ | |
277 | *alt_odb_tail = ent; | |
278 | alt_odb_tail = &(ent->next); | |
279 | ent->next = NULL; | |
280 | ||
281 | /* recursively add alternates */ | |
282 | read_info_alternates(ent->base, depth + 1); | |
283 | ||
284 | ent->base[pfxlen] = '/'; | |
285 | ||
286 | return 0; | |
287 | } | |
288 | ||
289 | static void link_alt_odb_entries(const char *alt, const char *ep, int sep, | |
290 | const char *relative_base, int depth) | |
291 | { | |
292 | const char *cp, *last; | |
293 | ||
294 | if (depth > 5) { | |
295 | error("%s: ignoring alternate object stores, nesting too deep.", | |
296 | relative_base); | |
297 | return; | |
298 | } | |
299 | ||
d5a63b99 | 300 | last = alt; |
9577e7e3 JH |
301 | while (last < ep) { |
302 | cp = last; | |
303 | if (cp < ep && *cp == '#') { | |
304 | while (cp < ep && *cp != sep) | |
305 | cp++; | |
306 | last = cp + 1; | |
307 | continue; | |
308 | } | |
c2f493a4 MW |
309 | while (cp < ep && *cp != sep) |
310 | cp++; | |
d5a63b99 | 311 | if (last != cp) { |
85dadc38 | 312 | if (!is_absolute_path(last) && depth) { |
c2f493a4 MW |
313 | error("%s: ignoring relative alternate object store %s", |
314 | relative_base, last); | |
315 | } else { | |
316 | link_alt_odb_entry(last, cp - last, | |
317 | relative_base, depth); | |
1494e038 | 318 | } |
d5a63b99 | 319 | } |
9577e7e3 | 320 | while (cp < ep && *cp == sep) |
d5a63b99 JH |
321 | cp++; |
322 | last = cp; | |
9577e7e3 | 323 | } |
d5a63b99 JH |
324 | } |
325 | ||
c2f493a4 | 326 | static void read_info_alternates(const char * relative_base, int depth) |
d5a63b99 | 327 | { |
9577e7e3 | 328 | char *map; |
dc49cd76 | 329 | size_t mapsz; |
d5a63b99 | 330 | struct stat st; |
9cb18f56 JM |
331 | const char alt_file_name[] = "info/alternates"; |
332 | /* Given that relative_base is no longer than PATH_MAX, | |
333 | ensure that "path" has enough space to append "/", the | |
334 | file name, "info/alternates", and a trailing NUL. */ | |
335 | char path[PATH_MAX + 1 + sizeof alt_file_name]; | |
c2f493a4 | 336 | int fd; |
d5a63b99 | 337 | |
9cb18f56 | 338 | sprintf(path, "%s/%s", relative_base, alt_file_name); |
f2e872aa | 339 | fd = git_open_noatime(path, NULL); |
d5a63b99 JH |
340 | if (fd < 0) |
341 | return; | |
342 | if (fstat(fd, &st) || (st.st_size == 0)) { | |
343 | close(fd); | |
9a217f2a | 344 | return; |
ace1534d | 345 | } |
dc49cd76 SP |
346 | mapsz = xsize_t(st.st_size); |
347 | map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0); | |
d5a63b99 | 348 | close(fd); |
d5a63b99 | 349 | |
dc49cd76 | 350 | link_alt_odb_entries(map, map + mapsz, '\n', relative_base, depth); |
c2f493a4 | 351 | |
dc49cd76 | 352 | munmap(map, mapsz); |
ace1534d JH |
353 | } |
354 | ||
bef70b22 DB |
355 | void add_to_alternates_file(const char *reference) |
356 | { | |
357 | struct lock_file *lock = xcalloc(1, sizeof(struct lock_file)); | |
acd3b9ec | 358 | int fd = hold_lock_file_for_append(lock, git_path("objects/info/alternates"), LOCK_DIE_ON_ERROR); |
bef70b22 DB |
359 | char *alt = mkpath("%s/objects\n", reference); |
360 | write_or_die(fd, alt, strlen(alt)); | |
361 | if (commit_lock_file(lock)) | |
362 | die("could not close alternates file"); | |
363 | if (alt_odb_tail) | |
364 | link_alt_odb_entries(alt, alt + strlen(alt), '\n', NULL, 0); | |
365 | } | |
366 | ||
d79796bc JH |
367 | void foreach_alt_odb(alt_odb_fn fn, void *cb) |
368 | { | |
369 | struct alternate_object_database *ent; | |
370 | ||
371 | prepare_alt_odb(); | |
372 | for (ent = alt_odb_list; ent; ent = ent->next) | |
373 | if (fn(ent, cb)) | |
374 | return; | |
375 | } | |
376 | ||
c2f493a4 MW |
377 | void prepare_alt_odb(void) |
378 | { | |
554fe20d | 379 | const char *alt; |
c2f493a4 | 380 | |
7dc24aa5 SP |
381 | if (alt_odb_tail) |
382 | return; | |
383 | ||
c2f493a4 MW |
384 | alt = getenv(ALTERNATE_DB_ENVIRONMENT); |
385 | if (!alt) alt = ""; | |
386 | ||
c2f493a4 | 387 | alt_odb_tail = &alt_odb_list; |
80ba074f | 388 | link_alt_odb_entries(alt, alt + strlen(alt), PATH_SEP, NULL, 0); |
c2f493a4 MW |
389 | |
390 | read_info_alternates(get_object_directory(), 0); | |
391 | } | |
392 | ||
0f4dc14a | 393 | static int has_loose_object_local(const unsigned char *sha1) |
ace1534d | 394 | { |
ace1534d | 395 | char *name = sha1_file_name(sha1); |
0f4dc14a BC |
396 | return !access(name, F_OK); |
397 | } | |
ace1534d | 398 | |
0f4dc14a BC |
399 | int has_loose_object_nonlocal(const unsigned char *sha1) |
400 | { | |
401 | struct alternate_object_database *alt; | |
9a217f2a | 402 | prepare_alt_odb(); |
d5a63b99 | 403 | for (alt = alt_odb_list; alt; alt = alt->next) { |
0f4dc14a | 404 | fill_sha1_path(alt->name, sha1); |
c529d75a LT |
405 | if (!access(alt->base, F_OK)) |
406 | return 1; | |
ace1534d | 407 | } |
c529d75a | 408 | return 0; |
ace1534d JH |
409 | } |
410 | ||
0f4dc14a BC |
411 | static int has_loose_object(const unsigned char *sha1) |
412 | { | |
413 | return has_loose_object_local(sha1) || | |
414 | has_loose_object_nonlocal(sha1); | |
415 | } | |
416 | ||
60bb8b14 | 417 | static unsigned int pack_used_ctr; |
a53128b6 SP |
418 | static unsigned int pack_mmap_calls; |
419 | static unsigned int peak_pack_open_windows; | |
420 | static unsigned int pack_open_windows; | |
c7934306 SP |
421 | static unsigned int pack_open_fds; |
422 | static unsigned int pack_max_fds; | |
a53128b6 | 423 | static size_t peak_pack_mapped; |
60bb8b14 | 424 | static size_t pack_mapped; |
9a217f2a | 425 | struct packed_git *packed_git; |
1f688557 | 426 | |
b79d18c9 | 427 | void pack_report(void) |
a53128b6 SP |
428 | { |
429 | fprintf(stderr, | |
e05db0fd PR |
430 | "pack_report: getpagesize() = %10" SZ_FMT "\n" |
431 | "pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n" | |
432 | "pack_report: core.packedGitLimit = %10" SZ_FMT "\n", | |
9e42d6a1 SP |
433 | sz_fmt(getpagesize()), |
434 | sz_fmt(packed_git_window_size), | |
435 | sz_fmt(packed_git_limit)); | |
a53128b6 SP |
436 | fprintf(stderr, |
437 | "pack_report: pack_used_ctr = %10u\n" | |
438 | "pack_report: pack_mmap_calls = %10u\n" | |
439 | "pack_report: pack_open_windows = %10u / %10u\n" | |
e05db0fd PR |
440 | "pack_report: pack_mapped = " |
441 | "%10" SZ_FMT " / %10" SZ_FMT "\n", | |
a53128b6 SP |
442 | pack_used_ctr, |
443 | pack_mmap_calls, | |
444 | pack_open_windows, peak_pack_open_windows, | |
9e42d6a1 | 445 | sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped)); |
a53128b6 SP |
446 | } |
447 | ||
42873078 | 448 | static int check_packed_git_idx(const char *path, struct packed_git *p) |
1f688557 JH |
449 | { |
450 | void *idx_map; | |
42873078 | 451 | struct pack_idx_header *hdr; |
dc49cd76 | 452 | size_t idx_size; |
74e34e1f | 453 | uint32_t version, nr, i, *index; |
f2e872aa | 454 | int fd = git_open_noatime(path, p); |
1f688557 | 455 | struct stat st; |
42873078 | 456 | |
1f688557 JH |
457 | if (fd < 0) |
458 | return -1; | |
459 | if (fstat(fd, &st)) { | |
460 | close(fd); | |
461 | return -1; | |
462 | } | |
dc49cd76 | 463 | idx_size = xsize_t(st.st_size); |
2d88451b SP |
464 | if (idx_size < 4 * 256 + 20 + 20) { |
465 | close(fd); | |
466 | return error("index file %s is too small", path); | |
467 | } | |
c4712e45 | 468 | idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0); |
1f688557 | 469 | close(fd); |
1f688557 | 470 | |
42873078 NP |
471 | hdr = idx_map; |
472 | if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) { | |
74e34e1f NP |
473 | version = ntohl(hdr->idx_version); |
474 | if (version < 2 || version > 2) { | |
475 | munmap(idx_map, idx_size); | |
6e1c2344 | 476 | return error("index file %s is version %"PRIu32 |
74e34e1f NP |
477 | " and is not supported by this binary" |
478 | " (try upgrading GIT to a newer version)", | |
479 | path, version); | |
480 | } | |
481 | } else | |
482 | version = 1; | |
df1b059d | 483 | |
1f688557 | 484 | nr = 0; |
42873078 | 485 | index = idx_map; |
74e34e1f NP |
486 | if (version > 1) |
487 | index += 2; /* skip index header */ | |
1f688557 | 488 | for (i = 0; i < 256; i++) { |
326bf396 | 489 | uint32_t n = ntohl(index[i]); |
2d88451b SP |
490 | if (n < nr) { |
491 | munmap(idx_map, idx_size); | |
df1b059d | 492 | return error("non-monotonic index %s", path); |
2d88451b | 493 | } |
1f688557 JH |
494 | nr = n; |
495 | } | |
496 | ||
74e34e1f NP |
497 | if (version == 1) { |
498 | /* | |
499 | * Total size: | |
500 | * - 256 index entries 4 bytes each | |
501 | * - 24-byte entries * nr (20-byte sha1 + 4-byte offset) | |
502 | * - 20-byte SHA1 of the packfile | |
503 | * - 20-byte SHA1 file checksum | |
504 | */ | |
505 | if (idx_size != 4*256 + nr * 24 + 20 + 20) { | |
506 | munmap(idx_map, idx_size); | |
eef427a0 | 507 | return error("wrong index v1 file size in %s", path); |
74e34e1f NP |
508 | } |
509 | } else if (version == 2) { | |
510 | /* | |
511 | * Minimum size: | |
512 | * - 8 bytes of header | |
513 | * - 256 index entries 4 bytes each | |
514 | * - 20-byte sha1 entry * nr | |
515 | * - 4-byte crc entry * nr | |
516 | * - 4-byte offset entry * nr | |
517 | * - 20-byte SHA1 of the packfile | |
518 | * - 20-byte SHA1 file checksum | |
519 | * And after the 4-byte offset table might be a | |
520 | * variable sized table containing 8-byte entries | |
521 | * for offsets larger than 2^31. | |
522 | */ | |
523 | unsigned long min_size = 8 + 4*256 + nr*(20 + 4 + 4) + 20 + 20; | |
1164f1e4 LT |
524 | unsigned long max_size = min_size; |
525 | if (nr) | |
526 | max_size += (nr - 1)*8; | |
527 | if (idx_size < min_size || idx_size > max_size) { | |
74e34e1f | 528 | munmap(idx_map, idx_size); |
eef427a0 | 529 | return error("wrong index v2 file size in %s", path); |
74e34e1f | 530 | } |
7109c889 JH |
531 | if (idx_size != min_size && |
532 | /* | |
533 | * make sure we can deal with large pack offsets. | |
534 | * 31-bit signed offset won't be enough, neither | |
535 | * 32-bit unsigned one will be. | |
536 | */ | |
537 | (sizeof(off_t) <= 4)) { | |
538 | munmap(idx_map, idx_size); | |
539 | return error("pack too large for current definition of off_t in %s", path); | |
74e34e1f | 540 | } |
2d88451b | 541 | } |
1f688557 | 542 | |
74e34e1f | 543 | p->index_version = version; |
42873078 NP |
544 | p->index_data = idx_map; |
545 | p->index_size = idx_size; | |
57059091 | 546 | p->num_objects = nr; |
1f688557 JH |
547 | return 0; |
548 | } | |
549 | ||
bc8e478a | 550 | int open_pack_index(struct packed_git *p) |
d079837e SP |
551 | { |
552 | char *idx_name; | |
553 | int ret; | |
554 | ||
555 | if (p->index_data) | |
556 | return 0; | |
557 | ||
558 | idx_name = xstrdup(p->pack_name); | |
559 | strcpy(idx_name + strlen(idx_name) - strlen(".pack"), ".idx"); | |
560 | ret = check_packed_git_idx(idx_name, p); | |
561 | free(idx_name); | |
562 | return ret; | |
563 | } | |
564 | ||
11daf39b SP |
565 | static void scan_windows(struct packed_git *p, |
566 | struct packed_git **lru_p, | |
567 | struct pack_window **lru_w, | |
568 | struct pack_window **lru_l) | |
1f688557 | 569 | { |
11daf39b SP |
570 | struct pack_window *w, *w_l; |
571 | ||
572 | for (w_l = NULL, w = p->windows; w; w = w->next) { | |
573 | if (!w->inuse_cnt) { | |
574 | if (!*lru_w || w->last_used < (*lru_w)->last_used) { | |
575 | *lru_p = p; | |
576 | *lru_w = w; | |
577 | *lru_l = w_l; | |
54044bf8 | 578 | } |
54044bf8 | 579 | } |
11daf39b | 580 | w_l = w; |
f9253394 | 581 | } |
11daf39b SP |
582 | } |
583 | ||
d1efefa4 | 584 | static int unuse_one_window(struct packed_git *current, int keep_fd) |
11daf39b SP |
585 | { |
586 | struct packed_git *p, *lru_p = NULL; | |
587 | struct pack_window *lru_w = NULL, *lru_l = NULL; | |
588 | ||
589 | if (current) | |
590 | scan_windows(current, &lru_p, &lru_w, &lru_l); | |
591 | for (p = packed_git; p; p = p->next) | |
592 | scan_windows(p, &lru_p, &lru_w, &lru_l); | |
54044bf8 SP |
593 | if (lru_p) { |
594 | munmap(lru_w->base, lru_w->len); | |
595 | pack_mapped -= lru_w->len; | |
596 | if (lru_l) | |
597 | lru_l->next = lru_w->next; | |
598 | else { | |
599 | lru_p->windows = lru_w->next; | |
d131b7af SP |
600 | if (!lru_p->windows && lru_p->pack_fd != -1 |
601 | && lru_p->pack_fd != keep_fd) { | |
54044bf8 | 602 | close(lru_p->pack_fd); |
c7934306 | 603 | pack_open_fds--; |
54044bf8 SP |
604 | lru_p->pack_fd = -1; |
605 | } | |
606 | } | |
607 | free(lru_w); | |
a53128b6 | 608 | pack_open_windows--; |
54044bf8 SP |
609 | return 1; |
610 | } | |
611 | return 0; | |
f9253394 JH |
612 | } |
613 | ||
d1efefa4 | 614 | void release_pack_memory(size_t need, int fd) |
97bfeb34 SP |
615 | { |
616 | size_t cur = pack_mapped; | |
d1efefa4 | 617 | while (need >= (cur - pack_mapped) && unuse_one_window(NULL, fd)) |
97bfeb34 SP |
618 | ; /* nothing */ |
619 | } | |
620 | ||
58ecbd5e JN |
621 | void *xmmap(void *start, size_t length, |
622 | int prot, int flags, int fd, off_t offset) | |
623 | { | |
624 | void *ret = mmap(start, length, prot, flags, fd, offset); | |
625 | if (ret == MAP_FAILED) { | |
626 | if (!length) | |
627 | return NULL; | |
628 | release_pack_memory(length, fd); | |
629 | ret = mmap(start, length, prot, flags, fd, offset); | |
630 | if (ret == MAP_FAILED) | |
631 | die_errno("Out of memory? mmap failed"); | |
632 | } | |
633 | return ret; | |
634 | } | |
635 | ||
c9ced051 SP |
636 | void close_pack_windows(struct packed_git *p) |
637 | { | |
638 | while (p->windows) { | |
639 | struct pack_window *w = p->windows; | |
640 | ||
641 | if (w->inuse_cnt) | |
642 | die("pack '%s' still has open windows to it", | |
643 | p->pack_name); | |
644 | munmap(w->base, w->len); | |
645 | pack_mapped -= w->len; | |
646 | pack_open_windows--; | |
647 | p->windows = w->next; | |
648 | free(w); | |
649 | } | |
650 | } | |
651 | ||
03e79c88 | 652 | void unuse_pack(struct pack_window **w_cursor) |
f9253394 | 653 | { |
03e79c88 SP |
654 | struct pack_window *w = *w_cursor; |
655 | if (w) { | |
656 | w->inuse_cnt--; | |
657 | *w_cursor = NULL; | |
658 | } | |
1f688557 JH |
659 | } |
660 | ||
fa5fc15d SP |
661 | void close_pack_index(struct packed_git *p) |
662 | { | |
663 | if (p->index_data) { | |
664 | munmap((void *)p->index_data, p->index_size); | |
665 | p->index_data = NULL; | |
666 | } | |
667 | } | |
668 | ||
c74faea1 NP |
669 | /* |
670 | * This is used by git-repack in case a newly created pack happens to | |
671 | * contain the same set of objects as an existing one. In that case | |
672 | * the resulting file might be different even if its name would be the | |
673 | * same. It is best to close any reference to the old pack before it is | |
674 | * replaced on disk. Of course no index pointers nor windows for given pack | |
675 | * must subsist at this point. If ever objects from this pack are requested | |
676 | * again, the new version of the pack will be reinitialized through | |
677 | * reprepare_packed_git(). | |
678 | */ | |
679 | void free_pack_by_name(const char *pack_name) | |
680 | { | |
681 | struct packed_git *p, **pp = &packed_git; | |
682 | ||
683 | while (*pp) { | |
684 | p = *pp; | |
685 | if (strcmp(pack_name, p->pack_name) == 0) { | |
fa3a0c94 | 686 | clear_delta_base_cache(); |
c74faea1 | 687 | close_pack_windows(p); |
c7934306 | 688 | if (p->pack_fd != -1) { |
c74faea1 | 689 | close(p->pack_fd); |
c7934306 SP |
690 | pack_open_fds--; |
691 | } | |
fa5fc15d | 692 | close_pack_index(p); |
c74faea1 NP |
693 | free(p->bad_object_sha1); |
694 | *pp = p->next; | |
695 | free(p); | |
696 | return; | |
697 | } | |
698 | pp = &p->next; | |
699 | } | |
700 | } | |
701 | ||
3cf8b462 SP |
702 | /* |
703 | * Do not call this directly as this leaks p->pack_fd on error return; | |
704 | * call open_packed_git() instead. | |
705 | */ | |
706 | static int open_packed_git_1(struct packed_git *p) | |
1f688557 | 707 | { |
9bc879c1 SP |
708 | struct stat st; |
709 | struct pack_header hdr; | |
710 | unsigned char sha1[20]; | |
711 | unsigned char *idx_sha1; | |
2c039da8 | 712 | long fd_flag; |
9bc879c1 | 713 | |
d079837e SP |
714 | if (!p->index_data && open_pack_index(p)) |
715 | return error("packfile %s index unavailable", p->pack_name); | |
716 | ||
c7934306 SP |
717 | if (!pack_max_fds) { |
718 | struct rlimit lim; | |
719 | unsigned int max_fds; | |
720 | ||
721 | if (getrlimit(RLIMIT_NOFILE, &lim)) | |
722 | die_errno("cannot get RLIMIT_NOFILE"); | |
723 | ||
724 | max_fds = lim.rlim_cur; | |
725 | ||
726 | /* Save 3 for stdin/stdout/stderr, 22 for work */ | |
727 | if (25 < max_fds) | |
728 | pack_max_fds = max_fds - 25; | |
729 | else | |
730 | pack_max_fds = 1; | |
731 | } | |
732 | ||
733 | while (pack_max_fds <= pack_open_fds && unuse_one_window(NULL, -1)) | |
734 | ; /* nothing */ | |
735 | ||
f2e872aa | 736 | p->pack_fd = git_open_noatime(p->pack_name, p); |
9bc879c1 | 737 | if (p->pack_fd < 0 || fstat(p->pack_fd, &st)) |
072db278 | 738 | return -1; |
c7934306 | 739 | pack_open_fds++; |
9bc879c1 SP |
740 | |
741 | /* If we created the struct before we had the pack we lack size. */ | |
bf592c50 | 742 | if (!p->pack_size) { |
bf592c50 | 743 | if (!S_ISREG(st.st_mode)) |
072db278 | 744 | return error("packfile %s not a regular file", p->pack_name); |
bf592c50 | 745 | p->pack_size = st.st_size; |
9bc879c1 | 746 | } else if (p->pack_size != st.st_size) |
072db278 | 747 | return error("packfile %s size changed", p->pack_name); |
9bc879c1 | 748 | |
2c039da8 JH |
749 | /* We leave these file descriptors open with sliding mmap; |
750 | * there is no point keeping them open across exec(), though. | |
751 | */ | |
752 | fd_flag = fcntl(p->pack_fd, F_GETFD, 0); | |
753 | if (fd_flag < 0) | |
072db278 | 754 | return error("cannot determine file descriptor flags"); |
2c039da8 JH |
755 | fd_flag |= FD_CLOEXEC; |
756 | if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1) | |
072db278 | 757 | return error("cannot set FD_CLOEXEC"); |
2c039da8 | 758 | |
9bc879c1 | 759 | /* Verify we recognize this pack file format. */ |
e6e2bd62 | 760 | if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr)) |
072db278 | 761 | return error("file %s is far too short to be a packfile", p->pack_name); |
9bc879c1 | 762 | if (hdr.hdr_signature != htonl(PACK_SIGNATURE)) |
072db278 | 763 | return error("file %s is not a GIT packfile", p->pack_name); |
9bc879c1 | 764 | if (!pack_version_ok(hdr.hdr_version)) |
6e1c2344 RJ |
765 | return error("packfile %s is version %"PRIu32" and not" |
766 | " supported (try upgrading GIT to a newer version)", | |
9bc879c1 SP |
767 | p->pack_name, ntohl(hdr.hdr_version)); |
768 | ||
769 | /* Verify the pack matches its index. */ | |
57059091 | 770 | if (p->num_objects != ntohl(hdr.hdr_entries)) |
6e1c2344 RJ |
771 | return error("packfile %s claims to have %"PRIu32" objects" |
772 | " while index indicates %"PRIu32" objects", | |
57059091 NP |
773 | p->pack_name, ntohl(hdr.hdr_entries), |
774 | p->num_objects); | |
9bc879c1 | 775 | if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1) |
072db278 | 776 | return error("end of packfile %s is unavailable", p->pack_name); |
e6e2bd62 | 777 | if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1)) |
072db278 | 778 | return error("packfile %s signature is unavailable", p->pack_name); |
42873078 | 779 | idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40; |
9bc879c1 | 780 | if (hashcmp(sha1, idx_sha1)) |
072db278 SP |
781 | return error("packfile %s does not match index", p->pack_name); |
782 | return 0; | |
9bc879c1 SP |
783 | } |
784 | ||
3cf8b462 SP |
785 | static int open_packed_git(struct packed_git *p) |
786 | { | |
787 | if (!open_packed_git_1(p)) | |
788 | return 0; | |
789 | if (p->pack_fd != -1) { | |
790 | close(p->pack_fd); | |
c7934306 | 791 | pack_open_fds--; |
3cf8b462 SP |
792 | p->pack_fd = -1; |
793 | } | |
794 | return -1; | |
795 | } | |
796 | ||
c4001d92 | 797 | static int in_window(struct pack_window *win, off_t offset) |
60bb8b14 SP |
798 | { |
799 | /* We must promise at least 20 bytes (one hash) after the | |
800 | * offset is available from this window, otherwise the offset | |
801 | * is not actually in this window and a different window (which | |
802 | * has that one hash excess) must be used. This is to support | |
803 | * the object header and delta base parsing routines below. | |
804 | */ | |
805 | off_t win_off = win->offset; | |
806 | return win_off <= offset | |
807 | && (offset + 20) <= (win_off + win->len); | |
808 | } | |
809 | ||
4b25d091 | 810 | unsigned char *use_pack(struct packed_git *p, |
03e79c88 | 811 | struct pack_window **w_cursor, |
c4001d92 | 812 | off_t offset, |
03e79c88 | 813 | unsigned int *left) |
9bc879c1 | 814 | { |
60bb8b14 | 815 | struct pack_window *win = *w_cursor; |
03e79c88 | 816 | |
a9d98a14 | 817 | /* Since packfiles end in a hash of their content and it's |
60bb8b14 SP |
818 | * pointless to ask for an offset into the middle of that |
819 | * hash, and the in_window function above wouldn't match | |
820 | * don't allow an offset too close to the end of the file. | |
821 | */ | |
d131b7af SP |
822 | if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p)) |
823 | die("packfile %s cannot be accessed", p->pack_name); | |
60bb8b14 SP |
824 | if (offset > (p->pack_size - 20)) |
825 | die("offset beyond end of packfile (truncated pack?)"); | |
826 | ||
827 | if (!win || !in_window(win, offset)) { | |
828 | if (win) | |
829 | win->inuse_cnt--; | |
830 | for (win = p->windows; win; win = win->next) { | |
831 | if (in_window(win, offset)) | |
832 | break; | |
833 | } | |
834 | if (!win) { | |
78a28df9 | 835 | size_t window_align = packed_git_window_size / 2; |
dc49cd76 | 836 | off_t len; |
d131b7af SP |
837 | |
838 | if (p->pack_fd == -1 && open_packed_git(p)) | |
839 | die("packfile %s cannot be accessed", p->pack_name); | |
840 | ||
60bb8b14 | 841 | win = xcalloc(1, sizeof(*win)); |
78a28df9 | 842 | win->offset = (offset / window_align) * window_align; |
dc49cd76 SP |
843 | len = p->pack_size - win->offset; |
844 | if (len > packed_git_window_size) | |
845 | len = packed_git_window_size; | |
846 | win->len = (size_t)len; | |
60bb8b14 | 847 | pack_mapped += win->len; |
11daf39b | 848 | while (packed_git_limit < pack_mapped |
d1efefa4 | 849 | && unuse_one_window(p, p->pack_fd)) |
60bb8b14 | 850 | ; /* nothing */ |
c4712e45 | 851 | win->base = xmmap(NULL, win->len, |
60bb8b14 SP |
852 | PROT_READ, MAP_PRIVATE, |
853 | p->pack_fd, win->offset); | |
854 | if (win->base == MAP_FAILED) | |
73b4e4be SP |
855 | die("packfile %s cannot be mapped: %s", |
856 | p->pack_name, | |
857 | strerror(errno)); | |
d131b7af SP |
858 | if (!win->offset && win->len == p->pack_size |
859 | && !p->do_not_close) { | |
860 | close(p->pack_fd); | |
861 | pack_open_fds--; | |
862 | p->pack_fd = -1; | |
863 | } | |
a53128b6 SP |
864 | pack_mmap_calls++; |
865 | pack_open_windows++; | |
866 | if (pack_mapped > peak_pack_mapped) | |
867 | peak_pack_mapped = pack_mapped; | |
868 | if (pack_open_windows > peak_pack_open_windows) | |
869 | peak_pack_open_windows = pack_open_windows; | |
60bb8b14 SP |
870 | win->next = p->windows; |
871 | p->windows = win; | |
872 | } | |
1f688557 | 873 | } |
03e79c88 SP |
874 | if (win != *w_cursor) { |
875 | win->last_used = pack_used_ctr++; | |
876 | win->inuse_cnt++; | |
877 | *w_cursor = win; | |
878 | } | |
60bb8b14 | 879 | offset -= win->offset; |
03e79c88 | 880 | if (left) |
dc49cd76 | 881 | *left = win->len - xsize_t(offset); |
03e79c88 | 882 | return win->base + offset; |
1f688557 JH |
883 | } |
884 | ||
27d69a46 NP |
885 | static struct packed_git *alloc_packed_git(int extra) |
886 | { | |
887 | struct packed_git *p = xmalloc(sizeof(*p) + extra); | |
888 | memset(p, 0, sizeof(*p)); | |
889 | p->pack_fd = -1; | |
890 | return p; | |
891 | } | |
892 | ||
e0500293 JN |
893 | static void try_to_free_pack_memory(size_t size) |
894 | { | |
895 | release_pack_memory(size, -1); | |
896 | } | |
897 | ||
42873078 | 898 | struct packed_git *add_packed_git(const char *path, int path_len, int local) |
1f688557 | 899 | { |
e0500293 | 900 | static int have_set_try_to_free_routine; |
1f688557 | 901 | struct stat st; |
27d69a46 | 902 | struct packed_git *p = alloc_packed_git(path_len + 2); |
1f688557 | 903 | |
e0500293 JN |
904 | if (!have_set_try_to_free_routine) { |
905 | have_set_try_to_free_routine = 1; | |
906 | set_try_to_free_routine(try_to_free_pack_memory); | |
907 | } | |
908 | ||
42873078 NP |
909 | /* |
910 | * Make sure a corresponding .pack file exists and that | |
911 | * the index looks sane. | |
912 | */ | |
913 | path_len -= strlen(".idx"); | |
27d69a46 NP |
914 | if (path_len < 1) { |
915 | free(p); | |
1f688557 | 916 | return NULL; |
27d69a46 | 917 | } |
42873078 | 918 | memcpy(p->pack_name, path, path_len); |
8d25931d BC |
919 | |
920 | strcpy(p->pack_name + path_len, ".keep"); | |
921 | if (!access(p->pack_name, F_OK)) | |
922 | p->pack_keep = 1; | |
923 | ||
42873078 | 924 | strcpy(p->pack_name + path_len, ".pack"); |
d079837e | 925 | if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) { |
42873078 | 926 | free(p); |
1f688557 JH |
927 | return NULL; |
928 | } | |
42873078 | 929 | |
1f688557 JH |
930 | /* ok, it looks sane as far as we can check without |
931 | * actually mapping the pack file. | |
932 | */ | |
1f688557 | 933 | p->pack_size = st.st_size; |
9d835df2 | 934 | p->pack_local = local; |
b867092f | 935 | p->mtime = st.st_mtime; |
42873078 NP |
936 | if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1)) |
937 | hashclr(p->sha1); | |
1f688557 JH |
938 | return p; |
939 | } | |
940 | ||
7b64469a | 941 | struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path) |
c508df5e | 942 | { |
42873078 | 943 | const char *path = sha1_pack_name(sha1); |
27d69a46 | 944 | struct packed_git *p = alloc_packed_git(strlen(path) + 1); |
bf592c50 | 945 | |
27d69a46 NP |
946 | strcpy(p->pack_name, path); |
947 | hashcpy(p->sha1, sha1); | |
42873078 NP |
948 | if (check_packed_git_idx(idx_path, p)) { |
949 | free(p); | |
bf592c50 | 950 | return NULL; |
42873078 | 951 | } |
bf592c50 | 952 | |
bf592c50 DB |
953 | return p; |
954 | } | |
955 | ||
956 | void install_packed_git(struct packed_git *pack) | |
957 | { | |
c7934306 SP |
958 | if (pack->pack_fd != -1) |
959 | pack_open_fds++; | |
960 | ||
bf592c50 DB |
961 | pack->next = packed_git; |
962 | packed_git = pack; | |
963 | } | |
964 | ||
9d835df2 | 965 | static void prepare_packed_git_one(char *objdir, int local) |
1f688557 | 966 | { |
9cb18f56 JM |
967 | /* Ensure that this buffer is large enough so that we can |
968 | append "/pack/" without clobbering the stack even if | |
969 | strlen(objdir) were PATH_MAX. */ | |
970 | char path[PATH_MAX + 1 + 4 + 1 + 1]; | |
1f688557 JH |
971 | int len; |
972 | DIR *dir; | |
973 | struct dirent *de; | |
974 | ||
975 | sprintf(path, "%s/pack", objdir); | |
976 | len = strlen(path); | |
977 | dir = opendir(path); | |
b5b16990 | 978 | if (!dir) { |
26125f6b | 979 | if (errno != ENOENT) |
bd2afde8 | 980 | error("unable to open object pack directory: %s: %s", |
26125f6b | 981 | path, strerror(errno)); |
1f688557 | 982 | return; |
b5b16990 | 983 | } |
1f688557 JH |
984 | path[len++] = '/'; |
985 | while ((de = readdir(dir)) != NULL) { | |
986 | int namelen = strlen(de->d_name); | |
987 | struct packed_git *p; | |
988 | ||
5bb1cda5 | 989 | if (!has_extension(de->d_name, ".idx")) |
1f688557 JH |
990 | continue; |
991 | ||
9cb18f56 JM |
992 | if (len + namelen + 1 > sizeof(path)) |
993 | continue; | |
994 | ||
54a15a8d | 995 | /* Don't reopen a pack we already have. */ |
1f688557 | 996 | strcpy(path + len, de->d_name); |
86f7780c JK |
997 | for (p = packed_git; p; p = p->next) { |
998 | if (!memcmp(path, p->pack_name, len + namelen - 4)) | |
999 | break; | |
1000 | } | |
1001 | if (p) | |
1002 | continue; | |
54a15a8d SP |
1003 | /* See if it really is a valid .idx file with corresponding |
1004 | * .pack file that we can map. | |
1005 | */ | |
9d835df2 | 1006 | p = add_packed_git(path, len + namelen, local); |
1f688557 JH |
1007 | if (!p) |
1008 | continue; | |
625e9421 | 1009 | install_packed_git(p); |
1f688557 | 1010 | } |
5b35bcd5 | 1011 | closedir(dir); |
1f688557 JH |
1012 | } |
1013 | ||
b867092f JH |
1014 | static int sort_pack(const void *a_, const void *b_) |
1015 | { | |
1016 | struct packed_git *a = *((struct packed_git **)a_); | |
1017 | struct packed_git *b = *((struct packed_git **)b_); | |
1018 | int st; | |
1019 | ||
1020 | /* | |
1021 | * Local packs tend to contain objects specific to our | |
1022 | * variant of the project than remote ones. In addition, | |
1023 | * remote ones could be on a network mounted filesystem. | |
1024 | * Favor local ones for these reasons. | |
1025 | */ | |
1026 | st = a->pack_local - b->pack_local; | |
1027 | if (st) | |
1028 | return -st; | |
1029 | ||
1030 | /* | |
1031 | * Younger packs tend to contain more recent objects, | |
1032 | * and more recent objects tend to get accessed more | |
1033 | * often. | |
1034 | */ | |
1035 | if (a->mtime < b->mtime) | |
1036 | return 1; | |
1037 | else if (a->mtime == b->mtime) | |
1038 | return 0; | |
1039 | return -1; | |
1040 | } | |
1041 | ||
1042 | static void rearrange_packed_git(void) | |
1043 | { | |
1044 | struct packed_git **ary, *p; | |
1045 | int i, n; | |
1046 | ||
1047 | for (n = 0, p = packed_git; p; p = p->next) | |
1048 | n++; | |
1049 | if (n < 2) | |
1050 | return; | |
1051 | ||
1052 | /* prepare an array of packed_git for easier sorting */ | |
1053 | ary = xcalloc(n, sizeof(struct packed_git *)); | |
1054 | for (n = 0, p = packed_git; p; p = p->next) | |
1055 | ary[n++] = p; | |
1056 | ||
1057 | qsort(ary, n, sizeof(struct packed_git *), sort_pack); | |
1058 | ||
1059 | /* link them back again */ | |
1060 | for (i = 0; i < n - 1; i++) | |
1061 | ary[i]->next = ary[i + 1]; | |
1062 | ary[n - 1]->next = NULL; | |
1063 | packed_git = ary[0]; | |
1064 | ||
1065 | free(ary); | |
1066 | } | |
1067 | ||
637cdd9d | 1068 | static int prepare_packed_git_run_once = 0; |
9a217f2a | 1069 | void prepare_packed_git(void) |
1f688557 | 1070 | { |
d5a63b99 | 1071 | struct alternate_object_database *alt; |
1f688557 | 1072 | |
637cdd9d | 1073 | if (prepare_packed_git_run_once) |
1f688557 | 1074 | return; |
9d835df2 | 1075 | prepare_packed_git_one(get_object_directory(), 1); |
9a217f2a | 1076 | prepare_alt_odb(); |
d5a63b99 | 1077 | for (alt = alt_odb_list; alt; alt = alt->next) { |
1494e038 | 1078 | alt->name[-1] = 0; |
9d835df2 | 1079 | prepare_packed_git_one(alt->base, 0); |
1494e038 | 1080 | alt->name[-1] = '/'; |
1f688557 | 1081 | } |
b867092f | 1082 | rearrange_packed_git(); |
637cdd9d JK |
1083 | prepare_packed_git_run_once = 1; |
1084 | } | |
1085 | ||
fc04c412 | 1086 | void reprepare_packed_git(void) |
637cdd9d | 1087 | { |
4b480c67 | 1088 | discard_revindex(); |
637cdd9d JK |
1089 | prepare_packed_git_run_once = 0; |
1090 | prepare_packed_git(); | |
1f688557 JH |
1091 | } |
1092 | ||
8eca0b47 NP |
1093 | static void mark_bad_packed_object(struct packed_git *p, |
1094 | const unsigned char *sha1) | |
1095 | { | |
1096 | unsigned i; | |
1097 | for (i = 0; i < p->num_bad_objects; i++) | |
1098 | if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i)) | |
1099 | return; | |
1100 | p->bad_object_sha1 = xrealloc(p->bad_object_sha1, 20 * (p->num_bad_objects + 1)); | |
1101 | hashcpy(p->bad_object_sha1 + 20 * p->num_bad_objects, sha1); | |
1102 | p->num_bad_objects++; | |
1103 | } | |
1104 | ||
b6c4cecc | 1105 | static const struct packed_git *has_packed_and_bad(const unsigned char *sha1) |
ac939109 NP |
1106 | { |
1107 | struct packed_git *p; | |
1108 | unsigned i; | |
1109 | ||
1110 | for (p = packed_git; p; p = p->next) | |
1111 | for (i = 0; i < p->num_bad_objects; i++) | |
1112 | if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i)) | |
b6c4cecc JH |
1113 | return p; |
1114 | return NULL; | |
ac939109 NP |
1115 | } |
1116 | ||
5d6ccf5c | 1117 | int check_sha1_signature(const unsigned char *sha1, void *map, unsigned long size, const char *type) |
0fcfd160 LT |
1118 | { |
1119 | unsigned char real_sha1[20]; | |
7cfb5f36 | 1120 | hash_sha1_file(map, size, type, real_sha1); |
a89fccd2 | 1121 | return hashcmp(sha1, real_sha1) ? -1 : 0; |
0fcfd160 LT |
1122 | } |
1123 | ||
f2e872aa | 1124 | static int git_open_noatime(const char *name, struct packed_git *p) |
44d1c19e LT |
1125 | { |
1126 | static int sha1_file_open_flag = O_NOATIME; | |
44d1c19e | 1127 | |
f2e872aa SP |
1128 | for (;;) { |
1129 | int fd = open(name, O_RDONLY | sha1_file_open_flag); | |
44d1c19e | 1130 | if (fd >= 0) |
f2e872aa SP |
1131 | return fd; |
1132 | ||
f2e872aa SP |
1133 | /* Might the failure be due to O_NOATIME? */ |
1134 | if (errno != ENOENT && sha1_file_open_flag) { | |
44d1c19e | 1135 | sha1_file_open_flag = 0; |
f2e872aa SP |
1136 | continue; |
1137 | } | |
1138 | ||
1139 | return -1; | |
44d1c19e | 1140 | } |
44d1c19e LT |
1141 | } |
1142 | ||
1143 | static int open_sha1_file(const unsigned char *sha1) | |
1144 | { | |
1145 | int fd; | |
1146 | char *name = sha1_file_name(sha1); | |
1147 | struct alternate_object_database *alt; | |
1148 | ||
f2e872aa | 1149 | fd = git_open_noatime(name, NULL); |
44d1c19e LT |
1150 | if (fd >= 0) |
1151 | return fd; | |
1152 | ||
1153 | prepare_alt_odb(); | |
1154 | errno = ENOENT; | |
1155 | for (alt = alt_odb_list; alt; alt = alt->next) { | |
1156 | name = alt->name; | |
1157 | fill_sha1_path(name, sha1); | |
f2e872aa | 1158 | fd = git_open_noatime(alt->base, NULL); |
44d1c19e LT |
1159 | if (fd >= 0) |
1160 | return fd; | |
1161 | } | |
1162 | return -1; | |
1163 | } | |
1164 | ||
4175e9e3 | 1165 | static void *map_sha1_file(const unsigned char *sha1, unsigned long *size) |
0fcfd160 | 1166 | { |
0fcfd160 | 1167 | void *map; |
144bde78 | 1168 | int fd; |
ace1534d | 1169 | |
44d1c19e LT |
1170 | fd = open_sha1_file(sha1); |
1171 | map = NULL; | |
1172 | if (fd >= 0) { | |
1173 | struct stat st; | |
0fcfd160 | 1174 | |
44d1c19e LT |
1175 | if (!fstat(fd, &st)) { |
1176 | *size = xsize_t(st.st_size); | |
1177 | map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0); | |
144bde78 | 1178 | } |
44d1c19e | 1179 | close(fd); |
0fcfd160 | 1180 | } |
0fcfd160 LT |
1181 | return map; |
1182 | } | |
1183 | ||
726f852b | 1184 | static int legacy_loose_object(unsigned char *map) |
bb6b8e4f JH |
1185 | { |
1186 | unsigned int word; | |
1187 | ||
1188 | /* | |
1189 | * Is it a zlib-compressed buffer? If so, the first byte | |
1190 | * must be 0x78 (15-bit window size, deflated), and the | |
1191 | * first 16-bit word is evenly divisible by 31 | |
1192 | */ | |
1193 | word = (map[0] << 8) + map[1]; | |
1194 | if (map[0] == 0x78 && !(word % 31)) | |
1195 | return 1; | |
1196 | else | |
1197 | return 0; | |
1198 | } | |
1199 | ||
09ded04b NP |
1200 | unsigned long unpack_object_header_buffer(const unsigned char *buf, |
1201 | unsigned long len, enum object_type *type, unsigned long *sizep) | |
c4483576 | 1202 | { |
ad1ed5ee | 1203 | unsigned shift; |
48fb7deb | 1204 | unsigned long size, c; |
ad1ed5ee JH |
1205 | unsigned long used = 0; |
1206 | ||
1207 | c = buf[used++]; | |
1208 | *type = (c >> 4) & 7; | |
1209 | size = c & 15; | |
1210 | shift = 4; | |
1211 | while (c & 0x80) { | |
f630cfda | 1212 | if (len <= used || bitsizeof(long) <= shift) { |
09ded04b | 1213 | error("bad object header"); |
ad1ed5ee | 1214 | return 0; |
09ded04b | 1215 | } |
ad1ed5ee JH |
1216 | c = buf[used++]; |
1217 | size += (c & 0x7f) << shift; | |
1218 | shift += 7; | |
1219 | } | |
1220 | *sizep = size; | |
1221 | return used; | |
1222 | } | |
1223 | ||
1224 | static int unpack_sha1_header(z_stream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz) | |
1225 | { | |
1226 | unsigned long size, used; | |
1227 | static const char valid_loose_object_type[8] = { | |
1228 | 0, /* OBJ_EXT */ | |
1229 | 1, 1, 1, 1, /* "commit", "tree", "blob", "tag" */ | |
1230 | 0, /* "delta" and others are invalid in a loose object */ | |
93821bd9 | 1231 | }; |
ad1ed5ee | 1232 | enum object_type type; |
93821bd9 | 1233 | |
c4483576 LT |
1234 | /* Get the data stream */ |
1235 | memset(stream, 0, sizeof(*stream)); | |
1236 | stream->next_in = map; | |
1237 | stream->avail_in = mapsize; | |
1238 | stream->next_out = buffer; | |
93821bd9 LT |
1239 | stream->avail_out = bufsiz; |
1240 | ||
bb6b8e4f | 1241 | if (legacy_loose_object(map)) { |
39c68542 LT |
1242 | git_inflate_init(stream); |
1243 | return git_inflate(stream, 0); | |
93821bd9 LT |
1244 | } |
1245 | ||
726f852b NP |
1246 | |
1247 | /* | |
1248 | * There used to be a second loose object header format which | |
1249 | * was meant to mimic the in-pack format, allowing for direct | |
1250 | * copy of the object data. This format turned up not to be | |
1251 | * really worth it and we don't write it any longer. But we | |
1252 | * can still read it. | |
1253 | */ | |
09ded04b | 1254 | used = unpack_object_header_buffer(map, mapsize, &type, &size); |
ad1ed5ee | 1255 | if (!used || !valid_loose_object_type[type]) |
93821bd9 | 1256 | return -1; |
ad1ed5ee JH |
1257 | map += used; |
1258 | mapsize -= used; | |
93821bd9 LT |
1259 | |
1260 | /* Set up the stream for the rest.. */ | |
1261 | stream->next_in = map; | |
1262 | stream->avail_in = mapsize; | |
39c68542 | 1263 | git_inflate_init(stream); |
93821bd9 LT |
1264 | |
1265 | /* And generate the fake traditional header */ | |
ad1ed5ee | 1266 | stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu", |
df843662 | 1267 | typename(type), size); |
93821bd9 | 1268 | return 0; |
c4483576 LT |
1269 | } |
1270 | ||
7efbff75 | 1271 | static void *unpack_sha1_rest(z_stream *stream, void *buffer, unsigned long size, const unsigned char *sha1) |
5180cacc LT |
1272 | { |
1273 | int bytes = strlen(buffer) + 1; | |
3aee68aa | 1274 | unsigned char *buf = xmallocz(size); |
93821bd9 | 1275 | unsigned long n; |
7efbff75 | 1276 | int status = Z_OK; |
5180cacc | 1277 | |
93821bd9 LT |
1278 | n = stream->total_out - bytes; |
1279 | if (n > size) | |
1280 | n = size; | |
1281 | memcpy(buf, (char *) buffer + bytes, n); | |
1282 | bytes = n; | |
456cdf6e LT |
1283 | if (bytes <= size) { |
1284 | /* | |
1285 | * The above condition must be (bytes <= size), not | |
1286 | * (bytes < size). In other words, even though we | |
1287 | * expect no more output and set avail_out to zer0, | |
1288 | * the input zlib stream may have bytes that express | |
1289 | * "this concludes the stream", and we *do* want to | |
1290 | * eat that input. | |
1291 | * | |
1292 | * Otherwise we would not be able to test that we | |
1293 | * consumed all the input to reach the expected size; | |
1294 | * we also want to check that zlib tells us that all | |
1295 | * went well with status == Z_STREAM_END at the end. | |
1296 | */ | |
5180cacc LT |
1297 | stream->next_out = buf + bytes; |
1298 | stream->avail_out = size - bytes; | |
7efbff75 | 1299 | while (status == Z_OK) |
39c68542 | 1300 | status = git_inflate(stream, Z_FINISH); |
5180cacc | 1301 | } |
456cdf6e | 1302 | if (status == Z_STREAM_END && !stream->avail_in) { |
39c68542 | 1303 | git_inflate_end(stream); |
7efbff75 JH |
1304 | return buf; |
1305 | } | |
1306 | ||
1307 | if (status < 0) | |
1308 | error("corrupt loose object '%s'", sha1_to_hex(sha1)); | |
1309 | else if (stream->avail_in) | |
1310 | error("garbage at end of loose object '%s'", | |
1311 | sha1_to_hex(sha1)); | |
1312 | free(buf); | |
1313 | return NULL; | |
5180cacc LT |
1314 | } |
1315 | ||
1316 | /* | |
1317 | * We used to just use "sscanf()", but that's actually way | |
1318 | * too permissive for what we want to check. So do an anal | |
1319 | * object header parse by hand. | |
1320 | */ | |
21666f1a | 1321 | static int parse_sha1_header(const char *hdr, unsigned long *sizep) |
5180cacc | 1322 | { |
21666f1a | 1323 | char type[10]; |
5180cacc LT |
1324 | int i; |
1325 | unsigned long size; | |
1326 | ||
1327 | /* | |
a6080a0a | 1328 | * The type can be at most ten bytes (including the |
5180cacc | 1329 | * terminating '\0' that we add), and is followed by |
21666f1a | 1330 | * a space. |
5180cacc | 1331 | */ |
21666f1a | 1332 | i = 0; |
5180cacc LT |
1333 | for (;;) { |
1334 | char c = *hdr++; | |
1335 | if (c == ' ') | |
1336 | break; | |
21666f1a NP |
1337 | type[i++] = c; |
1338 | if (i >= sizeof(type)) | |
5180cacc | 1339 | return -1; |
5180cacc | 1340 | } |
21666f1a | 1341 | type[i] = 0; |
5180cacc LT |
1342 | |
1343 | /* | |
1344 | * The length must follow immediately, and be in canonical | |
1345 | * decimal format (ie "010" is not valid). | |
1346 | */ | |
1347 | size = *hdr++ - '0'; | |
1348 | if (size > 9) | |
1349 | return -1; | |
1350 | if (size) { | |
1351 | for (;;) { | |
1352 | unsigned long c = *hdr - '0'; | |
1353 | if (c > 9) | |
1354 | break; | |
1355 | hdr++; | |
1356 | size = size * 10 + c; | |
1357 | } | |
1358 | } | |
1359 | *sizep = size; | |
1360 | ||
1361 | /* | |
1362 | * The length must be followed by a zero byte | |
1363 | */ | |
21666f1a | 1364 | return *hdr ? -1 : type_from_string(type); |
5180cacc LT |
1365 | } |
1366 | ||
7efbff75 | 1367 | static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1) |
0fcfd160 | 1368 | { |
5180cacc | 1369 | int ret; |
0fcfd160 | 1370 | z_stream stream; |
5180cacc | 1371 | char hdr[8192]; |
0fcfd160 | 1372 | |
5180cacc | 1373 | ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)); |
21666f1a | 1374 | if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0) |
0fcfd160 LT |
1375 | return NULL; |
1376 | ||
7efbff75 | 1377 | return unpack_sha1_rest(&stream, hdr, *size, sha1); |
0fcfd160 LT |
1378 | } |
1379 | ||
54dab52a NP |
1380 | unsigned long get_size_from_delta(struct packed_git *p, |
1381 | struct pack_window **w_curs, | |
1382 | off_t curpos) | |
1383 | { | |
1384 | const unsigned char *data; | |
1385 | unsigned char delta_head[20], *in; | |
1386 | z_stream stream; | |
1387 | int st; | |
1388 | ||
1389 | memset(&stream, 0, sizeof(stream)); | |
1390 | stream.next_out = delta_head; | |
1391 | stream.avail_out = sizeof(delta_head); | |
1392 | ||
39c68542 | 1393 | git_inflate_init(&stream); |
54dab52a NP |
1394 | do { |
1395 | in = use_pack(p, w_curs, curpos, &stream.avail_in); | |
1396 | stream.next_in = in; | |
39c68542 | 1397 | st = git_inflate(&stream, Z_FINISH); |
54dab52a NP |
1398 | curpos += stream.next_in - in; |
1399 | } while ((st == Z_OK || st == Z_BUF_ERROR) && | |
1400 | stream.total_out < sizeof(delta_head)); | |
39c68542 | 1401 | git_inflate_end(&stream); |
3d77d877 NP |
1402 | if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) { |
1403 | error("delta data unpack-initial failed"); | |
1404 | return 0; | |
1405 | } | |
54dab52a NP |
1406 | |
1407 | /* Examine the initial part of the delta to figure out | |
1408 | * the result size. | |
1409 | */ | |
1410 | data = delta_head; | |
1411 | ||
1412 | /* ignore base size */ | |
1413 | get_delta_hdr_size(&data, delta_head+sizeof(delta_head)); | |
1414 | ||
1415 | /* Read the result size */ | |
1416 | return get_delta_hdr_size(&data, delta_head+sizeof(delta_head)); | |
1417 | } | |
1418 | ||
c4001d92 | 1419 | static off_t get_delta_base(struct packed_git *p, |
03e79c88 | 1420 | struct pack_window **w_curs, |
c4001d92 | 1421 | off_t *curpos, |
21666f1a | 1422 | enum object_type type, |
c4001d92 | 1423 | off_t delta_obj_offset) |
eb32d236 | 1424 | { |
2b87c45b | 1425 | unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL); |
c4001d92 | 1426 | off_t base_offset; |
eb32d236 | 1427 | |
8d8a4ea5 SP |
1428 | /* use_pack() assured us we have [base_info, base_info + 20) |
1429 | * as a range that we can look at without walking off the | |
1430 | * end of the mapped window. Its actually the hash size | |
1431 | * that is assured. An OFS_DELTA longer than the hash size | |
1432 | * is stupid, as then a REF_DELTA would be smaller to store. | |
1433 | */ | |
21666f1a | 1434 | if (type == OBJ_OFS_DELTA) { |
eb32d236 NP |
1435 | unsigned used = 0; |
1436 | unsigned char c = base_info[used++]; | |
1437 | base_offset = c & 127; | |
1438 | while (c & 128) { | |
1439 | base_offset += 1; | |
8723f216 | 1440 | if (!base_offset || MSB(base_offset, 7)) |
8eca0b47 | 1441 | return 0; /* overflow */ |
eb32d236 NP |
1442 | c = base_info[used++]; |
1443 | base_offset = (base_offset << 7) + (c & 127); | |
1444 | } | |
1445 | base_offset = delta_obj_offset - base_offset; | |
d8f32556 | 1446 | if (base_offset <= 0 || base_offset >= delta_obj_offset) |
8eca0b47 | 1447 | return 0; /* out of bound */ |
2b87c45b | 1448 | *curpos += used; |
21666f1a | 1449 | } else if (type == OBJ_REF_DELTA) { |
eb32d236 NP |
1450 | /* The base entry _must_ be in the same pack */ |
1451 | base_offset = find_pack_entry_one(base_info, p); | |
2b87c45b | 1452 | *curpos += 20; |
eb32d236 NP |
1453 | } else |
1454 | die("I am totally screwed"); | |
2b87c45b | 1455 | return base_offset; |
eb32d236 NP |
1456 | } |
1457 | ||
f3bf9224 | 1458 | /* forward declaration for a mutually recursive function */ |
c4001d92 | 1459 | static int packed_object_info(struct packed_git *p, off_t offset, |
21666f1a | 1460 | unsigned long *sizep); |
f3bf9224 | 1461 | |
43057304 | 1462 | static int packed_delta_info(struct packed_git *p, |
03e79c88 | 1463 | struct pack_window **w_curs, |
c4001d92 | 1464 | off_t curpos, |
21666f1a | 1465 | enum object_type type, |
c4001d92 | 1466 | off_t obj_offset, |
43057304 | 1467 | unsigned long *sizep) |
5db47c2b | 1468 | { |
c4001d92 | 1469 | off_t base_offset; |
f3bf9224 | 1470 | |
21666f1a | 1471 | base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset); |
3d77d877 NP |
1472 | if (!base_offset) |
1473 | return OBJ_BAD; | |
21666f1a | 1474 | type = packed_object_info(p, base_offset, NULL); |
3d77d877 | 1475 | if (type <= OBJ_NONE) { |
08698b1e NP |
1476 | struct revindex_entry *revidx; |
1477 | const unsigned char *base_sha1; | |
1478 | revidx = find_pack_revindex(p, base_offset); | |
1479 | if (!revidx) | |
1480 | return OBJ_BAD; | |
1481 | base_sha1 = nth_packed_object_sha1(p, revidx->nr); | |
3d77d877 NP |
1482 | mark_bad_packed_object(p, base_sha1); |
1483 | type = sha1_object_info(base_sha1, NULL); | |
1484 | if (type <= OBJ_NONE) | |
1485 | return OBJ_BAD; | |
1486 | } | |
f3bf9224 | 1487 | |
c62266f3 JH |
1488 | /* We choose to only get the type of the base object and |
1489 | * ignore potentially corrupt pack file that expects the delta | |
1490 | * based on a base with a wrong size. This saves tons of | |
1491 | * inflate() calls. | |
1492 | */ | |
3d77d877 | 1493 | if (sizep) { |
54dab52a | 1494 | *sizep = get_size_from_delta(p, w_curs, curpos); |
3d77d877 NP |
1495 | if (*sizep == 0) |
1496 | type = OBJ_BAD; | |
1497 | } | |
21666f1a NP |
1498 | |
1499 | return type; | |
5db47c2b JH |
1500 | } |
1501 | ||
2b87c45b NP |
1502 | static int unpack_object_header(struct packed_git *p, |
1503 | struct pack_window **w_curs, | |
c4001d92 | 1504 | off_t *curpos, |
2b87c45b | 1505 | unsigned long *sizep) |
a733cb60 | 1506 | { |
03e79c88 SP |
1507 | unsigned char *base; |
1508 | unsigned int left; | |
ad1ed5ee | 1509 | unsigned long used; |
2b87c45b | 1510 | enum object_type type; |
a733cb60 | 1511 | |
8d8a4ea5 SP |
1512 | /* use_pack() assures us we have [base, base + 20) available |
1513 | * as a range that we can look at at. (Its actually the hash | |
3dff5379 | 1514 | * size that is assured.) With our object header encoding |
8d8a4ea5 SP |
1515 | * the maximum deflated object size is 2^137, which is just |
1516 | * insane, so we know won't exceed what we have been given. | |
1517 | */ | |
2b87c45b | 1518 | base = use_pack(p, w_curs, *curpos, &left); |
09ded04b NP |
1519 | used = unpack_object_header_buffer(base, left, &type, sizep); |
1520 | if (!used) { | |
1521 | type = OBJ_BAD; | |
1522 | } else | |
1523 | *curpos += used; | |
ad1ed5ee | 1524 | |
2b87c45b | 1525 | return type; |
a733cb60 LT |
1526 | } |
1527 | ||
21666f1a | 1528 | const char *packed_object_info_detail(struct packed_git *p, |
c4001d92 | 1529 | off_t obj_offset, |
21666f1a NP |
1530 | unsigned long *size, |
1531 | unsigned long *store_size, | |
1532 | unsigned int *delta_chain_length, | |
1533 | unsigned char *base_sha1) | |
ad8c80a5 | 1534 | { |
03e79c88 | 1535 | struct pack_window *w_curs = NULL; |
c4001d92 SP |
1536 | off_t curpos; |
1537 | unsigned long dummy; | |
43057304 | 1538 | unsigned char *next_sha1; |
21666f1a | 1539 | enum object_type type; |
70f5d5d3 | 1540 | struct revindex_entry *revidx; |
ad8c80a5 | 1541 | |
43057304 | 1542 | *delta_chain_length = 0; |
2b87c45b | 1543 | curpos = obj_offset; |
21666f1a | 1544 | type = unpack_object_header(p, &w_curs, &curpos, size); |
43057304 | 1545 | |
70f5d5d3 NP |
1546 | revidx = find_pack_revindex(p, obj_offset); |
1547 | *store_size = revidx[1].offset - obj_offset; | |
1548 | ||
43057304 | 1549 | for (;;) { |
21666f1a | 1550 | switch (type) { |
43057304 | 1551 | default: |
08a19d87 | 1552 | die("pack %s contains unknown object type %d", |
21666f1a | 1553 | p->pack_name, type); |
43057304 NP |
1554 | case OBJ_COMMIT: |
1555 | case OBJ_TREE: | |
1556 | case OBJ_BLOB: | |
1557 | case OBJ_TAG: | |
03e79c88 | 1558 | unuse_pack(&w_curs); |
21666f1a | 1559 | return typename(type); |
eb32d236 | 1560 | case OBJ_OFS_DELTA: |
21666f1a | 1561 | obj_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset); |
8eca0b47 NP |
1562 | if (!obj_offset) |
1563 | die("pack %s contains bad delta base reference of type %s", | |
1564 | p->pack_name, typename(type)); | |
eb32d236 | 1565 | if (*delta_chain_length == 0) { |
70f5d5d3 NP |
1566 | revidx = find_pack_revindex(p, obj_offset); |
1567 | hashcpy(base_sha1, nth_packed_object_sha1(p, revidx->nr)); | |
eb32d236 NP |
1568 | } |
1569 | break; | |
1570 | case OBJ_REF_DELTA: | |
2b87c45b | 1571 | next_sha1 = use_pack(p, &w_curs, curpos, NULL); |
43057304 NP |
1572 | if (*delta_chain_length == 0) |
1573 | hashcpy(base_sha1, next_sha1); | |
2b87c45b | 1574 | obj_offset = find_pack_entry_one(next_sha1, p); |
43057304 NP |
1575 | break; |
1576 | } | |
43057304 | 1577 | (*delta_chain_length)++; |
2b87c45b | 1578 | curpos = obj_offset; |
21666f1a | 1579 | type = unpack_object_header(p, &w_curs, &curpos, &dummy); |
ad8c80a5 | 1580 | } |
ad8c80a5 JH |
1581 | } |
1582 | ||
c4001d92 | 1583 | static int packed_object_info(struct packed_git *p, off_t obj_offset, |
21666f1a | 1584 | unsigned long *sizep) |
1f688557 | 1585 | { |
03e79c88 | 1586 | struct pack_window *w_curs = NULL; |
c4001d92 SP |
1587 | unsigned long size; |
1588 | off_t curpos = obj_offset; | |
21666f1a | 1589 | enum object_type type; |
5db47c2b | 1590 | |
21666f1a | 1591 | type = unpack_object_header(p, &w_curs, &curpos, &size); |
5db47c2b | 1592 | |
21666f1a | 1593 | switch (type) { |
eb32d236 NP |
1594 | case OBJ_OFS_DELTA: |
1595 | case OBJ_REF_DELTA: | |
21666f1a NP |
1596 | type = packed_delta_info(p, &w_curs, curpos, |
1597 | type, obj_offset, sizep); | |
2b87c45b | 1598 | break; |
a733cb60 | 1599 | case OBJ_COMMIT: |
a733cb60 | 1600 | case OBJ_TREE: |
a733cb60 | 1601 | case OBJ_BLOB: |
a733cb60 | 1602 | case OBJ_TAG: |
2b87c45b NP |
1603 | if (sizep) |
1604 | *sizep = size; | |
a69d0943 | 1605 | break; |
1f688557 | 1606 | default: |
3d77d877 NP |
1607 | error("unknown object type %i at offset %"PRIuMAX" in %s", |
1608 | type, (uintmax_t)obj_offset, p->pack_name); | |
1609 | type = OBJ_BAD; | |
1f688557 | 1610 | } |
2b87c45b | 1611 | unuse_pack(&w_curs); |
21666f1a | 1612 | return type; |
1f688557 JH |
1613 | } |
1614 | ||
eb950c19 | 1615 | static void *unpack_compressed_entry(struct packed_git *p, |
03e79c88 | 1616 | struct pack_window **w_curs, |
c4001d92 | 1617 | off_t curpos, |
eb950c19 | 1618 | unsigned long size) |
de530aaa SP |
1619 | { |
1620 | int st; | |
1621 | z_stream stream; | |
079afb18 | 1622 | unsigned char *buffer, *in; |
de530aaa | 1623 | |
4ab07e4d | 1624 | buffer = xmallocz(size); |
de530aaa | 1625 | memset(&stream, 0, sizeof(stream)); |
de530aaa | 1626 | stream.next_out = buffer; |
39eea7bd | 1627 | stream.avail_out = size + 1; |
de530aaa | 1628 | |
39c68542 | 1629 | git_inflate_init(&stream); |
079afb18 | 1630 | do { |
2b87c45b | 1631 | in = use_pack(p, w_curs, curpos, &stream.avail_in); |
079afb18 | 1632 | stream.next_in = in; |
39c68542 | 1633 | st = git_inflate(&stream, Z_FINISH); |
39eea7bd JH |
1634 | if (!stream.avail_out) |
1635 | break; /* the payload is larger than it should be */ | |
2b87c45b | 1636 | curpos += stream.next_in - in; |
079afb18 | 1637 | } while (st == Z_OK || st == Z_BUF_ERROR); |
39c68542 | 1638 | git_inflate_end(&stream); |
de530aaa SP |
1639 | if ((st != Z_STREAM_END) || stream.total_out != size) { |
1640 | free(buffer); | |
1641 | return NULL; | |
1642 | } | |
1643 | ||
1644 | return buffer; | |
1645 | } | |
1646 | ||
e5e01619 LT |
1647 | #define MAX_DELTA_CACHE (256) |
1648 | ||
18bdec11 | 1649 | static size_t delta_base_cached; |
5e08ecbf NP |
1650 | |
1651 | static struct delta_base_cache_lru_list { | |
1652 | struct delta_base_cache_lru_list *prev; | |
1653 | struct delta_base_cache_lru_list *next; | |
1654 | } delta_base_cache_lru = { &delta_base_cache_lru, &delta_base_cache_lru }; | |
1655 | ||
e5e01619 | 1656 | static struct delta_base_cache_entry { |
5e08ecbf NP |
1657 | struct delta_base_cache_lru_list lru; |
1658 | void *data; | |
e5e01619 LT |
1659 | struct packed_git *p; |
1660 | off_t base_offset; | |
1661 | unsigned long size; | |
e5e01619 LT |
1662 | enum object_type type; |
1663 | } delta_base_cache[MAX_DELTA_CACHE]; | |
1664 | ||
1665 | static unsigned long pack_entry_hash(struct packed_git *p, off_t base_offset) | |
1666 | { | |
1667 | unsigned long hash; | |
1668 | ||
1669 | hash = (unsigned long)p + (unsigned long)base_offset; | |
1670 | hash += (hash >> 8) + (hash >> 16); | |
3358004a | 1671 | return hash % MAX_DELTA_CACHE; |
e5e01619 LT |
1672 | } |
1673 | ||
62f255ad | 1674 | static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset, |
a0cba108 | 1675 | unsigned long *base_size, enum object_type *type, int keep_cache) |
62f255ad | 1676 | { |
e5e01619 LT |
1677 | void *ret; |
1678 | unsigned long hash = pack_entry_hash(p, base_offset); | |
1679 | struct delta_base_cache_entry *ent = delta_base_cache + hash; | |
1680 | ||
1681 | ret = ent->data; | |
749bc58c MV |
1682 | if (!ret || ent->p != p || ent->base_offset != base_offset) |
1683 | return unpack_entry(p, base_offset, type, base_size); | |
e5e01619 | 1684 | |
18bdec11 | 1685 | if (!keep_cache) { |
a0cba108 | 1686 | ent->data = NULL; |
5e08ecbf NP |
1687 | ent->lru.next->prev = ent->lru.prev; |
1688 | ent->lru.prev->next = ent->lru.next; | |
18bdec11 | 1689 | delta_base_cached -= ent->size; |
182af834 PH |
1690 | } else { |
1691 | ret = xmemdupz(ent->data, ent->size); | |
a0cba108 | 1692 | } |
e5e01619 LT |
1693 | *type = ent->type; |
1694 | *base_size = ent->size; | |
1695 | return ret; | |
62f255ad LT |
1696 | } |
1697 | ||
18bdec11 SP |
1698 | static inline void release_delta_base_cache(struct delta_base_cache_entry *ent) |
1699 | { | |
1700 | if (ent->data) { | |
1701 | free(ent->data); | |
1702 | ent->data = NULL; | |
5e08ecbf NP |
1703 | ent->lru.next->prev = ent->lru.prev; |
1704 | ent->lru.prev->next = ent->lru.next; | |
18bdec11 SP |
1705 | delta_base_cached -= ent->size; |
1706 | } | |
1707 | } | |
1708 | ||
3d20c636 SP |
1709 | void clear_delta_base_cache(void) |
1710 | { | |
1711 | unsigned long p; | |
1712 | for (p = 0; p < MAX_DELTA_CACHE; p++) | |
1713 | release_delta_base_cache(&delta_base_cache[p]); | |
1714 | } | |
1715 | ||
62f255ad LT |
1716 | static void add_delta_base_cache(struct packed_git *p, off_t base_offset, |
1717 | void *base, unsigned long base_size, enum object_type type) | |
1718 | { | |
5e08ecbf | 1719 | unsigned long hash = pack_entry_hash(p, base_offset); |
e5e01619 | 1720 | struct delta_base_cache_entry *ent = delta_base_cache + hash; |
5e08ecbf | 1721 | struct delta_base_cache_lru_list *lru; |
e5e01619 | 1722 | |
18bdec11 SP |
1723 | release_delta_base_cache(ent); |
1724 | delta_base_cached += base_size; | |
5e08ecbf NP |
1725 | |
1726 | for (lru = delta_base_cache_lru.next; | |
1727 | delta_base_cached > delta_base_cache_limit | |
1728 | && lru != &delta_base_cache_lru; | |
1729 | lru = lru->next) { | |
1730 | struct delta_base_cache_entry *f = (void *)lru; | |
18bdec11 SP |
1731 | if (f->type == OBJ_BLOB) |
1732 | release_delta_base_cache(f); | |
1733 | } | |
5e08ecbf NP |
1734 | for (lru = delta_base_cache_lru.next; |
1735 | delta_base_cached > delta_base_cache_limit | |
1736 | && lru != &delta_base_cache_lru; | |
1737 | lru = lru->next) { | |
1738 | struct delta_base_cache_entry *f = (void *)lru; | |
1739 | release_delta_base_cache(f); | |
1740 | } | |
18bdec11 | 1741 | |
e5e01619 LT |
1742 | ent->p = p; |
1743 | ent->base_offset = base_offset; | |
1744 | ent->type = type; | |
1745 | ent->data = base; | |
1746 | ent->size = base_size; | |
5e08ecbf NP |
1747 | ent->lru.next = &delta_base_cache_lru; |
1748 | ent->lru.prev = delta_base_cache_lru.prev; | |
1749 | delta_base_cache_lru.prev->next = &ent->lru; | |
1750 | delta_base_cache_lru.prev = &ent->lru; | |
62f255ad LT |
1751 | } |
1752 | ||
c2c5b270 CC |
1753 | static void *read_object(const unsigned char *sha1, enum object_type *type, |
1754 | unsigned long *size); | |
1755 | ||
eb950c19 | 1756 | static void *unpack_delta_entry(struct packed_git *p, |
03e79c88 | 1757 | struct pack_window **w_curs, |
c4001d92 | 1758 | off_t curpos, |
1f688557 | 1759 | unsigned long delta_size, |
c4001d92 | 1760 | off_t obj_offset, |
21666f1a | 1761 | enum object_type *type, |
eb950c19 | 1762 | unsigned long *sizep) |
1f688557 | 1763 | { |
7c3e8be3 | 1764 | void *delta_data, *result, *base; |
c4001d92 SP |
1765 | unsigned long base_size; |
1766 | off_t base_offset; | |
43057304 | 1767 | |
21666f1a | 1768 | base_offset = get_delta_base(p, w_curs, &curpos, *type, obj_offset); |
8eca0b47 NP |
1769 | if (!base_offset) { |
1770 | error("failed to validate delta base reference " | |
1771 | "at offset %"PRIuMAX" from %s", | |
1772 | (uintmax_t)curpos, p->pack_name); | |
1773 | return NULL; | |
1774 | } | |
eac12e2d | 1775 | unuse_pack(w_curs); |
a0cba108 | 1776 | base = cache_or_unpack_entry(p, base_offset, &base_size, type, 0); |
8eca0b47 NP |
1777 | if (!base) { |
1778 | /* | |
1779 | * We're probably in deep shit, but let's try to fetch | |
1780 | * the required base anyway from another pack or loose. | |
1781 | * This is costly but should happen only in the presence | |
1782 | * of a corrupted pack, and is better than failing outright. | |
1783 | */ | |
08698b1e NP |
1784 | struct revindex_entry *revidx; |
1785 | const unsigned char *base_sha1; | |
1786 | revidx = find_pack_revindex(p, base_offset); | |
1787 | if (!revidx) | |
1788 | return NULL; | |
1789 | base_sha1 = nth_packed_object_sha1(p, revidx->nr); | |
8eca0b47 NP |
1790 | error("failed to read delta base object %s" |
1791 | " at offset %"PRIuMAX" from %s", | |
1792 | sha1_to_hex(base_sha1), (uintmax_t)base_offset, | |
1793 | p->pack_name); | |
1794 | mark_bad_packed_object(p, base_sha1); | |
ac939109 | 1795 | base = read_object(base_sha1, type, &base_size); |
8eca0b47 NP |
1796 | if (!base) |
1797 | return NULL; | |
1798 | } | |
67686d95 | 1799 | |
2b87c45b | 1800 | delta_data = unpack_compressed_entry(p, w_curs, curpos, delta_size); |
8eca0b47 NP |
1801 | if (!delta_data) { |
1802 | error("failed to unpack compressed delta " | |
1803 | "at offset %"PRIuMAX" from %s", | |
1804 | (uintmax_t)curpos, p->pack_name); | |
1805 | free(base); | |
1806 | return NULL; | |
1807 | } | |
1f688557 JH |
1808 | result = patch_delta(base, base_size, |
1809 | delta_data, delta_size, | |
21666f1a | 1810 | sizep); |
1f688557 JH |
1811 | if (!result) |
1812 | die("failed to apply delta"); | |
1813 | free(delta_data); | |
62f255ad | 1814 | add_delta_base_cache(p, base_offset, base, base_size, *type); |
1f688557 JH |
1815 | return result; |
1816 | } | |
1817 | ||
0e8189e2 NP |
1818 | int do_check_packed_object_crc; |
1819 | ||
c4001d92 | 1820 | void *unpack_entry(struct packed_git *p, off_t obj_offset, |
21666f1a | 1821 | enum object_type *type, unsigned long *sizep) |
1f688557 | 1822 | { |
03e79c88 | 1823 | struct pack_window *w_curs = NULL; |
c4001d92 | 1824 | off_t curpos = obj_offset; |
21666f1a | 1825 | void *data; |
1f688557 | 1826 | |
0e8189e2 NP |
1827 | if (do_check_packed_object_crc && p->index_version > 1) { |
1828 | struct revindex_entry *revidx = find_pack_revindex(p, obj_offset); | |
1829 | unsigned long len = revidx[1].offset - obj_offset; | |
1830 | if (check_pack_crc(p, &w_curs, obj_offset, len, revidx->nr)) { | |
1831 | const unsigned char *sha1 = | |
1832 | nth_packed_object_sha1(p, revidx->nr); | |
1833 | error("bad packed object CRC for %s", | |
1834 | sha1_to_hex(sha1)); | |
1835 | mark_bad_packed_object(p, sha1); | |
f755bb99 | 1836 | unuse_pack(&w_curs); |
0e8189e2 NP |
1837 | return NULL; |
1838 | } | |
1839 | } | |
1840 | ||
21666f1a NP |
1841 | *type = unpack_object_header(p, &w_curs, &curpos, sizep); |
1842 | switch (*type) { | |
eb32d236 NP |
1843 | case OBJ_OFS_DELTA: |
1844 | case OBJ_REF_DELTA: | |
21666f1a NP |
1845 | data = unpack_delta_entry(p, &w_curs, curpos, *sizep, |
1846 | obj_offset, type, sizep); | |
4d703a1a | 1847 | break; |
a733cb60 | 1848 | case OBJ_COMMIT: |
a733cb60 | 1849 | case OBJ_TREE: |
a733cb60 | 1850 | case OBJ_BLOB: |
a733cb60 | 1851 | case OBJ_TAG: |
21666f1a | 1852 | data = unpack_compressed_entry(p, &w_curs, curpos, *sizep); |
4d703a1a | 1853 | break; |
1f688557 | 1854 | default: |
8eca0b47 NP |
1855 | data = NULL; |
1856 | error("unknown object type %i at offset %"PRIuMAX" in %s", | |
1857 | *type, (uintmax_t)obj_offset, p->pack_name); | |
1f688557 | 1858 | } |
03e79c88 | 1859 | unuse_pack(&w_curs); |
21666f1a | 1860 | return data; |
1f688557 JH |
1861 | } |
1862 | ||
d079837e | 1863 | const unsigned char *nth_packed_object_sha1(struct packed_git *p, |
d72308e0 | 1864 | uint32_t n) |
9a217f2a | 1865 | { |
42873078 | 1866 | const unsigned char *index = p->index_data; |
d079837e SP |
1867 | if (!index) { |
1868 | if (open_pack_index(p)) | |
1869 | return NULL; | |
1870 | index = p->index_data; | |
1871 | } | |
57059091 | 1872 | if (n >= p->num_objects) |
d72308e0 | 1873 | return NULL; |
74e34e1f NP |
1874 | index += 4 * 256; |
1875 | if (p->index_version == 1) { | |
1876 | return index + 24 * n + 4; | |
1877 | } else { | |
1878 | index += 8; | |
1879 | return index + 20 * n; | |
1880 | } | |
1881 | } | |
1882 | ||
99093238 | 1883 | off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n) |
74e34e1f NP |
1884 | { |
1885 | const unsigned char *index = p->index_data; | |
1886 | index += 4 * 256; | |
1887 | if (p->index_version == 1) { | |
1888 | return ntohl(*((uint32_t *)(index + 24 * n))); | |
1889 | } else { | |
1890 | uint32_t off; | |
1891 | index += 8 + p->num_objects * (20 + 4); | |
1892 | off = ntohl(*((uint32_t *)(index + 4 * n))); | |
1893 | if (!(off & 0x80000000)) | |
1894 | return off; | |
1895 | index += p->num_objects * 4 + (off & 0x7fffffff) * 8; | |
1896 | return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) | | |
1897 | ntohl(*((uint32_t *)(index + 4))); | |
1898 | } | |
9a217f2a JH |
1899 | } |
1900 | ||
c4001d92 | 1901 | off_t find_pack_entry_one(const unsigned char *sha1, |
43057304 | 1902 | struct packed_git *p) |
1f688557 | 1903 | { |
42873078 | 1904 | const uint32_t *level1_ofs = p->index_data; |
42873078 | 1905 | const unsigned char *index = p->index_data; |
628522ec JH |
1906 | unsigned hi, lo, stride; |
1907 | static int use_lookup = -1; | |
1908 | static int debug_lookup = -1; | |
1909 | ||
1910 | if (debug_lookup < 0) | |
1911 | debug_lookup = !!getenv("GIT_DEBUG_LOOKUP"); | |
42873078 | 1912 | |
d079837e SP |
1913 | if (!index) { |
1914 | if (open_pack_index(p)) | |
1915 | return 0; | |
1916 | level1_ofs = p->index_data; | |
1917 | index = p->index_data; | |
1918 | } | |
74e34e1f NP |
1919 | if (p->index_version > 1) { |
1920 | level1_ofs += 2; | |
1921 | index += 8; | |
1922 | } | |
42873078 | 1923 | index += 4 * 256; |
74e34e1f NP |
1924 | hi = ntohl(level1_ofs[*sha1]); |
1925 | lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1])); | |
628522ec JH |
1926 | if (p->index_version > 1) { |
1927 | stride = 20; | |
1928 | } else { | |
1929 | stride = 24; | |
1930 | index += 4; | |
1931 | } | |
1932 | ||
1933 | if (debug_lookup) | |
6e1c2344 | 1934 | printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n", |
628522ec JH |
1935 | sha1[0], sha1[1], sha1[2], lo, hi, p->num_objects); |
1936 | ||
1937 | if (use_lookup < 0) | |
1938 | use_lookup = !!getenv("GIT_USE_LOOKUP"); | |
1939 | if (use_lookup) { | |
1940 | int pos = sha1_entry_pos(index, stride, 0, | |
1941 | lo, hi, p->num_objects, sha1); | |
1942 | if (pos < 0) | |
1943 | return 0; | |
1944 | return nth_packed_object_offset(p, pos); | |
1945 | } | |
1f688557 JH |
1946 | |
1947 | do { | |
74e34e1f | 1948 | unsigned mi = (lo + hi) / 2; |
628522ec JH |
1949 | int cmp = hashcmp(index + mi * stride, sha1); |
1950 | ||
1951 | if (debug_lookup) | |
1952 | printf("lo %u hi %u rg %u mi %u\n", | |
1953 | lo, hi, hi - lo, mi); | |
43057304 | 1954 | if (!cmp) |
74e34e1f | 1955 | return nth_packed_object_offset(p, mi); |
1f688557 JH |
1956 | if (cmp > 0) |
1957 | hi = mi; | |
1958 | else | |
1959 | lo = mi+1; | |
1960 | } while (lo < hi); | |
1961 | return 0; | |
1962 | } | |
1963 | ||
d131b7af SP |
1964 | static int is_pack_valid(struct packed_git *p) |
1965 | { | |
1966 | /* An already open pack is known to be valid. */ | |
1967 | if (p->pack_fd != -1) | |
1968 | return 1; | |
1969 | ||
1970 | /* If the pack has one window completely covering the | |
1971 | * file size, the pack is known to be valid even if | |
1972 | * the descriptor is not currently open. | |
1973 | */ | |
1974 | if (p->windows) { | |
1975 | struct pack_window *w = p->windows; | |
1976 | ||
1977 | if (!w->offset && w->len == p->pack_size) | |
1978 | return 1; | |
1979 | } | |
1980 | ||
1981 | /* Force the pack to open to prove its valid. */ | |
1982 | return !open_packed_git(p); | |
1983 | } | |
1984 | ||
4d6acb70 | 1985 | static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e) |
1f688557 | 1986 | { |
f7c22cc6 | 1987 | static struct packed_git *last_found = (void *)1; |
1f688557 | 1988 | struct packed_git *p; |
c4001d92 | 1989 | off_t offset; |
43057304 | 1990 | |
1f688557 | 1991 | prepare_packed_git(); |
f7c22cc6 NP |
1992 | if (!packed_git) |
1993 | return 0; | |
1994 | p = (last_found == (void *)1) ? packed_git : last_found; | |
1f688557 | 1995 | |
f7c22cc6 | 1996 | do { |
8eca0b47 NP |
1997 | if (p->num_bad_objects) { |
1998 | unsigned i; | |
1999 | for (i = 0; i < p->num_bad_objects; i++) | |
2000 | if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i)) | |
2001 | goto next; | |
2002 | } | |
2003 | ||
43057304 NP |
2004 | offset = find_pack_entry_one(sha1, p); |
2005 | if (offset) { | |
c715f783 SP |
2006 | /* |
2007 | * We are about to tell the caller where they can | |
2008 | * locate the requested object. We better make | |
2009 | * sure the packfile is still here and can be | |
2010 | * accessed before supplying that answer, as | |
2011 | * it may have been deleted since the index | |
2012 | * was loaded! | |
2013 | */ | |
d131b7af | 2014 | if (!is_pack_valid(p)) { |
c715f783 | 2015 | error("packfile %s cannot be accessed", p->pack_name); |
f7c22cc6 | 2016 | goto next; |
c715f783 | 2017 | } |
43057304 NP |
2018 | e->offset = offset; |
2019 | e->p = p; | |
2020 | hashcpy(e->sha1, sha1); | |
f7c22cc6 | 2021 | last_found = p; |
1f688557 | 2022 | return 1; |
43057304 | 2023 | } |
f7c22cc6 NP |
2024 | |
2025 | next: | |
2026 | if (p == last_found) | |
2027 | p = packed_git; | |
2028 | else | |
2029 | p = p->next; | |
2030 | if (p == last_found) | |
2031 | p = p->next; | |
2032 | } while (p); | |
1f688557 JH |
2033 | return 0; |
2034 | } | |
2035 | ||
a6080a0a | 2036 | struct packed_git *find_sha1_pack(const unsigned char *sha1, |
bf592c50 DB |
2037 | struct packed_git *packs) |
2038 | { | |
2039 | struct packed_git *p; | |
bf592c50 DB |
2040 | |
2041 | for (p = packs; p; p = p->next) { | |
43057304 | 2042 | if (find_pack_entry_one(sha1, p)) |
bf592c50 DB |
2043 | return p; |
2044 | } | |
2045 | return NULL; | |
21666f1a | 2046 | |
bf592c50 DB |
2047 | } |
2048 | ||
21666f1a | 2049 | static int sha1_loose_object_info(const unsigned char *sha1, unsigned long *sizep) |
65c2e0c3 | 2050 | { |
36e4d74a | 2051 | int status; |
65c2e0c3 JH |
2052 | unsigned long mapsize, size; |
2053 | void *map; | |
2054 | z_stream stream; | |
d65a16f6 | 2055 | char hdr[32]; |
65c2e0c3 | 2056 | |
bb6b8e4f | 2057 | map = map_sha1_file(sha1, &mapsize); |
f0df4ed5 JS |
2058 | if (!map) |
2059 | return error("unable to find %s", sha1_to_hex(sha1)); | |
36e4d74a JH |
2060 | if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0) |
2061 | status = error("unable to unpack %s header", | |
2062 | sha1_to_hex(sha1)); | |
21666f1a | 2063 | else if ((status = parse_sha1_header(hdr, &size)) < 0) |
36e4d74a | 2064 | status = error("unable to parse %s header", sha1_to_hex(sha1)); |
21666f1a NP |
2065 | else if (sizep) |
2066 | *sizep = size; | |
39c68542 | 2067 | git_inflate_end(&stream); |
65c2e0c3 JH |
2068 | munmap(map, mapsize); |
2069 | return status; | |
2070 | } | |
2071 | ||
21666f1a | 2072 | int sha1_object_info(const unsigned char *sha1, unsigned long *sizep) |
f0df4ed5 | 2073 | { |
c4d9986f | 2074 | struct cached_object *co; |
f0df4ed5 | 2075 | struct pack_entry e; |
ddd63e64 | 2076 | int status; |
f0df4ed5 | 2077 | |
c4d9986f NTND |
2078 | co = find_cached_object(sha1); |
2079 | if (co) { | |
2080 | if (sizep) | |
2081 | *sizep = co->size; | |
2082 | return co->type; | |
2083 | } | |
2084 | ||
cd673c1f | 2085 | if (!find_pack_entry(sha1, &e)) { |
ddd63e64 SG |
2086 | /* Most likely it's a loose object. */ |
2087 | status = sha1_loose_object_info(sha1, sizep); | |
2088 | if (status >= 0) | |
2089 | return status; | |
2090 | ||
2091 | /* Not a loose object; someone else may have just packed it. */ | |
f0df4ed5 | 2092 | reprepare_packed_git(); |
cd673c1f | 2093 | if (!find_pack_entry(sha1, &e)) |
ddd63e64 | 2094 | return status; |
f0df4ed5 | 2095 | } |
3d77d877 NP |
2096 | |
2097 | status = packed_object_info(e.p, e.offset, sizep); | |
2098 | if (status < 0) { | |
2099 | mark_bad_packed_object(e.p, sha1); | |
2100 | status = sha1_object_info(sha1, sizep); | |
2101 | } | |
2102 | ||
2103 | return status; | |
f0df4ed5 JS |
2104 | } |
2105 | ||
21666f1a NP |
2106 | static void *read_packed_sha1(const unsigned char *sha1, |
2107 | enum object_type *type, unsigned long *size) | |
1f688557 JH |
2108 | { |
2109 | struct pack_entry e; | |
8eca0b47 | 2110 | void *data; |
1f688557 | 2111 | |
cd673c1f | 2112 | if (!find_pack_entry(sha1, &e)) |
1f688557 | 2113 | return NULL; |
8eca0b47 NP |
2114 | data = cache_or_unpack_entry(e.p, e.offset, size, type, 1); |
2115 | if (!data) { | |
2116 | /* | |
2117 | * We're probably in deep shit, but let's try to fetch | |
2118 | * the required object anyway from another pack or loose. | |
2119 | * This should happen only in the presence of a corrupted | |
2120 | * pack, and is better than failing outright. | |
2121 | */ | |
2122 | error("failed to read object %s at offset %"PRIuMAX" from %s", | |
2123 | sha1_to_hex(sha1), (uintmax_t)e.offset, e.p->pack_name); | |
2124 | mark_bad_packed_object(e.p, sha1); | |
ac939109 | 2125 | data = read_object(sha1, type, size); |
8eca0b47 NP |
2126 | } |
2127 | return data; | |
1f688557 JH |
2128 | } |
2129 | ||
21666f1a NP |
2130 | int pretend_sha1_file(void *buf, unsigned long len, enum object_type type, |
2131 | unsigned char *sha1) | |
d66b37bb JH |
2132 | { |
2133 | struct cached_object *co; | |
2134 | ||
21666f1a | 2135 | hash_sha1_file(buf, len, typename(type), sha1); |
d66b37bb JH |
2136 | if (has_sha1_file(sha1) || find_cached_object(sha1)) |
2137 | return 0; | |
2138 | if (cached_object_alloc <= cached_object_nr) { | |
2139 | cached_object_alloc = alloc_nr(cached_object_alloc); | |
2140 | cached_objects = xrealloc(cached_objects, | |
2141 | sizeof(*cached_objects) * | |
2142 | cached_object_alloc); | |
2143 | } | |
2144 | co = &cached_objects[cached_object_nr++]; | |
2145 | co->size = len; | |
21666f1a | 2146 | co->type = type; |
efa13f7b JH |
2147 | co->buf = xmalloc(len); |
2148 | memcpy(co->buf, buf, len); | |
d66b37bb JH |
2149 | hashcpy(co->sha1, sha1); |
2150 | return 0; | |
2151 | } | |
2152 | ||
c2c5b270 CC |
2153 | static void *read_object(const unsigned char *sha1, enum object_type *type, |
2154 | unsigned long *size) | |
0fcfd160 LT |
2155 | { |
2156 | unsigned long mapsize; | |
2157 | void *map, *buf; | |
d66b37bb JH |
2158 | struct cached_object *co; |
2159 | ||
2160 | co = find_cached_object(sha1); | |
2161 | if (co) { | |
21666f1a | 2162 | *type = co->type; |
d66b37bb | 2163 | *size = co->size; |
182af834 | 2164 | return xmemdupz(co->buf, co->size); |
d66b37bb | 2165 | } |
0fcfd160 | 2166 | |
8276c007 PE |
2167 | buf = read_packed_sha1(sha1, type, size); |
2168 | if (buf) | |
2169 | return buf; | |
bb6b8e4f | 2170 | map = map_sha1_file(sha1, &mapsize); |
0fcfd160 | 2171 | if (map) { |
7efbff75 | 2172 | buf = unpack_sha1_file(map, mapsize, type, size, sha1); |
0fcfd160 LT |
2173 | munmap(map, mapsize); |
2174 | return buf; | |
2175 | } | |
637cdd9d | 2176 | reprepare_packed_git(); |
8276c007 | 2177 | return read_packed_sha1(sha1, type, size); |
0fcfd160 LT |
2178 | } |
2179 | ||
b6c4cecc JH |
2180 | /* |
2181 | * This function dies on corrupt objects; the callers who want to | |
2182 | * deal with them should arrange to call read_object() and give error | |
2183 | * messages themselves. | |
2184 | */ | |
f5552aee CC |
2185 | void *read_sha1_file_repl(const unsigned char *sha1, |
2186 | enum object_type *type, | |
2187 | unsigned long *size, | |
2188 | const unsigned char **replacement) | |
ac939109 | 2189 | { |
68095570 | 2190 | const unsigned char *repl = lookup_replace_object(sha1); |
3ba7a065 | 2191 | void *data; |
e8b15e61 | 2192 | char *path; |
b6c4cecc JH |
2193 | const struct packed_git *p; |
2194 | ||
3ba7a065 JH |
2195 | errno = 0; |
2196 | data = read_object(repl, type, size); | |
b6c4cecc JH |
2197 | if (data) { |
2198 | if (replacement) | |
2199 | *replacement = repl; | |
2200 | return data; | |
2201 | } | |
68095570 | 2202 | |
25f3af3f | 2203 | if (errno && errno != ENOENT) |
3ba7a065 JH |
2204 | die_errno("failed to read object %s", sha1_to_hex(sha1)); |
2205 | ||
68095570 | 2206 | /* die if we replaced an object with one that does not exist */ |
b6c4cecc | 2207 | if (repl != sha1) |
68095570 CC |
2208 | die("replacement %s not found for %s", |
2209 | sha1_to_hex(repl), sha1_to_hex(sha1)); | |
2210 | ||
b6c4cecc JH |
2211 | if (has_loose_object(repl)) { |
2212 | path = sha1_file_name(sha1); | |
2213 | die("loose object %s (stored in %s) is corrupt", | |
2214 | sha1_to_hex(repl), path); | |
e8b15e61 | 2215 | } |
68095570 | 2216 | |
b6c4cecc JH |
2217 | if ((p = has_packed_and_bad(repl)) != NULL) |
2218 | die("packed object %s (stored in %s) is corrupt", | |
2219 | sha1_to_hex(repl), p->pack_name); | |
f5552aee | 2220 | |
b6c4cecc | 2221 | return NULL; |
ac939109 NP |
2222 | } |
2223 | ||
40469ee9 | 2224 | void *read_object_with_reference(const unsigned char *sha1, |
21666f1a | 2225 | const char *required_type_name, |
40469ee9 JH |
2226 | unsigned long *size, |
2227 | unsigned char *actual_sha1_return) | |
f4913f91 | 2228 | { |
21666f1a | 2229 | enum object_type type, required_type; |
f4913f91 JH |
2230 | void *buffer; |
2231 | unsigned long isize; | |
40469ee9 | 2232 | unsigned char actual_sha1[20]; |
f4913f91 | 2233 | |
21666f1a | 2234 | required_type = type_from_string(required_type_name); |
e702496e | 2235 | hashcpy(actual_sha1, sha1); |
40469ee9 JH |
2236 | while (1) { |
2237 | int ref_length = -1; | |
2238 | const char *ref_type = NULL; | |
f4913f91 | 2239 | |
21666f1a | 2240 | buffer = read_sha1_file(actual_sha1, &type, &isize); |
40469ee9 JH |
2241 | if (!buffer) |
2242 | return NULL; | |
21666f1a | 2243 | if (type == required_type) { |
40469ee9 JH |
2244 | *size = isize; |
2245 | if (actual_sha1_return) | |
e702496e | 2246 | hashcpy(actual_sha1_return, actual_sha1); |
40469ee9 JH |
2247 | return buffer; |
2248 | } | |
2249 | /* Handle references */ | |
21666f1a | 2250 | else if (type == OBJ_COMMIT) |
40469ee9 | 2251 | ref_type = "tree "; |
21666f1a | 2252 | else if (type == OBJ_TAG) |
40469ee9 JH |
2253 | ref_type = "object "; |
2254 | else { | |
2255 | free(buffer); | |
2256 | return NULL; | |
2257 | } | |
2258 | ref_length = strlen(ref_type); | |
f4913f91 | 2259 | |
50974ec9 MK |
2260 | if (ref_length + 40 > isize || |
2261 | memcmp(buffer, ref_type, ref_length) || | |
1d7f171c | 2262 | get_sha1_hex((char *) buffer + ref_length, actual_sha1)) { |
40469ee9 JH |
2263 | free(buffer); |
2264 | return NULL; | |
2265 | } | |
1cf58e72 | 2266 | free(buffer); |
40469ee9 JH |
2267 | /* Now we have the ID of the referred-to object in |
2268 | * actual_sha1. Check again. */ | |
f4913f91 | 2269 | } |
f4913f91 JH |
2270 | } |
2271 | ||
ce9fbf16 | 2272 | static void write_sha1_file_prepare(const void *buf, unsigned long len, |
972a9155 | 2273 | const char *type, unsigned char *sha1, |
d65a16f6 | 2274 | char *hdr, int *hdrlen) |
d410c0f5 | 2275 | { |
9126f009 | 2276 | git_SHA_CTX c; |
d410c0f5 JH |
2277 | |
2278 | /* Generate the header */ | |
d65a16f6 | 2279 | *hdrlen = sprintf(hdr, "%s %lu", type, len)+1; |
d410c0f5 JH |
2280 | |
2281 | /* Sha1.. */ | |
9126f009 NP |
2282 | git_SHA1_Init(&c); |
2283 | git_SHA1_Update(&c, hdr, *hdrlen); | |
2284 | git_SHA1_Update(&c, buf, len); | |
2285 | git_SHA1_Final(sha1, &c); | |
d410c0f5 JH |
2286 | } |
2287 | ||
230f1322 | 2288 | /* |
5a688fe4 JH |
2289 | * Move the just written object into its final resting place. |
2290 | * NEEDSWORK: this should be renamed to finalize_temp_file() as | |
2291 | * "moving" is only a part of what it does, when no patch between | |
2292 | * master to pu changes the call sites of this function. | |
230f1322 | 2293 | */ |
839837b9 | 2294 | int move_temp_to_file(const char *tmpfile, const char *filename) |
230f1322 | 2295 | { |
e32c0a9c | 2296 | int ret = 0; |
5a688fe4 | 2297 | |
348df166 | 2298 | if (object_creation_mode == OBJECT_CREATION_USES_RENAMES) |
be66a6c4 JS |
2299 | goto try_rename; |
2300 | else if (link(tmpfile, filename)) | |
e32c0a9c | 2301 | ret = errno; |
7ebb6fca LT |
2302 | |
2303 | /* | |
2304 | * Coda hack - coda doesn't like cross-directory links, | |
2305 | * so we fall back to a rename, which will mean that it | |
2306 | * won't be able to check collisions, but that's not a | |
2307 | * big deal. | |
2308 | * | |
2309 | * The same holds for FAT formatted media. | |
2310 | * | |
3be1f18e | 2311 | * When this succeeds, we just return. We have nothing |
7ebb6fca LT |
2312 | * left to unlink. |
2313 | */ | |
2314 | if (ret && ret != EEXIST) { | |
be66a6c4 | 2315 | try_rename: |
7ebb6fca | 2316 | if (!rename(tmpfile, filename)) |
3be1f18e | 2317 | goto out; |
9e48b389 | 2318 | ret = errno; |
230f1322 | 2319 | } |
691f1a28 | 2320 | unlink_or_warn(tmpfile); |
230f1322 LT |
2321 | if (ret) { |
2322 | if (ret != EEXIST) { | |
916d081b | 2323 | return error("unable to write sha1 filename %s: %s\n", filename, strerror(ret)); |
230f1322 LT |
2324 | } |
2325 | /* FIXME!!! Collision check here ? */ | |
2326 | } | |
2327 | ||
3be1f18e | 2328 | out: |
5256b006 | 2329 | if (adjust_shared_perm(filename)) |
5a688fe4 | 2330 | return error("unable to set permission to '%s'", filename); |
230f1322 LT |
2331 | return 0; |
2332 | } | |
2333 | ||
4d548150 LT |
2334 | static int write_buffer(int fd, const void *buf, size_t len) |
2335 | { | |
d34cf19b | 2336 | if (write_in_full(fd, buf, len) < 0) |
93822c22 | 2337 | return error("file write error (%s)", strerror(errno)); |
4d548150 LT |
2338 | return 0; |
2339 | } | |
2340 | ||
ce9fbf16 | 2341 | int hash_sha1_file(const void *buf, unsigned long len, const char *type, |
abdc3fc8 RS |
2342 | unsigned char *sha1) |
2343 | { | |
d65a16f6 | 2344 | char hdr[32]; |
abdc3fc8 RS |
2345 | int hdrlen; |
2346 | write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen); | |
2347 | return 0; | |
2348 | } | |
2349 | ||
e9039dd3 LT |
2350 | /* Finalize a file on disk, and close it. */ |
2351 | static void close_sha1_file(int fd) | |
2352 | { | |
aafe9fba LT |
2353 | if (fsync_object_files) |
2354 | fsync_or_die(fd, "sha1 file"); | |
e9039dd3 | 2355 | if (close(fd) != 0) |
d824cbba | 2356 | die_errno("error when closing sha1 file"); |
e9039dd3 LT |
2357 | } |
2358 | ||
5723fe7e LT |
2359 | /* Size of directory component, including the ending '/' */ |
2360 | static inline int directory_size(const char *filename) | |
2361 | { | |
2362 | const char *s = strrchr(filename, '/'); | |
2363 | if (!s) | |
2364 | return 0; | |
2365 | return s - filename + 1; | |
2366 | } | |
2367 | ||
2368 | /* | |
2369 | * This creates a temporary file in the same directory as the final | |
2370 | * 'filename' | |
2371 | * | |
2372 | * We want to avoid cross-directory filename renames, because those | |
2373 | * can have problems on various filesystems (FAT, NFS, Coda). | |
2374 | */ | |
2375 | static int create_tmpfile(char *buffer, size_t bufsiz, const char *filename) | |
2376 | { | |
2377 | int fd, dirlen = directory_size(filename); | |
2378 | ||
2379 | if (dirlen + 20 > bufsiz) { | |
2380 | errno = ENAMETOOLONG; | |
2381 | return -1; | |
2382 | } | |
2383 | memcpy(buffer, filename, dirlen); | |
2384 | strcpy(buffer + dirlen, "tmp_obj_XXXXXX"); | |
5256b006 | 2385 | fd = git_mkstemp_mode(buffer, 0444); |
cbacbf4e | 2386 | if (fd < 0 && dirlen && errno == ENOENT) { |
5723fe7e | 2387 | /* Make sure the directory exists */ |
6ff6af62 | 2388 | memcpy(buffer, filename, dirlen); |
5723fe7e | 2389 | buffer[dirlen-1] = 0; |
3bfaf018 | 2390 | if (mkdir(buffer, 0777) || adjust_shared_perm(buffer)) |
5723fe7e LT |
2391 | return -1; |
2392 | ||
2393 | /* Try again */ | |
2394 | strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX"); | |
5256b006 | 2395 | fd = git_mkstemp_mode(buffer, 0444); |
5723fe7e LT |
2396 | } |
2397 | return fd; | |
2398 | } | |
2399 | ||
bbac7311 | 2400 | static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen, |
c00e657d | 2401 | const void *buf, unsigned long len, time_t mtime) |
0fcfd160 | 2402 | { |
915308b1 | 2403 | int fd, ret; |
9892beba | 2404 | unsigned char compressed[4096]; |
0fcfd160 | 2405 | z_stream stream; |
748af44c NP |
2406 | git_SHA_CTX c; |
2407 | unsigned char parano_sha1[20]; | |
706bc531 | 2408 | char *filename; |
aac17941 | 2409 | static char tmpfile[PATH_MAX]; |
a44c9a5e | 2410 | |
972a9155 | 2411 | filename = sha1_file_name(sha1); |
5723fe7e | 2412 | fd = create_tmpfile(tmpfile, sizeof(tmpfile), filename); |
aac17941 | 2413 | if (fd < 0) { |
35243577 | 2414 | if (errno == EACCES) |
916d081b PB |
2415 | return error("insufficient permission for adding an object to repository database %s\n", get_object_directory()); |
2416 | else | |
2417 | return error("unable to create temporary sha1 filename %s: %s\n", tmpfile, strerror(errno)); | |
aac17941 LT |
2418 | } |
2419 | ||
0fcfd160 LT |
2420 | /* Set it up */ |
2421 | memset(&stream, 0, sizeof(stream)); | |
12f6c308 | 2422 | deflateInit(&stream, zlib_compression_level); |
0fcfd160 | 2423 | stream.next_out = compressed; |
9892beba | 2424 | stream.avail_out = sizeof(compressed); |
748af44c | 2425 | git_SHA1_Init(&c); |
a44c9a5e LT |
2426 | |
2427 | /* First header.. */ | |
d65a16f6 | 2428 | stream.next_in = (unsigned char *)hdr; |
a44c9a5e | 2429 | stream.avail_in = hdrlen; |
726f852b NP |
2430 | while (deflate(&stream, 0) == Z_OK) |
2431 | /* nothing */; | |
748af44c | 2432 | git_SHA1_Update(&c, hdr, hdrlen); |
a44c9a5e LT |
2433 | |
2434 | /* Then the data itself.. */ | |
c00e657d | 2435 | stream.next_in = (void *)buf; |
a44c9a5e | 2436 | stream.avail_in = len; |
9892beba | 2437 | do { |
748af44c | 2438 | unsigned char *in0 = stream.next_in; |
9892beba | 2439 | ret = deflate(&stream, Z_FINISH); |
748af44c | 2440 | git_SHA1_Update(&c, in0, stream.next_in - in0); |
9892beba NP |
2441 | if (write_buffer(fd, compressed, stream.next_out - compressed) < 0) |
2442 | die("unable to write sha1 file"); | |
2443 | stream.next_out = compressed; | |
2444 | stream.avail_out = sizeof(compressed); | |
2445 | } while (ret == Z_OK); | |
2446 | ||
ac54c277 LT |
2447 | if (ret != Z_STREAM_END) |
2448 | die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret); | |
ac54c277 LT |
2449 | ret = deflateEnd(&stream); |
2450 | if (ret != Z_OK) | |
2451 | die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret); | |
748af44c NP |
2452 | git_SHA1_Final(parano_sha1, &c); |
2453 | if (hashcmp(sha1, parano_sha1) != 0) | |
2454 | die("confused by unstable object source data for %s", sha1_to_hex(sha1)); | |
ac54c277 | 2455 | |
e9039dd3 | 2456 | close_sha1_file(fd); |
0fcfd160 | 2457 | |
bbac7311 NP |
2458 | if (mtime) { |
2459 | struct utimbuf utb; | |
2460 | utb.actime = mtime; | |
2461 | utb.modtime = mtime; | |
2462 | if (utime(tmpfile, &utb) < 0) | |
2463 | warning("failed utime() on %s: %s", | |
2464 | tmpfile, strerror(errno)); | |
2465 | } | |
2466 | ||
230f1322 | 2467 | return move_temp_to_file(tmpfile, filename); |
0fcfd160 | 2468 | } |
8237b185 | 2469 | |
c00e657d | 2470 | int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *returnsha1) |
bbac7311 NP |
2471 | { |
2472 | unsigned char sha1[20]; | |
2473 | char hdr[32]; | |
2474 | int hdrlen; | |
2475 | ||
2476 | /* Normally if we have it in the pack then we do not bother writing | |
2477 | * it out into .git/objects/??/?{38} file. | |
2478 | */ | |
2479 | write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen); | |
2480 | if (returnsha1) | |
2481 | hashcpy(returnsha1, sha1); | |
2482 | if (has_sha1_file(sha1)) | |
2483 | return 0; | |
2484 | return write_loose_object(sha1, hdr, hdrlen, buf, len, 0); | |
2485 | } | |
2486 | ||
2487 | int force_object_loose(const unsigned char *sha1, time_t mtime) | |
2488 | { | |
bbac7311 NP |
2489 | void *buf; |
2490 | unsigned long len; | |
2491 | enum object_type type; | |
2492 | char hdr[32]; | |
2493 | int hdrlen; | |
1fb23e65 | 2494 | int ret; |
bbac7311 | 2495 | |
c529d75a | 2496 | if (has_loose_object(sha1)) |
bbac7311 NP |
2497 | return 0; |
2498 | buf = read_packed_sha1(sha1, &type, &len); | |
2499 | if (!buf) | |
2500 | return error("cannot read sha1_file for %s", sha1_to_hex(sha1)); | |
2501 | hdrlen = sprintf(hdr, "%s %lu", typename(type), len) + 1; | |
1fb23e65 BS |
2502 | ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime); |
2503 | free(buf); | |
2504 | ||
2505 | return ret; | |
bbac7311 NP |
2506 | } |
2507 | ||
bf592c50 DB |
2508 | int has_pack_index(const unsigned char *sha1) |
2509 | { | |
2510 | struct stat st; | |
2511 | if (stat(sha1_pack_index_name(sha1), &st)) | |
2512 | return 0; | |
2513 | return 1; | |
bf592c50 DB |
2514 | } |
2515 | ||
cd673c1f JH |
2516 | int has_sha1_pack(const unsigned char *sha1) |
2517 | { | |
2518 | struct pack_entry e; | |
2519 | return find_pack_entry(sha1, &e); | |
2520 | } | |
2521 | ||
8237b185 DB |
2522 | int has_sha1_file(const unsigned char *sha1) |
2523 | { | |
1f688557 JH |
2524 | struct pack_entry e; |
2525 | ||
cd673c1f | 2526 | if (find_pack_entry(sha1, &e)) |
1f688557 | 2527 | return 1; |
c529d75a | 2528 | return has_loose_object(sha1); |
8237b185 | 2529 | } |
74400e71 | 2530 | |
c879daa2 NTND |
2531 | static void check_tree(const void *buf, size_t size) |
2532 | { | |
2533 | struct tree_desc desc; | |
2534 | struct name_entry entry; | |
2535 | ||
2536 | init_tree_desc(&desc, buf, size); | |
2537 | while (tree_entry(&desc, &entry)) | |
2538 | /* do nothing | |
2539 | * tree_entry() will die() on malformed entries */ | |
2540 | ; | |
2541 | } | |
2542 | ||
2543 | static void check_commit(const void *buf, size_t size) | |
2544 | { | |
2545 | struct commit c; | |
2546 | memset(&c, 0, sizeof(c)); | |
2547 | if (parse_commit_buffer(&c, buf, size)) | |
2548 | die("corrupt commit"); | |
2549 | } | |
2550 | ||
2551 | static void check_tag(const void *buf, size_t size) | |
2552 | { | |
2553 | struct tag t; | |
2554 | memset(&t, 0, sizeof(t)); | |
2555 | if (parse_tag_buffer(&t, buf, size)) | |
2556 | die("corrupt tag"); | |
2557 | } | |
2558 | ||
43df4f86 | 2559 | static int index_mem(unsigned char *sha1, void *buf, size_t size, |
c879daa2 NTND |
2560 | int write_object, enum object_type type, |
2561 | const char *path, int format_check) | |
e7332f96 | 2562 | { |
6c510bee | 2563 | int ret, re_allocated = 0; |
74400e71 | 2564 | |
7672db20 | 2565 | if (!type) |
edaec3fb | 2566 | type = OBJ_BLOB; |
6c510bee LT |
2567 | |
2568 | /* | |
2569 | * Convert blobs to git internal format | |
2570 | */ | |
43df4f86 | 2571 | if ((type == OBJ_BLOB) && path) { |
f285a2d7 | 2572 | struct strbuf nbuf = STRBUF_INIT; |
21e5ad50 SP |
2573 | if (convert_to_git(path, buf, size, &nbuf, |
2574 | write_object ? safe_crlf : 0)) { | |
b315c5c0 | 2575 | buf = strbuf_detach(&nbuf, &size); |
6c510bee LT |
2576 | re_allocated = 1; |
2577 | } | |
2578 | } | |
c879daa2 NTND |
2579 | if (format_check) { |
2580 | if (type == OBJ_TREE) | |
2581 | check_tree(buf, size); | |
2582 | if (type == OBJ_COMMIT) | |
2583 | check_commit(buf, size); | |
2584 | if (type == OBJ_TAG) | |
2585 | check_tag(buf, size); | |
2586 | } | |
6c510bee | 2587 | |
7672db20 | 2588 | if (write_object) |
edaec3fb | 2589 | ret = write_sha1_file(buf, size, typename(type), sha1); |
abdc3fc8 | 2590 | else |
edaec3fb | 2591 | ret = hash_sha1_file(buf, size, typename(type), sha1); |
43df4f86 | 2592 | if (re_allocated) |
6c510bee | 2593 | free(buf); |
43df4f86 DP |
2594 | return ret; |
2595 | } | |
2596 | ||
ea68b0ce DP |
2597 | #define SMALL_FILE_SIZE (32*1024) |
2598 | ||
43df4f86 | 2599 | int index_fd(unsigned char *sha1, int fd, struct stat *st, int write_object, |
c879daa2 | 2600 | enum object_type type, const char *path, int format_check) |
43df4f86 DP |
2601 | { |
2602 | int ret; | |
2603 | size_t size = xsize_t(st->st_size); | |
2604 | ||
2605 | if (!S_ISREG(st->st_mode)) { | |
f285a2d7 | 2606 | struct strbuf sbuf = STRBUF_INIT; |
43df4f86 DP |
2607 | if (strbuf_read(&sbuf, fd, 4096) >= 0) |
2608 | ret = index_mem(sha1, sbuf.buf, sbuf.len, write_object, | |
c879daa2 | 2609 | type, path, format_check); |
43df4f86 DP |
2610 | else |
2611 | ret = -1; | |
2612 | strbuf_release(&sbuf); | |
08bda208 | 2613 | } else if (!size) { |
c879daa2 NTND |
2614 | ret = index_mem(sha1, NULL, size, write_object, type, path, |
2615 | format_check); | |
ea68b0ce DP |
2616 | } else if (size <= SMALL_FILE_SIZE) { |
2617 | char *buf = xmalloc(size); | |
2618 | if (size == read_in_full(fd, buf, size)) | |
2619 | ret = index_mem(sha1, buf, size, write_object, type, | |
c879daa2 | 2620 | path, format_check); |
ea68b0ce DP |
2621 | else |
2622 | ret = error("short read %s", strerror(errno)); | |
2623 | free(buf); | |
08bda208 | 2624 | } else { |
43df4f86 | 2625 | void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0); |
c879daa2 NTND |
2626 | ret = index_mem(sha1, buf, size, write_object, type, path, |
2627 | format_check); | |
aac17941 | 2628 | munmap(buf, size); |
08bda208 | 2629 | } |
43df4f86 | 2630 | close(fd); |
aac17941 | 2631 | return ret; |
74400e71 | 2632 | } |
ec1fcc16 JH |
2633 | |
2634 | int index_path(unsigned char *sha1, const char *path, struct stat *st, int write_object) | |
2635 | { | |
2636 | int fd; | |
b760d3aa | 2637 | struct strbuf sb = STRBUF_INIT; |
ec1fcc16 JH |
2638 | |
2639 | switch (st->st_mode & S_IFMT) { | |
2640 | case S_IFREG: | |
2641 | fd = open(path, O_RDONLY); | |
2642 | if (fd < 0) | |
2643 | return error("open(\"%s\"): %s", path, | |
2644 | strerror(errno)); | |
c879daa2 | 2645 | if (index_fd(sha1, fd, st, write_object, OBJ_BLOB, path, 0) < 0) |
ec1fcc16 JH |
2646 | return error("%s: failed to insert into database", |
2647 | path); | |
2648 | break; | |
2649 | case S_IFLNK: | |
b760d3aa | 2650 | if (strbuf_readlink(&sb, path, st->st_size)) { |
ec1fcc16 | 2651 | char *errstr = strerror(errno); |
ec1fcc16 JH |
2652 | return error("readlink(\"%s\"): %s", path, |
2653 | errstr); | |
2654 | } | |
abdc3fc8 | 2655 | if (!write_object) |
b760d3aa LT |
2656 | hash_sha1_file(sb.buf, sb.len, blob_type, sha1); |
2657 | else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1)) | |
ec1fcc16 JH |
2658 | return error("%s: failed to insert into database", |
2659 | path); | |
b760d3aa | 2660 | strbuf_release(&sb); |
ec1fcc16 | 2661 | break; |
f35a6d3b LT |
2662 | case S_IFDIR: |
2663 | return resolve_gitlink_ref(path, "HEAD", sha1); | |
ec1fcc16 JH |
2664 | default: |
2665 | return error("%s: unsupported file type", path); | |
2666 | } | |
2667 | return 0; | |
2668 | } | |
a69e5429 JH |
2669 | |
2670 | int read_pack_header(int fd, struct pack_header *header) | |
2671 | { | |
c697ad14 HO |
2672 | if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header)) |
2673 | /* "eof before pack header was fully read" */ | |
2674 | return PH_ERROR_EOF; | |
2675 | ||
a69e5429 JH |
2676 | if (header->hdr_signature != htonl(PACK_SIGNATURE)) |
2677 | /* "protocol error (pack signature mismatch detected)" */ | |
2678 | return PH_ERROR_PACK_SIGNATURE; | |
2679 | if (!pack_version_ok(header->hdr_version)) | |
2680 | /* "protocol error (pack version unsupported)" */ | |
2681 | return PH_ERROR_PROTOCOL; | |
2682 | return 0; | |
2683 | } | |
40d52ff7 JK |
2684 | |
2685 | void assert_sha1_type(const unsigned char *sha1, enum object_type expect) | |
2686 | { | |
2687 | enum object_type type = sha1_object_info(sha1, NULL); | |
2688 | if (type < 0) | |
2689 | die("%s is not a valid object", sha1_to_hex(sha1)); | |
2690 | if (type != expect) | |
2691 | die("%s is not a valid '%s' object", sha1_to_hex(sha1), | |
2692 | typename(expect)); | |
2693 | } |