10 #include "reflog-walk.h"
11 #include "patch-ids.h"
13 volatile show_early_output_fn_t show_early_output
;
15 static char *path_name(struct name_path
*path
, const char *name
)
19 int nlen
= strlen(name
);
22 for (p
= path
; p
; p
= p
->up
) {
24 len
+= p
->elem_len
+ 1;
27 m
= n
+ len
- (nlen
+ 1);
29 for (p
= path
; p
; p
= p
->up
) {
32 memcpy(m
, p
->elem
, p
->elem_len
);
39 void add_object(struct object
*obj
,
40 struct object_array
*p
,
41 struct name_path
*path
,
44 add_object_array(obj
, path_name(path
, name
), p
);
47 static void mark_blob_uninteresting(struct blob
*blob
)
49 if (blob
->object
.flags
& UNINTERESTING
)
51 blob
->object
.flags
|= UNINTERESTING
;
54 void mark_tree_uninteresting(struct tree
*tree
)
56 struct tree_desc desc
;
57 struct name_entry entry
;
58 struct object
*obj
= &tree
->object
;
60 if (obj
->flags
& UNINTERESTING
)
62 obj
->flags
|= UNINTERESTING
;
63 if (!has_sha1_file(obj
->sha1
))
65 if (parse_tree(tree
) < 0)
66 die("bad tree %s", sha1_to_hex(obj
->sha1
));
68 init_tree_desc(&desc
, tree
->buffer
, tree
->size
);
69 while (tree_entry(&desc
, &entry
)) {
70 if (S_ISDIR(entry
.mode
))
71 mark_tree_uninteresting(lookup_tree(entry
.sha1
));
73 mark_blob_uninteresting(lookup_blob(entry
.sha1
));
77 * We don't care about the tree any more
78 * after it has been marked uninteresting.
84 void mark_parents_uninteresting(struct commit
*commit
)
86 struct commit_list
*parents
= commit
->parents
;
89 struct commit
*commit
= parents
->item
;
90 if (!(commit
->object
.flags
& UNINTERESTING
)) {
91 commit
->object
.flags
|= UNINTERESTING
;
94 * Normally we haven't parsed the parent
95 * yet, so we won't have a parent of a parent
96 * here. However, it may turn out that we've
97 * reached this commit some other way (where it
98 * wasn't uninteresting), in which case we need
99 * to mark its parents recursively too..
102 mark_parents_uninteresting(commit
);
106 * A missing commit is ok iff its parent is marked
109 * We just mark such a thing parsed, so that when
110 * it is popped next time around, we won't be trying
111 * to parse it and get an error.
113 if (!has_sha1_file(commit
->object
.sha1
))
114 commit
->object
.parsed
= 1;
115 parents
= parents
->next
;
119 static void add_pending_object_with_mode(struct rev_info
*revs
, struct object
*obj
, const char *name
, unsigned mode
)
121 if (revs
->no_walk
&& (obj
->flags
& UNINTERESTING
))
122 die("object ranges do not make sense when not walking revisions");
123 if (revs
->reflog_info
&& obj
->type
== OBJ_COMMIT
&&
124 add_reflog_for_walk(revs
->reflog_info
,
125 (struct commit
*)obj
, name
))
127 add_object_array_with_mode(obj
, name
, &revs
->pending
, mode
);
130 void add_pending_object(struct rev_info
*revs
, struct object
*obj
, const char *name
)
132 add_pending_object_with_mode(revs
, obj
, name
, S_IFINVALID
);
135 static struct object
*get_reference(struct rev_info
*revs
, const char *name
, const unsigned char *sha1
, unsigned int flags
)
137 struct object
*object
;
139 object
= parse_object(sha1
);
141 die("bad object %s", name
);
142 object
->flags
|= flags
;
146 static struct commit
*handle_commit(struct rev_info
*revs
, struct object
*object
, const char *name
)
148 unsigned long flags
= object
->flags
;
151 * Tag object? Look what it points to..
153 while (object
->type
== OBJ_TAG
) {
154 struct tag
*tag
= (struct tag
*) object
;
155 if (revs
->tag_objects
&& !(flags
& UNINTERESTING
))
156 add_pending_object(revs
, object
, tag
->tag
);
157 object
= parse_object(tag
->tagged
->sha1
);
159 die("bad object %s", sha1_to_hex(tag
->tagged
->sha1
));
163 * Commit object? Just return it, we'll do all the complex
166 if (object
->type
== OBJ_COMMIT
) {
167 struct commit
*commit
= (struct commit
*)object
;
168 if (parse_commit(commit
) < 0)
169 die("unable to parse commit %s", name
);
170 if (flags
& UNINTERESTING
) {
171 commit
->object
.flags
|= UNINTERESTING
;
172 mark_parents_uninteresting(commit
);
179 * Tree object? Either mark it uniniteresting, or add it
180 * to the list of objects to look at later..
182 if (object
->type
== OBJ_TREE
) {
183 struct tree
*tree
= (struct tree
*)object
;
184 if (!revs
->tree_objects
)
186 if (flags
& UNINTERESTING
) {
187 mark_tree_uninteresting(tree
);
190 add_pending_object(revs
, object
, "");
195 * Blob object? You know the drill by now..
197 if (object
->type
== OBJ_BLOB
) {
198 struct blob
*blob
= (struct blob
*)object
;
199 if (!revs
->blob_objects
)
201 if (flags
& UNINTERESTING
) {
202 mark_blob_uninteresting(blob
);
205 add_pending_object(revs
, object
, "");
208 die("%s is unknown object", name
);
211 static int everybody_uninteresting(struct commit_list
*orig
)
213 struct commit_list
*list
= orig
;
215 struct commit
*commit
= list
->item
;
217 if (commit
->object
.flags
& UNINTERESTING
)
225 * The goal is to get REV_TREE_NEW as the result only if the
226 * diff consists of all '+' (and no other changes), and
227 * REV_TREE_DIFFERENT otherwise (of course if the trees are
228 * the same we want REV_TREE_SAME). That means that once we
229 * get to REV_TREE_DIFFERENT, we do not have to look any further.
231 static int tree_difference
= REV_TREE_SAME
;
233 static void file_add_remove(struct diff_options
*options
,
234 int addremove
, unsigned mode
,
235 const unsigned char *sha1
,
236 const char *base
, const char *path
)
238 int diff
= REV_TREE_DIFFERENT
;
241 * Is it an add of a new file? It means that the old tree
242 * didn't have it at all, so we will turn "REV_TREE_SAME" ->
243 * "REV_TREE_NEW", but leave any "REV_TREE_DIFFERENT" alone
244 * (and if it already was "REV_TREE_NEW", we'll keep it
245 * "REV_TREE_NEW" of course).
247 if (addremove
== '+') {
248 diff
= tree_difference
;
249 if (diff
!= REV_TREE_SAME
)
253 tree_difference
= diff
;
254 if (tree_difference
== REV_TREE_DIFFERENT
)
255 DIFF_OPT_SET(options
, HAS_CHANGES
);
258 static void file_change(struct diff_options
*options
,
259 unsigned old_mode
, unsigned new_mode
,
260 const unsigned char *old_sha1
,
261 const unsigned char *new_sha1
,
262 const char *base
, const char *path
)
264 tree_difference
= REV_TREE_DIFFERENT
;
265 DIFF_OPT_SET(options
, HAS_CHANGES
);
268 static int rev_compare_tree(struct rev_info
*revs
, struct tree
*t1
, struct tree
*t2
)
273 return REV_TREE_DIFFERENT
;
274 tree_difference
= REV_TREE_SAME
;
275 DIFF_OPT_CLR(&revs
->pruning
, HAS_CHANGES
);
276 if (diff_tree_sha1(t1
->object
.sha1
, t2
->object
.sha1
, "",
278 return REV_TREE_DIFFERENT
;
279 return tree_difference
;
282 static int rev_same_tree_as_empty(struct rev_info
*revs
, struct tree
*t1
)
287 struct tree_desc empty
, real
;
292 tree
= read_object_with_reference(t1
->object
.sha1
, tree_type
, &size
, NULL
);
295 init_tree_desc(&real
, tree
, size
);
296 init_tree_desc(&empty
, "", 0);
298 tree_difference
= REV_TREE_SAME
;
299 DIFF_OPT_CLR(&revs
->pruning
, HAS_CHANGES
);
300 retval
= diff_tree(&empty
, &real
, "", &revs
->pruning
);
303 return retval
>= 0 && (tree_difference
== REV_TREE_SAME
);
306 static void try_to_simplify_commit(struct rev_info
*revs
, struct commit
*commit
)
308 struct commit_list
**pp
, *parent
;
309 int tree_changed
= 0, tree_same
= 0;
312 * If we don't do pruning, everything is interesting
320 if (!commit
->parents
) {
321 if (rev_same_tree_as_empty(revs
, commit
->tree
))
322 commit
->object
.flags
|= TREESAME
;
327 * Normal non-merge commit? If we don't want to make the
328 * history dense, we consider it always to be a change..
330 if (!revs
->dense
&& !commit
->parents
->next
)
333 pp
= &commit
->parents
;
334 while ((parent
= *pp
) != NULL
) {
335 struct commit
*p
= parent
->item
;
337 if (parse_commit(p
) < 0)
338 die("cannot simplify commit %s (because of %s)",
339 sha1_to_hex(commit
->object
.sha1
),
340 sha1_to_hex(p
->object
.sha1
));
341 switch (rev_compare_tree(revs
, p
->tree
, commit
->tree
)) {
344 if (!revs
->simplify_history
|| (p
->object
.flags
& UNINTERESTING
)) {
345 /* Even if a merge with an uninteresting
346 * side branch brought the entire change
347 * we are interested in, we do not want
348 * to lose the other branches of this
349 * merge, so we just keep going.
355 commit
->parents
= parent
;
356 commit
->object
.flags
|= TREESAME
;
360 if (revs
->remove_empty_trees
&&
361 rev_same_tree_as_empty(revs
, p
->tree
)) {
362 /* We are adding all the specified
363 * paths from this parent, so the
364 * history beyond this parent is not
365 * interesting. Remove its parents
366 * (they are grandparents for us).
367 * IOW, we pretend this parent is a
370 if (parse_commit(p
) < 0)
371 die("cannot simplify commit %s (invalid %s)",
372 sha1_to_hex(commit
->object
.sha1
),
373 sha1_to_hex(p
->object
.sha1
));
377 case REV_TREE_DIFFERENT
:
382 die("bad tree compare for commit %s", sha1_to_hex(commit
->object
.sha1
));
384 if (tree_changed
&& !tree_same
)
386 commit
->object
.flags
|= TREESAME
;
389 static int add_parents_to_list(struct rev_info
*revs
, struct commit
*commit
, struct commit_list
**list
)
391 struct commit_list
*parent
= commit
->parents
;
395 if (commit
->object
.flags
& ADDED
)
397 commit
->object
.flags
|= ADDED
;
400 * If the commit is uninteresting, don't try to
401 * prune parents - we want the maximal uninteresting
404 * Normally we haven't parsed the parent
405 * yet, so we won't have a parent of a parent
406 * here. However, it may turn out that we've
407 * reached this commit some other way (where it
408 * wasn't uninteresting), in which case we need
409 * to mark its parents recursively too..
411 if (commit
->object
.flags
& UNINTERESTING
) {
413 struct commit
*p
= parent
->item
;
414 parent
= parent
->next
;
415 if (parse_commit(p
) < 0)
417 p
->object
.flags
|= UNINTERESTING
;
419 mark_parents_uninteresting(p
);
420 if (p
->object
.flags
& SEEN
)
422 p
->object
.flags
|= SEEN
;
423 insert_by_date(p
, list
);
429 * Ok, the commit wasn't uninteresting. Try to
430 * simplify the commit history and find the parent
431 * that has no differences in the path set if one exists.
433 try_to_simplify_commit(revs
, commit
);
438 left_flag
= (commit
->object
.flags
& SYMMETRIC_LEFT
);
440 rest
= !revs
->first_parent_only
;
441 for (parent
= commit
->parents
, add
= 1; parent
; add
= rest
) {
442 struct commit
*p
= parent
->item
;
444 parent
= parent
->next
;
445 if (parse_commit(p
) < 0)
447 p
->object
.flags
|= left_flag
;
448 if (p
->object
.flags
& SEEN
)
450 p
->object
.flags
|= SEEN
;
452 insert_by_date(p
, list
);
457 static void cherry_pick_list(struct commit_list
*list
, struct rev_info
*revs
)
459 struct commit_list
*p
;
460 int left_count
= 0, right_count
= 0;
462 struct patch_ids ids
;
464 /* First count the commits on the left and on the right */
465 for (p
= list
; p
; p
= p
->next
) {
466 struct commit
*commit
= p
->item
;
467 unsigned flags
= commit
->object
.flags
;
468 if (flags
& BOUNDARY
)
470 else if (flags
& SYMMETRIC_LEFT
)
476 left_first
= left_count
< right_count
;
477 init_patch_ids(&ids
);
478 if (revs
->diffopt
.nr_paths
) {
479 ids
.diffopts
.nr_paths
= revs
->diffopt
.nr_paths
;
480 ids
.diffopts
.paths
= revs
->diffopt
.paths
;
481 ids
.diffopts
.pathlens
= revs
->diffopt
.pathlens
;
484 /* Compute patch-ids for one side */
485 for (p
= list
; p
; p
= p
->next
) {
486 struct commit
*commit
= p
->item
;
487 unsigned flags
= commit
->object
.flags
;
489 if (flags
& BOUNDARY
)
492 * If we have fewer left, left_first is set and we omit
493 * commits on the right branch in this loop. If we have
494 * fewer right, we skip the left ones.
496 if (left_first
!= !!(flags
& SYMMETRIC_LEFT
))
498 commit
->util
= add_commit_patch_id(commit
, &ids
);
501 /* Check the other side */
502 for (p
= list
; p
; p
= p
->next
) {
503 struct commit
*commit
= p
->item
;
505 unsigned flags
= commit
->object
.flags
;
507 if (flags
& BOUNDARY
)
510 * If we have fewer left, left_first is set and we omit
511 * commits on the left branch in this loop.
513 if (left_first
== !!(flags
& SYMMETRIC_LEFT
))
517 * Have we seen the same patch id?
519 id
= has_commit_patch_id(commit
, &ids
);
523 commit
->object
.flags
|= SHOWN
;
526 /* Now check the original side for seen ones */
527 for (p
= list
; p
; p
= p
->next
) {
528 struct commit
*commit
= p
->item
;
529 struct patch_id
*ent
;
535 commit
->object
.flags
|= SHOWN
;
539 free_patch_ids(&ids
);
542 static int limit_list(struct rev_info
*revs
)
544 struct commit_list
*list
= revs
->commits
;
545 struct commit_list
*newlist
= NULL
;
546 struct commit_list
**p
= &newlist
;
549 struct commit_list
*entry
= list
;
550 struct commit
*commit
= list
->item
;
551 struct object
*obj
= &commit
->object
;
552 show_early_output_fn_t show
;
557 if (revs
->max_age
!= -1 && (commit
->date
< revs
->max_age
))
558 obj
->flags
|= UNINTERESTING
;
559 if (add_parents_to_list(revs
, commit
, &list
) < 0)
561 if (obj
->flags
& UNINTERESTING
) {
562 mark_parents_uninteresting(commit
);
563 if (everybody_uninteresting(list
))
567 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
))
569 p
= &commit_list_insert(commit
, p
)->next
;
571 show
= show_early_output
;
576 show_early_output
= NULL
;
578 if (revs
->cherry_pick
)
579 cherry_pick_list(newlist
, revs
);
581 revs
->commits
= newlist
;
587 int warned_bad_reflog
;
588 struct rev_info
*all_revs
;
589 const char *name_for_errormsg
;
592 static int handle_one_ref(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
594 struct all_refs_cb
*cb
= cb_data
;
595 struct object
*object
= get_reference(cb
->all_revs
, path
, sha1
,
597 add_pending_object(cb
->all_revs
, object
, path
);
601 static void handle_all(struct rev_info
*revs
, unsigned flags
)
603 struct all_refs_cb cb
;
605 cb
.all_flags
= flags
;
606 for_each_ref(handle_one_ref
, &cb
);
609 static void handle_one_reflog_commit(unsigned char *sha1
, void *cb_data
)
611 struct all_refs_cb
*cb
= cb_data
;
612 if (!is_null_sha1(sha1
)) {
613 struct object
*o
= parse_object(sha1
);
615 o
->flags
|= cb
->all_flags
;
616 add_pending_object(cb
->all_revs
, o
, "");
618 else if (!cb
->warned_bad_reflog
) {
619 warning("reflog of '%s' references pruned commits",
620 cb
->name_for_errormsg
);
621 cb
->warned_bad_reflog
= 1;
626 static int handle_one_reflog_ent(unsigned char *osha1
, unsigned char *nsha1
,
627 const char *email
, unsigned long timestamp
, int tz
,
628 const char *message
, void *cb_data
)
630 handle_one_reflog_commit(osha1
, cb_data
);
631 handle_one_reflog_commit(nsha1
, cb_data
);
635 static int handle_one_reflog(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
637 struct all_refs_cb
*cb
= cb_data
;
638 cb
->warned_bad_reflog
= 0;
639 cb
->name_for_errormsg
= path
;
640 for_each_reflog_ent(path
, handle_one_reflog_ent
, cb_data
);
644 static void handle_reflog(struct rev_info
*revs
, unsigned flags
)
646 struct all_refs_cb cb
;
648 cb
.all_flags
= flags
;
649 for_each_reflog(handle_one_reflog
, &cb
);
652 static int add_parents_only(struct rev_info
*revs
, const char *arg
, int flags
)
654 unsigned char sha1
[20];
656 struct commit
*commit
;
657 struct commit_list
*parents
;
660 flags
^= UNINTERESTING
;
663 if (get_sha1(arg
, sha1
))
666 it
= get_reference(revs
, arg
, sha1
, 0);
667 if (it
->type
!= OBJ_TAG
)
669 hashcpy(sha1
, ((struct tag
*)it
)->tagged
->sha1
);
671 if (it
->type
!= OBJ_COMMIT
)
673 commit
= (struct commit
*)it
;
674 for (parents
= commit
->parents
; parents
; parents
= parents
->next
) {
675 it
= &parents
->item
->object
;
677 add_pending_object(revs
, it
, arg
);
682 void init_revisions(struct rev_info
*revs
, const char *prefix
)
684 memset(revs
, 0, sizeof(*revs
));
686 revs
->abbrev
= DEFAULT_ABBREV
;
687 revs
->ignore_merges
= 1;
688 revs
->simplify_history
= 1;
689 DIFF_OPT_SET(&revs
->pruning
, RECURSIVE
);
690 DIFF_OPT_SET(&revs
->pruning
, QUIET
);
691 revs
->pruning
.add_remove
= file_add_remove
;
692 revs
->pruning
.change
= file_change
;
695 revs
->prefix
= prefix
;
698 revs
->skip_count
= -1;
699 revs
->max_count
= -1;
701 revs
->commit_format
= CMIT_FMT_DEFAULT
;
703 diff_setup(&revs
->diffopt
);
706 static void add_pending_commit_list(struct rev_info
*revs
,
707 struct commit_list
*commit_list
,
710 while (commit_list
) {
711 struct object
*object
= &commit_list
->item
->object
;
712 object
->flags
|= flags
;
713 add_pending_object(revs
, object
, sha1_to_hex(object
->sha1
));
714 commit_list
= commit_list
->next
;
718 static void prepare_show_merge(struct rev_info
*revs
)
720 struct commit_list
*bases
;
721 struct commit
*head
, *other
;
722 unsigned char sha1
[20];
723 const char **prune
= NULL
;
724 int i
, prune_num
= 1; /* counting terminating NULL */
726 if (get_sha1("HEAD", sha1
) || !(head
= lookup_commit(sha1
)))
727 die("--merge without HEAD?");
728 if (get_sha1("MERGE_HEAD", sha1
) || !(other
= lookup_commit(sha1
)))
729 die("--merge without MERGE_HEAD?");
730 add_pending_object(revs
, &head
->object
, "HEAD");
731 add_pending_object(revs
, &other
->object
, "MERGE_HEAD");
732 bases
= get_merge_bases(head
, other
, 1);
734 struct commit
*it
= bases
->item
;
735 struct commit_list
*n
= bases
->next
;
738 it
->object
.flags
|= UNINTERESTING
;
739 add_pending_object(revs
, &it
->object
, "(merge-base)");
744 for (i
= 0; i
< active_nr
; i
++) {
745 struct cache_entry
*ce
= active_cache
[i
];
748 if (ce_path_match(ce
, revs
->prune_data
)) {
750 prune
= xrealloc(prune
, sizeof(*prune
) * prune_num
);
751 prune
[prune_num
-2] = ce
->name
;
752 prune
[prune_num
-1] = NULL
;
754 while ((i
+1 < active_nr
) &&
755 ce_same_name(ce
, active_cache
[i
+1]))
758 revs
->prune_data
= prune
;
761 int handle_revision_arg(const char *arg
, struct rev_info
*revs
,
763 int cant_be_filename
)
767 struct object
*object
;
768 unsigned char sha1
[20];
771 dotdot
= strstr(arg
, "..");
773 unsigned char from_sha1
[20];
774 const char *next
= dotdot
+ 2;
775 const char *this = arg
;
776 int symmetric
= *next
== '.';
777 unsigned int flags_exclude
= flags
^ UNINTERESTING
;
786 if (!get_sha1(this, from_sha1
) &&
787 !get_sha1(next
, sha1
)) {
788 struct commit
*a
, *b
;
789 struct commit_list
*exclude
;
791 a
= lookup_commit_reference(from_sha1
);
792 b
= lookup_commit_reference(sha1
);
795 "Invalid symmetric difference expression %s...%s" :
796 "Invalid revision range %s..%s",
800 if (!cant_be_filename
) {
802 verify_non_filename(revs
->prefix
, arg
);
806 exclude
= get_merge_bases(a
, b
, 1);
807 add_pending_commit_list(revs
, exclude
,
809 free_commit_list(exclude
);
810 a
->object
.flags
|= flags
| SYMMETRIC_LEFT
;
812 a
->object
.flags
|= flags_exclude
;
813 b
->object
.flags
|= flags
;
814 add_pending_object(revs
, &a
->object
, this);
815 add_pending_object(revs
, &b
->object
, next
);
820 dotdot
= strstr(arg
, "^@");
821 if (dotdot
&& !dotdot
[2]) {
823 if (add_parents_only(revs
, arg
, flags
))
827 dotdot
= strstr(arg
, "^!");
828 if (dotdot
&& !dotdot
[2]) {
830 if (!add_parents_only(revs
, arg
, flags
^ UNINTERESTING
))
836 local_flags
= UNINTERESTING
;
839 if (get_sha1_with_mode(arg
, sha1
, &mode
))
841 if (!cant_be_filename
)
842 verify_non_filename(revs
->prefix
, arg
);
843 object
= get_reference(revs
, arg
, sha1
, flags
^ local_flags
);
844 add_pending_object_with_mode(revs
, object
, arg
, mode
);
848 static void add_grep(struct rev_info
*revs
, const char *ptn
, enum grep_pat_token what
)
850 if (!revs
->grep_filter
) {
851 struct grep_opt
*opt
= xcalloc(1, sizeof(*opt
));
852 opt
->status_only
= 1;
853 opt
->pattern_tail
= &(opt
->pattern_list
);
854 opt
->regflags
= REG_NEWLINE
;
855 revs
->grep_filter
= opt
;
857 append_grep_pattern(revs
->grep_filter
, ptn
,
858 "command line", 0, what
);
861 static void add_header_grep(struct rev_info
*revs
, const char *field
, const char *pattern
)
867 fldlen
= strlen(field
);
868 patlen
= strlen(pattern
);
869 pat
= xmalloc(patlen
+ fldlen
+ 10);
871 if (*pattern
== '^') {
875 sprintf(pat
, "^%s %s%s", field
, prefix
, pattern
);
876 add_grep(revs
, pat
, GREP_PATTERN_HEAD
);
879 static void add_message_grep(struct rev_info
*revs
, const char *pattern
)
881 add_grep(revs
, pattern
, GREP_PATTERN_BODY
);
884 static void add_ignore_packed(struct rev_info
*revs
, const char *name
)
886 int num
= ++revs
->num_ignore_packed
;
888 revs
->ignore_packed
= xrealloc(revs
->ignore_packed
,
889 sizeof(const char **) * (num
+ 1));
890 revs
->ignore_packed
[num
-1] = name
;
891 revs
->ignore_packed
[num
] = NULL
;
895 * Parse revision information, filling in the "rev_info" structure,
896 * and removing the used arguments from the argument list.
898 * Returns the number of arguments left that weren't recognized
899 * (which are also moved to the head of the argument list)
901 int setup_revisions(int argc
, const char **argv
, struct rev_info
*revs
, const char *def
)
903 int i
, flags
, seen_dashdash
, show_merge
;
904 const char **unrecognized
= argv
+ 1;
909 /* First, search for "--" */
911 for (i
= 1; i
< argc
; i
++) {
912 const char *arg
= argv
[i
];
913 if (strcmp(arg
, "--"))
918 revs
->prune_data
= get_pathspec(revs
->prefix
, argv
+ i
+ 1);
923 flags
= show_merge
= 0;
924 for (i
= 1; i
< argc
; i
++) {
925 const char *arg
= argv
[i
];
928 if (!prefixcmp(arg
, "--max-count=")) {
929 revs
->max_count
= atoi(arg
+ 12);
932 if (!prefixcmp(arg
, "--skip=")) {
933 revs
->skip_count
= atoi(arg
+ 7);
936 /* accept -<digit>, like traditional "head" */
937 if ((*arg
== '-') && isdigit(arg
[1])) {
938 revs
->max_count
= atoi(arg
+ 1);
941 if (!strcmp(arg
, "-n")) {
943 die("-n requires an argument");
944 revs
->max_count
= atoi(argv
[++i
]);
947 if (!prefixcmp(arg
, "-n")) {
948 revs
->max_count
= atoi(arg
+ 2);
951 if (!prefixcmp(arg
, "--max-age=")) {
952 revs
->max_age
= atoi(arg
+ 10);
955 if (!prefixcmp(arg
, "--since=")) {
956 revs
->max_age
= approxidate(arg
+ 8);
959 if (!prefixcmp(arg
, "--after=")) {
960 revs
->max_age
= approxidate(arg
+ 8);
963 if (!prefixcmp(arg
, "--min-age=")) {
964 revs
->min_age
= atoi(arg
+ 10);
967 if (!prefixcmp(arg
, "--before=")) {
968 revs
->min_age
= approxidate(arg
+ 9);
971 if (!prefixcmp(arg
, "--until=")) {
972 revs
->min_age
= approxidate(arg
+ 8);
975 if (!strcmp(arg
, "--all")) {
976 handle_all(revs
, flags
);
979 if (!strcmp(arg
, "--first-parent")) {
980 revs
->first_parent_only
= 1;
983 if (!strcmp(arg
, "--reflog")) {
984 handle_reflog(revs
, flags
);
987 if (!strcmp(arg
, "-g") ||
988 !strcmp(arg
, "--walk-reflogs")) {
989 init_reflog_walk(&revs
->reflog_info
);
992 if (!strcmp(arg
, "--not")) {
993 flags
^= UNINTERESTING
;
996 if (!strcmp(arg
, "--default")) {
998 die("bad --default argument");
1002 if (!strcmp(arg
, "--merge")) {
1006 if (!strcmp(arg
, "--topo-order")) {
1007 revs
->topo_order
= 1;
1010 if (!strcmp(arg
, "--date-order")) {
1012 revs
->topo_order
= 1;
1015 if (!prefixcmp(arg
, "--early-output")) {
1019 count
= atoi(arg
+15);
1022 revs
->topo_order
= 1;
1023 revs
->early_output
= count
;
1027 if (!strcmp(arg
, "--parents")) {
1031 if (!strcmp(arg
, "--dense")) {
1035 if (!strcmp(arg
, "--sparse")) {
1039 if (!strcmp(arg
, "--remove-empty")) {
1040 revs
->remove_empty_trees
= 1;
1043 if (!strcmp(arg
, "--no-merges")) {
1044 revs
->no_merges
= 1;
1047 if (!strcmp(arg
, "--boundary")) {
1051 if (!strcmp(arg
, "--left-right")) {
1052 revs
->left_right
= 1;
1055 if (!strcmp(arg
, "--cherry-pick")) {
1056 revs
->cherry_pick
= 1;
1060 if (!strcmp(arg
, "--objects")) {
1061 revs
->tag_objects
= 1;
1062 revs
->tree_objects
= 1;
1063 revs
->blob_objects
= 1;
1066 if (!strcmp(arg
, "--objects-edge")) {
1067 revs
->tag_objects
= 1;
1068 revs
->tree_objects
= 1;
1069 revs
->blob_objects
= 1;
1070 revs
->edge_hint
= 1;
1073 if (!strcmp(arg
, "--unpacked")) {
1075 free(revs
->ignore_packed
);
1076 revs
->ignore_packed
= NULL
;
1077 revs
->num_ignore_packed
= 0;
1080 if (!prefixcmp(arg
, "--unpacked=")) {
1082 add_ignore_packed(revs
, arg
+11);
1085 if (!strcmp(arg
, "-r")) {
1087 DIFF_OPT_SET(&revs
->diffopt
, RECURSIVE
);
1090 if (!strcmp(arg
, "-t")) {
1092 DIFF_OPT_SET(&revs
->diffopt
, RECURSIVE
);
1093 DIFF_OPT_SET(&revs
->diffopt
, TREE_IN_RECURSIVE
);
1096 if (!strcmp(arg
, "-m")) {
1097 revs
->ignore_merges
= 0;
1100 if (!strcmp(arg
, "-c")) {
1102 revs
->dense_combined_merges
= 0;
1103 revs
->combine_merges
= 1;
1106 if (!strcmp(arg
, "--cc")) {
1108 revs
->dense_combined_merges
= 1;
1109 revs
->combine_merges
= 1;
1112 if (!strcmp(arg
, "-v")) {
1113 revs
->verbose_header
= 1;
1116 if (!prefixcmp(arg
, "--pretty")) {
1117 revs
->verbose_header
= 1;
1118 revs
->commit_format
= get_commit_format(arg
+8);
1121 if (!strcmp(arg
, "--root")) {
1122 revs
->show_root_diff
= 1;
1125 if (!strcmp(arg
, "--no-commit-id")) {
1126 revs
->no_commit_id
= 1;
1129 if (!strcmp(arg
, "--always")) {
1130 revs
->always_show_header
= 1;
1133 if (!strcmp(arg
, "--no-abbrev")) {
1137 if (!strcmp(arg
, "--abbrev")) {
1138 revs
->abbrev
= DEFAULT_ABBREV
;
1141 if (!prefixcmp(arg
, "--abbrev=")) {
1142 revs
->abbrev
= strtoul(arg
+ 9, NULL
, 10);
1143 if (revs
->abbrev
< MINIMUM_ABBREV
)
1144 revs
->abbrev
= MINIMUM_ABBREV
;
1145 else if (revs
->abbrev
> 40)
1149 if (!strcmp(arg
, "--abbrev-commit")) {
1150 revs
->abbrev_commit
= 1;
1153 if (!strcmp(arg
, "--full-diff")) {
1155 revs
->full_diff
= 1;
1158 if (!strcmp(arg
, "--full-history")) {
1159 revs
->simplify_history
= 0;
1162 if (!strcmp(arg
, "--relative-date")) {
1163 revs
->date_mode
= DATE_RELATIVE
;
1166 if (!strncmp(arg
, "--date=", 7)) {
1167 revs
->date_mode
= parse_date_format(arg
+ 7);
1170 if (!strcmp(arg
, "--log-size")) {
1171 revs
->show_log_size
= 1;
1176 * Grepping the commit log
1178 if (!prefixcmp(arg
, "--author=")) {
1179 add_header_grep(revs
, "author", arg
+9);
1182 if (!prefixcmp(arg
, "--committer=")) {
1183 add_header_grep(revs
, "committer", arg
+12);
1186 if (!prefixcmp(arg
, "--grep=")) {
1187 add_message_grep(revs
, arg
+7);
1190 if (!strcmp(arg
, "--extended-regexp") ||
1191 !strcmp(arg
, "-E")) {
1192 regflags
|= REG_EXTENDED
;
1195 if (!strcmp(arg
, "--regexp-ignore-case") ||
1196 !strcmp(arg
, "-i")) {
1197 regflags
|= REG_ICASE
;
1200 if (!strcmp(arg
, "--all-match")) {
1204 if (!prefixcmp(arg
, "--encoding=")) {
1206 if (strcmp(arg
, "none"))
1207 git_log_output_encoding
= xstrdup(arg
);
1209 git_log_output_encoding
= "";
1212 if (!strcmp(arg
, "--reverse")) {
1216 if (!strcmp(arg
, "--no-walk")) {
1220 if (!strcmp(arg
, "--do-walk")) {
1225 opts
= diff_opt_parse(&revs
->diffopt
, argv
+i
, argc
-i
);
1230 *unrecognized
++ = arg
;
1235 if (handle_revision_arg(arg
, revs
, flags
, seen_dashdash
)) {
1237 if (seen_dashdash
|| *arg
== '^')
1238 die("bad revision '%s'", arg
);
1240 /* If we didn't have a "--":
1241 * (1) all filenames must exist;
1242 * (2) all rev-args must not be interpretable
1243 * as a valid filename.
1244 * but the latter we have checked in the main loop.
1246 for (j
= i
; j
< argc
; j
++)
1247 verify_filename(revs
->prefix
, argv
[j
]);
1249 revs
->prune_data
= get_pathspec(revs
->prefix
,
1255 if (revs
->grep_filter
)
1256 revs
->grep_filter
->regflags
|= regflags
;
1259 prepare_show_merge(revs
);
1260 if (def
&& !revs
->pending
.nr
) {
1261 unsigned char sha1
[20];
1262 struct object
*object
;
1264 if (get_sha1_with_mode(def
, sha1
, &mode
))
1265 die("bad default revision '%s'", def
);
1266 object
= get_reference(revs
, def
, sha1
, 0);
1267 add_pending_object_with_mode(revs
, object
, def
, mode
);
1270 /* Did the user ask for any diff output? Run the diff! */
1271 if (revs
->diffopt
.output_format
& ~DIFF_FORMAT_NO_OUTPUT
)
1274 /* Pickaxe and rename following needs diffs */
1275 if (revs
->diffopt
.pickaxe
|| DIFF_OPT_TST(&revs
->diffopt
, FOLLOW_RENAMES
))
1278 if (revs
->topo_order
)
1281 if (revs
->prune_data
) {
1282 diff_tree_setup_paths(revs
->prune_data
, &revs
->pruning
);
1283 /* Can't prune commits with rename following: the paths change.. */
1284 if (!DIFF_OPT_TST(&revs
->diffopt
, FOLLOW_RENAMES
))
1286 if (!revs
->full_diff
)
1287 diff_tree_setup_paths(revs
->prune_data
, &revs
->diffopt
);
1289 if (revs
->combine_merges
) {
1290 revs
->ignore_merges
= 0;
1291 if (revs
->dense_combined_merges
&& !revs
->diffopt
.output_format
)
1292 revs
->diffopt
.output_format
= DIFF_FORMAT_PATCH
;
1294 revs
->diffopt
.abbrev
= revs
->abbrev
;
1295 if (diff_setup_done(&revs
->diffopt
) < 0)
1296 die("diff_setup_done failed");
1298 if (revs
->grep_filter
) {
1299 revs
->grep_filter
->all_match
= all_match
;
1300 compile_grep_patterns(revs
->grep_filter
);
1303 if (revs
->reverse
&& revs
->reflog_info
)
1304 die("cannot combine --reverse with --walk-reflogs");
1309 int prepare_revision_walk(struct rev_info
*revs
)
1311 int nr
= revs
->pending
.nr
;
1312 struct object_array_entry
*e
, *list
;
1314 e
= list
= revs
->pending
.objects
;
1315 revs
->pending
.nr
= 0;
1316 revs
->pending
.alloc
= 0;
1317 revs
->pending
.objects
= NULL
;
1319 struct commit
*commit
= handle_commit(revs
, e
->item
, e
->name
);
1321 if (!(commit
->object
.flags
& SEEN
)) {
1322 commit
->object
.flags
|= SEEN
;
1323 insert_by_date(commit
, &revs
->commits
);
1333 if (limit_list(revs
) < 0)
1335 if (revs
->topo_order
)
1336 sort_in_topological_order(&revs
->commits
, revs
->lifo
);
1340 enum rewrite_result
{
1342 rewrite_one_noparents
,
1346 static enum rewrite_result
rewrite_one(struct rev_info
*revs
, struct commit
**pp
)
1349 struct commit
*p
= *pp
;
1351 if (add_parents_to_list(revs
, p
, &revs
->commits
) < 0)
1352 return rewrite_one_error
;
1353 if (p
->parents
&& p
->parents
->next
)
1354 return rewrite_one_ok
;
1355 if (p
->object
.flags
& UNINTERESTING
)
1356 return rewrite_one_ok
;
1357 if (!(p
->object
.flags
& TREESAME
))
1358 return rewrite_one_ok
;
1360 return rewrite_one_noparents
;
1361 *pp
= p
->parents
->item
;
1365 static void remove_duplicate_parents(struct commit
*commit
)
1367 struct commit_list
**pp
, *p
;
1369 /* Examine existing parents while marking ones we have seen... */
1370 pp
= &commit
->parents
;
1371 while ((p
= *pp
) != NULL
) {
1372 struct commit
*parent
= p
->item
;
1373 if (parent
->object
.flags
& TMP_MARK
) {
1377 parent
->object
.flags
|= TMP_MARK
;
1380 /* ... and clear the temporary mark */
1381 for (p
= commit
->parents
; p
; p
= p
->next
)
1382 p
->item
->object
.flags
&= ~TMP_MARK
;
1385 static int rewrite_parents(struct rev_info
*revs
, struct commit
*commit
)
1387 struct commit_list
**pp
= &commit
->parents
;
1389 struct commit_list
*parent
= *pp
;
1390 switch (rewrite_one(revs
, &parent
->item
)) {
1391 case rewrite_one_ok
:
1393 case rewrite_one_noparents
:
1396 case rewrite_one_error
:
1401 remove_duplicate_parents(commit
);
1405 static int commit_match(struct commit
*commit
, struct rev_info
*opt
)
1407 if (!opt
->grep_filter
)
1409 return grep_buffer(opt
->grep_filter
,
1410 NULL
, /* we say nothing, not even filename */
1411 commit
->buffer
, strlen(commit
->buffer
));
1414 enum commit_action
simplify_commit(struct rev_info
*revs
, struct commit
*commit
)
1416 if (commit
->object
.flags
& SHOWN
)
1417 return commit_ignore
;
1418 if (revs
->unpacked
&& has_sha1_pack(commit
->object
.sha1
, revs
->ignore_packed
))
1419 return commit_ignore
;
1420 if (commit
->object
.flags
& UNINTERESTING
)
1421 return commit_ignore
;
1422 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
))
1423 return commit_ignore
;
1424 if (revs
->no_merges
&& commit
->parents
&& commit
->parents
->next
)
1425 return commit_ignore
;
1426 if (!commit_match(commit
, revs
))
1427 return commit_ignore
;
1428 if (revs
->prune
&& revs
->dense
) {
1429 /* Commit without changes? */
1430 if (commit
->object
.flags
& TREESAME
) {
1431 /* drop merges unless we want parenthood */
1433 return commit_ignore
;
1434 /* non-merge - always ignore it */
1435 if (!commit
->parents
|| !commit
->parents
->next
)
1436 return commit_ignore
;
1438 if (revs
->parents
&& rewrite_parents(revs
, commit
) < 0)
1439 return commit_error
;
1444 static struct commit
*get_revision_1(struct rev_info
*revs
)
1450 struct commit_list
*entry
= revs
->commits
;
1451 struct commit
*commit
= entry
->item
;
1453 revs
->commits
= entry
->next
;
1456 if (revs
->reflog_info
)
1457 fake_reflog_parent(revs
->reflog_info
, commit
);
1460 * If we haven't done the list limiting, we need to look at
1461 * the parents here. We also need to do the date-based limiting
1462 * that we'd otherwise have done in limit_list().
1464 if (!revs
->limited
) {
1465 if (revs
->max_age
!= -1 &&
1466 (commit
->date
< revs
->max_age
))
1468 if (add_parents_to_list(revs
, commit
, &revs
->commits
) < 0)
1472 switch (simplify_commit(revs
, commit
)) {
1480 } while (revs
->commits
);
1484 static void gc_boundary(struct object_array
*array
)
1486 unsigned nr
= array
->nr
;
1487 unsigned alloc
= array
->alloc
;
1488 struct object_array_entry
*objects
= array
->objects
;
1492 for (i
= j
= 0; i
< nr
; i
++) {
1493 if (objects
[i
].item
->flags
& SHOWN
)
1496 objects
[j
] = objects
[i
];
1499 for (i
= j
; i
< nr
; i
++)
1500 objects
[i
].item
= NULL
;
1505 struct commit
*get_revision(struct rev_info
*revs
)
1507 struct commit
*c
= NULL
;
1508 struct commit_list
*l
;
1510 if (revs
->boundary
== 2) {
1512 struct object_array
*array
= &revs
->boundary_commits
;
1513 struct object_array_entry
*objects
= array
->objects
;
1514 for (i
= 0; i
< array
->nr
; i
++) {
1515 c
= (struct commit
*)(objects
[i
].item
);
1518 if (!(c
->object
.flags
& CHILD_SHOWN
))
1520 if (!(c
->object
.flags
& SHOWN
))
1526 c
->object
.flags
|= SHOWN
| BOUNDARY
;
1530 if (revs
->reverse
) {
1533 if (0 <= revs
->max_count
) {
1534 limit
= revs
->max_count
;
1535 if (0 < revs
->skip_count
)
1536 limit
+= revs
->skip_count
;
1539 while ((c
= get_revision_1(revs
))) {
1540 commit_list_insert(c
, &l
);
1541 if ((0 < limit
) && !--limit
)
1546 revs
->max_count
= -1;
1551 * Now pick up what they want to give us
1553 c
= get_revision_1(revs
);
1555 while (0 < revs
->skip_count
) {
1557 c
= get_revision_1(revs
);
1564 * Check the max_count.
1566 switch (revs
->max_count
) {
1577 c
->object
.flags
|= SHOWN
;
1579 if (!revs
->boundary
) {
1585 * get_revision_1() runs out the commits, and
1586 * we are done computing the boundaries.
1587 * switch to boundary commits output mode.
1590 return get_revision(revs
);
1594 * boundary commits are the commits that are parents of the
1595 * ones we got from get_revision_1() but they themselves are
1596 * not returned from get_revision_1(). Before returning
1597 * 'c', we need to mark its parents that they could be boundaries.
1600 for (l
= c
->parents
; l
; l
= l
->next
) {
1602 p
= &(l
->item
->object
);
1603 if (p
->flags
& (CHILD_SHOWN
| SHOWN
))
1605 p
->flags
|= CHILD_SHOWN
;
1606 gc_boundary(&revs
->boundary_commits
);
1607 add_object_array(p
, NULL
, &revs
->boundary_commits
);