4 #include "git-compat-util.h"
12 #include "sha1-lookup.h"
13 #include "commit-graph.h"
14 #include "object-store.h"
17 #include "replace-object.h"
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" */
24 #define GRAPH_CHUNKID_EXTRAEDGES 0x45444745 /* "EDGE" */
25 #define GRAPH_CHUNKID_BASE 0x42415345 /* "BASE" */
27 #define GRAPH_DATA_WIDTH (the_hash_algo->rawsz + 16)
29 #define GRAPH_VERSION_1 0x1
30 #define GRAPH_VERSION GRAPH_VERSION_1
32 #define GRAPH_EXTRA_EDGES_NEEDED 0x80000000
33 #define GRAPH_EDGE_LAST_MASK 0x7fffffff
34 #define GRAPH_PARENT_NONE 0x70000000
36 #define GRAPH_LAST_EDGE 0x80000000
38 #define GRAPH_HEADER_SIZE 8
39 #define GRAPH_FANOUT_SIZE (4 * 256)
40 #define GRAPH_CHUNKLOOKUP_WIDTH 12
41 #define GRAPH_MIN_SIZE (GRAPH_HEADER_SIZE + 4 * GRAPH_CHUNKLOOKUP_WIDTH \
42 + GRAPH_FANOUT_SIZE + the_hash_algo->rawsz)
44 char *get_commit_graph_filename(const char *obj_dir)
46 char *filename = xstrfmt("%s/info/commit-graph", obj_dir);
47 char *normalized = xmalloc(strlen(filename) + 1);
48 normalize_path_copy(normalized, filename);
53 static char *get_split_graph_filename(const char *obj_dir,
56 char *filename = xstrfmt("%s/info/commit-graphs/graph-%s.graph",
59 char *normalized = xmalloc(strlen(filename) + 1);
60 normalize_path_copy(normalized, filename);
65 static char *get_chain_filename(const char *obj_dir)
67 return xstrfmt("%s/info/commit-graphs/commit-graph-chain", obj_dir);
70 static uint8_t oid_version(void)
75 static struct commit_graph *alloc_commit_graph(void)
77 struct commit_graph *g = xcalloc(1, sizeof(*g));
83 extern int read_replace_refs;
85 static int commit_graph_compatible(struct repository *r)
90 if (read_replace_refs) {
91 prepare_replace_object(r);
92 if (hashmap_get_size(&r->objects->replace_map->map))
96 prepare_commit_graft(r);
97 if (r->parsed_objects && r->parsed_objects->grafts_nr)
99 if (is_repository_shallow(r))
105 int open_commit_graph(const char *graph_file, int *fd, struct stat *st)
107 *fd = git_open(graph_file);
110 if (fstat(*fd, st)) {
117 struct commit_graph *load_commit_graph_one_fd_st(int fd, struct stat *st)
121 struct commit_graph *ret;
123 graph_size = xsize_t(st->st_size);
125 if (graph_size < GRAPH_MIN_SIZE) {
127 error(_("commit-graph file is too small"));
130 graph_map = xmmap(NULL, graph_size, PROT_READ, MAP_PRIVATE, fd, 0);
131 ret = parse_commit_graph(graph_map, fd, graph_size);
134 munmap(graph_map, graph_size);
141 static int verify_commit_graph_lite(struct commit_graph *g)
144 * Basic validation shared between parse_commit_graph()
145 * which'll be called every time the graph is used, and the
146 * much more expensive verify_commit_graph() used by
147 * "commit-graph verify".
149 * There should only be very basic checks here to ensure that
150 * we don't e.g. segfault in fill_commit_in_graph(), but
151 * because this is a very hot codepath nothing that e.g. loops
152 * over g->num_commits, or runs a checksum on the commit-graph
155 if (!g->chunk_oid_fanout) {
156 error("commit-graph is missing the OID Fanout chunk");
159 if (!g->chunk_oid_lookup) {
160 error("commit-graph is missing the OID Lookup chunk");
163 if (!g->chunk_commit_data) {
164 error("commit-graph is missing the Commit Data chunk");
171 struct commit_graph *parse_commit_graph(void *graph_map, int fd,
174 const unsigned char *data, *chunk_lookup;
176 struct commit_graph *graph;
177 uint64_t last_chunk_offset;
178 uint32_t last_chunk_id;
179 uint32_t graph_signature;
180 unsigned char graph_version, hash_version;
185 if (graph_size < GRAPH_MIN_SIZE)
188 data = (const unsigned char *)graph_map;
190 graph_signature = get_be32(data);
191 if (graph_signature != GRAPH_SIGNATURE) {
192 error(_("commit-graph signature %X does not match signature %X"),
193 graph_signature, GRAPH_SIGNATURE);
197 graph_version = *(unsigned char*)(data + 4);
198 if (graph_version != GRAPH_VERSION) {
199 error(_("commit-graph version %X does not match version %X"),
200 graph_version, GRAPH_VERSION);
204 hash_version = *(unsigned char*)(data + 5);
205 if (hash_version != oid_version()) {
206 error(_("commit-graph hash version %X does not match version %X"),
207 hash_version, oid_version());
211 graph = alloc_commit_graph();
213 graph->hash_len = the_hash_algo->rawsz;
214 graph->num_chunks = *(unsigned char*)(data + 6);
215 graph->graph_fd = fd;
216 graph->data = graph_map;
217 graph->data_len = graph_size;
220 last_chunk_offset = 8;
221 chunk_lookup = data + 8;
222 for (i = 0; i < graph->num_chunks; i++) {
224 uint64_t chunk_offset;
225 int chunk_repeated = 0;
227 if (data + graph_size - chunk_lookup <
228 GRAPH_CHUNKLOOKUP_WIDTH) {
229 error(_("commit-graph chunk lookup table entry missing; file may be incomplete"));
234 chunk_id = get_be32(chunk_lookup + 0);
235 chunk_offset = get_be64(chunk_lookup + 4);
237 chunk_lookup += GRAPH_CHUNKLOOKUP_WIDTH;
239 if (chunk_offset > graph_size - the_hash_algo->rawsz) {
240 error(_("commit-graph improper chunk offset %08x%08x"), (uint32_t)(chunk_offset >> 32),
241 (uint32_t)chunk_offset);
247 case GRAPH_CHUNKID_OIDFANOUT:
248 if (graph->chunk_oid_fanout)
251 graph->chunk_oid_fanout = (uint32_t*)(data + chunk_offset);
254 case GRAPH_CHUNKID_OIDLOOKUP:
255 if (graph->chunk_oid_lookup)
258 graph->chunk_oid_lookup = data + chunk_offset;
261 case GRAPH_CHUNKID_DATA:
262 if (graph->chunk_commit_data)
265 graph->chunk_commit_data = data + chunk_offset;
268 case GRAPH_CHUNKID_EXTRAEDGES:
269 if (graph->chunk_extra_edges)
272 graph->chunk_extra_edges = data + chunk_offset;
275 case GRAPH_CHUNKID_BASE:
276 if (graph->chunk_base_graphs)
279 graph->chunk_base_graphs = data + chunk_offset;
282 if (chunk_repeated) {
283 error(_("commit-graph chunk id %08x appears multiple times"), chunk_id);
288 if (last_chunk_id == GRAPH_CHUNKID_OIDLOOKUP)
290 graph->num_commits = (chunk_offset - last_chunk_offset)
294 last_chunk_id = chunk_id;
295 last_chunk_offset = chunk_offset;
298 hashcpy(graph->oid.hash, graph->data + graph->data_len - graph->hash_len);
300 if (verify_commit_graph_lite(graph))
306 static struct commit_graph *load_commit_graph_one(const char *graph_file)
311 struct commit_graph *g;
312 int open_ok = open_commit_graph(graph_file, &fd, &st);
317 g = load_commit_graph_one_fd_st(fd, &st);
320 g->filename = xstrdup(graph_file);
325 static struct commit_graph *load_commit_graph_v1(struct repository *r, const char *obj_dir)
327 char *graph_name = get_commit_graph_filename(obj_dir);
328 struct commit_graph *g = load_commit_graph_one(graph_name);
332 g->obj_dir = obj_dir;
337 static int add_graph_to_chain(struct commit_graph *g,
338 struct commit_graph *chain,
339 struct object_id *oids,
342 struct commit_graph *cur_g = chain;
344 if (n && !g->chunk_base_graphs) {
345 warning(_("commit-graph has no base graphs chunk"));
353 !oideq(&oids[n], &cur_g->oid) ||
354 !hasheq(oids[n].hash, g->chunk_base_graphs + g->hash_len * n)) {
355 warning(_("commit-graph chain does not match"));
359 cur_g = cur_g->base_graph;
362 g->base_graph = chain;
365 g->num_commits_in_base = chain->num_commits + chain->num_commits_in_base;
370 static struct commit_graph *load_commit_graph_chain(struct repository *r, const char *obj_dir)
372 struct commit_graph *graph_chain = NULL;
373 struct strbuf line = STRBUF_INIT;
375 struct object_id *oids;
376 int i = 0, valid = 1, count;
377 char *chain_name = get_chain_filename(obj_dir);
381 fp = fopen(chain_name, "r");
382 stat_res = stat(chain_name, &st);
387 st.st_size <= the_hash_algo->hexsz)
390 count = st.st_size / (the_hash_algo->hexsz + 1);
391 oids = xcalloc(count, sizeof(struct object_id));
395 for (i = 0; i < count; i++) {
396 struct object_directory *odb;
398 if (strbuf_getline_lf(&line, fp) == EOF)
401 if (get_oid_hex(line.buf, &oids[i])) {
402 warning(_("invalid commit-graph chain: line '%s' not a hash"),
409 for (odb = r->objects->odb; odb; odb = odb->next) {
410 char *graph_name = get_split_graph_filename(odb->path, line.buf);
411 struct commit_graph *g = load_commit_graph_one(graph_name);
416 g->obj_dir = odb->path;
418 if (add_graph_to_chain(g, graph_chain, oids, i)) {
428 warning(_("unable to find all commit-graph files"));
439 struct commit_graph *read_commit_graph_one(struct repository *r, const char *obj_dir)
441 struct commit_graph *g = load_commit_graph_v1(r, obj_dir);
444 g = load_commit_graph_chain(r, obj_dir);
449 static void prepare_commit_graph_one(struct repository *r, const char *obj_dir)
452 if (r->objects->commit_graph)
455 r->objects->commit_graph = read_commit_graph_one(r, obj_dir);
459 * Return 1 if commit_graph is non-NULL, and 0 otherwise.
461 * On the first invocation, this function attemps to load the commit
462 * graph if the_repository is configured to have one.
464 static int prepare_commit_graph(struct repository *r)
466 struct object_directory *odb;
469 if (git_env_bool(GIT_TEST_COMMIT_GRAPH_DIE_ON_LOAD, 0))
470 die("dying as requested by the '%s' variable on commit-graph load!",
471 GIT_TEST_COMMIT_GRAPH_DIE_ON_LOAD);
473 if (r->objects->commit_graph_attempted)
474 return !!r->objects->commit_graph;
475 r->objects->commit_graph_attempted = 1;
477 if (!git_env_bool(GIT_TEST_COMMIT_GRAPH, 0) &&
478 (repo_config_get_bool(r, "core.commitgraph", &config_value) ||
481 * This repository is not configured to use commit graphs, so
482 * do not load one. (But report commit_graph_attempted anyway
483 * so that commit graph loading is not attempted again for this
488 if (!commit_graph_compatible(r))
492 for (odb = r->objects->odb;
493 !r->objects->commit_graph && odb;
495 prepare_commit_graph_one(r, odb->path);
496 return !!r->objects->commit_graph;
499 int generation_numbers_enabled(struct repository *r)
501 uint32_t first_generation;
502 struct commit_graph *g;
503 if (!prepare_commit_graph(r))
506 g = r->objects->commit_graph;
511 first_generation = get_be32(g->chunk_commit_data +
512 g->hash_len + 8) >> 2;
514 return !!first_generation;
517 static void close_commit_graph_one(struct commit_graph *g)
522 close_commit_graph_one(g->base_graph);
523 free_commit_graph(g);
526 void close_commit_graph(struct raw_object_store *o)
528 close_commit_graph_one(o->commit_graph);
529 o->commit_graph = NULL;
532 static int bsearch_graph(struct commit_graph *g, struct object_id *oid, uint32_t *pos)
534 return bsearch_hash(oid->hash, g->chunk_oid_fanout,
535 g->chunk_oid_lookup, g->hash_len, pos);
538 static void load_oid_from_graph(struct commit_graph *g,
540 struct object_id *oid)
544 while (g && pos < g->num_commits_in_base)
548 BUG("NULL commit-graph");
550 if (pos >= g->num_commits + g->num_commits_in_base)
551 die(_("invalid commit position. commit-graph is likely corrupt"));
553 lex_index = pos - g->num_commits_in_base;
555 hashcpy(oid->hash, g->chunk_oid_lookup + g->hash_len * lex_index);
558 static struct commit_list **insert_parent_or_die(struct repository *r,
559 struct commit_graph *g,
561 struct commit_list **pptr)
564 struct object_id oid;
566 if (pos >= g->num_commits + g->num_commits_in_base)
567 die("invalid parent position %"PRIu32, pos);
569 load_oid_from_graph(g, pos, &oid);
570 c = lookup_commit(r, &oid);
572 die(_("could not find commit %s"), oid_to_hex(&oid));
574 return &commit_list_insert(c, pptr)->next;
577 static void fill_commit_graph_info(struct commit *item, struct commit_graph *g, uint32_t pos)
579 const unsigned char *commit_data;
582 while (pos < g->num_commits_in_base)
585 lex_index = pos - g->num_commits_in_base;
586 commit_data = g->chunk_commit_data + GRAPH_DATA_WIDTH * lex_index;
587 item->graph_pos = pos;
588 item->generation = get_be32(commit_data + g->hash_len + 8) >> 2;
591 static int fill_commit_in_graph(struct repository *r,
593 struct commit_graph *g, uint32_t pos)
596 uint32_t *parent_data_ptr;
597 uint64_t date_low, date_high;
598 struct commit_list **pptr;
599 const unsigned char *commit_data;
602 while (pos < g->num_commits_in_base)
605 if (pos >= g->num_commits + g->num_commits_in_base)
606 die(_("invalid commit position. commit-graph is likely corrupt"));
609 * Store the "full" position, but then use the
610 * "local" position for the rest of the calculation.
612 item->graph_pos = pos;
613 lex_index = pos - g->num_commits_in_base;
615 commit_data = g->chunk_commit_data + (g->hash_len + 16) * lex_index;
617 item->object.parsed = 1;
619 item->maybe_tree = NULL;
621 date_high = get_be32(commit_data + g->hash_len + 8) & 0x3;
622 date_low = get_be32(commit_data + g->hash_len + 12);
623 item->date = (timestamp_t)((date_high << 32) | date_low);
625 item->generation = get_be32(commit_data + g->hash_len + 8) >> 2;
627 pptr = &item->parents;
629 edge_value = get_be32(commit_data + g->hash_len);
630 if (edge_value == GRAPH_PARENT_NONE)
632 pptr = insert_parent_or_die(r, g, edge_value, pptr);
634 edge_value = get_be32(commit_data + g->hash_len + 4);
635 if (edge_value == GRAPH_PARENT_NONE)
637 if (!(edge_value & GRAPH_EXTRA_EDGES_NEEDED)) {
638 pptr = insert_parent_or_die(r, g, edge_value, pptr);
642 parent_data_ptr = (uint32_t*)(g->chunk_extra_edges +
643 4 * (uint64_t)(edge_value & GRAPH_EDGE_LAST_MASK));
645 edge_value = get_be32(parent_data_ptr);
646 pptr = insert_parent_or_die(r, g,
647 edge_value & GRAPH_EDGE_LAST_MASK,
650 } while (!(edge_value & GRAPH_LAST_EDGE));
655 static int find_commit_in_graph(struct commit *item, struct commit_graph *g, uint32_t *pos)
657 if (item->graph_pos != COMMIT_NOT_FROM_GRAPH) {
658 *pos = item->graph_pos;
661 struct commit_graph *cur_g = g;
664 while (cur_g && !bsearch_graph(cur_g, &(item->object.oid), &lex_index))
665 cur_g = cur_g->base_graph;
668 *pos = lex_index + cur_g->num_commits_in_base;
676 static int parse_commit_in_graph_one(struct repository *r,
677 struct commit_graph *g,
682 if (item->object.parsed)
685 if (find_commit_in_graph(item, g, &pos))
686 return fill_commit_in_graph(r, item, g, pos);
691 int parse_commit_in_graph(struct repository *r, struct commit *item)
693 if (!prepare_commit_graph(r))
695 return parse_commit_in_graph_one(r, r->objects->commit_graph, item);
698 void load_commit_graph_info(struct repository *r, struct commit *item)
701 if (!prepare_commit_graph(r))
703 if (find_commit_in_graph(item, r->objects->commit_graph, &pos))
704 fill_commit_graph_info(item, r->objects->commit_graph, pos);
707 static struct tree *load_tree_for_commit(struct repository *r,
708 struct commit_graph *g,
711 struct object_id oid;
712 const unsigned char *commit_data;
714 while (c->graph_pos < g->num_commits_in_base)
717 commit_data = g->chunk_commit_data +
718 GRAPH_DATA_WIDTH * (c->graph_pos - g->num_commits_in_base);
720 hashcpy(oid.hash, commit_data);
721 c->maybe_tree = lookup_tree(r, &oid);
723 return c->maybe_tree;
726 static struct tree *get_commit_tree_in_graph_one(struct repository *r,
727 struct commit_graph *g,
728 const struct commit *c)
731 return c->maybe_tree;
732 if (c->graph_pos == COMMIT_NOT_FROM_GRAPH)
733 BUG("get_commit_tree_in_graph_one called from non-commit-graph commit");
735 return load_tree_for_commit(r, g, (struct commit *)c);
738 struct tree *get_commit_tree_in_graph(struct repository *r, const struct commit *c)
740 return get_commit_tree_in_graph_one(r, r->objects->commit_graph, c);
743 struct packed_commit_list {
744 struct commit **list;
749 struct packed_oid_list {
750 struct object_id *list;
755 struct write_commit_graph_context {
756 struct repository *r;
759 struct packed_oid_list oids;
760 struct packed_commit_list commits;
762 unsigned long approx_nr_objects;
763 struct progress *progress;
765 uint64_t progress_cnt;
767 char *base_graph_name;
768 int num_commit_graphs_before;
769 int num_commit_graphs_after;
770 char **commit_graph_filenames_before;
771 char **commit_graph_filenames_after;
772 char **commit_graph_hash_after;
773 uint32_t new_num_commits_in_base;
774 struct commit_graph *new_base_graph;
780 const struct split_commit_graph_opts *split_opts;
783 static void write_graph_chunk_fanout(struct hashfile *f,
784 struct write_commit_graph_context *ctx)
787 struct commit **list = ctx->commits.list;
790 * Write the first-level table (the list is sorted,
791 * but we use a 256-entry lookup to be able to avoid
792 * having to do eight extra binary search iterations).
794 for (i = 0; i < 256; i++) {
795 while (count < ctx->commits.nr) {
796 if ((*list)->object.oid.hash[0] != i)
798 display_progress(ctx->progress, ++ctx->progress_cnt);
803 hashwrite_be32(f, count);
807 static void write_graph_chunk_oids(struct hashfile *f, int hash_len,
808 struct write_commit_graph_context *ctx)
810 struct commit **list = ctx->commits.list;
812 for (count = 0; count < ctx->commits.nr; count++, list++) {
813 display_progress(ctx->progress, ++ctx->progress_cnt);
814 hashwrite(f, (*list)->object.oid.hash, (int)hash_len);
818 static const unsigned char *commit_to_sha1(size_t index, void *table)
820 struct commit **commits = table;
821 return commits[index]->object.oid.hash;
824 static void write_graph_chunk_data(struct hashfile *f, int hash_len,
825 struct write_commit_graph_context *ctx)
827 struct commit **list = ctx->commits.list;
828 struct commit **last = ctx->commits.list + ctx->commits.nr;
829 uint32_t num_extra_edges = 0;
831 while (list < last) {
832 struct commit_list *parent;
834 uint32_t packedDate[2];
835 display_progress(ctx->progress, ++ctx->progress_cnt);
837 parse_commit_no_graph(*list);
838 hashwrite(f, get_commit_tree_oid(*list)->hash, hash_len);
840 parent = (*list)->parents;
843 edge_value = GRAPH_PARENT_NONE;
845 edge_value = sha1_pos(parent->item->object.oid.hash,
851 edge_value += ctx->new_num_commits_in_base;
854 if (find_commit_in_graph(parent->item,
861 BUG("missing parent %s for commit %s",
862 oid_to_hex(&parent->item->object.oid),
863 oid_to_hex(&(*list)->object.oid));
866 hashwrite_be32(f, edge_value);
869 parent = parent->next;
872 edge_value = GRAPH_PARENT_NONE;
873 else if (parent->next)
874 edge_value = GRAPH_EXTRA_EDGES_NEEDED | num_extra_edges;
876 edge_value = sha1_pos(parent->item->object.oid.hash,
882 edge_value += ctx->new_num_commits_in_base;
885 if (find_commit_in_graph(parent->item,
892 BUG("missing parent %s for commit %s",
893 oid_to_hex(&parent->item->object.oid),
894 oid_to_hex(&(*list)->object.oid));
897 hashwrite_be32(f, edge_value);
899 if (edge_value & GRAPH_EXTRA_EDGES_NEEDED) {
902 parent = parent->next;
906 if (sizeof((*list)->date) > 4)
907 packedDate[0] = htonl(((*list)->date >> 32) & 0x3);
911 packedDate[0] |= htonl((*list)->generation << 2);
913 packedDate[1] = htonl((*list)->date);
914 hashwrite(f, packedDate, 8);
920 static void write_graph_chunk_extra_edges(struct hashfile *f,
921 struct write_commit_graph_context *ctx)
923 struct commit **list = ctx->commits.list;
924 struct commit **last = ctx->commits.list + ctx->commits.nr;
925 struct commit_list *parent;
927 while (list < last) {
930 display_progress(ctx->progress, ++ctx->progress_cnt);
932 for (parent = (*list)->parents; num_parents < 3 && parent;
933 parent = parent->next)
936 if (num_parents <= 2) {
941 /* Since num_parents > 2, this initializer is safe. */
942 for (parent = (*list)->parents->next; parent; parent = parent->next) {
943 int edge_value = sha1_pos(parent->item->object.oid.hash,
949 edge_value += ctx->new_num_commits_in_base;
952 if (find_commit_in_graph(parent->item,
959 BUG("missing parent %s for commit %s",
960 oid_to_hex(&parent->item->object.oid),
961 oid_to_hex(&(*list)->object.oid));
962 else if (!parent->next)
963 edge_value |= GRAPH_LAST_EDGE;
965 hashwrite_be32(f, edge_value);
972 static int oid_compare(const void *_a, const void *_b)
974 const struct object_id *a = (const struct object_id *)_a;
975 const struct object_id *b = (const struct object_id *)_b;
979 static int add_packed_commits(const struct object_id *oid,
980 struct packed_git *pack,
984 struct write_commit_graph_context *ctx = (struct write_commit_graph_context*)data;
985 enum object_type type;
986 off_t offset = nth_packed_object_offset(pack, pos);
987 struct object_info oi = OBJECT_INFO_INIT;
990 display_progress(ctx->progress, ++ctx->progress_done);
993 if (packed_object_info(ctx->r, pack, offset, &oi) < 0)
994 die(_("unable to get type of object %s"), oid_to_hex(oid));
996 if (type != OBJ_COMMIT)
999 ALLOC_GROW(ctx->oids.list, ctx->oids.nr + 1, ctx->oids.alloc);
1000 oidcpy(&(ctx->oids.list[ctx->oids.nr]), oid);
1006 static void add_missing_parents(struct write_commit_graph_context *ctx, struct commit *commit)
1008 struct commit_list *parent;
1009 for (parent = commit->parents; parent; parent = parent->next) {
1010 if (!(parent->item->object.flags & UNINTERESTING)) {
1011 ALLOC_GROW(ctx->oids.list, ctx->oids.nr + 1, ctx->oids.alloc);
1012 oidcpy(&ctx->oids.list[ctx->oids.nr], &(parent->item->object.oid));
1014 parent->item->object.flags |= UNINTERESTING;
1019 static void close_reachable(struct write_commit_graph_context *ctx)
1022 struct commit *commit;
1024 if (ctx->report_progress)
1025 ctx->progress = start_delayed_progress(
1026 _("Loading known commits in commit graph"),
1028 for (i = 0; i < ctx->oids.nr; i++) {
1029 display_progress(ctx->progress, i + 1);
1030 commit = lookup_commit(ctx->r, &ctx->oids.list[i]);
1032 commit->object.flags |= UNINTERESTING;
1034 stop_progress(&ctx->progress);
1037 * As this loop runs, ctx->oids.nr may grow, but not more
1038 * than the number of missing commits in the reachable
1041 if (ctx->report_progress)
1042 ctx->progress = start_delayed_progress(
1043 _("Expanding reachable commits in commit graph"),
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]);
1052 if (!parse_commit(commit) &&
1053 commit->graph_pos == COMMIT_NOT_FROM_GRAPH)
1054 add_missing_parents(ctx, commit);
1055 } else if (!parse_commit_no_graph(commit))
1056 add_missing_parents(ctx, commit);
1058 stop_progress(&ctx->progress);
1060 if (ctx->report_progress)
1061 ctx->progress = start_delayed_progress(
1062 _("Clearing commit marks in commit graph"),
1064 for (i = 0; i < ctx->oids.nr; i++) {
1065 display_progress(ctx->progress, i + 1);
1066 commit = lookup_commit(ctx->r, &ctx->oids.list[i]);
1069 commit->object.flags &= ~UNINTERESTING;
1071 stop_progress(&ctx->progress);
1074 static void compute_generation_numbers(struct write_commit_graph_context *ctx)
1077 struct commit_list *list = NULL;
1079 if (ctx->report_progress)
1080 ctx->progress = start_progress(
1081 _("Computing commit graph generation numbers"),
1083 for (i = 0; i < ctx->commits.nr; i++) {
1084 display_progress(ctx->progress, i + 1);
1085 if (ctx->commits.list[i]->generation != GENERATION_NUMBER_INFINITY &&
1086 ctx->commits.list[i]->generation != GENERATION_NUMBER_ZERO)
1089 commit_list_insert(ctx->commits.list[i], &list);
1091 struct commit *current = list->item;
1092 struct commit_list *parent;
1093 int all_parents_computed = 1;
1094 uint32_t max_generation = 0;
1096 for (parent = current->parents; parent; parent = parent->next) {
1097 if (parent->item->generation == GENERATION_NUMBER_INFINITY ||
1098 parent->item->generation == GENERATION_NUMBER_ZERO) {
1099 all_parents_computed = 0;
1100 commit_list_insert(parent->item, &list);
1102 } else if (parent->item->generation > max_generation) {
1103 max_generation = parent->item->generation;
1107 if (all_parents_computed) {
1108 current->generation = max_generation + 1;
1111 if (current->generation > GENERATION_NUMBER_MAX)
1112 current->generation = GENERATION_NUMBER_MAX;
1116 stop_progress(&ctx->progress);
1119 static int add_ref_to_list(const char *refname,
1120 const struct object_id *oid,
1121 int flags, void *cb_data)
1123 struct string_list *list = (struct string_list *)cb_data;
1125 string_list_append(list, oid_to_hex(oid));
1129 int write_commit_graph_reachable(const char *obj_dir, unsigned int flags,
1130 const struct split_commit_graph_opts *split_opts)
1132 struct string_list list = STRING_LIST_INIT_DUP;
1135 for_each_ref(add_ref_to_list, &list);
1136 result = write_commit_graph(obj_dir, NULL, &list,
1139 string_list_clear(&list, 0);
1143 static int fill_oids_from_packs(struct write_commit_graph_context *ctx,
1144 struct string_list *pack_indexes)
1147 struct strbuf progress_title = STRBUF_INIT;
1148 struct strbuf packname = STRBUF_INIT;
1151 strbuf_addf(&packname, "%s/pack/", ctx->obj_dir);
1152 dirlen = packname.len;
1153 if (ctx->report_progress) {
1154 strbuf_addf(&progress_title,
1155 Q_("Finding commits for commit graph in %d pack",
1156 "Finding commits for commit graph in %d packs",
1159 ctx->progress = start_delayed_progress(progress_title.buf, 0);
1160 ctx->progress_done = 0;
1162 for (i = 0; i < pack_indexes->nr; i++) {
1163 struct packed_git *p;
1164 strbuf_setlen(&packname, dirlen);
1165 strbuf_addstr(&packname, pack_indexes->items[i].string);
1166 p = add_packed_git(packname.buf, packname.len, 1);
1168 error(_("error adding pack %s"), packname.buf);
1171 if (open_pack_index(p)) {
1172 error(_("error opening index for %s"), packname.buf);
1175 for_each_object_in_pack(p, add_packed_commits, ctx,
1176 FOR_EACH_OBJECT_PACK_ORDER);
1181 stop_progress(&ctx->progress);
1182 strbuf_reset(&progress_title);
1183 strbuf_release(&packname);
1188 static void fill_oids_from_commit_hex(struct write_commit_graph_context *ctx,
1189 struct string_list *commit_hex)
1192 struct strbuf progress_title = STRBUF_INIT;
1194 if (ctx->report_progress) {
1195 strbuf_addf(&progress_title,
1196 Q_("Finding commits for commit graph from %d ref",
1197 "Finding commits for commit graph from %d refs",
1200 ctx->progress = start_delayed_progress(
1204 for (i = 0; i < commit_hex->nr; i++) {
1206 struct object_id oid;
1207 struct commit *result;
1209 display_progress(ctx->progress, i + 1);
1210 if (commit_hex->items[i].string &&
1211 parse_oid_hex(commit_hex->items[i].string, &oid, &end))
1214 result = lookup_commit_reference_gently(ctx->r, &oid, 1);
1217 ALLOC_GROW(ctx->oids.list, ctx->oids.nr + 1, ctx->oids.alloc);
1218 oidcpy(&ctx->oids.list[ctx->oids.nr], &(result->object.oid));
1222 stop_progress(&ctx->progress);
1223 strbuf_release(&progress_title);
1226 static void fill_oids_from_all_packs(struct write_commit_graph_context *ctx)
1228 if (ctx->report_progress)
1229 ctx->progress = start_delayed_progress(
1230 _("Finding commits for commit graph among packed objects"),
1231 ctx->approx_nr_objects);
1232 for_each_packed_object(add_packed_commits, ctx,
1233 FOR_EACH_OBJECT_PACK_ORDER);
1234 if (ctx->progress_done < ctx->approx_nr_objects)
1235 display_progress(ctx->progress, ctx->approx_nr_objects);
1236 stop_progress(&ctx->progress);
1239 static uint32_t count_distinct_commits(struct write_commit_graph_context *ctx)
1241 uint32_t i, count_distinct = 1;
1243 if (ctx->report_progress)
1244 ctx->progress = start_delayed_progress(
1245 _("Counting distinct commits in commit graph"),
1247 display_progress(ctx->progress, 0); /* TODO: Measure QSORT() progress */
1248 QSORT(ctx->oids.list, ctx->oids.nr, oid_compare);
1250 for (i = 1; i < ctx->oids.nr; i++) {
1251 display_progress(ctx->progress, i + 1);
1252 if (!oideq(&ctx->oids.list[i - 1], &ctx->oids.list[i])) {
1254 struct commit *c = lookup_commit(ctx->r, &ctx->oids.list[i]);
1256 if (!c || c->graph_pos != COMMIT_NOT_FROM_GRAPH)
1263 stop_progress(&ctx->progress);
1265 return count_distinct;
1268 static void copy_oids_to_commits(struct write_commit_graph_context *ctx)
1271 struct commit_list *parent;
1273 ctx->num_extra_edges = 0;
1274 if (ctx->report_progress)
1275 ctx->progress = start_delayed_progress(
1276 _("Finding extra edges in commit graph"),
1278 for (i = 0; i < ctx->oids.nr; i++) {
1279 int num_parents = 0;
1280 display_progress(ctx->progress, i + 1);
1281 if (i > 0 && oideq(&ctx->oids.list[i - 1], &ctx->oids.list[i]))
1284 ALLOC_GROW(ctx->commits.list, ctx->commits.nr + 1, ctx->commits.alloc);
1285 ctx->commits.list[ctx->commits.nr] = lookup_commit(ctx->r, &ctx->oids.list[i]);
1288 ctx->commits.list[ctx->commits.nr]->graph_pos != COMMIT_NOT_FROM_GRAPH)
1291 parse_commit_no_graph(ctx->commits.list[ctx->commits.nr]);
1293 for (parent = ctx->commits.list[ctx->commits.nr]->parents;
1294 parent; parent = parent->next)
1297 if (num_parents > 2)
1298 ctx->num_extra_edges += num_parents - 1;
1302 stop_progress(&ctx->progress);
1305 static int write_graph_chunk_base_1(struct hashfile *f,
1306 struct commit_graph *g)
1313 num = write_graph_chunk_base_1(f, g->base_graph);
1314 hashwrite(f, g->oid.hash, the_hash_algo->rawsz);
1318 static int write_graph_chunk_base(struct hashfile *f,
1319 struct write_commit_graph_context *ctx)
1321 int num = write_graph_chunk_base_1(f, ctx->new_base_graph);
1323 if (num != ctx->num_commit_graphs_after - 1) {
1324 error(_("failed to write correct number of base graph ids"));
1331 static int write_commit_graph_file(struct write_commit_graph_context *ctx)
1336 struct lock_file lk = LOCK_INIT;
1337 uint32_t chunk_ids[6];
1338 uint64_t chunk_offsets[6];
1339 const unsigned hashsz = the_hash_algo->rawsz;
1340 struct strbuf progress_title = STRBUF_INIT;
1342 struct object_id file_hash;
1345 struct strbuf tmp_file = STRBUF_INIT;
1347 strbuf_addf(&tmp_file,
1348 "%s/info/commit-graphs/tmp_graph_XXXXXX",
1350 ctx->graph_name = strbuf_detach(&tmp_file, NULL);
1352 ctx->graph_name = get_commit_graph_filename(ctx->obj_dir);
1355 if (safe_create_leading_directories(ctx->graph_name)) {
1356 UNLEAK(ctx->graph_name);
1357 error(_("unable to create leading directories of %s"),
1363 char *lock_name = get_chain_filename(ctx->obj_dir);
1365 hold_lock_file_for_update(&lk, lock_name, LOCK_DIE_ON_ERROR);
1367 fd = git_mkstemp_mode(ctx->graph_name, 0444);
1369 error(_("unable to create '%s'"), ctx->graph_name);
1373 f = hashfd(fd, ctx->graph_name);
1375 hold_lock_file_for_update(&lk, ctx->graph_name, LOCK_DIE_ON_ERROR);
1376 fd = lk.tempfile->fd;
1377 f = hashfd(lk.tempfile->fd, lk.tempfile->filename.buf);
1380 chunk_ids[0] = GRAPH_CHUNKID_OIDFANOUT;
1381 chunk_ids[1] = GRAPH_CHUNKID_OIDLOOKUP;
1382 chunk_ids[2] = GRAPH_CHUNKID_DATA;
1383 if (ctx->num_extra_edges) {
1384 chunk_ids[num_chunks] = GRAPH_CHUNKID_EXTRAEDGES;
1387 if (ctx->num_commit_graphs_after > 1) {
1388 chunk_ids[num_chunks] = GRAPH_CHUNKID_BASE;
1392 chunk_ids[num_chunks] = 0;
1394 chunk_offsets[0] = 8 + (num_chunks + 1) * GRAPH_CHUNKLOOKUP_WIDTH;
1395 chunk_offsets[1] = chunk_offsets[0] + GRAPH_FANOUT_SIZE;
1396 chunk_offsets[2] = chunk_offsets[1] + hashsz * ctx->commits.nr;
1397 chunk_offsets[3] = chunk_offsets[2] + (hashsz + 16) * ctx->commits.nr;
1400 if (ctx->num_extra_edges) {
1401 chunk_offsets[num_chunks + 1] = chunk_offsets[num_chunks] +
1402 4 * ctx->num_extra_edges;
1405 if (ctx->num_commit_graphs_after > 1) {
1406 chunk_offsets[num_chunks + 1] = chunk_offsets[num_chunks] +
1407 hashsz * (ctx->num_commit_graphs_after - 1);
1411 hashwrite_be32(f, GRAPH_SIGNATURE);
1413 hashwrite_u8(f, GRAPH_VERSION);
1414 hashwrite_u8(f, oid_version());
1415 hashwrite_u8(f, num_chunks);
1416 hashwrite_u8(f, ctx->num_commit_graphs_after - 1);
1418 for (i = 0; i <= num_chunks; i++) {
1419 uint32_t chunk_write[3];
1421 chunk_write[0] = htonl(chunk_ids[i]);
1422 chunk_write[1] = htonl(chunk_offsets[i] >> 32);
1423 chunk_write[2] = htonl(chunk_offsets[i] & 0xffffffff);
1424 hashwrite(f, chunk_write, 12);
1427 if (ctx->report_progress) {
1428 strbuf_addf(&progress_title,
1429 Q_("Writing out commit graph in %d pass",
1430 "Writing out commit graph in %d passes",
1433 ctx->progress = start_delayed_progress(
1435 num_chunks * ctx->commits.nr);
1437 write_graph_chunk_fanout(f, ctx);
1438 write_graph_chunk_oids(f, hashsz, ctx);
1439 write_graph_chunk_data(f, hashsz, ctx);
1440 if (ctx->num_extra_edges)
1441 write_graph_chunk_extra_edges(f, ctx);
1442 if (ctx->num_commit_graphs_after > 1 &&
1443 write_graph_chunk_base(f, ctx)) {
1446 stop_progress(&ctx->progress);
1447 strbuf_release(&progress_title);
1449 if (ctx->split && ctx->base_graph_name && ctx->num_commit_graphs_after > 1) {
1450 char *new_base_hash = xstrdup(oid_to_hex(&ctx->new_base_graph->oid));
1451 char *new_base_name = get_split_graph_filename(ctx->new_base_graph->obj_dir, new_base_hash);
1453 free(ctx->commit_graph_filenames_after[ctx->num_commit_graphs_after - 2]);
1454 free(ctx->commit_graph_hash_after[ctx->num_commit_graphs_after - 2]);
1455 ctx->commit_graph_filenames_after[ctx->num_commit_graphs_after - 2] = new_base_name;
1456 ctx->commit_graph_hash_after[ctx->num_commit_graphs_after - 2] = new_base_hash;
1459 close_commit_graph(ctx->r->objects);
1460 finalize_hashfile(f, file_hash.hash, CSUM_HASH_IN_STREAM | CSUM_FSYNC);
1463 FILE *chainf = fdopen_lock_file(&lk, "w");
1464 char *final_graph_name;
1470 error(_("unable to open commit-graph chain file"));
1474 if (ctx->base_graph_name) {
1475 const char *dest = ctx->commit_graph_filenames_after[
1476 ctx->num_commit_graphs_after - 2];
1478 if (strcmp(ctx->base_graph_name, dest)) {
1479 result = rename(ctx->base_graph_name, dest);
1482 error(_("failed to rename base commit-graph file"));
1487 char *graph_name = get_commit_graph_filename(ctx->obj_dir);
1491 ctx->commit_graph_hash_after[ctx->num_commit_graphs_after - 1] = xstrdup(oid_to_hex(&file_hash));
1492 final_graph_name = get_split_graph_filename(ctx->obj_dir,
1493 ctx->commit_graph_hash_after[ctx->num_commit_graphs_after - 1]);
1494 ctx->commit_graph_filenames_after[ctx->num_commit_graphs_after - 1] = final_graph_name;
1496 result = rename(ctx->graph_name, final_graph_name);
1498 for (i = 0; i < ctx->num_commit_graphs_after; i++)
1499 fprintf(lk.tempfile->fp, "%s\n", ctx->commit_graph_hash_after[i]);
1502 error(_("failed to rename temporary commit-graph file"));
1507 commit_lock_file(&lk);
1512 static void split_graph_merge_strategy(struct write_commit_graph_context *ctx)
1514 struct commit_graph *g = ctx->r->objects->commit_graph;
1515 uint32_t num_commits = ctx->commits.nr;
1518 int max_commits = 0;
1521 if (ctx->split_opts) {
1522 max_commits = ctx->split_opts->max_commits;
1523 size_mult = ctx->split_opts->size_multiple;
1526 g = ctx->r->objects->commit_graph;
1527 ctx->num_commit_graphs_after = ctx->num_commit_graphs_before + 1;
1529 while (g && (g->num_commits <= size_mult * num_commits ||
1530 (max_commits && num_commits > max_commits))) {
1531 if (strcmp(g->obj_dir, ctx->obj_dir))
1534 num_commits += g->num_commits;
1537 ctx->num_commit_graphs_after--;
1540 ctx->new_base_graph = g;
1542 if (ctx->num_commit_graphs_after == 2) {
1543 char *old_graph_name = get_commit_graph_filename(g->obj_dir);
1545 if (!strcmp(g->filename, old_graph_name) &&
1546 strcmp(g->obj_dir, ctx->obj_dir)) {
1547 ctx->num_commit_graphs_after = 1;
1548 ctx->new_base_graph = NULL;
1551 free(old_graph_name);
1554 ALLOC_ARRAY(ctx->commit_graph_filenames_after, ctx->num_commit_graphs_after);
1555 ALLOC_ARRAY(ctx->commit_graph_hash_after, ctx->num_commit_graphs_after);
1557 for (i = 0; i < ctx->num_commit_graphs_after &&
1558 i < ctx->num_commit_graphs_before; i++)
1559 ctx->commit_graph_filenames_after[i] = xstrdup(ctx->commit_graph_filenames_before[i]);
1561 i = ctx->num_commit_graphs_before - 1;
1562 g = ctx->r->objects->commit_graph;
1565 if (i < ctx->num_commit_graphs_after)
1566 ctx->commit_graph_hash_after[i] = xstrdup(oid_to_hex(&g->oid));
1573 static void merge_commit_graph(struct write_commit_graph_context *ctx,
1574 struct commit_graph *g)
1577 uint32_t offset = g->num_commits_in_base;
1579 ALLOC_GROW(ctx->commits.list, ctx->commits.nr + g->num_commits, ctx->commits.alloc);
1581 for (i = 0; i < g->num_commits; i++) {
1582 struct object_id oid;
1583 struct commit *result;
1585 display_progress(ctx->progress, i + 1);
1587 load_oid_from_graph(g, i + offset, &oid);
1589 /* only add commits if they still exist in the repo */
1590 result = lookup_commit_reference_gently(ctx->r, &oid, 1);
1593 ctx->commits.list[ctx->commits.nr] = result;
1599 static int commit_compare(const void *_a, const void *_b)
1601 const struct commit *a = *(const struct commit **)_a;
1602 const struct commit *b = *(const struct commit **)_b;
1603 return oidcmp(&a->object.oid, &b->object.oid);
1606 static void sort_and_scan_merged_commits(struct write_commit_graph_context *ctx)
1608 uint32_t i, num_parents;
1609 struct commit_list *parent;
1611 if (ctx->report_progress)
1612 ctx->progress = start_delayed_progress(
1613 _("Scanning merged commits"),
1616 QSORT(ctx->commits.list, ctx->commits.nr, commit_compare);
1618 ctx->num_extra_edges = 0;
1619 for (i = 0; i < ctx->commits.nr; i++) {
1620 display_progress(ctx->progress, i);
1622 if (i && oideq(&ctx->commits.list[i - 1]->object.oid,
1623 &ctx->commits.list[i]->object.oid)) {
1624 die(_("unexpected duplicate commit id %s"),
1625 oid_to_hex(&ctx->commits.list[i]->object.oid));
1628 for (parent = ctx->commits.list[i]->parents; parent; parent = parent->next)
1631 if (num_parents > 2)
1632 ctx->num_extra_edges += num_parents - 2;
1636 stop_progress(&ctx->progress);
1639 static void merge_commit_graphs(struct write_commit_graph_context *ctx)
1641 struct commit_graph *g = ctx->r->objects->commit_graph;
1642 uint32_t current_graph_number = ctx->num_commit_graphs_before;
1643 struct strbuf progress_title = STRBUF_INIT;
1645 while (g && current_graph_number >= ctx->num_commit_graphs_after) {
1646 current_graph_number--;
1648 if (ctx->report_progress) {
1649 strbuf_addstr(&progress_title, _("Merging commit-graph"));
1650 ctx->progress = start_delayed_progress(progress_title.buf, 0);
1653 merge_commit_graph(ctx, g);
1654 stop_progress(&ctx->progress);
1655 strbuf_release(&progress_title);
1661 ctx->new_base_graph = g;
1662 ctx->new_num_commits_in_base = g->num_commits + g->num_commits_in_base;
1665 if (ctx->new_base_graph)
1666 ctx->base_graph_name = xstrdup(ctx->new_base_graph->filename);
1668 sort_and_scan_merged_commits(ctx);
1671 static void mark_commit_graphs(struct write_commit_graph_context *ctx)
1674 time_t now = time(NULL);
1676 for (i = ctx->num_commit_graphs_after - 1; i < ctx->num_commit_graphs_before; i++) {
1678 struct utimbuf updated_time;
1680 stat(ctx->commit_graph_filenames_before[i], &st);
1682 updated_time.actime = st.st_atime;
1683 updated_time.modtime = now;
1684 utime(ctx->commit_graph_filenames_before[i], &updated_time);
1688 static void expire_commit_graphs(struct write_commit_graph_context *ctx)
1690 struct strbuf path = STRBUF_INIT;
1694 timestamp_t expire_time = time(NULL);
1696 if (ctx->split_opts && ctx->split_opts->expire_time)
1697 expire_time = ctx->split_opts->expire_time;
1699 char *chain_file_name = get_chain_filename(ctx->obj_dir);
1700 unlink(chain_file_name);
1701 free(chain_file_name);
1702 ctx->num_commit_graphs_after = 0;
1705 strbuf_addstr(&path, ctx->obj_dir);
1706 strbuf_addstr(&path, "/info/commit-graphs");
1707 dir = opendir(path.buf);
1710 strbuf_release(&path);
1714 strbuf_addch(&path, '/');
1715 dirnamelen = path.len;
1716 while ((de = readdir(dir)) != NULL) {
1718 uint32_t i, found = 0;
1720 strbuf_setlen(&path, dirnamelen);
1721 strbuf_addstr(&path, de->d_name);
1723 stat(path.buf, &st);
1725 if (st.st_mtime > expire_time)
1727 if (path.len < 6 || strcmp(path.buf + path.len - 6, ".graph"))
1730 for (i = 0; i < ctx->num_commit_graphs_after; i++) {
1731 if (!strcmp(ctx->commit_graph_filenames_after[i],
1743 int write_commit_graph(const char *obj_dir,
1744 struct string_list *pack_indexes,
1745 struct string_list *commit_hex,
1747 const struct split_commit_graph_opts *split_opts)
1749 struct write_commit_graph_context *ctx;
1750 uint32_t i, count_distinct = 0;
1754 if (!commit_graph_compatible(the_repository))
1757 ctx = xcalloc(1, sizeof(struct write_commit_graph_context));
1758 ctx->r = the_repository;
1760 /* normalize object dir with no trailing slash */
1761 ctx->obj_dir = xmallocz(strlen(obj_dir) + 1);
1762 normalize_path_copy(ctx->obj_dir, obj_dir);
1763 len = strlen(ctx->obj_dir);
1764 if (len && ctx->obj_dir[len - 1] == '/')
1765 ctx->obj_dir[len - 1] = 0;
1767 ctx->append = flags & COMMIT_GRAPH_APPEND ? 1 : 0;
1768 ctx->report_progress = flags & COMMIT_GRAPH_PROGRESS ? 1 : 0;
1769 ctx->split = flags & COMMIT_GRAPH_SPLIT ? 1 : 0;
1770 ctx->split_opts = split_opts;
1773 struct commit_graph *g;
1774 prepare_commit_graph(ctx->r);
1776 g = ctx->r->objects->commit_graph;
1779 ctx->num_commit_graphs_before++;
1783 if (ctx->num_commit_graphs_before) {
1784 ALLOC_ARRAY(ctx->commit_graph_filenames_before, ctx->num_commit_graphs_before);
1785 i = ctx->num_commit_graphs_before;
1786 g = ctx->r->objects->commit_graph;
1789 ctx->commit_graph_filenames_before[--i] = xstrdup(g->filename);
1795 ctx->approx_nr_objects = approximate_object_count();
1796 ctx->oids.alloc = ctx->approx_nr_objects / 32;
1798 if (ctx->split && split_opts && ctx->oids.alloc > split_opts->max_commits)
1799 ctx->oids.alloc = split_opts->max_commits;
1802 prepare_commit_graph_one(ctx->r, ctx->obj_dir);
1803 if (ctx->r->objects->commit_graph)
1804 ctx->oids.alloc += ctx->r->objects->commit_graph->num_commits;
1807 if (ctx->oids.alloc < 1024)
1808 ctx->oids.alloc = 1024;
1809 ALLOC_ARRAY(ctx->oids.list, ctx->oids.alloc);
1811 if (ctx->append && ctx->r->objects->commit_graph) {
1812 struct commit_graph *g = ctx->r->objects->commit_graph;
1813 for (i = 0; i < g->num_commits; i++) {
1814 const unsigned char *hash = g->chunk_oid_lookup + g->hash_len * i;
1815 hashcpy(ctx->oids.list[ctx->oids.nr++].hash, hash);
1820 if ((res = fill_oids_from_packs(ctx, pack_indexes)))
1825 fill_oids_from_commit_hex(ctx, commit_hex);
1827 if (!pack_indexes && !commit_hex)
1828 fill_oids_from_all_packs(ctx);
1830 close_reachable(ctx);
1832 count_distinct = count_distinct_commits(ctx);
1834 if (count_distinct >= GRAPH_EDGE_LAST_MASK) {
1835 error(_("the commit graph format cannot write %d commits"), count_distinct);
1840 ctx->commits.alloc = count_distinct;
1841 ALLOC_ARRAY(ctx->commits.list, ctx->commits.alloc);
1843 copy_oids_to_commits(ctx);
1845 if (ctx->commits.nr >= GRAPH_EDGE_LAST_MASK) {
1846 error(_("too many commits to write graph"));
1851 if (!ctx->commits.nr)
1855 split_graph_merge_strategy(ctx);
1857 merge_commit_graphs(ctx);
1859 ctx->num_commit_graphs_after = 1;
1861 compute_generation_numbers(ctx);
1863 res = write_commit_graph_file(ctx);
1866 mark_commit_graphs(ctx);
1868 expire_commit_graphs(ctx);
1871 free(ctx->graph_name);
1872 free(ctx->commits.list);
1873 free(ctx->oids.list);
1876 if (ctx->commit_graph_filenames_after) {
1877 for (i = 0; i < ctx->num_commit_graphs_after; i++) {
1878 free(ctx->commit_graph_filenames_after[i]);
1879 free(ctx->commit_graph_hash_after[i]);
1882 for (i = 0; i < ctx->num_commit_graphs_before; i++)
1883 free(ctx->commit_graph_filenames_before[i]);
1885 free(ctx->commit_graph_filenames_after);
1886 free(ctx->commit_graph_filenames_before);
1887 free(ctx->commit_graph_hash_after);
1895 #define VERIFY_COMMIT_GRAPH_ERROR_HASH 2
1896 static int verify_commit_graph_error;
1898 static void graph_report(const char *fmt, ...)
1902 verify_commit_graph_error = 1;
1904 vfprintf(stderr, fmt, ap);
1905 fprintf(stderr, "\n");
1909 #define GENERATION_ZERO_EXISTS 1
1910 #define GENERATION_NUMBER_EXISTS 2
1912 int verify_commit_graph(struct repository *r, struct commit_graph *g, int flags)
1914 uint32_t i, cur_fanout_pos = 0;
1915 struct object_id prev_oid, cur_oid, checksum;
1916 int generation_zero = 0;
1919 struct progress *progress = NULL;
1920 int local_error = 0;
1923 graph_report("no commit-graph file loaded");
1927 verify_commit_graph_error = verify_commit_graph_lite(g);
1928 if (verify_commit_graph_error)
1929 return verify_commit_graph_error;
1931 devnull = open("/dev/null", O_WRONLY);
1932 f = hashfd(devnull, NULL);
1933 hashwrite(f, g->data, g->data_len - g->hash_len);
1934 finalize_hashfile(f, checksum.hash, CSUM_CLOSE);
1935 if (!hasheq(checksum.hash, g->data + g->data_len - g->hash_len)) {
1936 graph_report(_("the commit-graph file has incorrect checksum and is likely corrupt"));
1937 verify_commit_graph_error = VERIFY_COMMIT_GRAPH_ERROR_HASH;
1940 for (i = 0; i < g->num_commits; i++) {
1941 struct commit *graph_commit;
1943 hashcpy(cur_oid.hash, g->chunk_oid_lookup + g->hash_len * i);
1945 if (i && oidcmp(&prev_oid, &cur_oid) >= 0)
1946 graph_report(_("commit-graph has incorrect OID order: %s then %s"),
1947 oid_to_hex(&prev_oid),
1948 oid_to_hex(&cur_oid));
1950 oidcpy(&prev_oid, &cur_oid);
1952 while (cur_oid.hash[0] > cur_fanout_pos) {
1953 uint32_t fanout_value = get_be32(g->chunk_oid_fanout + cur_fanout_pos);
1955 if (i != fanout_value)
1956 graph_report(_("commit-graph has incorrect fanout value: fanout[%d] = %u != %u"),
1957 cur_fanout_pos, fanout_value, i);
1961 graph_commit = lookup_commit(r, &cur_oid);
1962 if (!parse_commit_in_graph_one(r, g, graph_commit))
1963 graph_report(_("failed to parse commit %s from commit-graph"),
1964 oid_to_hex(&cur_oid));
1967 while (cur_fanout_pos < 256) {
1968 uint32_t fanout_value = get_be32(g->chunk_oid_fanout + cur_fanout_pos);
1970 if (g->num_commits != fanout_value)
1971 graph_report(_("commit-graph has incorrect fanout value: fanout[%d] = %u != %u"),
1972 cur_fanout_pos, fanout_value, i);
1977 if (verify_commit_graph_error & ~VERIFY_COMMIT_GRAPH_ERROR_HASH)
1978 return verify_commit_graph_error;
1980 progress = start_progress(_("Verifying commits in commit graph"),
1982 for (i = 0; i < g->num_commits; i++) {
1983 struct commit *graph_commit, *odb_commit;
1984 struct commit_list *graph_parents, *odb_parents;
1985 uint32_t max_generation = 0;
1987 display_progress(progress, i + 1);
1988 hashcpy(cur_oid.hash, g->chunk_oid_lookup + g->hash_len * i);
1990 graph_commit = lookup_commit(r, &cur_oid);
1991 odb_commit = (struct commit *)create_object(r, cur_oid.hash, alloc_commit_node(r));
1992 if (parse_commit_internal(odb_commit, 0, 0)) {
1993 graph_report(_("failed to parse commit %s from object database for commit-graph"),
1994 oid_to_hex(&cur_oid));
1998 if (!oideq(&get_commit_tree_in_graph_one(r, g, graph_commit)->object.oid,
1999 get_commit_tree_oid(odb_commit)))
2000 graph_report(_("root tree OID for commit %s in commit-graph is %s != %s"),
2001 oid_to_hex(&cur_oid),
2002 oid_to_hex(get_commit_tree_oid(graph_commit)),
2003 oid_to_hex(get_commit_tree_oid(odb_commit)));
2005 graph_parents = graph_commit->parents;
2006 odb_parents = odb_commit->parents;
2008 while (graph_parents) {
2009 if (odb_parents == NULL) {
2010 graph_report(_("commit-graph parent list for commit %s is too long"),
2011 oid_to_hex(&cur_oid));
2015 /* parse parent in case it is in a base graph */
2016 parse_commit_in_graph_one(r, g, graph_parents->item);
2018 if (!oideq(&graph_parents->item->object.oid, &odb_parents->item->object.oid))
2019 graph_report(_("commit-graph parent for %s is %s != %s"),
2020 oid_to_hex(&cur_oid),
2021 oid_to_hex(&graph_parents->item->object.oid),
2022 oid_to_hex(&odb_parents->item->object.oid));
2024 if (graph_parents->item->generation > max_generation)
2025 max_generation = graph_parents->item->generation;
2027 graph_parents = graph_parents->next;
2028 odb_parents = odb_parents->next;
2031 if (odb_parents != NULL)
2032 graph_report(_("commit-graph parent list for commit %s terminates early"),
2033 oid_to_hex(&cur_oid));
2035 if (!graph_commit->generation) {
2036 if (generation_zero == GENERATION_NUMBER_EXISTS)
2037 graph_report(_("commit-graph has generation number zero for commit %s, but non-zero elsewhere"),
2038 oid_to_hex(&cur_oid));
2039 generation_zero = GENERATION_ZERO_EXISTS;
2040 } else if (generation_zero == GENERATION_ZERO_EXISTS)
2041 graph_report(_("commit-graph has non-zero generation number for commit %s, but zero elsewhere"),
2042 oid_to_hex(&cur_oid));
2044 if (generation_zero == GENERATION_ZERO_EXISTS)
2048 * If one of our parents has generation GENERATION_NUMBER_MAX, then
2049 * our generation is also GENERATION_NUMBER_MAX. Decrement to avoid
2050 * extra logic in the following condition.
2052 if (max_generation == GENERATION_NUMBER_MAX)
2055 if (graph_commit->generation != max_generation + 1)
2056 graph_report(_("commit-graph generation for commit %s is %u != %u"),
2057 oid_to_hex(&cur_oid),
2058 graph_commit->generation,
2059 max_generation + 1);
2061 if (graph_commit->date != odb_commit->date)
2062 graph_report(_("commit date for commit %s in commit-graph is %"PRItime" != %"PRItime),
2063 oid_to_hex(&cur_oid),
2067 stop_progress(&progress);
2069 local_error = verify_commit_graph_error;
2071 if (!(flags & COMMIT_GRAPH_VERIFY_SHALLOW) && g->base_graph)
2072 local_error |= verify_commit_graph(r, g->base_graph, flags);
2077 void free_commit_graph(struct commit_graph *g)
2081 if (g->graph_fd >= 0) {
2082 munmap((void *)g->data, g->data_len);