1 #include "git-compat-util.h"
10 #include "sha1-lookup.h"
11 #include "commit-graph.h"
12 #include "object-store.h"
15 #include "replace-object.h"
18 #include "commit-slab.h"
20 #include "json-writer.h"
22 #include "chunk-format.h"
24 void git_test_write_commit_graph_or_die(void)
27 if (!git_env_bool(GIT_TEST_COMMIT_GRAPH, 0))
30 if (git_env_bool(GIT_TEST_COMMIT_GRAPH_CHANGED_PATHS, 0))
31 flags = COMMIT_GRAPH_WRITE_BLOOM_FILTERS;
33 if (write_commit_graph_reachable(the_repository->objects->odb,
35 die("failed to write commit-graph under GIT_TEST_COMMIT_GRAPH");
38 #define GRAPH_SIGNATURE 0x43475048 /* "CGPH" */
39 #define GRAPH_CHUNKID_OIDFANOUT 0x4f494446 /* "OIDF" */
40 #define GRAPH_CHUNKID_OIDLOOKUP 0x4f49444c /* "OIDL" */
41 #define GRAPH_CHUNKID_DATA 0x43444154 /* "CDAT" */
42 #define GRAPH_CHUNKID_GENERATION_DATA 0x47444154 /* "GDAT" */
43 #define GRAPH_CHUNKID_GENERATION_DATA_OVERFLOW 0x47444f56 /* "GDOV" */
44 #define GRAPH_CHUNKID_EXTRAEDGES 0x45444745 /* "EDGE" */
45 #define GRAPH_CHUNKID_BLOOMINDEXES 0x42494458 /* "BIDX" */
46 #define GRAPH_CHUNKID_BLOOMDATA 0x42444154 /* "BDAT" */
47 #define GRAPH_CHUNKID_BASE 0x42415345 /* "BASE" */
49 #define GRAPH_DATA_WIDTH (the_hash_algo->rawsz + 16)
51 #define GRAPH_VERSION_1 0x1
52 #define GRAPH_VERSION GRAPH_VERSION_1
54 #define GRAPH_EXTRA_EDGES_NEEDED 0x80000000
55 #define GRAPH_EDGE_LAST_MASK 0x7fffffff
56 #define GRAPH_PARENT_NONE 0x70000000
58 #define GRAPH_LAST_EDGE 0x80000000
60 #define GRAPH_HEADER_SIZE 8
61 #define GRAPH_FANOUT_SIZE (4 * 256)
62 #define GRAPH_CHUNKLOOKUP_WIDTH 12
63 #define GRAPH_MIN_SIZE (GRAPH_HEADER_SIZE + 4 * GRAPH_CHUNKLOOKUP_WIDTH \
64 + GRAPH_FANOUT_SIZE + the_hash_algo->rawsz)
66 #define CORRECTED_COMMIT_DATE_OFFSET_OVERFLOW (1ULL << 31)
68 /* Remember to update object flag allocation in object.h */
69 #define REACHABLE (1u<<15)
71 define_commit_slab(topo_level_slab, uint32_t);
73 /* Keep track of the order in which commits are added to our list. */
74 define_commit_slab(commit_pos, int);
75 static struct commit_pos commit_pos = COMMIT_SLAB_INIT(1, commit_pos);
77 static void set_commit_pos(struct repository *r, const struct object_id *oid)
79 static int32_t max_pos;
80 struct commit *commit = lookup_commit(r, oid);
83 return; /* should never happen, but be lenient */
85 *commit_pos_at(&commit_pos, commit) = max_pos++;
88 static int commit_pos_cmp(const void *va, const void *vb)
90 const struct commit *a = *(const struct commit **)va;
91 const struct commit *b = *(const struct commit **)vb;
92 return commit_pos_at(&commit_pos, a) -
93 commit_pos_at(&commit_pos, b);
96 define_commit_slab(commit_graph_data_slab, struct commit_graph_data);
97 static struct commit_graph_data_slab commit_graph_data_slab =
98 COMMIT_SLAB_INIT(1, commit_graph_data_slab);
100 uint32_t commit_graph_position(const struct commit *c)
102 struct commit_graph_data *data =
103 commit_graph_data_slab_peek(&commit_graph_data_slab, c);
105 return data ? data->graph_pos : COMMIT_NOT_FROM_GRAPH;
108 timestamp_t commit_graph_generation(const struct commit *c)
110 struct commit_graph_data *data =
111 commit_graph_data_slab_peek(&commit_graph_data_slab, c);
114 return GENERATION_NUMBER_INFINITY;
115 else if (data->graph_pos == COMMIT_NOT_FROM_GRAPH)
116 return GENERATION_NUMBER_INFINITY;
118 return data->generation;
121 static struct commit_graph_data *commit_graph_data_at(const struct commit *c)
123 unsigned int i, nth_slab;
124 struct commit_graph_data *data =
125 commit_graph_data_slab_peek(&commit_graph_data_slab, c);
130 nth_slab = c->index / commit_graph_data_slab.slab_size;
131 data = commit_graph_data_slab_at(&commit_graph_data_slab, c);
134 * commit-slab initializes elements with zero, overwrite this with
135 * COMMIT_NOT_FROM_GRAPH for graph_pos.
137 * We avoid initializing generation with checking if graph position
138 * is not COMMIT_NOT_FROM_GRAPH.
140 for (i = 0; i < commit_graph_data_slab.slab_size; i++) {
141 commit_graph_data_slab.slab[nth_slab][i].graph_pos =
142 COMMIT_NOT_FROM_GRAPH;
149 * Should be used only while writing commit-graph as it compares
150 * generation value of commits by directly accessing commit-slab.
152 static int commit_gen_cmp(const void *va, const void *vb)
154 const struct commit *a = *(const struct commit **)va;
155 const struct commit *b = *(const struct commit **)vb;
157 const timestamp_t generation_a = commit_graph_data_at(a)->generation;
158 const timestamp_t generation_b = commit_graph_data_at(b)->generation;
159 /* lower generation commits first */
160 if (generation_a < generation_b)
162 else if (generation_a > generation_b)
165 /* use date as a heuristic when generations are equal */
166 if (a->date < b->date)
168 else if (a->date > b->date)
173 char *get_commit_graph_filename(struct object_directory *obj_dir)
175 return xstrfmt("%s/info/commit-graph", obj_dir->path);
178 static char *get_split_graph_filename(struct object_directory *odb,
181 return xstrfmt("%s/info/commit-graphs/graph-%s.graph", odb->path,
185 char *get_commit_graph_chain_filename(struct object_directory *odb)
187 return xstrfmt("%s/info/commit-graphs/commit-graph-chain", odb->path);
190 static uint8_t oid_version(void)
192 switch (hash_algo_by_ptr(the_hash_algo)) {
195 case GIT_HASH_SHA256:
198 die(_("invalid hash version"));
202 static struct commit_graph *alloc_commit_graph(void)
204 struct commit_graph *g = xcalloc(1, sizeof(*g));
209 extern int read_replace_refs;
211 static int commit_graph_compatible(struct repository *r)
216 if (read_replace_refs) {
217 prepare_replace_object(r);
218 if (hashmap_get_size(&r->objects->replace_map->map))
222 prepare_commit_graft(r);
223 if (r->parsed_objects &&
224 (r->parsed_objects->grafts_nr || r->parsed_objects->substituted_parent))
226 if (is_repository_shallow(r))
232 int open_commit_graph(const char *graph_file, int *fd, struct stat *st)
234 *fd = git_open(graph_file);
237 if (fstat(*fd, st)) {
244 struct commit_graph *load_commit_graph_one_fd_st(struct repository *r,
245 int fd, struct stat *st,
246 struct object_directory *odb)
250 struct commit_graph *ret;
252 graph_size = xsize_t(st->st_size);
254 if (graph_size < GRAPH_MIN_SIZE) {
256 error(_("commit-graph file is too small"));
259 graph_map = xmmap(NULL, graph_size, PROT_READ, MAP_PRIVATE, fd, 0);
261 ret = parse_commit_graph(r, graph_map, graph_size);
266 munmap(graph_map, graph_size);
271 static int verify_commit_graph_lite(struct commit_graph *g)
274 * Basic validation shared between parse_commit_graph()
275 * which'll be called every time the graph is used, and the
276 * much more expensive verify_commit_graph() used by
277 * "commit-graph verify".
279 * There should only be very basic checks here to ensure that
280 * we don't e.g. segfault in fill_commit_in_graph(), but
281 * because this is a very hot codepath nothing that e.g. loops
282 * over g->num_commits, or runs a checksum on the commit-graph
285 if (!g->chunk_oid_fanout) {
286 error("commit-graph is missing the OID Fanout chunk");
289 if (!g->chunk_oid_lookup) {
290 error("commit-graph is missing the OID Lookup chunk");
293 if (!g->chunk_commit_data) {
294 error("commit-graph is missing the Commit Data chunk");
301 struct commit_graph *parse_commit_graph(struct repository *r,
302 void *graph_map, size_t graph_size)
304 const unsigned char *data, *chunk_lookup;
306 struct commit_graph *graph;
307 uint64_t next_chunk_offset;
308 uint32_t graph_signature;
309 unsigned char graph_version, hash_version;
314 if (graph_size < GRAPH_MIN_SIZE)
317 data = (const unsigned char *)graph_map;
319 graph_signature = get_be32(data);
320 if (graph_signature != GRAPH_SIGNATURE) {
321 error(_("commit-graph signature %X does not match signature %X"),
322 graph_signature, GRAPH_SIGNATURE);
326 graph_version = *(unsigned char*)(data + 4);
327 if (graph_version != GRAPH_VERSION) {
328 error(_("commit-graph version %X does not match version %X"),
329 graph_version, GRAPH_VERSION);
333 hash_version = *(unsigned char*)(data + 5);
334 if (hash_version != oid_version()) {
335 error(_("commit-graph hash version %X does not match version %X"),
336 hash_version, oid_version());
340 prepare_repo_settings(r);
342 graph = alloc_commit_graph();
344 graph->hash_len = the_hash_algo->rawsz;
345 graph->num_chunks = *(unsigned char*)(data + 6);
346 graph->data = graph_map;
347 graph->data_len = graph_size;
349 if (graph_size < GRAPH_HEADER_SIZE +
350 (graph->num_chunks + 1) * GRAPH_CHUNKLOOKUP_WIDTH +
351 GRAPH_FANOUT_SIZE + the_hash_algo->rawsz) {
352 error(_("commit-graph file is too small to hold %u chunks"),
358 chunk_lookup = data + 8;
359 next_chunk_offset = get_be64(chunk_lookup + 4);
360 for (i = 0; i < graph->num_chunks; i++) {
362 uint64_t chunk_offset = next_chunk_offset;
363 int chunk_repeated = 0;
365 chunk_id = get_be32(chunk_lookup + 0);
367 chunk_lookup += GRAPH_CHUNKLOOKUP_WIDTH;
368 next_chunk_offset = get_be64(chunk_lookup + 4);
370 if (chunk_offset > graph_size - the_hash_algo->rawsz) {
371 error(_("commit-graph improper chunk offset %08x%08x"), (uint32_t)(chunk_offset >> 32),
372 (uint32_t)chunk_offset);
373 goto free_and_return;
377 case GRAPH_CHUNKID_OIDFANOUT:
378 if (graph->chunk_oid_fanout)
381 graph->chunk_oid_fanout = (uint32_t*)(data + chunk_offset);
384 case GRAPH_CHUNKID_OIDLOOKUP:
385 if (graph->chunk_oid_lookup)
388 graph->chunk_oid_lookup = data + chunk_offset;
389 graph->num_commits = (next_chunk_offset - chunk_offset)
394 case GRAPH_CHUNKID_DATA:
395 if (graph->chunk_commit_data)
398 graph->chunk_commit_data = data + chunk_offset;
401 case GRAPH_CHUNKID_GENERATION_DATA:
402 if (graph->chunk_generation_data)
405 graph->chunk_generation_data = data + chunk_offset;
408 case GRAPH_CHUNKID_GENERATION_DATA_OVERFLOW:
409 if (graph->chunk_generation_data_overflow)
412 graph->chunk_generation_data_overflow = data + chunk_offset;
415 case GRAPH_CHUNKID_EXTRAEDGES:
416 if (graph->chunk_extra_edges)
419 graph->chunk_extra_edges = data + chunk_offset;
422 case GRAPH_CHUNKID_BASE:
423 if (graph->chunk_base_graphs)
426 graph->chunk_base_graphs = data + chunk_offset;
429 case GRAPH_CHUNKID_BLOOMINDEXES:
430 if (graph->chunk_bloom_indexes)
432 else if (r->settings.commit_graph_read_changed_paths)
433 graph->chunk_bloom_indexes = data + chunk_offset;
436 case GRAPH_CHUNKID_BLOOMDATA:
437 if (graph->chunk_bloom_data)
439 else if (r->settings.commit_graph_read_changed_paths) {
440 uint32_t hash_version;
441 graph->chunk_bloom_data = data + chunk_offset;
442 hash_version = get_be32(data + chunk_offset);
444 if (hash_version != 1)
447 graph->bloom_filter_settings = xmalloc(sizeof(struct bloom_filter_settings));
448 graph->bloom_filter_settings->hash_version = hash_version;
449 graph->bloom_filter_settings->num_hashes = get_be32(data + chunk_offset + 4);
450 graph->bloom_filter_settings->bits_per_entry = get_be32(data + chunk_offset + 8);
451 graph->bloom_filter_settings->max_changed_paths = DEFAULT_BLOOM_MAX_CHANGES;
456 if (chunk_repeated) {
457 error(_("commit-graph chunk id %08x appears multiple times"), chunk_id);
458 goto free_and_return;
462 if (graph->chunk_bloom_indexes && graph->chunk_bloom_data) {
463 init_bloom_filters();
465 /* We need both the bloom chunks to exist together. Else ignore the data */
466 graph->chunk_bloom_indexes = NULL;
467 graph->chunk_bloom_data = NULL;
468 FREE_AND_NULL(graph->bloom_filter_settings);
471 hashcpy(graph->oid.hash, graph->data + graph->data_len - graph->hash_len);
473 if (verify_commit_graph_lite(graph))
474 goto free_and_return;
479 free(graph->bloom_filter_settings);
484 static struct commit_graph *load_commit_graph_one(struct repository *r,
485 const char *graph_file,
486 struct object_directory *odb)
491 struct commit_graph *g;
492 int open_ok = open_commit_graph(graph_file, &fd, &st);
497 g = load_commit_graph_one_fd_st(r, fd, &st, odb);
500 g->filename = xstrdup(graph_file);
505 static struct commit_graph *load_commit_graph_v1(struct repository *r,
506 struct object_directory *odb)
508 char *graph_name = get_commit_graph_filename(odb);
509 struct commit_graph *g = load_commit_graph_one(r, graph_name, odb);
515 static int add_graph_to_chain(struct commit_graph *g,
516 struct commit_graph *chain,
517 struct object_id *oids,
520 struct commit_graph *cur_g = chain;
522 if (n && !g->chunk_base_graphs) {
523 warning(_("commit-graph has no base graphs chunk"));
531 !oideq(&oids[n], &cur_g->oid) ||
532 !hasheq(oids[n].hash, g->chunk_base_graphs + g->hash_len * n)) {
533 warning(_("commit-graph chain does not match"));
537 cur_g = cur_g->base_graph;
540 g->base_graph = chain;
543 g->num_commits_in_base = chain->num_commits + chain->num_commits_in_base;
548 static struct commit_graph *load_commit_graph_chain(struct repository *r,
549 struct object_directory *odb)
551 struct commit_graph *graph_chain = NULL;
552 struct strbuf line = STRBUF_INIT;
554 struct object_id *oids;
555 int i = 0, valid = 1, count;
556 char *chain_name = get_commit_graph_chain_filename(odb);
560 fp = fopen(chain_name, "r");
561 stat_res = stat(chain_name, &st);
566 st.st_size <= the_hash_algo->hexsz)
569 count = st.st_size / (the_hash_algo->hexsz + 1);
570 oids = xcalloc(count, sizeof(struct object_id));
574 for (i = 0; i < count; i++) {
575 struct object_directory *odb;
577 if (strbuf_getline_lf(&line, fp) == EOF)
580 if (get_oid_hex(line.buf, &oids[i])) {
581 warning(_("invalid commit-graph chain: line '%s' not a hash"),
588 for (odb = r->objects->odb; odb; odb = odb->next) {
589 char *graph_name = get_split_graph_filename(odb, line.buf);
590 struct commit_graph *g = load_commit_graph_one(r, graph_name, odb);
595 if (add_graph_to_chain(g, graph_chain, oids, i)) {
605 warning(_("unable to find all commit-graph files"));
612 strbuf_release(&line);
617 static void validate_mixed_generation_chain(struct commit_graph *g)
619 int read_generation_data;
624 read_generation_data = !!g->chunk_generation_data;
627 g->read_generation_data = read_generation_data;
632 struct commit_graph *read_commit_graph_one(struct repository *r,
633 struct object_directory *odb)
635 struct commit_graph *g = load_commit_graph_v1(r, odb);
638 g = load_commit_graph_chain(r, odb);
640 validate_mixed_generation_chain(g);
645 static void prepare_commit_graph_one(struct repository *r,
646 struct object_directory *odb)
649 if (r->objects->commit_graph)
652 r->objects->commit_graph = read_commit_graph_one(r, odb);
656 * Return 1 if commit_graph is non-NULL, and 0 otherwise.
658 * On the first invocation, this function attempts to load the commit
659 * graph if the_repository is configured to have one.
661 static int prepare_commit_graph(struct repository *r)
663 struct object_directory *odb;
666 * This must come before the "already attempted?" check below, because
667 * we want to disable even an already-loaded graph file.
669 if (r->commit_graph_disabled)
672 if (r->objects->commit_graph_attempted)
673 return !!r->objects->commit_graph;
674 r->objects->commit_graph_attempted = 1;
676 prepare_repo_settings(r);
678 if (!git_env_bool(GIT_TEST_COMMIT_GRAPH, 0) &&
679 r->settings.core_commit_graph != 1)
681 * This repository is not configured to use commit graphs, so
682 * do not load one. (But report commit_graph_attempted anyway
683 * so that commit graph loading is not attempted again for this
688 if (!commit_graph_compatible(r))
692 for (odb = r->objects->odb;
693 !r->objects->commit_graph && odb;
695 prepare_commit_graph_one(r, odb);
696 return !!r->objects->commit_graph;
699 int generation_numbers_enabled(struct repository *r)
701 uint32_t first_generation;
702 struct commit_graph *g;
703 if (!prepare_commit_graph(r))
706 g = r->objects->commit_graph;
711 first_generation = get_be32(g->chunk_commit_data +
712 g->hash_len + 8) >> 2;
714 return !!first_generation;
717 int corrected_commit_dates_enabled(struct repository *r)
719 struct commit_graph *g;
720 if (!prepare_commit_graph(r))
723 g = r->objects->commit_graph;
728 return g->read_generation_data;
731 struct bloom_filter_settings *get_bloom_filter_settings(struct repository *r)
733 struct commit_graph *g = r->objects->commit_graph;
735 if (g->bloom_filter_settings)
736 return g->bloom_filter_settings;
742 static void close_commit_graph_one(struct commit_graph *g)
747 close_commit_graph_one(g->base_graph);
748 free_commit_graph(g);
751 void close_commit_graph(struct raw_object_store *o)
753 close_commit_graph_one(o->commit_graph);
754 o->commit_graph = NULL;
757 static int bsearch_graph(struct commit_graph *g, struct object_id *oid, uint32_t *pos)
759 return bsearch_hash(oid->hash, g->chunk_oid_fanout,
760 g->chunk_oid_lookup, g->hash_len, pos);
763 static void load_oid_from_graph(struct commit_graph *g,
765 struct object_id *oid)
769 while (g && pos < g->num_commits_in_base)
773 BUG("NULL commit-graph");
775 if (pos >= g->num_commits + g->num_commits_in_base)
776 die(_("invalid commit position. commit-graph is likely corrupt"));
778 lex_index = pos - g->num_commits_in_base;
780 hashcpy(oid->hash, g->chunk_oid_lookup + g->hash_len * lex_index);
783 static struct commit_list **insert_parent_or_die(struct repository *r,
784 struct commit_graph *g,
786 struct commit_list **pptr)
789 struct object_id oid;
791 if (pos >= g->num_commits + g->num_commits_in_base)
792 die("invalid parent position %"PRIu32, pos);
794 load_oid_from_graph(g, pos, &oid);
795 c = lookup_commit(r, &oid);
797 die(_("could not find commit %s"), oid_to_hex(&oid));
798 commit_graph_data_at(c)->graph_pos = pos;
799 return &commit_list_insert(c, pptr)->next;
802 static void fill_commit_graph_info(struct commit *item, struct commit_graph *g, uint32_t pos)
804 const unsigned char *commit_data;
805 struct commit_graph_data *graph_data;
806 uint32_t lex_index, offset_pos;
807 uint64_t date_high, date_low, offset;
809 while (pos < g->num_commits_in_base)
812 if (pos >= g->num_commits + g->num_commits_in_base)
813 die(_("invalid commit position. commit-graph is likely corrupt"));
815 lex_index = pos - g->num_commits_in_base;
816 commit_data = g->chunk_commit_data + GRAPH_DATA_WIDTH * lex_index;
818 graph_data = commit_graph_data_at(item);
819 graph_data->graph_pos = pos;
821 date_high = get_be32(commit_data + g->hash_len + 8) & 0x3;
822 date_low = get_be32(commit_data + g->hash_len + 12);
823 item->date = (timestamp_t)((date_high << 32) | date_low);
825 if (g->read_generation_data) {
826 offset = (timestamp_t)get_be32(g->chunk_generation_data + sizeof(uint32_t) * lex_index);
828 if (offset & CORRECTED_COMMIT_DATE_OFFSET_OVERFLOW) {
829 if (!g->chunk_generation_data_overflow)
830 die(_("commit-graph requires overflow generation data but has none"));
832 offset_pos = offset ^ CORRECTED_COMMIT_DATE_OFFSET_OVERFLOW;
833 graph_data->generation = get_be64(g->chunk_generation_data_overflow + 8 * offset_pos);
835 graph_data->generation = item->date + offset;
837 graph_data->generation = get_be32(commit_data + g->hash_len + 8) >> 2;
840 *topo_level_slab_at(g->topo_levels, item) = get_be32(commit_data + g->hash_len + 8) >> 2;
843 static inline void set_commit_tree(struct commit *c, struct tree *t)
848 static int fill_commit_in_graph(struct repository *r,
850 struct commit_graph *g, uint32_t pos)
853 uint32_t *parent_data_ptr;
854 struct commit_list **pptr;
855 const unsigned char *commit_data;
858 while (pos < g->num_commits_in_base)
861 fill_commit_graph_info(item, g, pos);
863 lex_index = pos - g->num_commits_in_base;
864 commit_data = g->chunk_commit_data + (g->hash_len + 16) * lex_index;
866 item->object.parsed = 1;
868 set_commit_tree(item, NULL);
870 pptr = &item->parents;
872 edge_value = get_be32(commit_data + g->hash_len);
873 if (edge_value == GRAPH_PARENT_NONE)
875 pptr = insert_parent_or_die(r, g, edge_value, pptr);
877 edge_value = get_be32(commit_data + g->hash_len + 4);
878 if (edge_value == GRAPH_PARENT_NONE)
880 if (!(edge_value & GRAPH_EXTRA_EDGES_NEEDED)) {
881 pptr = insert_parent_or_die(r, g, edge_value, pptr);
885 parent_data_ptr = (uint32_t*)(g->chunk_extra_edges +
886 4 * (uint64_t)(edge_value & GRAPH_EDGE_LAST_MASK));
888 edge_value = get_be32(parent_data_ptr);
889 pptr = insert_parent_or_die(r, g,
890 edge_value & GRAPH_EDGE_LAST_MASK,
893 } while (!(edge_value & GRAPH_LAST_EDGE));
898 static int find_commit_in_graph(struct commit *item, struct commit_graph *g, uint32_t *pos)
900 uint32_t graph_pos = commit_graph_position(item);
901 if (graph_pos != COMMIT_NOT_FROM_GRAPH) {
905 struct commit_graph *cur_g = g;
908 while (cur_g && !bsearch_graph(cur_g, &(item->object.oid), &lex_index))
909 cur_g = cur_g->base_graph;
912 *pos = lex_index + cur_g->num_commits_in_base;
920 static int parse_commit_in_graph_one(struct repository *r,
921 struct commit_graph *g,
926 if (item->object.parsed)
929 if (find_commit_in_graph(item, g, &pos))
930 return fill_commit_in_graph(r, item, g, pos);
935 int parse_commit_in_graph(struct repository *r, struct commit *item)
937 static int checked_env = 0;
940 git_env_bool(GIT_TEST_COMMIT_GRAPH_DIE_ON_PARSE, 0))
941 die("dying as requested by the '%s' variable on commit-graph parse!",
942 GIT_TEST_COMMIT_GRAPH_DIE_ON_PARSE);
945 if (!prepare_commit_graph(r))
947 return parse_commit_in_graph_one(r, r->objects->commit_graph, item);
950 void load_commit_graph_info(struct repository *r, struct commit *item)
953 if (!prepare_commit_graph(r))
955 if (find_commit_in_graph(item, r->objects->commit_graph, &pos))
956 fill_commit_graph_info(item, r->objects->commit_graph, pos);
959 static struct tree *load_tree_for_commit(struct repository *r,
960 struct commit_graph *g,
963 struct object_id oid;
964 const unsigned char *commit_data;
965 uint32_t graph_pos = commit_graph_position(c);
967 while (graph_pos < g->num_commits_in_base)
970 commit_data = g->chunk_commit_data +
971 GRAPH_DATA_WIDTH * (graph_pos - g->num_commits_in_base);
973 hashcpy(oid.hash, commit_data);
974 set_commit_tree(c, lookup_tree(r, &oid));
976 return c->maybe_tree;
979 static struct tree *get_commit_tree_in_graph_one(struct repository *r,
980 struct commit_graph *g,
981 const struct commit *c)
984 return c->maybe_tree;
985 if (commit_graph_position(c) == COMMIT_NOT_FROM_GRAPH)
986 BUG("get_commit_tree_in_graph_one called from non-commit-graph commit");
988 return load_tree_for_commit(r, g, (struct commit *)c);
991 struct tree *get_commit_tree_in_graph(struct repository *r, const struct commit *c)
993 return get_commit_tree_in_graph_one(r, r->objects->commit_graph, c);
996 struct packed_commit_list {
997 struct commit **list;
1002 struct write_commit_graph_context {
1003 struct repository *r;
1004 struct object_directory *odb;
1006 struct oid_array oids;
1007 struct packed_commit_list commits;
1008 int num_extra_edges;
1009 int num_generation_data_overflows;
1010 unsigned long approx_nr_objects;
1011 struct progress *progress;
1013 uint64_t progress_cnt;
1015 char *base_graph_name;
1016 int num_commit_graphs_before;
1017 int num_commit_graphs_after;
1018 char **commit_graph_filenames_before;
1019 char **commit_graph_filenames_after;
1020 char **commit_graph_hash_after;
1021 uint32_t new_num_commits_in_base;
1022 struct commit_graph *new_base_graph;
1029 write_generation_data:1;
1031 struct topo_level_slab *topo_levels;
1032 const struct commit_graph_opts *opts;
1033 size_t total_bloom_filter_data_size;
1034 const struct bloom_filter_settings *bloom_settings;
1036 int count_bloom_filter_computed;
1037 int count_bloom_filter_not_computed;
1038 int count_bloom_filter_trunc_empty;
1039 int count_bloom_filter_trunc_large;
1042 static int write_graph_chunk_fanout(struct hashfile *f,
1045 struct write_commit_graph_context *ctx = data;
1047 struct commit **list = ctx->commits.list;
1050 * Write the first-level table (the list is sorted,
1051 * but we use a 256-entry lookup to be able to avoid
1052 * having to do eight extra binary search iterations).
1054 for (i = 0; i < 256; i++) {
1055 while (count < ctx->commits.nr) {
1056 if ((*list)->object.oid.hash[0] != i)
1058 display_progress(ctx->progress, ++ctx->progress_cnt);
1063 hashwrite_be32(f, count);
1069 static int write_graph_chunk_oids(struct hashfile *f,
1072 struct write_commit_graph_context *ctx = data;
1073 struct commit **list = ctx->commits.list;
1075 for (count = 0; count < ctx->commits.nr; count++, list++) {
1076 display_progress(ctx->progress, ++ctx->progress_cnt);
1077 hashwrite(f, (*list)->object.oid.hash, the_hash_algo->rawsz);
1083 static const unsigned char *commit_to_sha1(size_t index, void *table)
1085 struct commit **commits = table;
1086 return commits[index]->object.oid.hash;
1089 static int write_graph_chunk_data(struct hashfile *f,
1092 struct write_commit_graph_context *ctx = data;
1093 struct commit **list = ctx->commits.list;
1094 struct commit **last = ctx->commits.list + ctx->commits.nr;
1095 uint32_t num_extra_edges = 0;
1097 while (list < last) {
1098 struct commit_list *parent;
1099 struct object_id *tree;
1101 uint32_t packedDate[2];
1102 display_progress(ctx->progress, ++ctx->progress_cnt);
1104 if (parse_commit_no_graph(*list))
1105 die(_("unable to parse commit %s"),
1106 oid_to_hex(&(*list)->object.oid));
1107 tree = get_commit_tree_oid(*list);
1108 hashwrite(f, tree->hash, the_hash_algo->rawsz);
1110 parent = (*list)->parents;
1113 edge_value = GRAPH_PARENT_NONE;
1115 edge_value = sha1_pos(parent->item->object.oid.hash,
1120 if (edge_value >= 0)
1121 edge_value += ctx->new_num_commits_in_base;
1122 else if (ctx->new_base_graph) {
1124 if (find_commit_in_graph(parent->item,
1125 ctx->new_base_graph,
1131 BUG("missing parent %s for commit %s",
1132 oid_to_hex(&parent->item->object.oid),
1133 oid_to_hex(&(*list)->object.oid));
1136 hashwrite_be32(f, edge_value);
1139 parent = parent->next;
1142 edge_value = GRAPH_PARENT_NONE;
1143 else if (parent->next)
1144 edge_value = GRAPH_EXTRA_EDGES_NEEDED | num_extra_edges;
1146 edge_value = sha1_pos(parent->item->object.oid.hash,
1151 if (edge_value >= 0)
1152 edge_value += ctx->new_num_commits_in_base;
1153 else if (ctx->new_base_graph) {
1155 if (find_commit_in_graph(parent->item,
1156 ctx->new_base_graph,
1162 BUG("missing parent %s for commit %s",
1163 oid_to_hex(&parent->item->object.oid),
1164 oid_to_hex(&(*list)->object.oid));
1167 hashwrite_be32(f, edge_value);
1169 if (edge_value & GRAPH_EXTRA_EDGES_NEEDED) {
1172 parent = parent->next;
1176 if (sizeof((*list)->date) > 4)
1177 packedDate[0] = htonl(((*list)->date >> 32) & 0x3);
1181 packedDate[0] |= htonl(*topo_level_slab_at(ctx->topo_levels, *list) << 2);
1183 packedDate[1] = htonl((*list)->date);
1184 hashwrite(f, packedDate, 8);
1192 static int write_graph_chunk_generation_data(struct hashfile *f,
1195 struct write_commit_graph_context *ctx = data;
1196 int i, num_generation_data_overflows = 0;
1198 for (i = 0; i < ctx->commits.nr; i++) {
1199 struct commit *c = ctx->commits.list[i];
1200 timestamp_t offset = commit_graph_data_at(c)->generation - c->date;
1201 display_progress(ctx->progress, ++ctx->progress_cnt);
1203 if (offset > GENERATION_NUMBER_V2_OFFSET_MAX) {
1204 offset = CORRECTED_COMMIT_DATE_OFFSET_OVERFLOW | num_generation_data_overflows;
1205 num_generation_data_overflows++;
1208 hashwrite_be32(f, offset);
1214 static int write_graph_chunk_generation_data_overflow(struct hashfile *f,
1217 struct write_commit_graph_context *ctx = data;
1219 for (i = 0; i < ctx->commits.nr; i++) {
1220 struct commit *c = ctx->commits.list[i];
1221 timestamp_t offset = commit_graph_data_at(c)->generation - c->date;
1222 display_progress(ctx->progress, ++ctx->progress_cnt);
1224 if (offset > GENERATION_NUMBER_V2_OFFSET_MAX) {
1225 hashwrite_be32(f, offset >> 32);
1226 hashwrite_be32(f, (uint32_t) offset);
1233 static int write_graph_chunk_extra_edges(struct hashfile *f,
1236 struct write_commit_graph_context *ctx = data;
1237 struct commit **list = ctx->commits.list;
1238 struct commit **last = ctx->commits.list + ctx->commits.nr;
1239 struct commit_list *parent;
1241 while (list < last) {
1242 int num_parents = 0;
1244 display_progress(ctx->progress, ++ctx->progress_cnt);
1246 for (parent = (*list)->parents; num_parents < 3 && parent;
1247 parent = parent->next)
1250 if (num_parents <= 2) {
1255 /* Since num_parents > 2, this initializer is safe. */
1256 for (parent = (*list)->parents->next; parent; parent = parent->next) {
1257 int edge_value = sha1_pos(parent->item->object.oid.hash,
1262 if (edge_value >= 0)
1263 edge_value += ctx->new_num_commits_in_base;
1264 else if (ctx->new_base_graph) {
1266 if (find_commit_in_graph(parent->item,
1267 ctx->new_base_graph,
1273 BUG("missing parent %s for commit %s",
1274 oid_to_hex(&parent->item->object.oid),
1275 oid_to_hex(&(*list)->object.oid));
1276 else if (!parent->next)
1277 edge_value |= GRAPH_LAST_EDGE;
1279 hashwrite_be32(f, edge_value);
1288 static int write_graph_chunk_bloom_indexes(struct hashfile *f,
1291 struct write_commit_graph_context *ctx = data;
1292 struct commit **list = ctx->commits.list;
1293 struct commit **last = ctx->commits.list + ctx->commits.nr;
1294 uint32_t cur_pos = 0;
1296 while (list < last) {
1297 struct bloom_filter *filter = get_bloom_filter(ctx->r, *list);
1298 size_t len = filter ? filter->len : 0;
1300 display_progress(ctx->progress, ++ctx->progress_cnt);
1301 hashwrite_be32(f, cur_pos);
1308 static void trace2_bloom_filter_settings(struct write_commit_graph_context *ctx)
1310 struct json_writer jw = JSON_WRITER_INIT;
1312 jw_object_begin(&jw, 0);
1313 jw_object_intmax(&jw, "hash_version", ctx->bloom_settings->hash_version);
1314 jw_object_intmax(&jw, "num_hashes", ctx->bloom_settings->num_hashes);
1315 jw_object_intmax(&jw, "bits_per_entry", ctx->bloom_settings->bits_per_entry);
1316 jw_object_intmax(&jw, "max_changed_paths", ctx->bloom_settings->max_changed_paths);
1319 trace2_data_json("bloom", ctx->r, "settings", &jw);
1324 static int write_graph_chunk_bloom_data(struct hashfile *f,
1327 struct write_commit_graph_context *ctx = data;
1328 struct commit **list = ctx->commits.list;
1329 struct commit **last = ctx->commits.list + ctx->commits.nr;
1331 trace2_bloom_filter_settings(ctx);
1333 hashwrite_be32(f, ctx->bloom_settings->hash_version);
1334 hashwrite_be32(f, ctx->bloom_settings->num_hashes);
1335 hashwrite_be32(f, ctx->bloom_settings->bits_per_entry);
1337 while (list < last) {
1338 struct bloom_filter *filter = get_bloom_filter(ctx->r, *list);
1339 size_t len = filter ? filter->len : 0;
1341 display_progress(ctx->progress, ++ctx->progress_cnt);
1343 hashwrite(f, filter->data, len * sizeof(unsigned char));
1350 static int add_packed_commits(const struct object_id *oid,
1351 struct packed_git *pack,
1355 struct write_commit_graph_context *ctx = (struct write_commit_graph_context*)data;
1356 enum object_type type;
1357 off_t offset = nth_packed_object_offset(pack, pos);
1358 struct object_info oi = OBJECT_INFO_INIT;
1361 display_progress(ctx->progress, ++ctx->progress_done);
1364 if (packed_object_info(ctx->r, pack, offset, &oi) < 0)
1365 die(_("unable to get type of object %s"), oid_to_hex(oid));
1367 if (type != OBJ_COMMIT)
1370 oid_array_append(&ctx->oids, oid);
1371 set_commit_pos(ctx->r, oid);
1376 static void add_missing_parents(struct write_commit_graph_context *ctx, struct commit *commit)
1378 struct commit_list *parent;
1379 for (parent = commit->parents; parent; parent = parent->next) {
1380 if (!(parent->item->object.flags & REACHABLE)) {
1381 oid_array_append(&ctx->oids, &parent->item->object.oid);
1382 parent->item->object.flags |= REACHABLE;
1387 static void close_reachable(struct write_commit_graph_context *ctx)
1390 struct commit *commit;
1391 enum commit_graph_split_flags flags = ctx->opts ?
1392 ctx->opts->split_flags : COMMIT_GRAPH_SPLIT_UNSPECIFIED;
1394 if (ctx->report_progress)
1395 ctx->progress = start_delayed_progress(
1396 _("Loading known commits in commit graph"),
1398 for (i = 0; i < ctx->oids.nr; i++) {
1399 display_progress(ctx->progress, i + 1);
1400 commit = lookup_commit(ctx->r, &ctx->oids.oid[i]);
1402 commit->object.flags |= REACHABLE;
1404 stop_progress(&ctx->progress);
1407 * As this loop runs, ctx->oids.nr may grow, but not more
1408 * than the number of missing commits in the reachable
1411 if (ctx->report_progress)
1412 ctx->progress = start_delayed_progress(
1413 _("Expanding reachable commits in commit graph"),
1415 for (i = 0; i < ctx->oids.nr; i++) {
1416 display_progress(ctx->progress, i + 1);
1417 commit = lookup_commit(ctx->r, &ctx->oids.oid[i]);
1422 if ((!parse_commit(commit) &&
1423 commit_graph_position(commit) == COMMIT_NOT_FROM_GRAPH) ||
1424 flags == COMMIT_GRAPH_SPLIT_REPLACE)
1425 add_missing_parents(ctx, commit);
1426 } else if (!parse_commit_no_graph(commit))
1427 add_missing_parents(ctx, commit);
1429 stop_progress(&ctx->progress);
1431 if (ctx->report_progress)
1432 ctx->progress = start_delayed_progress(
1433 _("Clearing commit marks in commit graph"),
1435 for (i = 0; i < ctx->oids.nr; i++) {
1436 display_progress(ctx->progress, i + 1);
1437 commit = lookup_commit(ctx->r, &ctx->oids.oid[i]);
1440 commit->object.flags &= ~REACHABLE;
1442 stop_progress(&ctx->progress);
1445 static void compute_generation_numbers(struct write_commit_graph_context *ctx)
1448 struct commit_list *list = NULL;
1450 if (ctx->report_progress)
1451 ctx->progress = start_delayed_progress(
1452 _("Computing commit graph generation numbers"),
1454 for (i = 0; i < ctx->commits.nr; i++) {
1455 uint32_t level = *topo_level_slab_at(ctx->topo_levels, ctx->commits.list[i]);
1456 timestamp_t corrected_commit_date = commit_graph_data_at(ctx->commits.list[i])->generation;
1458 display_progress(ctx->progress, i + 1);
1459 if (level != GENERATION_NUMBER_ZERO &&
1460 corrected_commit_date != GENERATION_NUMBER_ZERO)
1463 commit_list_insert(ctx->commits.list[i], &list);
1465 struct commit *current = list->item;
1466 struct commit_list *parent;
1467 int all_parents_computed = 1;
1468 uint32_t max_level = 0;
1469 timestamp_t max_corrected_commit_date = 0;
1471 for (parent = current->parents; parent; parent = parent->next) {
1472 level = *topo_level_slab_at(ctx->topo_levels, parent->item);
1473 corrected_commit_date = commit_graph_data_at(parent->item)->generation;
1475 if (level == GENERATION_NUMBER_ZERO ||
1476 corrected_commit_date == GENERATION_NUMBER_ZERO) {
1477 all_parents_computed = 0;
1478 commit_list_insert(parent->item, &list);
1482 if (level > max_level)
1485 if (corrected_commit_date > max_corrected_commit_date)
1486 max_corrected_commit_date = corrected_commit_date;
1489 if (all_parents_computed) {
1492 if (max_level > GENERATION_NUMBER_V1_MAX - 1)
1493 max_level = GENERATION_NUMBER_V1_MAX - 1;
1494 *topo_level_slab_at(ctx->topo_levels, current) = max_level + 1;
1496 if (current->date && current->date > max_corrected_commit_date)
1497 max_corrected_commit_date = current->date - 1;
1498 commit_graph_data_at(current)->generation = max_corrected_commit_date + 1;
1500 if (commit_graph_data_at(current)->generation - current->date > GENERATION_NUMBER_V2_OFFSET_MAX)
1501 ctx->num_generation_data_overflows++;
1505 stop_progress(&ctx->progress);
1508 static void trace2_bloom_filter_write_statistics(struct write_commit_graph_context *ctx)
1510 trace2_data_intmax("commit-graph", ctx->r, "filter-computed",
1511 ctx->count_bloom_filter_computed);
1512 trace2_data_intmax("commit-graph", ctx->r, "filter-not-computed",
1513 ctx->count_bloom_filter_not_computed);
1514 trace2_data_intmax("commit-graph", ctx->r, "filter-trunc-empty",
1515 ctx->count_bloom_filter_trunc_empty);
1516 trace2_data_intmax("commit-graph", ctx->r, "filter-trunc-large",
1517 ctx->count_bloom_filter_trunc_large);
1520 static void compute_bloom_filters(struct write_commit_graph_context *ctx)
1523 struct progress *progress = NULL;
1524 struct commit **sorted_commits;
1525 int max_new_filters;
1527 init_bloom_filters();
1529 if (ctx->report_progress)
1530 progress = start_delayed_progress(
1531 _("Computing commit changed paths Bloom filters"),
1534 ALLOC_ARRAY(sorted_commits, ctx->commits.nr);
1535 COPY_ARRAY(sorted_commits, ctx->commits.list, ctx->commits.nr);
1537 if (ctx->order_by_pack)
1538 QSORT(sorted_commits, ctx->commits.nr, commit_pos_cmp);
1540 QSORT(sorted_commits, ctx->commits.nr, commit_gen_cmp);
1542 max_new_filters = ctx->opts && ctx->opts->max_new_filters >= 0 ?
1543 ctx->opts->max_new_filters : ctx->commits.nr;
1545 for (i = 0; i < ctx->commits.nr; i++) {
1546 enum bloom_filter_computed computed = 0;
1547 struct commit *c = sorted_commits[i];
1548 struct bloom_filter *filter = get_or_compute_bloom_filter(
1551 ctx->count_bloom_filter_computed < max_new_filters,
1552 ctx->bloom_settings,
1554 if (computed & BLOOM_COMPUTED) {
1555 ctx->count_bloom_filter_computed++;
1556 if (computed & BLOOM_TRUNC_EMPTY)
1557 ctx->count_bloom_filter_trunc_empty++;
1558 if (computed & BLOOM_TRUNC_LARGE)
1559 ctx->count_bloom_filter_trunc_large++;
1560 } else if (computed & BLOOM_NOT_COMPUTED)
1561 ctx->count_bloom_filter_not_computed++;
1562 ctx->total_bloom_filter_data_size += filter
1563 ? sizeof(unsigned char) * filter->len : 0;
1564 display_progress(progress, i + 1);
1567 if (trace2_is_enabled())
1568 trace2_bloom_filter_write_statistics(ctx);
1570 free(sorted_commits);
1571 stop_progress(&progress);
1574 struct refs_cb_data {
1575 struct oidset *commits;
1576 struct progress *progress;
1579 static int add_ref_to_set(const char *refname,
1580 const struct object_id *oid,
1581 int flags, void *cb_data)
1583 struct object_id peeled;
1584 struct refs_cb_data *data = (struct refs_cb_data *)cb_data;
1586 if (!peel_ref(refname, &peeled))
1588 if (oid_object_info(the_repository, oid, NULL) == OBJ_COMMIT)
1589 oidset_insert(data->commits, oid);
1591 display_progress(data->progress, oidset_size(data->commits));
1596 int write_commit_graph_reachable(struct object_directory *odb,
1597 enum commit_graph_write_flags flags,
1598 const struct commit_graph_opts *opts)
1600 struct oidset commits = OIDSET_INIT;
1601 struct refs_cb_data data;
1604 memset(&data, 0, sizeof(data));
1605 data.commits = &commits;
1606 if (flags & COMMIT_GRAPH_WRITE_PROGRESS)
1607 data.progress = start_delayed_progress(
1608 _("Collecting referenced commits"), 0);
1610 for_each_ref(add_ref_to_set, &data);
1612 stop_progress(&data.progress);
1614 result = write_commit_graph(odb, NULL, &commits,
1617 oidset_clear(&commits);
1621 static int fill_oids_from_packs(struct write_commit_graph_context *ctx,
1622 struct string_list *pack_indexes)
1625 struct strbuf progress_title = STRBUF_INIT;
1626 struct strbuf packname = STRBUF_INIT;
1629 strbuf_addf(&packname, "%s/pack/", ctx->odb->path);
1630 dirlen = packname.len;
1631 if (ctx->report_progress) {
1632 strbuf_addf(&progress_title,
1633 Q_("Finding commits for commit graph in %d pack",
1634 "Finding commits for commit graph in %d packs",
1637 ctx->progress = start_delayed_progress(progress_title.buf, 0);
1638 ctx->progress_done = 0;
1640 for (i = 0; i < pack_indexes->nr; i++) {
1641 struct packed_git *p;
1642 strbuf_setlen(&packname, dirlen);
1643 strbuf_addstr(&packname, pack_indexes->items[i].string);
1644 p = add_packed_git(packname.buf, packname.len, 1);
1646 error(_("error adding pack %s"), packname.buf);
1649 if (open_pack_index(p)) {
1650 error(_("error opening index for %s"), packname.buf);
1653 for_each_object_in_pack(p, add_packed_commits, ctx,
1654 FOR_EACH_OBJECT_PACK_ORDER);
1659 stop_progress(&ctx->progress);
1660 strbuf_release(&progress_title);
1661 strbuf_release(&packname);
1666 static int fill_oids_from_commits(struct write_commit_graph_context *ctx,
1667 struct oidset *commits)
1669 struct oidset_iter iter;
1670 struct object_id *oid;
1672 if (!oidset_size(commits))
1675 oidset_iter_init(commits, &iter);
1676 while ((oid = oidset_iter_next(&iter))) {
1677 oid_array_append(&ctx->oids, oid);
1683 static void fill_oids_from_all_packs(struct write_commit_graph_context *ctx)
1685 if (ctx->report_progress)
1686 ctx->progress = start_delayed_progress(
1687 _("Finding commits for commit graph among packed objects"),
1688 ctx->approx_nr_objects);
1689 for_each_packed_object(add_packed_commits, ctx,
1690 FOR_EACH_OBJECT_PACK_ORDER);
1691 if (ctx->progress_done < ctx->approx_nr_objects)
1692 display_progress(ctx->progress, ctx->approx_nr_objects);
1693 stop_progress(&ctx->progress);
1696 static void copy_oids_to_commits(struct write_commit_graph_context *ctx)
1699 enum commit_graph_split_flags flags = ctx->opts ?
1700 ctx->opts->split_flags : COMMIT_GRAPH_SPLIT_UNSPECIFIED;
1702 ctx->num_extra_edges = 0;
1703 if (ctx->report_progress)
1704 ctx->progress = start_delayed_progress(
1705 _("Finding extra edges in commit graph"),
1707 oid_array_sort(&ctx->oids);
1708 for (i = 0; i < ctx->oids.nr; i = oid_array_next_unique(&ctx->oids, i)) {
1709 unsigned int num_parents;
1711 display_progress(ctx->progress, i + 1);
1713 ALLOC_GROW(ctx->commits.list, ctx->commits.nr + 1, ctx->commits.alloc);
1714 ctx->commits.list[ctx->commits.nr] = lookup_commit(ctx->r, &ctx->oids.oid[i]);
1716 if (ctx->split && flags != COMMIT_GRAPH_SPLIT_REPLACE &&
1717 commit_graph_position(ctx->commits.list[ctx->commits.nr]) != COMMIT_NOT_FROM_GRAPH)
1720 if (ctx->split && flags == COMMIT_GRAPH_SPLIT_REPLACE)
1721 parse_commit(ctx->commits.list[ctx->commits.nr]);
1723 parse_commit_no_graph(ctx->commits.list[ctx->commits.nr]);
1725 num_parents = commit_list_count(ctx->commits.list[ctx->commits.nr]->parents);
1726 if (num_parents > 2)
1727 ctx->num_extra_edges += num_parents - 1;
1731 stop_progress(&ctx->progress);
1734 static int write_graph_chunk_base_1(struct hashfile *f,
1735 struct commit_graph *g)
1742 num = write_graph_chunk_base_1(f, g->base_graph);
1743 hashwrite(f, g->oid.hash, the_hash_algo->rawsz);
1747 static int write_graph_chunk_base(struct hashfile *f,
1750 struct write_commit_graph_context *ctx = data;
1751 int num = write_graph_chunk_base_1(f, ctx->new_base_graph);
1753 if (num != ctx->num_commit_graphs_after - 1) {
1754 error(_("failed to write correct number of base graph ids"));
1761 static int write_commit_graph_file(struct write_commit_graph_context *ctx)
1766 struct lock_file lk = LOCK_INIT;
1767 const unsigned hashsz = the_hash_algo->rawsz;
1768 struct strbuf progress_title = STRBUF_INIT;
1770 struct object_id file_hash;
1771 struct chunkfile *cf;
1774 struct strbuf tmp_file = STRBUF_INIT;
1776 strbuf_addf(&tmp_file,
1777 "%s/info/commit-graphs/tmp_graph_XXXXXX",
1779 ctx->graph_name = strbuf_detach(&tmp_file, NULL);
1781 ctx->graph_name = get_commit_graph_filename(ctx->odb);
1784 if (safe_create_leading_directories(ctx->graph_name)) {
1785 UNLEAK(ctx->graph_name);
1786 error(_("unable to create leading directories of %s"),
1792 char *lock_name = get_commit_graph_chain_filename(ctx->odb);
1794 hold_lock_file_for_update_mode(&lk, lock_name,
1795 LOCK_DIE_ON_ERROR, 0444);
1797 fd = git_mkstemp_mode(ctx->graph_name, 0444);
1799 error(_("unable to create temporary graph layer"));
1803 if (adjust_shared_perm(ctx->graph_name)) {
1804 error(_("unable to adjust shared permissions for '%s'"),
1809 f = hashfd(fd, ctx->graph_name);
1811 hold_lock_file_for_update_mode(&lk, ctx->graph_name,
1812 LOCK_DIE_ON_ERROR, 0444);
1813 fd = lk.tempfile->fd;
1814 f = hashfd(lk.tempfile->fd, lk.tempfile->filename.buf);
1817 cf = init_chunkfile(f);
1819 add_chunk(cf, GRAPH_CHUNKID_OIDFANOUT, GRAPH_FANOUT_SIZE,
1820 write_graph_chunk_fanout);
1821 add_chunk(cf, GRAPH_CHUNKID_OIDLOOKUP, hashsz * ctx->commits.nr,
1822 write_graph_chunk_oids);
1823 add_chunk(cf, GRAPH_CHUNKID_DATA, (hashsz + 16) * ctx->commits.nr,
1824 write_graph_chunk_data);
1826 if (git_env_bool(GIT_TEST_COMMIT_GRAPH_NO_GDAT, 0))
1827 ctx->write_generation_data = 0;
1828 if (ctx->write_generation_data)
1829 add_chunk(cf, GRAPH_CHUNKID_GENERATION_DATA,
1830 sizeof(uint32_t) * ctx->commits.nr,
1831 write_graph_chunk_generation_data);
1832 if (ctx->num_generation_data_overflows)
1833 add_chunk(cf, GRAPH_CHUNKID_GENERATION_DATA_OVERFLOW,
1834 sizeof(timestamp_t) * ctx->num_generation_data_overflows,
1835 write_graph_chunk_generation_data_overflow);
1836 if (ctx->num_extra_edges)
1837 add_chunk(cf, GRAPH_CHUNKID_EXTRAEDGES,
1838 4 * ctx->num_extra_edges,
1839 write_graph_chunk_extra_edges);
1840 if (ctx->changed_paths) {
1841 add_chunk(cf, GRAPH_CHUNKID_BLOOMINDEXES,
1842 sizeof(uint32_t) * ctx->commits.nr,
1843 write_graph_chunk_bloom_indexes);
1844 add_chunk(cf, GRAPH_CHUNKID_BLOOMDATA,
1845 sizeof(uint32_t) * 3
1846 + ctx->total_bloom_filter_data_size,
1847 write_graph_chunk_bloom_data);
1849 if (ctx->num_commit_graphs_after > 1)
1850 add_chunk(cf, GRAPH_CHUNKID_BASE,
1851 hashsz * (ctx->num_commit_graphs_after - 1),
1852 write_graph_chunk_base);
1854 hashwrite_be32(f, GRAPH_SIGNATURE);
1856 hashwrite_u8(f, GRAPH_VERSION);
1857 hashwrite_u8(f, oid_version());
1858 hashwrite_u8(f, get_num_chunks(cf));
1859 hashwrite_u8(f, ctx->num_commit_graphs_after - 1);
1861 if (ctx->report_progress) {
1862 strbuf_addf(&progress_title,
1863 Q_("Writing out commit graph in %d pass",
1864 "Writing out commit graph in %d passes",
1867 ctx->progress = start_delayed_progress(
1869 num_chunks * ctx->commits.nr);
1872 write_chunkfile(cf, ctx);
1874 stop_progress(&ctx->progress);
1875 strbuf_release(&progress_title);
1877 if (ctx->split && ctx->base_graph_name && ctx->num_commit_graphs_after > 1) {
1878 char *new_base_hash = xstrdup(oid_to_hex(&ctx->new_base_graph->oid));
1879 char *new_base_name = get_split_graph_filename(ctx->new_base_graph->odb, new_base_hash);
1881 free(ctx->commit_graph_filenames_after[ctx->num_commit_graphs_after - 2]);
1882 free(ctx->commit_graph_hash_after[ctx->num_commit_graphs_after - 2]);
1883 ctx->commit_graph_filenames_after[ctx->num_commit_graphs_after - 2] = new_base_name;
1884 ctx->commit_graph_hash_after[ctx->num_commit_graphs_after - 2] = new_base_hash;
1887 close_commit_graph(ctx->r->objects);
1888 finalize_hashfile(f, file_hash.hash, CSUM_HASH_IN_STREAM | CSUM_FSYNC);
1892 FILE *chainf = fdopen_lock_file(&lk, "w");
1893 char *final_graph_name;
1899 error(_("unable to open commit-graph chain file"));
1903 if (ctx->base_graph_name) {
1905 int idx = ctx->num_commit_graphs_after - 1;
1906 if (ctx->num_commit_graphs_after > 1)
1909 dest = ctx->commit_graph_filenames_after[idx];
1911 if (strcmp(ctx->base_graph_name, dest)) {
1912 result = rename(ctx->base_graph_name, dest);
1915 error(_("failed to rename base commit-graph file"));
1920 char *graph_name = get_commit_graph_filename(ctx->odb);
1924 ctx->commit_graph_hash_after[ctx->num_commit_graphs_after - 1] = xstrdup(oid_to_hex(&file_hash));
1925 final_graph_name = get_split_graph_filename(ctx->odb,
1926 ctx->commit_graph_hash_after[ctx->num_commit_graphs_after - 1]);
1927 ctx->commit_graph_filenames_after[ctx->num_commit_graphs_after - 1] = final_graph_name;
1929 result = rename(ctx->graph_name, final_graph_name);
1931 for (i = 0; i < ctx->num_commit_graphs_after; i++)
1932 fprintf(lk.tempfile->fp, "%s\n", ctx->commit_graph_hash_after[i]);
1935 error(_("failed to rename temporary commit-graph file"));
1940 commit_lock_file(&lk);
1945 static void split_graph_merge_strategy(struct write_commit_graph_context *ctx)
1947 struct commit_graph *g;
1948 uint32_t num_commits;
1949 enum commit_graph_split_flags flags = COMMIT_GRAPH_SPLIT_UNSPECIFIED;
1952 int max_commits = 0;
1956 max_commits = ctx->opts->max_commits;
1958 if (ctx->opts->size_multiple)
1959 size_mult = ctx->opts->size_multiple;
1961 flags = ctx->opts->split_flags;
1964 g = ctx->r->objects->commit_graph;
1965 num_commits = ctx->commits.nr;
1966 if (flags == COMMIT_GRAPH_SPLIT_REPLACE)
1967 ctx->num_commit_graphs_after = 1;
1969 ctx->num_commit_graphs_after = ctx->num_commit_graphs_before + 1;
1971 if (flags != COMMIT_GRAPH_SPLIT_MERGE_PROHIBITED &&
1972 flags != COMMIT_GRAPH_SPLIT_REPLACE) {
1973 while (g && (g->num_commits <= size_mult * num_commits ||
1974 (max_commits && num_commits > max_commits))) {
1975 if (g->odb != ctx->odb)
1978 num_commits += g->num_commits;
1981 ctx->num_commit_graphs_after--;
1985 if (flags != COMMIT_GRAPH_SPLIT_REPLACE)
1986 ctx->new_base_graph = g;
1987 else if (ctx->num_commit_graphs_after != 1)
1988 BUG("split_graph_merge_strategy: num_commit_graphs_after "
1989 "should be 1 with --split=replace");
1991 if (ctx->num_commit_graphs_after == 2) {
1992 char *old_graph_name = get_commit_graph_filename(g->odb);
1994 if (!strcmp(g->filename, old_graph_name) &&
1995 g->odb != ctx->odb) {
1996 ctx->num_commit_graphs_after = 1;
1997 ctx->new_base_graph = NULL;
2000 free(old_graph_name);
2003 CALLOC_ARRAY(ctx->commit_graph_filenames_after, ctx->num_commit_graphs_after);
2004 CALLOC_ARRAY(ctx->commit_graph_hash_after, ctx->num_commit_graphs_after);
2006 for (i = 0; i < ctx->num_commit_graphs_after &&
2007 i < ctx->num_commit_graphs_before; i++)
2008 ctx->commit_graph_filenames_after[i] = xstrdup(ctx->commit_graph_filenames_before[i]);
2010 i = ctx->num_commit_graphs_before - 1;
2011 g = ctx->r->objects->commit_graph;
2014 if (i < ctx->num_commit_graphs_after)
2015 ctx->commit_graph_hash_after[i] = xstrdup(oid_to_hex(&g->oid));
2018 * If the topmost remaining layer has generation data chunk, the
2019 * resultant layer also has generation data chunk.
2021 if (i == ctx->num_commit_graphs_after - 2)
2022 ctx->write_generation_data = !!g->chunk_generation_data;
2029 static void merge_commit_graph(struct write_commit_graph_context *ctx,
2030 struct commit_graph *g)
2033 uint32_t offset = g->num_commits_in_base;
2035 ALLOC_GROW(ctx->commits.list, ctx->commits.nr + g->num_commits, ctx->commits.alloc);
2037 for (i = 0; i < g->num_commits; i++) {
2038 struct object_id oid;
2039 struct commit *result;
2041 display_progress(ctx->progress, i + 1);
2043 load_oid_from_graph(g, i + offset, &oid);
2045 /* only add commits if they still exist in the repo */
2046 result = lookup_commit_reference_gently(ctx->r, &oid, 1);
2049 ctx->commits.list[ctx->commits.nr] = result;
2055 static int commit_compare(const void *_a, const void *_b)
2057 const struct commit *a = *(const struct commit **)_a;
2058 const struct commit *b = *(const struct commit **)_b;
2059 return oidcmp(&a->object.oid, &b->object.oid);
2062 static void sort_and_scan_merged_commits(struct write_commit_graph_context *ctx)
2064 uint32_t i, dedup_i = 0;
2066 if (ctx->report_progress)
2067 ctx->progress = start_delayed_progress(
2068 _("Scanning merged commits"),
2071 QSORT(ctx->commits.list, ctx->commits.nr, commit_compare);
2073 ctx->num_extra_edges = 0;
2074 for (i = 0; i < ctx->commits.nr; i++) {
2075 display_progress(ctx->progress, i);
2077 if (i && oideq(&ctx->commits.list[i - 1]->object.oid,
2078 &ctx->commits.list[i]->object.oid)) {
2080 * Silently ignore duplicates. These were likely
2081 * created due to a commit appearing in multiple
2082 * layers of the chain, which is unexpected but
2083 * not invalid. We should make sure there is a
2084 * unique copy in the new layer.
2087 unsigned int num_parents;
2089 ctx->commits.list[dedup_i] = ctx->commits.list[i];
2092 num_parents = commit_list_count(ctx->commits.list[i]->parents);
2093 if (num_parents > 2)
2094 ctx->num_extra_edges += num_parents - 1;
2098 ctx->commits.nr = dedup_i;
2100 stop_progress(&ctx->progress);
2103 static void merge_commit_graphs(struct write_commit_graph_context *ctx)
2105 struct commit_graph *g = ctx->r->objects->commit_graph;
2106 uint32_t current_graph_number = ctx->num_commit_graphs_before;
2108 while (g && current_graph_number >= ctx->num_commit_graphs_after) {
2109 current_graph_number--;
2111 if (ctx->report_progress)
2112 ctx->progress = start_delayed_progress(_("Merging commit-graph"), 0);
2114 merge_commit_graph(ctx, g);
2115 stop_progress(&ctx->progress);
2121 ctx->new_base_graph = g;
2122 ctx->new_num_commits_in_base = g->num_commits + g->num_commits_in_base;
2125 if (ctx->new_base_graph)
2126 ctx->base_graph_name = xstrdup(ctx->new_base_graph->filename);
2128 sort_and_scan_merged_commits(ctx);
2131 static void mark_commit_graphs(struct write_commit_graph_context *ctx)
2134 time_t now = time(NULL);
2136 for (i = ctx->num_commit_graphs_after - 1; i < ctx->num_commit_graphs_before; i++) {
2138 struct utimbuf updated_time;
2140 stat(ctx->commit_graph_filenames_before[i], &st);
2142 updated_time.actime = st.st_atime;
2143 updated_time.modtime = now;
2144 utime(ctx->commit_graph_filenames_before[i], &updated_time);
2148 static void expire_commit_graphs(struct write_commit_graph_context *ctx)
2150 struct strbuf path = STRBUF_INIT;
2154 timestamp_t expire_time = time(NULL);
2156 if (ctx->opts && ctx->opts->expire_time)
2157 expire_time = ctx->opts->expire_time;
2159 char *chain_file_name = get_commit_graph_chain_filename(ctx->odb);
2160 unlink(chain_file_name);
2161 free(chain_file_name);
2162 ctx->num_commit_graphs_after = 0;
2165 strbuf_addstr(&path, ctx->odb->path);
2166 strbuf_addstr(&path, "/info/commit-graphs");
2167 dir = opendir(path.buf);
2172 strbuf_addch(&path, '/');
2173 dirnamelen = path.len;
2174 while ((de = readdir(dir)) != NULL) {
2176 uint32_t i, found = 0;
2178 strbuf_setlen(&path, dirnamelen);
2179 strbuf_addstr(&path, de->d_name);
2181 stat(path.buf, &st);
2183 if (st.st_mtime > expire_time)
2185 if (path.len < 6 || strcmp(path.buf + path.len - 6, ".graph"))
2188 for (i = 0; i < ctx->num_commit_graphs_after; i++) {
2189 if (!strcmp(ctx->commit_graph_filenames_after[i],
2201 strbuf_release(&path);
2204 int write_commit_graph(struct object_directory *odb,
2205 struct string_list *pack_indexes,
2206 struct oidset *commits,
2207 enum commit_graph_write_flags flags,
2208 const struct commit_graph_opts *opts)
2210 struct write_commit_graph_context *ctx;
2214 struct bloom_filter_settings bloom_settings = DEFAULT_BLOOM_FILTER_SETTINGS;
2215 struct topo_level_slab topo_levels;
2217 prepare_repo_settings(the_repository);
2218 if (!the_repository->settings.core_commit_graph) {
2219 warning(_("attempting to write a commit-graph, but 'core.commitGraph' is disabled"));
2222 if (!commit_graph_compatible(the_repository))
2225 ctx = xcalloc(1, sizeof(struct write_commit_graph_context));
2226 ctx->r = the_repository;
2228 ctx->append = flags & COMMIT_GRAPH_WRITE_APPEND ? 1 : 0;
2229 ctx->report_progress = flags & COMMIT_GRAPH_WRITE_PROGRESS ? 1 : 0;
2230 ctx->split = flags & COMMIT_GRAPH_WRITE_SPLIT ? 1 : 0;
2232 ctx->total_bloom_filter_data_size = 0;
2233 ctx->write_generation_data = 1;
2234 ctx->num_generation_data_overflows = 0;
2236 bloom_settings.bits_per_entry = git_env_ulong("GIT_TEST_BLOOM_SETTINGS_BITS_PER_ENTRY",
2237 bloom_settings.bits_per_entry);
2238 bloom_settings.num_hashes = git_env_ulong("GIT_TEST_BLOOM_SETTINGS_NUM_HASHES",
2239 bloom_settings.num_hashes);
2240 bloom_settings.max_changed_paths = git_env_ulong("GIT_TEST_BLOOM_SETTINGS_MAX_CHANGED_PATHS",
2241 bloom_settings.max_changed_paths);
2242 ctx->bloom_settings = &bloom_settings;
2244 init_topo_level_slab(&topo_levels);
2245 ctx->topo_levels = &topo_levels;
2247 if (ctx->r->objects->commit_graph) {
2248 struct commit_graph *g = ctx->r->objects->commit_graph;
2251 g->topo_levels = &topo_levels;
2256 if (flags & COMMIT_GRAPH_WRITE_BLOOM_FILTERS)
2257 ctx->changed_paths = 1;
2258 if (!(flags & COMMIT_GRAPH_NO_WRITE_BLOOM_FILTERS)) {
2259 struct commit_graph *g;
2260 prepare_commit_graph_one(ctx->r, ctx->odb);
2262 g = ctx->r->objects->commit_graph;
2264 /* We have changed-paths already. Keep them in the next graph */
2265 if (g && g->chunk_bloom_data) {
2266 ctx->changed_paths = 1;
2267 ctx->bloom_settings = g->bloom_filter_settings;
2272 struct commit_graph *g;
2273 prepare_commit_graph(ctx->r);
2275 g = ctx->r->objects->commit_graph;
2278 ctx->num_commit_graphs_before++;
2282 if (ctx->num_commit_graphs_before) {
2283 ALLOC_ARRAY(ctx->commit_graph_filenames_before, ctx->num_commit_graphs_before);
2284 i = ctx->num_commit_graphs_before;
2285 g = ctx->r->objects->commit_graph;
2288 ctx->commit_graph_filenames_before[--i] = xstrdup(g->filename);
2294 replace = ctx->opts->split_flags & COMMIT_GRAPH_SPLIT_REPLACE;
2297 ctx->approx_nr_objects = approximate_object_count();
2300 prepare_commit_graph_one(ctx->r, ctx->odb);
2302 if (ctx->append && ctx->r->objects->commit_graph) {
2303 struct commit_graph *g = ctx->r->objects->commit_graph;
2304 for (i = 0; i < g->num_commits; i++) {
2305 struct object_id oid;
2306 hashcpy(oid.hash, g->chunk_oid_lookup + g->hash_len * i);
2307 oid_array_append(&ctx->oids, &oid);
2312 ctx->order_by_pack = 1;
2313 if ((res = fill_oids_from_packs(ctx, pack_indexes)))
2318 if ((res = fill_oids_from_commits(ctx, commits)))
2322 if (!pack_indexes && !commits) {
2323 ctx->order_by_pack = 1;
2324 fill_oids_from_all_packs(ctx);
2327 close_reachable(ctx);
2329 copy_oids_to_commits(ctx);
2331 if (ctx->commits.nr >= GRAPH_EDGE_LAST_MASK) {
2332 error(_("too many commits to write graph"));
2337 if (!ctx->commits.nr && !replace)
2341 split_graph_merge_strategy(ctx);
2344 merge_commit_graphs(ctx);
2346 ctx->num_commit_graphs_after = 1;
2348 validate_mixed_generation_chain(ctx->r->objects->commit_graph);
2350 compute_generation_numbers(ctx);
2352 if (ctx->changed_paths)
2353 compute_bloom_filters(ctx);
2355 res = write_commit_graph_file(ctx);
2358 mark_commit_graphs(ctx);
2360 expire_commit_graphs(ctx);
2363 free(ctx->graph_name);
2364 free(ctx->commits.list);
2365 oid_array_clear(&ctx->oids);
2367 if (ctx->commit_graph_filenames_after) {
2368 for (i = 0; i < ctx->num_commit_graphs_after; i++) {
2369 free(ctx->commit_graph_filenames_after[i]);
2370 free(ctx->commit_graph_hash_after[i]);
2373 for (i = 0; i < ctx->num_commit_graphs_before; i++)
2374 free(ctx->commit_graph_filenames_before[i]);
2376 free(ctx->commit_graph_filenames_after);
2377 free(ctx->commit_graph_filenames_before);
2378 free(ctx->commit_graph_hash_after);
2386 #define VERIFY_COMMIT_GRAPH_ERROR_HASH 2
2387 static int verify_commit_graph_error;
2389 static void graph_report(const char *fmt, ...)
2393 verify_commit_graph_error = 1;
2395 vfprintf(stderr, fmt, ap);
2396 fprintf(stderr, "\n");
2400 #define GENERATION_ZERO_EXISTS 1
2401 #define GENERATION_NUMBER_EXISTS 2
2403 int verify_commit_graph(struct repository *r, struct commit_graph *g, int flags)
2405 uint32_t i, cur_fanout_pos = 0;
2406 struct object_id prev_oid, cur_oid, checksum;
2407 int generation_zero = 0;
2410 struct progress *progress = NULL;
2411 int local_error = 0;
2414 graph_report("no commit-graph file loaded");
2418 verify_commit_graph_error = verify_commit_graph_lite(g);
2419 if (verify_commit_graph_error)
2420 return verify_commit_graph_error;
2422 devnull = open("/dev/null", O_WRONLY);
2423 f = hashfd(devnull, NULL);
2424 hashwrite(f, g->data, g->data_len - g->hash_len);
2425 finalize_hashfile(f, checksum.hash, CSUM_CLOSE);
2426 if (!hasheq(checksum.hash, g->data + g->data_len - g->hash_len)) {
2427 graph_report(_("the commit-graph file has incorrect checksum and is likely corrupt"));
2428 verify_commit_graph_error = VERIFY_COMMIT_GRAPH_ERROR_HASH;
2431 for (i = 0; i < g->num_commits; i++) {
2432 struct commit *graph_commit;
2434 hashcpy(cur_oid.hash, g->chunk_oid_lookup + g->hash_len * i);
2436 if (i && oidcmp(&prev_oid, &cur_oid) >= 0)
2437 graph_report(_("commit-graph has incorrect OID order: %s then %s"),
2438 oid_to_hex(&prev_oid),
2439 oid_to_hex(&cur_oid));
2441 oidcpy(&prev_oid, &cur_oid);
2443 while (cur_oid.hash[0] > cur_fanout_pos) {
2444 uint32_t fanout_value = get_be32(g->chunk_oid_fanout + cur_fanout_pos);
2446 if (i != fanout_value)
2447 graph_report(_("commit-graph has incorrect fanout value: fanout[%d] = %u != %u"),
2448 cur_fanout_pos, fanout_value, i);
2452 graph_commit = lookup_commit(r, &cur_oid);
2453 if (!parse_commit_in_graph_one(r, g, graph_commit))
2454 graph_report(_("failed to parse commit %s from commit-graph"),
2455 oid_to_hex(&cur_oid));
2458 while (cur_fanout_pos < 256) {
2459 uint32_t fanout_value = get_be32(g->chunk_oid_fanout + cur_fanout_pos);
2461 if (g->num_commits != fanout_value)
2462 graph_report(_("commit-graph has incorrect fanout value: fanout[%d] = %u != %u"),
2463 cur_fanout_pos, fanout_value, i);
2468 if (verify_commit_graph_error & ~VERIFY_COMMIT_GRAPH_ERROR_HASH)
2469 return verify_commit_graph_error;
2471 if (flags & COMMIT_GRAPH_WRITE_PROGRESS)
2472 progress = start_progress(_("Verifying commits in commit graph"),
2475 for (i = 0; i < g->num_commits; i++) {
2476 struct commit *graph_commit, *odb_commit;
2477 struct commit_list *graph_parents, *odb_parents;
2478 timestamp_t max_generation = 0;
2479 timestamp_t generation;
2481 display_progress(progress, i + 1);
2482 hashcpy(cur_oid.hash, g->chunk_oid_lookup + g->hash_len * i);
2484 graph_commit = lookup_commit(r, &cur_oid);
2485 odb_commit = (struct commit *)create_object(r, &cur_oid, alloc_commit_node(r));
2486 if (parse_commit_internal(odb_commit, 0, 0)) {
2487 graph_report(_("failed to parse commit %s from object database for commit-graph"),
2488 oid_to_hex(&cur_oid));
2492 if (!oideq(&get_commit_tree_in_graph_one(r, g, graph_commit)->object.oid,
2493 get_commit_tree_oid(odb_commit)))
2494 graph_report(_("root tree OID for commit %s in commit-graph is %s != %s"),
2495 oid_to_hex(&cur_oid),
2496 oid_to_hex(get_commit_tree_oid(graph_commit)),
2497 oid_to_hex(get_commit_tree_oid(odb_commit)));
2499 graph_parents = graph_commit->parents;
2500 odb_parents = odb_commit->parents;
2502 while (graph_parents) {
2503 if (odb_parents == NULL) {
2504 graph_report(_("commit-graph parent list for commit %s is too long"),
2505 oid_to_hex(&cur_oid));
2509 /* parse parent in case it is in a base graph */
2510 parse_commit_in_graph_one(r, g, graph_parents->item);
2512 if (!oideq(&graph_parents->item->object.oid, &odb_parents->item->object.oid))
2513 graph_report(_("commit-graph parent for %s is %s != %s"),
2514 oid_to_hex(&cur_oid),
2515 oid_to_hex(&graph_parents->item->object.oid),
2516 oid_to_hex(&odb_parents->item->object.oid));
2518 generation = commit_graph_generation(graph_parents->item);
2519 if (generation > max_generation)
2520 max_generation = generation;
2522 graph_parents = graph_parents->next;
2523 odb_parents = odb_parents->next;
2526 if (odb_parents != NULL)
2527 graph_report(_("commit-graph parent list for commit %s terminates early"),
2528 oid_to_hex(&cur_oid));
2530 if (!commit_graph_generation(graph_commit)) {
2531 if (generation_zero == GENERATION_NUMBER_EXISTS)
2532 graph_report(_("commit-graph has generation number zero for commit %s, but non-zero elsewhere"),
2533 oid_to_hex(&cur_oid));
2534 generation_zero = GENERATION_ZERO_EXISTS;
2535 } else if (generation_zero == GENERATION_ZERO_EXISTS)
2536 graph_report(_("commit-graph has non-zero generation number for commit %s, but zero elsewhere"),
2537 oid_to_hex(&cur_oid));
2539 if (generation_zero == GENERATION_ZERO_EXISTS)
2543 * If we are using topological level and one of our parents has
2544 * generation GENERATION_NUMBER_V1_MAX, then our generation is
2545 * also GENERATION_NUMBER_V1_MAX. Decrement to avoid extra logic
2546 * in the following condition.
2548 if (!g->read_generation_data && max_generation == GENERATION_NUMBER_V1_MAX)
2551 generation = commit_graph_generation(graph_commit);
2552 if (generation < max_generation + 1)
2553 graph_report(_("commit-graph generation for commit %s is %"PRItime" < %"PRItime),
2554 oid_to_hex(&cur_oid),
2556 max_generation + 1);
2558 if (graph_commit->date != odb_commit->date)
2559 graph_report(_("commit date for commit %s in commit-graph is %"PRItime" != %"PRItime),
2560 oid_to_hex(&cur_oid),
2564 stop_progress(&progress);
2566 local_error = verify_commit_graph_error;
2568 if (!(flags & COMMIT_GRAPH_VERIFY_SHALLOW) && g->base_graph)
2569 local_error |= verify_commit_graph(r, g->base_graph, flags);
2574 void free_commit_graph(struct commit_graph *g)
2579 munmap((void *)g->data, g->data_len);
2583 free(g->bloom_filter_settings);
2587 void disable_commit_graph(struct repository *r)
2589 r->commit_graph_disabled = 1;