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_LARGEEDGES 0x45444745 /* "EDGE" */
26 #define GRAPH_DATA_WIDTH 36
28 #define GRAPH_VERSION_1 0x1
29 #define GRAPH_VERSION GRAPH_VERSION_1
31 #define GRAPH_OID_VERSION_SHA1 1
32 #define GRAPH_OID_LEN_SHA1 GIT_SHA1_RAWSZ
33 #define GRAPH_OID_VERSION GRAPH_OID_VERSION_SHA1
34 #define GRAPH_OID_LEN GRAPH_OID_LEN_SHA1
36 #define GRAPH_OCTOPUS_EDGES_NEEDED 0x80000000
37 #define GRAPH_PARENT_MISSING 0x7fffffff
38 #define GRAPH_EDGE_LAST_MASK 0x7fffffff
39 #define GRAPH_PARENT_NONE 0x70000000
41 #define GRAPH_LAST_EDGE 0x80000000
43 #define GRAPH_HEADER_SIZE 8
44 #define GRAPH_FANOUT_SIZE (4 * 256)
45 #define GRAPH_CHUNKLOOKUP_WIDTH 12
46 #define GRAPH_MIN_SIZE (GRAPH_HEADER_SIZE + 4 * GRAPH_CHUNKLOOKUP_WIDTH \
47 + GRAPH_FANOUT_SIZE + GRAPH_OID_LEN)
49 char *get_commit_graph_filename(const char *obj_dir
)
51 return xstrfmt("%s/info/commit-graph", obj_dir
);
54 static struct commit_graph
*alloc_commit_graph(void)
56 struct commit_graph
*g
= xcalloc(1, sizeof(*g
));
62 extern int read_replace_refs
;
64 static int commit_graph_compatible(struct repository
*r
)
69 if (read_replace_refs
) {
70 prepare_replace_object(r
);
71 if (hashmap_get_size(&r
->objects
->replace_map
->map
))
75 prepare_commit_graft(r
);
76 if (r
->parsed_objects
&& r
->parsed_objects
->grafts_nr
)
78 if (is_repository_shallow(r
))
84 struct commit_graph
*load_commit_graph_one(const char *graph_file
)
87 const unsigned char *data
, *chunk_lookup
;
91 struct commit_graph
*graph
;
92 int fd
= git_open(graph_file
);
93 uint64_t last_chunk_offset
;
94 uint32_t last_chunk_id
;
95 uint32_t graph_signature
;
96 unsigned char graph_version
, hash_version
;
100 if (fstat(fd
, &st
)) {
104 graph_size
= xsize_t(st
.st_size
);
106 if (graph_size
< GRAPH_MIN_SIZE
) {
108 die(_("graph file %s is too small"), graph_file
);
110 graph_map
= xmmap(NULL
, graph_size
, PROT_READ
, MAP_PRIVATE
, fd
, 0);
111 data
= (const unsigned char *)graph_map
;
113 graph_signature
= get_be32(data
);
114 if (graph_signature
!= GRAPH_SIGNATURE
) {
115 error(_("graph signature %X does not match signature %X"),
116 graph_signature
, GRAPH_SIGNATURE
);
120 graph_version
= *(unsigned char*)(data
+ 4);
121 if (graph_version
!= GRAPH_VERSION
) {
122 error(_("graph version %X does not match version %X"),
123 graph_version
, GRAPH_VERSION
);
127 hash_version
= *(unsigned char*)(data
+ 5);
128 if (hash_version
!= GRAPH_OID_VERSION
) {
129 error(_("hash version %X does not match version %X"),
130 hash_version
, GRAPH_OID_VERSION
);
134 graph
= alloc_commit_graph();
136 graph
->hash_len
= GRAPH_OID_LEN
;
137 graph
->num_chunks
= *(unsigned char*)(data
+ 6);
138 graph
->graph_fd
= fd
;
139 graph
->data
= graph_map
;
140 graph
->data_len
= graph_size
;
143 last_chunk_offset
= 8;
144 chunk_lookup
= data
+ 8;
145 for (i
= 0; i
< graph
->num_chunks
; i
++) {
146 uint32_t chunk_id
= get_be32(chunk_lookup
+ 0);
147 uint64_t chunk_offset
= get_be64(chunk_lookup
+ 4);
148 int chunk_repeated
= 0;
150 chunk_lookup
+= GRAPH_CHUNKLOOKUP_WIDTH
;
152 if (chunk_offset
> graph_size
- GIT_MAX_RAWSZ
) {
153 error(_("improper chunk offset %08x%08x"), (uint32_t)(chunk_offset
>> 32),
154 (uint32_t)chunk_offset
);
159 case GRAPH_CHUNKID_OIDFANOUT
:
160 if (graph
->chunk_oid_fanout
)
163 graph
->chunk_oid_fanout
= (uint32_t*)(data
+ chunk_offset
);
166 case GRAPH_CHUNKID_OIDLOOKUP
:
167 if (graph
->chunk_oid_lookup
)
170 graph
->chunk_oid_lookup
= data
+ chunk_offset
;
173 case GRAPH_CHUNKID_DATA
:
174 if (graph
->chunk_commit_data
)
177 graph
->chunk_commit_data
= data
+ chunk_offset
;
180 case GRAPH_CHUNKID_LARGEEDGES
:
181 if (graph
->chunk_large_edges
)
184 graph
->chunk_large_edges
= data
+ chunk_offset
;
188 if (chunk_repeated
) {
189 error(_("chunk id %08x appears multiple times"), chunk_id
);
193 if (last_chunk_id
== GRAPH_CHUNKID_OIDLOOKUP
)
195 graph
->num_commits
= (chunk_offset
- last_chunk_offset
)
199 last_chunk_id
= chunk_id
;
200 last_chunk_offset
= chunk_offset
;
206 munmap(graph_map
, graph_size
);
211 static void prepare_commit_graph_one(struct repository
*r
, const char *obj_dir
)
215 if (r
->objects
->commit_graph
)
218 graph_name
= get_commit_graph_filename(obj_dir
);
219 r
->objects
->commit_graph
=
220 load_commit_graph_one(graph_name
);
222 FREE_AND_NULL(graph_name
);
226 * Return 1 if commit_graph is non-NULL, and 0 otherwise.
228 * On the first invocation, this function attemps to load the commit
229 * graph if the_repository is configured to have one.
231 static int prepare_commit_graph(struct repository
*r
)
233 struct alternate_object_database
*alt
;
237 if (r
->objects
->commit_graph_attempted
)
238 return !!r
->objects
->commit_graph
;
239 r
->objects
->commit_graph_attempted
= 1;
241 if (!git_env_bool(GIT_TEST_COMMIT_GRAPH
, 0) &&
242 (repo_config_get_bool(r
, "core.commitgraph", &config_value
) ||
245 * This repository is not configured to use commit graphs, so
246 * do not load one. (But report commit_graph_attempted anyway
247 * so that commit graph loading is not attempted again for this
252 if (!commit_graph_compatible(r
))
255 obj_dir
= r
->objects
->objectdir
;
256 prepare_commit_graph_one(r
, obj_dir
);
258 for (alt
= r
->objects
->alt_odb_list
;
259 !r
->objects
->commit_graph
&& alt
;
261 prepare_commit_graph_one(r
, alt
->path
);
262 return !!r
->objects
->commit_graph
;
265 int generation_numbers_enabled(struct repository
*r
)
267 uint32_t first_generation
;
268 struct commit_graph
*g
;
269 if (!prepare_commit_graph(r
))
272 g
= r
->objects
->commit_graph
;
277 first_generation
= get_be32(g
->chunk_commit_data
+
278 g
->hash_len
+ 8) >> 2;
280 return !!first_generation
;
283 void close_commit_graph(struct repository
*r
)
285 free_commit_graph(r
->objects
->commit_graph
);
286 r
->objects
->commit_graph
= NULL
;
289 static int bsearch_graph(struct commit_graph
*g
, struct object_id
*oid
, uint32_t *pos
)
291 return bsearch_hash(oid
->hash
, g
->chunk_oid_fanout
,
292 g
->chunk_oid_lookup
, g
->hash_len
, pos
);
295 static struct commit_list
**insert_parent_or_die(struct repository
*r
,
296 struct commit_graph
*g
,
298 struct commit_list
**pptr
)
301 struct object_id oid
;
303 if (pos
>= g
->num_commits
)
304 die("invalid parent position %"PRIu64
, pos
);
306 hashcpy(oid
.hash
, g
->chunk_oid_lookup
+ g
->hash_len
* pos
);
307 c
= lookup_commit(r
, &oid
);
309 die(_("could not find commit %s"), oid_to_hex(&oid
));
311 return &commit_list_insert(c
, pptr
)->next
;
314 static void fill_commit_graph_info(struct commit
*item
, struct commit_graph
*g
, uint32_t pos
)
316 const unsigned char *commit_data
= g
->chunk_commit_data
+ GRAPH_DATA_WIDTH
* pos
;
317 item
->graph_pos
= pos
;
318 item
->generation
= get_be32(commit_data
+ g
->hash_len
+ 8) >> 2;
321 static int fill_commit_in_graph(struct repository
*r
,
323 struct commit_graph
*g
, uint32_t pos
)
326 uint32_t *parent_data_ptr
;
327 uint64_t date_low
, date_high
;
328 struct commit_list
**pptr
;
329 const unsigned char *commit_data
= g
->chunk_commit_data
+ (g
->hash_len
+ 16) * pos
;
331 item
->object
.parsed
= 1;
332 item
->graph_pos
= pos
;
334 item
->maybe_tree
= NULL
;
336 date_high
= get_be32(commit_data
+ g
->hash_len
+ 8) & 0x3;
337 date_low
= get_be32(commit_data
+ g
->hash_len
+ 12);
338 item
->date
= (timestamp_t
)((date_high
<< 32) | date_low
);
340 item
->generation
= get_be32(commit_data
+ g
->hash_len
+ 8) >> 2;
342 pptr
= &item
->parents
;
344 edge_value
= get_be32(commit_data
+ g
->hash_len
);
345 if (edge_value
== GRAPH_PARENT_NONE
)
347 pptr
= insert_parent_or_die(r
, g
, edge_value
, pptr
);
349 edge_value
= get_be32(commit_data
+ g
->hash_len
+ 4);
350 if (edge_value
== GRAPH_PARENT_NONE
)
352 if (!(edge_value
& GRAPH_OCTOPUS_EDGES_NEEDED
)) {
353 pptr
= insert_parent_or_die(r
, g
, edge_value
, pptr
);
357 parent_data_ptr
= (uint32_t*)(g
->chunk_large_edges
+
358 4 * (uint64_t)(edge_value
& GRAPH_EDGE_LAST_MASK
));
360 edge_value
= get_be32(parent_data_ptr
);
361 pptr
= insert_parent_or_die(r
, g
,
362 edge_value
& GRAPH_EDGE_LAST_MASK
,
365 } while (!(edge_value
& GRAPH_LAST_EDGE
));
370 static int find_commit_in_graph(struct commit
*item
, struct commit_graph
*g
, uint32_t *pos
)
372 if (item
->graph_pos
!= COMMIT_NOT_FROM_GRAPH
) {
373 *pos
= item
->graph_pos
;
376 return bsearch_graph(g
, &(item
->object
.oid
), pos
);
380 static int parse_commit_in_graph_one(struct repository
*r
,
381 struct commit_graph
*g
,
386 if (item
->object
.parsed
)
389 if (find_commit_in_graph(item
, g
, &pos
))
390 return fill_commit_in_graph(r
, item
, g
, pos
);
395 int parse_commit_in_graph(struct repository
*r
, struct commit
*item
)
397 if (!prepare_commit_graph(r
))
399 return parse_commit_in_graph_one(r
, r
->objects
->commit_graph
, item
);
402 void load_commit_graph_info(struct repository
*r
, struct commit
*item
)
405 if (!prepare_commit_graph(r
))
407 if (find_commit_in_graph(item
, r
->objects
->commit_graph
, &pos
))
408 fill_commit_graph_info(item
, r
->objects
->commit_graph
, pos
);
411 static struct tree
*load_tree_for_commit(struct repository
*r
,
412 struct commit_graph
*g
,
415 struct object_id oid
;
416 const unsigned char *commit_data
= g
->chunk_commit_data
+
417 GRAPH_DATA_WIDTH
* (c
->graph_pos
);
419 hashcpy(oid
.hash
, commit_data
);
420 c
->maybe_tree
= lookup_tree(r
, &oid
);
422 return c
->maybe_tree
;
425 static struct tree
*get_commit_tree_in_graph_one(struct repository
*r
,
426 struct commit_graph
*g
,
427 const struct commit
*c
)
430 return c
->maybe_tree
;
431 if (c
->graph_pos
== COMMIT_NOT_FROM_GRAPH
)
432 BUG("get_commit_tree_in_graph_one called from non-commit-graph commit");
434 return load_tree_for_commit(r
, g
, (struct commit
*)c
);
437 struct tree
*get_commit_tree_in_graph(struct repository
*r
, const struct commit
*c
)
439 return get_commit_tree_in_graph_one(r
, r
->objects
->commit_graph
, c
);
442 static void write_graph_chunk_fanout(struct hashfile
*f
,
443 struct commit
**commits
,
447 struct commit
**list
= commits
;
450 * Write the first-level table (the list is sorted,
451 * but we use a 256-entry lookup to be able to avoid
452 * having to do eight extra binary search iterations).
454 for (i
= 0; i
< 256; i
++) {
455 while (count
< nr_commits
) {
456 if ((*list
)->object
.oid
.hash
[0] != i
)
462 hashwrite_be32(f
, count
);
466 static void write_graph_chunk_oids(struct hashfile
*f
, int hash_len
,
467 struct commit
**commits
, int nr_commits
)
469 struct commit
**list
= commits
;
471 for (count
= 0; count
< nr_commits
; count
++, list
++)
472 hashwrite(f
, (*list
)->object
.oid
.hash
, (int)hash_len
);
475 static const unsigned char *commit_to_sha1(size_t index
, void *table
)
477 struct commit
**commits
= table
;
478 return commits
[index
]->object
.oid
.hash
;
481 static void write_graph_chunk_data(struct hashfile
*f
, int hash_len
,
482 struct commit
**commits
, int nr_commits
)
484 struct commit
**list
= commits
;
485 struct commit
**last
= commits
+ nr_commits
;
486 uint32_t num_extra_edges
= 0;
488 while (list
< last
) {
489 struct commit_list
*parent
;
491 uint32_t packedDate
[2];
494 hashwrite(f
, get_commit_tree_oid(*list
)->hash
, hash_len
);
496 parent
= (*list
)->parents
;
499 edge_value
= GRAPH_PARENT_NONE
;
501 edge_value
= sha1_pos(parent
->item
->object
.oid
.hash
,
507 edge_value
= GRAPH_PARENT_MISSING
;
510 hashwrite_be32(f
, edge_value
);
513 parent
= parent
->next
;
516 edge_value
= GRAPH_PARENT_NONE
;
517 else if (parent
->next
)
518 edge_value
= GRAPH_OCTOPUS_EDGES_NEEDED
| num_extra_edges
;
520 edge_value
= sha1_pos(parent
->item
->object
.oid
.hash
,
525 edge_value
= GRAPH_PARENT_MISSING
;
528 hashwrite_be32(f
, edge_value
);
530 if (edge_value
& GRAPH_OCTOPUS_EDGES_NEEDED
) {
533 parent
= parent
->next
;
537 if (sizeof((*list
)->date
) > 4)
538 packedDate
[0] = htonl(((*list
)->date
>> 32) & 0x3);
542 packedDate
[0] |= htonl((*list
)->generation
<< 2);
544 packedDate
[1] = htonl((*list
)->date
);
545 hashwrite(f
, packedDate
, 8);
551 static void write_graph_chunk_large_edges(struct hashfile
*f
,
552 struct commit
**commits
,
555 struct commit
**list
= commits
;
556 struct commit
**last
= commits
+ nr_commits
;
557 struct commit_list
*parent
;
559 while (list
< last
) {
561 for (parent
= (*list
)->parents
; num_parents
< 3 && parent
;
562 parent
= parent
->next
)
565 if (num_parents
<= 2) {
570 /* Since num_parents > 2, this initializer is safe. */
571 for (parent
= (*list
)->parents
->next
; parent
; parent
= parent
->next
) {
572 int edge_value
= sha1_pos(parent
->item
->object
.oid
.hash
,
578 edge_value
= GRAPH_PARENT_MISSING
;
579 else if (!parent
->next
)
580 edge_value
|= GRAPH_LAST_EDGE
;
582 hashwrite_be32(f
, edge_value
);
589 static int commit_compare(const void *_a
, const void *_b
)
591 const struct object_id
*a
= (const struct object_id
*)_a
;
592 const struct object_id
*b
= (const struct object_id
*)_b
;
596 struct packed_commit_list
{
597 struct commit
**list
;
602 struct packed_oid_list
{
603 struct object_id
*list
;
606 struct progress
*progress
;
610 static int add_packed_commits(const struct object_id
*oid
,
611 struct packed_git
*pack
,
615 struct packed_oid_list
*list
= (struct packed_oid_list
*)data
;
616 enum object_type type
;
617 off_t offset
= nth_packed_object_offset(pack
, pos
);
618 struct object_info oi
= OBJECT_INFO_INIT
;
621 display_progress(list
->progress
, ++list
->progress_done
);
624 if (packed_object_info(the_repository
, pack
, offset
, &oi
) < 0)
625 die(_("unable to get type of object %s"), oid_to_hex(oid
));
627 if (type
!= OBJ_COMMIT
)
630 ALLOC_GROW(list
->list
, list
->nr
+ 1, list
->alloc
);
631 oidcpy(&(list
->list
[list
->nr
]), oid
);
637 static void add_missing_parents(struct packed_oid_list
*oids
, struct commit
*commit
)
639 struct commit_list
*parent
;
640 for (parent
= commit
->parents
; parent
; parent
= parent
->next
) {
641 if (!(parent
->item
->object
.flags
& UNINTERESTING
)) {
642 ALLOC_GROW(oids
->list
, oids
->nr
+ 1, oids
->alloc
);
643 oidcpy(&oids
->list
[oids
->nr
], &(parent
->item
->object
.oid
));
645 parent
->item
->object
.flags
|= UNINTERESTING
;
650 static void close_reachable(struct packed_oid_list
*oids
, int report_progress
)
653 struct commit
*commit
;
654 struct progress
*progress
= NULL
;
658 progress
= start_delayed_progress(
659 _("Annotating commits in commit graph"), 0);
660 for (i
= 0; i
< oids
->nr
; i
++) {
661 display_progress(progress
, ++j
);
662 commit
= lookup_commit(the_repository
, &oids
->list
[i
]);
664 commit
->object
.flags
|= UNINTERESTING
;
668 * As this loop runs, oids->nr may grow, but not more
669 * than the number of missing commits in the reachable
672 for (i
= 0; i
< oids
->nr
; i
++) {
673 display_progress(progress
, ++j
);
674 commit
= lookup_commit(the_repository
, &oids
->list
[i
]);
676 if (commit
&& !parse_commit(commit
))
677 add_missing_parents(oids
, commit
);
680 for (i
= 0; i
< oids
->nr
; i
++) {
681 display_progress(progress
, ++j
);
682 commit
= lookup_commit(the_repository
, &oids
->list
[i
]);
685 commit
->object
.flags
&= ~UNINTERESTING
;
687 stop_progress(&progress
);
690 static void compute_generation_numbers(struct packed_commit_list
* commits
,
694 struct commit_list
*list
= NULL
;
695 struct progress
*progress
= NULL
;
698 progress
= start_progress(
699 _("Computing commit graph generation numbers"),
701 for (i
= 0; i
< commits
->nr
; i
++) {
702 display_progress(progress
, i
+ 1);
703 if (commits
->list
[i
]->generation
!= GENERATION_NUMBER_INFINITY
&&
704 commits
->list
[i
]->generation
!= GENERATION_NUMBER_ZERO
)
707 commit_list_insert(commits
->list
[i
], &list
);
709 struct commit
*current
= list
->item
;
710 struct commit_list
*parent
;
711 int all_parents_computed
= 1;
712 uint32_t max_generation
= 0;
714 for (parent
= current
->parents
; parent
; parent
= parent
->next
) {
715 if (parent
->item
->generation
== GENERATION_NUMBER_INFINITY
||
716 parent
->item
->generation
== GENERATION_NUMBER_ZERO
) {
717 all_parents_computed
= 0;
718 commit_list_insert(parent
->item
, &list
);
720 } else if (parent
->item
->generation
> max_generation
) {
721 max_generation
= parent
->item
->generation
;
725 if (all_parents_computed
) {
726 current
->generation
= max_generation
+ 1;
729 if (current
->generation
> GENERATION_NUMBER_MAX
)
730 current
->generation
= GENERATION_NUMBER_MAX
;
734 stop_progress(&progress
);
737 static int add_ref_to_list(const char *refname
,
738 const struct object_id
*oid
,
739 int flags
, void *cb_data
)
741 struct string_list
*list
= (struct string_list
*)cb_data
;
743 string_list_append(list
, oid_to_hex(oid
));
747 void write_commit_graph_reachable(const char *obj_dir
, int append
,
750 struct string_list list
= STRING_LIST_INIT_DUP
;
752 for_each_ref(add_ref_to_list
, &list
);
753 write_commit_graph(obj_dir
, NULL
, &list
, append
, report_progress
);
755 string_list_clear(&list
, 0);
758 void write_commit_graph(const char *obj_dir
,
759 struct string_list
*pack_indexes
,
760 struct string_list
*commit_hex
,
761 int append
, int report_progress
)
763 struct packed_oid_list oids
;
764 struct packed_commit_list commits
;
766 uint32_t i
, count_distinct
= 0;
768 struct lock_file lk
= LOCK_INIT
;
769 uint32_t chunk_ids
[5];
770 uint64_t chunk_offsets
[5];
773 struct commit_list
*parent
;
774 struct progress
*progress
= NULL
;
776 if (!commit_graph_compatible(the_repository
))
780 oids
.alloc
= approximate_object_count() / 32;
781 oids
.progress
= NULL
;
782 oids
.progress_done
= 0;
785 prepare_commit_graph_one(the_repository
, obj_dir
);
786 if (the_repository
->objects
->commit_graph
)
787 oids
.alloc
+= the_repository
->objects
->commit_graph
->num_commits
;
790 if (oids
.alloc
< 1024)
792 ALLOC_ARRAY(oids
.list
, oids
.alloc
);
794 if (append
&& the_repository
->objects
->commit_graph
) {
795 struct commit_graph
*commit_graph
=
796 the_repository
->objects
->commit_graph
;
797 for (i
= 0; i
< commit_graph
->num_commits
; i
++) {
798 const unsigned char *hash
= commit_graph
->chunk_oid_lookup
+
799 commit_graph
->hash_len
* i
;
800 hashcpy(oids
.list
[oids
.nr
++].hash
, hash
);
805 struct strbuf packname
= STRBUF_INIT
;
807 strbuf_addf(&packname
, "%s/pack/", obj_dir
);
808 dirlen
= packname
.len
;
809 if (report_progress
) {
810 oids
.progress
= start_delayed_progress(
811 _("Finding commits for commit graph"), 0);
812 oids
.progress_done
= 0;
814 for (i
= 0; i
< pack_indexes
->nr
; i
++) {
815 struct packed_git
*p
;
816 strbuf_setlen(&packname
, dirlen
);
817 strbuf_addstr(&packname
, pack_indexes
->items
[i
].string
);
818 p
= add_packed_git(packname
.buf
, packname
.len
, 1);
820 die(_("error adding pack %s"), packname
.buf
);
821 if (open_pack_index(p
))
822 die(_("error opening index for %s"), packname
.buf
);
823 for_each_object_in_pack(p
, add_packed_commits
, &oids
, 0);
827 stop_progress(&oids
.progress
);
828 strbuf_release(&packname
);
833 progress
= start_delayed_progress(
834 _("Finding commits for commit graph"),
836 for (i
= 0; i
< commit_hex
->nr
; i
++) {
838 struct object_id oid
;
839 struct commit
*result
;
841 display_progress(progress
, i
+ 1);
842 if (commit_hex
->items
[i
].string
&&
843 parse_oid_hex(commit_hex
->items
[i
].string
, &oid
, &end
))
846 result
= lookup_commit_reference_gently(the_repository
, &oid
, 1);
849 ALLOC_GROW(oids
.list
, oids
.nr
+ 1, oids
.alloc
);
850 oidcpy(&oids
.list
[oids
.nr
], &(result
->object
.oid
));
854 stop_progress(&progress
);
857 if (!pack_indexes
&& !commit_hex
) {
859 oids
.progress
= start_delayed_progress(
860 _("Finding commits for commit graph"), 0);
861 for_each_packed_object(add_packed_commits
, &oids
, 0);
862 stop_progress(&oids
.progress
);
865 close_reachable(&oids
, report_progress
);
867 QSORT(oids
.list
, oids
.nr
, commit_compare
);
870 for (i
= 1; i
< oids
.nr
; i
++) {
871 if (!oideq(&oids
.list
[i
- 1], &oids
.list
[i
]))
875 if (count_distinct
>= GRAPH_PARENT_MISSING
)
876 die(_("the commit graph format cannot write %d commits"), count_distinct
);
879 commits
.alloc
= count_distinct
;
880 ALLOC_ARRAY(commits
.list
, commits
.alloc
);
883 for (i
= 0; i
< oids
.nr
; i
++) {
885 if (i
> 0 && oideq(&oids
.list
[i
- 1], &oids
.list
[i
]))
888 commits
.list
[commits
.nr
] = lookup_commit(the_repository
, &oids
.list
[i
]);
889 parse_commit(commits
.list
[commits
.nr
]);
891 for (parent
= commits
.list
[commits
.nr
]->parents
;
892 parent
; parent
= parent
->next
)
896 num_extra_edges
+= num_parents
- 1;
900 num_chunks
= num_extra_edges
? 4 : 3;
902 if (commits
.nr
>= GRAPH_PARENT_MISSING
)
903 die(_("too many commits to write graph"));
905 compute_generation_numbers(&commits
, report_progress
);
907 graph_name
= get_commit_graph_filename(obj_dir
);
908 if (safe_create_leading_directories(graph_name
)) {
910 die_errno(_("unable to create leading directories of %s"),
914 hold_lock_file_for_update(&lk
, graph_name
, LOCK_DIE_ON_ERROR
);
915 f
= hashfd(lk
.tempfile
->fd
, lk
.tempfile
->filename
.buf
);
917 hashwrite_be32(f
, GRAPH_SIGNATURE
);
919 hashwrite_u8(f
, GRAPH_VERSION
);
920 hashwrite_u8(f
, GRAPH_OID_VERSION
);
921 hashwrite_u8(f
, num_chunks
);
922 hashwrite_u8(f
, 0); /* unused padding byte */
924 chunk_ids
[0] = GRAPH_CHUNKID_OIDFANOUT
;
925 chunk_ids
[1] = GRAPH_CHUNKID_OIDLOOKUP
;
926 chunk_ids
[2] = GRAPH_CHUNKID_DATA
;
928 chunk_ids
[3] = GRAPH_CHUNKID_LARGEEDGES
;
933 chunk_offsets
[0] = 8 + (num_chunks
+ 1) * GRAPH_CHUNKLOOKUP_WIDTH
;
934 chunk_offsets
[1] = chunk_offsets
[0] + GRAPH_FANOUT_SIZE
;
935 chunk_offsets
[2] = chunk_offsets
[1] + GRAPH_OID_LEN
* commits
.nr
;
936 chunk_offsets
[3] = chunk_offsets
[2] + (GRAPH_OID_LEN
+ 16) * commits
.nr
;
937 chunk_offsets
[4] = chunk_offsets
[3] + 4 * num_extra_edges
;
939 for (i
= 0; i
<= num_chunks
; i
++) {
940 uint32_t chunk_write
[3];
942 chunk_write
[0] = htonl(chunk_ids
[i
]);
943 chunk_write
[1] = htonl(chunk_offsets
[i
] >> 32);
944 chunk_write
[2] = htonl(chunk_offsets
[i
] & 0xffffffff);
945 hashwrite(f
, chunk_write
, 12);
948 write_graph_chunk_fanout(f
, commits
.list
, commits
.nr
);
949 write_graph_chunk_oids(f
, GRAPH_OID_LEN
, commits
.list
, commits
.nr
);
950 write_graph_chunk_data(f
, GRAPH_OID_LEN
, commits
.list
, commits
.nr
);
951 write_graph_chunk_large_edges(f
, commits
.list
, commits
.nr
);
953 close_commit_graph(the_repository
);
954 finalize_hashfile(f
, NULL
, CSUM_HASH_IN_STREAM
| CSUM_FSYNC
);
955 commit_lock_file(&lk
);
962 #define VERIFY_COMMIT_GRAPH_ERROR_HASH 2
963 static int verify_commit_graph_error
;
965 static void graph_report(const char *fmt
, ...)
969 verify_commit_graph_error
= 1;
971 vfprintf(stderr
, fmt
, ap
);
972 fprintf(stderr
, "\n");
976 #define GENERATION_ZERO_EXISTS 1
977 #define GENERATION_NUMBER_EXISTS 2
979 int verify_commit_graph(struct repository
*r
, struct commit_graph
*g
)
981 uint32_t i
, cur_fanout_pos
= 0;
982 struct object_id prev_oid
, cur_oid
, checksum
;
983 int generation_zero
= 0;
986 struct progress
*progress
= NULL
;
989 graph_report("no commit-graph file loaded");
993 verify_commit_graph_error
= 0;
995 if (!g
->chunk_oid_fanout
)
996 graph_report("commit-graph is missing the OID Fanout chunk");
997 if (!g
->chunk_oid_lookup
)
998 graph_report("commit-graph is missing the OID Lookup chunk");
999 if (!g
->chunk_commit_data
)
1000 graph_report("commit-graph is missing the Commit Data chunk");
1002 if (verify_commit_graph_error
)
1003 return verify_commit_graph_error
;
1005 devnull
= open("/dev/null", O_WRONLY
);
1006 f
= hashfd(devnull
, NULL
);
1007 hashwrite(f
, g
->data
, g
->data_len
- g
->hash_len
);
1008 finalize_hashfile(f
, checksum
.hash
, CSUM_CLOSE
);
1009 if (!hasheq(checksum
.hash
, g
->data
+ g
->data_len
- g
->hash_len
)) {
1010 graph_report(_("the commit-graph file has incorrect checksum and is likely corrupt"));
1011 verify_commit_graph_error
= VERIFY_COMMIT_GRAPH_ERROR_HASH
;
1014 for (i
= 0; i
< g
->num_commits
; i
++) {
1015 struct commit
*graph_commit
;
1017 hashcpy(cur_oid
.hash
, g
->chunk_oid_lookup
+ g
->hash_len
* i
);
1019 if (i
&& oidcmp(&prev_oid
, &cur_oid
) >= 0)
1020 graph_report("commit-graph has incorrect OID order: %s then %s",
1021 oid_to_hex(&prev_oid
),
1022 oid_to_hex(&cur_oid
));
1024 oidcpy(&prev_oid
, &cur_oid
);
1026 while (cur_oid
.hash
[0] > cur_fanout_pos
) {
1027 uint32_t fanout_value
= get_be32(g
->chunk_oid_fanout
+ cur_fanout_pos
);
1029 if (i
!= fanout_value
)
1030 graph_report("commit-graph has incorrect fanout value: fanout[%d] = %u != %u",
1031 cur_fanout_pos
, fanout_value
, i
);
1035 graph_commit
= lookup_commit(r
, &cur_oid
);
1036 if (!parse_commit_in_graph_one(r
, g
, graph_commit
))
1037 graph_report("failed to parse %s from commit-graph",
1038 oid_to_hex(&cur_oid
));
1041 while (cur_fanout_pos
< 256) {
1042 uint32_t fanout_value
= get_be32(g
->chunk_oid_fanout
+ cur_fanout_pos
);
1044 if (g
->num_commits
!= fanout_value
)
1045 graph_report("commit-graph has incorrect fanout value: fanout[%d] = %u != %u",
1046 cur_fanout_pos
, fanout_value
, i
);
1051 if (verify_commit_graph_error
& ~VERIFY_COMMIT_GRAPH_ERROR_HASH
)
1052 return verify_commit_graph_error
;
1054 progress
= start_progress(_("Verifying commits in commit graph"),
1056 for (i
= 0; i
< g
->num_commits
; i
++) {
1057 struct commit
*graph_commit
, *odb_commit
;
1058 struct commit_list
*graph_parents
, *odb_parents
;
1059 uint32_t max_generation
= 0;
1061 display_progress(progress
, i
+ 1);
1062 hashcpy(cur_oid
.hash
, g
->chunk_oid_lookup
+ g
->hash_len
* i
);
1064 graph_commit
= lookup_commit(r
, &cur_oid
);
1065 odb_commit
= (struct commit
*)create_object(r
, cur_oid
.hash
, alloc_commit_node(r
));
1066 if (parse_commit_internal(odb_commit
, 0, 0)) {
1067 graph_report("failed to parse %s from object database",
1068 oid_to_hex(&cur_oid
));
1072 if (!oideq(&get_commit_tree_in_graph_one(r
, g
, graph_commit
)->object
.oid
,
1073 get_commit_tree_oid(odb_commit
)))
1074 graph_report("root tree OID for commit %s in commit-graph is %s != %s",
1075 oid_to_hex(&cur_oid
),
1076 oid_to_hex(get_commit_tree_oid(graph_commit
)),
1077 oid_to_hex(get_commit_tree_oid(odb_commit
)));
1079 graph_parents
= graph_commit
->parents
;
1080 odb_parents
= odb_commit
->parents
;
1082 while (graph_parents
) {
1083 if (odb_parents
== NULL
) {
1084 graph_report("commit-graph parent list for commit %s is too long",
1085 oid_to_hex(&cur_oid
));
1089 if (!oideq(&graph_parents
->item
->object
.oid
, &odb_parents
->item
->object
.oid
))
1090 graph_report("commit-graph parent for %s is %s != %s",
1091 oid_to_hex(&cur_oid
),
1092 oid_to_hex(&graph_parents
->item
->object
.oid
),
1093 oid_to_hex(&odb_parents
->item
->object
.oid
));
1095 if (graph_parents
->item
->generation
> max_generation
)
1096 max_generation
= graph_parents
->item
->generation
;
1098 graph_parents
= graph_parents
->next
;
1099 odb_parents
= odb_parents
->next
;
1102 if (odb_parents
!= NULL
)
1103 graph_report("commit-graph parent list for commit %s terminates early",
1104 oid_to_hex(&cur_oid
));
1106 if (!graph_commit
->generation
) {
1107 if (generation_zero
== GENERATION_NUMBER_EXISTS
)
1108 graph_report("commit-graph has generation number zero for commit %s, but non-zero elsewhere",
1109 oid_to_hex(&cur_oid
));
1110 generation_zero
= GENERATION_ZERO_EXISTS
;
1111 } else if (generation_zero
== GENERATION_ZERO_EXISTS
)
1112 graph_report("commit-graph has non-zero generation number for commit %s, but zero elsewhere",
1113 oid_to_hex(&cur_oid
));
1115 if (generation_zero
== GENERATION_ZERO_EXISTS
)
1119 * If one of our parents has generation GENERATION_NUMBER_MAX, then
1120 * our generation is also GENERATION_NUMBER_MAX. Decrement to avoid
1121 * extra logic in the following condition.
1123 if (max_generation
== GENERATION_NUMBER_MAX
)
1126 if (graph_commit
->generation
!= max_generation
+ 1)
1127 graph_report("commit-graph generation for commit %s is %u != %u",
1128 oid_to_hex(&cur_oid
),
1129 graph_commit
->generation
,
1130 max_generation
+ 1);
1132 if (graph_commit
->date
!= odb_commit
->date
)
1133 graph_report("commit date for commit %s in commit-graph is %"PRItime
" != %"PRItime
,
1134 oid_to_hex(&cur_oid
),
1138 stop_progress(&progress
);
1140 return verify_commit_graph_error
;
1143 void free_commit_graph(struct commit_graph
*g
)
1147 if (g
->graph_fd
>= 0) {
1148 munmap((void *)g
->data
, g
->data_len
);