9 #include "gpg-interface.h"
10 #include "mergesort.h"
11 #include "commit-slab.h"
12 #include "prio-queue.h"
14 static struct commit_extra_header
*read_commit_extra_header_lines(const char *buf
, size_t len
, const char **);
16 int save_commit_buffer
= 1;
18 const char *commit_type
= "commit";
19 static int commit_count
;
21 static struct commit
*check_commit(struct object
*obj
,
22 const unsigned char *sha1
,
25 if (obj
->type
!= OBJ_COMMIT
) {
27 error("Object %s is a %s, not a commit",
28 sha1_to_hex(sha1
), typename(obj
->type
));
31 return (struct commit
*) obj
;
34 struct commit
*lookup_commit_reference_gently(const unsigned char *sha1
,
37 struct object
*obj
= deref_tag(parse_object(sha1
), NULL
, 0);
41 return check_commit(obj
, sha1
, quiet
);
44 struct commit
*lookup_commit_reference(const unsigned char *sha1
)
46 return lookup_commit_reference_gently(sha1
, 0);
49 struct commit
*lookup_commit_or_die(const unsigned char *sha1
, const char *ref_name
)
51 struct commit
*c
= lookup_commit_reference(sha1
);
53 die(_("could not parse %s"), ref_name
);
54 if (hashcmp(sha1
, c
->object
.sha1
)) {
55 warning(_("%s %s is not a commit!"),
56 ref_name
, sha1_to_hex(sha1
));
61 struct commit
*lookup_commit(const unsigned char *sha1
)
63 struct object
*obj
= lookup_object(sha1
);
65 struct commit
*c
= alloc_commit_node();
66 c
->index
= commit_count
++;
67 return create_object(sha1
, OBJ_COMMIT
, c
);
70 obj
->type
= OBJ_COMMIT
;
71 return check_commit(obj
, sha1
, 0);
74 struct commit
*lookup_commit_reference_by_name(const char *name
)
76 unsigned char sha1
[20];
77 struct commit
*commit
;
79 if (get_sha1_committish(name
, sha1
))
81 commit
= lookup_commit_reference(sha1
);
82 if (!commit
|| parse_commit(commit
))
87 static unsigned long parse_commit_date(const char *buf
, const char *tail
)
93 if (memcmp(buf
, "author", 6))
95 while (buf
< tail
&& *buf
++ != '\n')
99 if (memcmp(buf
, "committer", 9))
101 while (buf
< tail
&& *buf
++ != '>')
106 while (buf
< tail
&& *buf
++ != '\n')
110 /* dateptr < buf && buf[-1] == '\n', so strtoul will stop at buf-1 */
111 return strtoul(dateptr
, NULL
, 10);
114 static struct commit_graft
**commit_graft
;
115 static int commit_graft_alloc
, commit_graft_nr
;
117 static int commit_graft_pos(const unsigned char *sha1
)
121 hi
= commit_graft_nr
;
123 int mi
= (lo
+ hi
) / 2;
124 struct commit_graft
*graft
= commit_graft
[mi
];
125 int cmp
= hashcmp(sha1
, graft
->sha1
);
136 int register_commit_graft(struct commit_graft
*graft
, int ignore_dups
)
138 int pos
= commit_graft_pos(graft
->sha1
);
144 free(commit_graft
[pos
]);
145 commit_graft
[pos
] = graft
;
150 if (commit_graft_alloc
<= ++commit_graft_nr
) {
151 commit_graft_alloc
= alloc_nr(commit_graft_alloc
);
152 commit_graft
= xrealloc(commit_graft
,
153 sizeof(*commit_graft
) *
156 if (pos
< commit_graft_nr
)
157 memmove(commit_graft
+ pos
+ 1,
159 (commit_graft_nr
- pos
- 1) *
160 sizeof(*commit_graft
));
161 commit_graft
[pos
] = graft
;
165 struct commit_graft
*read_graft_line(char *buf
, int len
)
167 /* The format is just "Commit Parent1 Parent2 ...\n" */
169 struct commit_graft
*graft
= NULL
;
171 while (len
&& isspace(buf
[len
-1]))
173 if (buf
[0] == '#' || buf
[0] == '\0')
177 i
= (len
+ 1) / 41 - 1;
178 graft
= xmalloc(sizeof(*graft
) + 20 * i
);
179 graft
->nr_parent
= i
;
180 if (get_sha1_hex(buf
, graft
->sha1
))
182 for (i
= 40; i
< len
; i
+= 41) {
185 if (get_sha1_hex(buf
+ i
+ 1, graft
->parent
[i
/41]))
191 error("bad graft data: %s", buf
);
196 static int read_graft_file(const char *graft_file
)
198 FILE *fp
= fopen(graft_file
, "r");
202 while (fgets(buf
, sizeof(buf
), fp
)) {
203 /* The format is just "Commit Parent1 Parent2 ...\n" */
204 int len
= strlen(buf
);
205 struct commit_graft
*graft
= read_graft_line(buf
, len
);
208 if (register_commit_graft(graft
, 1))
209 error("duplicate graft data: %s", buf
);
215 static void prepare_commit_graft(void)
217 static int commit_graft_prepared
;
220 if (commit_graft_prepared
)
222 graft_file
= get_graft_file();
223 read_graft_file(graft_file
);
224 /* make sure shallows are read */
225 is_repository_shallow();
226 commit_graft_prepared
= 1;
229 struct commit_graft
*lookup_commit_graft(const unsigned char *sha1
)
232 prepare_commit_graft();
233 pos
= commit_graft_pos(sha1
);
236 return commit_graft
[pos
];
239 int for_each_commit_graft(each_commit_graft_fn fn
, void *cb_data
)
242 for (i
= ret
= 0; i
< commit_graft_nr
&& !ret
; i
++)
243 ret
= fn(commit_graft
[i
], cb_data
);
247 int unregister_shallow(const unsigned char *sha1
)
249 int pos
= commit_graft_pos(sha1
);
252 if (pos
+ 1 < commit_graft_nr
)
253 memmove(commit_graft
+ pos
, commit_graft
+ pos
+ 1,
254 sizeof(struct commit_graft
*)
255 * (commit_graft_nr
- pos
- 1));
260 int parse_commit_buffer(struct commit
*item
, const void *buffer
, unsigned long size
)
262 const char *tail
= buffer
;
263 const char *bufptr
= buffer
;
264 unsigned char parent
[20];
265 struct commit_list
**pptr
;
266 struct commit_graft
*graft
;
268 if (item
->object
.parsed
)
270 item
->object
.parsed
= 1;
272 if (tail
<= bufptr
+ 46 || memcmp(bufptr
, "tree ", 5) || bufptr
[45] != '\n')
273 return error("bogus commit object %s", sha1_to_hex(item
->object
.sha1
));
274 if (get_sha1_hex(bufptr
+ 5, parent
) < 0)
275 return error("bad tree pointer in commit %s",
276 sha1_to_hex(item
->object
.sha1
));
277 item
->tree
= lookup_tree(parent
);
278 bufptr
+= 46; /* "tree " + "hex sha1" + "\n" */
279 pptr
= &item
->parents
;
281 graft
= lookup_commit_graft(item
->object
.sha1
);
282 while (bufptr
+ 48 < tail
&& !memcmp(bufptr
, "parent ", 7)) {
283 struct commit
*new_parent
;
285 if (tail
<= bufptr
+ 48 ||
286 get_sha1_hex(bufptr
+ 7, parent
) ||
288 return error("bad parents in commit %s", sha1_to_hex(item
->object
.sha1
));
291 * The clone is shallow if nr_parent < 0, and we must
292 * not traverse its real parents even when we unhide them.
294 if (graft
&& (graft
->nr_parent
< 0 || grafts_replace_parents
))
296 new_parent
= lookup_commit(parent
);
298 pptr
= &commit_list_insert(new_parent
, pptr
)->next
;
302 struct commit
*new_parent
;
303 for (i
= 0; i
< graft
->nr_parent
; i
++) {
304 new_parent
= lookup_commit(graft
->parent
[i
]);
307 pptr
= &commit_list_insert(new_parent
, pptr
)->next
;
310 item
->date
= parse_commit_date(bufptr
, tail
);
315 int parse_commit(struct commit
*item
)
317 enum object_type type
;
324 if (item
->object
.parsed
)
326 buffer
= read_sha1_file(item
->object
.sha1
, &type
, &size
);
328 return error("Could not read %s",
329 sha1_to_hex(item
->object
.sha1
));
330 if (type
!= OBJ_COMMIT
) {
332 return error("Object %s not a commit",
333 sha1_to_hex(item
->object
.sha1
));
335 ret
= parse_commit_buffer(item
, buffer
, size
);
336 if (save_commit_buffer
&& !ret
) {
337 item
->buffer
= buffer
;
344 int find_commit_subject(const char *commit_buffer
, const char **subject
)
347 const char *p
= commit_buffer
;
349 while (*p
&& (*p
!= '\n' || p
[1] != '\n'))
353 for (eol
= p
; *eol
&& *eol
!= '\n'; eol
++)
363 struct commit_list
*commit_list_insert(struct commit
*item
, struct commit_list
**list_p
)
365 struct commit_list
*new_list
= xmalloc(sizeof(struct commit_list
));
366 new_list
->item
= item
;
367 new_list
->next
= *list_p
;
372 unsigned commit_list_count(const struct commit_list
*l
)
375 for (; l
; l
= l
->next
)
380 void free_commit_list(struct commit_list
*list
)
383 struct commit_list
*temp
= list
;
389 struct commit_list
* commit_list_insert_by_date(struct commit
*item
, struct commit_list
**list
)
391 struct commit_list
**pp
= list
;
392 struct commit_list
*p
;
393 while ((p
= *pp
) != NULL
) {
394 if (p
->item
->date
< item
->date
) {
399 return commit_list_insert(item
, pp
);
402 static int commit_list_compare_by_date(const void *a
, const void *b
)
404 unsigned long a_date
= ((const struct commit_list
*)a
)->item
->date
;
405 unsigned long b_date
= ((const struct commit_list
*)b
)->item
->date
;
413 static void *commit_list_get_next(const void *a
)
415 return ((const struct commit_list
*)a
)->next
;
418 static void commit_list_set_next(void *a
, void *next
)
420 ((struct commit_list
*)a
)->next
= next
;
423 void commit_list_sort_by_date(struct commit_list
**list
)
425 *list
= llist_mergesort(*list
, commit_list_get_next
, commit_list_set_next
,
426 commit_list_compare_by_date
);
429 struct commit
*pop_most_recent_commit(struct commit_list
**list
,
432 struct commit
*ret
= (*list
)->item
;
433 struct commit_list
*parents
= ret
->parents
;
434 struct commit_list
*old
= *list
;
436 *list
= (*list
)->next
;
440 struct commit
*commit
= parents
->item
;
441 if (!parse_commit(commit
) && !(commit
->object
.flags
& mark
)) {
442 commit
->object
.flags
|= mark
;
443 commit_list_insert_by_date(commit
, list
);
445 parents
= parents
->next
;
450 static void clear_commit_marks_1(struct commit_list
**plist
,
451 struct commit
*commit
, unsigned int mark
)
454 struct commit_list
*parents
;
456 if (!(mark
& commit
->object
.flags
))
459 commit
->object
.flags
&= ~mark
;
461 parents
= commit
->parents
;
465 while ((parents
= parents
->next
))
466 commit_list_insert(parents
->item
, plist
);
468 commit
= commit
->parents
->item
;
472 void clear_commit_marks(struct commit
*commit
, unsigned int mark
)
474 struct commit_list
*list
= NULL
;
475 commit_list_insert(commit
, &list
);
477 clear_commit_marks_1(&list
, pop_commit(&list
), mark
);
480 void clear_commit_marks_for_object_array(struct object_array
*a
, unsigned mark
)
482 struct object
*object
;
483 struct commit
*commit
;
486 for (i
= 0; i
< a
->nr
; i
++) {
487 object
= a
->objects
[i
].item
;
488 commit
= lookup_commit_reference_gently(object
->sha1
, 1);
490 clear_commit_marks(commit
, mark
);
494 struct commit
*pop_commit(struct commit_list
**stack
)
496 struct commit_list
*top
= *stack
;
497 struct commit
*item
= top
? top
->item
: NULL
;
507 * Topological sort support
510 /* count number of children that have not been emitted */
511 define_commit_slab(indegree_slab
, int);
513 /* record author-date for each commit object */
514 define_commit_slab(author_date_slab
, unsigned long);
516 static void record_author_date(struct author_date_slab
*author_date
,
517 struct commit
*commit
)
519 const char *buf
, *line_end
;
521 struct ident_split ident
;
525 if (!commit
->buffer
) {
527 enum object_type type
;
528 buffer
= read_sha1_file(commit
->object
.sha1
, &type
, &size
);
533 for (buf
= commit
->buffer
? commit
->buffer
: buffer
;
535 buf
= line_end
+ 1) {
536 line_end
= strchrnul(buf
, '\n');
537 if (prefixcmp(buf
, "author ")) {
538 if (!line_end
[0] || line_end
[1] == '\n')
539 return; /* end of header */
542 if (split_ident_line(&ident
,
543 buf
+ strlen("author "),
544 line_end
- (buf
+ strlen("author "))) ||
545 !ident
.date_begin
|| !ident
.date_end
)
546 goto fail_exit
; /* malformed "author" line */
550 date
= strtoul(ident
.date_begin
, &date_end
, 10);
551 if (date_end
!= ident
.date_end
)
552 goto fail_exit
; /* malformed date */
553 *(author_date_slab_at(author_date
, commit
)) = date
;
559 static int compare_commits_by_author_date(const void *a_
, const void *b_
,
562 const struct commit
*a
= a_
, *b
= b_
;
563 struct author_date_slab
*author_date
= cb_data
;
564 unsigned long a_date
= *(author_date_slab_at(author_date
, a
));
565 unsigned long b_date
= *(author_date_slab_at(author_date
, b
));
567 /* newer commits with larger date first */
570 else if (a_date
> b_date
)
575 static int compare_commits_by_commit_date(const void *a_
, const void *b_
, void *unused
)
577 const struct commit
*a
= a_
, *b
= b_
;
578 /* newer commits with larger date first */
579 if (a
->date
< b
->date
)
581 else if (a
->date
> b
->date
)
587 * Performs an in-place topological sort on the list supplied.
589 void sort_in_topological_order(struct commit_list
**list
, enum rev_sort_order sort_order
)
591 struct commit_list
*next
, *orig
= *list
;
592 struct commit_list
**pptr
;
593 struct indegree_slab indegree
;
594 struct prio_queue queue
;
595 struct commit
*commit
;
596 struct author_date_slab author_date
;
602 init_indegree_slab(&indegree
);
603 memset(&queue
, '\0', sizeof(queue
));
605 switch (sort_order
) {
606 default: /* REV_SORT_IN_GRAPH_ORDER */
607 queue
.compare
= NULL
;
609 case REV_SORT_BY_COMMIT_DATE
:
610 queue
.compare
= compare_commits_by_commit_date
;
612 case REV_SORT_BY_AUTHOR_DATE
:
613 init_author_date_slab(&author_date
);
614 queue
.compare
= compare_commits_by_author_date
;
615 queue
.cb_data
= &author_date
;
619 /* Mark them and clear the indegree */
620 for (next
= orig
; next
; next
= next
->next
) {
621 struct commit
*commit
= next
->item
;
622 *(indegree_slab_at(&indegree
, commit
)) = 1;
623 /* also record the author dates, if needed */
624 if (sort_order
== REV_SORT_BY_AUTHOR_DATE
)
625 record_author_date(&author_date
, commit
);
628 /* update the indegree */
629 for (next
= orig
; next
; next
= next
->next
) {
630 struct commit_list
*parents
= next
->item
->parents
;
632 struct commit
*parent
= parents
->item
;
633 int *pi
= indegree_slab_at(&indegree
, parent
);
637 parents
= parents
->next
;
644 * tips are nodes not reachable from any other node in the list
646 * the tips serve as a starting set for the work queue.
648 for (next
= orig
; next
; next
= next
->next
) {
649 struct commit
*commit
= next
->item
;
651 if (*(indegree_slab_at(&indegree
, commit
)) == 1)
652 prio_queue_put(&queue
, commit
);
656 * This is unfortunate; the initial tips need to be shown
657 * in the order given from the revision traversal machinery.
659 if (sort_order
== REV_SORT_IN_GRAPH_ORDER
)
660 prio_queue_reverse(&queue
);
662 /* We no longer need the commit list */
663 free_commit_list(orig
);
667 while ((commit
= prio_queue_get(&queue
)) != NULL
) {
668 struct commit_list
*parents
;
670 for (parents
= commit
->parents
; parents
; parents
= parents
->next
) {
671 struct commit
*parent
= parents
->item
;
672 int *pi
= indegree_slab_at(&indegree
, parent
);
678 * parents are only enqueued for emission
679 * when all their children have been emitted thereby
680 * guaranteeing topological order.
683 prio_queue_put(&queue
, parent
);
686 * all children of commit have already been
687 * emitted. we can emit it now.
689 *(indegree_slab_at(&indegree
, commit
)) = 0;
691 pptr
= &commit_list_insert(commit
, pptr
)->next
;
694 clear_indegree_slab(&indegree
);
695 clear_prio_queue(&queue
);
696 if (sort_order
== REV_SORT_BY_AUTHOR_DATE
)
697 clear_author_date_slab(&author_date
);
700 /* merge-base stuff */
702 /* bits #0..15 in revision.h */
703 #define PARENT1 (1u<<16)
704 #define PARENT2 (1u<<17)
705 #define STALE (1u<<18)
706 #define RESULT (1u<<19)
708 static const unsigned all_flags
= (PARENT1
| PARENT2
| STALE
| RESULT
);
710 static struct commit
*interesting(struct commit_list
*list
)
713 struct commit
*commit
= list
->item
;
715 if (commit
->object
.flags
& STALE
)
722 /* all input commits in one and twos[] must have been parsed! */
723 static struct commit_list
*paint_down_to_common(struct commit
*one
, int n
, struct commit
**twos
)
725 struct commit_list
*list
= NULL
;
726 struct commit_list
*result
= NULL
;
729 one
->object
.flags
|= PARENT1
;
730 commit_list_insert_by_date(one
, &list
);
733 for (i
= 0; i
< n
; i
++) {
734 twos
[i
]->object
.flags
|= PARENT2
;
735 commit_list_insert_by_date(twos
[i
], &list
);
738 while (interesting(list
)) {
739 struct commit
*commit
;
740 struct commit_list
*parents
;
741 struct commit_list
*next
;
749 flags
= commit
->object
.flags
& (PARENT1
| PARENT2
| STALE
);
750 if (flags
== (PARENT1
| PARENT2
)) {
751 if (!(commit
->object
.flags
& RESULT
)) {
752 commit
->object
.flags
|= RESULT
;
753 commit_list_insert_by_date(commit
, &result
);
755 /* Mark parents of a found merge stale */
758 parents
= commit
->parents
;
760 struct commit
*p
= parents
->item
;
761 parents
= parents
->next
;
762 if ((p
->object
.flags
& flags
) == flags
)
766 p
->object
.flags
|= flags
;
767 commit_list_insert_by_date(p
, &list
);
771 free_commit_list(list
);
775 static struct commit_list
*merge_bases_many(struct commit
*one
, int n
, struct commit
**twos
)
777 struct commit_list
*list
= NULL
;
778 struct commit_list
*result
= NULL
;
781 for (i
= 0; i
< n
; i
++) {
784 * We do not mark this even with RESULT so we do not
785 * have to clean it up.
787 return commit_list_insert(one
, &result
);
790 if (parse_commit(one
))
792 for (i
= 0; i
< n
; i
++) {
793 if (parse_commit(twos
[i
]))
797 list
= paint_down_to_common(one
, n
, twos
);
800 struct commit_list
*next
= list
->next
;
801 if (!(list
->item
->object
.flags
& STALE
))
802 commit_list_insert_by_date(list
->item
, &result
);
809 struct commit_list
*get_octopus_merge_bases(struct commit_list
*in
)
811 struct commit_list
*i
, *j
, *k
, *ret
= NULL
;
812 struct commit_list
**pptr
= &ret
;
814 for (i
= in
; i
; i
= i
->next
) {
816 pptr
= &commit_list_insert(i
->item
, pptr
)->next
;
818 struct commit_list
*new = NULL
, *end
= NULL
;
820 for (j
= ret
; j
; j
= j
->next
) {
821 struct commit_list
*bases
;
822 bases
= get_merge_bases(i
->item
, j
->item
, 1);
827 for (k
= bases
; k
; k
= k
->next
)
836 static int remove_redundant(struct commit
**array
, int cnt
)
839 * Some commit in the array may be an ancestor of
840 * another commit. Move such commit to the end of
841 * the array, and return the number of commits that
842 * are independent from each other.
844 struct commit
**work
;
845 unsigned char *redundant
;
849 work
= xcalloc(cnt
, sizeof(*work
));
850 redundant
= xcalloc(cnt
, 1);
851 filled_index
= xmalloc(sizeof(*filled_index
) * (cnt
- 1));
853 for (i
= 0; i
< cnt
; i
++)
854 parse_commit(array
[i
]);
855 for (i
= 0; i
< cnt
; i
++) {
856 struct commit_list
*common
;
860 for (j
= filled
= 0; j
< cnt
; j
++) {
861 if (i
== j
|| redundant
[j
])
863 filled_index
[filled
] = j
;
864 work
[filled
++] = array
[j
];
866 common
= paint_down_to_common(array
[i
], filled
, work
);
867 if (array
[i
]->object
.flags
& PARENT2
)
869 for (j
= 0; j
< filled
; j
++)
870 if (work
[j
]->object
.flags
& PARENT1
)
871 redundant
[filled_index
[j
]] = 1;
872 clear_commit_marks(array
[i
], all_flags
);
873 for (j
= 0; j
< filled
; j
++)
874 clear_commit_marks(work
[j
], all_flags
);
875 free_commit_list(common
);
878 /* Now collect the result */
879 memcpy(work
, array
, sizeof(*array
) * cnt
);
880 for (i
= filled
= 0; i
< cnt
; i
++)
882 array
[filled
++] = work
[i
];
883 for (j
= filled
, i
= 0; i
< cnt
; i
++)
885 array
[j
++] = work
[i
];
892 struct commit_list
*get_merge_bases_many(struct commit
*one
,
894 struct commit
**twos
,
897 struct commit_list
*list
;
898 struct commit
**rslt
;
899 struct commit_list
*result
;
902 result
= merge_bases_many(one
, n
, twos
);
903 for (i
= 0; i
< n
; i
++) {
907 if (!result
|| !result
->next
) {
909 clear_commit_marks(one
, all_flags
);
910 for (i
= 0; i
< n
; i
++)
911 clear_commit_marks(twos
[i
], all_flags
);
916 /* There are more than one */
923 rslt
= xcalloc(cnt
, sizeof(*rslt
));
924 for (list
= result
, i
= 0; list
; list
= list
->next
)
925 rslt
[i
++] = list
->item
;
926 free_commit_list(result
);
928 clear_commit_marks(one
, all_flags
);
929 for (i
= 0; i
< n
; i
++)
930 clear_commit_marks(twos
[i
], all_flags
);
932 cnt
= remove_redundant(rslt
, cnt
);
934 for (i
= 0; i
< cnt
; i
++)
935 commit_list_insert_by_date(rslt
[i
], &result
);
940 struct commit_list
*get_merge_bases(struct commit
*one
, struct commit
*two
,
943 return get_merge_bases_many(one
, 1, &two
, cleanup
);
947 * Is "commit" a descendant of one of the elements on the "with_commit" list?
949 int is_descendant_of(struct commit
*commit
, struct commit_list
*with_commit
)
953 while (with_commit
) {
954 struct commit
*other
;
956 other
= with_commit
->item
;
957 with_commit
= with_commit
->next
;
958 if (in_merge_bases(other
, commit
))
965 * Is "commit" an ancestor of (i.e. reachable from) the "reference"?
967 int in_merge_bases(struct commit
*commit
, struct commit
*reference
)
969 struct commit_list
*bases
;
972 if (parse_commit(commit
) || parse_commit(reference
))
975 bases
= paint_down_to_common(commit
, 1, &reference
);
976 if (commit
->object
.flags
& PARENT2
)
978 clear_commit_marks(commit
, all_flags
);
979 clear_commit_marks(reference
, all_flags
);
980 free_commit_list(bases
);
984 struct commit_list
*reduce_heads(struct commit_list
*heads
)
986 struct commit_list
*p
;
987 struct commit_list
*result
= NULL
, **tail
= &result
;
988 struct commit
**array
;
995 for (p
= heads
; p
; p
= p
->next
)
996 p
->item
->object
.flags
&= ~STALE
;
997 for (p
= heads
, num_head
= 0; p
; p
= p
->next
) {
998 if (p
->item
->object
.flags
& STALE
)
1000 p
->item
->object
.flags
|= STALE
;
1003 array
= xcalloc(sizeof(*array
), num_head
);
1004 for (p
= heads
, i
= 0; p
; p
= p
->next
) {
1005 if (p
->item
->object
.flags
& STALE
) {
1006 array
[i
++] = p
->item
;
1007 p
->item
->object
.flags
&= ~STALE
;
1010 num_head
= remove_redundant(array
, num_head
);
1011 for (i
= 0; i
< num_head
; i
++)
1012 tail
= &commit_list_insert(array
[i
], tail
)->next
;
1016 static const char gpg_sig_header
[] = "gpgsig";
1017 static const int gpg_sig_header_len
= sizeof(gpg_sig_header
) - 1;
1019 static int do_sign_commit(struct strbuf
*buf
, const char *keyid
)
1021 struct strbuf sig
= STRBUF_INIT
;
1022 int inspos
, copypos
;
1024 /* find the end of the header */
1025 inspos
= strstr(buf
->buf
, "\n\n") - buf
->buf
+ 1;
1027 if (!keyid
|| !*keyid
)
1028 keyid
= get_signing_key();
1029 if (sign_buffer(buf
, &sig
, keyid
)) {
1030 strbuf_release(&sig
);
1034 for (copypos
= 0; sig
.buf
[copypos
]; ) {
1035 const char *bol
= sig
.buf
+ copypos
;
1036 const char *eol
= strchrnul(bol
, '\n');
1037 int len
= (eol
- bol
) + !!*eol
;
1040 strbuf_insert(buf
, inspos
, gpg_sig_header
, gpg_sig_header_len
);
1041 inspos
+= gpg_sig_header_len
;
1043 strbuf_insert(buf
, inspos
++, " ", 1);
1044 strbuf_insert(buf
, inspos
, bol
, len
);
1048 strbuf_release(&sig
);
1052 int parse_signed_commit(const unsigned char *sha1
,
1053 struct strbuf
*payload
, struct strbuf
*signature
)
1056 enum object_type type
;
1057 char *buffer
= read_sha1_file(sha1
, &type
, &size
);
1058 int in_signature
, saw_signature
= -1;
1061 if (!buffer
|| type
!= OBJ_COMMIT
)
1065 tail
= buffer
+ size
;
1068 while (line
< tail
) {
1069 const char *sig
= NULL
;
1070 char *next
= memchr(line
, '\n', tail
- line
);
1072 next
= next
? next
+ 1 : tail
;
1073 if (in_signature
&& line
[0] == ' ')
1075 else if (!prefixcmp(line
, gpg_sig_header
) &&
1076 line
[gpg_sig_header_len
] == ' ')
1077 sig
= line
+ gpg_sig_header_len
+ 1;
1079 strbuf_add(signature
, sig
, next
- sig
);
1084 /* dump the whole remainder of the buffer */
1086 strbuf_add(payload
, line
, next
- line
);
1093 return saw_signature
;
1096 static void handle_signed_tag(struct commit
*parent
, struct commit_extra_header
***tail
)
1098 struct merge_remote_desc
*desc
;
1099 struct commit_extra_header
*mergetag
;
1101 unsigned long size
, len
;
1102 enum object_type type
;
1104 desc
= merge_remote_util(parent
);
1105 if (!desc
|| !desc
->obj
)
1107 buf
= read_sha1_file(desc
->obj
->sha1
, &type
, &size
);
1108 if (!buf
|| type
!= OBJ_TAG
)
1110 len
= parse_signature(buf
, size
);
1114 * We could verify this signature and either omit the tag when
1115 * it does not validate, but the integrator may not have the
1116 * public key of the signer of the tag he is merging, while a
1117 * later auditor may have it while auditing, so let's not run
1118 * verify-signed-buffer here for now...
1120 * if (verify_signed_buffer(buf, len, buf + len, size - len, ...))
1121 * warn("warning: signed tag unverified.");
1123 mergetag
= xcalloc(1, sizeof(*mergetag
));
1124 mergetag
->key
= xstrdup("mergetag");
1125 mergetag
->value
= buf
;
1126 mergetag
->len
= size
;
1129 *tail
= &mergetag
->next
;
1136 void append_merge_tag_headers(struct commit_list
*parents
,
1137 struct commit_extra_header
***tail
)
1140 struct commit
*parent
= parents
->item
;
1141 handle_signed_tag(parent
, tail
);
1142 parents
= parents
->next
;
1146 static void add_extra_header(struct strbuf
*buffer
,
1147 struct commit_extra_header
*extra
)
1149 strbuf_addstr(buffer
, extra
->key
);
1151 strbuf_add_lines(buffer
, " ", extra
->value
, extra
->len
);
1153 strbuf_addch(buffer
, '\n');
1156 struct commit_extra_header
*read_commit_extra_headers(struct commit
*commit
,
1157 const char **exclude
)
1159 struct commit_extra_header
*extra
= NULL
;
1161 enum object_type type
;
1162 char *buffer
= read_sha1_file(commit
->object
.sha1
, &type
, &size
);
1163 if (buffer
&& type
== OBJ_COMMIT
)
1164 extra
= read_commit_extra_header_lines(buffer
, size
, exclude
);
1169 static inline int standard_header_field(const char *field
, size_t len
)
1171 return ((len
== 4 && !memcmp(field
, "tree ", 5)) ||
1172 (len
== 6 && !memcmp(field
, "parent ", 7)) ||
1173 (len
== 6 && !memcmp(field
, "author ", 7)) ||
1174 (len
== 9 && !memcmp(field
, "committer ", 10)) ||
1175 (len
== 8 && !memcmp(field
, "encoding ", 9)));
1178 static int excluded_header_field(const char *field
, size_t len
, const char **exclude
)
1184 size_t xlen
= strlen(*exclude
);
1186 !memcmp(field
, *exclude
, xlen
) && field
[xlen
] == ' ')
1193 static struct commit_extra_header
*read_commit_extra_header_lines(
1194 const char *buffer
, size_t size
,
1195 const char **exclude
)
1197 struct commit_extra_header
*extra
= NULL
, **tail
= &extra
, *it
= NULL
;
1198 const char *line
, *next
, *eof
, *eob
;
1199 struct strbuf buf
= STRBUF_INIT
;
1201 for (line
= buffer
, eob
= line
+ size
;
1202 line
< eob
&& *line
!= '\n';
1204 next
= memchr(line
, '\n', eob
- line
);
1205 next
= next
? next
+ 1 : eob
;
1209 strbuf_add(&buf
, line
+ 1, next
- (line
+ 1));
1213 it
->value
= strbuf_detach(&buf
, &it
->len
);
1217 eof
= strchr(line
, ' ');
1221 if (standard_header_field(line
, eof
- line
) ||
1222 excluded_header_field(line
, eof
- line
, exclude
))
1225 it
= xcalloc(1, sizeof(*it
));
1226 it
->key
= xmemdupz(line
, eof
-line
);
1230 strbuf_add(&buf
, eof
+ 1, next
- (eof
+ 1));
1233 it
->value
= strbuf_detach(&buf
, &it
->len
);
1237 void free_commit_extra_headers(struct commit_extra_header
*extra
)
1240 struct commit_extra_header
*next
= extra
->next
;
1248 int commit_tree(const struct strbuf
*msg
, unsigned char *tree
,
1249 struct commit_list
*parents
, unsigned char *ret
,
1250 const char *author
, const char *sign_commit
)
1252 struct commit_extra_header
*extra
= NULL
, **tail
= &extra
;
1255 append_merge_tag_headers(parents
, &tail
);
1256 result
= commit_tree_extended(msg
, tree
, parents
, ret
,
1257 author
, sign_commit
, extra
);
1258 free_commit_extra_headers(extra
);
1262 static int find_invalid_utf8(const char *buf
, int len
)
1267 unsigned char c
= *buf
++;
1268 int bytes
, bad_offset
;
1273 /* Simple US-ASCII? No worries. */
1277 bad_offset
= offset
-1;
1280 * Count how many more high bits set: that's how
1281 * many more bytes this sequence should have.
1289 /* Must be between 1 and 5 more bytes */
1290 if (bytes
< 1 || bytes
> 5)
1293 /* Do we *have* that many bytes? */
1300 /* And verify that they are good continuation bytes */
1302 if ((*buf
++ & 0xc0) != 0x80)
1306 /* We could/should check the value and length here too */
1312 * This verifies that the buffer is in proper utf8 format.
1314 * If it isn't, it assumes any non-utf8 characters are Latin1,
1315 * and does the conversion.
1317 * Fixme: we should probably also disallow overlong forms and
1318 * invalid characters. But we don't do that currently.
1320 static int verify_utf8(struct strbuf
*buf
)
1328 unsigned char replace
[2];
1330 bad
= find_invalid_utf8(buf
->buf
+ pos
, buf
->len
- pos
);
1336 strbuf_remove(buf
, pos
, 1);
1338 /* We know 'c' must be in the range 128-255 */
1339 replace
[0] = 0xc0 + (c
>> 6);
1340 replace
[1] = 0x80 + (c
& 0x3f);
1341 strbuf_insert(buf
, pos
, replace
, 2);
1346 static const char commit_utf8_warn
[] =
1347 "Warning: commit message did not conform to UTF-8.\n"
1348 "You may want to amend it after fixing the message, or set the config\n"
1349 "variable i18n.commitencoding to the encoding your project uses.\n";
1351 int commit_tree_extended(const struct strbuf
*msg
, unsigned char *tree
,
1352 struct commit_list
*parents
, unsigned char *ret
,
1353 const char *author
, const char *sign_commit
,
1354 struct commit_extra_header
*extra
)
1357 int encoding_is_utf8
;
1358 struct strbuf buffer
;
1360 assert_sha1_type(tree
, OBJ_TREE
);
1362 if (memchr(msg
->buf
, '\0', msg
->len
))
1363 return error("a NUL byte in commit log message not allowed.");
1365 /* Not having i18n.commitencoding is the same as having utf-8 */
1366 encoding_is_utf8
= is_encoding_utf8(git_commit_encoding
);
1368 strbuf_init(&buffer
, 8192); /* should avoid reallocs for the headers */
1369 strbuf_addf(&buffer
, "tree %s\n", sha1_to_hex(tree
));
1372 * NOTE! This ordering means that the same exact tree merged with a
1373 * different order of parents will be a _different_ changeset even
1374 * if everything else stays the same.
1377 struct commit_list
*next
= parents
->next
;
1378 struct commit
*parent
= parents
->item
;
1380 strbuf_addf(&buffer
, "parent %s\n",
1381 sha1_to_hex(parent
->object
.sha1
));
1386 /* Person/date information */
1388 author
= git_author_info(IDENT_STRICT
);
1389 strbuf_addf(&buffer
, "author %s\n", author
);
1390 strbuf_addf(&buffer
, "committer %s\n", git_committer_info(IDENT_STRICT
));
1391 if (!encoding_is_utf8
)
1392 strbuf_addf(&buffer
, "encoding %s\n", git_commit_encoding
);
1395 add_extra_header(&buffer
, extra
);
1396 extra
= extra
->next
;
1398 strbuf_addch(&buffer
, '\n');
1400 /* And add the comment */
1401 strbuf_addbuf(&buffer
, msg
);
1403 /* And check the encoding */
1404 if (encoding_is_utf8
&& !verify_utf8(&buffer
))
1405 fprintf(stderr
, commit_utf8_warn
);
1407 if (sign_commit
&& do_sign_commit(&buffer
, sign_commit
))
1410 result
= write_sha1_file(buffer
.buf
, buffer
.len
, commit_type
, ret
);
1411 strbuf_release(&buffer
);
1415 struct commit
*get_merge_parent(const char *name
)
1418 struct commit
*commit
;
1419 unsigned char sha1
[20];
1420 if (get_sha1(name
, sha1
))
1422 obj
= parse_object(sha1
);
1423 commit
= (struct commit
*)peel_to_type(name
, 0, obj
, OBJ_COMMIT
);
1424 if (commit
&& !commit
->util
) {
1425 struct merge_remote_desc
*desc
;
1426 desc
= xmalloc(sizeof(*desc
));
1428 desc
->name
= strdup(name
);
1429 commit
->util
= desc
;
1435 * Append a commit to the end of the commit_list.
1437 * next starts by pointing to the variable that holds the head of an
1438 * empty commit_list, and is updated to point to the "next" field of
1439 * the last item on the list as new commits are appended.
1443 * struct commit_list *list;
1444 * struct commit_list **next = &list;
1446 * next = commit_list_append(c1, next);
1447 * next = commit_list_append(c2, next);
1448 * assert(commit_list_count(list) == 2);
1451 struct commit_list
**commit_list_append(struct commit
*commit
,
1452 struct commit_list
**next
)
1454 struct commit_list
*new = xmalloc(sizeof(struct commit_list
));
1461 void print_commit_list(struct commit_list
*list
,
1462 const char *format_cur
,
1463 const char *format_last
)
1465 for ( ; list
; list
= list
->next
) {
1466 const char *format
= list
->next
? format_cur
: format_last
;
1467 printf(format
, sha1_to_hex(list
->item
->object
.sha1
));