7 int save_commit_buffer
= 1;
12 * the number of children of the associated commit
13 * that also occur in the list being sorted.
15 unsigned int indegree
;
18 * reference to original list item that we will re-use
21 struct commit_list
* list_item
;
25 const char *commit_type
= "commit";
32 { "raw", 1, CMIT_FMT_RAW
},
33 { "medium", 1, CMIT_FMT_MEDIUM
},
34 { "short", 1, CMIT_FMT_SHORT
},
35 { "email", 1, CMIT_FMT_EMAIL
},
36 { "full", 5, CMIT_FMT_FULL
},
37 { "fuller", 5, CMIT_FMT_FULLER
},
38 { "oneline", 1, CMIT_FMT_ONELINE
},
41 enum cmit_fmt
get_commit_format(const char *arg
)
46 return CMIT_FMT_DEFAULT
;
49 for (i
= 0; i
< ARRAY_SIZE(cmt_fmts
); i
++) {
50 if (!strncmp(arg
, cmt_fmts
[i
].n
, cmt_fmts
[i
].cmp_len
))
54 die("invalid --pretty format: %s", arg
);
57 static struct commit
*check_commit(struct object
*obj
,
58 const unsigned char *sha1
,
61 if (obj
->type
!= OBJ_COMMIT
) {
63 error("Object %s is a %s, not a commit",
64 sha1_to_hex(sha1
), typename(obj
->type
));
67 return (struct commit
*) obj
;
70 struct commit
*lookup_commit_reference_gently(const unsigned char *sha1
,
73 struct object
*obj
= deref_tag(parse_object(sha1
), NULL
, 0);
77 return check_commit(obj
, sha1
, quiet
);
80 struct commit
*lookup_commit_reference(const unsigned char *sha1
)
82 return lookup_commit_reference_gently(sha1
, 0);
85 struct commit
*lookup_commit(const unsigned char *sha1
)
87 struct object
*obj
= lookup_object(sha1
);
89 struct commit
*ret
= alloc_commit_node();
90 created_object(sha1
, &ret
->object
);
91 ret
->object
.type
= OBJ_COMMIT
;
95 obj
->type
= OBJ_COMMIT
;
96 return check_commit(obj
, sha1
, 0);
99 static unsigned long parse_commit_date(const char *buf
)
103 if (memcmp(buf
, "author", 6))
105 while (*buf
++ != '\n')
107 if (memcmp(buf
, "committer", 9))
109 while (*buf
++ != '>')
111 date
= strtoul(buf
, NULL
, 10);
112 if (date
== ULONG_MAX
)
117 static struct commit_graft
**commit_graft
;
118 static int commit_graft_alloc
, commit_graft_nr
;
120 static int commit_graft_pos(const unsigned char *sha1
)
124 hi
= commit_graft_nr
;
126 int mi
= (lo
+ hi
) / 2;
127 struct commit_graft
*graft
= commit_graft
[mi
];
128 int cmp
= hashcmp(sha1
, graft
->sha1
);
139 int register_commit_graft(struct commit_graft
*graft
, int ignore_dups
)
141 int pos
= commit_graft_pos(graft
->sha1
);
147 free(commit_graft
[pos
]);
148 commit_graft
[pos
] = graft
;
153 if (commit_graft_alloc
<= ++commit_graft_nr
) {
154 commit_graft_alloc
= alloc_nr(commit_graft_alloc
);
155 commit_graft
= xrealloc(commit_graft
,
156 sizeof(*commit_graft
) *
159 if (pos
< commit_graft_nr
)
160 memmove(commit_graft
+ pos
+ 1,
162 (commit_graft_nr
- pos
- 1) *
163 sizeof(*commit_graft
));
164 commit_graft
[pos
] = graft
;
168 struct commit_graft
*read_graft_line(char *buf
, int len
)
170 /* The format is just "Commit Parent1 Parent2 ...\n" */
172 struct commit_graft
*graft
= NULL
;
174 if (buf
[len
-1] == '\n')
176 if (buf
[0] == '#' || buf
[0] == '\0')
178 if ((len
+ 1) % 41) {
180 error("bad graft data: %s", buf
);
184 i
= (len
+ 1) / 41 - 1;
185 graft
= xmalloc(sizeof(*graft
) + 20 * i
);
186 graft
->nr_parent
= i
;
187 if (get_sha1_hex(buf
, graft
->sha1
))
189 for (i
= 40; i
< len
; i
+= 41) {
192 if (get_sha1_hex(buf
+ i
+ 1, graft
->parent
[i
/41]))
198 int read_graft_file(const char *graft_file
)
200 FILE *fp
= fopen(graft_file
, "r");
204 while (fgets(buf
, sizeof(buf
), fp
)) {
205 /* The format is just "Commit Parent1 Parent2 ...\n" */
206 int len
= strlen(buf
);
207 struct commit_graft
*graft
= read_graft_line(buf
, len
);
210 if (register_commit_graft(graft
, 1))
211 error("duplicate graft data: %s", buf
);
217 static void prepare_commit_graft(void)
219 static int commit_graft_prepared
;
222 if (commit_graft_prepared
)
224 graft_file
= get_graft_file();
225 read_graft_file(graft_file
);
226 /* make sure shallows are read */
227 is_repository_shallow();
228 commit_graft_prepared
= 1;
231 static struct commit_graft
*lookup_commit_graft(const unsigned char *sha1
)
234 prepare_commit_graft();
235 pos
= commit_graft_pos(sha1
);
238 return commit_graft
[pos
];
241 int write_shallow_commits(int fd
, int use_pack_protocol
)
244 for (i
= 0; i
< commit_graft_nr
; i
++)
245 if (commit_graft
[i
]->nr_parent
< 0) {
247 sha1_to_hex(commit_graft
[i
]->sha1
);
249 if (use_pack_protocol
)
250 packet_write(fd
, "shallow %s", hex
);
259 int unregister_shallow(const unsigned char *sha1
)
261 int pos
= commit_graft_pos(sha1
);
264 if (pos
+ 1 < commit_graft_nr
)
265 memcpy(commit_graft
+ pos
, commit_graft
+ pos
+ 1,
266 sizeof(struct commit_graft
*)
267 * (commit_graft_nr
- pos
- 1));
272 int parse_commit_buffer(struct commit
*item
, void *buffer
, unsigned long size
)
275 char *bufptr
= buffer
;
276 unsigned char parent
[20];
277 struct commit_list
**pptr
;
278 struct commit_graft
*graft
;
281 if (item
->object
.parsed
)
283 item
->object
.parsed
= 1;
285 if (tail
<= bufptr
+ 5 || memcmp(bufptr
, "tree ", 5))
286 return error("bogus commit object %s", sha1_to_hex(item
->object
.sha1
));
287 if (tail
<= bufptr
+ 45 || get_sha1_hex(bufptr
+ 5, parent
) < 0)
288 return error("bad tree pointer in commit %s",
289 sha1_to_hex(item
->object
.sha1
));
290 item
->tree
= lookup_tree(parent
);
293 bufptr
+= 46; /* "tree " + "hex sha1" + "\n" */
294 pptr
= &item
->parents
;
296 graft
= lookup_commit_graft(item
->object
.sha1
);
297 while (bufptr
+ 48 < tail
&& !memcmp(bufptr
, "parent ", 7)) {
298 struct commit
*new_parent
;
300 if (tail
<= bufptr
+ 48 ||
301 get_sha1_hex(bufptr
+ 7, parent
) ||
303 return error("bad parents in commit %s", sha1_to_hex(item
->object
.sha1
));
307 new_parent
= lookup_commit(parent
);
309 pptr
= &commit_list_insert(new_parent
, pptr
)->next
;
315 struct commit
*new_parent
;
316 for (i
= 0; i
< graft
->nr_parent
; i
++) {
317 new_parent
= lookup_commit(graft
->parent
[i
]);
320 pptr
= &commit_list_insert(new_parent
, pptr
)->next
;
324 item
->date
= parse_commit_date(bufptr
);
326 if (track_object_refs
) {
328 struct commit_list
*p
;
329 struct object_refs
*refs
= alloc_object_refs(n_refs
);
331 refs
->ref
[i
++] = &item
->tree
->object
;
332 for (p
= item
->parents
; p
; p
= p
->next
)
333 refs
->ref
[i
++] = &p
->item
->object
;
334 set_object_refs(&item
->object
, refs
);
340 int parse_commit(struct commit
*item
)
347 if (item
->object
.parsed
)
349 buffer
= read_sha1_file(item
->object
.sha1
, type
, &size
);
351 return error("Could not read %s",
352 sha1_to_hex(item
->object
.sha1
));
353 if (strcmp(type
, commit_type
)) {
355 return error("Object %s not a commit",
356 sha1_to_hex(item
->object
.sha1
));
358 ret
= parse_commit_buffer(item
, buffer
, size
);
359 if (save_commit_buffer
&& !ret
) {
360 item
->buffer
= buffer
;
367 struct commit_list
*commit_list_insert(struct commit
*item
, struct commit_list
**list_p
)
369 struct commit_list
*new_list
= xmalloc(sizeof(struct commit_list
));
370 new_list
->item
= item
;
371 new_list
->next
= *list_p
;
376 void free_commit_list(struct commit_list
*list
)
379 struct commit_list
*temp
= list
;
385 struct commit_list
* insert_by_date(struct commit
*item
, struct commit_list
**list
)
387 struct commit_list
**pp
= list
;
388 struct commit_list
*p
;
389 while ((p
= *pp
) != NULL
) {
390 if (p
->item
->date
< item
->date
) {
395 return commit_list_insert(item
, pp
);
399 void sort_by_date(struct commit_list
**list
)
401 struct commit_list
*ret
= NULL
;
403 insert_by_date((*list
)->item
, &ret
);
404 *list
= (*list
)->next
;
409 struct commit
*pop_most_recent_commit(struct commit_list
**list
,
412 struct commit
*ret
= (*list
)->item
;
413 struct commit_list
*parents
= ret
->parents
;
414 struct commit_list
*old
= *list
;
416 *list
= (*list
)->next
;
420 struct commit
*commit
= parents
->item
;
421 parse_commit(commit
);
422 if (!(commit
->object
.flags
& mark
)) {
423 commit
->object
.flags
|= mark
;
424 insert_by_date(commit
, list
);
426 parents
= parents
->next
;
431 void clear_commit_marks(struct commit
*commit
, unsigned int mark
)
433 struct commit_list
*parents
;
435 commit
->object
.flags
&= ~mark
;
436 parents
= commit
->parents
;
438 struct commit
*parent
= parents
->item
;
440 /* Have we already cleared this? */
441 if (mark
& parent
->object
.flags
)
442 clear_commit_marks(parent
, mark
);
443 parents
= parents
->next
;
448 * Generic support for pretty-printing the header
450 static int get_one_line(const char *msg
, unsigned long len
)
465 static int is_rfc2047_special(char ch
)
467 return ((ch
& 0x80) || (ch
== '=') || (ch
== '?') || (ch
== '_'));
470 static int add_rfc2047(char *buf
, const char *line
, int len
)
474 static const char q_utf8
[] = "=?utf-8?q?";
476 for (i
= needquote
= 0; !needquote
&& i
< len
; i
++) {
477 unsigned ch
= line
[i
];
481 (ch
== '=' && line
[i
+1] == '?'))
485 return sprintf(buf
, "%.*s", len
, line
);
487 memcpy(bp
, q_utf8
, sizeof(q_utf8
)-1);
488 bp
+= sizeof(q_utf8
)-1;
489 for (i
= 0; i
< len
; i
++) {
490 unsigned ch
= line
[i
] & 0xFF;
491 if (is_rfc2047_special(ch
)) {
492 sprintf(bp
, "=%02X", ch
);
505 static int add_user_info(const char *what
, enum cmit_fmt fmt
, char *buf
,
506 const char *line
, int relative_date
)
512 const char *filler
= " ";
514 if (fmt
== CMIT_FMT_ONELINE
)
516 date
= strchr(line
, '>');
519 namelen
= ++date
- line
;
520 time
= strtoul(date
, &date
, 10);
521 tz
= strtol(date
, NULL
, 10);
523 if (fmt
== CMIT_FMT_EMAIL
) {
524 char *name_tail
= strchr(line
, '<');
525 int display_name_length
;
528 while (line
< name_tail
&& isspace(name_tail
[-1]))
530 display_name_length
= name_tail
- line
;
532 strcpy(buf
, "From: ");
534 ret
+= add_rfc2047(buf
+ ret
, line
, display_name_length
);
535 memcpy(buf
+ ret
, name_tail
, namelen
- display_name_length
);
536 ret
+= namelen
- display_name_length
;
540 ret
= sprintf(buf
, "%s: %.*s%.*s\n", what
,
541 (fmt
== CMIT_FMT_FULLER
) ? 4 : 0,
542 filler
, namelen
, line
);
545 case CMIT_FMT_MEDIUM
:
546 ret
+= sprintf(buf
+ ret
, "Date: %s\n",
547 show_date(time
, tz
, relative_date
));
550 ret
+= sprintf(buf
+ ret
, "Date: %s\n",
551 show_rfc2822_date(time
, tz
));
553 case CMIT_FMT_FULLER
:
554 ret
+= sprintf(buf
+ ret
, "%sDate: %s\n", what
,
555 show_date(time
, tz
, relative_date
));
564 static int is_empty_line(const char *line
, int *len_p
)
567 while (len
&& isspace(line
[len
-1]))
573 static int add_merge_info(enum cmit_fmt fmt
, char *buf
, const struct commit
*commit
, int abbrev
)
575 struct commit_list
*parent
= commit
->parents
;
578 if ((fmt
== CMIT_FMT_ONELINE
) || (fmt
== CMIT_FMT_EMAIL
) ||
579 !parent
|| !parent
->next
)
582 offset
= sprintf(buf
, "Merge:");
585 struct commit
*p
= parent
->item
;
586 const char *hex
= NULL
;
589 hex
= find_unique_abbrev(p
->object
.sha1
, abbrev
);
591 hex
= sha1_to_hex(p
->object
.sha1
);
592 dots
= (abbrev
&& strlen(hex
) != 40) ? "..." : "";
593 parent
= parent
->next
;
595 offset
+= sprintf(buf
+ offset
, " %s%s", hex
, dots
);
597 buf
[offset
++] = '\n';
601 static char *get_header(const struct commit
*commit
, const char *key
)
603 int key_len
= strlen(key
);
604 const char *line
= commit
->buffer
;
607 const char *eol
= strchr(line
, '\n'), *next
;
612 eol
= line
+ strlen(line
);
616 if (!strncmp(line
, key
, key_len
) && line
[key_len
] == ' ') {
617 int len
= eol
- line
- key_len
;
618 char *ret
= xmalloc(len
);
619 memcpy(ret
, line
+ key_len
+ 1, len
- 1);
627 static char *replace_encoding_header(char *buf
, char *encoding
)
629 char *encoding_header
= strstr(buf
, "\nencoding ");
630 char *end_of_encoding_header
;
631 int encoding_header_pos
;
632 int encoding_header_len
;
635 int buflen
= strlen(buf
) + 1;
637 if (!encoding_header
)
638 return buf
; /* should not happen but be defensive */
640 end_of_encoding_header
= strchr(encoding_header
, '\n');
641 if (!end_of_encoding_header
)
642 return buf
; /* should not happen but be defensive */
643 end_of_encoding_header
++;
645 encoding_header_len
= end_of_encoding_header
- encoding_header
;
646 encoding_header_pos
= encoding_header
- buf
;
648 if (is_encoding_utf8(encoding
)) {
649 /* we have re-coded to UTF-8; drop the header */
650 memmove(encoding_header
, end_of_encoding_header
,
651 buflen
- (encoding_header_pos
+ encoding_header_len
));
654 new_len
= strlen(encoding
);
655 need_len
= new_len
+ strlen("encoding \n");
656 if (encoding_header_len
< need_len
) {
657 buf
= xrealloc(buf
, buflen
+ (need_len
- encoding_header_len
));
658 encoding_header
= buf
+ encoding_header_pos
;
659 end_of_encoding_header
= encoding_header
+ encoding_header_len
;
661 memmove(end_of_encoding_header
+ (need_len
- encoding_header_len
),
662 end_of_encoding_header
,
663 buflen
- (encoding_header_pos
+ encoding_header_len
));
664 memcpy(encoding_header
+ 9, encoding
, strlen(encoding
));
665 encoding_header
[9 + new_len
] = '\n';
669 static char *logmsg_reencode(const struct commit
*commit
)
673 char *output_encoding
= (git_log_output_encoding
674 ? git_log_output_encoding
675 : git_commit_encoding
);
677 if (!output_encoding
)
678 output_encoding
= "utf-8";
679 else if (!*output_encoding
)
681 encoding
= get_header(commit
, "encoding");
684 if (!strcmp(encoding
, output_encoding
))
685 out
= strdup(commit
->buffer
);
687 out
= reencode_string(commit
->buffer
,
688 output_encoding
, encoding
);
690 out
= replace_encoding_header(out
, output_encoding
);
698 unsigned long pretty_print_commit(enum cmit_fmt fmt
,
699 const struct commit
*commit
,
701 char *buf
, unsigned long space
,
702 int abbrev
, const char *subject
,
703 const char *after_subject
,
706 int hdr
= 1, body
= 0, seen_title
= 0;
707 unsigned long offset
= 0;
709 int parents_shown
= 0;
710 const char *msg
= commit
->buffer
;
711 int plain_non_ascii
= 0;
712 char *reencoded
= logmsg_reencode(commit
);
717 if (fmt
== CMIT_FMT_ONELINE
|| fmt
== CMIT_FMT_EMAIL
)
720 /* After-subject is used to pass in Content-Type: multipart
721 * MIME header; in that case we do not have to do the
722 * plaintext content type even if the commit message has
723 * non 7-bit ASCII character. Otherwise, check if we need
724 * to say this is not a 7-bit ASCII.
726 if (fmt
== CMIT_FMT_EMAIL
&& !after_subject
) {
729 for (in_body
= i
= 0; (ch
= msg
[i
]) && i
< len
; i
++) {
731 /* author could be non 7-bit ASCII but
732 * the log may be so; skip over the
736 i
+ 1 < len
&& msg
[i
+1] == '\n')
739 else if (ch
& 0x80) {
747 const char *line
= msg
;
748 int linelen
= get_one_line(msg
, len
);
754 * We want some slop for indentation and a possible
755 * final "...". Thus the "+ 20".
757 if (offset
+ linelen
+ 20 > space
) {
758 memcpy(buf
+ offset
, " ...\n", 8);
768 if ((fmt
!= CMIT_FMT_ONELINE
) && !subject
)
769 buf
[offset
++] = '\n';
772 if (fmt
== CMIT_FMT_RAW
) {
773 memcpy(buf
+ offset
, line
, linelen
);
777 if (!memcmp(line
, "parent ", 7)) {
779 die("bad parent line in commit");
783 if (!parents_shown
) {
784 offset
+= add_merge_info(fmt
, buf
+ offset
,
790 * MEDIUM == DEFAULT shows only author with dates.
791 * FULL shows both authors but not dates.
792 * FULLER shows both authors and dates.
794 if (!memcmp(line
, "author ", 7))
795 offset
+= add_user_info("Author", fmt
,
799 if (!memcmp(line
, "committer ", 10) &&
800 (fmt
== CMIT_FMT_FULL
|| fmt
== CMIT_FMT_FULLER
))
801 offset
+= add_user_info("Commit", fmt
,
811 if (is_empty_line(line
, &linelen
)) {
818 if (fmt
== CMIT_FMT_SHORT
)
824 int slen
= strlen(subject
);
825 memcpy(buf
+ offset
, subject
, slen
);
827 offset
+= add_rfc2047(buf
+ offset
, line
, linelen
);
830 memset(buf
+ offset
, ' ', indent
);
831 memcpy(buf
+ offset
+ indent
, line
, linelen
);
832 offset
+= linelen
+ indent
;
834 buf
[offset
++] = '\n';
835 if (fmt
== CMIT_FMT_ONELINE
)
837 if (subject
&& plain_non_ascii
) {
838 static const char header
[] =
839 "Content-Type: text/plain; charset=UTF-8\n"
840 "Content-Transfer-Encoding: 8bit\n";
841 memcpy(buf
+ offset
, header
, sizeof(header
)-1);
842 offset
+= sizeof(header
)-1;
845 int slen
= strlen(after_subject
);
846 if (slen
> space
- offset
- 1)
847 slen
= space
- offset
- 1;
848 memcpy(buf
+ offset
, after_subject
, slen
);
850 after_subject
= NULL
;
854 while (offset
&& isspace(buf
[offset
-1]))
856 /* Make sure there is an EOLN for the non-oneline case */
857 if (fmt
!= CMIT_FMT_ONELINE
)
858 buf
[offset
++] = '\n';
860 * make sure there is another EOLN to separate the headers from whatever
861 * body the caller appends if we haven't already written a body
863 if (fmt
== CMIT_FMT_EMAIL
&& !body
)
864 buf
[offset
++] = '\n';
871 struct commit
*pop_commit(struct commit_list
**stack
)
873 struct commit_list
*top
= *stack
;
874 struct commit
*item
= top
? top
->item
: NULL
;
883 int count_parents(struct commit
* commit
)
886 struct commit_list
* parents
= commit
->parents
;
887 for (count
= 0; parents
; parents
= parents
->next
,count
++)
892 void topo_sort_default_setter(struct commit
*c
, void *data
)
897 void *topo_sort_default_getter(struct commit
*c
)
903 * Performs an in-place topological sort on the list supplied.
905 void sort_in_topological_order(struct commit_list
** list
, int lifo
)
907 sort_in_topological_order_fn(list
, lifo
, topo_sort_default_setter
,
908 topo_sort_default_getter
);
911 void sort_in_topological_order_fn(struct commit_list
** list
, int lifo
,
912 topo_sort_set_fn_t setter
,
913 topo_sort_get_fn_t getter
)
915 struct commit_list
* next
= *list
;
916 struct commit_list
* work
= NULL
, **insert
;
917 struct commit_list
** pptr
= list
;
918 struct sort_node
* nodes
;
919 struct sort_node
* next_nodes
;
922 /* determine the size of the list */
930 /* allocate an array to help sort the list */
931 nodes
= xcalloc(count
, sizeof(*nodes
));
932 /* link the list to the array */
936 next_nodes
->list_item
= next
;
937 setter(next
->item
, next_nodes
);
941 /* update the indegree */
944 struct commit_list
* parents
= next
->item
->parents
;
946 struct commit
* parent
=parents
->item
;
947 struct sort_node
* pn
= (struct sort_node
*) getter(parent
);
951 parents
=parents
->next
;
958 * tips are nodes not reachable from any other node in the list
960 * the tips serve as a starting set for the work queue.
965 struct sort_node
* node
= (struct sort_node
*) getter(next
->item
);
967 if (node
->indegree
== 0) {
968 insert
= &commit_list_insert(next
->item
, insert
)->next
;
973 /* process the list in topological order */
977 struct commit
* work_item
= pop_commit(&work
);
978 struct sort_node
* work_node
= (struct sort_node
*) getter(work_item
);
979 struct commit_list
* parents
= work_item
->parents
;
982 struct commit
* parent
=parents
->item
;
983 struct sort_node
* pn
= (struct sort_node
*) getter(parent
);
987 * parents are only enqueued for emission
988 * when all their children have been emitted thereby
989 * guaranteeing topological order.
994 insert_by_date(parent
, &work
);
996 commit_list_insert(parent
, &work
);
999 parents
=parents
->next
;
1002 * work_item is a commit all of whose children
1003 * have already been emitted. we can emit it now.
1005 *pptr
= work_node
->list_item
;
1006 pptr
= &(*pptr
)->next
;
1008 setter(work_item
, NULL
);
1013 /* merge-rebase stuff */
1015 /* bits #0..15 in revision.h */
1016 #define PARENT1 (1u<<16)
1017 #define PARENT2 (1u<<17)
1018 #define STALE (1u<<18)
1019 #define RESULT (1u<<19)
1021 static struct commit
*interesting(struct commit_list
*list
)
1024 struct commit
*commit
= list
->item
;
1026 if (commit
->object
.flags
& STALE
)
1033 static struct commit_list
*merge_bases(struct commit
*one
, struct commit
*two
)
1035 struct commit_list
*list
= NULL
;
1036 struct commit_list
*result
= NULL
;
1039 /* We do not mark this even with RESULT so we do not
1040 * have to clean it up.
1042 return commit_list_insert(one
, &result
);
1047 one
->object
.flags
|= PARENT1
;
1048 two
->object
.flags
|= PARENT2
;
1049 insert_by_date(one
, &list
);
1050 insert_by_date(two
, &list
);
1052 while (interesting(list
)) {
1053 struct commit
*commit
;
1054 struct commit_list
*parents
;
1055 struct commit_list
*n
;
1058 commit
= list
->item
;
1063 flags
= commit
->object
.flags
& (PARENT1
| PARENT2
| STALE
);
1064 if (flags
== (PARENT1
| PARENT2
)) {
1065 if (!(commit
->object
.flags
& RESULT
)) {
1066 commit
->object
.flags
|= RESULT
;
1067 insert_by_date(commit
, &result
);
1069 /* Mark parents of a found merge stale */
1072 parents
= commit
->parents
;
1074 struct commit
*p
= parents
->item
;
1075 parents
= parents
->next
;
1076 if ((p
->object
.flags
& flags
) == flags
)
1079 p
->object
.flags
|= flags
;
1080 insert_by_date(p
, &list
);
1084 /* Clean up the result to remove stale ones */
1085 list
= result
; result
= NULL
;
1087 struct commit_list
*n
= list
->next
;
1088 if (!(list
->item
->object
.flags
& STALE
))
1089 insert_by_date(list
->item
, &result
);
1096 struct commit_list
*get_merge_bases(struct commit
*one
,
1100 const unsigned all_flags
= (PARENT1
| PARENT2
| STALE
| RESULT
);
1101 struct commit_list
*list
;
1102 struct commit
**rslt
;
1103 struct commit_list
*result
;
1106 result
= merge_bases(one
, two
);
1109 if (!result
|| !result
->next
) {
1111 clear_commit_marks(one
, all_flags
);
1112 clear_commit_marks(two
, all_flags
);
1117 /* There are more than one */
1124 rslt
= xcalloc(cnt
, sizeof(*rslt
));
1125 for (list
= result
, i
= 0; list
; list
= list
->next
)
1126 rslt
[i
++] = list
->item
;
1127 free_commit_list(result
);
1129 clear_commit_marks(one
, all_flags
);
1130 clear_commit_marks(two
, all_flags
);
1131 for (i
= 0; i
< cnt
- 1; i
++) {
1132 for (j
= i
+1; j
< cnt
; j
++) {
1133 if (!rslt
[i
] || !rslt
[j
])
1135 result
= merge_bases(rslt
[i
], rslt
[j
]);
1136 clear_commit_marks(rslt
[i
], all_flags
);
1137 clear_commit_marks(rslt
[j
], all_flags
);
1138 for (list
= result
; list
; list
= list
->next
) {
1139 if (rslt
[i
] == list
->item
)
1141 if (rslt
[j
] == list
->item
)
1147 /* Surviving ones in rslt[] are the independent results */
1149 for (i
= 0; i
< cnt
; i
++) {
1151 insert_by_date(rslt
[i
], &result
);
1157 int in_merge_bases(struct commit
*rev1
, struct commit
*rev2
)
1159 struct commit_list
*bases
, *b
;
1162 bases
= get_merge_bases(rev1
, rev2
, 1);
1163 for (b
= bases
; b
; b
= b
->next
) {
1164 if (!hashcmp(rev1
->object
.sha1
, b
->item
->object
.sha1
)) {
1170 free_commit_list(bases
);