4 #include "commit-graph.h"
5 #include "repository.h"
6 #include "object-store.h"
13 #include "gpg-interface.h"
14 #include "mergesort.h"
15 #include "commit-slab.h"
16 #include "prio-queue.h"
17 #include "sha1-lookup.h"
18 #include "wt-status.h"
21 static struct commit_extra_header
*read_commit_extra_header_lines(const char *buf
, size_t len
, const char **);
23 int save_commit_buffer
= 1;
25 const char *commit_type
= "commit";
27 struct commit
*lookup_commit_reference_gently(struct repository
*r
,
28 const struct object_id
*oid
, int quiet
)
30 struct object
*obj
= deref_tag(r
,
36 return object_as_type(r
, obj
, OBJ_COMMIT
, quiet
);
39 struct commit
*lookup_commit_reference(struct repository
*r
, const struct object_id
*oid
)
41 return lookup_commit_reference_gently(r
, oid
, 0);
44 struct commit
*lookup_commit_or_die(const struct object_id
*oid
, const char *ref_name
)
46 struct commit
*c
= lookup_commit_reference(the_repository
, oid
);
48 die(_("could not parse %s"), ref_name
);
49 if (oidcmp(oid
, &c
->object
.oid
)) {
50 warning(_("%s %s is not a commit!"),
51 ref_name
, oid_to_hex(oid
));
56 struct commit
*lookup_commit(struct repository
*r
, const struct object_id
*oid
)
58 struct object
*obj
= lookup_object(r
, oid
->hash
);
60 return create_object(r
, oid
->hash
,
61 alloc_commit_node(r
));
62 return object_as_type(r
, obj
, OBJ_COMMIT
, 0);
65 struct commit
*lookup_commit_reference_by_name(const char *name
)
68 struct commit
*commit
;
70 if (get_oid_committish(name
, &oid
))
72 commit
= lookup_commit_reference(the_repository
, &oid
);
73 if (parse_commit(commit
))
78 static timestamp_t
parse_commit_date(const char *buf
, const char *tail
)
84 if (memcmp(buf
, "author", 6))
86 while (buf
< tail
&& *buf
++ != '\n')
90 if (memcmp(buf
, "committer", 9))
92 while (buf
< tail
&& *buf
++ != '>')
97 while (buf
< tail
&& *buf
++ != '\n')
101 /* dateptr < buf && buf[-1] == '\n', so parsing will stop at buf-1 */
102 return parse_timestamp(dateptr
, NULL
, 10);
105 static const unsigned char *commit_graft_sha1_access(size_t index
, void *table
)
107 struct commit_graft
**commit_graft_table
= table
;
108 return commit_graft_table
[index
]->oid
.hash
;
111 static int commit_graft_pos(struct repository
*r
, const unsigned char *sha1
)
113 return sha1_pos(sha1
, r
->parsed_objects
->grafts
,
114 r
->parsed_objects
->grafts_nr
,
115 commit_graft_sha1_access
);
118 int register_commit_graft(struct repository
*r
, struct commit_graft
*graft
,
121 int pos
= commit_graft_pos(r
, graft
->oid
.hash
);
127 free(r
->parsed_objects
->grafts
[pos
]);
128 r
->parsed_objects
->grafts
[pos
] = graft
;
133 ALLOC_GROW(r
->parsed_objects
->grafts
,
134 r
->parsed_objects
->grafts_nr
+ 1,
135 r
->parsed_objects
->grafts_alloc
);
136 r
->parsed_objects
->grafts_nr
++;
137 if (pos
< r
->parsed_objects
->grafts_nr
)
138 memmove(r
->parsed_objects
->grafts
+ pos
+ 1,
139 r
->parsed_objects
->grafts
+ pos
,
140 (r
->parsed_objects
->grafts_nr
- pos
- 1) *
141 sizeof(*r
->parsed_objects
->grafts
));
142 r
->parsed_objects
->grafts
[pos
] = graft
;
146 struct commit_graft
*read_graft_line(struct strbuf
*line
)
148 /* The format is just "Commit Parent1 Parent2 ...\n" */
150 const char *tail
= NULL
;
151 struct commit_graft
*graft
= NULL
;
152 struct object_id dummy_oid
, *oid
;
155 if (!line
->len
|| line
->buf
[0] == '#')
158 * phase 0 verifies line, counts hashes in line and allocates graft
159 * phase 1 fills graft
161 for (phase
= 0; phase
< 2; phase
++) {
162 oid
= graft
? &graft
->oid
: &dummy_oid
;
163 if (parse_oid_hex(line
->buf
, oid
, &tail
))
165 for (i
= 0; *tail
!= '\0'; i
++) {
166 oid
= graft
? &graft
->parent
[i
] : &dummy_oid
;
167 if (!isspace(*tail
++) || parse_oid_hex(tail
, oid
, &tail
))
171 graft
= xmalloc(st_add(sizeof(*graft
),
172 st_mult(sizeof(struct object_id
), i
)));
173 graft
->nr_parent
= i
;
179 error("bad graft data: %s", line
->buf
);
184 static int read_graft_file(struct repository
*r
, const char *graft_file
)
186 FILE *fp
= fopen_or_warn(graft_file
, "r");
187 struct strbuf buf
= STRBUF_INIT
;
190 if (advice_graft_file_deprecated
)
191 advise(_("Support for <GIT_DIR>/info/grafts is deprecated\n"
192 "and will be removed in a future Git version.\n"
194 "Please use \"git replace --convert-graft-file\"\n"
195 "to convert the grafts into replace refs.\n"
197 "Turn this message off by running\n"
198 "\"git config advice.graftFileDeprecated false\""));
199 while (!strbuf_getwholeline(&buf
, fp
, '\n')) {
200 /* The format is just "Commit Parent1 Parent2 ...\n" */
201 struct commit_graft
*graft
= read_graft_line(&buf
);
204 if (register_commit_graft(r
, graft
, 1))
205 error("duplicate graft data: %s", buf
.buf
);
208 strbuf_release(&buf
);
212 static void prepare_commit_graft(struct repository
*r
)
216 if (r
->parsed_objects
->commit_graft_prepared
)
218 if (!startup_info
->have_repository
)
221 graft_file
= get_graft_file(r
);
222 read_graft_file(r
, graft_file
);
223 /* make sure shallows are read */
224 is_repository_shallow(r
);
225 r
->parsed_objects
->commit_graft_prepared
= 1;
228 struct commit_graft
*lookup_commit_graft(struct repository
*r
, const struct object_id
*oid
)
231 prepare_commit_graft(r
);
232 pos
= commit_graft_pos(r
, oid
->hash
);
235 return r
->parsed_objects
->grafts
[pos
];
238 int for_each_commit_graft(each_commit_graft_fn fn
, void *cb_data
)
241 for (i
= ret
= 0; i
< the_repository
->parsed_objects
->grafts_nr
&& !ret
; i
++)
242 ret
= fn(the_repository
->parsed_objects
->grafts
[i
], cb_data
);
246 int unregister_shallow(const struct object_id
*oid
)
248 int pos
= commit_graft_pos(the_repository
, oid
->hash
);
251 if (pos
+ 1 < the_repository
->parsed_objects
->grafts_nr
)
252 MOVE_ARRAY(the_repository
->parsed_objects
->grafts
+ pos
,
253 the_repository
->parsed_objects
->grafts
+ pos
+ 1,
254 the_repository
->parsed_objects
->grafts_nr
- pos
- 1);
255 the_repository
->parsed_objects
->grafts_nr
--;
259 struct commit_buffer
{
263 define_commit_slab(buffer_slab
, struct commit_buffer
);
265 struct buffer_slab
*allocate_commit_buffer_slab(void)
267 struct buffer_slab
*bs
= xmalloc(sizeof(*bs
));
268 init_buffer_slab(bs
);
272 void free_commit_buffer_slab(struct buffer_slab
*bs
)
274 clear_buffer_slab(bs
);
278 void set_commit_buffer(struct repository
*r
, struct commit
*commit
, void *buffer
, unsigned long size
)
280 struct commit_buffer
*v
= buffer_slab_at(
281 r
->parsed_objects
->buffer_slab
, commit
);
286 const void *get_cached_commit_buffer(struct repository
*r
, const struct commit
*commit
, unsigned long *sizep
)
288 struct commit_buffer
*v
= buffer_slab_peek(
289 r
->parsed_objects
->buffer_slab
, commit
);
300 const void *get_commit_buffer(const struct commit
*commit
, unsigned long *sizep
)
302 const void *ret
= get_cached_commit_buffer(the_repository
, commit
, sizep
);
304 enum object_type type
;
306 ret
= read_object_file(&commit
->object
.oid
, &type
, &size
);
308 die("cannot read commit object %s",
309 oid_to_hex(&commit
->object
.oid
));
310 if (type
!= OBJ_COMMIT
)
311 die("expected commit for %s, got %s",
312 oid_to_hex(&commit
->object
.oid
), type_name(type
));
319 void unuse_commit_buffer(const struct commit
*commit
, const void *buffer
)
321 struct commit_buffer
*v
= buffer_slab_peek(
322 the_repository
->parsed_objects
->buffer_slab
, commit
);
323 if (!(v
&& v
->buffer
== buffer
))
324 free((void *)buffer
);
327 void free_commit_buffer(struct commit
*commit
)
329 struct commit_buffer
*v
= buffer_slab_peek(
330 the_repository
->parsed_objects
->buffer_slab
, commit
);
332 FREE_AND_NULL(v
->buffer
);
337 struct tree
*get_commit_tree(const struct commit
*commit
)
339 if (commit
->maybe_tree
|| !commit
->object
.parsed
)
340 return commit
->maybe_tree
;
342 if (commit
->graph_pos
== COMMIT_NOT_FROM_GRAPH
)
343 BUG("commit has NULL tree, but was not loaded from commit-graph");
345 return get_commit_tree_in_graph(the_repository
, commit
);
348 struct object_id
*get_commit_tree_oid(const struct commit
*commit
)
350 return &get_commit_tree(commit
)->object
.oid
;
353 void release_commit_memory(struct commit
*c
)
355 c
->maybe_tree
= NULL
;
357 free_commit_buffer(c
);
358 free_commit_list(c
->parents
);
359 /* TODO: what about commit->util? */
361 c
->object
.parsed
= 0;
364 const void *detach_commit_buffer(struct commit
*commit
, unsigned long *sizep
)
366 struct commit_buffer
*v
= buffer_slab_peek(
367 the_repository
->parsed_objects
->buffer_slab
, commit
);
384 int parse_commit_buffer(struct repository
*r
, struct commit
*item
, const void *buffer
, unsigned long size
, int check_graph
)
386 const char *tail
= buffer
;
387 const char *bufptr
= buffer
;
388 struct object_id parent
;
389 struct commit_list
**pptr
;
390 struct commit_graft
*graft
;
391 const int tree_entry_len
= the_hash_algo
->hexsz
+ 5;
392 const int parent_entry_len
= the_hash_algo
->hexsz
+ 7;
394 if (item
->object
.parsed
)
396 item
->object
.parsed
= 1;
398 if (tail
<= bufptr
+ tree_entry_len
+ 1 || memcmp(bufptr
, "tree ", 5) ||
399 bufptr
[tree_entry_len
] != '\n')
400 return error("bogus commit object %s", oid_to_hex(&item
->object
.oid
));
401 if (get_oid_hex(bufptr
+ 5, &parent
) < 0)
402 return error("bad tree pointer in commit %s",
403 oid_to_hex(&item
->object
.oid
));
404 item
->maybe_tree
= lookup_tree(r
, &parent
);
405 bufptr
+= tree_entry_len
+ 1; /* "tree " + "hex sha1" + "\n" */
406 pptr
= &item
->parents
;
408 graft
= lookup_commit_graft(r
, &item
->object
.oid
);
409 while (bufptr
+ parent_entry_len
< tail
&& !memcmp(bufptr
, "parent ", 7)) {
410 struct commit
*new_parent
;
412 if (tail
<= bufptr
+ parent_entry_len
+ 1 ||
413 get_oid_hex(bufptr
+ 7, &parent
) ||
414 bufptr
[parent_entry_len
] != '\n')
415 return error("bad parents in commit %s", oid_to_hex(&item
->object
.oid
));
416 bufptr
+= parent_entry_len
+ 1;
418 * The clone is shallow if nr_parent < 0, and we must
419 * not traverse its real parents even when we unhide them.
421 if (graft
&& (graft
->nr_parent
< 0 || grafts_replace_parents
))
423 new_parent
= lookup_commit(r
, &parent
);
425 pptr
= &commit_list_insert(new_parent
, pptr
)->next
;
429 struct commit
*new_parent
;
430 for (i
= 0; i
< graft
->nr_parent
; i
++) {
431 new_parent
= lookup_commit(r
,
435 pptr
= &commit_list_insert(new_parent
, pptr
)->next
;
438 item
->date
= parse_commit_date(bufptr
, tail
);
441 load_commit_graph_info(the_repository
, item
);
446 int parse_commit_internal(struct commit
*item
, int quiet_on_missing
, int use_commit_graph
)
448 enum object_type type
;
455 if (item
->object
.parsed
)
457 if (use_commit_graph
&& parse_commit_in_graph(the_repository
, item
))
459 buffer
= read_object_file(&item
->object
.oid
, &type
, &size
);
461 return quiet_on_missing
? -1 :
462 error("Could not read %s",
463 oid_to_hex(&item
->object
.oid
));
464 if (type
!= OBJ_COMMIT
) {
466 return error("Object %s not a commit",
467 oid_to_hex(&item
->object
.oid
));
470 ret
= parse_commit_buffer(the_repository
, item
, buffer
, size
, 0);
471 if (save_commit_buffer
&& !ret
) {
472 set_commit_buffer(the_repository
, item
, buffer
, size
);
479 int parse_commit_gently(struct commit
*item
, int quiet_on_missing
)
481 return parse_commit_internal(item
, quiet_on_missing
, 1);
484 void parse_commit_or_die(struct commit
*item
)
486 if (parse_commit(item
))
487 die("unable to parse commit %s",
488 item
? oid_to_hex(&item
->object
.oid
) : "(null)");
491 int find_commit_subject(const char *commit_buffer
, const char **subject
)
494 const char *p
= commit_buffer
;
496 while (*p
&& (*p
!= '\n' || p
[1] != '\n'))
499 p
= skip_blank_lines(p
+ 2);
500 eol
= strchrnul(p
, '\n');
509 struct commit_list
*commit_list_insert(struct commit
*item
, struct commit_list
**list_p
)
511 struct commit_list
*new_list
= xmalloc(sizeof(struct commit_list
));
512 new_list
->item
= item
;
513 new_list
->next
= *list_p
;
518 unsigned commit_list_count(const struct commit_list
*l
)
521 for (; l
; l
= l
->next
)
526 struct commit_list
*copy_commit_list(struct commit_list
*list
)
528 struct commit_list
*head
= NULL
;
529 struct commit_list
**pp
= &head
;
531 pp
= commit_list_append(list
->item
, pp
);
537 void free_commit_list(struct commit_list
*list
)
543 struct commit_list
* commit_list_insert_by_date(struct commit
*item
, struct commit_list
**list
)
545 struct commit_list
**pp
= list
;
546 struct commit_list
*p
;
547 while ((p
= *pp
) != NULL
) {
548 if (p
->item
->date
< item
->date
) {
553 return commit_list_insert(item
, pp
);
556 static int commit_list_compare_by_date(const void *a
, const void *b
)
558 timestamp_t a_date
= ((const struct commit_list
*)a
)->item
->date
;
559 timestamp_t b_date
= ((const struct commit_list
*)b
)->item
->date
;
567 static void *commit_list_get_next(const void *a
)
569 return ((const struct commit_list
*)a
)->next
;
572 static void commit_list_set_next(void *a
, void *next
)
574 ((struct commit_list
*)a
)->next
= next
;
577 void commit_list_sort_by_date(struct commit_list
**list
)
579 *list
= llist_mergesort(*list
, commit_list_get_next
, commit_list_set_next
,
580 commit_list_compare_by_date
);
583 struct commit
*pop_most_recent_commit(struct commit_list
**list
,
586 struct commit
*ret
= pop_commit(list
);
587 struct commit_list
*parents
= ret
->parents
;
590 struct commit
*commit
= parents
->item
;
591 if (!parse_commit(commit
) && !(commit
->object
.flags
& mark
)) {
592 commit
->object
.flags
|= mark
;
593 commit_list_insert_by_date(commit
, list
);
595 parents
= parents
->next
;
600 static void clear_commit_marks_1(struct commit_list
**plist
,
601 struct commit
*commit
, unsigned int mark
)
604 struct commit_list
*parents
;
606 if (!(mark
& commit
->object
.flags
))
609 commit
->object
.flags
&= ~mark
;
611 parents
= commit
->parents
;
615 while ((parents
= parents
->next
))
616 commit_list_insert(parents
->item
, plist
);
618 commit
= commit
->parents
->item
;
622 void clear_commit_marks_many(int nr
, struct commit
**commit
, unsigned int mark
)
624 struct commit_list
*list
= NULL
;
627 clear_commit_marks_1(&list
, *commit
, mark
);
631 clear_commit_marks_1(&list
, pop_commit(&list
), mark
);
634 void clear_commit_marks(struct commit
*commit
, unsigned int mark
)
636 clear_commit_marks_many(1, &commit
, mark
);
639 struct commit
*pop_commit(struct commit_list
**stack
)
641 struct commit_list
*top
= *stack
;
642 struct commit
*item
= top
? top
->item
: NULL
;
652 * Topological sort support
655 /* count number of children that have not been emitted */
656 define_commit_slab(indegree_slab
, int);
658 /* record author-date for each commit object */
659 define_commit_slab(author_date_slab
, timestamp_t
);
661 static void record_author_date(struct author_date_slab
*author_date
,
662 struct commit
*commit
)
664 const char *buffer
= get_commit_buffer(commit
, NULL
);
665 struct ident_split ident
;
666 const char *ident_line
;
671 ident_line
= find_commit_header(buffer
, "author", &ident_len
);
673 goto fail_exit
; /* no author line */
674 if (split_ident_line(&ident
, ident_line
, ident_len
) ||
675 !ident
.date_begin
|| !ident
.date_end
)
676 goto fail_exit
; /* malformed "author" line */
678 date
= parse_timestamp(ident
.date_begin
, &date_end
, 10);
679 if (date_end
!= ident
.date_end
)
680 goto fail_exit
; /* malformed date */
681 *(author_date_slab_at(author_date
, commit
)) = date
;
684 unuse_commit_buffer(commit
, buffer
);
687 static int compare_commits_by_author_date(const void *a_
, const void *b_
,
690 const struct commit
*a
= a_
, *b
= b_
;
691 struct author_date_slab
*author_date
= cb_data
;
692 timestamp_t a_date
= *(author_date_slab_at(author_date
, a
));
693 timestamp_t b_date
= *(author_date_slab_at(author_date
, b
));
695 /* newer commits with larger date first */
698 else if (a_date
> b_date
)
703 int compare_commits_by_gen_then_commit_date(const void *a_
, const void *b_
, void *unused
)
705 const struct commit
*a
= a_
, *b
= b_
;
707 /* newer commits first */
708 if (a
->generation
< b
->generation
)
710 else if (a
->generation
> b
->generation
)
713 /* use date as a heuristic when generations are equal */
714 if (a
->date
< b
->date
)
716 else if (a
->date
> b
->date
)
721 int compare_commits_by_commit_date(const void *a_
, const void *b_
, void *unused
)
723 const struct commit
*a
= a_
, *b
= b_
;
724 /* newer commits with larger date first */
725 if (a
->date
< b
->date
)
727 else if (a
->date
> b
->date
)
733 * Performs an in-place topological sort on the list supplied.
735 void sort_in_topological_order(struct commit_list
**list
, enum rev_sort_order sort_order
)
737 struct commit_list
*next
, *orig
= *list
;
738 struct commit_list
**pptr
;
739 struct indegree_slab indegree
;
740 struct prio_queue queue
;
741 struct commit
*commit
;
742 struct author_date_slab author_date
;
748 init_indegree_slab(&indegree
);
749 memset(&queue
, '\0', sizeof(queue
));
751 switch (sort_order
) {
752 default: /* REV_SORT_IN_GRAPH_ORDER */
753 queue
.compare
= NULL
;
755 case REV_SORT_BY_COMMIT_DATE
:
756 queue
.compare
= compare_commits_by_commit_date
;
758 case REV_SORT_BY_AUTHOR_DATE
:
759 init_author_date_slab(&author_date
);
760 queue
.compare
= compare_commits_by_author_date
;
761 queue
.cb_data
= &author_date
;
765 /* Mark them and clear the indegree */
766 for (next
= orig
; next
; next
= next
->next
) {
767 struct commit
*commit
= next
->item
;
768 *(indegree_slab_at(&indegree
, commit
)) = 1;
769 /* also record the author dates, if needed */
770 if (sort_order
== REV_SORT_BY_AUTHOR_DATE
)
771 record_author_date(&author_date
, commit
);
774 /* update the indegree */
775 for (next
= orig
; next
; next
= next
->next
) {
776 struct commit_list
*parents
= next
->item
->parents
;
778 struct commit
*parent
= parents
->item
;
779 int *pi
= indegree_slab_at(&indegree
, parent
);
783 parents
= parents
->next
;
790 * tips are nodes not reachable from any other node in the list
792 * the tips serve as a starting set for the work queue.
794 for (next
= orig
; next
; next
= next
->next
) {
795 struct commit
*commit
= next
->item
;
797 if (*(indegree_slab_at(&indegree
, commit
)) == 1)
798 prio_queue_put(&queue
, commit
);
802 * This is unfortunate; the initial tips need to be shown
803 * in the order given from the revision traversal machinery.
805 if (sort_order
== REV_SORT_IN_GRAPH_ORDER
)
806 prio_queue_reverse(&queue
);
808 /* We no longer need the commit list */
809 free_commit_list(orig
);
813 while ((commit
= prio_queue_get(&queue
)) != NULL
) {
814 struct commit_list
*parents
;
816 for (parents
= commit
->parents
; parents
; parents
= parents
->next
) {
817 struct commit
*parent
= parents
->item
;
818 int *pi
= indegree_slab_at(&indegree
, parent
);
824 * parents are only enqueued for emission
825 * when all their children have been emitted thereby
826 * guaranteeing topological order.
829 prio_queue_put(&queue
, parent
);
832 * all children of commit have already been
833 * emitted. we can emit it now.
835 *(indegree_slab_at(&indegree
, commit
)) = 0;
837 pptr
= &commit_list_insert(commit
, pptr
)->next
;
840 clear_indegree_slab(&indegree
);
841 clear_prio_queue(&queue
);
842 if (sort_order
== REV_SORT_BY_AUTHOR_DATE
)
843 clear_author_date_slab(&author_date
);
846 /* merge-base stuff */
848 /* Remember to update object flag allocation in object.h */
849 #define PARENT1 (1u<<16)
850 #define PARENT2 (1u<<17)
851 #define STALE (1u<<18)
852 #define RESULT (1u<<19)
854 static const unsigned all_flags
= (PARENT1
| PARENT2
| STALE
| RESULT
);
856 static int queue_has_nonstale(struct prio_queue
*queue
)
859 for (i
= 0; i
< queue
->nr
; i
++) {
860 struct commit
*commit
= queue
->array
[i
].data
;
861 if (!(commit
->object
.flags
& STALE
))
867 /* all input commits in one and twos[] must have been parsed! */
868 static struct commit_list
*paint_down_to_common(struct commit
*one
, int n
,
869 struct commit
**twos
,
872 struct prio_queue queue
= { compare_commits_by_gen_then_commit_date
};
873 struct commit_list
*result
= NULL
;
875 uint32_t last_gen
= GENERATION_NUMBER_INFINITY
;
877 one
->object
.flags
|= PARENT1
;
879 commit_list_append(one
, &result
);
882 prio_queue_put(&queue
, one
);
884 for (i
= 0; i
< n
; i
++) {
885 twos
[i
]->object
.flags
|= PARENT2
;
886 prio_queue_put(&queue
, twos
[i
]);
889 while (queue_has_nonstale(&queue
)) {
890 struct commit
*commit
= prio_queue_get(&queue
);
891 struct commit_list
*parents
;
894 if (commit
->generation
> last_gen
)
895 BUG("bad generation skip %8x > %8x at %s",
896 commit
->generation
, last_gen
,
897 oid_to_hex(&commit
->object
.oid
));
898 last_gen
= commit
->generation
;
900 if (commit
->generation
< min_generation
)
903 flags
= commit
->object
.flags
& (PARENT1
| PARENT2
| STALE
);
904 if (flags
== (PARENT1
| PARENT2
)) {
905 if (!(commit
->object
.flags
& RESULT
)) {
906 commit
->object
.flags
|= RESULT
;
907 commit_list_insert_by_date(commit
, &result
);
909 /* Mark parents of a found merge stale */
912 parents
= commit
->parents
;
914 struct commit
*p
= parents
->item
;
915 parents
= parents
->next
;
916 if ((p
->object
.flags
& flags
) == flags
)
920 p
->object
.flags
|= flags
;
921 prio_queue_put(&queue
, p
);
925 clear_prio_queue(&queue
);
929 static struct commit_list
*merge_bases_many(struct commit
*one
, int n
, struct commit
**twos
)
931 struct commit_list
*list
= NULL
;
932 struct commit_list
*result
= NULL
;
935 for (i
= 0; i
< n
; i
++) {
938 * We do not mark this even with RESULT so we do not
939 * have to clean it up.
941 return commit_list_insert(one
, &result
);
944 if (parse_commit(one
))
946 for (i
= 0; i
< n
; i
++) {
947 if (parse_commit(twos
[i
]))
951 list
= paint_down_to_common(one
, n
, twos
, 0);
954 struct commit
*commit
= pop_commit(&list
);
955 if (!(commit
->object
.flags
& STALE
))
956 commit_list_insert_by_date(commit
, &result
);
961 struct commit_list
*get_octopus_merge_bases(struct commit_list
*in
)
963 struct commit_list
*i
, *j
, *k
, *ret
= NULL
;
968 commit_list_insert(in
->item
, &ret
);
970 for (i
= in
->next
; i
; i
= i
->next
) {
971 struct commit_list
*new_commits
= NULL
, *end
= NULL
;
973 for (j
= ret
; j
; j
= j
->next
) {
974 struct commit_list
*bases
;
975 bases
= get_merge_bases(i
->item
, j
->item
);
980 for (k
= bases
; k
; k
= k
->next
)
988 static int remove_redundant(struct commit
**array
, int cnt
)
991 * Some commit in the array may be an ancestor of
992 * another commit. Move such commit to the end of
993 * the array, and return the number of commits that
994 * are independent from each other.
996 struct commit
**work
;
997 unsigned char *redundant
;
1001 work
= xcalloc(cnt
, sizeof(*work
));
1002 redundant
= xcalloc(cnt
, 1);
1003 ALLOC_ARRAY(filled_index
, cnt
- 1);
1005 for (i
= 0; i
< cnt
; i
++)
1006 parse_commit(array
[i
]);
1007 for (i
= 0; i
< cnt
; i
++) {
1008 struct commit_list
*common
;
1009 uint32_t min_generation
= array
[i
]->generation
;
1013 for (j
= filled
= 0; j
< cnt
; j
++) {
1014 if (i
== j
|| redundant
[j
])
1016 filled_index
[filled
] = j
;
1017 work
[filled
++] = array
[j
];
1019 if (array
[j
]->generation
< min_generation
)
1020 min_generation
= array
[j
]->generation
;
1022 common
= paint_down_to_common(array
[i
], filled
, work
,
1024 if (array
[i
]->object
.flags
& PARENT2
)
1026 for (j
= 0; j
< filled
; j
++)
1027 if (work
[j
]->object
.flags
& PARENT1
)
1028 redundant
[filled_index
[j
]] = 1;
1029 clear_commit_marks(array
[i
], all_flags
);
1030 clear_commit_marks_many(filled
, work
, all_flags
);
1031 free_commit_list(common
);
1034 /* Now collect the result */
1035 COPY_ARRAY(work
, array
, cnt
);
1036 for (i
= filled
= 0; i
< cnt
; i
++)
1038 array
[filled
++] = work
[i
];
1039 for (j
= filled
, i
= 0; i
< cnt
; i
++)
1041 array
[j
++] = work
[i
];
1048 static struct commit_list
*get_merge_bases_many_0(struct commit
*one
,
1050 struct commit
**twos
,
1053 struct commit_list
*list
;
1054 struct commit
**rslt
;
1055 struct commit_list
*result
;
1058 result
= merge_bases_many(one
, n
, twos
);
1059 for (i
= 0; i
< n
; i
++) {
1063 if (!result
|| !result
->next
) {
1065 clear_commit_marks(one
, all_flags
);
1066 clear_commit_marks_many(n
, twos
, all_flags
);
1071 /* There are more than one */
1072 cnt
= commit_list_count(result
);
1073 rslt
= xcalloc(cnt
, sizeof(*rslt
));
1074 for (list
= result
, i
= 0; list
; list
= list
->next
)
1075 rslt
[i
++] = list
->item
;
1076 free_commit_list(result
);
1078 clear_commit_marks(one
, all_flags
);
1079 clear_commit_marks_many(n
, twos
, all_flags
);
1081 cnt
= remove_redundant(rslt
, cnt
);
1083 for (i
= 0; i
< cnt
; i
++)
1084 commit_list_insert_by_date(rslt
[i
], &result
);
1089 struct commit_list
*get_merge_bases_many(struct commit
*one
,
1091 struct commit
**twos
)
1093 return get_merge_bases_many_0(one
, n
, twos
, 1);
1096 struct commit_list
*get_merge_bases_many_dirty(struct commit
*one
,
1098 struct commit
**twos
)
1100 return get_merge_bases_many_0(one
, n
, twos
, 0);
1103 struct commit_list
*get_merge_bases(struct commit
*one
, struct commit
*two
)
1105 return get_merge_bases_many_0(one
, 1, &two
, 1);
1109 * Is "commit" a descendant of one of the elements on the "with_commit" list?
1111 int is_descendant_of(struct commit
*commit
, struct commit_list
*with_commit
)
1115 while (with_commit
) {
1116 struct commit
*other
;
1118 other
= with_commit
->item
;
1119 with_commit
= with_commit
->next
;
1120 if (in_merge_bases(other
, commit
))
1127 * Is "commit" an ancestor of one of the "references"?
1129 int in_merge_bases_many(struct commit
*commit
, int nr_reference
, struct commit
**reference
)
1131 struct commit_list
*bases
;
1133 uint32_t min_generation
= GENERATION_NUMBER_INFINITY
;
1135 if (parse_commit(commit
))
1137 for (i
= 0; i
< nr_reference
; i
++) {
1138 if (parse_commit(reference
[i
]))
1140 if (reference
[i
]->generation
< min_generation
)
1141 min_generation
= reference
[i
]->generation
;
1144 if (commit
->generation
> min_generation
)
1147 bases
= paint_down_to_common(commit
, nr_reference
, reference
, commit
->generation
);
1148 if (commit
->object
.flags
& PARENT2
)
1150 clear_commit_marks(commit
, all_flags
);
1151 clear_commit_marks_many(nr_reference
, reference
, all_flags
);
1152 free_commit_list(bases
);
1157 * Is "commit" an ancestor of (i.e. reachable from) the "reference"?
1159 int in_merge_bases(struct commit
*commit
, struct commit
*reference
)
1161 return in_merge_bases_many(commit
, 1, &reference
);
1164 struct commit_list
*reduce_heads(struct commit_list
*heads
)
1166 struct commit_list
*p
;
1167 struct commit_list
*result
= NULL
, **tail
= &result
;
1168 struct commit
**array
;
1175 for (p
= heads
; p
; p
= p
->next
)
1176 p
->item
->object
.flags
&= ~STALE
;
1177 for (p
= heads
, num_head
= 0; p
; p
= p
->next
) {
1178 if (p
->item
->object
.flags
& STALE
)
1180 p
->item
->object
.flags
|= STALE
;
1183 array
= xcalloc(num_head
, sizeof(*array
));
1184 for (p
= heads
, i
= 0; p
; p
= p
->next
) {
1185 if (p
->item
->object
.flags
& STALE
) {
1186 array
[i
++] = p
->item
;
1187 p
->item
->object
.flags
&= ~STALE
;
1190 num_head
= remove_redundant(array
, num_head
);
1191 for (i
= 0; i
< num_head
; i
++)
1192 tail
= &commit_list_insert(array
[i
], tail
)->next
;
1197 void reduce_heads_replace(struct commit_list
**heads
)
1199 struct commit_list
*result
= reduce_heads(*heads
);
1200 free_commit_list(*heads
);
1204 static const char gpg_sig_header
[] = "gpgsig";
1205 static const int gpg_sig_header_len
= sizeof(gpg_sig_header
) - 1;
1207 static int do_sign_commit(struct strbuf
*buf
, const char *keyid
)
1209 struct strbuf sig
= STRBUF_INIT
;
1210 int inspos
, copypos
;
1213 /* find the end of the header */
1214 eoh
= strstr(buf
->buf
, "\n\n");
1218 inspos
= eoh
- buf
->buf
+ 1;
1220 if (!keyid
|| !*keyid
)
1221 keyid
= get_signing_key();
1222 if (sign_buffer(buf
, &sig
, keyid
)) {
1223 strbuf_release(&sig
);
1227 for (copypos
= 0; sig
.buf
[copypos
]; ) {
1228 const char *bol
= sig
.buf
+ copypos
;
1229 const char *eol
= strchrnul(bol
, '\n');
1230 int len
= (eol
- bol
) + !!*eol
;
1233 strbuf_insert(buf
, inspos
, gpg_sig_header
, gpg_sig_header_len
);
1234 inspos
+= gpg_sig_header_len
;
1236 strbuf_insert(buf
, inspos
++, " ", 1);
1237 strbuf_insert(buf
, inspos
, bol
, len
);
1241 strbuf_release(&sig
);
1245 int parse_signed_commit(const struct commit
*commit
,
1246 struct strbuf
*payload
, struct strbuf
*signature
)
1250 const char *buffer
= get_commit_buffer(commit
, &size
);
1251 int in_signature
, saw_signature
= -1;
1252 const char *line
, *tail
;
1255 tail
= buffer
+ size
;
1258 while (line
< tail
) {
1259 const char *sig
= NULL
;
1260 const char *next
= memchr(line
, '\n', tail
- line
);
1262 next
= next
? next
+ 1 : tail
;
1263 if (in_signature
&& line
[0] == ' ')
1265 else if (starts_with(line
, gpg_sig_header
) &&
1266 line
[gpg_sig_header_len
] == ' ')
1267 sig
= line
+ gpg_sig_header_len
+ 1;
1269 strbuf_add(signature
, sig
, next
- sig
);
1274 /* dump the whole remainder of the buffer */
1276 strbuf_add(payload
, line
, next
- line
);
1281 unuse_commit_buffer(commit
, buffer
);
1282 return saw_signature
;
1285 int remove_signature(struct strbuf
*buf
)
1287 const char *line
= buf
->buf
;
1288 const char *tail
= buf
->buf
+ buf
->len
;
1289 int in_signature
= 0;
1290 const char *sig_start
= NULL
;
1291 const char *sig_end
= NULL
;
1293 while (line
< tail
) {
1294 const char *next
= memchr(line
, '\n', tail
- line
);
1295 next
= next
? next
+ 1 : tail
;
1297 if (in_signature
&& line
[0] == ' ')
1299 else if (starts_with(line
, gpg_sig_header
) &&
1300 line
[gpg_sig_header_len
] == ' ') {
1306 /* dump the whole remainder of the buffer */
1314 strbuf_remove(buf
, sig_start
- buf
->buf
, sig_end
- sig_start
);
1316 return sig_start
!= NULL
;
1319 static void handle_signed_tag(struct commit
*parent
, struct commit_extra_header
***tail
)
1321 struct merge_remote_desc
*desc
;
1322 struct commit_extra_header
*mergetag
;
1324 unsigned long size
, len
;
1325 enum object_type type
;
1327 desc
= merge_remote_util(parent
);
1328 if (!desc
|| !desc
->obj
)
1330 buf
= read_object_file(&desc
->obj
->oid
, &type
, &size
);
1331 if (!buf
|| type
!= OBJ_TAG
)
1333 len
= parse_signature(buf
, size
);
1337 * We could verify this signature and either omit the tag when
1338 * it does not validate, but the integrator may not have the
1339 * public key of the signer of the tag he is merging, while a
1340 * later auditor may have it while auditing, so let's not run
1341 * verify-signed-buffer here for now...
1343 * if (verify_signed_buffer(buf, len, buf + len, size - len, ...))
1344 * warn("warning: signed tag unverified.");
1346 mergetag
= xcalloc(1, sizeof(*mergetag
));
1347 mergetag
->key
= xstrdup("mergetag");
1348 mergetag
->value
= buf
;
1349 mergetag
->len
= size
;
1352 *tail
= &mergetag
->next
;
1359 int check_commit_signature(const struct commit
*commit
, struct signature_check
*sigc
)
1361 struct strbuf payload
= STRBUF_INIT
;
1362 struct strbuf signature
= STRBUF_INIT
;
1367 if (parse_signed_commit(commit
, &payload
, &signature
) <= 0)
1369 ret
= check_signature(payload
.buf
, payload
.len
, signature
.buf
,
1370 signature
.len
, sigc
);
1373 strbuf_release(&payload
);
1374 strbuf_release(&signature
);
1381 void append_merge_tag_headers(struct commit_list
*parents
,
1382 struct commit_extra_header
***tail
)
1385 struct commit
*parent
= parents
->item
;
1386 handle_signed_tag(parent
, tail
);
1387 parents
= parents
->next
;
1391 static void add_extra_header(struct strbuf
*buffer
,
1392 struct commit_extra_header
*extra
)
1394 strbuf_addstr(buffer
, extra
->key
);
1396 strbuf_add_lines(buffer
, " ", extra
->value
, extra
->len
);
1398 strbuf_addch(buffer
, '\n');
1401 struct commit_extra_header
*read_commit_extra_headers(struct commit
*commit
,
1402 const char **exclude
)
1404 struct commit_extra_header
*extra
= NULL
;
1406 const char *buffer
= get_commit_buffer(commit
, &size
);
1407 extra
= read_commit_extra_header_lines(buffer
, size
, exclude
);
1408 unuse_commit_buffer(commit
, buffer
);
1412 int for_each_mergetag(each_mergetag_fn fn
, struct commit
*commit
, void *data
)
1414 struct commit_extra_header
*extra
, *to_free
;
1417 to_free
= read_commit_extra_headers(commit
, NULL
);
1418 for (extra
= to_free
; !res
&& extra
; extra
= extra
->next
) {
1419 if (strcmp(extra
->key
, "mergetag"))
1420 continue; /* not a merge tag */
1421 res
= fn(commit
, extra
, data
);
1423 free_commit_extra_headers(to_free
);
1427 static inline int standard_header_field(const char *field
, size_t len
)
1429 return ((len
== 4 && !memcmp(field
, "tree", 4)) ||
1430 (len
== 6 && !memcmp(field
, "parent", 6)) ||
1431 (len
== 6 && !memcmp(field
, "author", 6)) ||
1432 (len
== 9 && !memcmp(field
, "committer", 9)) ||
1433 (len
== 8 && !memcmp(field
, "encoding", 8)));
1436 static int excluded_header_field(const char *field
, size_t len
, const char **exclude
)
1442 size_t xlen
= strlen(*exclude
);
1443 if (len
== xlen
&& !memcmp(field
, *exclude
, xlen
))
1450 static struct commit_extra_header
*read_commit_extra_header_lines(
1451 const char *buffer
, size_t size
,
1452 const char **exclude
)
1454 struct commit_extra_header
*extra
= NULL
, **tail
= &extra
, *it
= NULL
;
1455 const char *line
, *next
, *eof
, *eob
;
1456 struct strbuf buf
= STRBUF_INIT
;
1458 for (line
= buffer
, eob
= line
+ size
;
1459 line
< eob
&& *line
!= '\n';
1461 next
= memchr(line
, '\n', eob
- line
);
1462 next
= next
? next
+ 1 : eob
;
1466 strbuf_add(&buf
, line
+ 1, next
- (line
+ 1));
1470 it
->value
= strbuf_detach(&buf
, &it
->len
);
1474 eof
= memchr(line
, ' ', next
- line
);
1477 else if (standard_header_field(line
, eof
- line
) ||
1478 excluded_header_field(line
, eof
- line
, exclude
))
1481 it
= xcalloc(1, sizeof(*it
));
1482 it
->key
= xmemdupz(line
, eof
-line
);
1486 strbuf_add(&buf
, eof
+ 1, next
- (eof
+ 1));
1489 it
->value
= strbuf_detach(&buf
, &it
->len
);
1493 void free_commit_extra_headers(struct commit_extra_header
*extra
)
1496 struct commit_extra_header
*next
= extra
->next
;
1504 int commit_tree(const char *msg
, size_t msg_len
, const struct object_id
*tree
,
1505 struct commit_list
*parents
, struct object_id
*ret
,
1506 const char *author
, const char *sign_commit
)
1508 struct commit_extra_header
*extra
= NULL
, **tail
= &extra
;
1511 append_merge_tag_headers(parents
, &tail
);
1512 result
= commit_tree_extended(msg
, msg_len
, tree
, parents
, ret
,
1513 author
, sign_commit
, extra
);
1514 free_commit_extra_headers(extra
);
1518 static int find_invalid_utf8(const char *buf
, int len
)
1521 static const unsigned int max_codepoint
[] = {
1522 0x7f, 0x7ff, 0xffff, 0x10ffff
1526 unsigned char c
= *buf
++;
1527 int bytes
, bad_offset
;
1528 unsigned int codepoint
;
1529 unsigned int min_val
, max_val
;
1534 /* Simple US-ASCII? No worries. */
1538 bad_offset
= offset
-1;
1541 * Count how many more high bits set: that's how
1542 * many more bytes this sequence should have.
1551 * Must be between 1 and 3 more bytes. Longer sequences result in
1552 * codepoints beyond U+10FFFF, which are guaranteed never to exist.
1554 if (bytes
< 1 || 3 < bytes
)
1557 /* Do we *have* that many bytes? */
1562 * Place the encoded bits at the bottom of the value and compute the
1565 codepoint
= (c
& 0x7f) >> bytes
;
1566 min_val
= max_codepoint
[bytes
-1] + 1;
1567 max_val
= max_codepoint
[bytes
];
1572 /* And verify that they are good continuation bytes */
1575 codepoint
|= *buf
& 0x3f;
1576 if ((*buf
++ & 0xc0) != 0x80)
1580 /* Reject codepoints that are out of range for the sequence length. */
1581 if (codepoint
< min_val
|| codepoint
> max_val
)
1583 /* Surrogates are only for UTF-16 and cannot be encoded in UTF-8. */
1584 if ((codepoint
& 0x1ff800) == 0xd800)
1586 /* U+xxFFFE and U+xxFFFF are guaranteed non-characters. */
1587 if ((codepoint
& 0xfffe) == 0xfffe)
1589 /* So are anything in the range U+FDD0..U+FDEF. */
1590 if (codepoint
>= 0xfdd0 && codepoint
<= 0xfdef)
1597 * This verifies that the buffer is in proper utf8 format.
1599 * If it isn't, it assumes any non-utf8 characters are Latin1,
1600 * and does the conversion.
1602 static int verify_utf8(struct strbuf
*buf
)
1610 unsigned char replace
[2];
1612 bad
= find_invalid_utf8(buf
->buf
+ pos
, buf
->len
- pos
);
1618 strbuf_remove(buf
, pos
, 1);
1620 /* We know 'c' must be in the range 128-255 */
1621 replace
[0] = 0xc0 + (c
>> 6);
1622 replace
[1] = 0x80 + (c
& 0x3f);
1623 strbuf_insert(buf
, pos
, replace
, 2);
1628 static const char commit_utf8_warn
[] =
1629 N_("Warning: commit message did not conform to UTF-8.\n"
1630 "You may want to amend it after fixing the message, or set the config\n"
1631 "variable i18n.commitencoding to the encoding your project uses.\n");
1633 int commit_tree_extended(const char *msg
, size_t msg_len
,
1634 const struct object_id
*tree
,
1635 struct commit_list
*parents
, struct object_id
*ret
,
1636 const char *author
, const char *sign_commit
,
1637 struct commit_extra_header
*extra
)
1640 int encoding_is_utf8
;
1641 struct strbuf buffer
;
1643 assert_oid_type(tree
, OBJ_TREE
);
1645 if (memchr(msg
, '\0', msg_len
))
1646 return error("a NUL byte in commit log message not allowed.");
1648 /* Not having i18n.commitencoding is the same as having utf-8 */
1649 encoding_is_utf8
= is_encoding_utf8(git_commit_encoding
);
1651 strbuf_init(&buffer
, 8192); /* should avoid reallocs for the headers */
1652 strbuf_addf(&buffer
, "tree %s\n", oid_to_hex(tree
));
1655 * NOTE! This ordering means that the same exact tree merged with a
1656 * different order of parents will be a _different_ changeset even
1657 * if everything else stays the same.
1660 struct commit
*parent
= pop_commit(&parents
);
1661 strbuf_addf(&buffer
, "parent %s\n",
1662 oid_to_hex(&parent
->object
.oid
));
1665 /* Person/date information */
1667 author
= git_author_info(IDENT_STRICT
);
1668 strbuf_addf(&buffer
, "author %s\n", author
);
1669 strbuf_addf(&buffer
, "committer %s\n", git_committer_info(IDENT_STRICT
));
1670 if (!encoding_is_utf8
)
1671 strbuf_addf(&buffer
, "encoding %s\n", git_commit_encoding
);
1674 add_extra_header(&buffer
, extra
);
1675 extra
= extra
->next
;
1677 strbuf_addch(&buffer
, '\n');
1679 /* And add the comment */
1680 strbuf_add(&buffer
, msg
, msg_len
);
1682 /* And check the encoding */
1683 if (encoding_is_utf8
&& !verify_utf8(&buffer
))
1684 fprintf(stderr
, _(commit_utf8_warn
));
1686 if (sign_commit
&& do_sign_commit(&buffer
, sign_commit
)) {
1691 result
= write_object_file(buffer
.buf
, buffer
.len
, commit_type
, ret
);
1693 strbuf_release(&buffer
);
1697 define_commit_slab(merge_desc_slab
, struct merge_remote_desc
*);
1698 static struct merge_desc_slab merge_desc_slab
= COMMIT_SLAB_INIT(1, merge_desc_slab
);
1700 struct merge_remote_desc
*merge_remote_util(struct commit
*commit
)
1702 return *merge_desc_slab_at(&merge_desc_slab
, commit
);
1705 void set_merge_remote_desc(struct commit
*commit
,
1706 const char *name
, struct object
*obj
)
1708 struct merge_remote_desc
*desc
;
1709 FLEX_ALLOC_STR(desc
, name
, name
);
1711 *merge_desc_slab_at(&merge_desc_slab
, commit
) = desc
;
1714 struct commit
*get_merge_parent(const char *name
)
1717 struct commit
*commit
;
1718 struct object_id oid
;
1719 if (get_oid(name
, &oid
))
1721 obj
= parse_object(the_repository
, &oid
);
1722 commit
= (struct commit
*)peel_to_type(name
, 0, obj
, OBJ_COMMIT
);
1723 if (commit
&& !merge_remote_util(commit
))
1724 set_merge_remote_desc(commit
, name
, obj
);
1729 * Append a commit to the end of the commit_list.
1731 * next starts by pointing to the variable that holds the head of an
1732 * empty commit_list, and is updated to point to the "next" field of
1733 * the last item on the list as new commits are appended.
1737 * struct commit_list *list;
1738 * struct commit_list **next = &list;
1740 * next = commit_list_append(c1, next);
1741 * next = commit_list_append(c2, next);
1742 * assert(commit_list_count(list) == 2);
1745 struct commit_list
**commit_list_append(struct commit
*commit
,
1746 struct commit_list
**next
)
1748 struct commit_list
*new_commit
= xmalloc(sizeof(struct commit_list
));
1749 new_commit
->item
= commit
;
1751 new_commit
->next
= NULL
;
1752 return &new_commit
->next
;
1755 const char *find_commit_header(const char *msg
, const char *key
, size_t *out_len
)
1757 int key_len
= strlen(key
);
1758 const char *line
= msg
;
1761 const char *eol
= strchrnul(line
, '\n');
1766 if (eol
- line
> key_len
&&
1767 !strncmp(line
, key
, key_len
) &&
1768 line
[key_len
] == ' ') {
1769 *out_len
= eol
- line
- key_len
- 1;
1770 return line
+ key_len
+ 1;
1772 line
= *eol
? eol
+ 1 : NULL
;
1778 * Inspect the given string and determine the true "end" of the log message, in
1779 * order to find where to put a new Signed-off-by: line. Ignored are
1780 * trailing comment lines and blank lines. To support "git commit -s
1781 * --amend" on an existing commit, we also ignore "Conflicts:". To
1782 * support "git commit -v", we truncate at cut lines.
1784 * Returns the number of bytes from the tail to ignore, to be fed as
1785 * the second parameter to append_signoff().
1787 int ignore_non_trailer(const char *buf
, size_t len
)
1791 int in_old_conflicts_block
= 0;
1792 size_t cutoff
= wt_status_locate_end(buf
, len
);
1794 while (bol
< cutoff
) {
1795 const char *next_line
= memchr(buf
+ bol
, '\n', len
- bol
);
1798 next_line
= buf
+ len
;
1802 if (buf
[bol
] == comment_line_char
|| buf
[bol
] == '\n') {
1803 /* is this the first of the run of comments? */
1806 /* otherwise, it is just continuing */
1807 } else if (starts_with(buf
+ bol
, "Conflicts:\n")) {
1808 in_old_conflicts_block
= 1;
1811 } else if (in_old_conflicts_block
&& buf
[bol
] == '\t') {
1812 ; /* a pathname in the conflicts block */
1814 /* the previous was not trailing comment */
1816 in_old_conflicts_block
= 0;
1818 bol
= next_line
- buf
;
1820 return boc
? len
- boc
: len
- cutoff
;