11 #include "reflog-walk.h"
12 #include "patch-ids.h"
15 #include "string-list.h"
19 volatile show_early_output_fn_t show_early_output
;
21 char *path_name(const struct name_path
*path
, const char *name
)
23 const struct name_path
*p
;
25 int nlen
= strlen(name
);
28 for (p
= path
; p
; p
= p
->up
) {
30 len
+= p
->elem_len
+ 1;
33 m
= n
+ len
- (nlen
+ 1);
35 for (p
= path
; p
; p
= p
->up
) {
38 memcpy(m
, p
->elem
, p
->elem_len
);
45 static int show_path_component_truncated(FILE *out
, const char *name
, int len
)
48 for (cnt
= 0; cnt
< len
; cnt
++) {
50 if (!ch
|| ch
== '\n')
57 static int show_path_truncated(FILE *out
, const struct name_path
*path
)
63 emitted
= show_path_truncated(out
, path
->up
);
68 ours
= show_path_component_truncated(out
, path
->elem
, path
->elem_len
);
71 return ours
|| emitted
;
74 void show_object_with_name(FILE *out
, struct object
*obj
, const struct name_path
*path
, const char *component
)
76 struct name_path leaf
;
77 leaf
.up
= (struct name_path
*)path
;
78 leaf
.elem
= component
;
79 leaf
.elem_len
= strlen(component
);
81 fprintf(out
, "%s ", sha1_to_hex(obj
->sha1
));
82 show_path_truncated(out
, &leaf
);
86 void add_object(struct object
*obj
,
87 struct object_array
*p
,
88 struct name_path
*path
,
91 add_object_array(obj
, path_name(path
, name
), p
);
94 static void mark_blob_uninteresting(struct blob
*blob
)
98 if (blob
->object
.flags
& UNINTERESTING
)
100 blob
->object
.flags
|= UNINTERESTING
;
103 void mark_tree_uninteresting(struct tree
*tree
)
105 struct tree_desc desc
;
106 struct name_entry entry
;
107 struct object
*obj
= &tree
->object
;
111 if (obj
->flags
& UNINTERESTING
)
113 obj
->flags
|= UNINTERESTING
;
114 if (!has_sha1_file(obj
->sha1
))
116 if (parse_tree(tree
) < 0)
117 die("bad tree %s", sha1_to_hex(obj
->sha1
));
119 init_tree_desc(&desc
, tree
->buffer
, tree
->size
);
120 while (tree_entry(&desc
, &entry
)) {
121 switch (object_type(entry
.mode
)) {
123 mark_tree_uninteresting(lookup_tree(entry
.sha1
));
126 mark_blob_uninteresting(lookup_blob(entry
.sha1
));
129 /* Subproject commit - not in this repository */
135 * We don't care about the tree any more
136 * after it has been marked uninteresting.
142 void mark_parents_uninteresting(struct commit
*commit
)
144 struct commit_list
*parents
= NULL
, *l
;
146 for (l
= commit
->parents
; l
; l
= l
->next
)
147 commit_list_insert(l
->item
, &parents
);
150 struct commit
*commit
= parents
->item
;
152 parents
= parents
->next
;
157 * A missing commit is ok iff its parent is marked
160 * We just mark such a thing parsed, so that when
161 * it is popped next time around, we won't be trying
162 * to parse it and get an error.
164 if (!has_sha1_file(commit
->object
.sha1
))
165 commit
->object
.parsed
= 1;
167 if (commit
->object
.flags
& UNINTERESTING
)
170 commit
->object
.flags
|= UNINTERESTING
;
173 * Normally we haven't parsed the parent
174 * yet, so we won't have a parent of a parent
175 * here. However, it may turn out that we've
176 * reached this commit some other way (where it
177 * wasn't uninteresting), in which case we need
178 * to mark its parents recursively too..
180 if (!commit
->parents
)
183 for (l
= commit
->parents
->next
; l
; l
= l
->next
)
184 commit_list_insert(l
->item
, &parents
);
185 commit
= commit
->parents
->item
;
190 static void add_pending_object_with_mode(struct rev_info
*revs
, struct object
*obj
, const char *name
, unsigned mode
)
194 if (revs
->no_walk
&& (obj
->flags
& UNINTERESTING
))
196 if (revs
->reflog_info
&& obj
->type
== OBJ_COMMIT
) {
197 struct strbuf buf
= STRBUF_INIT
;
198 int len
= interpret_branch_name(name
, &buf
);
201 if (0 < len
&& name
[len
] && buf
.len
)
202 strbuf_addstr(&buf
, name
+ len
);
203 st
= add_reflog_for_walk(revs
->reflog_info
,
204 (struct commit
*)obj
,
205 buf
.buf
[0] ? buf
.buf
: name
);
206 strbuf_release(&buf
);
210 add_object_array_with_mode(obj
, name
, &revs
->pending
, mode
);
213 void add_pending_object(struct rev_info
*revs
, struct object
*obj
, const char *name
)
215 add_pending_object_with_mode(revs
, obj
, name
, S_IFINVALID
);
218 void add_head_to_pending(struct rev_info
*revs
)
220 unsigned char sha1
[20];
222 if (get_sha1("HEAD", sha1
))
224 obj
= parse_object(sha1
);
227 add_pending_object(revs
, obj
, "HEAD");
230 static struct object
*get_reference(struct rev_info
*revs
, const char *name
, const unsigned char *sha1
, unsigned int flags
)
232 struct object
*object
;
234 object
= parse_object(sha1
);
236 if (revs
->ignore_missing
)
238 die("bad object %s", name
);
240 object
->flags
|= flags
;
244 void add_pending_sha1(struct rev_info
*revs
, const char *name
,
245 const unsigned char *sha1
, unsigned int flags
)
247 struct object
*object
= get_reference(revs
, name
, sha1
, flags
);
248 add_pending_object(revs
, object
, name
);
251 static struct commit
*handle_commit(struct rev_info
*revs
, struct object
*object
, const char *name
)
253 unsigned long flags
= object
->flags
;
256 * Tag object? Look what it points to..
258 while (object
->type
== OBJ_TAG
) {
259 struct tag
*tag
= (struct tag
*) object
;
260 if (revs
->tag_objects
&& !(flags
& UNINTERESTING
))
261 add_pending_object(revs
, object
, tag
->tag
);
264 object
= parse_object(tag
->tagged
->sha1
);
266 if (flags
& UNINTERESTING
)
268 die("bad object %s", sha1_to_hex(tag
->tagged
->sha1
));
273 * Commit object? Just return it, we'll do all the complex
276 if (object
->type
== OBJ_COMMIT
) {
277 struct commit
*commit
= (struct commit
*)object
;
278 if (parse_commit(commit
) < 0)
279 die("unable to parse commit %s", name
);
280 if (flags
& UNINTERESTING
) {
281 commit
->object
.flags
|= UNINTERESTING
;
282 mark_parents_uninteresting(commit
);
285 if (revs
->show_source
&& !commit
->util
)
286 commit
->util
= (void *) name
;
291 * Tree object? Either mark it uninteresting, or add it
292 * to the list of objects to look at later..
294 if (object
->type
== OBJ_TREE
) {
295 struct tree
*tree
= (struct tree
*)object
;
296 if (!revs
->tree_objects
)
298 if (flags
& UNINTERESTING
) {
299 mark_tree_uninteresting(tree
);
302 add_pending_object(revs
, object
, "");
307 * Blob object? You know the drill by now..
309 if (object
->type
== OBJ_BLOB
) {
310 struct blob
*blob
= (struct blob
*)object
;
311 if (!revs
->blob_objects
)
313 if (flags
& UNINTERESTING
) {
314 mark_blob_uninteresting(blob
);
317 add_pending_object(revs
, object
, "");
320 die("%s is unknown object", name
);
323 static int everybody_uninteresting(struct commit_list
*orig
)
325 struct commit_list
*list
= orig
;
327 struct commit
*commit
= list
->item
;
329 if (commit
->object
.flags
& UNINTERESTING
)
337 * The goal is to get REV_TREE_NEW as the result only if the
338 * diff consists of all '+' (and no other changes), REV_TREE_OLD
339 * if the whole diff is removal of old data, and otherwise
340 * REV_TREE_DIFFERENT (of course if the trees are the same we
341 * want REV_TREE_SAME).
342 * That means that once we get to REV_TREE_DIFFERENT, we do not
343 * have to look any further.
345 static int tree_difference
= REV_TREE_SAME
;
347 static void file_add_remove(struct diff_options
*options
,
348 int addremove
, unsigned mode
,
349 const unsigned char *sha1
,
351 const char *fullpath
, unsigned dirty_submodule
)
353 int diff
= addremove
== '+' ? REV_TREE_NEW
: REV_TREE_OLD
;
355 tree_difference
|= diff
;
356 if (tree_difference
== REV_TREE_DIFFERENT
)
357 DIFF_OPT_SET(options
, HAS_CHANGES
);
360 static void file_change(struct diff_options
*options
,
361 unsigned old_mode
, unsigned new_mode
,
362 const unsigned char *old_sha1
,
363 const unsigned char *new_sha1
,
364 int old_sha1_valid
, int new_sha1_valid
,
365 const char *fullpath
,
366 unsigned old_dirty_submodule
, unsigned new_dirty_submodule
)
368 tree_difference
= REV_TREE_DIFFERENT
;
369 DIFF_OPT_SET(options
, HAS_CHANGES
);
372 static int rev_compare_tree(struct rev_info
*revs
, struct commit
*parent
, struct commit
*commit
)
374 struct tree
*t1
= parent
->tree
;
375 struct tree
*t2
= commit
->tree
;
382 if (revs
->simplify_by_decoration
) {
384 * If we are simplifying by decoration, then the commit
385 * is worth showing if it has a tag pointing at it.
387 if (lookup_decoration(&name_decoration
, &commit
->object
))
388 return REV_TREE_DIFFERENT
;
390 * A commit that is not pointed by a tag is uninteresting
391 * if we are not limited by path. This means that you will
392 * see the usual "commits that touch the paths" plus any
393 * tagged commit by specifying both --simplify-by-decoration
396 if (!revs
->prune_data
.nr
)
397 return REV_TREE_SAME
;
400 tree_difference
= REV_TREE_SAME
;
401 DIFF_OPT_CLR(&revs
->pruning
, HAS_CHANGES
);
402 if (diff_tree_sha1(t1
->object
.sha1
, t2
->object
.sha1
, "",
404 return REV_TREE_DIFFERENT
;
405 return tree_difference
;
408 static int rev_same_tree_as_empty(struct rev_info
*revs
, struct commit
*commit
)
413 struct tree_desc empty
, real
;
414 struct tree
*t1
= commit
->tree
;
419 tree
= read_object_with_reference(t1
->object
.sha1
, tree_type
, &size
, NULL
);
422 init_tree_desc(&real
, tree
, size
);
423 init_tree_desc(&empty
, "", 0);
425 tree_difference
= REV_TREE_SAME
;
426 DIFF_OPT_CLR(&revs
->pruning
, HAS_CHANGES
);
427 retval
= diff_tree(&empty
, &real
, "", &revs
->pruning
);
430 return retval
>= 0 && (tree_difference
== REV_TREE_SAME
);
433 static void try_to_simplify_commit(struct rev_info
*revs
, struct commit
*commit
)
435 struct commit_list
**pp
, *parent
;
436 int tree_changed
= 0, tree_same
= 0, nth_parent
= 0;
439 * If we don't do pruning, everything is interesting
447 if (!commit
->parents
) {
448 if (rev_same_tree_as_empty(revs
, commit
))
449 commit
->object
.flags
|= TREESAME
;
454 * Normal non-merge commit? If we don't want to make the
455 * history dense, we consider it always to be a change..
457 if (!revs
->dense
&& !commit
->parents
->next
)
460 pp
= &commit
->parents
;
461 while ((parent
= *pp
) != NULL
) {
462 struct commit
*p
= parent
->item
;
465 * Do not compare with later parents when we care only about
466 * the first parent chain, in order to avoid derailing the
467 * traversal to follow a side branch that brought everything
468 * in the path we are limited to by the pathspec.
470 if (revs
->first_parent_only
&& nth_parent
++)
472 if (parse_commit(p
) < 0)
473 die("cannot simplify commit %s (because of %s)",
474 sha1_to_hex(commit
->object
.sha1
),
475 sha1_to_hex(p
->object
.sha1
));
476 switch (rev_compare_tree(revs
, p
, commit
)) {
479 if (!revs
->simplify_history
|| (p
->object
.flags
& UNINTERESTING
)) {
480 /* Even if a merge with an uninteresting
481 * side branch brought the entire change
482 * we are interested in, we do not want
483 * to lose the other branches of this
484 * merge, so we just keep going.
490 commit
->parents
= parent
;
491 commit
->object
.flags
|= TREESAME
;
495 if (revs
->remove_empty_trees
&&
496 rev_same_tree_as_empty(revs
, p
)) {
497 /* We are adding all the specified
498 * paths from this parent, so the
499 * history beyond this parent is not
500 * interesting. Remove its parents
501 * (they are grandparents for us).
502 * IOW, we pretend this parent is a
505 if (parse_commit(p
) < 0)
506 die("cannot simplify commit %s (invalid %s)",
507 sha1_to_hex(commit
->object
.sha1
),
508 sha1_to_hex(p
->object
.sha1
));
513 case REV_TREE_DIFFERENT
:
518 die("bad tree compare for commit %s", sha1_to_hex(commit
->object
.sha1
));
520 if (tree_changed
&& !tree_same
)
522 commit
->object
.flags
|= TREESAME
;
525 static void commit_list_insert_by_date_cached(struct commit
*p
, struct commit_list
**head
,
526 struct commit_list
*cached_base
, struct commit_list
**cache
)
528 struct commit_list
*new_entry
;
530 if (cached_base
&& p
->date
< cached_base
->item
->date
)
531 new_entry
= commit_list_insert_by_date(p
, &cached_base
->next
);
533 new_entry
= commit_list_insert_by_date(p
, head
);
535 if (cache
&& (!*cache
|| p
->date
< (*cache
)->item
->date
))
539 static int add_parents_to_list(struct rev_info
*revs
, struct commit
*commit
,
540 struct commit_list
**list
, struct commit_list
**cache_ptr
)
542 struct commit_list
*parent
= commit
->parents
;
544 struct commit_list
*cached_base
= cache_ptr
? *cache_ptr
: NULL
;
546 if (commit
->object
.flags
& ADDED
)
548 commit
->object
.flags
|= ADDED
;
551 * If the commit is uninteresting, don't try to
552 * prune parents - we want the maximal uninteresting
555 * Normally we haven't parsed the parent
556 * yet, so we won't have a parent of a parent
557 * here. However, it may turn out that we've
558 * reached this commit some other way (where it
559 * wasn't uninteresting), in which case we need
560 * to mark its parents recursively too..
562 if (commit
->object
.flags
& UNINTERESTING
) {
564 struct commit
*p
= parent
->item
;
565 parent
= parent
->next
;
567 p
->object
.flags
|= UNINTERESTING
;
568 if (parse_commit(p
) < 0)
571 mark_parents_uninteresting(p
);
572 if (p
->object
.flags
& SEEN
)
574 p
->object
.flags
|= SEEN
;
575 commit_list_insert_by_date_cached(p
, list
, cached_base
, cache_ptr
);
581 * Ok, the commit wasn't uninteresting. Try to
582 * simplify the commit history and find the parent
583 * that has no differences in the path set if one exists.
585 try_to_simplify_commit(revs
, commit
);
590 left_flag
= (commit
->object
.flags
& SYMMETRIC_LEFT
);
592 for (parent
= commit
->parents
; parent
; parent
= parent
->next
) {
593 struct commit
*p
= parent
->item
;
595 if (parse_commit(p
) < 0)
597 if (revs
->show_source
&& !p
->util
)
598 p
->util
= commit
->util
;
599 p
->object
.flags
|= left_flag
;
600 if (!(p
->object
.flags
& SEEN
)) {
601 p
->object
.flags
|= SEEN
;
602 commit_list_insert_by_date_cached(p
, list
, cached_base
, cache_ptr
);
604 if (revs
->first_parent_only
)
610 static void cherry_pick_list(struct commit_list
*list
, struct rev_info
*revs
)
612 struct commit_list
*p
;
613 int left_count
= 0, right_count
= 0;
615 struct patch_ids ids
;
616 unsigned cherry_flag
;
618 /* First count the commits on the left and on the right */
619 for (p
= list
; p
; p
= p
->next
) {
620 struct commit
*commit
= p
->item
;
621 unsigned flags
= commit
->object
.flags
;
622 if (flags
& BOUNDARY
)
624 else if (flags
& SYMMETRIC_LEFT
)
630 if (!left_count
|| !right_count
)
633 left_first
= left_count
< right_count
;
634 init_patch_ids(&ids
);
635 ids
.diffopts
.pathspec
= revs
->diffopt
.pathspec
;
637 /* Compute patch-ids for one side */
638 for (p
= list
; p
; p
= p
->next
) {
639 struct commit
*commit
= p
->item
;
640 unsigned flags
= commit
->object
.flags
;
642 if (flags
& BOUNDARY
)
645 * If we have fewer left, left_first is set and we omit
646 * commits on the right branch in this loop. If we have
647 * fewer right, we skip the left ones.
649 if (left_first
!= !!(flags
& SYMMETRIC_LEFT
))
651 commit
->util
= add_commit_patch_id(commit
, &ids
);
654 /* either cherry_mark or cherry_pick are true */
655 cherry_flag
= revs
->cherry_mark
? PATCHSAME
: SHOWN
;
657 /* Check the other side */
658 for (p
= list
; p
; p
= p
->next
) {
659 struct commit
*commit
= p
->item
;
661 unsigned flags
= commit
->object
.flags
;
663 if (flags
& BOUNDARY
)
666 * If we have fewer left, left_first is set and we omit
667 * commits on the left branch in this loop.
669 if (left_first
== !!(flags
& SYMMETRIC_LEFT
))
673 * Have we seen the same patch id?
675 id
= has_commit_patch_id(commit
, &ids
);
679 commit
->object
.flags
|= cherry_flag
;
682 /* Now check the original side for seen ones */
683 for (p
= list
; p
; p
= p
->next
) {
684 struct commit
*commit
= p
->item
;
685 struct patch_id
*ent
;
691 commit
->object
.flags
|= cherry_flag
;
695 free_patch_ids(&ids
);
698 /* How many extra uninteresting commits we want to see.. */
701 static int still_interesting(struct commit_list
*src
, unsigned long date
, int slop
)
704 * No source list at all? We're definitely done..
710 * Does the destination list contain entries with a date
711 * before the source list? Definitely _not_ done.
713 if (date
<= src
->item
->date
)
717 * Does the source list still have interesting commits in
718 * it? Definitely not done..
720 if (!everybody_uninteresting(src
))
723 /* Ok, we're closing in.. */
728 * "rev-list --ancestry-path A..B" computes commits that are ancestors
729 * of B but not ancestors of A but further limits the result to those
730 * that are descendants of A. This takes the list of bottom commits and
731 * the result of "A..B" without --ancestry-path, and limits the latter
732 * further to the ones that can reach one of the commits in "bottom".
734 static void limit_to_ancestry(struct commit_list
*bottom
, struct commit_list
*list
)
736 struct commit_list
*p
;
737 struct commit_list
*rlist
= NULL
;
741 * Reverse the list so that it will be likely that we would
742 * process parents before children.
744 for (p
= list
; p
; p
= p
->next
)
745 commit_list_insert(p
->item
, &rlist
);
747 for (p
= bottom
; p
; p
= p
->next
)
748 p
->item
->object
.flags
|= TMP_MARK
;
751 * Mark the ones that can reach bottom commits in "list",
752 * in a bottom-up fashion.
756 for (p
= rlist
; p
; p
= p
->next
) {
757 struct commit
*c
= p
->item
;
758 struct commit_list
*parents
;
759 if (c
->object
.flags
& (TMP_MARK
| UNINTERESTING
))
761 for (parents
= c
->parents
;
763 parents
= parents
->next
) {
764 if (!(parents
->item
->object
.flags
& TMP_MARK
))
766 c
->object
.flags
|= TMP_MARK
;
771 } while (made_progress
);
774 * NEEDSWORK: decide if we want to remove parents that are
775 * not marked with TMP_MARK from commit->parents for commits
776 * in the resulting list. We may not want to do that, though.
780 * The ones that are not marked with TMP_MARK are uninteresting
782 for (p
= list
; p
; p
= p
->next
) {
783 struct commit
*c
= p
->item
;
784 if (c
->object
.flags
& TMP_MARK
)
786 c
->object
.flags
|= UNINTERESTING
;
789 /* We are done with the TMP_MARK */
790 for (p
= list
; p
; p
= p
->next
)
791 p
->item
->object
.flags
&= ~TMP_MARK
;
792 for (p
= bottom
; p
; p
= p
->next
)
793 p
->item
->object
.flags
&= ~TMP_MARK
;
794 free_commit_list(rlist
);
798 * Before walking the history, keep the set of "negative" refs the
799 * caller has asked to exclude.
801 * This is used to compute "rev-list --ancestry-path A..B", as we need
802 * to filter the result of "A..B" further to the ones that can actually
805 static struct commit_list
*collect_bottom_commits(struct rev_info
*revs
)
807 struct commit_list
*bottom
= NULL
;
809 for (i
= 0; i
< revs
->cmdline
.nr
; i
++) {
810 struct rev_cmdline_entry
*elem
= &revs
->cmdline
.rev
[i
];
811 if ((elem
->flags
& UNINTERESTING
) &&
812 elem
->item
->type
== OBJ_COMMIT
)
813 commit_list_insert((struct commit
*)elem
->item
, &bottom
);
818 /* Assumes either left_only or right_only is set */
819 static void limit_left_right(struct commit_list
*list
, struct rev_info
*revs
)
821 struct commit_list
*p
;
823 for (p
= list
; p
; p
= p
->next
) {
824 struct commit
*commit
= p
->item
;
826 if (revs
->right_only
) {
827 if (commit
->object
.flags
& SYMMETRIC_LEFT
)
828 commit
->object
.flags
|= SHOWN
;
829 } else /* revs->left_only is set */
830 if (!(commit
->object
.flags
& SYMMETRIC_LEFT
))
831 commit
->object
.flags
|= SHOWN
;
835 static int limit_list(struct rev_info
*revs
)
838 unsigned long date
= ~0ul;
839 struct commit_list
*list
= revs
->commits
;
840 struct commit_list
*newlist
= NULL
;
841 struct commit_list
**p
= &newlist
;
842 struct commit_list
*bottom
= NULL
;
844 if (revs
->ancestry_path
) {
845 bottom
= collect_bottom_commits(revs
);
847 die("--ancestry-path given but there are no bottom commits");
851 struct commit_list
*entry
= list
;
852 struct commit
*commit
= list
->item
;
853 struct object
*obj
= &commit
->object
;
854 show_early_output_fn_t show
;
859 if (revs
->max_age
!= -1 && (commit
->date
< revs
->max_age
))
860 obj
->flags
|= UNINTERESTING
;
861 if (add_parents_to_list(revs
, commit
, &list
, NULL
) < 0)
863 if (obj
->flags
& UNINTERESTING
) {
864 mark_parents_uninteresting(commit
);
866 p
= &commit_list_insert(commit
, p
)->next
;
867 slop
= still_interesting(list
, date
, slop
);
870 /* If showing all, add the whole pending list to the end */
875 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
))
878 p
= &commit_list_insert(commit
, p
)->next
;
880 show
= show_early_output
;
885 show_early_output
= NULL
;
887 if (revs
->cherry_pick
|| revs
->cherry_mark
)
888 cherry_pick_list(newlist
, revs
);
890 if (revs
->left_only
|| revs
->right_only
)
891 limit_left_right(newlist
, revs
);
894 limit_to_ancestry(bottom
, newlist
);
895 free_commit_list(bottom
);
898 revs
->commits
= newlist
;
902 static void add_rev_cmdline(struct rev_info
*revs
,
908 struct rev_cmdline_info
*info
= &revs
->cmdline
;
911 ALLOC_GROW(info
->rev
, nr
+ 1, info
->alloc
);
912 info
->rev
[nr
].item
= item
;
913 info
->rev
[nr
].name
= name
;
914 info
->rev
[nr
].whence
= whence
;
915 info
->rev
[nr
].flags
= flags
;
921 int warned_bad_reflog
;
922 struct rev_info
*all_revs
;
923 const char *name_for_errormsg
;
926 static int handle_one_ref(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
928 struct all_refs_cb
*cb
= cb_data
;
929 struct object
*object
= get_reference(cb
->all_revs
, path
, sha1
,
931 add_rev_cmdline(cb
->all_revs
, object
, path
, REV_CMD_REF
, cb
->all_flags
);
932 add_pending_sha1(cb
->all_revs
, path
, sha1
, cb
->all_flags
);
936 static void init_all_refs_cb(struct all_refs_cb
*cb
, struct rev_info
*revs
,
940 cb
->all_flags
= flags
;
943 static void handle_refs(const char *submodule
, struct rev_info
*revs
, unsigned flags
,
944 int (*for_each
)(const char *, each_ref_fn
, void *))
946 struct all_refs_cb cb
;
947 init_all_refs_cb(&cb
, revs
, flags
);
948 for_each(submodule
, handle_one_ref
, &cb
);
951 static void handle_one_reflog_commit(unsigned char *sha1
, void *cb_data
)
953 struct all_refs_cb
*cb
= cb_data
;
954 if (!is_null_sha1(sha1
)) {
955 struct object
*o
= parse_object(sha1
);
957 o
->flags
|= cb
->all_flags
;
958 /* ??? CMDLINEFLAGS ??? */
959 add_pending_object(cb
->all_revs
, o
, "");
961 else if (!cb
->warned_bad_reflog
) {
962 warning("reflog of '%s' references pruned commits",
963 cb
->name_for_errormsg
);
964 cb
->warned_bad_reflog
= 1;
969 static int handle_one_reflog_ent(unsigned char *osha1
, unsigned char *nsha1
,
970 const char *email
, unsigned long timestamp
, int tz
,
971 const char *message
, void *cb_data
)
973 handle_one_reflog_commit(osha1
, cb_data
);
974 handle_one_reflog_commit(nsha1
, cb_data
);
978 static int handle_one_reflog(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
980 struct all_refs_cb
*cb
= cb_data
;
981 cb
->warned_bad_reflog
= 0;
982 cb
->name_for_errormsg
= path
;
983 for_each_reflog_ent(path
, handle_one_reflog_ent
, cb_data
);
987 static void handle_reflog(struct rev_info
*revs
, unsigned flags
)
989 struct all_refs_cb cb
;
991 cb
.all_flags
= flags
;
992 for_each_reflog(handle_one_reflog
, &cb
);
995 static int add_parents_only(struct rev_info
*revs
, const char *arg_
, int flags
)
997 unsigned char sha1
[20];
999 struct commit
*commit
;
1000 struct commit_list
*parents
;
1001 const char *arg
= arg_
;
1004 flags
^= UNINTERESTING
;
1007 if (get_sha1_committish(arg
, sha1
))
1010 it
= get_reference(revs
, arg
, sha1
, 0);
1011 if (!it
&& revs
->ignore_missing
)
1013 if (it
->type
!= OBJ_TAG
)
1015 if (!((struct tag
*)it
)->tagged
)
1017 hashcpy(sha1
, ((struct tag
*)it
)->tagged
->sha1
);
1019 if (it
->type
!= OBJ_COMMIT
)
1021 commit
= (struct commit
*)it
;
1022 for (parents
= commit
->parents
; parents
; parents
= parents
->next
) {
1023 it
= &parents
->item
->object
;
1025 add_rev_cmdline(revs
, it
, arg_
, REV_CMD_PARENTS_ONLY
, flags
);
1026 add_pending_object(revs
, it
, arg
);
1031 void init_revisions(struct rev_info
*revs
, const char *prefix
)
1033 memset(revs
, 0, sizeof(*revs
));
1035 revs
->abbrev
= DEFAULT_ABBREV
;
1036 revs
->ignore_merges
= 1;
1037 revs
->simplify_history
= 1;
1038 DIFF_OPT_SET(&revs
->pruning
, RECURSIVE
);
1039 DIFF_OPT_SET(&revs
->pruning
, QUICK
);
1040 revs
->pruning
.add_remove
= file_add_remove
;
1041 revs
->pruning
.change
= file_change
;
1044 revs
->prefix
= prefix
;
1047 revs
->skip_count
= -1;
1048 revs
->max_count
= -1;
1049 revs
->max_parents
= -1;
1051 revs
->commit_format
= CMIT_FMT_DEFAULT
;
1053 init_grep_defaults();
1054 grep_init(&revs
->grep_filter
, prefix
);
1055 revs
->grep_filter
.status_only
= 1;
1056 revs
->grep_filter
.regflags
= REG_NEWLINE
;
1058 diff_setup(&revs
->diffopt
);
1059 if (prefix
&& !revs
->diffopt
.prefix
) {
1060 revs
->diffopt
.prefix
= prefix
;
1061 revs
->diffopt
.prefix_length
= strlen(prefix
);
1064 revs
->notes_opt
.use_default_notes
= -1;
1067 static void add_pending_commit_list(struct rev_info
*revs
,
1068 struct commit_list
*commit_list
,
1071 while (commit_list
) {
1072 struct object
*object
= &commit_list
->item
->object
;
1073 object
->flags
|= flags
;
1074 add_pending_object(revs
, object
, sha1_to_hex(object
->sha1
));
1075 commit_list
= commit_list
->next
;
1079 static void prepare_show_merge(struct rev_info
*revs
)
1081 struct commit_list
*bases
;
1082 struct commit
*head
, *other
;
1083 unsigned char sha1
[20];
1084 const char **prune
= NULL
;
1085 int i
, prune_num
= 1; /* counting terminating NULL */
1087 if (get_sha1("HEAD", sha1
))
1088 die("--merge without HEAD?");
1089 head
= lookup_commit_or_die(sha1
, "HEAD");
1090 if (get_sha1("MERGE_HEAD", sha1
))
1091 die("--merge without MERGE_HEAD?");
1092 other
= lookup_commit_or_die(sha1
, "MERGE_HEAD");
1093 add_pending_object(revs
, &head
->object
, "HEAD");
1094 add_pending_object(revs
, &other
->object
, "MERGE_HEAD");
1095 bases
= get_merge_bases(head
, other
, 1);
1096 add_pending_commit_list(revs
, bases
, UNINTERESTING
);
1097 free_commit_list(bases
);
1098 head
->object
.flags
|= SYMMETRIC_LEFT
;
1102 for (i
= 0; i
< active_nr
; i
++) {
1103 struct cache_entry
*ce
= active_cache
[i
];
1106 if (ce_path_match(ce
, &revs
->prune_data
)) {
1108 prune
= xrealloc(prune
, sizeof(*prune
) * prune_num
);
1109 prune
[prune_num
-2] = ce
->name
;
1110 prune
[prune_num
-1] = NULL
;
1112 while ((i
+1 < active_nr
) &&
1113 ce_same_name(ce
, active_cache
[i
+1]))
1116 free_pathspec(&revs
->prune_data
);
1117 init_pathspec(&revs
->prune_data
, prune
);
1121 int handle_revision_arg(const char *arg_
, struct rev_info
*revs
, int flags
, unsigned revarg_opt
)
1123 struct object_context oc
;
1125 struct object
*object
;
1126 unsigned char sha1
[20];
1128 const char *arg
= arg_
;
1129 int cant_be_filename
= revarg_opt
& REVARG_CANNOT_BE_FILENAME
;
1130 unsigned get_sha1_flags
= 0;
1132 dotdot
= strstr(arg
, "..");
1134 unsigned char from_sha1
[20];
1135 const char *next
= dotdot
+ 2;
1136 const char *this = arg
;
1137 int symmetric
= *next
== '.';
1138 unsigned int flags_exclude
= flags
^ UNINTERESTING
;
1139 static const char head_by_default
[] = "HEAD";
1140 unsigned int a_flags
;
1146 next
= head_by_default
;
1148 this = head_by_default
;
1149 if (this == head_by_default
&& next
== head_by_default
&&
1152 * Just ".."? That is not a range but the
1153 * pathspec for the parent directory.
1155 if (!cant_be_filename
) {
1160 if (!get_sha1_committish(this, from_sha1
) &&
1161 !get_sha1_committish(next
, sha1
)) {
1162 struct commit
*a
, *b
;
1163 struct commit_list
*exclude
;
1165 a
= lookup_commit_reference(from_sha1
);
1166 b
= lookup_commit_reference(sha1
);
1168 if (revs
->ignore_missing
)
1171 "Invalid symmetric difference expression %s...%s" :
1172 "Invalid revision range %s..%s",
1176 if (!cant_be_filename
) {
1178 verify_non_filename(revs
->prefix
, arg
);
1182 exclude
= get_merge_bases(a
, b
, 1);
1183 add_pending_commit_list(revs
, exclude
,
1185 free_commit_list(exclude
);
1186 a_flags
= flags
| SYMMETRIC_LEFT
;
1188 a_flags
= flags_exclude
;
1189 a
->object
.flags
|= a_flags
;
1190 b
->object
.flags
|= flags
;
1191 add_rev_cmdline(revs
, &a
->object
, this,
1192 REV_CMD_LEFT
, a_flags
);
1193 add_rev_cmdline(revs
, &b
->object
, next
,
1194 REV_CMD_RIGHT
, flags
);
1195 add_pending_object(revs
, &a
->object
, this);
1196 add_pending_object(revs
, &b
->object
, next
);
1201 dotdot
= strstr(arg
, "^@");
1202 if (dotdot
&& !dotdot
[2]) {
1204 if (add_parents_only(revs
, arg
, flags
))
1208 dotdot
= strstr(arg
, "^!");
1209 if (dotdot
&& !dotdot
[2]) {
1211 if (!add_parents_only(revs
, arg
, flags
^ UNINTERESTING
))
1217 local_flags
= UNINTERESTING
;
1221 if (revarg_opt
& REVARG_COMMITTISH
)
1222 get_sha1_flags
= GET_SHA1_COMMITTISH
;
1224 if (get_sha1_with_context(arg
, get_sha1_flags
, sha1
, &oc
))
1225 return revs
->ignore_missing
? 0 : -1;
1226 if (!cant_be_filename
)
1227 verify_non_filename(revs
->prefix
, arg
);
1228 object
= get_reference(revs
, arg
, sha1
, flags
^ local_flags
);
1229 add_rev_cmdline(revs
, object
, arg_
, REV_CMD_REV
, flags
^ local_flags
);
1230 add_pending_object_with_mode(revs
, object
, arg
, oc
.mode
);
1234 struct cmdline_pathspec
{
1240 static void append_prune_data(struct cmdline_pathspec
*prune
, const char **av
)
1243 ALLOC_GROW(prune
->path
, prune
->nr
+1, prune
->alloc
);
1244 prune
->path
[prune
->nr
++] = *(av
++);
1248 static void read_pathspec_from_stdin(struct rev_info
*revs
, struct strbuf
*sb
,
1249 struct cmdline_pathspec
*prune
)
1251 while (strbuf_getwholeline(sb
, stdin
, '\n') != EOF
) {
1253 if (len
&& sb
->buf
[len
- 1] == '\n')
1254 sb
->buf
[--len
] = '\0';
1255 ALLOC_GROW(prune
->path
, prune
->nr
+1, prune
->alloc
);
1256 prune
->path
[prune
->nr
++] = xstrdup(sb
->buf
);
1260 static void read_revisions_from_stdin(struct rev_info
*revs
,
1261 struct cmdline_pathspec
*prune
)
1264 int seen_dashdash
= 0;
1266 strbuf_init(&sb
, 1000);
1267 while (strbuf_getwholeline(&sb
, stdin
, '\n') != EOF
) {
1269 if (len
&& sb
.buf
[len
- 1] == '\n')
1270 sb
.buf
[--len
] = '\0';
1273 if (sb
.buf
[0] == '-') {
1274 if (len
== 2 && sb
.buf
[1] == '-') {
1278 die("options not supported in --stdin mode");
1280 if (handle_revision_arg(xstrdup(sb
.buf
), revs
, 0,
1281 REVARG_CANNOT_BE_FILENAME
))
1282 die("bad revision '%s'", sb
.buf
);
1285 read_pathspec_from_stdin(revs
, &sb
, prune
);
1286 strbuf_release(&sb
);
1289 static void add_grep(struct rev_info
*revs
, const char *ptn
, enum grep_pat_token what
)
1291 append_grep_pattern(&revs
->grep_filter
, ptn
, "command line", 0, what
);
1294 static void add_header_grep(struct rev_info
*revs
, enum grep_header_field field
, const char *pattern
)
1296 append_header_grep_pattern(&revs
->grep_filter
, field
, pattern
);
1299 static void add_message_grep(struct rev_info
*revs
, const char *pattern
)
1301 add_grep(revs
, pattern
, GREP_PATTERN_BODY
);
1304 static int handle_revision_opt(struct rev_info
*revs
, int argc
, const char **argv
,
1305 int *unkc
, const char **unkv
)
1307 const char *arg
= argv
[0];
1311 /* pseudo revision arguments */
1312 if (!strcmp(arg
, "--all") || !strcmp(arg
, "--branches") ||
1313 !strcmp(arg
, "--tags") || !strcmp(arg
, "--remotes") ||
1314 !strcmp(arg
, "--reflog") || !strcmp(arg
, "--not") ||
1315 !strcmp(arg
, "--no-walk") || !strcmp(arg
, "--do-walk") ||
1316 !strcmp(arg
, "--bisect") || !prefixcmp(arg
, "--glob=") ||
1317 !prefixcmp(arg
, "--branches=") || !prefixcmp(arg
, "--tags=") ||
1318 !prefixcmp(arg
, "--remotes=") || !prefixcmp(arg
, "--no-walk="))
1320 unkv
[(*unkc
)++] = arg
;
1324 if ((argcount
= parse_long_opt("max-count", argv
, &optarg
))) {
1325 revs
->max_count
= atoi(optarg
);
1328 } else if ((argcount
= parse_long_opt("skip", argv
, &optarg
))) {
1329 revs
->skip_count
= atoi(optarg
);
1331 } else if ((*arg
== '-') && isdigit(arg
[1])) {
1332 /* accept -<digit>, like traditional "head" */
1333 revs
->max_count
= atoi(arg
+ 1);
1335 } else if (!strcmp(arg
, "-n")) {
1337 return error("-n requires an argument");
1338 revs
->max_count
= atoi(argv
[1]);
1341 } else if (!prefixcmp(arg
, "-n")) {
1342 revs
->max_count
= atoi(arg
+ 2);
1344 } else if ((argcount
= parse_long_opt("max-age", argv
, &optarg
))) {
1345 revs
->max_age
= atoi(optarg
);
1347 } else if ((argcount
= parse_long_opt("since", argv
, &optarg
))) {
1348 revs
->max_age
= approxidate(optarg
);
1350 } else if ((argcount
= parse_long_opt("after", argv
, &optarg
))) {
1351 revs
->max_age
= approxidate(optarg
);
1353 } else if ((argcount
= parse_long_opt("min-age", argv
, &optarg
))) {
1354 revs
->min_age
= atoi(optarg
);
1356 } else if ((argcount
= parse_long_opt("before", argv
, &optarg
))) {
1357 revs
->min_age
= approxidate(optarg
);
1359 } else if ((argcount
= parse_long_opt("until", argv
, &optarg
))) {
1360 revs
->min_age
= approxidate(optarg
);
1362 } else if (!strcmp(arg
, "--first-parent")) {
1363 revs
->first_parent_only
= 1;
1364 } else if (!strcmp(arg
, "--ancestry-path")) {
1365 revs
->ancestry_path
= 1;
1366 revs
->simplify_history
= 0;
1368 } else if (!strcmp(arg
, "-g") || !strcmp(arg
, "--walk-reflogs")) {
1369 init_reflog_walk(&revs
->reflog_info
);
1370 } else if (!strcmp(arg
, "--default")) {
1372 return error("bad --default argument");
1373 revs
->def
= argv
[1];
1375 } else if (!strcmp(arg
, "--merge")) {
1376 revs
->show_merge
= 1;
1377 } else if (!strcmp(arg
, "--topo-order")) {
1379 revs
->topo_order
= 1;
1380 } else if (!strcmp(arg
, "--simplify-merges")) {
1381 revs
->simplify_merges
= 1;
1382 revs
->topo_order
= 1;
1383 revs
->rewrite_parents
= 1;
1384 revs
->simplify_history
= 0;
1386 } else if (!strcmp(arg
, "--simplify-by-decoration")) {
1387 revs
->simplify_merges
= 1;
1388 revs
->topo_order
= 1;
1389 revs
->rewrite_parents
= 1;
1390 revs
->simplify_history
= 0;
1391 revs
->simplify_by_decoration
= 1;
1394 load_ref_decorations(DECORATE_SHORT_REFS
);
1395 } else if (!strcmp(arg
, "--date-order")) {
1397 revs
->topo_order
= 1;
1398 } else if (!prefixcmp(arg
, "--early-output")) {
1402 count
= atoi(arg
+15);
1405 revs
->topo_order
= 1;
1406 revs
->early_output
= count
;
1408 } else if (!strcmp(arg
, "--parents")) {
1409 revs
->rewrite_parents
= 1;
1410 revs
->print_parents
= 1;
1411 } else if (!strcmp(arg
, "--dense")) {
1413 } else if (!strcmp(arg
, "--sparse")) {
1415 } else if (!strcmp(arg
, "--show-all")) {
1417 } else if (!strcmp(arg
, "--remove-empty")) {
1418 revs
->remove_empty_trees
= 1;
1419 } else if (!strcmp(arg
, "--merges")) {
1420 revs
->min_parents
= 2;
1421 } else if (!strcmp(arg
, "--no-merges")) {
1422 revs
->max_parents
= 1;
1423 } else if (!prefixcmp(arg
, "--min-parents=")) {
1424 revs
->min_parents
= atoi(arg
+14);
1425 } else if (!prefixcmp(arg
, "--no-min-parents")) {
1426 revs
->min_parents
= 0;
1427 } else if (!prefixcmp(arg
, "--max-parents=")) {
1428 revs
->max_parents
= atoi(arg
+14);
1429 } else if (!prefixcmp(arg
, "--no-max-parents")) {
1430 revs
->max_parents
= -1;
1431 } else if (!strcmp(arg
, "--boundary")) {
1433 } else if (!strcmp(arg
, "--left-right")) {
1434 revs
->left_right
= 1;
1435 } else if (!strcmp(arg
, "--left-only")) {
1436 if (revs
->right_only
)
1437 die("--left-only is incompatible with --right-only"
1439 revs
->left_only
= 1;
1440 } else if (!strcmp(arg
, "--right-only")) {
1441 if (revs
->left_only
)
1442 die("--right-only is incompatible with --left-only");
1443 revs
->right_only
= 1;
1444 } else if (!strcmp(arg
, "--cherry")) {
1445 if (revs
->left_only
)
1446 die("--cherry is incompatible with --left-only");
1447 revs
->cherry_mark
= 1;
1448 revs
->right_only
= 1;
1449 revs
->max_parents
= 1;
1451 } else if (!strcmp(arg
, "--count")) {
1453 } else if (!strcmp(arg
, "--cherry-mark")) {
1454 if (revs
->cherry_pick
)
1455 die("--cherry-mark is incompatible with --cherry-pick");
1456 revs
->cherry_mark
= 1;
1457 revs
->limited
= 1; /* needs limit_list() */
1458 } else if (!strcmp(arg
, "--cherry-pick")) {
1459 if (revs
->cherry_mark
)
1460 die("--cherry-pick is incompatible with --cherry-mark");
1461 revs
->cherry_pick
= 1;
1463 } else if (!strcmp(arg
, "--objects")) {
1464 revs
->tag_objects
= 1;
1465 revs
->tree_objects
= 1;
1466 revs
->blob_objects
= 1;
1467 } else if (!strcmp(arg
, "--objects-edge")) {
1468 revs
->tag_objects
= 1;
1469 revs
->tree_objects
= 1;
1470 revs
->blob_objects
= 1;
1471 revs
->edge_hint
= 1;
1472 } else if (!strcmp(arg
, "--verify-objects")) {
1473 revs
->tag_objects
= 1;
1474 revs
->tree_objects
= 1;
1475 revs
->blob_objects
= 1;
1476 revs
->verify_objects
= 1;
1477 } else if (!strcmp(arg
, "--unpacked")) {
1479 } else if (!prefixcmp(arg
, "--unpacked=")) {
1480 die("--unpacked=<packfile> no longer supported.");
1481 } else if (!strcmp(arg
, "-r")) {
1483 DIFF_OPT_SET(&revs
->diffopt
, RECURSIVE
);
1484 } else if (!strcmp(arg
, "-t")) {
1486 DIFF_OPT_SET(&revs
->diffopt
, RECURSIVE
);
1487 DIFF_OPT_SET(&revs
->diffopt
, TREE_IN_RECURSIVE
);
1488 } else if (!strcmp(arg
, "-m")) {
1489 revs
->ignore_merges
= 0;
1490 } else if (!strcmp(arg
, "-c")) {
1492 revs
->dense_combined_merges
= 0;
1493 revs
->combine_merges
= 1;
1494 } else if (!strcmp(arg
, "--cc")) {
1496 revs
->dense_combined_merges
= 1;
1497 revs
->combine_merges
= 1;
1498 } else if (!strcmp(arg
, "-v")) {
1499 revs
->verbose_header
= 1;
1500 } else if (!strcmp(arg
, "--pretty")) {
1501 revs
->verbose_header
= 1;
1502 revs
->pretty_given
= 1;
1503 get_commit_format(arg
+8, revs
);
1504 } else if (!prefixcmp(arg
, "--pretty=") || !prefixcmp(arg
, "--format=")) {
1506 * Detached form ("--pretty X" as opposed to "--pretty=X")
1507 * not allowed, since the argument is optional.
1509 revs
->verbose_header
= 1;
1510 revs
->pretty_given
= 1;
1511 get_commit_format(arg
+9, revs
);
1512 } else if (!strcmp(arg
, "--show-notes") || !strcmp(arg
, "--notes")) {
1513 revs
->show_notes
= 1;
1514 revs
->show_notes_given
= 1;
1515 revs
->notes_opt
.use_default_notes
= 1;
1516 } else if (!strcmp(arg
, "--show-signature")) {
1517 revs
->show_signature
= 1;
1518 } else if (!prefixcmp(arg
, "--show-notes=") ||
1519 !prefixcmp(arg
, "--notes=")) {
1520 struct strbuf buf
= STRBUF_INIT
;
1521 revs
->show_notes
= 1;
1522 revs
->show_notes_given
= 1;
1523 if (!prefixcmp(arg
, "--show-notes")) {
1524 if (revs
->notes_opt
.use_default_notes
< 0)
1525 revs
->notes_opt
.use_default_notes
= 1;
1526 strbuf_addstr(&buf
, arg
+13);
1529 strbuf_addstr(&buf
, arg
+8);
1530 expand_notes_ref(&buf
);
1531 string_list_append(&revs
->notes_opt
.extra_notes_refs
,
1532 strbuf_detach(&buf
, NULL
));
1533 } else if (!strcmp(arg
, "--no-notes")) {
1534 revs
->show_notes
= 0;
1535 revs
->show_notes_given
= 1;
1536 revs
->notes_opt
.use_default_notes
= -1;
1537 /* we have been strdup'ing ourselves, so trick
1538 * string_list into free()ing strings */
1539 revs
->notes_opt
.extra_notes_refs
.strdup_strings
= 1;
1540 string_list_clear(&revs
->notes_opt
.extra_notes_refs
, 0);
1541 revs
->notes_opt
.extra_notes_refs
.strdup_strings
= 0;
1542 } else if (!strcmp(arg
, "--standard-notes")) {
1543 revs
->show_notes_given
= 1;
1544 revs
->notes_opt
.use_default_notes
= 1;
1545 } else if (!strcmp(arg
, "--no-standard-notes")) {
1546 revs
->notes_opt
.use_default_notes
= 0;
1547 } else if (!strcmp(arg
, "--oneline")) {
1548 revs
->verbose_header
= 1;
1549 get_commit_format("oneline", revs
);
1550 revs
->pretty_given
= 1;
1551 revs
->abbrev_commit
= 1;
1552 } else if (!strcmp(arg
, "--graph")) {
1553 revs
->topo_order
= 1;
1554 revs
->rewrite_parents
= 1;
1555 revs
->graph
= graph_init(revs
);
1556 } else if (!strcmp(arg
, "--root")) {
1557 revs
->show_root_diff
= 1;
1558 } else if (!strcmp(arg
, "--no-commit-id")) {
1559 revs
->no_commit_id
= 1;
1560 } else if (!strcmp(arg
, "--always")) {
1561 revs
->always_show_header
= 1;
1562 } else if (!strcmp(arg
, "--no-abbrev")) {
1564 } else if (!strcmp(arg
, "--abbrev")) {
1565 revs
->abbrev
= DEFAULT_ABBREV
;
1566 } else if (!prefixcmp(arg
, "--abbrev=")) {
1567 revs
->abbrev
= strtoul(arg
+ 9, NULL
, 10);
1568 if (revs
->abbrev
< MINIMUM_ABBREV
)
1569 revs
->abbrev
= MINIMUM_ABBREV
;
1570 else if (revs
->abbrev
> 40)
1572 } else if (!strcmp(arg
, "--abbrev-commit")) {
1573 revs
->abbrev_commit
= 1;
1574 revs
->abbrev_commit_given
= 1;
1575 } else if (!strcmp(arg
, "--no-abbrev-commit")) {
1576 revs
->abbrev_commit
= 0;
1577 } else if (!strcmp(arg
, "--full-diff")) {
1579 revs
->full_diff
= 1;
1580 } else if (!strcmp(arg
, "--full-history")) {
1581 revs
->simplify_history
= 0;
1582 } else if (!strcmp(arg
, "--relative-date")) {
1583 revs
->date_mode
= DATE_RELATIVE
;
1584 revs
->date_mode_explicit
= 1;
1585 } else if ((argcount
= parse_long_opt("date", argv
, &optarg
))) {
1586 revs
->date_mode
= parse_date_format(optarg
);
1587 revs
->date_mode_explicit
= 1;
1589 } else if (!strcmp(arg
, "--log-size")) {
1590 revs
->show_log_size
= 1;
1593 * Grepping the commit log
1595 else if ((argcount
= parse_long_opt("author", argv
, &optarg
))) {
1596 add_header_grep(revs
, GREP_HEADER_AUTHOR
, optarg
);
1598 } else if ((argcount
= parse_long_opt("committer", argv
, &optarg
))) {
1599 add_header_grep(revs
, GREP_HEADER_COMMITTER
, optarg
);
1601 } else if ((argcount
= parse_long_opt("grep-reflog", argv
, &optarg
))) {
1602 add_header_grep(revs
, GREP_HEADER_REFLOG
, optarg
);
1604 } else if ((argcount
= parse_long_opt("grep", argv
, &optarg
))) {
1605 add_message_grep(revs
, optarg
);
1607 } else if (!strcmp(arg
, "--grep-debug")) {
1608 revs
->grep_filter
.debug
= 1;
1609 } else if (!strcmp(arg
, "--basic-regexp")) {
1610 grep_set_pattern_type_option(GREP_PATTERN_TYPE_BRE
, &revs
->grep_filter
);
1611 } else if (!strcmp(arg
, "--extended-regexp") || !strcmp(arg
, "-E")) {
1612 grep_set_pattern_type_option(GREP_PATTERN_TYPE_ERE
, &revs
->grep_filter
);
1613 } else if (!strcmp(arg
, "--regexp-ignore-case") || !strcmp(arg
, "-i")) {
1614 revs
->grep_filter
.regflags
|= REG_ICASE
;
1615 DIFF_OPT_SET(&revs
->diffopt
, PICKAXE_IGNORE_CASE
);
1616 } else if (!strcmp(arg
, "--fixed-strings") || !strcmp(arg
, "-F")) {
1617 grep_set_pattern_type_option(GREP_PATTERN_TYPE_FIXED
, &revs
->grep_filter
);
1618 } else if (!strcmp(arg
, "--perl-regexp")) {
1619 grep_set_pattern_type_option(GREP_PATTERN_TYPE_PCRE
, &revs
->grep_filter
);
1620 } else if (!strcmp(arg
, "--all-match")) {
1621 revs
->grep_filter
.all_match
= 1;
1622 } else if ((argcount
= parse_long_opt("encoding", argv
, &optarg
))) {
1623 if (strcmp(optarg
, "none"))
1624 git_log_output_encoding
= xstrdup(optarg
);
1626 git_log_output_encoding
= "";
1628 } else if (!strcmp(arg
, "--reverse")) {
1630 } else if (!strcmp(arg
, "--children")) {
1631 revs
->children
.name
= "children";
1633 } else if (!strcmp(arg
, "--ignore-missing")) {
1634 revs
->ignore_missing
= 1;
1636 int opts
= diff_opt_parse(&revs
->diffopt
, argv
, argc
);
1638 unkv
[(*unkc
)++] = arg
;
1645 void parse_revision_opt(struct rev_info
*revs
, struct parse_opt_ctx_t
*ctx
,
1646 const struct option
*options
,
1647 const char * const usagestr
[])
1649 int n
= handle_revision_opt(revs
, ctx
->argc
, ctx
->argv
,
1650 &ctx
->cpidx
, ctx
->out
);
1652 error("unknown option `%s'", ctx
->argv
[0]);
1653 usage_with_options(usagestr
, options
);
1659 static int for_each_bad_bisect_ref(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1661 return for_each_ref_in_submodule(submodule
, "refs/bisect/bad", fn
, cb_data
);
1664 static int for_each_good_bisect_ref(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1666 return for_each_ref_in_submodule(submodule
, "refs/bisect/good", fn
, cb_data
);
1669 static int handle_revision_pseudo_opt(const char *submodule
,
1670 struct rev_info
*revs
,
1671 int argc
, const char **argv
, int *flags
)
1673 const char *arg
= argv
[0];
1680 * Commands like "git shortlog" will not accept the options below
1681 * unless parse_revision_opt queues them (as opposed to erroring
1684 * When implementing your new pseudo-option, remember to
1685 * register it in the list at the top of handle_revision_opt.
1687 if (!strcmp(arg
, "--all")) {
1688 handle_refs(submodule
, revs
, *flags
, for_each_ref_submodule
);
1689 handle_refs(submodule
, revs
, *flags
, head_ref_submodule
);
1690 } else if (!strcmp(arg
, "--branches")) {
1691 handle_refs(submodule
, revs
, *flags
, for_each_branch_ref_submodule
);
1692 } else if (!strcmp(arg
, "--bisect")) {
1693 handle_refs(submodule
, revs
, *flags
, for_each_bad_bisect_ref
);
1694 handle_refs(submodule
, revs
, *flags
^ UNINTERESTING
, for_each_good_bisect_ref
);
1696 } else if (!strcmp(arg
, "--tags")) {
1697 handle_refs(submodule
, revs
, *flags
, for_each_tag_ref_submodule
);
1698 } else if (!strcmp(arg
, "--remotes")) {
1699 handle_refs(submodule
, revs
, *flags
, for_each_remote_ref_submodule
);
1700 } else if ((argcount
= parse_long_opt("glob", argv
, &optarg
))) {
1701 struct all_refs_cb cb
;
1702 init_all_refs_cb(&cb
, revs
, *flags
);
1703 for_each_glob_ref(handle_one_ref
, optarg
, &cb
);
1705 } else if (!prefixcmp(arg
, "--branches=")) {
1706 struct all_refs_cb cb
;
1707 init_all_refs_cb(&cb
, revs
, *flags
);
1708 for_each_glob_ref_in(handle_one_ref
, arg
+ 11, "refs/heads/", &cb
);
1709 } else if (!prefixcmp(arg
, "--tags=")) {
1710 struct all_refs_cb cb
;
1711 init_all_refs_cb(&cb
, revs
, *flags
);
1712 for_each_glob_ref_in(handle_one_ref
, arg
+ 7, "refs/tags/", &cb
);
1713 } else if (!prefixcmp(arg
, "--remotes=")) {
1714 struct all_refs_cb cb
;
1715 init_all_refs_cb(&cb
, revs
, *flags
);
1716 for_each_glob_ref_in(handle_one_ref
, arg
+ 10, "refs/remotes/", &cb
);
1717 } else if (!strcmp(arg
, "--reflog")) {
1718 handle_reflog(revs
, *flags
);
1719 } else if (!strcmp(arg
, "--not")) {
1720 *flags
^= UNINTERESTING
;
1721 } else if (!strcmp(arg
, "--no-walk")) {
1722 revs
->no_walk
= REVISION_WALK_NO_WALK_SORTED
;
1723 } else if (!prefixcmp(arg
, "--no-walk=")) {
1725 * Detached form ("--no-walk X" as opposed to "--no-walk=X")
1726 * not allowed, since the argument is optional.
1728 if (!strcmp(arg
+ 10, "sorted"))
1729 revs
->no_walk
= REVISION_WALK_NO_WALK_SORTED
;
1730 else if (!strcmp(arg
+ 10, "unsorted"))
1731 revs
->no_walk
= REVISION_WALK_NO_WALK_UNSORTED
;
1733 return error("invalid argument to --no-walk");
1734 } else if (!strcmp(arg
, "--do-walk")) {
1744 * Parse revision information, filling in the "rev_info" structure,
1745 * and removing the used arguments from the argument list.
1747 * Returns the number of arguments left that weren't recognized
1748 * (which are also moved to the head of the argument list)
1750 int setup_revisions(int argc
, const char **argv
, struct rev_info
*revs
, struct setup_revision_opt
*opt
)
1752 int i
, flags
, left
, seen_dashdash
, read_from_stdin
, got_rev_arg
= 0, revarg_opt
;
1753 struct cmdline_pathspec prune_data
;
1754 const char *submodule
= NULL
;
1756 memset(&prune_data
, 0, sizeof(prune_data
));
1758 submodule
= opt
->submodule
;
1760 /* First, search for "--" */
1761 if (opt
&& opt
->assume_dashdash
) {
1765 for (i
= 1; i
< argc
; i
++) {
1766 const char *arg
= argv
[i
];
1767 if (strcmp(arg
, "--"))
1772 append_prune_data(&prune_data
, argv
+ i
+ 1);
1778 /* Second, deal with arguments and options */
1780 revarg_opt
= opt
? opt
->revarg_opt
: 0;
1782 revarg_opt
|= REVARG_CANNOT_BE_FILENAME
;
1783 read_from_stdin
= 0;
1784 for (left
= i
= 1; i
< argc
; i
++) {
1785 const char *arg
= argv
[i
];
1789 opts
= handle_revision_pseudo_opt(submodule
,
1790 revs
, argc
- i
, argv
+ i
,
1797 if (!strcmp(arg
, "--stdin")) {
1798 if (revs
->disable_stdin
) {
1802 if (read_from_stdin
++)
1803 die("--stdin given twice?");
1804 read_revisions_from_stdin(revs
, &prune_data
);
1808 opts
= handle_revision_opt(revs
, argc
- i
, argv
+ i
, &left
, argv
);
1819 if (handle_revision_arg(arg
, revs
, flags
, revarg_opt
)) {
1821 if (seen_dashdash
|| *arg
== '^')
1822 die("bad revision '%s'", arg
);
1824 /* If we didn't have a "--":
1825 * (1) all filenames must exist;
1826 * (2) all rev-args must not be interpretable
1827 * as a valid filename.
1828 * but the latter we have checked in the main loop.
1830 for (j
= i
; j
< argc
; j
++)
1831 verify_filename(revs
->prefix
, argv
[j
], j
== i
);
1833 append_prune_data(&prune_data
, argv
+ i
);
1840 if (prune_data
.nr
) {
1842 * If we need to introduce the magic "a lone ':' means no
1843 * pathspec whatsoever", here is the place to do so.
1845 * if (prune_data.nr == 1 && !strcmp(prune_data[0], ":")) {
1846 * prune_data.nr = 0;
1847 * prune_data.alloc = 0;
1848 * free(prune_data.path);
1849 * prune_data.path = NULL;
1851 * terminate prune_data.alloc with NULL and
1852 * call init_pathspec() to set revs->prune_data here.
1855 ALLOC_GROW(prune_data
.path
, prune_data
.nr
+1, prune_data
.alloc
);
1856 prune_data
.path
[prune_data
.nr
++] = NULL
;
1857 init_pathspec(&revs
->prune_data
,
1858 get_pathspec(revs
->prefix
, prune_data
.path
));
1861 if (revs
->def
== NULL
)
1862 revs
->def
= opt
? opt
->def
: NULL
;
1863 if (opt
&& opt
->tweak
)
1864 opt
->tweak(revs
, opt
);
1865 if (revs
->show_merge
)
1866 prepare_show_merge(revs
);
1867 if (revs
->def
&& !revs
->pending
.nr
&& !got_rev_arg
) {
1868 unsigned char sha1
[20];
1869 struct object
*object
;
1870 struct object_context oc
;
1871 if (get_sha1_with_context(revs
->def
, 0, sha1
, &oc
))
1872 die("bad default revision '%s'", revs
->def
);
1873 object
= get_reference(revs
, revs
->def
, sha1
, 0);
1874 add_pending_object_with_mode(revs
, object
, revs
->def
, oc
.mode
);
1877 /* Did the user ask for any diff output? Run the diff! */
1878 if (revs
->diffopt
.output_format
& ~DIFF_FORMAT_NO_OUTPUT
)
1881 /* Pickaxe, diff-filter and rename following need diffs */
1882 if (revs
->diffopt
.pickaxe
||
1883 revs
->diffopt
.filter
||
1884 DIFF_OPT_TST(&revs
->diffopt
, FOLLOW_RENAMES
))
1887 if (revs
->topo_order
)
1890 if (revs
->prune_data
.nr
) {
1891 diff_tree_setup_paths(revs
->prune_data
.raw
, &revs
->pruning
);
1892 /* Can't prune commits with rename following: the paths change.. */
1893 if (!DIFF_OPT_TST(&revs
->diffopt
, FOLLOW_RENAMES
))
1895 if (!revs
->full_diff
)
1896 diff_tree_setup_paths(revs
->prune_data
.raw
, &revs
->diffopt
);
1898 if (revs
->combine_merges
)
1899 revs
->ignore_merges
= 0;
1900 revs
->diffopt
.abbrev
= revs
->abbrev
;
1902 if (revs
->line_level_traverse
) {
1904 revs
->topo_order
= 1;
1907 diff_setup_done(&revs
->diffopt
);
1909 grep_commit_pattern_type(GREP_PATTERN_TYPE_UNSPECIFIED
,
1910 &revs
->grep_filter
);
1911 compile_grep_patterns(&revs
->grep_filter
);
1913 if (revs
->reverse
&& revs
->reflog_info
)
1914 die("cannot combine --reverse with --walk-reflogs");
1915 if (revs
->rewrite_parents
&& revs
->children
.name
)
1916 die("cannot combine --parents and --children");
1919 * Limitations on the graph functionality
1921 if (revs
->reverse
&& revs
->graph
)
1922 die("cannot combine --reverse with --graph");
1924 if (revs
->reflog_info
&& revs
->graph
)
1925 die("cannot combine --walk-reflogs with --graph");
1926 if (!revs
->reflog_info
&& revs
->grep_filter
.use_reflog_filter
)
1927 die("cannot use --grep-reflog without --walk-reflogs");
1932 static void add_child(struct rev_info
*revs
, struct commit
*parent
, struct commit
*child
)
1934 struct commit_list
*l
= xcalloc(1, sizeof(*l
));
1937 l
->next
= add_decoration(&revs
->children
, &parent
->object
, l
);
1940 static int remove_duplicate_parents(struct commit
*commit
)
1942 struct commit_list
**pp
, *p
;
1943 int surviving_parents
;
1945 /* Examine existing parents while marking ones we have seen... */
1946 pp
= &commit
->parents
;
1947 while ((p
= *pp
) != NULL
) {
1948 struct commit
*parent
= p
->item
;
1949 if (parent
->object
.flags
& TMP_MARK
) {
1953 parent
->object
.flags
|= TMP_MARK
;
1956 /* count them while clearing the temporary mark */
1957 surviving_parents
= 0;
1958 for (p
= commit
->parents
; p
; p
= p
->next
) {
1959 p
->item
->object
.flags
&= ~TMP_MARK
;
1960 surviving_parents
++;
1962 return surviving_parents
;
1965 struct merge_simplify_state
{
1966 struct commit
*simplified
;
1969 static struct merge_simplify_state
*locate_simplify_state(struct rev_info
*revs
, struct commit
*commit
)
1971 struct merge_simplify_state
*st
;
1973 st
= lookup_decoration(&revs
->merge_simplification
, &commit
->object
);
1975 st
= xcalloc(1, sizeof(*st
));
1976 add_decoration(&revs
->merge_simplification
, &commit
->object
, st
);
1981 static struct commit_list
**simplify_one(struct rev_info
*revs
, struct commit
*commit
, struct commit_list
**tail
)
1983 struct commit_list
*p
;
1984 struct merge_simplify_state
*st
, *pst
;
1987 st
= locate_simplify_state(revs
, commit
);
1990 * Have we handled this one?
1996 * An UNINTERESTING commit simplifies to itself, so does a
1997 * root commit. We do not rewrite parents of such commit
2000 if ((commit
->object
.flags
& UNINTERESTING
) || !commit
->parents
) {
2001 st
->simplified
= commit
;
2006 * Do we know what commit all of our parents that matter
2007 * should be rewritten to? Otherwise we are not ready to
2008 * rewrite this one yet.
2010 for (cnt
= 0, p
= commit
->parents
; p
; p
= p
->next
) {
2011 pst
= locate_simplify_state(revs
, p
->item
);
2012 if (!pst
->simplified
) {
2013 tail
= &commit_list_insert(p
->item
, tail
)->next
;
2016 if (revs
->first_parent_only
)
2020 tail
= &commit_list_insert(commit
, tail
)->next
;
2025 * Rewrite our list of parents.
2027 for (p
= commit
->parents
; p
; p
= p
->next
) {
2028 pst
= locate_simplify_state(revs
, p
->item
);
2029 p
->item
= pst
->simplified
;
2030 if (revs
->first_parent_only
)
2034 if (revs
->first_parent_only
)
2037 cnt
= remove_duplicate_parents(commit
);
2040 * It is possible that we are a merge and one side branch
2041 * does not have any commit that touches the given paths;
2042 * in such a case, the immediate parents will be rewritten
2043 * to different commits.
2045 * o----X X: the commit we are looking at;
2046 * / / o: a commit that touches the paths;
2049 * Further reduce the parents by removing redundant parents.
2052 struct commit_list
*h
= reduce_heads(commit
->parents
);
2053 cnt
= commit_list_count(h
);
2054 free_commit_list(commit
->parents
);
2055 commit
->parents
= h
;
2059 * A commit simplifies to itself if it is a root, if it is
2060 * UNINTERESTING, if it touches the given paths, or if it is a
2061 * merge and its parents simplifies to more than one commits
2062 * (the first two cases are already handled at the beginning of
2065 * Otherwise, it simplifies to what its sole parent simplifies to.
2068 (commit
->object
.flags
& UNINTERESTING
) ||
2069 !(commit
->object
.flags
& TREESAME
) ||
2071 st
->simplified
= commit
;
2073 pst
= locate_simplify_state(revs
, commit
->parents
->item
);
2074 st
->simplified
= pst
->simplified
;
2079 static void simplify_merges(struct rev_info
*revs
)
2081 struct commit_list
*list
, *next
;
2082 struct commit_list
*yet_to_do
, **tail
;
2083 struct commit
*commit
;
2088 /* feed the list reversed */
2090 for (list
= revs
->commits
; list
; list
= next
) {
2091 commit
= list
->item
;
2094 * Do not free(list) here yet; the original list
2095 * is used later in this function.
2097 commit_list_insert(commit
, &yet_to_do
);
2104 commit
= list
->item
;
2108 tail
= simplify_one(revs
, commit
, tail
);
2112 /* clean up the result, removing the simplified ones */
2113 list
= revs
->commits
;
2114 revs
->commits
= NULL
;
2115 tail
= &revs
->commits
;
2117 struct merge_simplify_state
*st
;
2119 commit
= list
->item
;
2123 st
= locate_simplify_state(revs
, commit
);
2124 if (st
->simplified
== commit
)
2125 tail
= &commit_list_insert(commit
, tail
)->next
;
2129 static void set_children(struct rev_info
*revs
)
2131 struct commit_list
*l
;
2132 for (l
= revs
->commits
; l
; l
= l
->next
) {
2133 struct commit
*commit
= l
->item
;
2134 struct commit_list
*p
;
2136 for (p
= commit
->parents
; p
; p
= p
->next
)
2137 add_child(revs
, p
->item
, commit
);
2141 void reset_revision_walk(void)
2143 clear_object_flags(SEEN
| ADDED
| SHOWN
);
2146 int prepare_revision_walk(struct rev_info
*revs
)
2148 int nr
= revs
->pending
.nr
;
2149 struct object_array_entry
*e
, *list
;
2150 struct commit_list
**next
= &revs
->commits
;
2152 e
= list
= revs
->pending
.objects
;
2153 revs
->pending
.nr
= 0;
2154 revs
->pending
.alloc
= 0;
2155 revs
->pending
.objects
= NULL
;
2157 struct commit
*commit
= handle_commit(revs
, e
->item
, e
->name
);
2159 if (!(commit
->object
.flags
& SEEN
)) {
2160 commit
->object
.flags
|= SEEN
;
2161 next
= commit_list_append(commit
, next
);
2166 if (!revs
->leak_pending
)
2169 if (revs
->no_walk
!= REVISION_WALK_NO_WALK_UNSORTED
)
2170 commit_list_sort_by_date(&revs
->commits
);
2174 if (limit_list(revs
) < 0)
2176 if (revs
->topo_order
)
2177 sort_in_topological_order(&revs
->commits
, revs
->lifo
);
2178 if (revs
->line_level_traverse
)
2179 line_log_filter(revs
);
2180 if (revs
->simplify_merges
)
2181 simplify_merges(revs
);
2182 if (revs
->children
.name
)
2187 static enum rewrite_result
rewrite_one(struct rev_info
*revs
, struct commit
**pp
)
2189 struct commit_list
*cache
= NULL
;
2192 struct commit
*p
= *pp
;
2194 if (add_parents_to_list(revs
, p
, &revs
->commits
, &cache
) < 0)
2195 return rewrite_one_error
;
2196 if (p
->parents
&& p
->parents
->next
)
2197 return rewrite_one_ok
;
2198 if (p
->object
.flags
& UNINTERESTING
)
2199 return rewrite_one_ok
;
2200 if (!(p
->object
.flags
& TREESAME
))
2201 return rewrite_one_ok
;
2203 return rewrite_one_noparents
;
2204 *pp
= p
->parents
->item
;
2208 int rewrite_parents(struct rev_info
*revs
, struct commit
*commit
,
2209 rewrite_parent_fn_t rewrite_parent
)
2211 struct commit_list
**pp
= &commit
->parents
;
2213 struct commit_list
*parent
= *pp
;
2214 switch (rewrite_parent(revs
, &parent
->item
)) {
2215 case rewrite_one_ok
:
2217 case rewrite_one_noparents
:
2220 case rewrite_one_error
:
2225 remove_duplicate_parents(commit
);
2229 static int commit_rewrite_person(struct strbuf
*buf
, const char *what
, struct string_list
*mailmap
)
2231 char *person
, *endp
;
2232 size_t len
, namelen
, maillen
;
2235 struct ident_split ident
;
2237 person
= strstr(buf
->buf
, what
);
2241 person
+= strlen(what
);
2242 endp
= strchr(person
, '\n');
2246 len
= endp
- person
;
2248 if (split_ident_line(&ident
, person
, len
))
2251 mail
= ident
.mail_begin
;
2252 maillen
= ident
.mail_end
- ident
.mail_begin
;
2253 name
= ident
.name_begin
;
2254 namelen
= ident
.name_end
- ident
.name_begin
;
2256 if (map_user(mailmap
, &mail
, &maillen
, &name
, &namelen
)) {
2257 struct strbuf namemail
= STRBUF_INIT
;
2259 strbuf_addf(&namemail
, "%.*s <%.*s>",
2260 (int)namelen
, name
, (int)maillen
, mail
);
2262 strbuf_splice(buf
, ident
.name_begin
- buf
->buf
,
2263 ident
.mail_end
- ident
.name_begin
+ 1,
2264 namemail
.buf
, namemail
.len
);
2266 strbuf_release(&namemail
);
2274 static int commit_match(struct commit
*commit
, struct rev_info
*opt
)
2277 const char *encoding
;
2279 struct strbuf buf
= STRBUF_INIT
;
2281 if (!opt
->grep_filter
.pattern_list
&& !opt
->grep_filter
.header_list
)
2284 /* Prepend "fake" headers as needed */
2285 if (opt
->grep_filter
.use_reflog_filter
) {
2286 strbuf_addstr(&buf
, "reflog ");
2287 get_reflog_message(&buf
, opt
->reflog_info
);
2288 strbuf_addch(&buf
, '\n');
2292 * We grep in the user's output encoding, under the assumption that it
2293 * is the encoding they are most likely to write their grep pattern
2294 * for. In addition, it means we will match the "notes" encoding below,
2295 * so we will not end up with a buffer that has two different encodings
2298 encoding
= get_log_output_encoding();
2299 message
= logmsg_reencode(commit
, NULL
, encoding
);
2301 /* Copy the commit to temporary if we are using "fake" headers */
2303 strbuf_addstr(&buf
, message
);
2305 if (opt
->grep_filter
.header_list
&& opt
->mailmap
) {
2307 strbuf_addstr(&buf
, message
);
2309 commit_rewrite_person(&buf
, "\nauthor ", opt
->mailmap
);
2310 commit_rewrite_person(&buf
, "\ncommitter ", opt
->mailmap
);
2313 /* Append "fake" message parts as needed */
2314 if (opt
->show_notes
) {
2316 strbuf_addstr(&buf
, message
);
2317 format_display_notes(commit
->object
.sha1
, &buf
, encoding
, 1);
2320 /* Find either in the original commit message, or in the temporary */
2322 retval
= grep_buffer(&opt
->grep_filter
, buf
.buf
, buf
.len
);
2324 retval
= grep_buffer(&opt
->grep_filter
,
2325 message
, strlen(message
));
2326 strbuf_release(&buf
);
2327 logmsg_free(message
, commit
);
2331 static inline int want_ancestry(struct rev_info
*revs
)
2333 return (revs
->rewrite_parents
|| revs
->children
.name
);
2336 enum commit_action
get_commit_action(struct rev_info
*revs
, struct commit
*commit
)
2338 if (commit
->object
.flags
& SHOWN
)
2339 return commit_ignore
;
2340 if (revs
->unpacked
&& has_sha1_pack(commit
->object
.sha1
))
2341 return commit_ignore
;
2344 if (commit
->object
.flags
& UNINTERESTING
)
2345 return commit_ignore
;
2346 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
))
2347 return commit_ignore
;
2348 if (revs
->min_parents
|| (revs
->max_parents
>= 0)) {
2350 struct commit_list
*p
;
2351 for (p
= commit
->parents
; p
; p
= p
->next
)
2353 if ((n
< revs
->min_parents
) ||
2354 ((revs
->max_parents
>= 0) && (n
> revs
->max_parents
)))
2355 return commit_ignore
;
2357 if (!commit_match(commit
, revs
))
2358 return commit_ignore
;
2359 if (revs
->prune
&& revs
->dense
) {
2360 /* Commit without changes? */
2361 if (commit
->object
.flags
& TREESAME
) {
2362 /* drop merges unless we want parenthood */
2363 if (!want_ancestry(revs
))
2364 return commit_ignore
;
2365 /* non-merge - always ignore it */
2366 if (!commit
->parents
|| !commit
->parents
->next
)
2367 return commit_ignore
;
2373 enum commit_action
simplify_commit(struct rev_info
*revs
, struct commit
*commit
)
2375 enum commit_action action
= get_commit_action(revs
, commit
);
2377 if (action
== commit_show
&&
2379 revs
->prune
&& revs
->dense
&& want_ancestry(revs
)) {
2380 if (rewrite_parents(revs
, commit
, rewrite_one
) < 0)
2381 return commit_error
;
2386 static struct commit
*get_revision_1(struct rev_info
*revs
)
2392 struct commit_list
*entry
= revs
->commits
;
2393 struct commit
*commit
= entry
->item
;
2395 revs
->commits
= entry
->next
;
2398 if (revs
->reflog_info
) {
2399 fake_reflog_parent(revs
->reflog_info
, commit
);
2400 commit
->object
.flags
&= ~(ADDED
| SEEN
| SHOWN
);
2404 * If we haven't done the list limiting, we need to look at
2405 * the parents here. We also need to do the date-based limiting
2406 * that we'd otherwise have done in limit_list().
2408 if (!revs
->limited
) {
2409 if (revs
->max_age
!= -1 &&
2410 (commit
->date
< revs
->max_age
))
2412 if (add_parents_to_list(revs
, commit
, &revs
->commits
, NULL
) < 0)
2413 die("Failed to traverse parents of commit %s",
2414 sha1_to_hex(commit
->object
.sha1
));
2417 switch (simplify_commit(revs
, commit
)) {
2421 die("Failed to simplify parents of commit %s",
2422 sha1_to_hex(commit
->object
.sha1
));
2426 } while (revs
->commits
);
2430 static void gc_boundary(struct object_array
*array
)
2432 unsigned nr
= array
->nr
;
2433 unsigned alloc
= array
->alloc
;
2434 struct object_array_entry
*objects
= array
->objects
;
2438 for (i
= j
= 0; i
< nr
; i
++) {
2439 if (objects
[i
].item
->flags
& SHOWN
)
2442 objects
[j
] = objects
[i
];
2445 for (i
= j
; i
< nr
; i
++)
2446 objects
[i
].item
= NULL
;
2451 static void create_boundary_commit_list(struct rev_info
*revs
)
2455 struct object_array
*array
= &revs
->boundary_commits
;
2456 struct object_array_entry
*objects
= array
->objects
;
2459 * If revs->commits is non-NULL at this point, an error occurred in
2460 * get_revision_1(). Ignore the error and continue printing the
2461 * boundary commits anyway. (This is what the code has always
2464 if (revs
->commits
) {
2465 free_commit_list(revs
->commits
);
2466 revs
->commits
= NULL
;
2470 * Put all of the actual boundary commits from revs->boundary_commits
2471 * into revs->commits
2473 for (i
= 0; i
< array
->nr
; i
++) {
2474 c
= (struct commit
*)(objects
[i
].item
);
2477 if (!(c
->object
.flags
& CHILD_SHOWN
))
2479 if (c
->object
.flags
& (SHOWN
| BOUNDARY
))
2481 c
->object
.flags
|= BOUNDARY
;
2482 commit_list_insert(c
, &revs
->commits
);
2486 * If revs->topo_order is set, sort the boundary commits
2487 * in topological order
2489 sort_in_topological_order(&revs
->commits
, revs
->lifo
);
2492 static struct commit
*get_revision_internal(struct rev_info
*revs
)
2494 struct commit
*c
= NULL
;
2495 struct commit_list
*l
;
2497 if (revs
->boundary
== 2) {
2499 * All of the normal commits have already been returned,
2500 * and we are now returning boundary commits.
2501 * create_boundary_commit_list() has populated
2502 * revs->commits with the remaining commits to return.
2504 c
= pop_commit(&revs
->commits
);
2506 c
->object
.flags
|= SHOWN
;
2511 * If our max_count counter has reached zero, then we are done. We
2512 * don't simply return NULL because we still might need to show
2513 * boundary commits. But we want to avoid calling get_revision_1, which
2514 * might do a considerable amount of work finding the next commit only
2515 * for us to throw it away.
2517 * If it is non-zero, then either we don't have a max_count at all
2518 * (-1), or it is still counting, in which case we decrement.
2520 if (revs
->max_count
) {
2521 c
= get_revision_1(revs
);
2523 while (0 < revs
->skip_count
) {
2525 c
= get_revision_1(revs
);
2531 if (revs
->max_count
> 0)
2536 c
->object
.flags
|= SHOWN
;
2538 if (!revs
->boundary
) {
2544 * get_revision_1() runs out the commits, and
2545 * we are done computing the boundaries.
2546 * switch to boundary commits output mode.
2551 * Update revs->commits to contain the list of
2554 create_boundary_commit_list(revs
);
2556 return get_revision_internal(revs
);
2560 * boundary commits are the commits that are parents of the
2561 * ones we got from get_revision_1() but they themselves are
2562 * not returned from get_revision_1(). Before returning
2563 * 'c', we need to mark its parents that they could be boundaries.
2566 for (l
= c
->parents
; l
; l
= l
->next
) {
2568 p
= &(l
->item
->object
);
2569 if (p
->flags
& (CHILD_SHOWN
| SHOWN
))
2571 p
->flags
|= CHILD_SHOWN
;
2572 gc_boundary(&revs
->boundary_commits
);
2573 add_object_array(p
, NULL
, &revs
->boundary_commits
);
2579 struct commit
*get_revision(struct rev_info
*revs
)
2582 struct commit_list
*reversed
;
2584 if (revs
->reverse
) {
2586 while ((c
= get_revision_internal(revs
))) {
2587 commit_list_insert(c
, &reversed
);
2589 revs
->commits
= reversed
;
2591 revs
->reverse_output_stage
= 1;
2594 if (revs
->reverse_output_stage
)
2595 return pop_commit(&revs
->commits
);
2597 c
= get_revision_internal(revs
);
2598 if (c
&& revs
->graph
)
2599 graph_update(revs
->graph
, c
);
2603 char *get_revision_mark(const struct rev_info
*revs
, const struct commit
*commit
)
2605 if (commit
->object
.flags
& BOUNDARY
)
2607 else if (commit
->object
.flags
& UNINTERESTING
)
2609 else if (commit
->object
.flags
& PATCHSAME
)
2611 else if (!revs
|| revs
->left_right
) {
2612 if (commit
->object
.flags
& SYMMETRIC_LEFT
)
2616 } else if (revs
->graph
)
2618 else if (revs
->cherry_mark
)
2623 void put_revision_mark(const struct rev_info
*revs
, const struct commit
*commit
)
2625 char *mark
= get_revision_mark(revs
, commit
);
2628 fputs(mark
, stdout
);