]>
Commit | Line | Data |
---|---|---|
08fd81c9 DS |
1 | #include "cache.h" |
2 | #include "config.h" | |
33286dcd | 3 | #include "dir.h" |
08fd81c9 DS |
4 | #include "git-compat-util.h" |
5 | #include "lockfile.h" | |
6 | #include "pack.h" | |
7 | #include "packfile.h" | |
8 | #include "commit.h" | |
9 | #include "object.h" | |
59fb8770 | 10 | #include "refs.h" |
08fd81c9 DS |
11 | #include "revision.h" |
12 | #include "sha1-lookup.h" | |
13 | #include "commit-graph.h" | |
b10edb2d | 14 | #include "object-store.h" |
96af91d4 | 15 | #include "alloc.h" |
d6538246 DS |
16 | #include "hashmap.h" |
17 | #include "replace-object.h" | |
7b0f2292 | 18 | #include "progress.h" |
08fd81c9 DS |
19 | |
20 | #define GRAPH_SIGNATURE 0x43475048 /* "CGPH" */ | |
21 | #define GRAPH_CHUNKID_OIDFANOUT 0x4f494446 /* "OIDF" */ | |
22 | #define GRAPH_CHUNKID_OIDLOOKUP 0x4f49444c /* "OIDL" */ | |
23 | #define GRAPH_CHUNKID_DATA 0x43444154 /* "CDAT" */ | |
5af7417b | 24 | #define GRAPH_CHUNKID_EXTRAEDGES 0x45444745 /* "EDGE" */ |
118bd570 | 25 | #define GRAPH_CHUNKID_BASE 0x42415345 /* "BASE" */ |
08fd81c9 | 26 | |
c1665998 | 27 | #define GRAPH_DATA_WIDTH (the_hash_algo->rawsz + 16) |
08fd81c9 DS |
28 | |
29 | #define GRAPH_VERSION_1 0x1 | |
30 | #define GRAPH_VERSION GRAPH_VERSION_1 | |
31 | ||
5af7417b | 32 | #define GRAPH_EXTRA_EDGES_NEEDED 0x80000000 |
08fd81c9 DS |
33 | #define GRAPH_EDGE_LAST_MASK 0x7fffffff |
34 | #define GRAPH_PARENT_NONE 0x70000000 | |
35 | ||
36 | #define GRAPH_LAST_EDGE 0x80000000 | |
37 | ||
0e3b97cc | 38 | #define GRAPH_HEADER_SIZE 8 |
08fd81c9 DS |
39 | #define GRAPH_FANOUT_SIZE (4 * 256) |
40 | #define GRAPH_CHUNKLOOKUP_WIDTH 12 | |
0e3b97cc | 41 | #define GRAPH_MIN_SIZE (GRAPH_HEADER_SIZE + 4 * GRAPH_CHUNKLOOKUP_WIDTH \ |
c1665998 | 42 | + GRAPH_FANOUT_SIZE + the_hash_algo->rawsz) |
08fd81c9 | 43 | |
cb99a34e DS |
44 | /* Remember to update object flag allocation in object.h */ |
45 | #define REACHABLE (1u<<15) | |
46 | ||
ad2dd5bb | 47 | char *get_commit_graph_filename(struct object_directory *odb) |
08fd81c9 | 48 | { |
ad2dd5bb | 49 | return xstrfmt("%s/info/commit-graph", odb->path); |
08fd81c9 DS |
50 | } |
51 | ||
ad2dd5bb | 52 | static char *get_split_graph_filename(struct object_directory *odb, |
5c84b339 DS |
53 | const char *oid_hex) |
54 | { | |
ad2dd5bb TB |
55 | return xstrfmt("%s/info/commit-graphs/graph-%s.graph", odb->path, |
56 | oid_hex); | |
5c84b339 DS |
57 | } |
58 | ||
ad2dd5bb | 59 | static char *get_chain_filename(struct object_directory *odb) |
5c84b339 | 60 | { |
ad2dd5bb | 61 | return xstrfmt("%s/info/commit-graphs/commit-graph-chain", odb->path); |
08fd81c9 DS |
62 | } |
63 | ||
c1665998 | 64 | static uint8_t oid_version(void) |
65 | { | |
66 | return 1; | |
67 | } | |
68 | ||
2a2e32bd DS |
69 | static struct commit_graph *alloc_commit_graph(void) |
70 | { | |
71 | struct commit_graph *g = xcalloc(1, sizeof(*g)); | |
72 | g->graph_fd = -1; | |
73 | ||
74 | return g; | |
75 | } | |
76 | ||
d6538246 DS |
77 | extern int read_replace_refs; |
78 | ||
79 | static int commit_graph_compatible(struct repository *r) | |
80 | { | |
5cef295f DS |
81 | if (!r->gitdir) |
82 | return 0; | |
83 | ||
d6538246 DS |
84 | if (read_replace_refs) { |
85 | prepare_replace_object(r); | |
86 | if (hashmap_get_size(&r->objects->replace_map->map)) | |
87 | return 0; | |
88 | } | |
89 | ||
20fd6d57 DS |
90 | prepare_commit_graft(r); |
91 | if (r->parsed_objects && r->parsed_objects->grafts_nr) | |
92 | return 0; | |
93 | if (is_repository_shallow(r)) | |
94 | return 0; | |
95 | ||
d6538246 DS |
96 | return 1; |
97 | } | |
98 | ||
61df89c8 ÆAB |
99 | int open_commit_graph(const char *graph_file, int *fd, struct stat *st) |
100 | { | |
101 | *fd = git_open(graph_file); | |
102 | if (*fd < 0) | |
103 | return 0; | |
104 | if (fstat(*fd, st)) { | |
105 | close(*fd); | |
106 | return 0; | |
107 | } | |
108 | return 1; | |
109 | } | |
110 | ||
a7df60ca TB |
111 | struct commit_graph *load_commit_graph_one_fd_st(int fd, struct stat *st, |
112 | struct object_directory *odb) | |
2a2e32bd DS |
113 | { |
114 | void *graph_map; | |
2a2e32bd | 115 | size_t graph_size; |
aa658574 | 116 | struct commit_graph *ret; |
2a2e32bd | 117 | |
61df89c8 | 118 | graph_size = xsize_t(st->st_size); |
2a2e32bd DS |
119 | |
120 | if (graph_size < GRAPH_MIN_SIZE) { | |
121 | close(fd); | |
67a530fa | 122 | error(_("commit-graph file is too small")); |
61df89c8 | 123 | return NULL; |
2a2e32bd DS |
124 | } |
125 | graph_map = xmmap(NULL, graph_size, PROT_READ, MAP_PRIVATE, fd, 0); | |
aa658574 JS |
126 | ret = parse_commit_graph(graph_map, fd, graph_size); |
127 | ||
a7df60ca TB |
128 | if (ret) |
129 | ret->odb = odb; | |
130 | else { | |
aa658574 JS |
131 | munmap(graph_map, graph_size); |
132 | close(fd); | |
aa658574 JS |
133 | } |
134 | ||
135 | return ret; | |
136 | } | |
137 | ||
2ac138d5 ÆAB |
138 | static int verify_commit_graph_lite(struct commit_graph *g) |
139 | { | |
140 | /* | |
141 | * Basic validation shared between parse_commit_graph() | |
142 | * which'll be called every time the graph is used, and the | |
143 | * much more expensive verify_commit_graph() used by | |
144 | * "commit-graph verify". | |
145 | * | |
146 | * There should only be very basic checks here to ensure that | |
147 | * we don't e.g. segfault in fill_commit_in_graph(), but | |
148 | * because this is a very hot codepath nothing that e.g. loops | |
149 | * over g->num_commits, or runs a checksum on the commit-graph | |
150 | * itself. | |
151 | */ | |
152 | if (!g->chunk_oid_fanout) { | |
153 | error("commit-graph is missing the OID Fanout chunk"); | |
154 | return 1; | |
155 | } | |
156 | if (!g->chunk_oid_lookup) { | |
157 | error("commit-graph is missing the OID Lookup chunk"); | |
158 | return 1; | |
159 | } | |
160 | if (!g->chunk_commit_data) { | |
161 | error("commit-graph is missing the Commit Data chunk"); | |
162 | return 1; | |
163 | } | |
164 | ||
165 | return 0; | |
166 | } | |
167 | ||
aa658574 JS |
168 | struct commit_graph *parse_commit_graph(void *graph_map, int fd, |
169 | size_t graph_size) | |
170 | { | |
171 | const unsigned char *data, *chunk_lookup; | |
172 | uint32_t i; | |
173 | struct commit_graph *graph; | |
174 | uint64_t last_chunk_offset; | |
175 | uint32_t last_chunk_id; | |
176 | uint32_t graph_signature; | |
177 | unsigned char graph_version, hash_version; | |
178 | ||
179 | if (!graph_map) | |
180 | return NULL; | |
181 | ||
182 | if (graph_size < GRAPH_MIN_SIZE) | |
183 | return NULL; | |
184 | ||
2a2e32bd DS |
185 | data = (const unsigned char *)graph_map; |
186 | ||
187 | graph_signature = get_be32(data); | |
188 | if (graph_signature != GRAPH_SIGNATURE) { | |
93b4405f | 189 | error(_("commit-graph signature %X does not match signature %X"), |
2a2e32bd | 190 | graph_signature, GRAPH_SIGNATURE); |
aa658574 | 191 | return NULL; |
2a2e32bd DS |
192 | } |
193 | ||
194 | graph_version = *(unsigned char*)(data + 4); | |
195 | if (graph_version != GRAPH_VERSION) { | |
93b4405f | 196 | error(_("commit-graph version %X does not match version %X"), |
2a2e32bd | 197 | graph_version, GRAPH_VERSION); |
aa658574 | 198 | return NULL; |
2a2e32bd DS |
199 | } |
200 | ||
201 | hash_version = *(unsigned char*)(data + 5); | |
c1665998 | 202 | if (hash_version != oid_version()) { |
93b4405f | 203 | error(_("commit-graph hash version %X does not match version %X"), |
c1665998 | 204 | hash_version, oid_version()); |
aa658574 | 205 | return NULL; |
2a2e32bd DS |
206 | } |
207 | ||
208 | graph = alloc_commit_graph(); | |
209 | ||
c1665998 | 210 | graph->hash_len = the_hash_algo->rawsz; |
2a2e32bd DS |
211 | graph->num_chunks = *(unsigned char*)(data + 6); |
212 | graph->graph_fd = fd; | |
213 | graph->data = graph_map; | |
214 | graph->data_len = graph_size; | |
215 | ||
216 | last_chunk_id = 0; | |
217 | last_chunk_offset = 8; | |
218 | chunk_lookup = data + 8; | |
219 | for (i = 0; i < graph->num_chunks; i++) { | |
d2b86fba JS |
220 | uint32_t chunk_id; |
221 | uint64_t chunk_offset; | |
2a2e32bd DS |
222 | int chunk_repeated = 0; |
223 | ||
d2b86fba JS |
224 | if (data + graph_size - chunk_lookup < |
225 | GRAPH_CHUNKLOOKUP_WIDTH) { | |
93b4405f | 226 | error(_("commit-graph chunk lookup table entry missing; file may be incomplete")); |
d2b86fba JS |
227 | free(graph); |
228 | return NULL; | |
229 | } | |
230 | ||
231 | chunk_id = get_be32(chunk_lookup + 0); | |
232 | chunk_offset = get_be64(chunk_lookup + 4); | |
233 | ||
2a2e32bd DS |
234 | chunk_lookup += GRAPH_CHUNKLOOKUP_WIDTH; |
235 | ||
c1665998 | 236 | if (chunk_offset > graph_size - the_hash_algo->rawsz) { |
93b4405f | 237 | error(_("commit-graph improper chunk offset %08x%08x"), (uint32_t)(chunk_offset >> 32), |
2a2e32bd | 238 | (uint32_t)chunk_offset); |
aa658574 JS |
239 | free(graph); |
240 | return NULL; | |
2a2e32bd DS |
241 | } |
242 | ||
243 | switch (chunk_id) { | |
244 | case GRAPH_CHUNKID_OIDFANOUT: | |
245 | if (graph->chunk_oid_fanout) | |
246 | chunk_repeated = 1; | |
247 | else | |
248 | graph->chunk_oid_fanout = (uint32_t*)(data + chunk_offset); | |
249 | break; | |
250 | ||
251 | case GRAPH_CHUNKID_OIDLOOKUP: | |
252 | if (graph->chunk_oid_lookup) | |
253 | chunk_repeated = 1; | |
254 | else | |
255 | graph->chunk_oid_lookup = data + chunk_offset; | |
256 | break; | |
257 | ||
258 | case GRAPH_CHUNKID_DATA: | |
259 | if (graph->chunk_commit_data) | |
260 | chunk_repeated = 1; | |
261 | else | |
262 | graph->chunk_commit_data = data + chunk_offset; | |
263 | break; | |
264 | ||
5af7417b SG |
265 | case GRAPH_CHUNKID_EXTRAEDGES: |
266 | if (graph->chunk_extra_edges) | |
2a2e32bd DS |
267 | chunk_repeated = 1; |
268 | else | |
5af7417b | 269 | graph->chunk_extra_edges = data + chunk_offset; |
2a2e32bd | 270 | break; |
118bd570 DS |
271 | |
272 | case GRAPH_CHUNKID_BASE: | |
273 | if (graph->chunk_base_graphs) | |
274 | chunk_repeated = 1; | |
275 | else | |
276 | graph->chunk_base_graphs = data + chunk_offset; | |
2a2e32bd DS |
277 | } |
278 | ||
279 | if (chunk_repeated) { | |
93b4405f | 280 | error(_("commit-graph chunk id %08x appears multiple times"), chunk_id); |
aa658574 JS |
281 | free(graph); |
282 | return NULL; | |
2a2e32bd DS |
283 | } |
284 | ||
285 | if (last_chunk_id == GRAPH_CHUNKID_OIDLOOKUP) | |
286 | { | |
287 | graph->num_commits = (chunk_offset - last_chunk_offset) | |
288 | / graph->hash_len; | |
289 | } | |
290 | ||
291 | last_chunk_id = chunk_id; | |
292 | last_chunk_offset = chunk_offset; | |
293 | } | |
294 | ||
118bd570 DS |
295 | hashcpy(graph->oid.hash, graph->data + graph->data_len - graph->hash_len); |
296 | ||
98552f25 JS |
297 | if (verify_commit_graph_lite(graph)) { |
298 | free(graph); | |
2ac138d5 | 299 | return NULL; |
98552f25 | 300 | } |
2ac138d5 | 301 | |
2a2e32bd | 302 | return graph; |
2a2e32bd DS |
303 | } |
304 | ||
a7df60ca TB |
305 | static struct commit_graph *load_commit_graph_one(const char *graph_file, |
306 | struct object_directory *odb) | |
61df89c8 ÆAB |
307 | { |
308 | ||
309 | struct stat st; | |
310 | int fd; | |
6c622f9f | 311 | struct commit_graph *g; |
61df89c8 ÆAB |
312 | int open_ok = open_commit_graph(graph_file, &fd, &st); |
313 | ||
314 | if (!open_ok) | |
315 | return NULL; | |
316 | ||
a7df60ca | 317 | g = load_commit_graph_one_fd_st(fd, &st, odb); |
6c622f9f DS |
318 | |
319 | if (g) | |
320 | g->filename = xstrdup(graph_file); | |
321 | ||
322 | return g; | |
61df89c8 ÆAB |
323 | } |
324 | ||
13c24992 TB |
325 | static struct commit_graph *load_commit_graph_v1(struct repository *r, |
326 | struct object_directory *odb) | |
5c84b339 | 327 | { |
ad2dd5bb | 328 | char *graph_name = get_commit_graph_filename(odb); |
a7df60ca | 329 | struct commit_graph *g = load_commit_graph_one(graph_name, odb); |
5c84b339 DS |
330 | free(graph_name); |
331 | ||
332 | return g; | |
333 | } | |
334 | ||
335 | static int add_graph_to_chain(struct commit_graph *g, | |
336 | struct commit_graph *chain, | |
337 | struct object_id *oids, | |
338 | int n) | |
339 | { | |
340 | struct commit_graph *cur_g = chain; | |
341 | ||
118bd570 DS |
342 | if (n && !g->chunk_base_graphs) { |
343 | warning(_("commit-graph has no base graphs chunk")); | |
344 | return 0; | |
345 | } | |
346 | ||
5c84b339 DS |
347 | while (n) { |
348 | n--; | |
118bd570 DS |
349 | |
350 | if (!cur_g || | |
351 | !oideq(&oids[n], &cur_g->oid) || | |
352 | !hasheq(oids[n].hash, g->chunk_base_graphs + g->hash_len * n)) { | |
353 | warning(_("commit-graph chain does not match")); | |
354 | return 0; | |
355 | } | |
356 | ||
5c84b339 DS |
357 | cur_g = cur_g->base_graph; |
358 | } | |
359 | ||
360 | g->base_graph = chain; | |
361 | ||
362 | if (chain) | |
363 | g->num_commits_in_base = chain->num_commits + chain->num_commits_in_base; | |
364 | ||
365 | return 1; | |
366 | } | |
367 | ||
13c24992 TB |
368 | static struct commit_graph *load_commit_graph_chain(struct repository *r, |
369 | struct object_directory *odb) | |
5c84b339 DS |
370 | { |
371 | struct commit_graph *graph_chain = NULL; | |
372 | struct strbuf line = STRBUF_INIT; | |
373 | struct stat st; | |
374 | struct object_id *oids; | |
375 | int i = 0, valid = 1, count; | |
ad2dd5bb | 376 | char *chain_name = get_chain_filename(odb); |
5c84b339 DS |
377 | FILE *fp; |
378 | int stat_res; | |
379 | ||
380 | fp = fopen(chain_name, "r"); | |
381 | stat_res = stat(chain_name, &st); | |
382 | free(chain_name); | |
383 | ||
384 | if (!fp || | |
385 | stat_res || | |
386 | st.st_size <= the_hash_algo->hexsz) | |
387 | return NULL; | |
388 | ||
389 | count = st.st_size / (the_hash_algo->hexsz + 1); | |
390 | oids = xcalloc(count, sizeof(struct object_id)); | |
391 | ||
c523035c DS |
392 | prepare_alt_odb(r); |
393 | ||
394 | for (i = 0; i < count; i++) { | |
395 | struct object_directory *odb; | |
5c84b339 DS |
396 | |
397 | if (strbuf_getline_lf(&line, fp) == EOF) | |
398 | break; | |
399 | ||
400 | if (get_oid_hex(line.buf, &oids[i])) { | |
401 | warning(_("invalid commit-graph chain: line '%s' not a hash"), | |
402 | line.buf); | |
403 | valid = 0; | |
404 | break; | |
405 | } | |
406 | ||
c523035c DS |
407 | valid = 0; |
408 | for (odb = r->objects->odb; odb; odb = odb->next) { | |
ad2dd5bb | 409 | char *graph_name = get_split_graph_filename(odb, line.buf); |
a7df60ca | 410 | struct commit_graph *g = load_commit_graph_one(graph_name, odb); |
5c84b339 | 411 | |
c523035c DS |
412 | free(graph_name); |
413 | ||
414 | if (g) { | |
c523035c DS |
415 | if (add_graph_to_chain(g, graph_chain, oids, i)) { |
416 | graph_chain = g; | |
417 | valid = 1; | |
418 | } | |
419 | ||
420 | break; | |
421 | } | |
422 | } | |
423 | ||
424 | if (!valid) { | |
425 | warning(_("unable to find all commit-graph files")); | |
426 | break; | |
427 | } | |
5c84b339 DS |
428 | } |
429 | ||
430 | free(oids); | |
431 | fclose(fp); | |
0aa6bce7 | 432 | strbuf_release(&line); |
5c84b339 DS |
433 | |
434 | return graph_chain; | |
435 | } | |
436 | ||
13c24992 TB |
437 | struct commit_graph *read_commit_graph_one(struct repository *r, |
438 | struct object_directory *odb) | |
5c84b339 | 439 | { |
13c24992 | 440 | struct commit_graph *g = load_commit_graph_v1(r, odb); |
5c84b339 DS |
441 | |
442 | if (!g) | |
13c24992 | 443 | g = load_commit_graph_chain(r, odb); |
5c84b339 DS |
444 | |
445 | return g; | |
61df89c8 ÆAB |
446 | } |
447 | ||
13c24992 TB |
448 | static void prepare_commit_graph_one(struct repository *r, |
449 | struct object_directory *odb) | |
177722b3 | 450 | { |
177722b3 | 451 | |
dade47c0 | 452 | if (r->objects->commit_graph) |
177722b3 DS |
453 | return; |
454 | ||
13c24992 | 455 | r->objects->commit_graph = read_commit_graph_one(r, odb); |
177722b3 DS |
456 | } |
457 | ||
5faf357b JT |
458 | /* |
459 | * Return 1 if commit_graph is non-NULL, and 0 otherwise. | |
460 | * | |
15beaaa3 | 461 | * On the first invocation, this function attempts to load the commit |
5faf357b JT |
462 | * graph if the_repository is configured to have one. |
463 | */ | |
dade47c0 | 464 | static int prepare_commit_graph(struct repository *r) |
177722b3 | 465 | { |
263db403 | 466 | struct object_directory *odb; |
dade47c0 | 467 | |
6abada18 JK |
468 | /* |
469 | * This must come before the "already attempted?" check below, because | |
470 | * we want to disable even an already-loaded graph file. | |
471 | */ | |
472 | if (r->commit_graph_disabled) | |
473 | return 0; | |
43d35618 | 474 | |
dade47c0 JT |
475 | if (r->objects->commit_graph_attempted) |
476 | return !!r->objects->commit_graph; | |
477 | r->objects->commit_graph_attempted = 1; | |
478 | ||
fbab552a JK |
479 | if (git_env_bool(GIT_TEST_COMMIT_GRAPH_DIE_ON_LOAD, 0)) |
480 | die("dying as requested by the '%s' variable on commit-graph load!", | |
481 | GIT_TEST_COMMIT_GRAPH_DIE_ON_LOAD); | |
482 | ||
7211b9e7 DS |
483 | prepare_repo_settings(r); |
484 | ||
859fdc0c | 485 | if (!git_env_bool(GIT_TEST_COMMIT_GRAPH, 0) && |
7211b9e7 | 486 | r->settings.core_commit_graph != 1) |
dade47c0 JT |
487 | /* |
488 | * This repository is not configured to use commit graphs, so | |
489 | * do not load one. (But report commit_graph_attempted anyway | |
490 | * so that commit graph loading is not attempted again for this | |
491 | * repository.) | |
492 | */ | |
5faf357b JT |
493 | return 0; |
494 | ||
d6538246 DS |
495 | if (!commit_graph_compatible(r)) |
496 | return 0; | |
497 | ||
dade47c0 | 498 | prepare_alt_odb(r); |
f0eaf638 | 499 | for (odb = r->objects->odb; |
263db403 JK |
500 | !r->objects->commit_graph && odb; |
501 | odb = odb->next) | |
13c24992 | 502 | prepare_commit_graph_one(r, odb); |
dade47c0 | 503 | return !!r->objects->commit_graph; |
177722b3 DS |
504 | } |
505 | ||
6cc01743 DS |
506 | int generation_numbers_enabled(struct repository *r) |
507 | { | |
508 | uint32_t first_generation; | |
509 | struct commit_graph *g; | |
510 | if (!prepare_commit_graph(r)) | |
511 | return 0; | |
512 | ||
513 | g = r->objects->commit_graph; | |
514 | ||
515 | if (!g->num_commits) | |
516 | return 0; | |
517 | ||
518 | first_generation = get_be32(g->chunk_commit_data + | |
519 | g->hash_len + 8) >> 2; | |
520 | ||
521 | return !!first_generation; | |
522 | } | |
523 | ||
d4f4d60f DS |
524 | static void close_commit_graph_one(struct commit_graph *g) |
525 | { | |
526 | if (!g) | |
527 | return; | |
528 | ||
529 | close_commit_graph_one(g->base_graph); | |
530 | free_commit_graph(g); | |
531 | } | |
532 | ||
c3a3a964 | 533 | void close_commit_graph(struct raw_object_store *o) |
177722b3 | 534 | { |
d4f4d60f | 535 | close_commit_graph_one(o->commit_graph); |
c3a3a964 | 536 | o->commit_graph = NULL; |
177722b3 DS |
537 | } |
538 | ||
539 | static int bsearch_graph(struct commit_graph *g, struct object_id *oid, uint32_t *pos) | |
540 | { | |
541 | return bsearch_hash(oid->hash, g->chunk_oid_fanout, | |
542 | g->chunk_oid_lookup, g->hash_len, pos); | |
543 | } | |
544 | ||
d4f4d60f DS |
545 | static void load_oid_from_graph(struct commit_graph *g, |
546 | uint32_t pos, | |
547 | struct object_id *oid) | |
548 | { | |
549 | uint32_t lex_index; | |
550 | ||
551 | while (g && pos < g->num_commits_in_base) | |
552 | g = g->base_graph; | |
553 | ||
554 | if (!g) | |
555 | BUG("NULL commit-graph"); | |
556 | ||
557 | if (pos >= g->num_commits + g->num_commits_in_base) | |
558 | die(_("invalid commit position. commit-graph is likely corrupt")); | |
559 | ||
560 | lex_index = pos - g->num_commits_in_base; | |
561 | ||
562 | hashcpy(oid->hash, g->chunk_oid_lookup + g->hash_len * lex_index); | |
563 | } | |
564 | ||
4f542b7a SB |
565 | static struct commit_list **insert_parent_or_die(struct repository *r, |
566 | struct commit_graph *g, | |
d4f4d60f | 567 | uint32_t pos, |
177722b3 DS |
568 | struct commit_list **pptr) |
569 | { | |
570 | struct commit *c; | |
571 | struct object_id oid; | |
96af91d4 | 572 | |
d4f4d60f DS |
573 | if (pos >= g->num_commits + g->num_commits_in_base) |
574 | die("invalid parent position %"PRIu32, pos); | |
53614b13 | 575 | |
d4f4d60f | 576 | load_oid_from_graph(g, pos, &oid); |
4f542b7a | 577 | c = lookup_commit(r, &oid); |
177722b3 | 578 | if (!c) |
4f5b532d | 579 | die(_("could not find commit %s"), oid_to_hex(&oid)); |
177722b3 DS |
580 | c->graph_pos = pos; |
581 | return &commit_list_insert(c, pptr)->next; | |
582 | } | |
583 | ||
e2838d85 DS |
584 | static void fill_commit_graph_info(struct commit *item, struct commit_graph *g, uint32_t pos) |
585 | { | |
d4f4d60f DS |
586 | const unsigned char *commit_data; |
587 | uint32_t lex_index; | |
588 | ||
589 | while (pos < g->num_commits_in_base) | |
590 | g = g->base_graph; | |
591 | ||
592 | lex_index = pos - g->num_commits_in_base; | |
593 | commit_data = g->chunk_commit_data + GRAPH_DATA_WIDTH * lex_index; | |
e2838d85 DS |
594 | item->graph_pos = pos; |
595 | item->generation = get_be32(commit_data + g->hash_len + 8) >> 2; | |
596 | } | |
597 | ||
a133c40b NTND |
598 | static inline void set_commit_tree(struct commit *c, struct tree *t) |
599 | { | |
600 | c->maybe_tree = t; | |
601 | } | |
602 | ||
4f542b7a SB |
603 | static int fill_commit_in_graph(struct repository *r, |
604 | struct commit *item, | |
605 | struct commit_graph *g, uint32_t pos) | |
177722b3 | 606 | { |
177722b3 DS |
607 | uint32_t edge_value; |
608 | uint32_t *parent_data_ptr; | |
609 | uint64_t date_low, date_high; | |
610 | struct commit_list **pptr; | |
d4f4d60f DS |
611 | const unsigned char *commit_data; |
612 | uint32_t lex_index; | |
177722b3 | 613 | |
d4f4d60f DS |
614 | while (pos < g->num_commits_in_base) |
615 | g = g->base_graph; | |
616 | ||
617 | if (pos >= g->num_commits + g->num_commits_in_base) | |
618 | die(_("invalid commit position. commit-graph is likely corrupt")); | |
619 | ||
620 | /* | |
621 | * Store the "full" position, but then use the | |
622 | * "local" position for the rest of the calculation. | |
623 | */ | |
177722b3 | 624 | item->graph_pos = pos; |
d4f4d60f DS |
625 | lex_index = pos - g->num_commits_in_base; |
626 | ||
627 | commit_data = g->chunk_commit_data + (g->hash_len + 16) * lex_index; | |
628 | ||
629 | item->object.parsed = 1; | |
177722b3 | 630 | |
a133c40b | 631 | set_commit_tree(item, NULL); |
177722b3 DS |
632 | |
633 | date_high = get_be32(commit_data + g->hash_len + 8) & 0x3; | |
634 | date_low = get_be32(commit_data + g->hash_len + 12); | |
635 | item->date = (timestamp_t)((date_high << 32) | date_low); | |
636 | ||
83073cc9 DS |
637 | item->generation = get_be32(commit_data + g->hash_len + 8) >> 2; |
638 | ||
177722b3 DS |
639 | pptr = &item->parents; |
640 | ||
641 | edge_value = get_be32(commit_data + g->hash_len); | |
642 | if (edge_value == GRAPH_PARENT_NONE) | |
643 | return 1; | |
4f542b7a | 644 | pptr = insert_parent_or_die(r, g, edge_value, pptr); |
177722b3 DS |
645 | |
646 | edge_value = get_be32(commit_data + g->hash_len + 4); | |
647 | if (edge_value == GRAPH_PARENT_NONE) | |
648 | return 1; | |
5af7417b | 649 | if (!(edge_value & GRAPH_EXTRA_EDGES_NEEDED)) { |
4f542b7a | 650 | pptr = insert_parent_or_die(r, g, edge_value, pptr); |
177722b3 DS |
651 | return 1; |
652 | } | |
653 | ||
5af7417b | 654 | parent_data_ptr = (uint32_t*)(g->chunk_extra_edges + |
177722b3 DS |
655 | 4 * (uint64_t)(edge_value & GRAPH_EDGE_LAST_MASK)); |
656 | do { | |
657 | edge_value = get_be32(parent_data_ptr); | |
4f542b7a | 658 | pptr = insert_parent_or_die(r, g, |
177722b3 DS |
659 | edge_value & GRAPH_EDGE_LAST_MASK, |
660 | pptr); | |
661 | parent_data_ptr++; | |
662 | } while (!(edge_value & GRAPH_LAST_EDGE)); | |
663 | ||
664 | return 1; | |
665 | } | |
666 | ||
e2838d85 DS |
667 | static int find_commit_in_graph(struct commit *item, struct commit_graph *g, uint32_t *pos) |
668 | { | |
669 | if (item->graph_pos != COMMIT_NOT_FROM_GRAPH) { | |
670 | *pos = item->graph_pos; | |
671 | return 1; | |
672 | } else { | |
d4f4d60f DS |
673 | struct commit_graph *cur_g = g; |
674 | uint32_t lex_index; | |
675 | ||
676 | while (cur_g && !bsearch_graph(cur_g, &(item->object.oid), &lex_index)) | |
677 | cur_g = cur_g->base_graph; | |
678 | ||
679 | if (cur_g) { | |
680 | *pos = lex_index + cur_g->num_commits_in_base; | |
681 | return 1; | |
682 | } | |
683 | ||
684 | return 0; | |
e2838d85 DS |
685 | } |
686 | } | |
687 | ||
4f542b7a SB |
688 | static int parse_commit_in_graph_one(struct repository *r, |
689 | struct commit_graph *g, | |
690 | struct commit *item) | |
177722b3 | 691 | { |
e2838d85 DS |
692 | uint32_t pos; |
693 | ||
177722b3 DS |
694 | if (item->object.parsed) |
695 | return 1; | |
ee797053 DS |
696 | |
697 | if (find_commit_in_graph(item, g, &pos)) | |
4f542b7a | 698 | return fill_commit_in_graph(r, item, g, pos); |
ee797053 DS |
699 | |
700 | return 0; | |
701 | } | |
702 | ||
dade47c0 | 703 | int parse_commit_in_graph(struct repository *r, struct commit *item) |
ee797053 | 704 | { |
dade47c0 | 705 | if (!prepare_commit_graph(r)) |
ee797053 | 706 | return 0; |
4f542b7a | 707 | return parse_commit_in_graph_one(r, r->objects->commit_graph, item); |
177722b3 DS |
708 | } |
709 | ||
dade47c0 | 710 | void load_commit_graph_info(struct repository *r, struct commit *item) |
e2838d85 DS |
711 | { |
712 | uint32_t pos; | |
dade47c0 | 713 | if (!prepare_commit_graph(r)) |
e2838d85 | 714 | return; |
dade47c0 JT |
715 | if (find_commit_in_graph(item, r->objects->commit_graph, &pos)) |
716 | fill_commit_graph_info(item, r->objects->commit_graph, pos); | |
e2838d85 DS |
717 | } |
718 | ||
4f542b7a SB |
719 | static struct tree *load_tree_for_commit(struct repository *r, |
720 | struct commit_graph *g, | |
721 | struct commit *c) | |
7b8a21db DS |
722 | { |
723 | struct object_id oid; | |
d4f4d60f DS |
724 | const unsigned char *commit_data; |
725 | ||
726 | while (c->graph_pos < g->num_commits_in_base) | |
727 | g = g->base_graph; | |
728 | ||
729 | commit_data = g->chunk_commit_data + | |
730 | GRAPH_DATA_WIDTH * (c->graph_pos - g->num_commits_in_base); | |
7b8a21db DS |
731 | |
732 | hashcpy(oid.hash, commit_data); | |
a133c40b | 733 | set_commit_tree(c, lookup_tree(r, &oid)); |
7b8a21db DS |
734 | |
735 | return c->maybe_tree; | |
736 | } | |
737 | ||
4f542b7a SB |
738 | static struct tree *get_commit_tree_in_graph_one(struct repository *r, |
739 | struct commit_graph *g, | |
0cbef8f8 | 740 | const struct commit *c) |
7b8a21db DS |
741 | { |
742 | if (c->maybe_tree) | |
743 | return c->maybe_tree; | |
744 | if (c->graph_pos == COMMIT_NOT_FROM_GRAPH) | |
0cbef8f8 DS |
745 | BUG("get_commit_tree_in_graph_one called from non-commit-graph commit"); |
746 | ||
4f542b7a | 747 | return load_tree_for_commit(r, g, (struct commit *)c); |
0cbef8f8 | 748 | } |
7b8a21db | 749 | |
dade47c0 | 750 | struct tree *get_commit_tree_in_graph(struct repository *r, const struct commit *c) |
0cbef8f8 | 751 | { |
4f542b7a | 752 | return get_commit_tree_in_graph_one(r, r->objects->commit_graph, c); |
7b8a21db DS |
753 | } |
754 | ||
c9905bea DS |
755 | struct packed_commit_list { |
756 | struct commit **list; | |
757 | int nr; | |
758 | int alloc; | |
759 | }; | |
760 | ||
761 | struct packed_oid_list { | |
762 | struct object_id *list; | |
763 | int nr; | |
764 | int alloc; | |
765 | }; | |
766 | ||
767 | struct write_commit_graph_context { | |
768 | struct repository *r; | |
0bd52e27 | 769 | struct object_directory *odb; |
c9905bea DS |
770 | char *graph_name; |
771 | struct packed_oid_list oids; | |
772 | struct packed_commit_list commits; | |
773 | int num_extra_edges; | |
774 | unsigned long approx_nr_objects; | |
775 | struct progress *progress; | |
776 | int progress_done; | |
777 | uint64_t progress_cnt; | |
6c622f9f DS |
778 | |
779 | char *base_graph_name; | |
780 | int num_commit_graphs_before; | |
781 | int num_commit_graphs_after; | |
782 | char **commit_graph_filenames_before; | |
783 | char **commit_graph_filenames_after; | |
784 | char **commit_graph_hash_after; | |
785 | uint32_t new_num_commits_in_base; | |
786 | struct commit_graph *new_base_graph; | |
787 | ||
c9905bea | 788 | unsigned append:1, |
6c622f9f | 789 | report_progress:1, |
7c5c9b9c SG |
790 | split:1, |
791 | check_oids:1; | |
c2bc6e6a DS |
792 | |
793 | const struct split_commit_graph_opts *split_opts; | |
c9905bea DS |
794 | }; |
795 | ||
08fd81c9 | 796 | static void write_graph_chunk_fanout(struct hashfile *f, |
c9905bea | 797 | struct write_commit_graph_context *ctx) |
08fd81c9 DS |
798 | { |
799 | int i, count = 0; | |
c9905bea | 800 | struct commit **list = ctx->commits.list; |
08fd81c9 DS |
801 | |
802 | /* | |
803 | * Write the first-level table (the list is sorted, | |
804 | * but we use a 256-entry lookup to be able to avoid | |
805 | * having to do eight extra binary search iterations). | |
806 | */ | |
807 | for (i = 0; i < 256; i++) { | |
c9905bea | 808 | while (count < ctx->commits.nr) { |
08fd81c9 DS |
809 | if ((*list)->object.oid.hash[0] != i) |
810 | break; | |
c9905bea | 811 | display_progress(ctx->progress, ++ctx->progress_cnt); |
08fd81c9 DS |
812 | count++; |
813 | list++; | |
814 | } | |
815 | ||
816 | hashwrite_be32(f, count); | |
817 | } | |
818 | } | |
819 | ||
820 | static void write_graph_chunk_oids(struct hashfile *f, int hash_len, | |
c9905bea | 821 | struct write_commit_graph_context *ctx) |
08fd81c9 | 822 | { |
c9905bea | 823 | struct commit **list = ctx->commits.list; |
08fd81c9 | 824 | int count; |
c9905bea DS |
825 | for (count = 0; count < ctx->commits.nr; count++, list++) { |
826 | display_progress(ctx->progress, ++ctx->progress_cnt); | |
08fd81c9 | 827 | hashwrite(f, (*list)->object.oid.hash, (int)hash_len); |
53035c4f | 828 | } |
08fd81c9 DS |
829 | } |
830 | ||
831 | static const unsigned char *commit_to_sha1(size_t index, void *table) | |
832 | { | |
833 | struct commit **commits = table; | |
834 | return commits[index]->object.oid.hash; | |
835 | } | |
836 | ||
837 | static void write_graph_chunk_data(struct hashfile *f, int hash_len, | |
c9905bea | 838 | struct write_commit_graph_context *ctx) |
08fd81c9 | 839 | { |
c9905bea DS |
840 | struct commit **list = ctx->commits.list; |
841 | struct commit **last = ctx->commits.list + ctx->commits.nr; | |
08fd81c9 DS |
842 | uint32_t num_extra_edges = 0; |
843 | ||
844 | while (list < last) { | |
845 | struct commit_list *parent; | |
806278de | 846 | struct object_id *tree; |
08fd81c9 DS |
847 | int edge_value; |
848 | uint32_t packedDate[2]; | |
c9905bea | 849 | display_progress(ctx->progress, ++ctx->progress_cnt); |
08fd81c9 | 850 | |
16749b8d TB |
851 | if (parse_commit_no_graph(*list)) |
852 | die(_("unable to parse commit %s"), | |
853 | oid_to_hex(&(*list)->object.oid)); | |
806278de | 854 | tree = get_commit_tree_oid(*list); |
806278de | 855 | hashwrite(f, tree->hash, hash_len); |
08fd81c9 DS |
856 | |
857 | parent = (*list)->parents; | |
858 | ||
859 | if (!parent) | |
860 | edge_value = GRAPH_PARENT_NONE; | |
861 | else { | |
862 | edge_value = sha1_pos(parent->item->object.oid.hash, | |
c9905bea DS |
863 | ctx->commits.list, |
864 | ctx->commits.nr, | |
08fd81c9 DS |
865 | commit_to_sha1); |
866 | ||
6c622f9f DS |
867 | if (edge_value >= 0) |
868 | edge_value += ctx->new_num_commits_in_base; | |
869 | else { | |
870 | uint32_t pos; | |
871 | if (find_commit_in_graph(parent->item, | |
872 | ctx->new_base_graph, | |
873 | &pos)) | |
874 | edge_value = pos; | |
875 | } | |
876 | ||
08fd81c9 | 877 | if (edge_value < 0) |
cce99cd8 DS |
878 | BUG("missing parent %s for commit %s", |
879 | oid_to_hex(&parent->item->object.oid), | |
880 | oid_to_hex(&(*list)->object.oid)); | |
08fd81c9 DS |
881 | } |
882 | ||
883 | hashwrite_be32(f, edge_value); | |
884 | ||
885 | if (parent) | |
886 | parent = parent->next; | |
887 | ||
888 | if (!parent) | |
889 | edge_value = GRAPH_PARENT_NONE; | |
890 | else if (parent->next) | |
5af7417b | 891 | edge_value = GRAPH_EXTRA_EDGES_NEEDED | num_extra_edges; |
08fd81c9 DS |
892 | else { |
893 | edge_value = sha1_pos(parent->item->object.oid.hash, | |
c9905bea DS |
894 | ctx->commits.list, |
895 | ctx->commits.nr, | |
08fd81c9 | 896 | commit_to_sha1); |
6c622f9f DS |
897 | |
898 | if (edge_value >= 0) | |
899 | edge_value += ctx->new_num_commits_in_base; | |
900 | else { | |
901 | uint32_t pos; | |
902 | if (find_commit_in_graph(parent->item, | |
903 | ctx->new_base_graph, | |
904 | &pos)) | |
905 | edge_value = pos; | |
906 | } | |
907 | ||
08fd81c9 | 908 | if (edge_value < 0) |
cce99cd8 DS |
909 | BUG("missing parent %s for commit %s", |
910 | oid_to_hex(&parent->item->object.oid), | |
911 | oid_to_hex(&(*list)->object.oid)); | |
08fd81c9 DS |
912 | } |
913 | ||
914 | hashwrite_be32(f, edge_value); | |
915 | ||
5af7417b | 916 | if (edge_value & GRAPH_EXTRA_EDGES_NEEDED) { |
08fd81c9 DS |
917 | do { |
918 | num_extra_edges++; | |
919 | parent = parent->next; | |
920 | } while (parent); | |
921 | } | |
922 | ||
923 | if (sizeof((*list)->date) > 4) | |
924 | packedDate[0] = htonl(((*list)->date >> 32) & 0x3); | |
925 | else | |
926 | packedDate[0] = 0; | |
927 | ||
3258c663 DS |
928 | packedDate[0] |= htonl((*list)->generation << 2); |
929 | ||
08fd81c9 DS |
930 | packedDate[1] = htonl((*list)->date); |
931 | hashwrite(f, packedDate, 8); | |
932 | ||
933 | list++; | |
934 | } | |
935 | } | |
936 | ||
5af7417b | 937 | static void write_graph_chunk_extra_edges(struct hashfile *f, |
c9905bea | 938 | struct write_commit_graph_context *ctx) |
08fd81c9 | 939 | { |
c9905bea DS |
940 | struct commit **list = ctx->commits.list; |
941 | struct commit **last = ctx->commits.list + ctx->commits.nr; | |
08fd81c9 DS |
942 | struct commit_list *parent; |
943 | ||
944 | while (list < last) { | |
945 | int num_parents = 0; | |
53035c4f | 946 | |
c9905bea | 947 | display_progress(ctx->progress, ++ctx->progress_cnt); |
53035c4f | 948 | |
08fd81c9 DS |
949 | for (parent = (*list)->parents; num_parents < 3 && parent; |
950 | parent = parent->next) | |
951 | num_parents++; | |
952 | ||
953 | if (num_parents <= 2) { | |
954 | list++; | |
955 | continue; | |
956 | } | |
957 | ||
958 | /* Since num_parents > 2, this initializer is safe. */ | |
959 | for (parent = (*list)->parents->next; parent; parent = parent->next) { | |
960 | int edge_value = sha1_pos(parent->item->object.oid.hash, | |
c9905bea DS |
961 | ctx->commits.list, |
962 | ctx->commits.nr, | |
08fd81c9 DS |
963 | commit_to_sha1); |
964 | ||
6c622f9f DS |
965 | if (edge_value >= 0) |
966 | edge_value += ctx->new_num_commits_in_base; | |
967 | else { | |
968 | uint32_t pos; | |
969 | if (find_commit_in_graph(parent->item, | |
970 | ctx->new_base_graph, | |
971 | &pos)) | |
972 | edge_value = pos; | |
973 | } | |
974 | ||
08fd81c9 | 975 | if (edge_value < 0) |
cce99cd8 DS |
976 | BUG("missing parent %s for commit %s", |
977 | oid_to_hex(&parent->item->object.oid), | |
978 | oid_to_hex(&(*list)->object.oid)); | |
08fd81c9 DS |
979 | else if (!parent->next) |
980 | edge_value |= GRAPH_LAST_EDGE; | |
981 | ||
982 | hashwrite_be32(f, edge_value); | |
983 | } | |
984 | ||
985 | list++; | |
986 | } | |
987 | } | |
988 | ||
3cbc6ed3 | 989 | static int oid_compare(const void *_a, const void *_b) |
08fd81c9 DS |
990 | { |
991 | const struct object_id *a = (const struct object_id *)_a; | |
992 | const struct object_id *b = (const struct object_id *)_b; | |
993 | return oidcmp(a, b); | |
994 | } | |
995 | ||
08fd81c9 DS |
996 | static int add_packed_commits(const struct object_id *oid, |
997 | struct packed_git *pack, | |
998 | uint32_t pos, | |
999 | void *data) | |
1000 | { | |
c9905bea | 1001 | struct write_commit_graph_context *ctx = (struct write_commit_graph_context*)data; |
08fd81c9 DS |
1002 | enum object_type type; |
1003 | off_t offset = nth_packed_object_offset(pack, pos); | |
1004 | struct object_info oi = OBJECT_INFO_INIT; | |
1005 | ||
c9905bea DS |
1006 | if (ctx->progress) |
1007 | display_progress(ctx->progress, ++ctx->progress_done); | |
7b0f2292 | 1008 | |
08fd81c9 | 1009 | oi.typep = &type; |
c9905bea | 1010 | if (packed_object_info(ctx->r, pack, offset, &oi) < 0) |
4f5b532d | 1011 | die(_("unable to get type of object %s"), oid_to_hex(oid)); |
08fd81c9 DS |
1012 | |
1013 | if (type != OBJ_COMMIT) | |
1014 | return 0; | |
1015 | ||
c9905bea DS |
1016 | ALLOC_GROW(ctx->oids.list, ctx->oids.nr + 1, ctx->oids.alloc); |
1017 | oidcpy(&(ctx->oids.list[ctx->oids.nr]), oid); | |
1018 | ctx->oids.nr++; | |
08fd81c9 DS |
1019 | |
1020 | return 0; | |
1021 | } | |
1022 | ||
c9905bea | 1023 | static void add_missing_parents(struct write_commit_graph_context *ctx, struct commit *commit) |
4f2542b4 DS |
1024 | { |
1025 | struct commit_list *parent; | |
1026 | for (parent = commit->parents; parent; parent = parent->next) { | |
cb99a34e | 1027 | if (!(parent->item->object.flags & REACHABLE)) { |
c9905bea DS |
1028 | ALLOC_GROW(ctx->oids.list, ctx->oids.nr + 1, ctx->oids.alloc); |
1029 | oidcpy(&ctx->oids.list[ctx->oids.nr], &(parent->item->object.oid)); | |
1030 | ctx->oids.nr++; | |
cb99a34e | 1031 | parent->item->object.flags |= REACHABLE; |
4f2542b4 DS |
1032 | } |
1033 | } | |
1034 | } | |
1035 | ||
c9905bea | 1036 | static void close_reachable(struct write_commit_graph_context *ctx) |
4f2542b4 | 1037 | { |
49bbc57a | 1038 | int i; |
4f2542b4 DS |
1039 | struct commit *commit; |
1040 | ||
c9905bea DS |
1041 | if (ctx->report_progress) |
1042 | ctx->progress = start_delayed_progress( | |
1043 | _("Loading known commits in commit graph"), | |
1044 | ctx->oids.nr); | |
1045 | for (i = 0; i < ctx->oids.nr; i++) { | |
1046 | display_progress(ctx->progress, i + 1); | |
1047 | commit = lookup_commit(ctx->r, &ctx->oids.list[i]); | |
4f2542b4 | 1048 | if (commit) |
cb99a34e | 1049 | commit->object.flags |= REACHABLE; |
4f2542b4 | 1050 | } |
c9905bea | 1051 | stop_progress(&ctx->progress); |
4f2542b4 DS |
1052 | |
1053 | /* | |
c9905bea | 1054 | * As this loop runs, ctx->oids.nr may grow, but not more |
4f2542b4 DS |
1055 | * than the number of missing commits in the reachable |
1056 | * closure. | |
1057 | */ | |
c9905bea DS |
1058 | if (ctx->report_progress) |
1059 | ctx->progress = start_delayed_progress( | |
1060 | _("Expanding reachable commits in commit graph"), | |
67fa6aac | 1061 | 0); |
c9905bea DS |
1062 | for (i = 0; i < ctx->oids.nr; i++) { |
1063 | display_progress(ctx->progress, i + 1); | |
1064 | commit = lookup_commit(ctx->r, &ctx->oids.list[i]); | |
4f2542b4 | 1065 | |
6c622f9f DS |
1066 | if (!commit) |
1067 | continue; | |
1068 | if (ctx->split) { | |
1069 | if (!parse_commit(commit) && | |
1070 | commit->graph_pos == COMMIT_NOT_FROM_GRAPH) | |
1071 | add_missing_parents(ctx, commit); | |
1072 | } else if (!parse_commit_no_graph(commit)) | |
c9905bea | 1073 | add_missing_parents(ctx, commit); |
4f2542b4 | 1074 | } |
c9905bea | 1075 | stop_progress(&ctx->progress); |
4f2542b4 | 1076 | |
c9905bea DS |
1077 | if (ctx->report_progress) |
1078 | ctx->progress = start_delayed_progress( | |
1079 | _("Clearing commit marks in commit graph"), | |
1080 | ctx->oids.nr); | |
1081 | for (i = 0; i < ctx->oids.nr; i++) { | |
1082 | display_progress(ctx->progress, i + 1); | |
1083 | commit = lookup_commit(ctx->r, &ctx->oids.list[i]); | |
4f2542b4 DS |
1084 | |
1085 | if (commit) | |
cb99a34e | 1086 | commit->object.flags &= ~REACHABLE; |
4f2542b4 | 1087 | } |
c9905bea | 1088 | stop_progress(&ctx->progress); |
4f2542b4 DS |
1089 | } |
1090 | ||
c9905bea | 1091 | static void compute_generation_numbers(struct write_commit_graph_context *ctx) |
3258c663 DS |
1092 | { |
1093 | int i; | |
1094 | struct commit_list *list = NULL; | |
1095 | ||
c9905bea | 1096 | if (ctx->report_progress) |
ecc08690 | 1097 | ctx->progress = start_delayed_progress( |
c9905bea DS |
1098 | _("Computing commit graph generation numbers"), |
1099 | ctx->commits.nr); | |
1100 | for (i = 0; i < ctx->commits.nr; i++) { | |
1101 | display_progress(ctx->progress, i + 1); | |
1102 | if (ctx->commits.list[i]->generation != GENERATION_NUMBER_INFINITY && | |
1103 | ctx->commits.list[i]->generation != GENERATION_NUMBER_ZERO) | |
3258c663 DS |
1104 | continue; |
1105 | ||
c9905bea | 1106 | commit_list_insert(ctx->commits.list[i], &list); |
3258c663 DS |
1107 | while (list) { |
1108 | struct commit *current = list->item; | |
1109 | struct commit_list *parent; | |
1110 | int all_parents_computed = 1; | |
1111 | uint32_t max_generation = 0; | |
1112 | ||
1113 | for (parent = current->parents; parent; parent = parent->next) { | |
1114 | if (parent->item->generation == GENERATION_NUMBER_INFINITY || | |
1115 | parent->item->generation == GENERATION_NUMBER_ZERO) { | |
1116 | all_parents_computed = 0; | |
1117 | commit_list_insert(parent->item, &list); | |
1118 | break; | |
1119 | } else if (parent->item->generation > max_generation) { | |
1120 | max_generation = parent->item->generation; | |
1121 | } | |
1122 | } | |
1123 | ||
1124 | if (all_parents_computed) { | |
1125 | current->generation = max_generation + 1; | |
1126 | pop_commit(&list); | |
1127 | ||
1128 | if (current->generation > GENERATION_NUMBER_MAX) | |
1129 | current->generation = GENERATION_NUMBER_MAX; | |
1130 | } | |
1131 | } | |
1132 | } | |
c9905bea | 1133 | stop_progress(&ctx->progress); |
3258c663 DS |
1134 | } |
1135 | ||
59fb8770 DS |
1136 | static int add_ref_to_list(const char *refname, |
1137 | const struct object_id *oid, | |
1138 | int flags, void *cb_data) | |
1139 | { | |
1140 | struct string_list *list = (struct string_list *)cb_data; | |
1141 | ||
1142 | string_list_append(list, oid_to_hex(oid)); | |
1143 | return 0; | |
1144 | } | |
1145 | ||
0bd52e27 | 1146 | int write_commit_graph_reachable(struct object_directory *odb, |
39d88318 | 1147 | enum commit_graph_write_flags flags, |
c2bc6e6a | 1148 | const struct split_commit_graph_opts *split_opts) |
59fb8770 | 1149 | { |
f4dbdfc4 | 1150 | struct string_list list = STRING_LIST_INIT_DUP; |
e103f727 | 1151 | int result; |
59fb8770 | 1152 | |
59fb8770 | 1153 | for_each_ref(add_ref_to_list, &list); |
0bd52e27 | 1154 | result = write_commit_graph(odb, NULL, &list, |
c2bc6e6a | 1155 | flags, split_opts); |
f4dbdfc4 DS |
1156 | |
1157 | string_list_clear(&list, 0); | |
e103f727 | 1158 | return result; |
59fb8770 DS |
1159 | } |
1160 | ||
ef5b83f2 DS |
1161 | static int fill_oids_from_packs(struct write_commit_graph_context *ctx, |
1162 | struct string_list *pack_indexes) | |
08fd81c9 | 1163 | { |
ef5b83f2 | 1164 | uint32_t i; |
28944739 | 1165 | struct strbuf progress_title = STRBUF_INIT; |
ef5b83f2 DS |
1166 | struct strbuf packname = STRBUF_INIT; |
1167 | int dirlen; | |
08fd81c9 | 1168 | |
0bd52e27 | 1169 | strbuf_addf(&packname, "%s/pack/", ctx->odb->path); |
ef5b83f2 DS |
1170 | dirlen = packname.len; |
1171 | if (ctx->report_progress) { | |
1172 | strbuf_addf(&progress_title, | |
1173 | Q_("Finding commits for commit graph in %d pack", | |
1174 | "Finding commits for commit graph in %d packs", | |
1175 | pack_indexes->nr), | |
1176 | pack_indexes->nr); | |
1177 | ctx->progress = start_delayed_progress(progress_title.buf, 0); | |
1178 | ctx->progress_done = 0; | |
7547b95b | 1179 | } |
ef5b83f2 DS |
1180 | for (i = 0; i < pack_indexes->nr; i++) { |
1181 | struct packed_git *p; | |
1182 | strbuf_setlen(&packname, dirlen); | |
1183 | strbuf_addstr(&packname, pack_indexes->items[i].string); | |
1184 | p = add_packed_git(packname.buf, packname.len, 1); | |
1185 | if (!p) { | |
1186 | error(_("error adding pack %s"), packname.buf); | |
1187 | return -1; | |
7547b95b | 1188 | } |
ef5b83f2 DS |
1189 | if (open_pack_index(p)) { |
1190 | error(_("error opening index for %s"), packname.buf); | |
1191 | return -1; | |
1192 | } | |
1193 | for_each_object_in_pack(p, add_packed_commits, ctx, | |
1194 | FOR_EACH_OBJECT_PACK_ORDER); | |
1195 | close_pack(p); | |
1196 | free(p); | |
7547b95b DS |
1197 | } |
1198 | ||
ef5b83f2 | 1199 | stop_progress(&ctx->progress); |
0aa6bce7 | 1200 | strbuf_release(&progress_title); |
ef5b83f2 DS |
1201 | strbuf_release(&packname); |
1202 | ||
1203 | return 0; | |
1204 | } | |
1205 | ||
7c5c9b9c SG |
1206 | static int fill_oids_from_commit_hex(struct write_commit_graph_context *ctx, |
1207 | struct string_list *commit_hex) | |
4c9efe85 DS |
1208 | { |
1209 | uint32_t i; | |
1210 | struct strbuf progress_title = STRBUF_INIT; | |
1211 | ||
1212 | if (ctx->report_progress) { | |
1213 | strbuf_addf(&progress_title, | |
1214 | Q_("Finding commits for commit graph from %d ref", | |
1215 | "Finding commits for commit graph from %d refs", | |
1216 | commit_hex->nr), | |
1217 | commit_hex->nr); | |
1218 | ctx->progress = start_delayed_progress( | |
1219 | progress_title.buf, | |
1220 | commit_hex->nr); | |
3d5df01b | 1221 | } |
4c9efe85 DS |
1222 | for (i = 0; i < commit_hex->nr; i++) { |
1223 | const char *end; | |
1224 | struct object_id oid; | |
1225 | struct commit *result; | |
1226 | ||
1227 | display_progress(ctx->progress, i + 1); | |
7c5c9b9c SG |
1228 | if (!parse_oid_hex(commit_hex->items[i].string, &oid, &end) && |
1229 | (result = lookup_commit_reference_gently(ctx->r, &oid, 1))) { | |
4c9efe85 DS |
1230 | ALLOC_GROW(ctx->oids.list, ctx->oids.nr + 1, ctx->oids.alloc); |
1231 | oidcpy(&ctx->oids.list[ctx->oids.nr], &(result->object.oid)); | |
1232 | ctx->oids.nr++; | |
7c5c9b9c SG |
1233 | } else if (ctx->check_oids) { |
1234 | error(_("invalid commit object id: %s"), | |
1235 | commit_hex->items[i].string); | |
1236 | return -1; | |
3d5df01b DS |
1237 | } |
1238 | } | |
4c9efe85 DS |
1239 | stop_progress(&ctx->progress); |
1240 | strbuf_release(&progress_title); | |
7c5c9b9c SG |
1241 | |
1242 | return 0; | |
4c9efe85 | 1243 | } |
3d5df01b | 1244 | |
b2c83060 DS |
1245 | static void fill_oids_from_all_packs(struct write_commit_graph_context *ctx) |
1246 | { | |
1247 | if (ctx->report_progress) | |
1248 | ctx->progress = start_delayed_progress( | |
1249 | _("Finding commits for commit graph among packed objects"), | |
1250 | ctx->approx_nr_objects); | |
1251 | for_each_packed_object(add_packed_commits, ctx, | |
1252 | FOR_EACH_OBJECT_PACK_ORDER); | |
1253 | if (ctx->progress_done < ctx->approx_nr_objects) | |
1254 | display_progress(ctx->progress, ctx->approx_nr_objects); | |
1255 | stop_progress(&ctx->progress); | |
1256 | } | |
049d51a2 | 1257 | |
014e3440 DS |
1258 | static uint32_t count_distinct_commits(struct write_commit_graph_context *ctx) |
1259 | { | |
1260 | uint32_t i, count_distinct = 1; | |
08fd81c9 | 1261 | |
014e3440 DS |
1262 | if (ctx->report_progress) |
1263 | ctx->progress = start_delayed_progress( | |
890226cc | 1264 | _("Counting distinct commits in commit graph"), |
014e3440 DS |
1265 | ctx->oids.nr); |
1266 | display_progress(ctx->progress, 0); /* TODO: Measure QSORT() progress */ | |
3cbc6ed3 | 1267 | QSORT(ctx->oids.list, ctx->oids.nr, oid_compare); |
014e3440 DS |
1268 | |
1269 | for (i = 1; i < ctx->oids.nr; i++) { | |
1270 | display_progress(ctx->progress, i + 1); | |
6c622f9f DS |
1271 | if (!oideq(&ctx->oids.list[i - 1], &ctx->oids.list[i])) { |
1272 | if (ctx->split) { | |
1273 | struct commit *c = lookup_commit(ctx->r, &ctx->oids.list[i]); | |
1274 | ||
1275 | if (!c || c->graph_pos != COMMIT_NOT_FROM_GRAPH) | |
1276 | continue; | |
1277 | } | |
1278 | ||
08fd81c9 | 1279 | count_distinct++; |
6c622f9f | 1280 | } |
08fd81c9 | 1281 | } |
014e3440 | 1282 | stop_progress(&ctx->progress); |
08fd81c9 | 1283 | |
014e3440 DS |
1284 | return count_distinct; |
1285 | } | |
08fd81c9 | 1286 | |
f998d542 DS |
1287 | static void copy_oids_to_commits(struct write_commit_graph_context *ctx) |
1288 | { | |
1289 | uint32_t i; | |
08fd81c9 | 1290 | |
f998d542 DS |
1291 | ctx->num_extra_edges = 0; |
1292 | if (ctx->report_progress) | |
1293 | ctx->progress = start_delayed_progress( | |
890226cc | 1294 | _("Finding extra edges in commit graph"), |
f998d542 DS |
1295 | ctx->oids.nr); |
1296 | for (i = 0; i < ctx->oids.nr; i++) { | |
689a146c RS |
1297 | unsigned int num_parents; |
1298 | ||
f998d542 DS |
1299 | display_progress(ctx->progress, i + 1); |
1300 | if (i > 0 && oideq(&ctx->oids.list[i - 1], &ctx->oids.list[i])) | |
08fd81c9 DS |
1301 | continue; |
1302 | ||
6c622f9f | 1303 | ALLOC_GROW(ctx->commits.list, ctx->commits.nr + 1, ctx->commits.alloc); |
f998d542 | 1304 | ctx->commits.list[ctx->commits.nr] = lookup_commit(ctx->r, &ctx->oids.list[i]); |
6c622f9f DS |
1305 | |
1306 | if (ctx->split && | |
1307 | ctx->commits.list[ctx->commits.nr]->graph_pos != COMMIT_NOT_FROM_GRAPH) | |
1308 | continue; | |
1309 | ||
f998d542 | 1310 | parse_commit_no_graph(ctx->commits.list[ctx->commits.nr]); |
08fd81c9 | 1311 | |
689a146c | 1312 | num_parents = commit_list_count(ctx->commits.list[ctx->commits.nr]->parents); |
08fd81c9 | 1313 | if (num_parents > 2) |
f998d542 | 1314 | ctx->num_extra_edges += num_parents - 1; |
08fd81c9 | 1315 | |
f998d542 | 1316 | ctx->commits.nr++; |
08fd81c9 | 1317 | } |
f998d542 DS |
1318 | stop_progress(&ctx->progress); |
1319 | } | |
08fd81c9 | 1320 | |
6c622f9f DS |
1321 | static int write_graph_chunk_base_1(struct hashfile *f, |
1322 | struct commit_graph *g) | |
1323 | { | |
1324 | int num = 0; | |
1325 | ||
1326 | if (!g) | |
1327 | return 0; | |
1328 | ||
1329 | num = write_graph_chunk_base_1(f, g->base_graph); | |
1330 | hashwrite(f, g->oid.hash, the_hash_algo->rawsz); | |
1331 | return num + 1; | |
1332 | } | |
1333 | ||
1334 | static int write_graph_chunk_base(struct hashfile *f, | |
1335 | struct write_commit_graph_context *ctx) | |
1336 | { | |
1337 | int num = write_graph_chunk_base_1(f, ctx->new_base_graph); | |
1338 | ||
1339 | if (num != ctx->num_commit_graphs_after - 1) { | |
1340 | error(_("failed to write correct number of base graph ids")); | |
1341 | return -1; | |
1342 | } | |
1343 | ||
1344 | return 0; | |
1345 | } | |
1346 | ||
238def57 | 1347 | static int write_commit_graph_file(struct write_commit_graph_context *ctx) |
08fd81c9 | 1348 | { |
238def57 | 1349 | uint32_t i; |
6c622f9f | 1350 | int fd; |
08fd81c9 | 1351 | struct hashfile *f; |
08fd81c9 | 1352 | struct lock_file lk = LOCK_INIT; |
6c622f9f DS |
1353 | uint32_t chunk_ids[6]; |
1354 | uint64_t chunk_offsets[6]; | |
c1665998 | 1355 | const unsigned hashsz = the_hash_algo->rawsz; |
28944739 | 1356 | struct strbuf progress_title = STRBUF_INIT; |
144354b0 | 1357 | int num_chunks = 3; |
6c622f9f DS |
1358 | struct object_id file_hash; |
1359 | ||
1360 | if (ctx->split) { | |
1361 | struct strbuf tmp_file = STRBUF_INIT; | |
1362 | ||
1363 | strbuf_addf(&tmp_file, | |
1364 | "%s/info/commit-graphs/tmp_graph_XXXXXX", | |
0bd52e27 | 1365 | ctx->odb->path); |
6c622f9f DS |
1366 | ctx->graph_name = strbuf_detach(&tmp_file, NULL); |
1367 | } else { | |
ad2dd5bb | 1368 | ctx->graph_name = get_commit_graph_filename(ctx->odb); |
6c622f9f | 1369 | } |
238def57 | 1370 | |
238def57 DS |
1371 | if (safe_create_leading_directories(ctx->graph_name)) { |
1372 | UNLEAK(ctx->graph_name); | |
1373 | error(_("unable to create leading directories of %s"), | |
1374 | ctx->graph_name); | |
1375 | return -1; | |
f4dbdfc4 | 1376 | } |
08fd81c9 | 1377 | |
6c622f9f | 1378 | if (ctx->split) { |
ad2dd5bb | 1379 | char *lock_name = get_chain_filename(ctx->odb); |
08fd81c9 | 1380 | |
6c622f9f | 1381 | hold_lock_file_for_update(&lk, lock_name, LOCK_DIE_ON_ERROR); |
08fd81c9 | 1382 | |
6c622f9f DS |
1383 | fd = git_mkstemp_mode(ctx->graph_name, 0444); |
1384 | if (fd < 0) { | |
1385 | error(_("unable to create '%s'"), ctx->graph_name); | |
1386 | return -1; | |
1387 | } | |
1388 | ||
1389 | f = hashfd(fd, ctx->graph_name); | |
1390 | } else { | |
1391 | hold_lock_file_for_update(&lk, ctx->graph_name, LOCK_DIE_ON_ERROR); | |
1392 | fd = lk.tempfile->fd; | |
1393 | f = hashfd(lk.tempfile->fd, lk.tempfile->filename.buf); | |
1394 | } | |
08fd81c9 DS |
1395 | |
1396 | chunk_ids[0] = GRAPH_CHUNKID_OIDFANOUT; | |
1397 | chunk_ids[1] = GRAPH_CHUNKID_OIDLOOKUP; | |
1398 | chunk_ids[2] = GRAPH_CHUNKID_DATA; | |
144354b0 DS |
1399 | if (ctx->num_extra_edges) { |
1400 | chunk_ids[num_chunks] = GRAPH_CHUNKID_EXTRAEDGES; | |
1401 | num_chunks++; | |
1402 | } | |
6c622f9f DS |
1403 | if (ctx->num_commit_graphs_after > 1) { |
1404 | chunk_ids[num_chunks] = GRAPH_CHUNKID_BASE; | |
1405 | num_chunks++; | |
1406 | } | |
144354b0 DS |
1407 | |
1408 | chunk_ids[num_chunks] = 0; | |
08fd81c9 DS |
1409 | |
1410 | chunk_offsets[0] = 8 + (num_chunks + 1) * GRAPH_CHUNKLOOKUP_WIDTH; | |
1411 | chunk_offsets[1] = chunk_offsets[0] + GRAPH_FANOUT_SIZE; | |
238def57 DS |
1412 | chunk_offsets[2] = chunk_offsets[1] + hashsz * ctx->commits.nr; |
1413 | chunk_offsets[3] = chunk_offsets[2] + (hashsz + 16) * ctx->commits.nr; | |
144354b0 DS |
1414 | |
1415 | num_chunks = 3; | |
1416 | if (ctx->num_extra_edges) { | |
1417 | chunk_offsets[num_chunks + 1] = chunk_offsets[num_chunks] + | |
1418 | 4 * ctx->num_extra_edges; | |
1419 | num_chunks++; | |
1420 | } | |
6c622f9f DS |
1421 | if (ctx->num_commit_graphs_after > 1) { |
1422 | chunk_offsets[num_chunks + 1] = chunk_offsets[num_chunks] + | |
1423 | hashsz * (ctx->num_commit_graphs_after - 1); | |
1424 | num_chunks++; | |
1425 | } | |
144354b0 DS |
1426 | |
1427 | hashwrite_be32(f, GRAPH_SIGNATURE); | |
1428 | ||
1429 | hashwrite_u8(f, GRAPH_VERSION); | |
1430 | hashwrite_u8(f, oid_version()); | |
1431 | hashwrite_u8(f, num_chunks); | |
6c622f9f | 1432 | hashwrite_u8(f, ctx->num_commit_graphs_after - 1); |
08fd81c9 DS |
1433 | |
1434 | for (i = 0; i <= num_chunks; i++) { | |
1435 | uint32_t chunk_write[3]; | |
1436 | ||
1437 | chunk_write[0] = htonl(chunk_ids[i]); | |
1438 | chunk_write[1] = htonl(chunk_offsets[i] >> 32); | |
1439 | chunk_write[2] = htonl(chunk_offsets[i] & 0xffffffff); | |
1440 | hashwrite(f, chunk_write, 12); | |
1441 | } | |
1442 | ||
238def57 | 1443 | if (ctx->report_progress) { |
28944739 ÆAB |
1444 | strbuf_addf(&progress_title, |
1445 | Q_("Writing out commit graph in %d pass", | |
1446 | "Writing out commit graph in %d passes", | |
1447 | num_chunks), | |
1448 | num_chunks); | |
238def57 | 1449 | ctx->progress = start_delayed_progress( |
28944739 | 1450 | progress_title.buf, |
238def57 | 1451 | num_chunks * ctx->commits.nr); |
28944739 | 1452 | } |
238def57 DS |
1453 | write_graph_chunk_fanout(f, ctx); |
1454 | write_graph_chunk_oids(f, hashsz, ctx); | |
1455 | write_graph_chunk_data(f, hashsz, ctx); | |
1456 | if (ctx->num_extra_edges) | |
1457 | write_graph_chunk_extra_edges(f, ctx); | |
6c622f9f DS |
1458 | if (ctx->num_commit_graphs_after > 1 && |
1459 | write_graph_chunk_base(f, ctx)) { | |
1460 | return -1; | |
1461 | } | |
238def57 | 1462 | stop_progress(&ctx->progress); |
28944739 | 1463 | strbuf_release(&progress_title); |
08fd81c9 | 1464 | |
6c622f9f DS |
1465 | if (ctx->split && ctx->base_graph_name && ctx->num_commit_graphs_after > 1) { |
1466 | char *new_base_hash = xstrdup(oid_to_hex(&ctx->new_base_graph->oid)); | |
ad2dd5bb | 1467 | char *new_base_name = get_split_graph_filename(ctx->new_base_graph->odb, new_base_hash); |
6c622f9f DS |
1468 | |
1469 | free(ctx->commit_graph_filenames_after[ctx->num_commit_graphs_after - 2]); | |
1470 | free(ctx->commit_graph_hash_after[ctx->num_commit_graphs_after - 2]); | |
1471 | ctx->commit_graph_filenames_after[ctx->num_commit_graphs_after - 2] = new_base_name; | |
1472 | ctx->commit_graph_hash_after[ctx->num_commit_graphs_after - 2] = new_base_hash; | |
1473 | } | |
1474 | ||
c3a3a964 | 1475 | close_commit_graph(ctx->r->objects); |
6c622f9f DS |
1476 | finalize_hashfile(f, file_hash.hash, CSUM_HASH_IN_STREAM | CSUM_FSYNC); |
1477 | ||
1478 | if (ctx->split) { | |
1479 | FILE *chainf = fdopen_lock_file(&lk, "w"); | |
1480 | char *final_graph_name; | |
1481 | int result; | |
1482 | ||
1483 | close(fd); | |
1484 | ||
1485 | if (!chainf) { | |
1486 | error(_("unable to open commit-graph chain file")); | |
1487 | return -1; | |
1488 | } | |
1489 | ||
1490 | if (ctx->base_graph_name) { | |
135a7123 DS |
1491 | const char *dest = ctx->commit_graph_filenames_after[ |
1492 | ctx->num_commit_graphs_after - 2]; | |
6c622f9f | 1493 | |
135a7123 DS |
1494 | if (strcmp(ctx->base_graph_name, dest)) { |
1495 | result = rename(ctx->base_graph_name, dest); | |
1496 | ||
1497 | if (result) { | |
1498 | error(_("failed to rename base commit-graph file")); | |
1499 | return -1; | |
1500 | } | |
6c622f9f DS |
1501 | } |
1502 | } else { | |
ad2dd5bb | 1503 | char *graph_name = get_commit_graph_filename(ctx->odb); |
6c622f9f DS |
1504 | unlink(graph_name); |
1505 | } | |
1506 | ||
1507 | ctx->commit_graph_hash_after[ctx->num_commit_graphs_after - 1] = xstrdup(oid_to_hex(&file_hash)); | |
ad2dd5bb | 1508 | final_graph_name = get_split_graph_filename(ctx->odb, |
6c622f9f DS |
1509 | ctx->commit_graph_hash_after[ctx->num_commit_graphs_after - 1]); |
1510 | ctx->commit_graph_filenames_after[ctx->num_commit_graphs_after - 1] = final_graph_name; | |
1511 | ||
1512 | result = rename(ctx->graph_name, final_graph_name); | |
1513 | ||
1514 | for (i = 0; i < ctx->num_commit_graphs_after; i++) | |
1515 | fprintf(lk.tempfile->fp, "%s\n", ctx->commit_graph_hash_after[i]); | |
1516 | ||
1517 | if (result) { | |
1518 | error(_("failed to rename temporary commit-graph file")); | |
1519 | return -1; | |
1520 | } | |
1521 | } | |
1522 | ||
08fd81c9 DS |
1523 | commit_lock_file(&lk); |
1524 | ||
238def57 DS |
1525 | return 0; |
1526 | } | |
1527 | ||
1771be90 DS |
1528 | static void split_graph_merge_strategy(struct write_commit_graph_context *ctx) |
1529 | { | |
8da02ce6 AH |
1530 | struct commit_graph *g; |
1531 | uint32_t num_commits; | |
1771be90 DS |
1532 | uint32_t i; |
1533 | ||
c2bc6e6a DS |
1534 | int max_commits = 0; |
1535 | int size_mult = 2; | |
1536 | ||
1537 | if (ctx->split_opts) { | |
1538 | max_commits = ctx->split_opts->max_commits; | |
63020f17 DS |
1539 | |
1540 | if (ctx->split_opts->size_multiple) | |
1541 | size_mult = ctx->split_opts->size_multiple; | |
c2bc6e6a DS |
1542 | } |
1543 | ||
1771be90 | 1544 | g = ctx->r->objects->commit_graph; |
8da02ce6 | 1545 | num_commits = ctx->commits.nr; |
1771be90 DS |
1546 | ctx->num_commit_graphs_after = ctx->num_commit_graphs_before + 1; |
1547 | ||
c2bc6e6a DS |
1548 | while (g && (g->num_commits <= size_mult * num_commits || |
1549 | (max_commits && num_commits > max_commits))) { | |
ad2dd5bb | 1550 | if (g->odb != ctx->odb) |
c523035c DS |
1551 | break; |
1552 | ||
1771be90 DS |
1553 | num_commits += g->num_commits; |
1554 | g = g->base_graph; | |
1555 | ||
1556 | ctx->num_commit_graphs_after--; | |
1557 | } | |
1558 | ||
1559 | ctx->new_base_graph = g; | |
1560 | ||
c523035c | 1561 | if (ctx->num_commit_graphs_after == 2) { |
ad2dd5bb | 1562 | char *old_graph_name = get_commit_graph_filename(g->odb); |
c523035c DS |
1563 | |
1564 | if (!strcmp(g->filename, old_graph_name) && | |
ad2dd5bb | 1565 | g->odb != ctx->odb) { |
c523035c DS |
1566 | ctx->num_commit_graphs_after = 1; |
1567 | ctx->new_base_graph = NULL; | |
1568 | } | |
1569 | ||
1570 | free(old_graph_name); | |
1571 | } | |
1572 | ||
1771be90 DS |
1573 | ALLOC_ARRAY(ctx->commit_graph_filenames_after, ctx->num_commit_graphs_after); |
1574 | ALLOC_ARRAY(ctx->commit_graph_hash_after, ctx->num_commit_graphs_after); | |
1575 | ||
1576 | for (i = 0; i < ctx->num_commit_graphs_after && | |
1577 | i < ctx->num_commit_graphs_before; i++) | |
1578 | ctx->commit_graph_filenames_after[i] = xstrdup(ctx->commit_graph_filenames_before[i]); | |
1579 | ||
1580 | i = ctx->num_commit_graphs_before - 1; | |
1581 | g = ctx->r->objects->commit_graph; | |
1582 | ||
1583 | while (g) { | |
1584 | if (i < ctx->num_commit_graphs_after) | |
1585 | ctx->commit_graph_hash_after[i] = xstrdup(oid_to_hex(&g->oid)); | |
1586 | ||
1587 | i--; | |
1588 | g = g->base_graph; | |
1589 | } | |
1590 | } | |
1591 | ||
1592 | static void merge_commit_graph(struct write_commit_graph_context *ctx, | |
1593 | struct commit_graph *g) | |
1594 | { | |
1595 | uint32_t i; | |
1596 | uint32_t offset = g->num_commits_in_base; | |
1597 | ||
1598 | ALLOC_GROW(ctx->commits.list, ctx->commits.nr + g->num_commits, ctx->commits.alloc); | |
1599 | ||
1600 | for (i = 0; i < g->num_commits; i++) { | |
1601 | struct object_id oid; | |
1602 | struct commit *result; | |
1603 | ||
1604 | display_progress(ctx->progress, i + 1); | |
1605 | ||
1606 | load_oid_from_graph(g, i + offset, &oid); | |
1607 | ||
1608 | /* only add commits if they still exist in the repo */ | |
1609 | result = lookup_commit_reference_gently(ctx->r, &oid, 1); | |
1610 | ||
1611 | if (result) { | |
1612 | ctx->commits.list[ctx->commits.nr] = result; | |
1613 | ctx->commits.nr++; | |
1614 | } | |
1615 | } | |
1616 | } | |
1617 | ||
1618 | static int commit_compare(const void *_a, const void *_b) | |
1619 | { | |
1620 | const struct commit *a = *(const struct commit **)_a; | |
1621 | const struct commit *b = *(const struct commit **)_b; | |
1622 | return oidcmp(&a->object.oid, &b->object.oid); | |
1623 | } | |
1624 | ||
1625 | static void sort_and_scan_merged_commits(struct write_commit_graph_context *ctx) | |
1626 | { | |
689a146c | 1627 | uint32_t i; |
1771be90 DS |
1628 | |
1629 | if (ctx->report_progress) | |
1630 | ctx->progress = start_delayed_progress( | |
1631 | _("Scanning merged commits"), | |
1632 | ctx->commits.nr); | |
1633 | ||
1634 | QSORT(ctx->commits.list, ctx->commits.nr, commit_compare); | |
1635 | ||
1636 | ctx->num_extra_edges = 0; | |
1637 | for (i = 0; i < ctx->commits.nr; i++) { | |
1638 | display_progress(ctx->progress, i); | |
1639 | ||
1640 | if (i && oideq(&ctx->commits.list[i - 1]->object.oid, | |
1641 | &ctx->commits.list[i]->object.oid)) { | |
1642 | die(_("unexpected duplicate commit id %s"), | |
1643 | oid_to_hex(&ctx->commits.list[i]->object.oid)); | |
1644 | } else { | |
689a146c | 1645 | unsigned int num_parents; |
1771be90 | 1646 | |
689a146c | 1647 | num_parents = commit_list_count(ctx->commits.list[i]->parents); |
1771be90 | 1648 | if (num_parents > 2) |
a35bea40 | 1649 | ctx->num_extra_edges += num_parents - 1; |
1771be90 DS |
1650 | } |
1651 | } | |
1652 | ||
1653 | stop_progress(&ctx->progress); | |
1654 | } | |
1655 | ||
1656 | static void merge_commit_graphs(struct write_commit_graph_context *ctx) | |
1657 | { | |
1658 | struct commit_graph *g = ctx->r->objects->commit_graph; | |
1659 | uint32_t current_graph_number = ctx->num_commit_graphs_before; | |
1660 | struct strbuf progress_title = STRBUF_INIT; | |
1661 | ||
1662 | while (g && current_graph_number >= ctx->num_commit_graphs_after) { | |
1663 | current_graph_number--; | |
1664 | ||
1665 | if (ctx->report_progress) { | |
1666 | strbuf_addstr(&progress_title, _("Merging commit-graph")); | |
1667 | ctx->progress = start_delayed_progress(progress_title.buf, 0); | |
1668 | } | |
1669 | ||
1670 | merge_commit_graph(ctx, g); | |
1671 | stop_progress(&ctx->progress); | |
1672 | strbuf_release(&progress_title); | |
1673 | ||
1674 | g = g->base_graph; | |
1675 | } | |
1676 | ||
1677 | if (g) { | |
1678 | ctx->new_base_graph = g; | |
1679 | ctx->new_num_commits_in_base = g->num_commits + g->num_commits_in_base; | |
1680 | } | |
1681 | ||
1682 | if (ctx->new_base_graph) | |
1683 | ctx->base_graph_name = xstrdup(ctx->new_base_graph->filename); | |
1684 | ||
1685 | sort_and_scan_merged_commits(ctx); | |
1686 | } | |
1687 | ||
8d84097f DS |
1688 | static void mark_commit_graphs(struct write_commit_graph_context *ctx) |
1689 | { | |
1690 | uint32_t i; | |
1691 | time_t now = time(NULL); | |
1692 | ||
1693 | for (i = ctx->num_commit_graphs_after - 1; i < ctx->num_commit_graphs_before; i++) { | |
1694 | struct stat st; | |
1695 | struct utimbuf updated_time; | |
1696 | ||
1697 | stat(ctx->commit_graph_filenames_before[i], &st); | |
1698 | ||
1699 | updated_time.actime = st.st_atime; | |
1700 | updated_time.modtime = now; | |
1701 | utime(ctx->commit_graph_filenames_before[i], &updated_time); | |
1702 | } | |
1703 | } | |
1704 | ||
1705 | static void expire_commit_graphs(struct write_commit_graph_context *ctx) | |
1706 | { | |
1707 | struct strbuf path = STRBUF_INIT; | |
1708 | DIR *dir; | |
1709 | struct dirent *de; | |
1710 | size_t dirnamelen; | |
c2bc6e6a DS |
1711 | timestamp_t expire_time = time(NULL); |
1712 | ||
1713 | if (ctx->split_opts && ctx->split_opts->expire_time) | |
1714 | expire_time -= ctx->split_opts->expire_time; | |
ba41112a | 1715 | if (!ctx->split) { |
ad2dd5bb | 1716 | char *chain_file_name = get_chain_filename(ctx->odb); |
ba41112a DS |
1717 | unlink(chain_file_name); |
1718 | free(chain_file_name); | |
1719 | ctx->num_commit_graphs_after = 0; | |
1720 | } | |
8d84097f | 1721 | |
0bd52e27 | 1722 | strbuf_addstr(&path, ctx->odb->path); |
8d84097f DS |
1723 | strbuf_addstr(&path, "/info/commit-graphs"); |
1724 | dir = opendir(path.buf); | |
1725 | ||
0aa6bce7 RS |
1726 | if (!dir) |
1727 | goto out; | |
8d84097f DS |
1728 | |
1729 | strbuf_addch(&path, '/'); | |
1730 | dirnamelen = path.len; | |
1731 | while ((de = readdir(dir)) != NULL) { | |
1732 | struct stat st; | |
1733 | uint32_t i, found = 0; | |
1734 | ||
1735 | strbuf_setlen(&path, dirnamelen); | |
1736 | strbuf_addstr(&path, de->d_name); | |
1737 | ||
1738 | stat(path.buf, &st); | |
1739 | ||
1740 | if (st.st_mtime > expire_time) | |
1741 | continue; | |
1742 | if (path.len < 6 || strcmp(path.buf + path.len - 6, ".graph")) | |
1743 | continue; | |
1744 | ||
1745 | for (i = 0; i < ctx->num_commit_graphs_after; i++) { | |
1746 | if (!strcmp(ctx->commit_graph_filenames_after[i], | |
1747 | path.buf)) { | |
1748 | found = 1; | |
1749 | break; | |
1750 | } | |
1751 | } | |
1752 | ||
1753 | if (!found) | |
1754 | unlink(path.buf); | |
8d84097f | 1755 | } |
0aa6bce7 RS |
1756 | |
1757 | out: | |
1758 | strbuf_release(&path); | |
8d84097f DS |
1759 | } |
1760 | ||
0bd52e27 | 1761 | int write_commit_graph(struct object_directory *odb, |
238def57 DS |
1762 | struct string_list *pack_indexes, |
1763 | struct string_list *commit_hex, | |
39d88318 | 1764 | enum commit_graph_write_flags flags, |
c2bc6e6a | 1765 | const struct split_commit_graph_opts *split_opts) |
238def57 DS |
1766 | { |
1767 | struct write_commit_graph_context *ctx; | |
1768 | uint32_t i, count_distinct = 0; | |
e103f727 | 1769 | int res = 0; |
08fd81c9 | 1770 | |
d6538246 | 1771 | if (!commit_graph_compatible(the_repository)) |
e103f727 | 1772 | return 0; |
d6538246 | 1773 | |
c9905bea DS |
1774 | ctx = xcalloc(1, sizeof(struct write_commit_graph_context)); |
1775 | ctx->r = the_repository; | |
0bd52e27 | 1776 | ctx->odb = odb; |
39d88318 SG |
1777 | ctx->append = flags & COMMIT_GRAPH_WRITE_APPEND ? 1 : 0; |
1778 | ctx->report_progress = flags & COMMIT_GRAPH_WRITE_PROGRESS ? 1 : 0; | |
1779 | ctx->split = flags & COMMIT_GRAPH_WRITE_SPLIT ? 1 : 0; | |
7c5c9b9c | 1780 | ctx->check_oids = flags & COMMIT_GRAPH_WRITE_CHECK_OIDS ? 1 : 0; |
c2bc6e6a | 1781 | ctx->split_opts = split_opts; |
6c622f9f DS |
1782 | |
1783 | if (ctx->split) { | |
1784 | struct commit_graph *g; | |
1785 | prepare_commit_graph(ctx->r); | |
1786 | ||
1787 | g = ctx->r->objects->commit_graph; | |
1788 | ||
1789 | while (g) { | |
1790 | ctx->num_commit_graphs_before++; | |
1791 | g = g->base_graph; | |
1792 | } | |
1793 | ||
1794 | if (ctx->num_commit_graphs_before) { | |
1795 | ALLOC_ARRAY(ctx->commit_graph_filenames_before, ctx->num_commit_graphs_before); | |
1796 | i = ctx->num_commit_graphs_before; | |
1797 | g = ctx->r->objects->commit_graph; | |
1798 | ||
1799 | while (g) { | |
1800 | ctx->commit_graph_filenames_before[--i] = xstrdup(g->filename); | |
1801 | g = g->base_graph; | |
1802 | } | |
1803 | } | |
1804 | } | |
c9905bea DS |
1805 | |
1806 | ctx->approx_nr_objects = approximate_object_count(); | |
1807 | ctx->oids.alloc = ctx->approx_nr_objects / 32; | |
1808 | ||
c2bc6e6a DS |
1809 | if (ctx->split && split_opts && ctx->oids.alloc > split_opts->max_commits) |
1810 | ctx->oids.alloc = split_opts->max_commits; | |
1771be90 | 1811 | |
c9905bea | 1812 | if (ctx->append) { |
13c24992 | 1813 | prepare_commit_graph_one(ctx->r, ctx->odb); |
c9905bea DS |
1814 | if (ctx->r->objects->commit_graph) |
1815 | ctx->oids.alloc += ctx->r->objects->commit_graph->num_commits; | |
7547b95b DS |
1816 | } |
1817 | ||
c9905bea DS |
1818 | if (ctx->oids.alloc < 1024) |
1819 | ctx->oids.alloc = 1024; | |
1820 | ALLOC_ARRAY(ctx->oids.list, ctx->oids.alloc); | |
1821 | ||
1822 | if (ctx->append && ctx->r->objects->commit_graph) { | |
1823 | struct commit_graph *g = ctx->r->objects->commit_graph; | |
1824 | for (i = 0; i < g->num_commits; i++) { | |
1825 | const unsigned char *hash = g->chunk_oid_lookup + g->hash_len * i; | |
1826 | hashcpy(ctx->oids.list[ctx->oids.nr++].hash, hash); | |
7547b95b DS |
1827 | } |
1828 | } | |
1829 | ||
049d51a2 | 1830 | if (pack_indexes) { |
ef5b83f2 DS |
1831 | if ((res = fill_oids_from_packs(ctx, pack_indexes))) |
1832 | goto cleanup; | |
3d5df01b DS |
1833 | } |
1834 | ||
7c5c9b9c SG |
1835 | if (commit_hex) { |
1836 | if ((res = fill_oids_from_commit_hex(ctx, commit_hex))) | |
1837 | goto cleanup; | |
1838 | } | |
3d5df01b | 1839 | |
b2c83060 DS |
1840 | if (!pack_indexes && !commit_hex) |
1841 | fill_oids_from_all_packs(ctx); | |
049d51a2 | 1842 | |
c9905bea | 1843 | close_reachable(ctx); |
08fd81c9 | 1844 | |
014e3440 | 1845 | count_distinct = count_distinct_commits(ctx); |
08fd81c9 | 1846 | |
e103f727 DS |
1847 | if (count_distinct >= GRAPH_EDGE_LAST_MASK) { |
1848 | error(_("the commit graph format cannot write %d commits"), count_distinct); | |
1849 | res = -1; | |
1850 | goto cleanup; | |
1851 | } | |
08fd81c9 | 1852 | |
c9905bea DS |
1853 | ctx->commits.alloc = count_distinct; |
1854 | ALLOC_ARRAY(ctx->commits.list, ctx->commits.alloc); | |
08fd81c9 | 1855 | |
f998d542 | 1856 | copy_oids_to_commits(ctx); |
08fd81c9 | 1857 | |
c9905bea | 1858 | if (ctx->commits.nr >= GRAPH_EDGE_LAST_MASK) { |
e103f727 DS |
1859 | error(_("too many commits to write graph")); |
1860 | res = -1; | |
1861 | goto cleanup; | |
1862 | } | |
08fd81c9 | 1863 | |
6c622f9f DS |
1864 | if (!ctx->commits.nr) |
1865 | goto cleanup; | |
1866 | ||
1771be90 DS |
1867 | if (ctx->split) { |
1868 | split_graph_merge_strategy(ctx); | |
1869 | ||
1870 | merge_commit_graphs(ctx); | |
1871 | } else | |
6c622f9f DS |
1872 | ctx->num_commit_graphs_after = 1; |
1873 | ||
c9905bea | 1874 | compute_generation_numbers(ctx); |
08fd81c9 | 1875 | |
238def57 | 1876 | res = write_commit_graph_file(ctx); |
08fd81c9 | 1877 | |
ba41112a | 1878 | if (ctx->split) |
8d84097f | 1879 | mark_commit_graphs(ctx); |
ba41112a DS |
1880 | |
1881 | expire_commit_graphs(ctx); | |
8d84097f | 1882 | |
e103f727 | 1883 | cleanup: |
238def57 | 1884 | free(ctx->graph_name); |
c9905bea DS |
1885 | free(ctx->commits.list); |
1886 | free(ctx->oids.list); | |
6c622f9f DS |
1887 | |
1888 | if (ctx->commit_graph_filenames_after) { | |
1889 | for (i = 0; i < ctx->num_commit_graphs_after; i++) { | |
1890 | free(ctx->commit_graph_filenames_after[i]); | |
1891 | free(ctx->commit_graph_hash_after[i]); | |
1892 | } | |
1893 | ||
1894 | for (i = 0; i < ctx->num_commit_graphs_before; i++) | |
1895 | free(ctx->commit_graph_filenames_before[i]); | |
1896 | ||
1897 | free(ctx->commit_graph_filenames_after); | |
1898 | free(ctx->commit_graph_filenames_before); | |
1899 | free(ctx->commit_graph_hash_after); | |
1900 | } | |
1901 | ||
c9905bea | 1902 | free(ctx); |
e103f727 DS |
1903 | |
1904 | return res; | |
08fd81c9 | 1905 | } |
283e68c7 | 1906 | |
41df0e30 | 1907 | #define VERIFY_COMMIT_GRAPH_ERROR_HASH 2 |
283e68c7 DS |
1908 | static int verify_commit_graph_error; |
1909 | ||
1910 | static void graph_report(const char *fmt, ...) | |
1911 | { | |
1912 | va_list ap; | |
1913 | ||
1914 | verify_commit_graph_error = 1; | |
1915 | va_start(ap, fmt); | |
1916 | vfprintf(stderr, fmt, ap); | |
1917 | fprintf(stderr, "\n"); | |
1918 | va_end(ap); | |
1919 | } | |
1920 | ||
1373e547 DS |
1921 | #define GENERATION_ZERO_EXISTS 1 |
1922 | #define GENERATION_NUMBER_EXISTS 2 | |
1923 | ||
3da4b609 | 1924 | int verify_commit_graph(struct repository *r, struct commit_graph *g, int flags) |
283e68c7 | 1925 | { |
9bda8467 | 1926 | uint32_t i, cur_fanout_pos = 0; |
41df0e30 | 1927 | struct object_id prev_oid, cur_oid, checksum; |
1373e547 | 1928 | int generation_zero = 0; |
41df0e30 DS |
1929 | struct hashfile *f; |
1930 | int devnull; | |
1f7f557f | 1931 | struct progress *progress = NULL; |
3da4b609 | 1932 | int local_error = 0; |
9bda8467 | 1933 | |
283e68c7 DS |
1934 | if (!g) { |
1935 | graph_report("no commit-graph file loaded"); | |
1936 | return 1; | |
1937 | } | |
1938 | ||
2ac138d5 | 1939 | verify_commit_graph_error = verify_commit_graph_lite(g); |
9bda8467 DS |
1940 | if (verify_commit_graph_error) |
1941 | return verify_commit_graph_error; | |
1942 | ||
41df0e30 DS |
1943 | devnull = open("/dev/null", O_WRONLY); |
1944 | f = hashfd(devnull, NULL); | |
1945 | hashwrite(f, g->data, g->data_len - g->hash_len); | |
1946 | finalize_hashfile(f, checksum.hash, CSUM_CLOSE); | |
67947c34 | 1947 | if (!hasheq(checksum.hash, g->data + g->data_len - g->hash_len)) { |
41df0e30 DS |
1948 | graph_report(_("the commit-graph file has incorrect checksum and is likely corrupt")); |
1949 | verify_commit_graph_error = VERIFY_COMMIT_GRAPH_ERROR_HASH; | |
1950 | } | |
1951 | ||
9bda8467 | 1952 | for (i = 0; i < g->num_commits; i++) { |
2e3c0737 DS |
1953 | struct commit *graph_commit; |
1954 | ||
9bda8467 DS |
1955 | hashcpy(cur_oid.hash, g->chunk_oid_lookup + g->hash_len * i); |
1956 | ||
1957 | if (i && oidcmp(&prev_oid, &cur_oid) >= 0) | |
93b4405f | 1958 | graph_report(_("commit-graph has incorrect OID order: %s then %s"), |
9bda8467 DS |
1959 | oid_to_hex(&prev_oid), |
1960 | oid_to_hex(&cur_oid)); | |
1961 | ||
1962 | oidcpy(&prev_oid, &cur_oid); | |
1963 | ||
1964 | while (cur_oid.hash[0] > cur_fanout_pos) { | |
1965 | uint32_t fanout_value = get_be32(g->chunk_oid_fanout + cur_fanout_pos); | |
1966 | ||
1967 | if (i != fanout_value) | |
93b4405f | 1968 | graph_report(_("commit-graph has incorrect fanout value: fanout[%d] = %u != %u"), |
9bda8467 DS |
1969 | cur_fanout_pos, fanout_value, i); |
1970 | cur_fanout_pos++; | |
1971 | } | |
2e3c0737 | 1972 | |
82952964 | 1973 | graph_commit = lookup_commit(r, &cur_oid); |
4f542b7a | 1974 | if (!parse_commit_in_graph_one(r, g, graph_commit)) |
93b4405f | 1975 | graph_report(_("failed to parse commit %s from commit-graph"), |
2e3c0737 | 1976 | oid_to_hex(&cur_oid)); |
9bda8467 DS |
1977 | } |
1978 | ||
1979 | while (cur_fanout_pos < 256) { | |
1980 | uint32_t fanout_value = get_be32(g->chunk_oid_fanout + cur_fanout_pos); | |
1981 | ||
1982 | if (g->num_commits != fanout_value) | |
93b4405f | 1983 | graph_report(_("commit-graph has incorrect fanout value: fanout[%d] = %u != %u"), |
9bda8467 DS |
1984 | cur_fanout_pos, fanout_value, i); |
1985 | ||
1986 | cur_fanout_pos++; | |
1987 | } | |
1988 | ||
41df0e30 | 1989 | if (verify_commit_graph_error & ~VERIFY_COMMIT_GRAPH_ERROR_HASH) |
96af91d4 DS |
1990 | return verify_commit_graph_error; |
1991 | ||
73716122 GS |
1992 | if (flags & COMMIT_GRAPH_WRITE_PROGRESS) |
1993 | progress = start_progress(_("Verifying commits in commit graph"), | |
1994 | g->num_commits); | |
1995 | ||
96af91d4 | 1996 | for (i = 0; i < g->num_commits; i++) { |
2e3c0737 | 1997 | struct commit *graph_commit, *odb_commit; |
53614b13 | 1998 | struct commit_list *graph_parents, *odb_parents; |
1373e547 | 1999 | uint32_t max_generation = 0; |
96af91d4 | 2000 | |
1f7f557f | 2001 | display_progress(progress, i + 1); |
96af91d4 DS |
2002 | hashcpy(cur_oid.hash, g->chunk_oid_lookup + g->hash_len * i); |
2003 | ||
82952964 | 2004 | graph_commit = lookup_commit(r, &cur_oid); |
a378509e | 2005 | odb_commit = (struct commit *)create_object(r, &cur_oid, alloc_commit_node(r)); |
96af91d4 | 2006 | if (parse_commit_internal(odb_commit, 0, 0)) { |
93b4405f | 2007 | graph_report(_("failed to parse commit %s from object database for commit-graph"), |
96af91d4 DS |
2008 | oid_to_hex(&cur_oid)); |
2009 | continue; | |
2010 | } | |
2e3c0737 | 2011 | |
4f542b7a | 2012 | if (!oideq(&get_commit_tree_in_graph_one(r, g, graph_commit)->object.oid, |
2e3c0737 | 2013 | get_commit_tree_oid(odb_commit))) |
93b4405f | 2014 | graph_report(_("root tree OID for commit %s in commit-graph is %s != %s"), |
2e3c0737 DS |
2015 | oid_to_hex(&cur_oid), |
2016 | oid_to_hex(get_commit_tree_oid(graph_commit)), | |
2017 | oid_to_hex(get_commit_tree_oid(odb_commit))); | |
53614b13 DS |
2018 | |
2019 | graph_parents = graph_commit->parents; | |
2020 | odb_parents = odb_commit->parents; | |
2021 | ||
2022 | while (graph_parents) { | |
2023 | if (odb_parents == NULL) { | |
93b4405f | 2024 | graph_report(_("commit-graph parent list for commit %s is too long"), |
53614b13 DS |
2025 | oid_to_hex(&cur_oid)); |
2026 | break; | |
2027 | } | |
2028 | ||
3da4b609 DS |
2029 | /* parse parent in case it is in a base graph */ |
2030 | parse_commit_in_graph_one(r, g, graph_parents->item); | |
2031 | ||
9001dc2a | 2032 | if (!oideq(&graph_parents->item->object.oid, &odb_parents->item->object.oid)) |
93b4405f | 2033 | graph_report(_("commit-graph parent for %s is %s != %s"), |
53614b13 DS |
2034 | oid_to_hex(&cur_oid), |
2035 | oid_to_hex(&graph_parents->item->object.oid), | |
2036 | oid_to_hex(&odb_parents->item->object.oid)); | |
2037 | ||
1373e547 DS |
2038 | if (graph_parents->item->generation > max_generation) |
2039 | max_generation = graph_parents->item->generation; | |
2040 | ||
53614b13 DS |
2041 | graph_parents = graph_parents->next; |
2042 | odb_parents = odb_parents->next; | |
2043 | } | |
2044 | ||
2045 | if (odb_parents != NULL) | |
93b4405f | 2046 | graph_report(_("commit-graph parent list for commit %s terminates early"), |
53614b13 | 2047 | oid_to_hex(&cur_oid)); |
1373e547 DS |
2048 | |
2049 | if (!graph_commit->generation) { | |
2050 | if (generation_zero == GENERATION_NUMBER_EXISTS) | |
93b4405f | 2051 | graph_report(_("commit-graph has generation number zero for commit %s, but non-zero elsewhere"), |
1373e547 DS |
2052 | oid_to_hex(&cur_oid)); |
2053 | generation_zero = GENERATION_ZERO_EXISTS; | |
2054 | } else if (generation_zero == GENERATION_ZERO_EXISTS) | |
93b4405f | 2055 | graph_report(_("commit-graph has non-zero generation number for commit %s, but zero elsewhere"), |
1373e547 DS |
2056 | oid_to_hex(&cur_oid)); |
2057 | ||
2058 | if (generation_zero == GENERATION_ZERO_EXISTS) | |
2059 | continue; | |
2060 | ||
2061 | /* | |
2062 | * If one of our parents has generation GENERATION_NUMBER_MAX, then | |
2063 | * our generation is also GENERATION_NUMBER_MAX. Decrement to avoid | |
2064 | * extra logic in the following condition. | |
2065 | */ | |
2066 | if (max_generation == GENERATION_NUMBER_MAX) | |
2067 | max_generation--; | |
2068 | ||
2069 | if (graph_commit->generation != max_generation + 1) | |
93b4405f | 2070 | graph_report(_("commit-graph generation for commit %s is %u != %u"), |
1373e547 DS |
2071 | oid_to_hex(&cur_oid), |
2072 | graph_commit->generation, | |
2073 | max_generation + 1); | |
88968ebf DS |
2074 | |
2075 | if (graph_commit->date != odb_commit->date) | |
93b4405f | 2076 | graph_report(_("commit date for commit %s in commit-graph is %"PRItime" != %"PRItime), |
88968ebf DS |
2077 | oid_to_hex(&cur_oid), |
2078 | graph_commit->date, | |
2079 | odb_commit->date); | |
96af91d4 | 2080 | } |
1f7f557f | 2081 | stop_progress(&progress); |
96af91d4 | 2082 | |
3da4b609 DS |
2083 | local_error = verify_commit_graph_error; |
2084 | ||
2085 | if (!(flags & COMMIT_GRAPH_VERIFY_SHALLOW) && g->base_graph) | |
2086 | local_error |= verify_commit_graph(r, g->base_graph, flags); | |
2087 | ||
2088 | return local_error; | |
283e68c7 | 2089 | } |
c3756d5b JT |
2090 | |
2091 | void free_commit_graph(struct commit_graph *g) | |
2092 | { | |
2093 | if (!g) | |
2094 | return; | |
2095 | if (g->graph_fd >= 0) { | |
2096 | munmap((void *)g->data, g->data_len); | |
2097 | g->data = NULL; | |
2098 | close(g->graph_fd); | |
2099 | } | |
6c622f9f | 2100 | free(g->filename); |
c3756d5b JT |
2101 | free(g); |
2102 | } | |
6abada18 JK |
2103 | |
2104 | void disable_commit_graph(struct repository *r) | |
2105 | { | |
2106 | r->commit_graph_disabled = 1; | |
2107 | } |