1 #include "git-compat-util.h"
12 #include "hash-lookup.h"
13 #include "commit-graph.h"
14 #include "object-file.h"
15 #include "object-store-ll.h"
16 #include "oid-array.h"
20 #include "replace-object.h"
23 #include "commit-slab.h"
25 #include "json-writer.h"
28 #include "chunk-format.h"
31 void git_test_write_commit_graph_or_die(void)
34 if (!git_env_bool(GIT_TEST_COMMIT_GRAPH
, 0))
37 if (git_env_bool(GIT_TEST_COMMIT_GRAPH_CHANGED_PATHS
, 0))
38 flags
= COMMIT_GRAPH_WRITE_BLOOM_FILTERS
;
40 if (write_commit_graph_reachable(the_repository
->objects
->odb
,
42 die("failed to write commit-graph under GIT_TEST_COMMIT_GRAPH");
45 #define GRAPH_SIGNATURE 0x43475048 /* "CGPH" */
46 #define GRAPH_CHUNKID_OIDFANOUT 0x4f494446 /* "OIDF" */
47 #define GRAPH_CHUNKID_OIDLOOKUP 0x4f49444c /* "OIDL" */
48 #define GRAPH_CHUNKID_DATA 0x43444154 /* "CDAT" */
49 #define GRAPH_CHUNKID_GENERATION_DATA 0x47444132 /* "GDA2" */
50 #define GRAPH_CHUNKID_GENERATION_DATA_OVERFLOW 0x47444f32 /* "GDO2" */
51 #define GRAPH_CHUNKID_EXTRAEDGES 0x45444745 /* "EDGE" */
52 #define GRAPH_CHUNKID_BLOOMINDEXES 0x42494458 /* "BIDX" */
53 #define GRAPH_CHUNKID_BLOOMDATA 0x42444154 /* "BDAT" */
54 #define GRAPH_CHUNKID_BASE 0x42415345 /* "BASE" */
56 #define GRAPH_DATA_WIDTH (the_hash_algo->rawsz + 16)
58 #define GRAPH_VERSION_1 0x1
59 #define GRAPH_VERSION GRAPH_VERSION_1
61 #define GRAPH_EXTRA_EDGES_NEEDED 0x80000000
62 #define GRAPH_EDGE_LAST_MASK 0x7fffffff
63 #define GRAPH_PARENT_NONE 0x70000000
65 #define GRAPH_LAST_EDGE 0x80000000
67 #define GRAPH_HEADER_SIZE 8
68 #define GRAPH_FANOUT_SIZE (4 * 256)
69 #define GRAPH_MIN_SIZE (GRAPH_HEADER_SIZE + 4 * CHUNK_TOC_ENTRY_SIZE \
70 + GRAPH_FANOUT_SIZE + the_hash_algo->rawsz)
72 #define CORRECTED_COMMIT_DATE_OFFSET_OVERFLOW (1ULL << 31)
74 /* Remember to update object flag allocation in object.h */
75 #define REACHABLE (1u<<15)
77 define_commit_slab(topo_level_slab
, uint32_t);
79 /* Keep track of the order in which commits are added to our list. */
80 define_commit_slab(commit_pos
, int);
81 static struct commit_pos commit_pos
= COMMIT_SLAB_INIT(1, commit_pos
);
83 static void set_commit_pos(struct repository
*r
, const struct object_id
*oid
)
85 static int32_t max_pos
;
86 struct commit
*commit
= lookup_commit(r
, oid
);
89 return; /* should never happen, but be lenient */
91 *commit_pos_at(&commit_pos
, commit
) = max_pos
++;
94 static int commit_pos_cmp(const void *va
, const void *vb
)
96 const struct commit
*a
= *(const struct commit
**)va
;
97 const struct commit
*b
= *(const struct commit
**)vb
;
98 return commit_pos_at(&commit_pos
, a
) -
99 commit_pos_at(&commit_pos
, b
);
102 define_commit_slab(commit_graph_data_slab
, struct commit_graph_data
);
103 static struct commit_graph_data_slab commit_graph_data_slab
=
104 COMMIT_SLAB_INIT(1, commit_graph_data_slab
);
106 static int get_configured_generation_version(struct repository
*r
)
109 repo_config_get_int(r
, "commitgraph.generationversion", &version
);
113 uint32_t commit_graph_position(const struct commit
*c
)
115 struct commit_graph_data
*data
=
116 commit_graph_data_slab_peek(&commit_graph_data_slab
, c
);
118 return data
? data
->graph_pos
: COMMIT_NOT_FROM_GRAPH
;
121 timestamp_t
commit_graph_generation(const struct commit
*c
)
123 struct commit_graph_data
*data
=
124 commit_graph_data_slab_peek(&commit_graph_data_slab
, c
);
126 if (data
&& data
->generation
)
127 return data
->generation
;
129 return GENERATION_NUMBER_INFINITY
;
132 static struct commit_graph_data
*commit_graph_data_at(const struct commit
*c
)
134 unsigned int i
, nth_slab
;
135 struct commit_graph_data
*data
=
136 commit_graph_data_slab_peek(&commit_graph_data_slab
, c
);
141 nth_slab
= c
->index
/ commit_graph_data_slab
.slab_size
;
142 data
= commit_graph_data_slab_at(&commit_graph_data_slab
, c
);
145 * commit-slab initializes elements with zero, overwrite this with
146 * COMMIT_NOT_FROM_GRAPH for graph_pos.
148 * We avoid initializing generation with checking if graph position
149 * is not COMMIT_NOT_FROM_GRAPH.
151 for (i
= 0; i
< commit_graph_data_slab
.slab_size
; i
++) {
152 commit_graph_data_slab
.slab
[nth_slab
][i
].graph_pos
=
153 COMMIT_NOT_FROM_GRAPH
;
160 * Should be used only while writing commit-graph as it compares
161 * generation value of commits by directly accessing commit-slab.
163 static int commit_gen_cmp(const void *va
, const void *vb
)
165 const struct commit
*a
= *(const struct commit
**)va
;
166 const struct commit
*b
= *(const struct commit
**)vb
;
168 const timestamp_t generation_a
= commit_graph_data_at(a
)->generation
;
169 const timestamp_t generation_b
= commit_graph_data_at(b
)->generation
;
170 /* lower generation commits first */
171 if (generation_a
< generation_b
)
173 else if (generation_a
> generation_b
)
176 /* use date as a heuristic when generations are equal */
177 if (a
->date
< b
->date
)
179 else if (a
->date
> b
->date
)
184 char *get_commit_graph_filename(struct object_directory
*obj_dir
)
186 return xstrfmt("%s/info/commit-graph", obj_dir
->path
);
189 static char *get_split_graph_filename(struct object_directory
*odb
,
192 return xstrfmt("%s/info/commit-graphs/graph-%s.graph", odb
->path
,
196 char *get_commit_graph_chain_filename(struct object_directory
*odb
)
198 return xstrfmt("%s/info/commit-graphs/commit-graph-chain", odb
->path
);
201 static struct commit_graph
*alloc_commit_graph(void)
203 struct commit_graph
*g
= xcalloc(1, sizeof(*g
));
208 extern int read_replace_refs
;
210 static int commit_graph_compatible(struct repository
*r
)
215 if (read_replace_refs
) {
216 prepare_replace_object(r
);
217 if (hashmap_get_size(&r
->objects
->replace_map
->map
))
221 prepare_commit_graft(r
);
222 if (r
->parsed_objects
&&
223 (r
->parsed_objects
->grafts_nr
|| r
->parsed_objects
->substituted_parent
))
225 if (is_repository_shallow(r
))
231 int open_commit_graph(const char *graph_file
, int *fd
, struct stat
*st
)
233 *fd
= git_open(graph_file
);
236 if (fstat(*fd
, st
)) {
243 struct commit_graph
*load_commit_graph_one_fd_st(struct repository
*r
,
244 int fd
, struct stat
*st
,
245 struct object_directory
*odb
)
249 struct commit_graph
*ret
;
251 graph_size
= xsize_t(st
->st_size
);
253 if (graph_size
< GRAPH_MIN_SIZE
) {
255 error(_("commit-graph file is too small"));
258 graph_map
= xmmap(NULL
, graph_size
, PROT_READ
, MAP_PRIVATE
, fd
, 0);
260 prepare_repo_settings(r
);
261 ret
= parse_commit_graph(&r
->settings
, 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 static int graph_read_oid_lookup(const unsigned char *chunk_start
,
302 size_t chunk_size
, void *data
)
304 struct commit_graph
*g
= data
;
305 g
->chunk_oid_lookup
= chunk_start
;
306 g
->num_commits
= chunk_size
/ g
->hash_len
;
310 static int graph_read_bloom_data(const unsigned char *chunk_start
,
311 size_t chunk_size
, void *data
)
313 struct commit_graph
*g
= data
;
314 uint32_t hash_version
;
315 g
->chunk_bloom_data
= chunk_start
;
316 hash_version
= get_be32(chunk_start
);
318 if (hash_version
!= 1)
321 g
->bloom_filter_settings
= xmalloc(sizeof(struct bloom_filter_settings
));
322 g
->bloom_filter_settings
->hash_version
= hash_version
;
323 g
->bloom_filter_settings
->num_hashes
= get_be32(chunk_start
+ 4);
324 g
->bloom_filter_settings
->bits_per_entry
= get_be32(chunk_start
+ 8);
325 g
->bloom_filter_settings
->max_changed_paths
= DEFAULT_BLOOM_MAX_CHANGES
;
330 struct commit_graph
*parse_commit_graph(struct repo_settings
*s
,
331 void *graph_map
, size_t graph_size
)
333 const unsigned char *data
;
334 struct commit_graph
*graph
;
335 uint32_t graph_signature
;
336 unsigned char graph_version
, hash_version
;
337 struct chunkfile
*cf
= NULL
;
342 if (graph_size
< GRAPH_MIN_SIZE
)
345 data
= (const unsigned char *)graph_map
;
347 graph_signature
= get_be32(data
);
348 if (graph_signature
!= GRAPH_SIGNATURE
) {
349 error(_("commit-graph signature %X does not match signature %X"),
350 graph_signature
, GRAPH_SIGNATURE
);
354 graph_version
= *(unsigned char*)(data
+ 4);
355 if (graph_version
!= GRAPH_VERSION
) {
356 error(_("commit-graph version %X does not match version %X"),
357 graph_version
, GRAPH_VERSION
);
361 hash_version
= *(unsigned char*)(data
+ 5);
362 if (hash_version
!= oid_version(the_hash_algo
)) {
363 error(_("commit-graph hash version %X does not match version %X"),
364 hash_version
, oid_version(the_hash_algo
));
368 graph
= alloc_commit_graph();
370 graph
->hash_len
= the_hash_algo
->rawsz
;
371 graph
->num_chunks
= *(unsigned char*)(data
+ 6);
372 graph
->data
= graph_map
;
373 graph
->data_len
= graph_size
;
375 if (graph_size
< GRAPH_HEADER_SIZE
+
376 (graph
->num_chunks
+ 1) * CHUNK_TOC_ENTRY_SIZE
+
377 GRAPH_FANOUT_SIZE
+ the_hash_algo
->rawsz
) {
378 error(_("commit-graph file is too small to hold %u chunks"),
384 cf
= init_chunkfile(NULL
);
386 if (read_table_of_contents(cf
, graph
->data
, graph_size
,
387 GRAPH_HEADER_SIZE
, graph
->num_chunks
))
388 goto free_and_return
;
390 pair_chunk(cf
, GRAPH_CHUNKID_OIDFANOUT
,
391 (const unsigned char **)&graph
->chunk_oid_fanout
);
392 read_chunk(cf
, GRAPH_CHUNKID_OIDLOOKUP
, graph_read_oid_lookup
, graph
);
393 pair_chunk(cf
, GRAPH_CHUNKID_DATA
, &graph
->chunk_commit_data
);
394 pair_chunk(cf
, GRAPH_CHUNKID_EXTRAEDGES
, &graph
->chunk_extra_edges
);
395 pair_chunk(cf
, GRAPH_CHUNKID_BASE
, &graph
->chunk_base_graphs
);
397 if (s
->commit_graph_generation_version
>= 2) {
398 pair_chunk(cf
, GRAPH_CHUNKID_GENERATION_DATA
,
399 &graph
->chunk_generation_data
);
400 pair_chunk(cf
, GRAPH_CHUNKID_GENERATION_DATA_OVERFLOW
,
401 &graph
->chunk_generation_data_overflow
);
403 if (graph
->chunk_generation_data
)
404 graph
->read_generation_data
= 1;
407 if (s
->commit_graph_read_changed_paths
) {
408 pair_chunk(cf
, GRAPH_CHUNKID_BLOOMINDEXES
,
409 &graph
->chunk_bloom_indexes
);
410 read_chunk(cf
, GRAPH_CHUNKID_BLOOMDATA
,
411 graph_read_bloom_data
, graph
);
414 if (graph
->chunk_bloom_indexes
&& graph
->chunk_bloom_data
) {
415 init_bloom_filters();
417 /* We need both the bloom chunks to exist together. Else ignore the data */
418 graph
->chunk_bloom_indexes
= NULL
;
419 graph
->chunk_bloom_data
= NULL
;
420 FREE_AND_NULL(graph
->bloom_filter_settings
);
423 oidread(&graph
->oid
, graph
->data
+ graph
->data_len
- graph
->hash_len
);
425 if (verify_commit_graph_lite(graph
))
426 goto free_and_return
;
433 free(graph
->bloom_filter_settings
);
438 static struct commit_graph
*load_commit_graph_one(struct repository
*r
,
439 const char *graph_file
,
440 struct object_directory
*odb
)
445 struct commit_graph
*g
;
446 int open_ok
= open_commit_graph(graph_file
, &fd
, &st
);
451 g
= load_commit_graph_one_fd_st(r
, fd
, &st
, odb
);
454 g
->filename
= xstrdup(graph_file
);
459 static struct commit_graph
*load_commit_graph_v1(struct repository
*r
,
460 struct object_directory
*odb
)
462 char *graph_name
= get_commit_graph_filename(odb
);
463 struct commit_graph
*g
= load_commit_graph_one(r
, graph_name
, odb
);
469 static int add_graph_to_chain(struct commit_graph
*g
,
470 struct commit_graph
*chain
,
471 struct object_id
*oids
,
474 struct commit_graph
*cur_g
= chain
;
476 if (n
&& !g
->chunk_base_graphs
) {
477 warning(_("commit-graph has no base graphs chunk"));
485 !oideq(&oids
[n
], &cur_g
->oid
) ||
486 !hasheq(oids
[n
].hash
, g
->chunk_base_graphs
+ g
->hash_len
* n
)) {
487 warning(_("commit-graph chain does not match"));
491 cur_g
= cur_g
->base_graph
;
494 g
->base_graph
= chain
;
497 g
->num_commits_in_base
= chain
->num_commits
+ chain
->num_commits_in_base
;
502 static struct commit_graph
*load_commit_graph_chain(struct repository
*r
,
503 struct object_directory
*odb
)
505 struct commit_graph
*graph_chain
= NULL
;
506 struct strbuf line
= STRBUF_INIT
;
508 struct object_id
*oids
;
509 int i
= 0, valid
= 1, count
;
510 char *chain_name
= get_commit_graph_chain_filename(odb
);
514 fp
= fopen(chain_name
, "r");
515 stat_res
= stat(chain_name
, &st
);
521 st
.st_size
<= the_hash_algo
->hexsz
) {
526 count
= st
.st_size
/ (the_hash_algo
->hexsz
+ 1);
527 CALLOC_ARRAY(oids
, count
);
531 for (i
= 0; i
< count
; i
++) {
532 struct object_directory
*odb
;
534 if (strbuf_getline_lf(&line
, fp
) == EOF
)
537 if (get_oid_hex(line
.buf
, &oids
[i
])) {
538 warning(_("invalid commit-graph chain: line '%s' not a hash"),
545 for (odb
= r
->objects
->odb
; odb
; odb
= odb
->next
) {
546 char *graph_name
= get_split_graph_filename(odb
, line
.buf
);
547 struct commit_graph
*g
= load_commit_graph_one(r
, graph_name
, odb
);
552 if (add_graph_to_chain(g
, graph_chain
, oids
, i
)) {
562 warning(_("unable to find all commit-graph files"));
569 strbuf_release(&line
);
575 * returns 1 if and only if all graphs in the chain have
576 * corrected commit dates stored in the generation_data chunk.
578 static int validate_mixed_generation_chain(struct commit_graph
*g
)
580 int read_generation_data
= 1;
581 struct commit_graph
*p
= g
;
583 while (read_generation_data
&& p
) {
584 read_generation_data
= p
->read_generation_data
;
588 if (read_generation_data
)
592 g
->read_generation_data
= 0;
599 struct commit_graph
*read_commit_graph_one(struct repository
*r
,
600 struct object_directory
*odb
)
602 struct commit_graph
*g
= load_commit_graph_v1(r
, odb
);
605 g
= load_commit_graph_chain(r
, odb
);
607 validate_mixed_generation_chain(g
);
612 static void prepare_commit_graph_one(struct repository
*r
,
613 struct object_directory
*odb
)
616 if (r
->objects
->commit_graph
)
619 r
->objects
->commit_graph
= read_commit_graph_one(r
, odb
);
623 * Return 1 if commit_graph is non-NULL, and 0 otherwise.
625 * On the first invocation, this function attempts to load the commit
626 * graph if the_repository is configured to have one.
628 static int prepare_commit_graph(struct repository
*r
)
630 struct object_directory
*odb
;
633 * Early return if there is no git dir or if the commit graph is
636 * This must come before the "already attempted?" check below, because
637 * we want to disable even an already-loaded graph file.
639 if (!r
->gitdir
|| r
->commit_graph_disabled
)
642 if (r
->objects
->commit_graph_attempted
)
643 return !!r
->objects
->commit_graph
;
644 r
->objects
->commit_graph_attempted
= 1;
646 prepare_repo_settings(r
);
648 if (!git_env_bool(GIT_TEST_COMMIT_GRAPH
, 0) &&
649 r
->settings
.core_commit_graph
!= 1)
651 * This repository is not configured to use commit graphs, so
652 * do not load one. (But report commit_graph_attempted anyway
653 * so that commit graph loading is not attempted again for this
658 if (!commit_graph_compatible(r
))
662 for (odb
= r
->objects
->odb
;
663 !r
->objects
->commit_graph
&& odb
;
665 prepare_commit_graph_one(r
, odb
);
666 return !!r
->objects
->commit_graph
;
669 int generation_numbers_enabled(struct repository
*r
)
671 uint32_t first_generation
;
672 struct commit_graph
*g
;
673 if (!prepare_commit_graph(r
))
676 g
= r
->objects
->commit_graph
;
681 first_generation
= get_be32(g
->chunk_commit_data
+
682 g
->hash_len
+ 8) >> 2;
684 return !!first_generation
;
687 int corrected_commit_dates_enabled(struct repository
*r
)
689 struct commit_graph
*g
;
690 if (!prepare_commit_graph(r
))
693 g
= r
->objects
->commit_graph
;
698 return g
->read_generation_data
;
701 struct bloom_filter_settings
*get_bloom_filter_settings(struct repository
*r
)
703 struct commit_graph
*g
= r
->objects
->commit_graph
;
705 if (g
->bloom_filter_settings
)
706 return g
->bloom_filter_settings
;
712 static void close_commit_graph_one(struct commit_graph
*g
)
717 clear_commit_graph_data_slab(&commit_graph_data_slab
);
718 close_commit_graph_one(g
->base_graph
);
719 free_commit_graph(g
);
722 void close_commit_graph(struct raw_object_store
*o
)
724 close_commit_graph_one(o
->commit_graph
);
725 o
->commit_graph
= NULL
;
728 static int bsearch_graph(struct commit_graph
*g
, const struct object_id
*oid
, uint32_t *pos
)
730 return bsearch_hash(oid
->hash
, g
->chunk_oid_fanout
,
731 g
->chunk_oid_lookup
, g
->hash_len
, pos
);
734 static void load_oid_from_graph(struct commit_graph
*g
,
736 struct object_id
*oid
)
740 while (g
&& pos
< g
->num_commits_in_base
)
744 BUG("NULL commit-graph");
746 if (pos
>= g
->num_commits
+ g
->num_commits_in_base
)
747 die(_("invalid commit position. commit-graph is likely corrupt"));
749 lex_index
= pos
- g
->num_commits_in_base
;
751 oidread(oid
, g
->chunk_oid_lookup
+ g
->hash_len
* lex_index
);
754 static struct commit_list
**insert_parent_or_die(struct repository
*r
,
755 struct commit_graph
*g
,
757 struct commit_list
**pptr
)
760 struct object_id oid
;
762 if (pos
>= g
->num_commits
+ g
->num_commits_in_base
)
763 die("invalid parent position %"PRIu32
, pos
);
765 load_oid_from_graph(g
, pos
, &oid
);
766 c
= lookup_commit(r
, &oid
);
768 die(_("could not find commit %s"), oid_to_hex(&oid
));
769 commit_graph_data_at(c
)->graph_pos
= pos
;
770 return &commit_list_insert(c
, pptr
)->next
;
773 static void fill_commit_graph_info(struct commit
*item
, struct commit_graph
*g
, uint32_t pos
)
775 const unsigned char *commit_data
;
776 struct commit_graph_data
*graph_data
;
777 uint32_t lex_index
, offset_pos
;
778 uint64_t date_high
, date_low
, offset
;
780 while (pos
< g
->num_commits_in_base
)
783 if (pos
>= g
->num_commits
+ g
->num_commits_in_base
)
784 die(_("invalid commit position. commit-graph is likely corrupt"));
786 lex_index
= pos
- g
->num_commits_in_base
;
787 commit_data
= g
->chunk_commit_data
+ GRAPH_DATA_WIDTH
* lex_index
;
789 graph_data
= commit_graph_data_at(item
);
790 graph_data
->graph_pos
= pos
;
792 date_high
= get_be32(commit_data
+ g
->hash_len
+ 8) & 0x3;
793 date_low
= get_be32(commit_data
+ g
->hash_len
+ 12);
794 item
->date
= (timestamp_t
)((date_high
<< 32) | date_low
);
796 if (g
->read_generation_data
) {
797 offset
= (timestamp_t
)get_be32(g
->chunk_generation_data
+ sizeof(uint32_t) * lex_index
);
799 if (offset
& CORRECTED_COMMIT_DATE_OFFSET_OVERFLOW
) {
800 if (!g
->chunk_generation_data_overflow
)
801 die(_("commit-graph requires overflow generation data but has none"));
803 offset_pos
= offset
^ CORRECTED_COMMIT_DATE_OFFSET_OVERFLOW
;
804 graph_data
->generation
= item
->date
+ get_be64(g
->chunk_generation_data_overflow
+ 8 * offset_pos
);
806 graph_data
->generation
= item
->date
+ offset
;
808 graph_data
->generation
= get_be32(commit_data
+ g
->hash_len
+ 8) >> 2;
811 *topo_level_slab_at(g
->topo_levels
, item
) = get_be32(commit_data
+ g
->hash_len
+ 8) >> 2;
814 static inline void set_commit_tree(struct commit
*c
, struct tree
*t
)
819 static int fill_commit_in_graph(struct repository
*r
,
821 struct commit_graph
*g
, uint32_t pos
)
824 uint32_t *parent_data_ptr
;
825 struct commit_list
**pptr
;
826 const unsigned char *commit_data
;
829 while (pos
< g
->num_commits_in_base
)
832 fill_commit_graph_info(item
, g
, pos
);
834 lex_index
= pos
- g
->num_commits_in_base
;
835 commit_data
= g
->chunk_commit_data
+ (g
->hash_len
+ 16) * lex_index
;
837 item
->object
.parsed
= 1;
839 set_commit_tree(item
, NULL
);
841 pptr
= &item
->parents
;
843 edge_value
= get_be32(commit_data
+ g
->hash_len
);
844 if (edge_value
== GRAPH_PARENT_NONE
)
846 pptr
= insert_parent_or_die(r
, g
, edge_value
, pptr
);
848 edge_value
= get_be32(commit_data
+ g
->hash_len
+ 4);
849 if (edge_value
== GRAPH_PARENT_NONE
)
851 if (!(edge_value
& GRAPH_EXTRA_EDGES_NEEDED
)) {
852 pptr
= insert_parent_or_die(r
, g
, edge_value
, pptr
);
856 parent_data_ptr
= (uint32_t*)(g
->chunk_extra_edges
+
857 4 * (uint64_t)(edge_value
& GRAPH_EDGE_LAST_MASK
));
859 edge_value
= get_be32(parent_data_ptr
);
860 pptr
= insert_parent_or_die(r
, g
,
861 edge_value
& GRAPH_EDGE_LAST_MASK
,
864 } while (!(edge_value
& GRAPH_LAST_EDGE
));
869 static int search_commit_pos_in_graph(const struct object_id
*id
, struct commit_graph
*g
, uint32_t *pos
)
871 struct commit_graph
*cur_g
= g
;
874 while (cur_g
&& !bsearch_graph(cur_g
, id
, &lex_index
))
875 cur_g
= cur_g
->base_graph
;
878 *pos
= lex_index
+ cur_g
->num_commits_in_base
;
885 static int find_commit_pos_in_graph(struct commit
*item
, struct commit_graph
*g
, uint32_t *pos
)
887 uint32_t graph_pos
= commit_graph_position(item
);
888 if (graph_pos
!= COMMIT_NOT_FROM_GRAPH
) {
892 return search_commit_pos_in_graph(&item
->object
.oid
, g
, pos
);
896 int repo_find_commit_pos_in_graph(struct repository
*r
, struct commit
*c
,
899 if (!prepare_commit_graph(r
))
901 return find_commit_pos_in_graph(c
, r
->objects
->commit_graph
, pos
);
904 struct commit
*lookup_commit_in_graph(struct repository
*repo
, const struct object_id
*id
)
906 struct commit
*commit
;
909 if (!prepare_commit_graph(repo
))
911 if (!search_commit_pos_in_graph(id
, repo
->objects
->commit_graph
, &pos
))
913 if (!has_object(repo
, id
, 0))
916 commit
= lookup_commit(repo
, id
);
919 if (commit
->object
.parsed
)
922 if (!fill_commit_in_graph(repo
, commit
, repo
->objects
->commit_graph
, pos
))
928 static int parse_commit_in_graph_one(struct repository
*r
,
929 struct commit_graph
*g
,
934 if (item
->object
.parsed
)
937 if (find_commit_pos_in_graph(item
, g
, &pos
))
938 return fill_commit_in_graph(r
, item
, g
, pos
);
943 int parse_commit_in_graph(struct repository
*r
, struct commit
*item
)
945 static int checked_env
= 0;
948 git_env_bool(GIT_TEST_COMMIT_GRAPH_DIE_ON_PARSE
, 0))
949 die("dying as requested by the '%s' variable on commit-graph parse!",
950 GIT_TEST_COMMIT_GRAPH_DIE_ON_PARSE
);
953 if (!prepare_commit_graph(r
))
955 return parse_commit_in_graph_one(r
, r
->objects
->commit_graph
, item
);
958 void load_commit_graph_info(struct repository
*r
, struct commit
*item
)
961 if (repo_find_commit_pos_in_graph(r
, item
, &pos
))
962 fill_commit_graph_info(item
, r
->objects
->commit_graph
, pos
);
965 static struct tree
*load_tree_for_commit(struct repository
*r
,
966 struct commit_graph
*g
,
969 struct object_id oid
;
970 const unsigned char *commit_data
;
971 uint32_t graph_pos
= commit_graph_position(c
);
973 while (graph_pos
< g
->num_commits_in_base
)
976 commit_data
= g
->chunk_commit_data
+
977 GRAPH_DATA_WIDTH
* (graph_pos
- g
->num_commits_in_base
);
979 oidread(&oid
, commit_data
);
980 set_commit_tree(c
, lookup_tree(r
, &oid
));
982 return c
->maybe_tree
;
985 static struct tree
*get_commit_tree_in_graph_one(struct repository
*r
,
986 struct commit_graph
*g
,
987 const struct commit
*c
)
990 return c
->maybe_tree
;
991 if (commit_graph_position(c
) == COMMIT_NOT_FROM_GRAPH
)
992 BUG("get_commit_tree_in_graph_one called from non-commit-graph commit");
994 return load_tree_for_commit(r
, g
, (struct commit
*)c
);
997 struct tree
*get_commit_tree_in_graph(struct repository
*r
, const struct commit
*c
)
999 return get_commit_tree_in_graph_one(r
, r
->objects
->commit_graph
, c
);
1002 struct packed_commit_list
{
1003 struct commit
**list
;
1008 struct write_commit_graph_context
{
1009 struct repository
*r
;
1010 struct object_directory
*odb
;
1012 struct oid_array oids
;
1013 struct packed_commit_list commits
;
1014 int num_extra_edges
;
1015 int num_generation_data_overflows
;
1016 unsigned long approx_nr_objects
;
1017 struct progress
*progress
;
1019 uint64_t progress_cnt
;
1021 char *base_graph_name
;
1022 int num_commit_graphs_before
;
1023 int num_commit_graphs_after
;
1024 char **commit_graph_filenames_before
;
1025 char **commit_graph_filenames_after
;
1026 char **commit_graph_hash_after
;
1027 uint32_t new_num_commits_in_base
;
1028 struct commit_graph
*new_base_graph
;
1035 write_generation_data
:1,
1036 trust_generation_numbers
:1;
1038 struct topo_level_slab
*topo_levels
;
1039 const struct commit_graph_opts
*opts
;
1040 size_t total_bloom_filter_data_size
;
1041 const struct bloom_filter_settings
*bloom_settings
;
1043 int count_bloom_filter_computed
;
1044 int count_bloom_filter_not_computed
;
1045 int count_bloom_filter_trunc_empty
;
1046 int count_bloom_filter_trunc_large
;
1049 static int write_graph_chunk_fanout(struct hashfile
*f
,
1052 struct write_commit_graph_context
*ctx
= data
;
1054 struct commit
**list
= ctx
->commits
.list
;
1057 * Write the first-level table (the list is sorted,
1058 * but we use a 256-entry lookup to be able to avoid
1059 * having to do eight extra binary search iterations).
1061 for (i
= 0; i
< 256; i
++) {
1062 while (count
< ctx
->commits
.nr
) {
1063 if ((*list
)->object
.oid
.hash
[0] != i
)
1065 display_progress(ctx
->progress
, ++ctx
->progress_cnt
);
1070 hashwrite_be32(f
, count
);
1076 static int write_graph_chunk_oids(struct hashfile
*f
,
1079 struct write_commit_graph_context
*ctx
= data
;
1080 struct commit
**list
= ctx
->commits
.list
;
1082 for (count
= 0; count
< ctx
->commits
.nr
; count
++, list
++) {
1083 display_progress(ctx
->progress
, ++ctx
->progress_cnt
);
1084 hashwrite(f
, (*list
)->object
.oid
.hash
, the_hash_algo
->rawsz
);
1090 static const struct object_id
*commit_to_oid(size_t index
, const void *table
)
1092 const struct commit
* const *commits
= table
;
1093 return &commits
[index
]->object
.oid
;
1096 static int write_graph_chunk_data(struct hashfile
*f
,
1099 struct write_commit_graph_context
*ctx
= data
;
1100 struct commit
**list
= ctx
->commits
.list
;
1101 struct commit
**last
= ctx
->commits
.list
+ ctx
->commits
.nr
;
1102 uint32_t num_extra_edges
= 0;
1104 while (list
< last
) {
1105 struct commit_list
*parent
;
1106 struct object_id
*tree
;
1108 uint32_t packedDate
[2];
1109 display_progress(ctx
->progress
, ++ctx
->progress_cnt
);
1111 if (repo_parse_commit_no_graph(ctx
->r
, *list
))
1112 die(_("unable to parse commit %s"),
1113 oid_to_hex(&(*list
)->object
.oid
));
1114 tree
= get_commit_tree_oid(*list
);
1115 hashwrite(f
, tree
->hash
, the_hash_algo
->rawsz
);
1117 parent
= (*list
)->parents
;
1120 edge_value
= GRAPH_PARENT_NONE
;
1122 edge_value
= oid_pos(&parent
->item
->object
.oid
,
1127 if (edge_value
>= 0)
1128 edge_value
+= ctx
->new_num_commits_in_base
;
1129 else if (ctx
->new_base_graph
) {
1131 if (find_commit_pos_in_graph(parent
->item
,
1132 ctx
->new_base_graph
,
1138 BUG("missing parent %s for commit %s",
1139 oid_to_hex(&parent
->item
->object
.oid
),
1140 oid_to_hex(&(*list
)->object
.oid
));
1143 hashwrite_be32(f
, edge_value
);
1146 parent
= parent
->next
;
1149 edge_value
= GRAPH_PARENT_NONE
;
1150 else if (parent
->next
)
1151 edge_value
= GRAPH_EXTRA_EDGES_NEEDED
| num_extra_edges
;
1153 edge_value
= oid_pos(&parent
->item
->object
.oid
,
1158 if (edge_value
>= 0)
1159 edge_value
+= ctx
->new_num_commits_in_base
;
1160 else if (ctx
->new_base_graph
) {
1162 if (find_commit_pos_in_graph(parent
->item
,
1163 ctx
->new_base_graph
,
1169 BUG("missing parent %s for commit %s",
1170 oid_to_hex(&parent
->item
->object
.oid
),
1171 oid_to_hex(&(*list
)->object
.oid
));
1174 hashwrite_be32(f
, edge_value
);
1176 if (edge_value
& GRAPH_EXTRA_EDGES_NEEDED
) {
1179 parent
= parent
->next
;
1183 if (sizeof((*list
)->date
) > 4)
1184 packedDate
[0] = htonl(((*list
)->date
>> 32) & 0x3);
1188 packedDate
[0] |= htonl(*topo_level_slab_at(ctx
->topo_levels
, *list
) << 2);
1190 packedDate
[1] = htonl((*list
)->date
);
1191 hashwrite(f
, packedDate
, 8);
1199 static int write_graph_chunk_generation_data(struct hashfile
*f
,
1202 struct write_commit_graph_context
*ctx
= data
;
1203 int i
, num_generation_data_overflows
= 0;
1205 for (i
= 0; i
< ctx
->commits
.nr
; i
++) {
1206 struct commit
*c
= ctx
->commits
.list
[i
];
1208 repo_parse_commit(ctx
->r
, c
);
1209 offset
= commit_graph_data_at(c
)->generation
- c
->date
;
1210 display_progress(ctx
->progress
, ++ctx
->progress_cnt
);
1212 if (offset
> GENERATION_NUMBER_V2_OFFSET_MAX
) {
1213 offset
= CORRECTED_COMMIT_DATE_OFFSET_OVERFLOW
| num_generation_data_overflows
;
1214 num_generation_data_overflows
++;
1217 hashwrite_be32(f
, offset
);
1223 static int write_graph_chunk_generation_data_overflow(struct hashfile
*f
,
1226 struct write_commit_graph_context
*ctx
= data
;
1228 for (i
= 0; i
< ctx
->commits
.nr
; i
++) {
1229 struct commit
*c
= ctx
->commits
.list
[i
];
1230 timestamp_t offset
= commit_graph_data_at(c
)->generation
- c
->date
;
1231 display_progress(ctx
->progress
, ++ctx
->progress_cnt
);
1233 if (offset
> GENERATION_NUMBER_V2_OFFSET_MAX
) {
1234 hashwrite_be32(f
, offset
>> 32);
1235 hashwrite_be32(f
, (uint32_t) offset
);
1242 static int write_graph_chunk_extra_edges(struct hashfile
*f
,
1245 struct write_commit_graph_context
*ctx
= data
;
1246 struct commit
**list
= ctx
->commits
.list
;
1247 struct commit
**last
= ctx
->commits
.list
+ ctx
->commits
.nr
;
1248 struct commit_list
*parent
;
1250 while (list
< last
) {
1251 int num_parents
= 0;
1253 display_progress(ctx
->progress
, ++ctx
->progress_cnt
);
1255 for (parent
= (*list
)->parents
; num_parents
< 3 && parent
;
1256 parent
= parent
->next
)
1259 if (num_parents
<= 2) {
1264 /* Since num_parents > 2, this initializer is safe. */
1265 for (parent
= (*list
)->parents
->next
; parent
; parent
= parent
->next
) {
1266 int edge_value
= oid_pos(&parent
->item
->object
.oid
,
1271 if (edge_value
>= 0)
1272 edge_value
+= ctx
->new_num_commits_in_base
;
1273 else if (ctx
->new_base_graph
) {
1275 if (find_commit_pos_in_graph(parent
->item
,
1276 ctx
->new_base_graph
,
1282 BUG("missing parent %s for commit %s",
1283 oid_to_hex(&parent
->item
->object
.oid
),
1284 oid_to_hex(&(*list
)->object
.oid
));
1285 else if (!parent
->next
)
1286 edge_value
|= GRAPH_LAST_EDGE
;
1288 hashwrite_be32(f
, edge_value
);
1297 static int write_graph_chunk_bloom_indexes(struct hashfile
*f
,
1300 struct write_commit_graph_context
*ctx
= data
;
1301 struct commit
**list
= ctx
->commits
.list
;
1302 struct commit
**last
= ctx
->commits
.list
+ ctx
->commits
.nr
;
1303 uint32_t cur_pos
= 0;
1305 while (list
< last
) {
1306 struct bloom_filter
*filter
= get_bloom_filter(ctx
->r
, *list
);
1307 size_t len
= filter
? filter
->len
: 0;
1309 display_progress(ctx
->progress
, ++ctx
->progress_cnt
);
1310 hashwrite_be32(f
, cur_pos
);
1317 static void trace2_bloom_filter_settings(struct write_commit_graph_context
*ctx
)
1319 struct json_writer jw
= JSON_WRITER_INIT
;
1321 jw_object_begin(&jw
, 0);
1322 jw_object_intmax(&jw
, "hash_version", ctx
->bloom_settings
->hash_version
);
1323 jw_object_intmax(&jw
, "num_hashes", ctx
->bloom_settings
->num_hashes
);
1324 jw_object_intmax(&jw
, "bits_per_entry", ctx
->bloom_settings
->bits_per_entry
);
1325 jw_object_intmax(&jw
, "max_changed_paths", ctx
->bloom_settings
->max_changed_paths
);
1328 trace2_data_json("bloom", ctx
->r
, "settings", &jw
);
1333 static int write_graph_chunk_bloom_data(struct hashfile
*f
,
1336 struct write_commit_graph_context
*ctx
= data
;
1337 struct commit
**list
= ctx
->commits
.list
;
1338 struct commit
**last
= ctx
->commits
.list
+ ctx
->commits
.nr
;
1340 trace2_bloom_filter_settings(ctx
);
1342 hashwrite_be32(f
, ctx
->bloom_settings
->hash_version
);
1343 hashwrite_be32(f
, ctx
->bloom_settings
->num_hashes
);
1344 hashwrite_be32(f
, ctx
->bloom_settings
->bits_per_entry
);
1346 while (list
< last
) {
1347 struct bloom_filter
*filter
= get_bloom_filter(ctx
->r
, *list
);
1348 size_t len
= filter
? filter
->len
: 0;
1350 display_progress(ctx
->progress
, ++ctx
->progress_cnt
);
1352 hashwrite(f
, filter
->data
, len
* sizeof(unsigned char));
1359 static int add_packed_commits(const struct object_id
*oid
,
1360 struct packed_git
*pack
,
1364 struct write_commit_graph_context
*ctx
= (struct write_commit_graph_context
*)data
;
1365 enum object_type type
;
1366 off_t offset
= nth_packed_object_offset(pack
, pos
);
1367 struct object_info oi
= OBJECT_INFO_INIT
;
1370 display_progress(ctx
->progress
, ++ctx
->progress_done
);
1373 if (packed_object_info(ctx
->r
, pack
, offset
, &oi
) < 0)
1374 die(_("unable to get type of object %s"), oid_to_hex(oid
));
1376 if (type
!= OBJ_COMMIT
)
1379 oid_array_append(&ctx
->oids
, oid
);
1380 set_commit_pos(ctx
->r
, oid
);
1385 static void add_missing_parents(struct write_commit_graph_context
*ctx
, struct commit
*commit
)
1387 struct commit_list
*parent
;
1388 for (parent
= commit
->parents
; parent
; parent
= parent
->next
) {
1389 if (!(parent
->item
->object
.flags
& REACHABLE
)) {
1390 oid_array_append(&ctx
->oids
, &parent
->item
->object
.oid
);
1391 parent
->item
->object
.flags
|= REACHABLE
;
1396 static void close_reachable(struct write_commit_graph_context
*ctx
)
1399 struct commit
*commit
;
1400 enum commit_graph_split_flags flags
= ctx
->opts
?
1401 ctx
->opts
->split_flags
: COMMIT_GRAPH_SPLIT_UNSPECIFIED
;
1403 if (ctx
->report_progress
)
1404 ctx
->progress
= start_delayed_progress(
1405 _("Loading known commits in commit graph"),
1407 for (i
= 0; i
< ctx
->oids
.nr
; i
++) {
1408 display_progress(ctx
->progress
, i
+ 1);
1409 commit
= lookup_commit(ctx
->r
, &ctx
->oids
.oid
[i
]);
1411 commit
->object
.flags
|= REACHABLE
;
1413 stop_progress(&ctx
->progress
);
1416 * As this loop runs, ctx->oids.nr may grow, but not more
1417 * than the number of missing commits in the reachable
1420 if (ctx
->report_progress
)
1421 ctx
->progress
= start_delayed_progress(
1422 _("Expanding reachable commits in commit graph"),
1424 for (i
= 0; i
< ctx
->oids
.nr
; i
++) {
1425 display_progress(ctx
->progress
, i
+ 1);
1426 commit
= lookup_commit(ctx
->r
, &ctx
->oids
.oid
[i
]);
1431 if ((!repo_parse_commit(ctx
->r
, commit
) &&
1432 commit_graph_position(commit
) == COMMIT_NOT_FROM_GRAPH
) ||
1433 flags
== COMMIT_GRAPH_SPLIT_REPLACE
)
1434 add_missing_parents(ctx
, commit
);
1435 } else if (!repo_parse_commit_no_graph(ctx
->r
, commit
))
1436 add_missing_parents(ctx
, commit
);
1438 stop_progress(&ctx
->progress
);
1440 if (ctx
->report_progress
)
1441 ctx
->progress
= start_delayed_progress(
1442 _("Clearing commit marks in commit graph"),
1444 for (i
= 0; i
< ctx
->oids
.nr
; i
++) {
1445 display_progress(ctx
->progress
, i
+ 1);
1446 commit
= lookup_commit(ctx
->r
, &ctx
->oids
.oid
[i
]);
1449 commit
->object
.flags
&= ~REACHABLE
;
1451 stop_progress(&ctx
->progress
);
1454 struct compute_generation_info
{
1455 struct repository
*r
;
1456 struct packed_commit_list
*commits
;
1457 struct progress
*progress
;
1460 timestamp_t (*get_generation
)(struct commit
*c
, void *data
);
1461 void (*set_generation
)(struct commit
*c
, timestamp_t gen
, void *data
);
1465 static timestamp_t
compute_generation_from_max(struct commit
*c
,
1466 timestamp_t max_gen
,
1467 int generation_version
)
1469 switch (generation_version
) {
1470 case 1: /* topological levels */
1471 if (max_gen
> GENERATION_NUMBER_V1_MAX
- 1)
1472 max_gen
= GENERATION_NUMBER_V1_MAX
- 1;
1475 case 2: /* corrected commit date */
1476 if (c
->date
&& c
->date
> max_gen
)
1477 max_gen
= c
->date
- 1;
1481 BUG("attempting unimplemented version");
1485 static void compute_reachable_generation_numbers(
1486 struct compute_generation_info
*info
,
1487 int generation_version
)
1490 struct commit_list
*list
= NULL
;
1492 for (i
= 0; i
< info
->commits
->nr
; i
++) {
1493 struct commit
*c
= info
->commits
->list
[i
];
1495 repo_parse_commit(info
->r
, c
);
1496 gen
= info
->get_generation(c
, info
->data
);
1497 display_progress(info
->progress
, info
->progress_cnt
+ 1);
1499 if (gen
!= GENERATION_NUMBER_ZERO
&& gen
!= GENERATION_NUMBER_INFINITY
)
1502 commit_list_insert(c
, &list
);
1504 struct commit
*current
= list
->item
;
1505 struct commit_list
*parent
;
1506 int all_parents_computed
= 1;
1507 uint32_t max_gen
= 0;
1509 for (parent
= current
->parents
; parent
; parent
= parent
->next
) {
1510 repo_parse_commit(info
->r
, parent
->item
);
1511 gen
= info
->get_generation(parent
->item
, info
->data
);
1513 if (gen
== GENERATION_NUMBER_ZERO
) {
1514 all_parents_computed
= 0;
1515 commit_list_insert(parent
->item
, &list
);
1523 if (all_parents_computed
) {
1525 gen
= compute_generation_from_max(
1527 generation_version
);
1528 info
->set_generation(current
, gen
, info
->data
);
1534 static timestamp_t
get_topo_level(struct commit
*c
, void *data
)
1536 struct write_commit_graph_context
*ctx
= data
;
1537 return *topo_level_slab_at(ctx
->topo_levels
, c
);
1540 static void set_topo_level(struct commit
*c
, timestamp_t t
, void *data
)
1542 struct write_commit_graph_context
*ctx
= data
;
1543 *topo_level_slab_at(ctx
->topo_levels
, c
) = (uint32_t)t
;
1546 static void compute_topological_levels(struct write_commit_graph_context
*ctx
)
1548 struct compute_generation_info info
= {
1550 .commits
= &ctx
->commits
,
1551 .get_generation
= get_topo_level
,
1552 .set_generation
= set_topo_level
,
1556 if (ctx
->report_progress
)
1557 info
.progress
= ctx
->progress
1558 = start_delayed_progress(
1559 _("Computing commit graph topological levels"),
1562 compute_reachable_generation_numbers(&info
, 1);
1564 stop_progress(&ctx
->progress
);
1567 static timestamp_t
get_generation_from_graph_data(struct commit
*c
, void *data
)
1569 return commit_graph_data_at(c
)->generation
;
1572 static void set_generation_v2(struct commit
*c
, timestamp_t t
, void *data
)
1574 struct commit_graph_data
*g
= commit_graph_data_at(c
);
1578 static void compute_generation_numbers(struct write_commit_graph_context
*ctx
)
1581 struct compute_generation_info info
= {
1583 .commits
= &ctx
->commits
,
1584 .get_generation
= get_generation_from_graph_data
,
1585 .set_generation
= set_generation_v2
,
1589 if (ctx
->report_progress
)
1590 info
.progress
= ctx
->progress
1591 = start_delayed_progress(
1592 _("Computing commit graph generation numbers"),
1595 if (!ctx
->trust_generation_numbers
) {
1596 for (i
= 0; i
< ctx
->commits
.nr
; i
++) {
1597 struct commit
*c
= ctx
->commits
.list
[i
];
1598 repo_parse_commit(ctx
->r
, c
);
1599 commit_graph_data_at(c
)->generation
= GENERATION_NUMBER_ZERO
;
1603 compute_reachable_generation_numbers(&info
, 2);
1605 for (i
= 0; i
< ctx
->commits
.nr
; i
++) {
1606 struct commit
*c
= ctx
->commits
.list
[i
];
1607 timestamp_t offset
= commit_graph_data_at(c
)->generation
- c
->date
;
1608 if (offset
> GENERATION_NUMBER_V2_OFFSET_MAX
)
1609 ctx
->num_generation_data_overflows
++;
1611 stop_progress(&ctx
->progress
);
1614 static void set_generation_in_graph_data(struct commit
*c
, timestamp_t t
,
1617 commit_graph_data_at(c
)->generation
= t
;
1621 * After this method, all commits reachable from those in the given
1622 * list will have non-zero, non-infinite generation numbers.
1624 void ensure_generations_valid(struct repository
*r
,
1625 struct commit
**commits
, size_t nr
)
1627 int generation_version
= get_configured_generation_version(r
);
1628 struct packed_commit_list list
= {
1633 struct compute_generation_info info
= {
1636 .get_generation
= get_generation_from_graph_data
,
1637 .set_generation
= set_generation_in_graph_data
,
1640 compute_reachable_generation_numbers(&info
, generation_version
);
1643 static void trace2_bloom_filter_write_statistics(struct write_commit_graph_context
*ctx
)
1645 trace2_data_intmax("commit-graph", ctx
->r
, "filter-computed",
1646 ctx
->count_bloom_filter_computed
);
1647 trace2_data_intmax("commit-graph", ctx
->r
, "filter-not-computed",
1648 ctx
->count_bloom_filter_not_computed
);
1649 trace2_data_intmax("commit-graph", ctx
->r
, "filter-trunc-empty",
1650 ctx
->count_bloom_filter_trunc_empty
);
1651 trace2_data_intmax("commit-graph", ctx
->r
, "filter-trunc-large",
1652 ctx
->count_bloom_filter_trunc_large
);
1655 static void compute_bloom_filters(struct write_commit_graph_context
*ctx
)
1658 struct progress
*progress
= NULL
;
1659 struct commit
**sorted_commits
;
1660 int max_new_filters
;
1662 init_bloom_filters();
1664 if (ctx
->report_progress
)
1665 progress
= start_delayed_progress(
1666 _("Computing commit changed paths Bloom filters"),
1669 DUP_ARRAY(sorted_commits
, ctx
->commits
.list
, ctx
->commits
.nr
);
1671 if (ctx
->order_by_pack
)
1672 QSORT(sorted_commits
, ctx
->commits
.nr
, commit_pos_cmp
);
1674 QSORT(sorted_commits
, ctx
->commits
.nr
, commit_gen_cmp
);
1676 max_new_filters
= ctx
->opts
&& ctx
->opts
->max_new_filters
>= 0 ?
1677 ctx
->opts
->max_new_filters
: ctx
->commits
.nr
;
1679 for (i
= 0; i
< ctx
->commits
.nr
; i
++) {
1680 enum bloom_filter_computed computed
= 0;
1681 struct commit
*c
= sorted_commits
[i
];
1682 struct bloom_filter
*filter
= get_or_compute_bloom_filter(
1685 ctx
->count_bloom_filter_computed
< max_new_filters
,
1686 ctx
->bloom_settings
,
1688 if (computed
& BLOOM_COMPUTED
) {
1689 ctx
->count_bloom_filter_computed
++;
1690 if (computed
& BLOOM_TRUNC_EMPTY
)
1691 ctx
->count_bloom_filter_trunc_empty
++;
1692 if (computed
& BLOOM_TRUNC_LARGE
)
1693 ctx
->count_bloom_filter_trunc_large
++;
1694 } else if (computed
& BLOOM_NOT_COMPUTED
)
1695 ctx
->count_bloom_filter_not_computed
++;
1696 ctx
->total_bloom_filter_data_size
+= filter
1697 ? sizeof(unsigned char) * filter
->len
: 0;
1698 display_progress(progress
, i
+ 1);
1701 if (trace2_is_enabled())
1702 trace2_bloom_filter_write_statistics(ctx
);
1704 free(sorted_commits
);
1705 stop_progress(&progress
);
1708 struct refs_cb_data
{
1709 struct oidset
*commits
;
1710 struct progress
*progress
;
1713 static int add_ref_to_set(const char *refname UNUSED
,
1714 const struct object_id
*oid
,
1715 int flags UNUSED
, void *cb_data
)
1717 struct object_id peeled
;
1718 struct refs_cb_data
*data
= (struct refs_cb_data
*)cb_data
;
1720 if (!peel_iterated_oid(oid
, &peeled
))
1722 if (oid_object_info(the_repository
, oid
, NULL
) == OBJ_COMMIT
)
1723 oidset_insert(data
->commits
, oid
);
1725 display_progress(data
->progress
, oidset_size(data
->commits
));
1730 int write_commit_graph_reachable(struct object_directory
*odb
,
1731 enum commit_graph_write_flags flags
,
1732 const struct commit_graph_opts
*opts
)
1734 struct oidset commits
= OIDSET_INIT
;
1735 struct refs_cb_data data
;
1738 memset(&data
, 0, sizeof(data
));
1739 data
.commits
= &commits
;
1740 if (flags
& COMMIT_GRAPH_WRITE_PROGRESS
)
1741 data
.progress
= start_delayed_progress(
1742 _("Collecting referenced commits"), 0);
1744 for_each_ref(add_ref_to_set
, &data
);
1746 stop_progress(&data
.progress
);
1748 result
= write_commit_graph(odb
, NULL
, &commits
,
1751 oidset_clear(&commits
);
1755 static int fill_oids_from_packs(struct write_commit_graph_context
*ctx
,
1756 const struct string_list
*pack_indexes
)
1759 struct strbuf progress_title
= STRBUF_INIT
;
1760 struct strbuf packname
= STRBUF_INIT
;
1764 strbuf_addf(&packname
, "%s/pack/", ctx
->odb
->path
);
1765 dirlen
= packname
.len
;
1766 if (ctx
->report_progress
) {
1767 strbuf_addf(&progress_title
,
1768 Q_("Finding commits for commit graph in %"PRIuMAX
" pack",
1769 "Finding commits for commit graph in %"PRIuMAX
" packs",
1771 (uintmax_t)pack_indexes
->nr
);
1772 ctx
->progress
= start_delayed_progress(progress_title
.buf
, 0);
1773 ctx
->progress_done
= 0;
1775 for (i
= 0; i
< pack_indexes
->nr
; i
++) {
1776 struct packed_git
*p
;
1777 strbuf_setlen(&packname
, dirlen
);
1778 strbuf_addstr(&packname
, pack_indexes
->items
[i
].string
);
1779 p
= add_packed_git(packname
.buf
, packname
.len
, 1);
1781 ret
= error(_("error adding pack %s"), packname
.buf
);
1784 if (open_pack_index(p
)) {
1785 ret
= error(_("error opening index for %s"), packname
.buf
);
1788 for_each_object_in_pack(p
, add_packed_commits
, ctx
,
1789 FOR_EACH_OBJECT_PACK_ORDER
);
1795 stop_progress(&ctx
->progress
);
1796 strbuf_release(&progress_title
);
1797 strbuf_release(&packname
);
1802 static int fill_oids_from_commits(struct write_commit_graph_context
*ctx
,
1803 struct oidset
*commits
)
1805 struct oidset_iter iter
;
1806 struct object_id
*oid
;
1808 if (!oidset_size(commits
))
1811 oidset_iter_init(commits
, &iter
);
1812 while ((oid
= oidset_iter_next(&iter
))) {
1813 oid_array_append(&ctx
->oids
, oid
);
1819 static void fill_oids_from_all_packs(struct write_commit_graph_context
*ctx
)
1821 if (ctx
->report_progress
)
1822 ctx
->progress
= start_delayed_progress(
1823 _("Finding commits for commit graph among packed objects"),
1824 ctx
->approx_nr_objects
);
1825 for_each_packed_object(add_packed_commits
, ctx
,
1826 FOR_EACH_OBJECT_PACK_ORDER
);
1827 if (ctx
->progress_done
< ctx
->approx_nr_objects
)
1828 display_progress(ctx
->progress
, ctx
->approx_nr_objects
);
1829 stop_progress(&ctx
->progress
);
1832 static void copy_oids_to_commits(struct write_commit_graph_context
*ctx
)
1835 enum commit_graph_split_flags flags
= ctx
->opts
?
1836 ctx
->opts
->split_flags
: COMMIT_GRAPH_SPLIT_UNSPECIFIED
;
1838 ctx
->num_extra_edges
= 0;
1839 if (ctx
->report_progress
)
1840 ctx
->progress
= start_delayed_progress(
1841 _("Finding extra edges in commit graph"),
1843 oid_array_sort(&ctx
->oids
);
1844 for (i
= 0; i
< ctx
->oids
.nr
; i
= oid_array_next_unique(&ctx
->oids
, i
)) {
1845 unsigned int num_parents
;
1847 display_progress(ctx
->progress
, i
+ 1);
1849 ALLOC_GROW(ctx
->commits
.list
, ctx
->commits
.nr
+ 1, ctx
->commits
.alloc
);
1850 ctx
->commits
.list
[ctx
->commits
.nr
] = lookup_commit(ctx
->r
, &ctx
->oids
.oid
[i
]);
1852 if (ctx
->split
&& flags
!= COMMIT_GRAPH_SPLIT_REPLACE
&&
1853 commit_graph_position(ctx
->commits
.list
[ctx
->commits
.nr
]) != COMMIT_NOT_FROM_GRAPH
)
1856 if (ctx
->split
&& flags
== COMMIT_GRAPH_SPLIT_REPLACE
)
1857 repo_parse_commit(ctx
->r
, ctx
->commits
.list
[ctx
->commits
.nr
]);
1859 repo_parse_commit_no_graph(ctx
->r
, ctx
->commits
.list
[ctx
->commits
.nr
]);
1861 num_parents
= commit_list_count(ctx
->commits
.list
[ctx
->commits
.nr
]->parents
);
1862 if (num_parents
> 2)
1863 ctx
->num_extra_edges
+= num_parents
- 1;
1867 stop_progress(&ctx
->progress
);
1870 static int write_graph_chunk_base_1(struct hashfile
*f
,
1871 struct commit_graph
*g
)
1878 num
= write_graph_chunk_base_1(f
, g
->base_graph
);
1879 hashwrite(f
, g
->oid
.hash
, the_hash_algo
->rawsz
);
1883 static int write_graph_chunk_base(struct hashfile
*f
,
1886 struct write_commit_graph_context
*ctx
= data
;
1887 int num
= write_graph_chunk_base_1(f
, ctx
->new_base_graph
);
1889 if (num
!= ctx
->num_commit_graphs_after
- 1) {
1890 error(_("failed to write correct number of base graph ids"));
1897 static int write_commit_graph_file(struct write_commit_graph_context
*ctx
)
1902 struct lock_file lk
= LOCK_INIT
;
1903 const unsigned hashsz
= the_hash_algo
->rawsz
;
1904 struct strbuf progress_title
= STRBUF_INIT
;
1905 struct chunkfile
*cf
;
1906 unsigned char file_hash
[GIT_MAX_RAWSZ
];
1909 struct strbuf tmp_file
= STRBUF_INIT
;
1911 strbuf_addf(&tmp_file
,
1912 "%s/info/commit-graphs/tmp_graph_XXXXXX",
1914 ctx
->graph_name
= strbuf_detach(&tmp_file
, NULL
);
1916 ctx
->graph_name
= get_commit_graph_filename(ctx
->odb
);
1919 if (safe_create_leading_directories(ctx
->graph_name
)) {
1920 UNLEAK(ctx
->graph_name
);
1921 error(_("unable to create leading directories of %s"),
1927 char *lock_name
= get_commit_graph_chain_filename(ctx
->odb
);
1929 hold_lock_file_for_update_mode(&lk
, lock_name
,
1930 LOCK_DIE_ON_ERROR
, 0444);
1933 fd
= git_mkstemp_mode(ctx
->graph_name
, 0444);
1935 error(_("unable to create temporary graph layer"));
1939 if (adjust_shared_perm(ctx
->graph_name
)) {
1940 error(_("unable to adjust shared permissions for '%s'"),
1945 f
= hashfd(fd
, ctx
->graph_name
);
1947 hold_lock_file_for_update_mode(&lk
, ctx
->graph_name
,
1948 LOCK_DIE_ON_ERROR
, 0444);
1949 fd
= get_lock_file_fd(&lk
);
1950 f
= hashfd(fd
, get_lock_file_path(&lk
));
1953 cf
= init_chunkfile(f
);
1955 add_chunk(cf
, GRAPH_CHUNKID_OIDFANOUT
, GRAPH_FANOUT_SIZE
,
1956 write_graph_chunk_fanout
);
1957 add_chunk(cf
, GRAPH_CHUNKID_OIDLOOKUP
, hashsz
* ctx
->commits
.nr
,
1958 write_graph_chunk_oids
);
1959 add_chunk(cf
, GRAPH_CHUNKID_DATA
, (hashsz
+ 16) * ctx
->commits
.nr
,
1960 write_graph_chunk_data
);
1962 if (ctx
->write_generation_data
)
1963 add_chunk(cf
, GRAPH_CHUNKID_GENERATION_DATA
,
1964 sizeof(uint32_t) * ctx
->commits
.nr
,
1965 write_graph_chunk_generation_data
);
1966 if (ctx
->num_generation_data_overflows
)
1967 add_chunk(cf
, GRAPH_CHUNKID_GENERATION_DATA_OVERFLOW
,
1968 sizeof(timestamp_t
) * ctx
->num_generation_data_overflows
,
1969 write_graph_chunk_generation_data_overflow
);
1970 if (ctx
->num_extra_edges
)
1971 add_chunk(cf
, GRAPH_CHUNKID_EXTRAEDGES
,
1972 4 * ctx
->num_extra_edges
,
1973 write_graph_chunk_extra_edges
);
1974 if (ctx
->changed_paths
) {
1975 add_chunk(cf
, GRAPH_CHUNKID_BLOOMINDEXES
,
1976 sizeof(uint32_t) * ctx
->commits
.nr
,
1977 write_graph_chunk_bloom_indexes
);
1978 add_chunk(cf
, GRAPH_CHUNKID_BLOOMDATA
,
1979 sizeof(uint32_t) * 3
1980 + ctx
->total_bloom_filter_data_size
,
1981 write_graph_chunk_bloom_data
);
1983 if (ctx
->num_commit_graphs_after
> 1)
1984 add_chunk(cf
, GRAPH_CHUNKID_BASE
,
1985 hashsz
* (ctx
->num_commit_graphs_after
- 1),
1986 write_graph_chunk_base
);
1988 hashwrite_be32(f
, GRAPH_SIGNATURE
);
1990 hashwrite_u8(f
, GRAPH_VERSION
);
1991 hashwrite_u8(f
, oid_version(the_hash_algo
));
1992 hashwrite_u8(f
, get_num_chunks(cf
));
1993 hashwrite_u8(f
, ctx
->num_commit_graphs_after
- 1);
1995 if (ctx
->report_progress
) {
1996 strbuf_addf(&progress_title
,
1997 Q_("Writing out commit graph in %d pass",
1998 "Writing out commit graph in %d passes",
1999 get_num_chunks(cf
)),
2000 get_num_chunks(cf
));
2001 ctx
->progress
= start_delayed_progress(
2003 get_num_chunks(cf
) * ctx
->commits
.nr
);
2006 write_chunkfile(cf
, ctx
);
2008 stop_progress(&ctx
->progress
);
2009 strbuf_release(&progress_title
);
2011 if (ctx
->split
&& ctx
->base_graph_name
&& ctx
->num_commit_graphs_after
> 1) {
2012 char *new_base_hash
= xstrdup(oid_to_hex(&ctx
->new_base_graph
->oid
));
2013 char *new_base_name
= get_split_graph_filename(ctx
->new_base_graph
->odb
, new_base_hash
);
2015 free(ctx
->commit_graph_filenames_after
[ctx
->num_commit_graphs_after
- 2]);
2016 free(ctx
->commit_graph_hash_after
[ctx
->num_commit_graphs_after
- 2]);
2017 ctx
->commit_graph_filenames_after
[ctx
->num_commit_graphs_after
- 2] = new_base_name
;
2018 ctx
->commit_graph_hash_after
[ctx
->num_commit_graphs_after
- 2] = new_base_hash
;
2021 close_commit_graph(ctx
->r
->objects
);
2022 finalize_hashfile(f
, file_hash
, FSYNC_COMPONENT_COMMIT_GRAPH
,
2023 CSUM_HASH_IN_STREAM
| CSUM_FSYNC
);
2027 FILE *chainf
= fdopen_lock_file(&lk
, "w");
2028 char *final_graph_name
;
2034 error(_("unable to open commit-graph chain file"));
2038 if (ctx
->base_graph_name
) {
2040 int idx
= ctx
->num_commit_graphs_after
- 1;
2041 if (ctx
->num_commit_graphs_after
> 1)
2044 dest
= ctx
->commit_graph_filenames_after
[idx
];
2046 if (strcmp(ctx
->base_graph_name
, dest
)) {
2047 result
= rename(ctx
->base_graph_name
, dest
);
2050 error(_("failed to rename base commit-graph file"));
2055 char *graph_name
= get_commit_graph_filename(ctx
->odb
);
2060 ctx
->commit_graph_hash_after
[ctx
->num_commit_graphs_after
- 1] = xstrdup(hash_to_hex(file_hash
));
2061 final_graph_name
= get_split_graph_filename(ctx
->odb
,
2062 ctx
->commit_graph_hash_after
[ctx
->num_commit_graphs_after
- 1]);
2063 ctx
->commit_graph_filenames_after
[ctx
->num_commit_graphs_after
- 1] = final_graph_name
;
2065 result
= rename(ctx
->graph_name
, final_graph_name
);
2067 for (i
= 0; i
< ctx
->num_commit_graphs_after
; i
++)
2068 fprintf(get_lock_file_fp(&lk
), "%s\n", ctx
->commit_graph_hash_after
[i
]);
2071 error(_("failed to rename temporary commit-graph file"));
2076 commit_lock_file(&lk
);
2081 static void split_graph_merge_strategy(struct write_commit_graph_context
*ctx
)
2083 struct commit_graph
*g
;
2084 uint32_t num_commits
;
2085 enum commit_graph_split_flags flags
= COMMIT_GRAPH_SPLIT_UNSPECIFIED
;
2088 int max_commits
= 0;
2092 max_commits
= ctx
->opts
->max_commits
;
2094 if (ctx
->opts
->size_multiple
)
2095 size_mult
= ctx
->opts
->size_multiple
;
2097 flags
= ctx
->opts
->split_flags
;
2100 g
= ctx
->r
->objects
->commit_graph
;
2101 num_commits
= ctx
->commits
.nr
;
2102 if (flags
== COMMIT_GRAPH_SPLIT_REPLACE
)
2103 ctx
->num_commit_graphs_after
= 1;
2105 ctx
->num_commit_graphs_after
= ctx
->num_commit_graphs_before
+ 1;
2107 if (flags
!= COMMIT_GRAPH_SPLIT_MERGE_PROHIBITED
&&
2108 flags
!= COMMIT_GRAPH_SPLIT_REPLACE
) {
2109 while (g
&& (g
->num_commits
<= size_mult
* num_commits
||
2110 (max_commits
&& num_commits
> max_commits
))) {
2111 if (g
->odb
!= ctx
->odb
)
2114 num_commits
+= g
->num_commits
;
2117 ctx
->num_commit_graphs_after
--;
2121 if (flags
!= COMMIT_GRAPH_SPLIT_REPLACE
)
2122 ctx
->new_base_graph
= g
;
2123 else if (ctx
->num_commit_graphs_after
!= 1)
2124 BUG("split_graph_merge_strategy: num_commit_graphs_after "
2125 "should be 1 with --split=replace");
2127 if (ctx
->num_commit_graphs_after
== 2) {
2128 char *old_graph_name
= get_commit_graph_filename(g
->odb
);
2130 if (!strcmp(g
->filename
, old_graph_name
) &&
2131 g
->odb
!= ctx
->odb
) {
2132 ctx
->num_commit_graphs_after
= 1;
2133 ctx
->new_base_graph
= NULL
;
2136 free(old_graph_name
);
2139 CALLOC_ARRAY(ctx
->commit_graph_filenames_after
, ctx
->num_commit_graphs_after
);
2140 CALLOC_ARRAY(ctx
->commit_graph_hash_after
, ctx
->num_commit_graphs_after
);
2142 for (i
= 0; i
< ctx
->num_commit_graphs_after
&&
2143 i
< ctx
->num_commit_graphs_before
; i
++)
2144 ctx
->commit_graph_filenames_after
[i
] = xstrdup(ctx
->commit_graph_filenames_before
[i
]);
2146 i
= ctx
->num_commit_graphs_before
- 1;
2147 g
= ctx
->r
->objects
->commit_graph
;
2150 if (i
< ctx
->num_commit_graphs_after
)
2151 ctx
->commit_graph_hash_after
[i
] = xstrdup(oid_to_hex(&g
->oid
));
2154 * If the topmost remaining layer has generation data chunk, the
2155 * resultant layer also has generation data chunk.
2157 if (i
== ctx
->num_commit_graphs_after
- 2)
2158 ctx
->write_generation_data
= !!g
->chunk_generation_data
;
2165 static void merge_commit_graph(struct write_commit_graph_context
*ctx
,
2166 struct commit_graph
*g
)
2169 uint32_t offset
= g
->num_commits_in_base
;
2171 ALLOC_GROW(ctx
->commits
.list
, ctx
->commits
.nr
+ g
->num_commits
, ctx
->commits
.alloc
);
2173 for (i
= 0; i
< g
->num_commits
; i
++) {
2174 struct object_id oid
;
2175 struct commit
*result
;
2177 display_progress(ctx
->progress
, i
+ 1);
2179 load_oid_from_graph(g
, i
+ offset
, &oid
);
2181 /* only add commits if they still exist in the repo */
2182 result
= lookup_commit_reference_gently(ctx
->r
, &oid
, 1);
2185 ctx
->commits
.list
[ctx
->commits
.nr
] = result
;
2191 static int commit_compare(const void *_a
, const void *_b
)
2193 const struct commit
*a
= *(const struct commit
**)_a
;
2194 const struct commit
*b
= *(const struct commit
**)_b
;
2195 return oidcmp(&a
->object
.oid
, &b
->object
.oid
);
2198 static void sort_and_scan_merged_commits(struct write_commit_graph_context
*ctx
)
2200 uint32_t i
, dedup_i
= 0;
2202 if (ctx
->report_progress
)
2203 ctx
->progress
= start_delayed_progress(
2204 _("Scanning merged commits"),
2207 QSORT(ctx
->commits
.list
, ctx
->commits
.nr
, commit_compare
);
2209 ctx
->num_extra_edges
= 0;
2210 for (i
= 0; i
< ctx
->commits
.nr
; i
++) {
2211 display_progress(ctx
->progress
, i
+ 1);
2213 if (i
&& oideq(&ctx
->commits
.list
[i
- 1]->object
.oid
,
2214 &ctx
->commits
.list
[i
]->object
.oid
)) {
2216 * Silently ignore duplicates. These were likely
2217 * created due to a commit appearing in multiple
2218 * layers of the chain, which is unexpected but
2219 * not invalid. We should make sure there is a
2220 * unique copy in the new layer.
2223 unsigned int num_parents
;
2225 ctx
->commits
.list
[dedup_i
] = ctx
->commits
.list
[i
];
2228 num_parents
= commit_list_count(ctx
->commits
.list
[i
]->parents
);
2229 if (num_parents
> 2)
2230 ctx
->num_extra_edges
+= num_parents
- 1;
2234 ctx
->commits
.nr
= dedup_i
;
2236 stop_progress(&ctx
->progress
);
2239 static void merge_commit_graphs(struct write_commit_graph_context
*ctx
)
2241 struct commit_graph
*g
= ctx
->r
->objects
->commit_graph
;
2242 uint32_t current_graph_number
= ctx
->num_commit_graphs_before
;
2244 while (g
&& current_graph_number
>= ctx
->num_commit_graphs_after
) {
2245 current_graph_number
--;
2247 if (ctx
->report_progress
)
2248 ctx
->progress
= start_delayed_progress(_("Merging commit-graph"), 0);
2250 merge_commit_graph(ctx
, g
);
2251 stop_progress(&ctx
->progress
);
2257 ctx
->new_base_graph
= g
;
2258 ctx
->new_num_commits_in_base
= g
->num_commits
+ g
->num_commits_in_base
;
2261 if (ctx
->new_base_graph
)
2262 ctx
->base_graph_name
= xstrdup(ctx
->new_base_graph
->filename
);
2264 sort_and_scan_merged_commits(ctx
);
2267 static void mark_commit_graphs(struct write_commit_graph_context
*ctx
)
2270 time_t now
= time(NULL
);
2272 for (i
= ctx
->num_commit_graphs_after
- 1; i
< ctx
->num_commit_graphs_before
; i
++) {
2274 struct utimbuf updated_time
;
2276 if (stat(ctx
->commit_graph_filenames_before
[i
], &st
) < 0)
2279 updated_time
.actime
= st
.st_atime
;
2280 updated_time
.modtime
= now
;
2281 utime(ctx
->commit_graph_filenames_before
[i
], &updated_time
);
2285 static void expire_commit_graphs(struct write_commit_graph_context
*ctx
)
2287 struct strbuf path
= STRBUF_INIT
;
2291 timestamp_t expire_time
= time(NULL
);
2293 if (ctx
->opts
&& ctx
->opts
->expire_time
)
2294 expire_time
= ctx
->opts
->expire_time
;
2296 char *chain_file_name
= get_commit_graph_chain_filename(ctx
->odb
);
2297 unlink(chain_file_name
);
2298 free(chain_file_name
);
2299 ctx
->num_commit_graphs_after
= 0;
2302 strbuf_addstr(&path
, ctx
->odb
->path
);
2303 strbuf_addstr(&path
, "/info/commit-graphs");
2304 dir
= opendir(path
.buf
);
2309 strbuf_addch(&path
, '/');
2310 dirnamelen
= path
.len
;
2311 while ((de
= readdir(dir
)) != NULL
) {
2313 uint32_t i
, found
= 0;
2315 strbuf_setlen(&path
, dirnamelen
);
2316 strbuf_addstr(&path
, de
->d_name
);
2318 if (stat(path
.buf
, &st
) < 0)
2321 if (st
.st_mtime
> expire_time
)
2323 if (path
.len
< 6 || strcmp(path
.buf
+ path
.len
- 6, ".graph"))
2326 for (i
= 0; i
< ctx
->num_commit_graphs_after
; i
++) {
2327 if (!strcmp(ctx
->commit_graph_filenames_after
[i
],
2341 strbuf_release(&path
);
2344 int write_commit_graph(struct object_directory
*odb
,
2345 const struct string_list
*const pack_indexes
,
2346 struct oidset
*commits
,
2347 enum commit_graph_write_flags flags
,
2348 const struct commit_graph_opts
*opts
)
2350 struct repository
*r
= the_repository
;
2351 struct write_commit_graph_context
*ctx
;
2355 struct bloom_filter_settings bloom_settings
= DEFAULT_BLOOM_FILTER_SETTINGS
;
2356 struct topo_level_slab topo_levels
;
2358 prepare_repo_settings(r
);
2359 if (!r
->settings
.core_commit_graph
) {
2360 warning(_("attempting to write a commit-graph, but 'core.commitGraph' is disabled"));
2363 if (!commit_graph_compatible(r
))
2366 CALLOC_ARRAY(ctx
, 1);
2369 ctx
->append
= flags
& COMMIT_GRAPH_WRITE_APPEND
? 1 : 0;
2370 ctx
->report_progress
= flags
& COMMIT_GRAPH_WRITE_PROGRESS
? 1 : 0;
2371 ctx
->split
= flags
& COMMIT_GRAPH_WRITE_SPLIT
? 1 : 0;
2373 ctx
->total_bloom_filter_data_size
= 0;
2374 ctx
->write_generation_data
= (get_configured_generation_version(r
) == 2);
2375 ctx
->num_generation_data_overflows
= 0;
2377 bloom_settings
.bits_per_entry
= git_env_ulong("GIT_TEST_BLOOM_SETTINGS_BITS_PER_ENTRY",
2378 bloom_settings
.bits_per_entry
);
2379 bloom_settings
.num_hashes
= git_env_ulong("GIT_TEST_BLOOM_SETTINGS_NUM_HASHES",
2380 bloom_settings
.num_hashes
);
2381 bloom_settings
.max_changed_paths
= git_env_ulong("GIT_TEST_BLOOM_SETTINGS_MAX_CHANGED_PATHS",
2382 bloom_settings
.max_changed_paths
);
2383 ctx
->bloom_settings
= &bloom_settings
;
2385 init_topo_level_slab(&topo_levels
);
2386 ctx
->topo_levels
= &topo_levels
;
2388 prepare_commit_graph(ctx
->r
);
2389 if (ctx
->r
->objects
->commit_graph
) {
2390 struct commit_graph
*g
= ctx
->r
->objects
->commit_graph
;
2393 g
->topo_levels
= &topo_levels
;
2398 if (flags
& COMMIT_GRAPH_WRITE_BLOOM_FILTERS
)
2399 ctx
->changed_paths
= 1;
2400 if (!(flags
& COMMIT_GRAPH_NO_WRITE_BLOOM_FILTERS
)) {
2401 struct commit_graph
*g
;
2403 g
= ctx
->r
->objects
->commit_graph
;
2405 /* We have changed-paths already. Keep them in the next graph */
2406 if (g
&& g
->chunk_bloom_data
) {
2407 ctx
->changed_paths
= 1;
2408 ctx
->bloom_settings
= g
->bloom_filter_settings
;
2413 struct commit_graph
*g
= ctx
->r
->objects
->commit_graph
;
2416 ctx
->num_commit_graphs_before
++;
2420 if (ctx
->num_commit_graphs_before
) {
2421 ALLOC_ARRAY(ctx
->commit_graph_filenames_before
, ctx
->num_commit_graphs_before
);
2422 i
= ctx
->num_commit_graphs_before
;
2423 g
= ctx
->r
->objects
->commit_graph
;
2426 ctx
->commit_graph_filenames_before
[--i
] = xstrdup(g
->filename
);
2432 replace
= ctx
->opts
->split_flags
& COMMIT_GRAPH_SPLIT_REPLACE
;
2435 ctx
->approx_nr_objects
= repo_approximate_object_count(the_repository
);
2437 if (ctx
->append
&& ctx
->r
->objects
->commit_graph
) {
2438 struct commit_graph
*g
= ctx
->r
->objects
->commit_graph
;
2439 for (i
= 0; i
< g
->num_commits
; i
++) {
2440 struct object_id oid
;
2441 oidread(&oid
, g
->chunk_oid_lookup
+ g
->hash_len
* i
);
2442 oid_array_append(&ctx
->oids
, &oid
);
2447 ctx
->order_by_pack
= 1;
2448 if ((res
= fill_oids_from_packs(ctx
, pack_indexes
)))
2453 if ((res
= fill_oids_from_commits(ctx
, commits
)))
2457 if (!pack_indexes
&& !commits
) {
2458 ctx
->order_by_pack
= 1;
2459 fill_oids_from_all_packs(ctx
);
2462 close_reachable(ctx
);
2464 copy_oids_to_commits(ctx
);
2466 if (ctx
->commits
.nr
>= GRAPH_EDGE_LAST_MASK
) {
2467 error(_("too many commits to write graph"));
2472 if (!ctx
->commits
.nr
&& !replace
)
2476 split_graph_merge_strategy(ctx
);
2479 merge_commit_graphs(ctx
);
2481 ctx
->num_commit_graphs_after
= 1;
2483 ctx
->trust_generation_numbers
= validate_mixed_generation_chain(ctx
->r
->objects
->commit_graph
);
2485 compute_topological_levels(ctx
);
2486 if (ctx
->write_generation_data
)
2487 compute_generation_numbers(ctx
);
2489 if (ctx
->changed_paths
)
2490 compute_bloom_filters(ctx
);
2492 res
= write_commit_graph_file(ctx
);
2495 mark_commit_graphs(ctx
);
2497 expire_commit_graphs(ctx
);
2500 free(ctx
->graph_name
);
2501 free(ctx
->commits
.list
);
2502 oid_array_clear(&ctx
->oids
);
2503 clear_topo_level_slab(&topo_levels
);
2505 if (ctx
->commit_graph_filenames_after
) {
2506 for (i
= 0; i
< ctx
->num_commit_graphs_after
; i
++) {
2507 free(ctx
->commit_graph_filenames_after
[i
]);
2508 free(ctx
->commit_graph_hash_after
[i
]);
2511 for (i
= 0; i
< ctx
->num_commit_graphs_before
; i
++)
2512 free(ctx
->commit_graph_filenames_before
[i
]);
2514 free(ctx
->commit_graph_filenames_after
);
2515 free(ctx
->commit_graph_filenames_before
);
2516 free(ctx
->commit_graph_hash_after
);
2524 #define VERIFY_COMMIT_GRAPH_ERROR_HASH 2
2525 static int verify_commit_graph_error
;
2527 __attribute__((format (printf
, 1, 2)))
2528 static void graph_report(const char *fmt
, ...)
2532 verify_commit_graph_error
= 1;
2534 vfprintf(stderr
, fmt
, ap
);
2535 fprintf(stderr
, "\n");
2539 #define GENERATION_ZERO_EXISTS 1
2540 #define GENERATION_NUMBER_EXISTS 2
2542 static int commit_graph_checksum_valid(struct commit_graph
*g
)
2544 return hashfile_checksum_valid(g
->data
, g
->data_len
);
2547 int verify_commit_graph(struct repository
*r
, struct commit_graph
*g
, int flags
)
2549 uint32_t i
, cur_fanout_pos
= 0;
2550 struct object_id prev_oid
, cur_oid
;
2551 int generation_zero
= 0;
2552 struct progress
*progress
= NULL
;
2553 int local_error
= 0;
2556 graph_report("no commit-graph file loaded");
2560 verify_commit_graph_error
= verify_commit_graph_lite(g
);
2561 if (verify_commit_graph_error
)
2562 return verify_commit_graph_error
;
2564 if (!commit_graph_checksum_valid(g
)) {
2565 graph_report(_("the commit-graph file has incorrect checksum and is likely corrupt"));
2566 verify_commit_graph_error
= VERIFY_COMMIT_GRAPH_ERROR_HASH
;
2569 for (i
= 0; i
< g
->num_commits
; i
++) {
2570 struct commit
*graph_commit
;
2572 oidread(&cur_oid
, g
->chunk_oid_lookup
+ g
->hash_len
* i
);
2574 if (i
&& oidcmp(&prev_oid
, &cur_oid
) >= 0)
2575 graph_report(_("commit-graph has incorrect OID order: %s then %s"),
2576 oid_to_hex(&prev_oid
),
2577 oid_to_hex(&cur_oid
));
2579 oidcpy(&prev_oid
, &cur_oid
);
2581 while (cur_oid
.hash
[0] > cur_fanout_pos
) {
2582 uint32_t fanout_value
= get_be32(g
->chunk_oid_fanout
+ cur_fanout_pos
);
2584 if (i
!= fanout_value
)
2585 graph_report(_("commit-graph has incorrect fanout value: fanout[%d] = %u != %u"),
2586 cur_fanout_pos
, fanout_value
, i
);
2590 graph_commit
= lookup_commit(r
, &cur_oid
);
2591 if (!parse_commit_in_graph_one(r
, g
, graph_commit
))
2592 graph_report(_("failed to parse commit %s from commit-graph"),
2593 oid_to_hex(&cur_oid
));
2596 while (cur_fanout_pos
< 256) {
2597 uint32_t fanout_value
= get_be32(g
->chunk_oid_fanout
+ cur_fanout_pos
);
2599 if (g
->num_commits
!= fanout_value
)
2600 graph_report(_("commit-graph has incorrect fanout value: fanout[%d] = %u != %u"),
2601 cur_fanout_pos
, fanout_value
, i
);
2606 if (verify_commit_graph_error
& ~VERIFY_COMMIT_GRAPH_ERROR_HASH
)
2607 return verify_commit_graph_error
;
2609 if (flags
& COMMIT_GRAPH_WRITE_PROGRESS
)
2610 progress
= start_progress(_("Verifying commits in commit graph"),
2613 for (i
= 0; i
< g
->num_commits
; i
++) {
2614 struct commit
*graph_commit
, *odb_commit
;
2615 struct commit_list
*graph_parents
, *odb_parents
;
2616 timestamp_t max_generation
= 0;
2617 timestamp_t generation
;
2619 display_progress(progress
, i
+ 1);
2620 oidread(&cur_oid
, g
->chunk_oid_lookup
+ g
->hash_len
* i
);
2622 graph_commit
= lookup_commit(r
, &cur_oid
);
2623 odb_commit
= (struct commit
*)create_object(r
, &cur_oid
, alloc_commit_node(r
));
2624 if (repo_parse_commit_internal(r
, odb_commit
, 0, 0)) {
2625 graph_report(_("failed to parse commit %s from object database for commit-graph"),
2626 oid_to_hex(&cur_oid
));
2630 if (!oideq(&get_commit_tree_in_graph_one(r
, g
, graph_commit
)->object
.oid
,
2631 get_commit_tree_oid(odb_commit
)))
2632 graph_report(_("root tree OID for commit %s in commit-graph is %s != %s"),
2633 oid_to_hex(&cur_oid
),
2634 oid_to_hex(get_commit_tree_oid(graph_commit
)),
2635 oid_to_hex(get_commit_tree_oid(odb_commit
)));
2637 graph_parents
= graph_commit
->parents
;
2638 odb_parents
= odb_commit
->parents
;
2640 while (graph_parents
) {
2642 graph_report(_("commit-graph parent list for commit %s is too long"),
2643 oid_to_hex(&cur_oid
));
2647 /* parse parent in case it is in a base graph */
2648 parse_commit_in_graph_one(r
, g
, graph_parents
->item
);
2650 if (!oideq(&graph_parents
->item
->object
.oid
, &odb_parents
->item
->object
.oid
))
2651 graph_report(_("commit-graph parent for %s is %s != %s"),
2652 oid_to_hex(&cur_oid
),
2653 oid_to_hex(&graph_parents
->item
->object
.oid
),
2654 oid_to_hex(&odb_parents
->item
->object
.oid
));
2656 generation
= commit_graph_generation(graph_parents
->item
);
2657 if (generation
> max_generation
)
2658 max_generation
= generation
;
2660 graph_parents
= graph_parents
->next
;
2661 odb_parents
= odb_parents
->next
;
2665 graph_report(_("commit-graph parent list for commit %s terminates early"),
2666 oid_to_hex(&cur_oid
));
2668 if (!commit_graph_generation(graph_commit
)) {
2669 if (generation_zero
== GENERATION_NUMBER_EXISTS
)
2670 graph_report(_("commit-graph has generation number zero for commit %s, but non-zero elsewhere"),
2671 oid_to_hex(&cur_oid
));
2672 generation_zero
= GENERATION_ZERO_EXISTS
;
2673 } else if (generation_zero
== GENERATION_ZERO_EXISTS
)
2674 graph_report(_("commit-graph has non-zero generation number for commit %s, but zero elsewhere"),
2675 oid_to_hex(&cur_oid
));
2677 if (generation_zero
== GENERATION_ZERO_EXISTS
)
2681 * If we are using topological level and one of our parents has
2682 * generation GENERATION_NUMBER_V1_MAX, then our generation is
2683 * also GENERATION_NUMBER_V1_MAX. Decrement to avoid extra logic
2684 * in the following condition.
2686 if (!g
->read_generation_data
&& max_generation
== GENERATION_NUMBER_V1_MAX
)
2689 generation
= commit_graph_generation(graph_commit
);
2690 if (generation
< max_generation
+ 1)
2691 graph_report(_("commit-graph generation for commit %s is %"PRItime
" < %"PRItime
),
2692 oid_to_hex(&cur_oid
),
2694 max_generation
+ 1);
2696 if (graph_commit
->date
!= odb_commit
->date
)
2697 graph_report(_("commit date for commit %s in commit-graph is %"PRItime
" != %"PRItime
),
2698 oid_to_hex(&cur_oid
),
2702 stop_progress(&progress
);
2704 local_error
= verify_commit_graph_error
;
2706 if (!(flags
& COMMIT_GRAPH_VERIFY_SHALLOW
) && g
->base_graph
)
2707 local_error
|= verify_commit_graph(r
, g
->base_graph
, flags
);
2712 void free_commit_graph(struct commit_graph
*g
)
2717 munmap((void *)g
->data
, g
->data_len
);
2721 free(g
->bloom_filter_settings
);
2725 void disable_commit_graph(struct repository
*r
)
2727 r
->commit_graph_disabled
= 1;