4 #include "commit-graph.h"
11 #include "gpg-interface.h"
12 #include "mergesort.h"
13 #include "commit-slab.h"
14 #include "prio-queue.h"
15 #include "sha1-lookup.h"
16 #include "wt-status.h"
19 static struct commit_extra_header
*read_commit_extra_header_lines(const char *buf
, size_t len
, const char **);
21 int save_commit_buffer
= 1;
23 const char *commit_type
= "commit";
25 struct commit
*lookup_commit_reference_gently(const struct object_id
*oid
,
28 struct object
*obj
= deref_tag(parse_object(oid
), NULL
, 0);
32 return object_as_type(obj
, OBJ_COMMIT
, quiet
);
35 struct commit
*lookup_commit_reference(const struct object_id
*oid
)
37 return lookup_commit_reference_gently(oid
, 0);
40 struct commit
*lookup_commit_or_die(const struct object_id
*oid
, const char *ref_name
)
42 struct commit
*c
= lookup_commit_reference(oid
);
44 die(_("could not parse %s"), ref_name
);
45 if (oidcmp(oid
, &c
->object
.oid
)) {
46 warning(_("%s %s is not a commit!"),
47 ref_name
, oid_to_hex(oid
));
52 struct commit
*lookup_commit(const struct object_id
*oid
)
54 struct object
*obj
= lookup_object(oid
->hash
);
56 return create_object(the_repository
, oid
->hash
,
57 alloc_commit_node(the_repository
));
58 return object_as_type(obj
, OBJ_COMMIT
, 0);
61 struct commit
*lookup_commit_reference_by_name(const char *name
)
64 struct commit
*commit
;
66 if (get_oid_committish(name
, &oid
))
68 commit
= lookup_commit_reference(&oid
);
69 if (parse_commit(commit
))
74 static timestamp_t
parse_commit_date(const char *buf
, const char *tail
)
80 if (memcmp(buf
, "author", 6))
82 while (buf
< tail
&& *buf
++ != '\n')
86 if (memcmp(buf
, "committer", 9))
88 while (buf
< tail
&& *buf
++ != '>')
93 while (buf
< tail
&& *buf
++ != '\n')
97 /* dateptr < buf && buf[-1] == '\n', so parsing will stop at buf-1 */
98 return parse_timestamp(dateptr
, NULL
, 10);
101 static struct commit_graft
**commit_graft
;
102 static int commit_graft_alloc
, commit_graft_nr
;
104 static const unsigned char *commit_graft_sha1_access(size_t index
, void *table
)
106 struct commit_graft
**commit_graft_table
= table
;
107 return commit_graft_table
[index
]->oid
.hash
;
110 static int commit_graft_pos(const unsigned char *sha1
)
112 return sha1_pos(sha1
, commit_graft
, commit_graft_nr
,
113 commit_graft_sha1_access
);
116 int register_commit_graft(struct commit_graft
*graft
, int ignore_dups
)
118 int pos
= commit_graft_pos(graft
->oid
.hash
);
124 free(commit_graft
[pos
]);
125 commit_graft
[pos
] = graft
;
130 ALLOC_GROW(commit_graft
, commit_graft_nr
+ 1, commit_graft_alloc
);
132 if (pos
< commit_graft_nr
)
133 MOVE_ARRAY(commit_graft
+ pos
+ 1, commit_graft
+ pos
,
134 commit_graft_nr
- pos
- 1);
135 commit_graft
[pos
] = graft
;
139 struct commit_graft
*read_graft_line(struct strbuf
*line
)
141 /* The format is just "Commit Parent1 Parent2 ...\n" */
143 const char *tail
= NULL
;
144 struct commit_graft
*graft
= NULL
;
145 struct object_id dummy_oid
, *oid
;
148 if (!line
->len
|| line
->buf
[0] == '#')
151 * phase 0 verifies line, counts hashes in line and allocates graft
152 * phase 1 fills graft
154 for (phase
= 0; phase
< 2; phase
++) {
155 oid
= graft
? &graft
->oid
: &dummy_oid
;
156 if (parse_oid_hex(line
->buf
, oid
, &tail
))
158 for (i
= 0; *tail
!= '\0'; i
++) {
159 oid
= graft
? &graft
->parent
[i
] : &dummy_oid
;
160 if (!isspace(*tail
++) || parse_oid_hex(tail
, oid
, &tail
))
164 graft
= xmalloc(st_add(sizeof(*graft
),
165 st_mult(sizeof(struct object_id
), i
)));
166 graft
->nr_parent
= i
;
172 error("bad graft data: %s", line
->buf
);
177 static int read_graft_file(const char *graft_file
)
179 FILE *fp
= fopen_or_warn(graft_file
, "r");
180 struct strbuf buf
= STRBUF_INIT
;
183 if (advice_graft_file_deprecated
)
184 advise(_("Support for <GIT_DIR>/info/grafts is deprecated\n"
185 "and will be removed in a future Git version.\n"
187 "Please use \"git replace --convert-graft-file\"\n"
188 "to convert the grafts into replace refs.\n"
190 "Turn this message off by running\n"
191 "\"git config advice.graftFileDeprecated false\""));
192 while (!strbuf_getwholeline(&buf
, fp
, '\n')) {
193 /* The format is just "Commit Parent1 Parent2 ...\n" */
194 struct commit_graft
*graft
= read_graft_line(&buf
);
197 if (register_commit_graft(graft
, 1))
198 error("duplicate graft data: %s", buf
.buf
);
201 strbuf_release(&buf
);
205 static void prepare_commit_graft(void)
207 static int commit_graft_prepared
;
210 if (commit_graft_prepared
)
212 if (!startup_info
->have_repository
)
215 graft_file
= get_graft_file();
216 read_graft_file(graft_file
);
217 /* make sure shallows are read */
218 is_repository_shallow();
219 commit_graft_prepared
= 1;
222 struct commit_graft
*lookup_commit_graft(const struct object_id
*oid
)
225 prepare_commit_graft();
226 pos
= commit_graft_pos(oid
->hash
);
229 return commit_graft
[pos
];
232 int for_each_commit_graft(each_commit_graft_fn fn
, void *cb_data
)
235 for (i
= ret
= 0; i
< commit_graft_nr
&& !ret
; i
++)
236 ret
= fn(commit_graft
[i
], cb_data
);
240 int unregister_shallow(const struct object_id
*oid
)
242 int pos
= commit_graft_pos(oid
->hash
);
245 if (pos
+ 1 < commit_graft_nr
)
246 MOVE_ARRAY(commit_graft
+ pos
, commit_graft
+ pos
+ 1,
247 commit_graft_nr
- pos
- 1);
252 struct commit_buffer
{
256 define_commit_slab(buffer_slab
, struct commit_buffer
);
257 static struct buffer_slab buffer_slab
= COMMIT_SLAB_INIT(1, buffer_slab
);
259 void set_commit_buffer(struct commit
*commit
, void *buffer
, unsigned long size
)
261 struct commit_buffer
*v
= buffer_slab_at(&buffer_slab
, commit
);
266 const void *get_cached_commit_buffer(const struct commit
*commit
, unsigned long *sizep
)
268 struct commit_buffer
*v
= buffer_slab_peek(&buffer_slab
, commit
);
279 const void *get_commit_buffer(const struct commit
*commit
, unsigned long *sizep
)
281 const void *ret
= get_cached_commit_buffer(commit
, sizep
);
283 enum object_type type
;
285 ret
= read_object_file(&commit
->object
.oid
, &type
, &size
);
287 die("cannot read commit object %s",
288 oid_to_hex(&commit
->object
.oid
));
289 if (type
!= OBJ_COMMIT
)
290 die("expected commit for %s, got %s",
291 oid_to_hex(&commit
->object
.oid
), type_name(type
));
298 void unuse_commit_buffer(const struct commit
*commit
, const void *buffer
)
300 struct commit_buffer
*v
= buffer_slab_peek(&buffer_slab
, commit
);
301 if (!(v
&& v
->buffer
== buffer
))
302 free((void *)buffer
);
305 void free_commit_buffer(struct commit
*commit
)
307 struct commit_buffer
*v
= buffer_slab_peek(&buffer_slab
, commit
);
309 FREE_AND_NULL(v
->buffer
);
314 struct tree
*get_commit_tree(const struct commit
*commit
)
316 if (commit
->maybe_tree
|| !commit
->object
.parsed
)
317 return commit
->maybe_tree
;
319 if (commit
->graph_pos
== COMMIT_NOT_FROM_GRAPH
)
320 BUG("commit has NULL tree, but was not loaded from commit-graph");
322 return get_commit_tree_in_graph(commit
);
325 struct object_id
*get_commit_tree_oid(const struct commit
*commit
)
327 return &get_commit_tree(commit
)->object
.oid
;
330 void release_commit_memory(struct commit
*c
)
332 c
->maybe_tree
= NULL
;
334 free_commit_buffer(c
);
335 free_commit_list(c
->parents
);
336 /* TODO: what about commit->util? */
338 c
->object
.parsed
= 0;
341 const void *detach_commit_buffer(struct commit
*commit
, unsigned long *sizep
)
343 struct commit_buffer
*v
= buffer_slab_peek(&buffer_slab
, commit
);
360 int parse_commit_buffer(struct commit
*item
, const void *buffer
, unsigned long size
, int check_graph
)
362 const char *tail
= buffer
;
363 const char *bufptr
= buffer
;
364 struct object_id parent
;
365 struct commit_list
**pptr
;
366 struct commit_graft
*graft
;
367 const int tree_entry_len
= GIT_SHA1_HEXSZ
+ 5;
368 const int parent_entry_len
= GIT_SHA1_HEXSZ
+ 7;
370 if (item
->object
.parsed
)
372 item
->object
.parsed
= 1;
374 if (tail
<= bufptr
+ tree_entry_len
+ 1 || memcmp(bufptr
, "tree ", 5) ||
375 bufptr
[tree_entry_len
] != '\n')
376 return error("bogus commit object %s", oid_to_hex(&item
->object
.oid
));
377 if (get_oid_hex(bufptr
+ 5, &parent
) < 0)
378 return error("bad tree pointer in commit %s",
379 oid_to_hex(&item
->object
.oid
));
380 item
->maybe_tree
= lookup_tree(&parent
);
381 bufptr
+= tree_entry_len
+ 1; /* "tree " + "hex sha1" + "\n" */
382 pptr
= &item
->parents
;
384 graft
= lookup_commit_graft(&item
->object
.oid
);
385 while (bufptr
+ parent_entry_len
< tail
&& !memcmp(bufptr
, "parent ", 7)) {
386 struct commit
*new_parent
;
388 if (tail
<= bufptr
+ parent_entry_len
+ 1 ||
389 get_oid_hex(bufptr
+ 7, &parent
) ||
390 bufptr
[parent_entry_len
] != '\n')
391 return error("bad parents in commit %s", oid_to_hex(&item
->object
.oid
));
392 bufptr
+= parent_entry_len
+ 1;
394 * The clone is shallow if nr_parent < 0, and we must
395 * not traverse its real parents even when we unhide them.
397 if (graft
&& (graft
->nr_parent
< 0 || grafts_replace_parents
))
399 new_parent
= lookup_commit(&parent
);
401 pptr
= &commit_list_insert(new_parent
, pptr
)->next
;
405 struct commit
*new_parent
;
406 for (i
= 0; i
< graft
->nr_parent
; i
++) {
407 new_parent
= lookup_commit(&graft
->parent
[i
]);
410 pptr
= &commit_list_insert(new_parent
, pptr
)->next
;
413 item
->date
= parse_commit_date(bufptr
, tail
);
416 load_commit_graph_info(item
);
421 int parse_commit_internal(struct commit
*item
, int quiet_on_missing
, int use_commit_graph
)
423 enum object_type type
;
430 if (item
->object
.parsed
)
432 if (use_commit_graph
&& parse_commit_in_graph(item
))
434 buffer
= read_object_file(&item
->object
.oid
, &type
, &size
);
436 return quiet_on_missing
? -1 :
437 error("Could not read %s",
438 oid_to_hex(&item
->object
.oid
));
439 if (type
!= OBJ_COMMIT
) {
441 return error("Object %s not a commit",
442 oid_to_hex(&item
->object
.oid
));
445 ret
= parse_commit_buffer(item
, buffer
, size
, 0);
446 if (save_commit_buffer
&& !ret
) {
447 set_commit_buffer(item
, buffer
, size
);
454 int parse_commit_gently(struct commit
*item
, int quiet_on_missing
)
456 return parse_commit_internal(item
, quiet_on_missing
, 1);
459 void parse_commit_or_die(struct commit
*item
)
461 if (parse_commit(item
))
462 die("unable to parse commit %s",
463 item
? oid_to_hex(&item
->object
.oid
) : "(null)");
466 int find_commit_subject(const char *commit_buffer
, const char **subject
)
469 const char *p
= commit_buffer
;
471 while (*p
&& (*p
!= '\n' || p
[1] != '\n'))
474 p
= skip_blank_lines(p
+ 2);
475 eol
= strchrnul(p
, '\n');
484 struct commit_list
*commit_list_insert(struct commit
*item
, struct commit_list
**list_p
)
486 struct commit_list
*new_list
= xmalloc(sizeof(struct commit_list
));
487 new_list
->item
= item
;
488 new_list
->next
= *list_p
;
493 unsigned commit_list_count(const struct commit_list
*l
)
496 for (; l
; l
= l
->next
)
501 struct commit_list
*copy_commit_list(struct commit_list
*list
)
503 struct commit_list
*head
= NULL
;
504 struct commit_list
**pp
= &head
;
506 pp
= commit_list_append(list
->item
, pp
);
512 void free_commit_list(struct commit_list
*list
)
518 struct commit_list
* commit_list_insert_by_date(struct commit
*item
, struct commit_list
**list
)
520 struct commit_list
**pp
= list
;
521 struct commit_list
*p
;
522 while ((p
= *pp
) != NULL
) {
523 if (p
->item
->date
< item
->date
) {
528 return commit_list_insert(item
, pp
);
531 static int commit_list_compare_by_date(const void *a
, const void *b
)
533 timestamp_t a_date
= ((const struct commit_list
*)a
)->item
->date
;
534 timestamp_t b_date
= ((const struct commit_list
*)b
)->item
->date
;
542 static void *commit_list_get_next(const void *a
)
544 return ((const struct commit_list
*)a
)->next
;
547 static void commit_list_set_next(void *a
, void *next
)
549 ((struct commit_list
*)a
)->next
= next
;
552 void commit_list_sort_by_date(struct commit_list
**list
)
554 *list
= llist_mergesort(*list
, commit_list_get_next
, commit_list_set_next
,
555 commit_list_compare_by_date
);
558 struct commit
*pop_most_recent_commit(struct commit_list
**list
,
561 struct commit
*ret
= pop_commit(list
);
562 struct commit_list
*parents
= ret
->parents
;
565 struct commit
*commit
= parents
->item
;
566 if (!parse_commit(commit
) && !(commit
->object
.flags
& mark
)) {
567 commit
->object
.flags
|= mark
;
568 commit_list_insert_by_date(commit
, list
);
570 parents
= parents
->next
;
575 static void clear_commit_marks_1(struct commit_list
**plist
,
576 struct commit
*commit
, unsigned int mark
)
579 struct commit_list
*parents
;
581 if (!(mark
& commit
->object
.flags
))
584 commit
->object
.flags
&= ~mark
;
586 parents
= commit
->parents
;
590 while ((parents
= parents
->next
))
591 commit_list_insert(parents
->item
, plist
);
593 commit
= commit
->parents
->item
;
597 void clear_commit_marks_many(int nr
, struct commit
**commit
, unsigned int mark
)
599 struct commit_list
*list
= NULL
;
602 clear_commit_marks_1(&list
, *commit
, mark
);
606 clear_commit_marks_1(&list
, pop_commit(&list
), mark
);
609 void clear_commit_marks(struct commit
*commit
, unsigned int mark
)
611 clear_commit_marks_many(1, &commit
, mark
);
614 struct commit
*pop_commit(struct commit_list
**stack
)
616 struct commit_list
*top
= *stack
;
617 struct commit
*item
= top
? top
->item
: NULL
;
627 * Topological sort support
630 /* count number of children that have not been emitted */
631 define_commit_slab(indegree_slab
, int);
633 /* record author-date for each commit object */
634 define_commit_slab(author_date_slab
, unsigned long);
636 static void record_author_date(struct author_date_slab
*author_date
,
637 struct commit
*commit
)
639 const char *buffer
= get_commit_buffer(commit
, NULL
);
640 struct ident_split ident
;
641 const char *ident_line
;
646 ident_line
= find_commit_header(buffer
, "author", &ident_len
);
648 goto fail_exit
; /* no author line */
649 if (split_ident_line(&ident
, ident_line
, ident_len
) ||
650 !ident
.date_begin
|| !ident
.date_end
)
651 goto fail_exit
; /* malformed "author" line */
653 date
= parse_timestamp(ident
.date_begin
, &date_end
, 10);
654 if (date_end
!= ident
.date_end
)
655 goto fail_exit
; /* malformed date */
656 *(author_date_slab_at(author_date
, commit
)) = date
;
659 unuse_commit_buffer(commit
, buffer
);
662 static int compare_commits_by_author_date(const void *a_
, const void *b_
,
665 const struct commit
*a
= a_
, *b
= b_
;
666 struct author_date_slab
*author_date
= cb_data
;
667 timestamp_t a_date
= *(author_date_slab_at(author_date
, a
));
668 timestamp_t b_date
= *(author_date_slab_at(author_date
, b
));
670 /* newer commits with larger date first */
673 else if (a_date
> b_date
)
678 int compare_commits_by_gen_then_commit_date(const void *a_
, const void *b_
, void *unused
)
680 const struct commit
*a
= a_
, *b
= b_
;
682 /* newer commits first */
683 if (a
->generation
< b
->generation
)
685 else if (a
->generation
> b
->generation
)
688 /* use date as a heuristic when generations are equal */
689 if (a
->date
< b
->date
)
691 else if (a
->date
> b
->date
)
696 int compare_commits_by_commit_date(const void *a_
, const void *b_
, void *unused
)
698 const struct commit
*a
= a_
, *b
= b_
;
699 /* newer commits with larger date first */
700 if (a
->date
< b
->date
)
702 else if (a
->date
> b
->date
)
708 * Performs an in-place topological sort on the list supplied.
710 void sort_in_topological_order(struct commit_list
**list
, enum rev_sort_order sort_order
)
712 struct commit_list
*next
, *orig
= *list
;
713 struct commit_list
**pptr
;
714 struct indegree_slab indegree
;
715 struct prio_queue queue
;
716 struct commit
*commit
;
717 struct author_date_slab author_date
;
723 init_indegree_slab(&indegree
);
724 memset(&queue
, '\0', sizeof(queue
));
726 switch (sort_order
) {
727 default: /* REV_SORT_IN_GRAPH_ORDER */
728 queue
.compare
= NULL
;
730 case REV_SORT_BY_COMMIT_DATE
:
731 queue
.compare
= compare_commits_by_commit_date
;
733 case REV_SORT_BY_AUTHOR_DATE
:
734 init_author_date_slab(&author_date
);
735 queue
.compare
= compare_commits_by_author_date
;
736 queue
.cb_data
= &author_date
;
740 /* Mark them and clear the indegree */
741 for (next
= orig
; next
; next
= next
->next
) {
742 struct commit
*commit
= next
->item
;
743 *(indegree_slab_at(&indegree
, commit
)) = 1;
744 /* also record the author dates, if needed */
745 if (sort_order
== REV_SORT_BY_AUTHOR_DATE
)
746 record_author_date(&author_date
, commit
);
749 /* update the indegree */
750 for (next
= orig
; next
; next
= next
->next
) {
751 struct commit_list
*parents
= next
->item
->parents
;
753 struct commit
*parent
= parents
->item
;
754 int *pi
= indegree_slab_at(&indegree
, parent
);
758 parents
= parents
->next
;
765 * tips are nodes not reachable from any other node in the list
767 * the tips serve as a starting set for the work queue.
769 for (next
= orig
; next
; next
= next
->next
) {
770 struct commit
*commit
= next
->item
;
772 if (*(indegree_slab_at(&indegree
, commit
)) == 1)
773 prio_queue_put(&queue
, commit
);
777 * This is unfortunate; the initial tips need to be shown
778 * in the order given from the revision traversal machinery.
780 if (sort_order
== REV_SORT_IN_GRAPH_ORDER
)
781 prio_queue_reverse(&queue
);
783 /* We no longer need the commit list */
784 free_commit_list(orig
);
788 while ((commit
= prio_queue_get(&queue
)) != NULL
) {
789 struct commit_list
*parents
;
791 for (parents
= commit
->parents
; parents
; parents
= parents
->next
) {
792 struct commit
*parent
= parents
->item
;
793 int *pi
= indegree_slab_at(&indegree
, parent
);
799 * parents are only enqueued for emission
800 * when all their children have been emitted thereby
801 * guaranteeing topological order.
804 prio_queue_put(&queue
, parent
);
807 * all children of commit have already been
808 * emitted. we can emit it now.
810 *(indegree_slab_at(&indegree
, commit
)) = 0;
812 pptr
= &commit_list_insert(commit
, pptr
)->next
;
815 clear_indegree_slab(&indegree
);
816 clear_prio_queue(&queue
);
817 if (sort_order
== REV_SORT_BY_AUTHOR_DATE
)
818 clear_author_date_slab(&author_date
);
821 /* merge-base stuff */
823 /* Remember to update object flag allocation in object.h */
824 #define PARENT1 (1u<<16)
825 #define PARENT2 (1u<<17)
826 #define STALE (1u<<18)
827 #define RESULT (1u<<19)
829 static const unsigned all_flags
= (PARENT1
| PARENT2
| STALE
| RESULT
);
831 static int queue_has_nonstale(struct prio_queue
*queue
)
834 for (i
= 0; i
< queue
->nr
; i
++) {
835 struct commit
*commit
= queue
->array
[i
].data
;
836 if (!(commit
->object
.flags
& STALE
))
842 /* all input commits in one and twos[] must have been parsed! */
843 static struct commit_list
*paint_down_to_common(struct commit
*one
, int n
,
844 struct commit
**twos
,
847 struct prio_queue queue
= { compare_commits_by_gen_then_commit_date
};
848 struct commit_list
*result
= NULL
;
850 uint32_t last_gen
= GENERATION_NUMBER_INFINITY
;
852 one
->object
.flags
|= PARENT1
;
854 commit_list_append(one
, &result
);
857 prio_queue_put(&queue
, one
);
859 for (i
= 0; i
< n
; i
++) {
860 twos
[i
]->object
.flags
|= PARENT2
;
861 prio_queue_put(&queue
, twos
[i
]);
864 while (queue_has_nonstale(&queue
)) {
865 struct commit
*commit
= prio_queue_get(&queue
);
866 struct commit_list
*parents
;
869 if (commit
->generation
> last_gen
)
870 BUG("bad generation skip %8x > %8x at %s",
871 commit
->generation
, last_gen
,
872 oid_to_hex(&commit
->object
.oid
));
873 last_gen
= commit
->generation
;
875 if (commit
->generation
< min_generation
)
878 flags
= commit
->object
.flags
& (PARENT1
| PARENT2
| STALE
);
879 if (flags
== (PARENT1
| PARENT2
)) {
880 if (!(commit
->object
.flags
& RESULT
)) {
881 commit
->object
.flags
|= RESULT
;
882 commit_list_insert_by_date(commit
, &result
);
884 /* Mark parents of a found merge stale */
887 parents
= commit
->parents
;
889 struct commit
*p
= parents
->item
;
890 parents
= parents
->next
;
891 if ((p
->object
.flags
& flags
) == flags
)
895 p
->object
.flags
|= flags
;
896 prio_queue_put(&queue
, p
);
900 clear_prio_queue(&queue
);
904 static struct commit_list
*merge_bases_many(struct commit
*one
, int n
, struct commit
**twos
)
906 struct commit_list
*list
= NULL
;
907 struct commit_list
*result
= NULL
;
910 for (i
= 0; i
< n
; i
++) {
913 * We do not mark this even with RESULT so we do not
914 * have to clean it up.
916 return commit_list_insert(one
, &result
);
919 if (parse_commit(one
))
921 for (i
= 0; i
< n
; i
++) {
922 if (parse_commit(twos
[i
]))
926 list
= paint_down_to_common(one
, n
, twos
, 0);
929 struct commit
*commit
= pop_commit(&list
);
930 if (!(commit
->object
.flags
& STALE
))
931 commit_list_insert_by_date(commit
, &result
);
936 struct commit_list
*get_octopus_merge_bases(struct commit_list
*in
)
938 struct commit_list
*i
, *j
, *k
, *ret
= NULL
;
943 commit_list_insert(in
->item
, &ret
);
945 for (i
= in
->next
; i
; i
= i
->next
) {
946 struct commit_list
*new_commits
= NULL
, *end
= NULL
;
948 for (j
= ret
; j
; j
= j
->next
) {
949 struct commit_list
*bases
;
950 bases
= get_merge_bases(i
->item
, j
->item
);
955 for (k
= bases
; k
; k
= k
->next
)
963 static int remove_redundant(struct commit
**array
, int cnt
)
966 * Some commit in the array may be an ancestor of
967 * another commit. Move such commit to the end of
968 * the array, and return the number of commits that
969 * are independent from each other.
971 struct commit
**work
;
972 unsigned char *redundant
;
976 work
= xcalloc(cnt
, sizeof(*work
));
977 redundant
= xcalloc(cnt
, 1);
978 ALLOC_ARRAY(filled_index
, cnt
- 1);
980 for (i
= 0; i
< cnt
; i
++)
981 parse_commit(array
[i
]);
982 for (i
= 0; i
< cnt
; i
++) {
983 struct commit_list
*common
;
984 uint32_t min_generation
= array
[i
]->generation
;
988 for (j
= filled
= 0; j
< cnt
; j
++) {
989 if (i
== j
|| redundant
[j
])
991 filled_index
[filled
] = j
;
992 work
[filled
++] = array
[j
];
994 if (array
[j
]->generation
< min_generation
)
995 min_generation
= array
[j
]->generation
;
997 common
= paint_down_to_common(array
[i
], filled
, work
,
999 if (array
[i
]->object
.flags
& PARENT2
)
1001 for (j
= 0; j
< filled
; j
++)
1002 if (work
[j
]->object
.flags
& PARENT1
)
1003 redundant
[filled_index
[j
]] = 1;
1004 clear_commit_marks(array
[i
], all_flags
);
1005 clear_commit_marks_many(filled
, work
, all_flags
);
1006 free_commit_list(common
);
1009 /* Now collect the result */
1010 COPY_ARRAY(work
, array
, cnt
);
1011 for (i
= filled
= 0; i
< cnt
; i
++)
1013 array
[filled
++] = work
[i
];
1014 for (j
= filled
, i
= 0; i
< cnt
; i
++)
1016 array
[j
++] = work
[i
];
1023 static struct commit_list
*get_merge_bases_many_0(struct commit
*one
,
1025 struct commit
**twos
,
1028 struct commit_list
*list
;
1029 struct commit
**rslt
;
1030 struct commit_list
*result
;
1033 result
= merge_bases_many(one
, n
, twos
);
1034 for (i
= 0; i
< n
; i
++) {
1038 if (!result
|| !result
->next
) {
1040 clear_commit_marks(one
, all_flags
);
1041 clear_commit_marks_many(n
, twos
, all_flags
);
1046 /* There are more than one */
1047 cnt
= commit_list_count(result
);
1048 rslt
= xcalloc(cnt
, sizeof(*rslt
));
1049 for (list
= result
, i
= 0; list
; list
= list
->next
)
1050 rslt
[i
++] = list
->item
;
1051 free_commit_list(result
);
1053 clear_commit_marks(one
, all_flags
);
1054 clear_commit_marks_many(n
, twos
, all_flags
);
1056 cnt
= remove_redundant(rslt
, cnt
);
1058 for (i
= 0; i
< cnt
; i
++)
1059 commit_list_insert_by_date(rslt
[i
], &result
);
1064 struct commit_list
*get_merge_bases_many(struct commit
*one
,
1066 struct commit
**twos
)
1068 return get_merge_bases_many_0(one
, n
, twos
, 1);
1071 struct commit_list
*get_merge_bases_many_dirty(struct commit
*one
,
1073 struct commit
**twos
)
1075 return get_merge_bases_many_0(one
, n
, twos
, 0);
1078 struct commit_list
*get_merge_bases(struct commit
*one
, struct commit
*two
)
1080 return get_merge_bases_many_0(one
, 1, &two
, 1);
1084 * Is "commit" a descendant of one of the elements on the "with_commit" list?
1086 int is_descendant_of(struct commit
*commit
, struct commit_list
*with_commit
)
1090 while (with_commit
) {
1091 struct commit
*other
;
1093 other
= with_commit
->item
;
1094 with_commit
= with_commit
->next
;
1095 if (in_merge_bases(other
, commit
))
1102 * Is "commit" an ancestor of one of the "references"?
1104 int in_merge_bases_many(struct commit
*commit
, int nr_reference
, struct commit
**reference
)
1106 struct commit_list
*bases
;
1108 uint32_t min_generation
= GENERATION_NUMBER_INFINITY
;
1110 if (parse_commit(commit
))
1112 for (i
= 0; i
< nr_reference
; i
++) {
1113 if (parse_commit(reference
[i
]))
1115 if (reference
[i
]->generation
< min_generation
)
1116 min_generation
= reference
[i
]->generation
;
1119 if (commit
->generation
> min_generation
)
1122 bases
= paint_down_to_common(commit
, nr_reference
, reference
, commit
->generation
);
1123 if (commit
->object
.flags
& PARENT2
)
1125 clear_commit_marks(commit
, all_flags
);
1126 clear_commit_marks_many(nr_reference
, reference
, all_flags
);
1127 free_commit_list(bases
);
1132 * Is "commit" an ancestor of (i.e. reachable from) the "reference"?
1134 int in_merge_bases(struct commit
*commit
, struct commit
*reference
)
1136 return in_merge_bases_many(commit
, 1, &reference
);
1139 struct commit_list
*reduce_heads(struct commit_list
*heads
)
1141 struct commit_list
*p
;
1142 struct commit_list
*result
= NULL
, **tail
= &result
;
1143 struct commit
**array
;
1150 for (p
= heads
; p
; p
= p
->next
)
1151 p
->item
->object
.flags
&= ~STALE
;
1152 for (p
= heads
, num_head
= 0; p
; p
= p
->next
) {
1153 if (p
->item
->object
.flags
& STALE
)
1155 p
->item
->object
.flags
|= STALE
;
1158 array
= xcalloc(num_head
, sizeof(*array
));
1159 for (p
= heads
, i
= 0; p
; p
= p
->next
) {
1160 if (p
->item
->object
.flags
& STALE
) {
1161 array
[i
++] = p
->item
;
1162 p
->item
->object
.flags
&= ~STALE
;
1165 num_head
= remove_redundant(array
, num_head
);
1166 for (i
= 0; i
< num_head
; i
++)
1167 tail
= &commit_list_insert(array
[i
], tail
)->next
;
1172 void reduce_heads_replace(struct commit_list
**heads
)
1174 struct commit_list
*result
= reduce_heads(*heads
);
1175 free_commit_list(*heads
);
1179 static const char gpg_sig_header
[] = "gpgsig";
1180 static const int gpg_sig_header_len
= sizeof(gpg_sig_header
) - 1;
1182 static int do_sign_commit(struct strbuf
*buf
, const char *keyid
)
1184 struct strbuf sig
= STRBUF_INIT
;
1185 int inspos
, copypos
;
1188 /* find the end of the header */
1189 eoh
= strstr(buf
->buf
, "\n\n");
1193 inspos
= eoh
- buf
->buf
+ 1;
1195 if (!keyid
|| !*keyid
)
1196 keyid
= get_signing_key();
1197 if (sign_buffer(buf
, &sig
, keyid
)) {
1198 strbuf_release(&sig
);
1202 for (copypos
= 0; sig
.buf
[copypos
]; ) {
1203 const char *bol
= sig
.buf
+ copypos
;
1204 const char *eol
= strchrnul(bol
, '\n');
1205 int len
= (eol
- bol
) + !!*eol
;
1208 strbuf_insert(buf
, inspos
, gpg_sig_header
, gpg_sig_header_len
);
1209 inspos
+= gpg_sig_header_len
;
1211 strbuf_insert(buf
, inspos
++, " ", 1);
1212 strbuf_insert(buf
, inspos
, bol
, len
);
1216 strbuf_release(&sig
);
1220 int parse_signed_commit(const struct commit
*commit
,
1221 struct strbuf
*payload
, struct strbuf
*signature
)
1225 const char *buffer
= get_commit_buffer(commit
, &size
);
1226 int in_signature
, saw_signature
= -1;
1227 const char *line
, *tail
;
1230 tail
= buffer
+ size
;
1233 while (line
< tail
) {
1234 const char *sig
= NULL
;
1235 const char *next
= memchr(line
, '\n', tail
- line
);
1237 next
= next
? next
+ 1 : tail
;
1238 if (in_signature
&& line
[0] == ' ')
1240 else if (starts_with(line
, gpg_sig_header
) &&
1241 line
[gpg_sig_header_len
] == ' ')
1242 sig
= line
+ gpg_sig_header_len
+ 1;
1244 strbuf_add(signature
, sig
, next
- sig
);
1249 /* dump the whole remainder of the buffer */
1251 strbuf_add(payload
, line
, next
- line
);
1256 unuse_commit_buffer(commit
, buffer
);
1257 return saw_signature
;
1260 int remove_signature(struct strbuf
*buf
)
1262 const char *line
= buf
->buf
;
1263 const char *tail
= buf
->buf
+ buf
->len
;
1264 int in_signature
= 0;
1265 const char *sig_start
= NULL
;
1266 const char *sig_end
= NULL
;
1268 while (line
< tail
) {
1269 const char *next
= memchr(line
, '\n', tail
- line
);
1270 next
= next
? next
+ 1 : tail
;
1272 if (in_signature
&& line
[0] == ' ')
1274 else if (starts_with(line
, gpg_sig_header
) &&
1275 line
[gpg_sig_header_len
] == ' ') {
1281 /* dump the whole remainder of the buffer */
1289 strbuf_remove(buf
, sig_start
- buf
->buf
, sig_end
- sig_start
);
1291 return sig_start
!= NULL
;
1294 static void handle_signed_tag(struct commit
*parent
, struct commit_extra_header
***tail
)
1296 struct merge_remote_desc
*desc
;
1297 struct commit_extra_header
*mergetag
;
1299 unsigned long size
, len
;
1300 enum object_type type
;
1302 desc
= merge_remote_util(parent
);
1303 if (!desc
|| !desc
->obj
)
1305 buf
= read_object_file(&desc
->obj
->oid
, &type
, &size
);
1306 if (!buf
|| type
!= OBJ_TAG
)
1308 len
= parse_signature(buf
, size
);
1312 * We could verify this signature and either omit the tag when
1313 * it does not validate, but the integrator may not have the
1314 * public key of the signer of the tag he is merging, while a
1315 * later auditor may have it while auditing, so let's not run
1316 * verify-signed-buffer here for now...
1318 * if (verify_signed_buffer(buf, len, buf + len, size - len, ...))
1319 * warn("warning: signed tag unverified.");
1321 mergetag
= xcalloc(1, sizeof(*mergetag
));
1322 mergetag
->key
= xstrdup("mergetag");
1323 mergetag
->value
= buf
;
1324 mergetag
->len
= size
;
1327 *tail
= &mergetag
->next
;
1334 int check_commit_signature(const struct commit
*commit
, struct signature_check
*sigc
)
1336 struct strbuf payload
= STRBUF_INIT
;
1337 struct strbuf signature
= STRBUF_INIT
;
1342 if (parse_signed_commit(commit
, &payload
, &signature
) <= 0)
1344 ret
= check_signature(payload
.buf
, payload
.len
, signature
.buf
,
1345 signature
.len
, sigc
);
1348 strbuf_release(&payload
);
1349 strbuf_release(&signature
);
1356 void append_merge_tag_headers(struct commit_list
*parents
,
1357 struct commit_extra_header
***tail
)
1360 struct commit
*parent
= parents
->item
;
1361 handle_signed_tag(parent
, tail
);
1362 parents
= parents
->next
;
1366 static void add_extra_header(struct strbuf
*buffer
,
1367 struct commit_extra_header
*extra
)
1369 strbuf_addstr(buffer
, extra
->key
);
1371 strbuf_add_lines(buffer
, " ", extra
->value
, extra
->len
);
1373 strbuf_addch(buffer
, '\n');
1376 struct commit_extra_header
*read_commit_extra_headers(struct commit
*commit
,
1377 const char **exclude
)
1379 struct commit_extra_header
*extra
= NULL
;
1381 const char *buffer
= get_commit_buffer(commit
, &size
);
1382 extra
= read_commit_extra_header_lines(buffer
, size
, exclude
);
1383 unuse_commit_buffer(commit
, buffer
);
1387 int for_each_mergetag(each_mergetag_fn fn
, struct commit
*commit
, void *data
)
1389 struct commit_extra_header
*extra
, *to_free
;
1392 to_free
= read_commit_extra_headers(commit
, NULL
);
1393 for (extra
= to_free
; !res
&& extra
; extra
= extra
->next
) {
1394 if (strcmp(extra
->key
, "mergetag"))
1395 continue; /* not a merge tag */
1396 res
= fn(commit
, extra
, data
);
1398 free_commit_extra_headers(to_free
);
1402 static inline int standard_header_field(const char *field
, size_t len
)
1404 return ((len
== 4 && !memcmp(field
, "tree", 4)) ||
1405 (len
== 6 && !memcmp(field
, "parent", 6)) ||
1406 (len
== 6 && !memcmp(field
, "author", 6)) ||
1407 (len
== 9 && !memcmp(field
, "committer", 9)) ||
1408 (len
== 8 && !memcmp(field
, "encoding", 8)));
1411 static int excluded_header_field(const char *field
, size_t len
, const char **exclude
)
1417 size_t xlen
= strlen(*exclude
);
1418 if (len
== xlen
&& !memcmp(field
, *exclude
, xlen
))
1425 static struct commit_extra_header
*read_commit_extra_header_lines(
1426 const char *buffer
, size_t size
,
1427 const char **exclude
)
1429 struct commit_extra_header
*extra
= NULL
, **tail
= &extra
, *it
= NULL
;
1430 const char *line
, *next
, *eof
, *eob
;
1431 struct strbuf buf
= STRBUF_INIT
;
1433 for (line
= buffer
, eob
= line
+ size
;
1434 line
< eob
&& *line
!= '\n';
1436 next
= memchr(line
, '\n', eob
- line
);
1437 next
= next
? next
+ 1 : eob
;
1441 strbuf_add(&buf
, line
+ 1, next
- (line
+ 1));
1445 it
->value
= strbuf_detach(&buf
, &it
->len
);
1449 eof
= memchr(line
, ' ', next
- line
);
1452 else if (standard_header_field(line
, eof
- line
) ||
1453 excluded_header_field(line
, eof
- line
, exclude
))
1456 it
= xcalloc(1, sizeof(*it
));
1457 it
->key
= xmemdupz(line
, eof
-line
);
1461 strbuf_add(&buf
, eof
+ 1, next
- (eof
+ 1));
1464 it
->value
= strbuf_detach(&buf
, &it
->len
);
1468 void free_commit_extra_headers(struct commit_extra_header
*extra
)
1471 struct commit_extra_header
*next
= extra
->next
;
1479 int commit_tree(const char *msg
, size_t msg_len
, const struct object_id
*tree
,
1480 struct commit_list
*parents
, struct object_id
*ret
,
1481 const char *author
, const char *sign_commit
)
1483 struct commit_extra_header
*extra
= NULL
, **tail
= &extra
;
1486 append_merge_tag_headers(parents
, &tail
);
1487 result
= commit_tree_extended(msg
, msg_len
, tree
, parents
, ret
,
1488 author
, sign_commit
, extra
);
1489 free_commit_extra_headers(extra
);
1493 static int find_invalid_utf8(const char *buf
, int len
)
1496 static const unsigned int max_codepoint
[] = {
1497 0x7f, 0x7ff, 0xffff, 0x10ffff
1501 unsigned char c
= *buf
++;
1502 int bytes
, bad_offset
;
1503 unsigned int codepoint
;
1504 unsigned int min_val
, max_val
;
1509 /* Simple US-ASCII? No worries. */
1513 bad_offset
= offset
-1;
1516 * Count how many more high bits set: that's how
1517 * many more bytes this sequence should have.
1526 * Must be between 1 and 3 more bytes. Longer sequences result in
1527 * codepoints beyond U+10FFFF, which are guaranteed never to exist.
1529 if (bytes
< 1 || 3 < bytes
)
1532 /* Do we *have* that many bytes? */
1537 * Place the encoded bits at the bottom of the value and compute the
1540 codepoint
= (c
& 0x7f) >> bytes
;
1541 min_val
= max_codepoint
[bytes
-1] + 1;
1542 max_val
= max_codepoint
[bytes
];
1547 /* And verify that they are good continuation bytes */
1550 codepoint
|= *buf
& 0x3f;
1551 if ((*buf
++ & 0xc0) != 0x80)
1555 /* Reject codepoints that are out of range for the sequence length. */
1556 if (codepoint
< min_val
|| codepoint
> max_val
)
1558 /* Surrogates are only for UTF-16 and cannot be encoded in UTF-8. */
1559 if ((codepoint
& 0x1ff800) == 0xd800)
1561 /* U+xxFFFE and U+xxFFFF are guaranteed non-characters. */
1562 if ((codepoint
& 0xfffe) == 0xfffe)
1564 /* So are anything in the range U+FDD0..U+FDEF. */
1565 if (codepoint
>= 0xfdd0 && codepoint
<= 0xfdef)
1572 * This verifies that the buffer is in proper utf8 format.
1574 * If it isn't, it assumes any non-utf8 characters are Latin1,
1575 * and does the conversion.
1577 static int verify_utf8(struct strbuf
*buf
)
1585 unsigned char replace
[2];
1587 bad
= find_invalid_utf8(buf
->buf
+ pos
, buf
->len
- pos
);
1593 strbuf_remove(buf
, pos
, 1);
1595 /* We know 'c' must be in the range 128-255 */
1596 replace
[0] = 0xc0 + (c
>> 6);
1597 replace
[1] = 0x80 + (c
& 0x3f);
1598 strbuf_insert(buf
, pos
, replace
, 2);
1603 static const char commit_utf8_warn
[] =
1604 N_("Warning: commit message did not conform to UTF-8.\n"
1605 "You may want to amend it after fixing the message, or set the config\n"
1606 "variable i18n.commitencoding to the encoding your project uses.\n");
1608 int commit_tree_extended(const char *msg
, size_t msg_len
,
1609 const struct object_id
*tree
,
1610 struct commit_list
*parents
, struct object_id
*ret
,
1611 const char *author
, const char *sign_commit
,
1612 struct commit_extra_header
*extra
)
1615 int encoding_is_utf8
;
1616 struct strbuf buffer
;
1618 assert_oid_type(tree
, OBJ_TREE
);
1620 if (memchr(msg
, '\0', msg_len
))
1621 return error("a NUL byte in commit log message not allowed.");
1623 /* Not having i18n.commitencoding is the same as having utf-8 */
1624 encoding_is_utf8
= is_encoding_utf8(git_commit_encoding
);
1626 strbuf_init(&buffer
, 8192); /* should avoid reallocs for the headers */
1627 strbuf_addf(&buffer
, "tree %s\n", oid_to_hex(tree
));
1630 * NOTE! This ordering means that the same exact tree merged with a
1631 * different order of parents will be a _different_ changeset even
1632 * if everything else stays the same.
1635 struct commit
*parent
= pop_commit(&parents
);
1636 strbuf_addf(&buffer
, "parent %s\n",
1637 oid_to_hex(&parent
->object
.oid
));
1640 /* Person/date information */
1642 author
= git_author_info(IDENT_STRICT
);
1643 strbuf_addf(&buffer
, "author %s\n", author
);
1644 strbuf_addf(&buffer
, "committer %s\n", git_committer_info(IDENT_STRICT
));
1645 if (!encoding_is_utf8
)
1646 strbuf_addf(&buffer
, "encoding %s\n", git_commit_encoding
);
1649 add_extra_header(&buffer
, extra
);
1650 extra
= extra
->next
;
1652 strbuf_addch(&buffer
, '\n');
1654 /* And add the comment */
1655 strbuf_add(&buffer
, msg
, msg_len
);
1657 /* And check the encoding */
1658 if (encoding_is_utf8
&& !verify_utf8(&buffer
))
1659 fprintf(stderr
, _(commit_utf8_warn
));
1661 if (sign_commit
&& do_sign_commit(&buffer
, sign_commit
)) {
1666 result
= write_object_file(buffer
.buf
, buffer
.len
, commit_type
, ret
);
1668 strbuf_release(&buffer
);
1672 define_commit_slab(merge_desc_slab
, struct merge_remote_desc
*);
1673 static struct merge_desc_slab merge_desc_slab
= COMMIT_SLAB_INIT(1, merge_desc_slab
);
1675 struct merge_remote_desc
*merge_remote_util(struct commit
*commit
)
1677 return *merge_desc_slab_at(&merge_desc_slab
, commit
);
1680 void set_merge_remote_desc(struct commit
*commit
,
1681 const char *name
, struct object
*obj
)
1683 struct merge_remote_desc
*desc
;
1684 FLEX_ALLOC_STR(desc
, name
, name
);
1686 *merge_desc_slab_at(&merge_desc_slab
, commit
) = desc
;
1689 struct commit
*get_merge_parent(const char *name
)
1692 struct commit
*commit
;
1693 struct object_id oid
;
1694 if (get_oid(name
, &oid
))
1696 obj
= parse_object(&oid
);
1697 commit
= (struct commit
*)peel_to_type(name
, 0, obj
, OBJ_COMMIT
);
1698 if (commit
&& !merge_remote_util(commit
))
1699 set_merge_remote_desc(commit
, name
, obj
);
1704 * Append a commit to the end of the commit_list.
1706 * next starts by pointing to the variable that holds the head of an
1707 * empty commit_list, and is updated to point to the "next" field of
1708 * the last item on the list as new commits are appended.
1712 * struct commit_list *list;
1713 * struct commit_list **next = &list;
1715 * next = commit_list_append(c1, next);
1716 * next = commit_list_append(c2, next);
1717 * assert(commit_list_count(list) == 2);
1720 struct commit_list
**commit_list_append(struct commit
*commit
,
1721 struct commit_list
**next
)
1723 struct commit_list
*new_commit
= xmalloc(sizeof(struct commit_list
));
1724 new_commit
->item
= commit
;
1726 new_commit
->next
= NULL
;
1727 return &new_commit
->next
;
1730 const char *find_commit_header(const char *msg
, const char *key
, size_t *out_len
)
1732 int key_len
= strlen(key
);
1733 const char *line
= msg
;
1736 const char *eol
= strchrnul(line
, '\n');
1741 if (eol
- line
> key_len
&&
1742 !strncmp(line
, key
, key_len
) &&
1743 line
[key_len
] == ' ') {
1744 *out_len
= eol
- line
- key_len
- 1;
1745 return line
+ key_len
+ 1;
1747 line
= *eol
? eol
+ 1 : NULL
;
1753 * Inspect the given string and determine the true "end" of the log message, in
1754 * order to find where to put a new Signed-off-by: line. Ignored are
1755 * trailing comment lines and blank lines. To support "git commit -s
1756 * --amend" on an existing commit, we also ignore "Conflicts:". To
1757 * support "git commit -v", we truncate at cut lines.
1759 * Returns the number of bytes from the tail to ignore, to be fed as
1760 * the second parameter to append_signoff().
1762 int ignore_non_trailer(const char *buf
, size_t len
)
1766 int in_old_conflicts_block
= 0;
1767 size_t cutoff
= wt_status_locate_end(buf
, len
);
1769 while (bol
< cutoff
) {
1770 const char *next_line
= memchr(buf
+ bol
, '\n', len
- bol
);
1773 next_line
= buf
+ len
;
1777 if (buf
[bol
] == comment_line_char
|| buf
[bol
] == '\n') {
1778 /* is this the first of the run of comments? */
1781 /* otherwise, it is just continuing */
1782 } else if (starts_with(buf
+ bol
, "Conflicts:\n")) {
1783 in_old_conflicts_block
= 1;
1786 } else if (in_old_conflicts_block
&& buf
[bol
] == '\t') {
1787 ; /* a pathname in the conflicts block */
1789 /* the previous was not trailing comment */
1791 in_old_conflicts_block
= 0;
1793 bol
= next_line
- buf
;
1795 return boc
? len
- boc
: len
- cutoff
;