0058fa5b4365d290ccdb0ed64f6a23eb6f195527
1#include "cache.h"
2#include "tag.h"
3#include "commit.h"
4#include "pkt-line.h"
5#include "utf8.h"
6#include "diff.h"
7#include "revision.h"
8#include "notes.h"
9#include "gpg-interface.h"
10int save_commit_buffer = 1;
12const char *commit_type = "commit";
14static struct commit *check_commit(struct object *obj,
16 const unsigned char *sha1,
17 int quiet)
18{
19 if (obj->type != OBJ_COMMIT) {
20 if (!quiet)
21 error("Object %s is a %s, not a commit",
22 sha1_to_hex(sha1), typename(obj->type));
23 return NULL;
24 }
25 return (struct commit *) obj;
26}
27struct commit *lookup_commit_reference_gently(const unsigned char *sha1,
29 int quiet)
30{
31 struct object *obj = deref_tag(parse_object(sha1), NULL, 0);
32 if (!obj)
34 return NULL;
35 return check_commit(obj, sha1, quiet);
36}
37struct commit *lookup_commit_reference(const unsigned char *sha1)
39{
40 return lookup_commit_reference_gently(sha1, 0);
41}
42struct commit *lookup_commit_or_die(const unsigned char *sha1, const char *ref_name)
44{
45 struct commit *c = lookup_commit_reference(sha1);
46 if (!c)
47 die(_("could not parse %s"), ref_name);
48 if (hashcmp(sha1, c->object.sha1)) {
49 warning(_("%s %s is not a commit!"),
50 ref_name, sha1_to_hex(sha1));
51 }
52 return c;
53}
54struct commit *lookup_commit(const unsigned char *sha1)
56{
57 struct object *obj = lookup_object(sha1);
58 if (!obj)
59 return create_object(sha1, OBJ_COMMIT, alloc_commit_node());
60 if (!obj->type)
61 obj->type = OBJ_COMMIT;
62 return check_commit(obj, sha1, 0);
63}
64struct commit *lookup_commit_reference_by_name(const char *name)
66{
67 unsigned char sha1[20];
68 struct commit *commit;
69 if (get_sha1(name, sha1))
71 return NULL;
72 commit = lookup_commit_reference(sha1);
73 if (!commit || parse_commit(commit))
74 return NULL;
75 return commit;
76}
77static unsigned long parse_commit_date(const char *buf, const char *tail)
79{
80 const char *dateptr;
81 if (buf + 6 >= tail)
83 return 0;
84 if (memcmp(buf, "author", 6))
85 return 0;
86 while (buf < tail && *buf++ != '\n')
87 /* nada */;
88 if (buf + 9 >= tail)
89 return 0;
90 if (memcmp(buf, "committer", 9))
91 return 0;
92 while (buf < tail && *buf++ != '>')
93 /* nada */;
94 if (buf >= tail)
95 return 0;
96 dateptr = buf;
97 while (buf < tail && *buf++ != '\n')
98 /* nada */;
99 if (buf >= tail)
100 return 0;
101 /* dateptr < buf && buf[-1] == '\n', so strtoul will stop at buf-1 */
102 return strtoul(dateptr, NULL, 10);
103}
104static struct commit_graft **commit_graft;
106static int commit_graft_alloc, commit_graft_nr;
107static int commit_graft_pos(const unsigned char *sha1)
109{
110 int lo, hi;
111 lo = 0;
112 hi = commit_graft_nr;
113 while (lo < hi) {
114 int mi = (lo + hi) / 2;
115 struct commit_graft *graft = commit_graft[mi];
116 int cmp = hashcmp(sha1, graft->sha1);
117 if (!cmp)
118 return mi;
119 if (cmp < 0)
120 hi = mi;
121 else
122 lo = mi + 1;
123 }
124 return -lo - 1;
125}
126int register_commit_graft(struct commit_graft *graft, int ignore_dups)
128{
129 int pos = commit_graft_pos(graft->sha1);
130 if (0 <= pos) {
132 if (ignore_dups)
133 free(graft);
134 else {
135 free(commit_graft[pos]);
136 commit_graft[pos] = graft;
137 }
138 return 1;
139 }
140 pos = -pos - 1;
141 if (commit_graft_alloc <= ++commit_graft_nr) {
142 commit_graft_alloc = alloc_nr(commit_graft_alloc);
143 commit_graft = xrealloc(commit_graft,
144 sizeof(*commit_graft) *
145 commit_graft_alloc);
146 }
147 if (pos < commit_graft_nr)
148 memmove(commit_graft + pos + 1,
149 commit_graft + pos,
150 (commit_graft_nr - pos - 1) *
151 sizeof(*commit_graft));
152 commit_graft[pos] = graft;
153 return 0;
154}
155struct commit_graft *read_graft_line(char *buf, int len)
157{
158 /* The format is just "Commit Parent1 Parent2 ...\n" */
159 int i;
160 struct commit_graft *graft = NULL;
161 while (len && isspace(buf[len-1]))
163 buf[--len] = '\0';
164 if (buf[0] == '#' || buf[0] == '\0')
165 return NULL;
166 if ((len + 1) % 41)
167 goto bad_graft_data;
168 i = (len + 1) / 41 - 1;
169 graft = xmalloc(sizeof(*graft) + 20 * i);
170 graft->nr_parent = i;
171 if (get_sha1_hex(buf, graft->sha1))
172 goto bad_graft_data;
173 for (i = 40; i < len; i += 41) {
174 if (buf[i] != ' ')
175 goto bad_graft_data;
176 if (get_sha1_hex(buf + i + 1, graft->parent[i/41]))
177 goto bad_graft_data;
178 }
179 return graft;
180bad_graft_data:
182 error("bad graft data: %s", buf);
183 free(graft);
184 return NULL;
185}
186static int read_graft_file(const char *graft_file)
188{
189 FILE *fp = fopen(graft_file, "r");
190 char buf[1024];
191 if (!fp)
192 return -1;
193 while (fgets(buf, sizeof(buf), fp)) {
194 /* The format is just "Commit Parent1 Parent2 ...\n" */
195 int len = strlen(buf);
196 struct commit_graft *graft = read_graft_line(buf, len);
197 if (!graft)
198 continue;
199 if (register_commit_graft(graft, 1))
200 error("duplicate graft data: %s", buf);
201 }
202 fclose(fp);
203 return 0;
204}
205static void prepare_commit_graft(void)
207{
208 static int commit_graft_prepared;
209 char *graft_file;
210 if (commit_graft_prepared)
212 return;
213 graft_file = get_graft_file();
214 read_graft_file(graft_file);
215 /* make sure shallows are read */
216 is_repository_shallow();
217 commit_graft_prepared = 1;
218}
219struct commit_graft *lookup_commit_graft(const unsigned char *sha1)
221{
222 int pos;
223 prepare_commit_graft();
224 pos = commit_graft_pos(sha1);
225 if (pos < 0)
226 return NULL;
227 return commit_graft[pos];
228}
229int for_each_commit_graft(each_commit_graft_fn fn, void *cb_data)
231{
232 int i, ret;
233 for (i = ret = 0; i < commit_graft_nr && !ret; i++)
234 ret = fn(commit_graft[i], cb_data);
235 return ret;
236}
237int unregister_shallow(const unsigned char *sha1)
239{
240 int pos = commit_graft_pos(sha1);
241 if (pos < 0)
242 return -1;
243 if (pos + 1 < commit_graft_nr)
244 memmove(commit_graft + pos, commit_graft + pos + 1,
245 sizeof(struct commit_graft *)
246 * (commit_graft_nr - pos - 1));
247 commit_graft_nr--;
248 return 0;
249}
250int parse_commit_buffer(struct commit *item, const void *buffer, unsigned long size)
252{
253 const char *tail = buffer;
254 const char *bufptr = buffer;
255 unsigned char parent[20];
256 struct commit_list **pptr;
257 struct commit_graft *graft;
258 if (item->object.parsed)
260 return 0;
261 item->object.parsed = 1;
262 tail += size;
263 if (tail <= bufptr + 46 || memcmp(bufptr, "tree ", 5) || bufptr[45] != '\n')
264 return error("bogus commit object %s", sha1_to_hex(item->object.sha1));
265 if (get_sha1_hex(bufptr + 5, parent) < 0)
266 return error("bad tree pointer in commit %s",
267 sha1_to_hex(item->object.sha1));
268 item->tree = lookup_tree(parent);
269 bufptr += 46; /* "tree " + "hex sha1" + "\n" */
270 pptr = &item->parents;
271 graft = lookup_commit_graft(item->object.sha1);
273 while (bufptr + 48 < tail && !memcmp(bufptr, "parent ", 7)) {
274 struct commit *new_parent;
275 if (tail <= bufptr + 48 ||
277 get_sha1_hex(bufptr + 7, parent) ||
278 bufptr[47] != '\n')
279 return error("bad parents in commit %s", sha1_to_hex(item->object.sha1));
280 bufptr += 48;
281 /*
282 * The clone is shallow if nr_parent < 0, and we must
283 * not traverse its real parents even when we unhide them.
284 */
285 if (graft && (graft->nr_parent < 0 || grafts_replace_parents))
286 continue;
287 new_parent = lookup_commit(parent);
288 if (new_parent)
289 pptr = &commit_list_insert(new_parent, pptr)->next;
290 }
291 if (graft) {
292 int i;
293 struct commit *new_parent;
294 for (i = 0; i < graft->nr_parent; i++) {
295 new_parent = lookup_commit(graft->parent[i]);
296 if (!new_parent)
297 continue;
298 pptr = &commit_list_insert(new_parent, pptr)->next;
299 }
300 }
301 item->date = parse_commit_date(bufptr, tail);
302 return 0;
304}
305int parse_commit(struct commit *item)
307{
308 enum object_type type;
309 void *buffer;
310 unsigned long size;
311 int ret;
312 if (!item)
314 return -1;
315 if (item->object.parsed)
316 return 0;
317 buffer = read_sha1_file(item->object.sha1, &type, &size);
318 if (!buffer)
319 return error("Could not read %s",
320 sha1_to_hex(item->object.sha1));
321 if (type != OBJ_COMMIT) {
322 free(buffer);
323 return error("Object %s not a commit",
324 sha1_to_hex(item->object.sha1));
325 }
326 ret = parse_commit_buffer(item, buffer, size);
327 if (save_commit_buffer && !ret) {
328 item->buffer = buffer;
329 return 0;
330 }
331 free(buffer);
332 return ret;
333}
334int find_commit_subject(const char *commit_buffer, const char **subject)
336{
337 const char *eol;
338 const char *p = commit_buffer;
339 while (*p && (*p != '\n' || p[1] != '\n'))
341 p++;
342 if (*p) {
343 p += 2;
344 for (eol = p; *eol && *eol != '\n'; eol++)
345 ; /* do nothing */
346 } else
347 eol = p;
348 *subject = p;
350 return eol - p;
352}
353struct commit_list *commit_list_insert(struct commit *item, struct commit_list **list_p)
355{
356 struct commit_list *new_list = xmalloc(sizeof(struct commit_list));
357 new_list->item = item;
358 new_list->next = *list_p;
359 *list_p = new_list;
360 return new_list;
361}
362unsigned commit_list_count(const struct commit_list *l)
364{
365 unsigned c = 0;
366 for (; l; l = l->next )
367 c++;
368 return c;
369}
370void free_commit_list(struct commit_list *list)
372{
373 while (list) {
374 struct commit_list *temp = list;
375 list = temp->next;
376 free(temp);
377 }
378}
379struct commit_list * commit_list_insert_by_date(struct commit *item, struct commit_list **list)
381{
382 struct commit_list **pp = list;
383 struct commit_list *p;
384 while ((p = *pp) != NULL) {
385 if (p->item->date < item->date) {
386 break;
387 }
388 pp = &p->next;
389 }
390 return commit_list_insert(item, pp);
391}
392void commit_list_sort_by_date(struct commit_list **list)
395{
396 struct commit_list *ret = NULL;
397 while (*list) {
398 commit_list_insert_by_date((*list)->item, &ret);
399 *list = (*list)->next;
400 }
401 *list = ret;
402}
403struct commit *pop_most_recent_commit(struct commit_list **list,
405 unsigned int mark)
406{
407 struct commit *ret = (*list)->item;
408 struct commit_list *parents = ret->parents;
409 struct commit_list *old = *list;
410 *list = (*list)->next;
412 free(old);
413 while (parents) {
415 struct commit *commit = parents->item;
416 if (!parse_commit(commit) && !(commit->object.flags & mark)) {
417 commit->object.flags |= mark;
418 commit_list_insert_by_date(commit, list);
419 }
420 parents = parents->next;
421 }
422 return ret;
423}
424void clear_commit_marks(struct commit *commit, unsigned int mark)
426{
427 while (commit) {
428 struct commit_list *parents;
429 if (!(mark & commit->object.flags))
431 return;
432 commit->object.flags &= ~mark;
434 parents = commit->parents;
436 if (!parents)
437 return;
438 while ((parents = parents->next))
440 clear_commit_marks(parents->item, mark);
441 commit = commit->parents->item;
443 }
444}
445void clear_commit_marks_for_object_array(struct object_array *a, unsigned mark)
447{
448 struct object *object;
449 struct commit *commit;
450 unsigned int i;
451 for (i = 0; i < a->nr; i++) {
453 object = a->objects[i].item;
454 commit = lookup_commit_reference_gently(object->sha1, 1);
455 if (commit)
456 clear_commit_marks(commit, mark);
457 }
458}
459struct commit *pop_commit(struct commit_list **stack)
461{
462 struct commit_list *top = *stack;
463 struct commit *item = top ? top->item : NULL;
464 if (top) {
466 *stack = top->next;
467 free(top);
468 }
469 return item;
470}
471/*
473 * Performs an in-place topological sort on the list supplied.
474 */
475void sort_in_topological_order(struct commit_list ** list, int lifo)
476{
477 struct commit_list *next, *orig = *list;
478 struct commit_list *work, **insert;
479 struct commit_list **pptr;
480 if (!orig)
482 return;
483 *list = NULL;
484 /* Mark them and clear the indegree */
486 for (next = orig; next; next = next->next) {
487 struct commit *commit = next->item;
488 commit->indegree = 1;
489 }
490 /* update the indegree */
492 for (next = orig; next; next = next->next) {
493 struct commit_list * parents = next->item->parents;
494 while (parents) {
495 struct commit *parent = parents->item;
496 if (parent->indegree)
498 parent->indegree++;
499 parents = parents->next;
500 }
501 }
502 /*
504 * find the tips
505 *
506 * tips are nodes not reachable from any other node in the list
507 *
508 * the tips serve as a starting set for the work queue.
509 */
510 work = NULL;
511 insert = &work;
512 for (next = orig; next; next = next->next) {
513 struct commit *commit = next->item;
514 if (commit->indegree == 1)
516 insert = &commit_list_insert(commit, insert)->next;
517 }
518 /* process the list in topological order */
520 if (!lifo)
521 commit_list_sort_by_date(&work);
522 pptr = list;
524 *list = NULL;
525 while (work) {
526 struct commit *commit;
527 struct commit_list *parents, *work_item;
528 work_item = work;
530 work = work_item->next;
531 work_item->next = NULL;
532 commit = work_item->item;
534 for (parents = commit->parents; parents ; parents = parents->next) {
535 struct commit *parent = parents->item;
536 if (!parent->indegree)
538 continue;
539 /*
541 * parents are only enqueued for emission
542 * when all their children have been emitted thereby
543 * guaranteeing topological order.
544 */
545 if (--parent->indegree == 1) {
546 if (!lifo)
547 commit_list_insert_by_date(parent, &work);
548 else
549 commit_list_insert(parent, &work);
550 }
551 }
552 /*
553 * work_item is a commit all of whose children
554 * have already been emitted. we can emit it now.
555 */
556 commit->indegree = 0;
557 *pptr = work_item;
558 pptr = &work_item->next;
559 }
560}
561/* merge-base stuff */
563/* bits #0..15 in revision.h */
565#define PARENT1 (1u<<16)
566#define PARENT2 (1u<<17)
567#define STALE (1u<<18)
568#define RESULT (1u<<19)
569static const unsigned all_flags = (PARENT1 | PARENT2 | STALE | RESULT);
571static struct commit *interesting(struct commit_list *list)
573{
574 while (list) {
575 struct commit *commit = list->item;
576 list = list->next;
577 if (commit->object.flags & STALE)
578 continue;
579 return commit;
580 }
581 return NULL;
582}
583static struct commit_list *paint_down_to_common(struct commit *one, int n, struct commit **twos)
585{
586 struct commit_list *list = NULL;
587 struct commit_list *result = NULL;
588 int i;
589 one->object.flags |= PARENT1;
591 commit_list_insert_by_date(one, &list);
592 for (i = 0; i < n; i++) {
593 twos[i]->object.flags |= PARENT2;
594 commit_list_insert_by_date(twos[i], &list);
595 }
596 while (interesting(list)) {
598 struct commit *commit;
599 struct commit_list *parents;
600 struct commit_list *next;
601 int flags;
602 commit = list->item;
604 next = list->next;
605 free(list);
606 list = next;
607 flags = commit->object.flags & (PARENT1 | PARENT2 | STALE);
609 if (flags == (PARENT1 | PARENT2)) {
610 if (!(commit->object.flags & RESULT)) {
611 commit->object.flags |= RESULT;
612 commit_list_insert_by_date(commit, &result);
613 }
614 /* Mark parents of a found merge stale */
615 flags |= STALE;
616 }
617 parents = commit->parents;
618 while (parents) {
619 struct commit *p = parents->item;
620 parents = parents->next;
621 if ((p->object.flags & flags) == flags)
622 continue;
623 if (parse_commit(p))
624 return NULL;
625 p->object.flags |= flags;
626 commit_list_insert_by_date(p, &list);
627 }
628 }
629 free_commit_list(list);
631 return result;
632}
633static struct commit_list *merge_bases_many(struct commit *one, int n, struct commit **twos)
635{
636 struct commit_list *list = NULL;
637 struct commit_list *result = NULL;
638 int i;
639 for (i = 0; i < n; i++) {
641 if (one == twos[i])
642 /*
643 * We do not mark this even with RESULT so we do not
644 * have to clean it up.
645 */
646 return commit_list_insert(one, &result);
647 }
648 if (parse_commit(one))
650 return NULL;
651 for (i = 0; i < n; i++) {
652 if (parse_commit(twos[i]))
653 return NULL;
654 }
655 list = paint_down_to_common(one, n, twos);
657 while (list) {
659 struct commit_list *next = list->next;
660 if (!(list->item->object.flags & STALE))
661 commit_list_insert_by_date(list->item, &result);
662 free(list);
663 list = next;
664 }
665 return result;
666}
667struct commit_list *get_octopus_merge_bases(struct commit_list *in)
669{
670 struct commit_list *i, *j, *k, *ret = NULL;
671 struct commit_list **pptr = &ret;
672 for (i = in; i; i = i->next) {
674 if (!ret)
675 pptr = &commit_list_insert(i->item, pptr)->next;
676 else {
677 struct commit_list *new = NULL, *end = NULL;
678 for (j = ret; j; j = j->next) {
680 struct commit_list *bases;
681 bases = get_merge_bases(i->item, j->item, 1);
682 if (!new)
683 new = bases;
684 else
685 end->next = bases;
686 for (k = bases; k; k = k->next)
687 end = k;
688 }
689 ret = new;
690 }
691 }
692 return ret;
693}
694struct commit_list *get_merge_bases_many(struct commit *one,
696 int n,
697 struct commit **twos,
698 int cleanup)
699{
700 struct commit_list *list;
701 struct commit **rslt;
702 struct commit_list *result;
703 int cnt, i, j;
704 result = merge_bases_many(one, n, twos);
706 for (i = 0; i < n; i++) {
707 if (one == twos[i])
708 return result;
709 }
710 if (!result || !result->next) {
711 if (cleanup) {
712 clear_commit_marks(one, all_flags);
713 for (i = 0; i < n; i++)
714 clear_commit_marks(twos[i], all_flags);
715 }
716 return result;
717 }
718 /* There are more than one */
720 cnt = 0;
721 list = result;
722 while (list) {
723 list = list->next;
724 cnt++;
725 }
726 rslt = xcalloc(cnt, sizeof(*rslt));
727 for (list = result, i = 0; list; list = list->next)
728 rslt[i++] = list->item;
729 free_commit_list(result);
730 clear_commit_marks(one, all_flags);
732 for (i = 0; i < n; i++)
733 clear_commit_marks(twos[i], all_flags);
734 for (i = 0; i < cnt - 1; i++) {
735 for (j = i+1; j < cnt; j++) {
736 if (!rslt[i] || !rslt[j])
737 continue;
738 result = merge_bases_many(rslt[i], 1, &rslt[j]);
739 clear_commit_marks(rslt[i], all_flags);
740 clear_commit_marks(rslt[j], all_flags);
741 for (list = result; list; list = list->next) {
742 if (rslt[i] == list->item)
743 rslt[i] = NULL;
744 if (rslt[j] == list->item)
745 rslt[j] = NULL;
746 }
747 }
748 }
749 /* Surviving ones in rslt[] are the independent results */
751 result = NULL;
752 for (i = 0; i < cnt; i++) {
753 if (rslt[i])
754 commit_list_insert_by_date(rslt[i], &result);
755 }
756 free(rslt);
757 return result;
758}
759struct commit_list *get_merge_bases(struct commit *one, struct commit *two,
761 int cleanup)
762{
763 return get_merge_bases_many(one, 1, &two, cleanup);
764}
765/*
767 * Is "commit" a decendant of one of the elements on the "with_commit" list?
768 */
769int is_descendant_of(struct commit *commit, struct commit_list *with_commit)
770{
771 if (!with_commit)
772 return 1;
773 while (with_commit) {
774 struct commit *other;
775 other = with_commit->item;
777 with_commit = with_commit->next;
778 if (in_merge_bases(other, commit))
779 return 1;
780 }
781 return 0;
782}
783/*
785 * Is "commit" an ancestor of (i.e. reachable from) the "reference"?
786 */
787int in_merge_bases(struct commit *commit, struct commit *reference)
788{
789 struct commit_list *bases, *b;
790 int ret = 0;
791 bases = merge_bases_many(commit, 1, &reference);
793 clear_commit_marks(commit, all_flags);
794 clear_commit_marks(reference, all_flags);
795 for (b = bases; b; b = b->next) {
797 if (!hashcmp(commit->object.sha1, b->item->object.sha1)) {
798 ret = 1;
799 break;
800 }
801 }
802 free_commit_list(bases);
804 return ret;
805}
806struct commit_list *reduce_heads(struct commit_list *heads)
808{
809 struct commit_list *p;
810 struct commit_list *result = NULL, **tail = &result;
811 struct commit **other;
812 size_t num_head, num_other;
813 if (!heads)
815 return NULL;
816 /* Avoid unnecessary reallocations */
818 for (p = heads, num_head = 0; p; p = p->next)
819 num_head++;
820 other = xcalloc(sizeof(*other), num_head);
821 /* For each commit, see if it can be reached by others */
823 for (p = heads; p; p = p->next) {
824 struct commit_list *q, *base;
825 /* Do we already have this in the result? */
827 for (q = result; q; q = q->next)
828 if (p->item == q->item)
829 break;
830 if (q)
831 continue;
832 num_other = 0;
834 for (q = heads; q; q = q->next) {
835 if (p->item == q->item)
836 continue;
837 other[num_other++] = q->item;
838 }
839 if (num_other)
840 base = get_merge_bases_many(p->item, num_other, other, 1);
841 else
842 base = NULL;
843 /*
844 * If p->item does not have anything common with other
845 * commits, there won't be any merge base. If it is
846 * reachable from some of the others, p->item will be
847 * the merge base. If its history is connected with
848 * others, but p->item is not reachable by others, we
849 * will get something other than p->item back.
850 */
851 if (!base || (base->item != p->item))
852 tail = &(commit_list_insert(p->item, tail)->next);
853 free_commit_list(base);
854 }
855 free(other);
856 return result;
857}
858static const char gpg_sig_header[] = "gpgsig";
860static const int gpg_sig_header_len = sizeof(gpg_sig_header) - 1;
861static int do_sign_commit(struct strbuf *buf, const char *keyid)
863{
864 struct strbuf sig = STRBUF_INIT;
865 int inspos, copypos;
866 /* find the end of the header */
868 inspos = strstr(buf->buf, "\n\n") - buf->buf + 1;
869 if (!keyid || !*keyid)
871 keyid = get_signing_key();
872 if (sign_buffer(buf, &sig, keyid)) {
873 strbuf_release(&sig);
874 return -1;
875 }
876 for (copypos = 0; sig.buf[copypos]; ) {
878 const char *bol = sig.buf + copypos;
879 const char *eol = strchrnul(bol, '\n');
880 int len = (eol - bol) + !!*eol;
881 if (!copypos) {
883 strbuf_insert(buf, inspos, gpg_sig_header, gpg_sig_header_len);
884 inspos += gpg_sig_header_len;
885 }
886 strbuf_insert(buf, inspos++, " ", 1);
887 strbuf_insert(buf, inspos, bol, len);
888 inspos += len;
889 copypos += len;
890 }
891 strbuf_release(&sig);
892 return 0;
893}
894int parse_signed_commit(const unsigned char *sha1,
896 struct strbuf *payload, struct strbuf *signature)
897{
898 unsigned long size;
899 enum object_type type;
900 char *buffer = read_sha1_file(sha1, &type, &size);
901 int in_signature, saw_signature = -1;
902 char *line, *tail;
903 if (!buffer || type != OBJ_COMMIT)
905 goto cleanup;
906 line = buffer;
908 tail = buffer + size;
909 in_signature = 0;
910 saw_signature = 0;
911 while (line < tail) {
912 const char *sig = NULL;
913 char *next = memchr(line, '\n', tail - line);
914 next = next ? next + 1 : tail;
916 if (in_signature && line[0] == ' ')
917 sig = line + 1;
918 else if (!prefixcmp(line, gpg_sig_header) &&
919 line[gpg_sig_header_len] == ' ')
920 sig = line + gpg_sig_header_len + 1;
921 if (sig) {
922 strbuf_add(signature, sig, next - sig);
923 saw_signature = 1;
924 in_signature = 1;
925 } else {
926 if (*line == '\n')
927 /* dump the whole remainder of the buffer */
928 next = tail;
929 strbuf_add(payload, line, next - line);
930 in_signature = 0;
931 }
932 line = next;
933 }
934 cleanup:
935 free(buffer);
936 return saw_signature;
937}
938static void handle_signed_tag(struct commit *parent, struct commit_extra_header ***tail)
940{
941 struct merge_remote_desc *desc;
942 struct commit_extra_header *mergetag;
943 char *buf;
944 unsigned long size, len;
945 enum object_type type;
946 desc = merge_remote_util(parent);
948 if (!desc || !desc->obj)
949 return;
950 buf = read_sha1_file(desc->obj->sha1, &type, &size);
951 if (!buf || type != OBJ_TAG)
952 goto free_return;
953 len = parse_signature(buf, size);
954 if (size == len)
955 goto free_return;
956 /*
957 * We could verify this signature and either omit the tag when
958 * it does not validate, but the integrator may not have the
959 * public key of the signer of the tag he is merging, while a
960 * later auditor may have it while auditing, so let's not run
961 * verify-signed-buffer here for now...
962 *
963 * if (verify_signed_buffer(buf, len, buf + len, size - len, ...))
964 * warn("warning: signed tag unverified.");
965 */
966 mergetag = xcalloc(1, sizeof(*mergetag));
967 mergetag->key = xstrdup("mergetag");
968 mergetag->value = buf;
969 mergetag->len = size;
970 **tail = mergetag;
972 *tail = &mergetag->next;
973 return;
974free_return:
976 free(buf);
977}
978void append_merge_tag_headers(struct commit_list *parents,
980 struct commit_extra_header ***tail)
981{
982 while (parents) {
983 struct commit *parent = parents->item;
984 handle_signed_tag(parent, tail);
985 parents = parents->next;
986 }
987}
988static void add_extra_header(struct strbuf *buffer,
990 struct commit_extra_header *extra)
991{
992 strbuf_addstr(buffer, extra->key);
993 if (extra->len)
994 strbuf_add_lines(buffer, " ", extra->value, extra->len);
995 else
996 strbuf_addch(buffer, '\n');
997}
998struct commit_extra_header *read_commit_extra_headers(struct commit *commit,
1000 const char **exclude)
1001{
1002 struct commit_extra_header *extra = NULL;
1003 unsigned long size;
1004 enum object_type type;
1005 char *buffer = read_sha1_file(commit->object.sha1, &type, &size);
1006 if (buffer && type == OBJ_COMMIT)
1007 extra = read_commit_extra_header_lines(buffer, size, exclude);
1008 free(buffer);
1009 return extra;
1010}
1011static inline int standard_header_field(const char *field, size_t len)
1013{
1014 return ((len == 4 && !memcmp(field, "tree ", 5)) ||
1015 (len == 6 && !memcmp(field, "parent ", 7)) ||
1016 (len == 6 && !memcmp(field, "author ", 7)) ||
1017 (len == 9 && !memcmp(field, "committer ", 10)) ||
1018 (len == 8 && !memcmp(field, "encoding ", 9)));
1019}
1020static int excluded_header_field(const char *field, size_t len, const char **exclude)
1022{
1023 if (!exclude)
1024 return 0;
1025 while (*exclude) {
1027 size_t xlen = strlen(*exclude);
1028 if (len == xlen &&
1029 !memcmp(field, *exclude, xlen) && field[xlen] == ' ')
1030 return 1;
1031 exclude++;
1032 }
1033 return 0;
1034}
1035struct commit_extra_header *read_commit_extra_header_lines(const char *buffer, size_t size,
1037 const char **exclude)
1038{
1039 struct commit_extra_header *extra = NULL, **tail = &extra, *it = NULL;
1040 const char *line, *next, *eof, *eob;
1041 struct strbuf buf = STRBUF_INIT;
1042 for (line = buffer, eob = line + size;
1044 line < eob && *line != '\n';
1045 line = next) {
1046 next = memchr(line, '\n', eob - line);
1047 next = next ? next + 1 : eob;
1048 if (*line == ' ') {
1049 /* continuation */
1050 if (it)
1051 strbuf_add(&buf, line + 1, next - (line + 1));
1052 continue;
1053 }
1054 if (it)
1055 it->value = strbuf_detach(&buf, &it->len);
1056 strbuf_reset(&buf);
1057 it = NULL;
1058 eof = strchr(line, ' ');
1060 if (next <= eof)
1061 eof = next;
1062 if (standard_header_field(line, eof - line) ||
1064 excluded_header_field(line, eof - line, exclude))
1065 continue;
1066 it = xcalloc(1, sizeof(*it));
1068 it->key = xmemdupz(line, eof-line);
1069 *tail = it;
1070 tail = &it->next;
1071 if (eof + 1 < next)
1072 strbuf_add(&buf, eof + 1, next - (eof + 1));
1073 }
1074 if (it)
1075 it->value = strbuf_detach(&buf, &it->len);
1076 return extra;
1077}
1078void free_commit_extra_headers(struct commit_extra_header *extra)
1080{
1081 while (extra) {
1082 struct commit_extra_header *next = extra->next;
1083 free(extra->key);
1084 free(extra->value);
1085 free(extra);
1086 extra = next;
1087 }
1088}
1089int commit_tree(const struct strbuf *msg, unsigned char *tree,
1091 struct commit_list *parents, unsigned char *ret,
1092 const char *author, const char *sign_commit)
1093{
1094 struct commit_extra_header *extra = NULL, **tail = &extra;
1095 int result;
1096 append_merge_tag_headers(parents, &tail);
1098 result = commit_tree_extended(msg, tree, parents, ret,
1099 author, sign_commit, extra);
1100 free_commit_extra_headers(extra);
1101 return result;
1102}
1103static const char commit_utf8_warn[] =
1105"Warning: commit message does not conform to UTF-8.\n"
1106"You may want to amend it after fixing the message, or set the config\n"
1107"variable i18n.commitencoding to the encoding your project uses.\n";
1108int commit_tree_extended(const struct strbuf *msg, unsigned char *tree,
1110 struct commit_list *parents, unsigned char *ret,
1111 const char *author, const char *sign_commit,
1112 struct commit_extra_header *extra)
1113{
1114 int result;
1115 int encoding_is_utf8;
1116 struct strbuf buffer;
1117 assert_sha1_type(tree, OBJ_TREE);
1119 if (memchr(msg->buf, '\0', msg->len))
1121 return error("a NUL byte in commit log message not allowed.");
1122 /* Not having i18n.commitencoding is the same as having utf-8 */
1124 encoding_is_utf8 = is_encoding_utf8(git_commit_encoding);
1125 strbuf_init(&buffer, 8192); /* should avoid reallocs for the headers */
1127 strbuf_addf(&buffer, "tree %s\n", sha1_to_hex(tree));
1128 /*
1130 * NOTE! This ordering means that the same exact tree merged with a
1131 * different order of parents will be a _different_ changeset even
1132 * if everything else stays the same.
1133 */
1134 while (parents) {
1135 struct commit_list *next = parents->next;
1136 struct commit *parent = parents->item;
1137 strbuf_addf(&buffer, "parent %s\n",
1139 sha1_to_hex(parent->object.sha1));
1140 free(parents);
1141 parents = next;
1142 }
1143 /* Person/date information */
1145 if (!author)
1146 author = git_author_info(IDENT_ERROR_ON_NO_NAME);
1147 strbuf_addf(&buffer, "author %s\n", author);
1148 strbuf_addf(&buffer, "committer %s\n", git_committer_info(IDENT_ERROR_ON_NO_NAME));
1149 if (!encoding_is_utf8)
1150 strbuf_addf(&buffer, "encoding %s\n", git_commit_encoding);
1151 while (extra) {
1153 add_extra_header(&buffer, extra);
1154 extra = extra->next;
1155 }
1156 strbuf_addch(&buffer, '\n');
1157 /* And add the comment */
1159 strbuf_addbuf(&buffer, msg);
1160 /* And check the encoding */
1162 if (encoding_is_utf8 && !is_utf8(buffer.buf))
1163 fprintf(stderr, commit_utf8_warn);
1164 if (sign_commit && do_sign_commit(&buffer, sign_commit))
1166 return -1;
1167 result = write_sha1_file(buffer.buf, buffer.len, commit_type, ret);
1169 strbuf_release(&buffer);
1170 return result;
1171}
1172struct commit *get_merge_parent(const char *name)
1174{
1175 struct object *obj;
1176 struct commit *commit;
1177 unsigned char sha1[20];
1178 if (get_sha1(name, sha1))
1179 return NULL;
1180 obj = parse_object(sha1);
1181 commit = (struct commit *)peel_to_type(name, 0, obj, OBJ_COMMIT);
1182 if (commit && !commit->util) {
1183 struct merge_remote_desc *desc;
1184 desc = xmalloc(sizeof(*desc));
1185 desc->obj = obj;
1186 desc->name = strdup(name);
1187 commit->util = desc;
1188 }
1189 return commit;
1190}