11 #include "reflog-walk.h"
12 #include "patch-ids.h"
14 volatile show_early_output_fn_t show_early_output
;
16 static char *path_name(struct name_path
*path
, const char *name
)
20 int nlen
= strlen(name
);
23 for (p
= path
; p
; p
= p
->up
) {
25 len
+= p
->elem_len
+ 1;
28 m
= n
+ len
- (nlen
+ 1);
30 for (p
= path
; p
; p
= p
->up
) {
33 memcpy(m
, p
->elem
, p
->elem_len
);
40 void add_object(struct object
*obj
,
41 struct object_array
*p
,
42 struct name_path
*path
,
45 add_object_array(obj
, path_name(path
, name
), p
);
48 static void mark_blob_uninteresting(struct blob
*blob
)
52 if (blob
->object
.flags
& UNINTERESTING
)
54 blob
->object
.flags
|= UNINTERESTING
;
57 void mark_tree_uninteresting(struct tree
*tree
)
59 struct tree_desc desc
;
60 struct name_entry entry
;
61 struct object
*obj
= &tree
->object
;
65 if (obj
->flags
& UNINTERESTING
)
67 obj
->flags
|= UNINTERESTING
;
68 if (!has_sha1_file(obj
->sha1
))
70 if (parse_tree(tree
) < 0)
71 die("bad tree %s", sha1_to_hex(obj
->sha1
));
73 init_tree_desc(&desc
, tree
->buffer
, tree
->size
);
74 while (tree_entry(&desc
, &entry
)) {
75 switch (object_type(entry
.mode
)) {
77 mark_tree_uninteresting(lookup_tree(entry
.sha1
));
80 mark_blob_uninteresting(lookup_blob(entry
.sha1
));
83 /* Subproject commit - not in this repository */
89 * We don't care about the tree any more
90 * after it has been marked uninteresting.
96 void mark_parents_uninteresting(struct commit
*commit
)
98 struct commit_list
*parents
= commit
->parents
;
101 struct commit
*commit
= parents
->item
;
102 if (!(commit
->object
.flags
& UNINTERESTING
)) {
103 commit
->object
.flags
|= UNINTERESTING
;
106 * Normally we haven't parsed the parent
107 * yet, so we won't have a parent of a parent
108 * here. However, it may turn out that we've
109 * reached this commit some other way (where it
110 * wasn't uninteresting), in which case we need
111 * to mark its parents recursively too..
114 mark_parents_uninteresting(commit
);
118 * A missing commit is ok iff its parent is marked
121 * We just mark such a thing parsed, so that when
122 * it is popped next time around, we won't be trying
123 * to parse it and get an error.
125 if (!has_sha1_file(commit
->object
.sha1
))
126 commit
->object
.parsed
= 1;
127 parents
= parents
->next
;
131 static void add_pending_object_with_mode(struct rev_info
*revs
, struct object
*obj
, const char *name
, unsigned mode
)
133 if (revs
->no_walk
&& (obj
->flags
& UNINTERESTING
))
134 die("object ranges do not make sense when not walking revisions");
135 if (revs
->reflog_info
&& obj
->type
== OBJ_COMMIT
&&
136 add_reflog_for_walk(revs
->reflog_info
,
137 (struct commit
*)obj
, name
))
139 add_object_array_with_mode(obj
, name
, &revs
->pending
, mode
);
142 void add_pending_object(struct rev_info
*revs
, struct object
*obj
, const char *name
)
144 add_pending_object_with_mode(revs
, obj
, name
, S_IFINVALID
);
147 void add_head_to_pending(struct rev_info
*revs
)
149 unsigned char sha1
[20];
151 if (get_sha1("HEAD", sha1
))
153 obj
= parse_object(sha1
);
156 add_pending_object(revs
, obj
, "HEAD");
159 static struct object
*get_reference(struct rev_info
*revs
, const char *name
, const unsigned char *sha1
, unsigned int flags
)
161 struct object
*object
;
163 object
= parse_object(sha1
);
165 die("bad object %s", name
);
166 object
->flags
|= flags
;
170 static struct commit
*handle_commit(struct rev_info
*revs
, struct object
*object
, const char *name
)
172 unsigned long flags
= object
->flags
;
175 * Tag object? Look what it points to..
177 while (object
->type
== OBJ_TAG
) {
178 struct tag
*tag
= (struct tag
*) object
;
179 if (revs
->tag_objects
&& !(flags
& UNINTERESTING
))
180 add_pending_object(revs
, object
, tag
->tag
);
183 object
= parse_object(tag
->tagged
->sha1
);
185 die("bad object %s", sha1_to_hex(tag
->tagged
->sha1
));
189 * Commit object? Just return it, we'll do all the complex
192 if (object
->type
== OBJ_COMMIT
) {
193 struct commit
*commit
= (struct commit
*)object
;
194 if (parse_commit(commit
) < 0)
195 die("unable to parse commit %s", name
);
196 if (flags
& UNINTERESTING
) {
197 commit
->object
.flags
|= UNINTERESTING
;
198 mark_parents_uninteresting(commit
);
205 * Tree object? Either mark it uniniteresting, or add it
206 * to the list of objects to look at later..
208 if (object
->type
== OBJ_TREE
) {
209 struct tree
*tree
= (struct tree
*)object
;
210 if (!revs
->tree_objects
)
212 if (flags
& UNINTERESTING
) {
213 mark_tree_uninteresting(tree
);
216 add_pending_object(revs
, object
, "");
221 * Blob object? You know the drill by now..
223 if (object
->type
== OBJ_BLOB
) {
224 struct blob
*blob
= (struct blob
*)object
;
225 if (!revs
->blob_objects
)
227 if (flags
& UNINTERESTING
) {
228 mark_blob_uninteresting(blob
);
231 add_pending_object(revs
, object
, "");
234 die("%s is unknown object", name
);
237 static int everybody_uninteresting(struct commit_list
*orig
)
239 struct commit_list
*list
= orig
;
241 struct commit
*commit
= list
->item
;
243 if (commit
->object
.flags
& UNINTERESTING
)
251 * The goal is to get REV_TREE_NEW as the result only if the
252 * diff consists of all '+' (and no other changes), and
253 * REV_TREE_DIFFERENT otherwise (of course if the trees are
254 * the same we want REV_TREE_SAME). That means that once we
255 * get to REV_TREE_DIFFERENT, we do not have to look any further.
257 static int tree_difference
= REV_TREE_SAME
;
259 static void file_add_remove(struct diff_options
*options
,
260 int addremove
, unsigned mode
,
261 const unsigned char *sha1
,
262 const char *base
, const char *path
)
264 int diff
= REV_TREE_DIFFERENT
;
267 * Is it an add of a new file? It means that the old tree
268 * didn't have it at all, so we will turn "REV_TREE_SAME" ->
269 * "REV_TREE_NEW", but leave any "REV_TREE_DIFFERENT" alone
270 * (and if it already was "REV_TREE_NEW", we'll keep it
271 * "REV_TREE_NEW" of course).
273 if (addremove
== '+') {
274 diff
= tree_difference
;
275 if (diff
!= REV_TREE_SAME
)
279 tree_difference
= diff
;
280 if (tree_difference
== REV_TREE_DIFFERENT
)
281 DIFF_OPT_SET(options
, HAS_CHANGES
);
284 static void file_change(struct diff_options
*options
,
285 unsigned old_mode
, unsigned new_mode
,
286 const unsigned char *old_sha1
,
287 const unsigned char *new_sha1
,
288 const char *base
, const char *path
)
290 tree_difference
= REV_TREE_DIFFERENT
;
291 DIFF_OPT_SET(options
, HAS_CHANGES
);
294 static int rev_compare_tree(struct rev_info
*revs
, struct tree
*t1
, struct tree
*t2
)
299 return REV_TREE_DIFFERENT
;
300 tree_difference
= REV_TREE_SAME
;
301 DIFF_OPT_CLR(&revs
->pruning
, HAS_CHANGES
);
302 if (diff_tree_sha1(t1
->object
.sha1
, t2
->object
.sha1
, "",
304 return REV_TREE_DIFFERENT
;
305 return tree_difference
;
308 static int rev_same_tree_as_empty(struct rev_info
*revs
, struct tree
*t1
)
313 struct tree_desc empty
, real
;
318 tree
= read_object_with_reference(t1
->object
.sha1
, tree_type
, &size
, NULL
);
321 init_tree_desc(&real
, tree
, size
);
322 init_tree_desc(&empty
, "", 0);
324 tree_difference
= REV_TREE_SAME
;
325 DIFF_OPT_CLR(&revs
->pruning
, HAS_CHANGES
);
326 retval
= diff_tree(&empty
, &real
, "", &revs
->pruning
);
329 return retval
>= 0 && (tree_difference
== REV_TREE_SAME
);
332 static void try_to_simplify_commit(struct rev_info
*revs
, struct commit
*commit
)
334 struct commit_list
**pp
, *parent
;
335 int tree_changed
= 0, tree_same
= 0;
338 * If we don't do pruning, everything is interesting
346 if (!commit
->parents
) {
347 if (rev_same_tree_as_empty(revs
, commit
->tree
))
348 commit
->object
.flags
|= TREESAME
;
353 * Normal non-merge commit? If we don't want to make the
354 * history dense, we consider it always to be a change..
356 if (!revs
->dense
&& !commit
->parents
->next
)
359 pp
= &commit
->parents
;
360 while ((parent
= *pp
) != NULL
) {
361 struct commit
*p
= parent
->item
;
363 if (parse_commit(p
) < 0)
364 die("cannot simplify commit %s (because of %s)",
365 sha1_to_hex(commit
->object
.sha1
),
366 sha1_to_hex(p
->object
.sha1
));
367 switch (rev_compare_tree(revs
, p
->tree
, commit
->tree
)) {
370 if (!revs
->simplify_history
|| (p
->object
.flags
& UNINTERESTING
)) {
371 /* Even if a merge with an uninteresting
372 * side branch brought the entire change
373 * we are interested in, we do not want
374 * to lose the other branches of this
375 * merge, so we just keep going.
381 commit
->parents
= parent
;
382 commit
->object
.flags
|= TREESAME
;
386 if (revs
->remove_empty_trees
&&
387 rev_same_tree_as_empty(revs
, p
->tree
)) {
388 /* We are adding all the specified
389 * paths from this parent, so the
390 * history beyond this parent is not
391 * interesting. Remove its parents
392 * (they are grandparents for us).
393 * IOW, we pretend this parent is a
396 if (parse_commit(p
) < 0)
397 die("cannot simplify commit %s (invalid %s)",
398 sha1_to_hex(commit
->object
.sha1
),
399 sha1_to_hex(p
->object
.sha1
));
403 case REV_TREE_DIFFERENT
:
408 die("bad tree compare for commit %s", sha1_to_hex(commit
->object
.sha1
));
410 if (tree_changed
&& !tree_same
)
412 commit
->object
.flags
|= TREESAME
;
415 static int add_parents_to_list(struct rev_info
*revs
, struct commit
*commit
, struct commit_list
**list
)
417 struct commit_list
*parent
= commit
->parents
;
420 if (commit
->object
.flags
& ADDED
)
422 commit
->object
.flags
|= ADDED
;
425 * If the commit is uninteresting, don't try to
426 * prune parents - we want the maximal uninteresting
429 * Normally we haven't parsed the parent
430 * yet, so we won't have a parent of a parent
431 * here. However, it may turn out that we've
432 * reached this commit some other way (where it
433 * wasn't uninteresting), in which case we need
434 * to mark its parents recursively too..
436 if (commit
->object
.flags
& UNINTERESTING
) {
438 struct commit
*p
= parent
->item
;
439 parent
= parent
->next
;
440 if (parse_commit(p
) < 0)
442 p
->object
.flags
|= UNINTERESTING
;
444 mark_parents_uninteresting(p
);
445 if (p
->object
.flags
& SEEN
)
447 p
->object
.flags
|= SEEN
;
448 insert_by_date(p
, list
);
454 * Ok, the commit wasn't uninteresting. Try to
455 * simplify the commit history and find the parent
456 * that has no differences in the path set if one exists.
458 try_to_simplify_commit(revs
, commit
);
463 left_flag
= (commit
->object
.flags
& SYMMETRIC_LEFT
);
465 for (parent
= commit
->parents
; parent
; parent
= parent
->next
) {
466 struct commit
*p
= parent
->item
;
468 if (parse_commit(p
) < 0)
470 p
->object
.flags
|= left_flag
;
471 if (!(p
->object
.flags
& SEEN
)) {
472 p
->object
.flags
|= SEEN
;
473 insert_by_date(p
, list
);
475 if(revs
->first_parent_only
)
481 static void cherry_pick_list(struct commit_list
*list
, struct rev_info
*revs
)
483 struct commit_list
*p
;
484 int left_count
= 0, right_count
= 0;
486 struct patch_ids ids
;
488 /* First count the commits on the left and on the right */
489 for (p
= list
; p
; p
= p
->next
) {
490 struct commit
*commit
= p
->item
;
491 unsigned flags
= commit
->object
.flags
;
492 if (flags
& BOUNDARY
)
494 else if (flags
& SYMMETRIC_LEFT
)
500 left_first
= left_count
< right_count
;
501 init_patch_ids(&ids
);
502 if (revs
->diffopt
.nr_paths
) {
503 ids
.diffopts
.nr_paths
= revs
->diffopt
.nr_paths
;
504 ids
.diffopts
.paths
= revs
->diffopt
.paths
;
505 ids
.diffopts
.pathlens
= revs
->diffopt
.pathlens
;
508 /* Compute patch-ids for one side */
509 for (p
= list
; p
; p
= p
->next
) {
510 struct commit
*commit
= p
->item
;
511 unsigned flags
= commit
->object
.flags
;
513 if (flags
& BOUNDARY
)
516 * If we have fewer left, left_first is set and we omit
517 * commits on the right branch in this loop. If we have
518 * fewer right, we skip the left ones.
520 if (left_first
!= !!(flags
& SYMMETRIC_LEFT
))
522 commit
->util
= add_commit_patch_id(commit
, &ids
);
525 /* Check the other side */
526 for (p
= list
; p
; p
= p
->next
) {
527 struct commit
*commit
= p
->item
;
529 unsigned flags
= commit
->object
.flags
;
531 if (flags
& BOUNDARY
)
534 * If we have fewer left, left_first is set and we omit
535 * commits on the left branch in this loop.
537 if (left_first
== !!(flags
& SYMMETRIC_LEFT
))
541 * Have we seen the same patch id?
543 id
= has_commit_patch_id(commit
, &ids
);
547 commit
->object
.flags
|= SHOWN
;
550 /* Now check the original side for seen ones */
551 for (p
= list
; p
; p
= p
->next
) {
552 struct commit
*commit
= p
->item
;
553 struct patch_id
*ent
;
559 commit
->object
.flags
|= SHOWN
;
563 free_patch_ids(&ids
);
566 /* How many extra uninteresting commits we want to see.. */
569 static int still_interesting(struct commit_list
*src
, unsigned long date
, int slop
)
572 * No source list at all? We're definitely done..
578 * Does the destination list contain entries with a date
579 * before the source list? Definitely _not_ done.
581 if (date
< src
->item
->date
)
585 * Does the source list still have interesting commits in
586 * it? Definitely not done..
588 if (!everybody_uninteresting(src
))
591 /* Ok, we're closing in.. */
595 static int limit_list(struct rev_info
*revs
)
598 unsigned long date
= ~0ul;
599 struct commit_list
*list
= revs
->commits
;
600 struct commit_list
*newlist
= NULL
;
601 struct commit_list
**p
= &newlist
;
604 struct commit_list
*entry
= list
;
605 struct commit
*commit
= list
->item
;
606 struct object
*obj
= &commit
->object
;
607 show_early_output_fn_t show
;
612 if (revs
->max_age
!= -1 && (commit
->date
< revs
->max_age
))
613 obj
->flags
|= UNINTERESTING
;
614 if (add_parents_to_list(revs
, commit
, &list
) < 0)
616 if (obj
->flags
& UNINTERESTING
) {
617 mark_parents_uninteresting(commit
);
619 p
= &commit_list_insert(commit
, p
)->next
;
620 slop
= still_interesting(list
, date
, slop
);
623 /* If showing all, add the whole pending list to the end */
628 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
))
631 p
= &commit_list_insert(commit
, p
)->next
;
633 show
= show_early_output
;
638 show_early_output
= NULL
;
640 if (revs
->cherry_pick
)
641 cherry_pick_list(newlist
, revs
);
643 revs
->commits
= newlist
;
649 int warned_bad_reflog
;
650 struct rev_info
*all_revs
;
651 const char *name_for_errormsg
;
654 static int handle_one_ref(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
656 struct all_refs_cb
*cb
= cb_data
;
657 struct object
*object
= get_reference(cb
->all_revs
, path
, sha1
,
659 add_pending_object(cb
->all_revs
, object
, path
);
663 static void handle_refs(struct rev_info
*revs
, unsigned flags
,
664 int (*for_each
)(each_ref_fn
, void *))
666 struct all_refs_cb cb
;
668 cb
.all_flags
= flags
;
669 for_each(handle_one_ref
, &cb
);
672 static void handle_one_reflog_commit(unsigned char *sha1
, void *cb_data
)
674 struct all_refs_cb
*cb
= cb_data
;
675 if (!is_null_sha1(sha1
)) {
676 struct object
*o
= parse_object(sha1
);
678 o
->flags
|= cb
->all_flags
;
679 add_pending_object(cb
->all_revs
, o
, "");
681 else if (!cb
->warned_bad_reflog
) {
682 warning("reflog of '%s' references pruned commits",
683 cb
->name_for_errormsg
);
684 cb
->warned_bad_reflog
= 1;
689 static int handle_one_reflog_ent(unsigned char *osha1
, unsigned char *nsha1
,
690 const char *email
, unsigned long timestamp
, int tz
,
691 const char *message
, void *cb_data
)
693 handle_one_reflog_commit(osha1
, cb_data
);
694 handle_one_reflog_commit(nsha1
, cb_data
);
698 static int handle_one_reflog(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
700 struct all_refs_cb
*cb
= cb_data
;
701 cb
->warned_bad_reflog
= 0;
702 cb
->name_for_errormsg
= path
;
703 for_each_reflog_ent(path
, handle_one_reflog_ent
, cb_data
);
707 static void handle_reflog(struct rev_info
*revs
, unsigned flags
)
709 struct all_refs_cb cb
;
711 cb
.all_flags
= flags
;
712 for_each_reflog(handle_one_reflog
, &cb
);
715 static int add_parents_only(struct rev_info
*revs
, const char *arg
, int flags
)
717 unsigned char sha1
[20];
719 struct commit
*commit
;
720 struct commit_list
*parents
;
723 flags
^= UNINTERESTING
;
726 if (get_sha1(arg
, sha1
))
729 it
= get_reference(revs
, arg
, sha1
, 0);
730 if (it
->type
!= OBJ_TAG
)
732 if (!((struct tag
*)it
)->tagged
)
734 hashcpy(sha1
, ((struct tag
*)it
)->tagged
->sha1
);
736 if (it
->type
!= OBJ_COMMIT
)
738 commit
= (struct commit
*)it
;
739 for (parents
= commit
->parents
; parents
; parents
= parents
->next
) {
740 it
= &parents
->item
->object
;
742 add_pending_object(revs
, it
, arg
);
747 void init_revisions(struct rev_info
*revs
, const char *prefix
)
749 memset(revs
, 0, sizeof(*revs
));
751 revs
->abbrev
= DEFAULT_ABBREV
;
752 revs
->ignore_merges
= 1;
753 revs
->simplify_history
= 1;
754 DIFF_OPT_SET(&revs
->pruning
, RECURSIVE
);
755 DIFF_OPT_SET(&revs
->pruning
, QUIET
);
756 revs
->pruning
.add_remove
= file_add_remove
;
757 revs
->pruning
.change
= file_change
;
760 revs
->prefix
= prefix
;
763 revs
->skip_count
= -1;
764 revs
->max_count
= -1;
766 revs
->commit_format
= CMIT_FMT_DEFAULT
;
768 diff_setup(&revs
->diffopt
);
769 if (prefix
&& !revs
->diffopt
.prefix
) {
770 revs
->diffopt
.prefix
= prefix
;
771 revs
->diffopt
.prefix_length
= strlen(prefix
);
775 static void add_pending_commit_list(struct rev_info
*revs
,
776 struct commit_list
*commit_list
,
779 while (commit_list
) {
780 struct object
*object
= &commit_list
->item
->object
;
781 object
->flags
|= flags
;
782 add_pending_object(revs
, object
, sha1_to_hex(object
->sha1
));
783 commit_list
= commit_list
->next
;
787 static void prepare_show_merge(struct rev_info
*revs
)
789 struct commit_list
*bases
;
790 struct commit
*head
, *other
;
791 unsigned char sha1
[20];
792 const char **prune
= NULL
;
793 int i
, prune_num
= 1; /* counting terminating NULL */
795 if (get_sha1("HEAD", sha1
) || !(head
= lookup_commit(sha1
)))
796 die("--merge without HEAD?");
797 if (get_sha1("MERGE_HEAD", sha1
) || !(other
= lookup_commit(sha1
)))
798 die("--merge without MERGE_HEAD?");
799 add_pending_object(revs
, &head
->object
, "HEAD");
800 add_pending_object(revs
, &other
->object
, "MERGE_HEAD");
801 bases
= get_merge_bases(head
, other
, 1);
802 add_pending_commit_list(revs
, bases
, UNINTERESTING
);
803 free_commit_list(bases
);
804 head
->object
.flags
|= SYMMETRIC_LEFT
;
808 for (i
= 0; i
< active_nr
; i
++) {
809 struct cache_entry
*ce
= active_cache
[i
];
812 if (ce_path_match(ce
, revs
->prune_data
)) {
814 prune
= xrealloc(prune
, sizeof(*prune
) * prune_num
);
815 prune
[prune_num
-2] = ce
->name
;
816 prune
[prune_num
-1] = NULL
;
818 while ((i
+1 < active_nr
) &&
819 ce_same_name(ce
, active_cache
[i
+1]))
822 revs
->prune_data
= prune
;
826 int handle_revision_arg(const char *arg
, struct rev_info
*revs
,
828 int cant_be_filename
)
832 struct object
*object
;
833 unsigned char sha1
[20];
836 dotdot
= strstr(arg
, "..");
838 unsigned char from_sha1
[20];
839 const char *next
= dotdot
+ 2;
840 const char *this = arg
;
841 int symmetric
= *next
== '.';
842 unsigned int flags_exclude
= flags
^ UNINTERESTING
;
851 if (!get_sha1(this, from_sha1
) &&
852 !get_sha1(next
, sha1
)) {
853 struct commit
*a
, *b
;
854 struct commit_list
*exclude
;
856 a
= lookup_commit_reference(from_sha1
);
857 b
= lookup_commit_reference(sha1
);
860 "Invalid symmetric difference expression %s...%s" :
861 "Invalid revision range %s..%s",
865 if (!cant_be_filename
) {
867 verify_non_filename(revs
->prefix
, arg
);
871 exclude
= get_merge_bases(a
, b
, 1);
872 add_pending_commit_list(revs
, exclude
,
874 free_commit_list(exclude
);
875 a
->object
.flags
|= flags
| SYMMETRIC_LEFT
;
877 a
->object
.flags
|= flags_exclude
;
878 b
->object
.flags
|= flags
;
879 add_pending_object(revs
, &a
->object
, this);
880 add_pending_object(revs
, &b
->object
, next
);
885 dotdot
= strstr(arg
, "^@");
886 if (dotdot
&& !dotdot
[2]) {
888 if (add_parents_only(revs
, arg
, flags
))
892 dotdot
= strstr(arg
, "^!");
893 if (dotdot
&& !dotdot
[2]) {
895 if (!add_parents_only(revs
, arg
, flags
^ UNINTERESTING
))
901 local_flags
= UNINTERESTING
;
904 if (get_sha1_with_mode(arg
, sha1
, &mode
))
906 if (!cant_be_filename
)
907 verify_non_filename(revs
->prefix
, arg
);
908 object
= get_reference(revs
, arg
, sha1
, flags
^ local_flags
);
909 add_pending_object_with_mode(revs
, object
, arg
, mode
);
913 void read_revisions_from_stdin(struct rev_info
*revs
)
917 while (fgets(line
, sizeof(line
), stdin
) != NULL
) {
918 int len
= strlen(line
);
919 if (len
&& line
[len
- 1] == '\n')
924 die("options not supported in --stdin mode");
925 if (handle_revision_arg(line
, revs
, 0, 1))
926 die("bad revision '%s'", line
);
930 static void add_grep(struct rev_info
*revs
, const char *ptn
, enum grep_pat_token what
)
932 if (!revs
->grep_filter
) {
933 struct grep_opt
*opt
= xcalloc(1, sizeof(*opt
));
934 opt
->status_only
= 1;
935 opt
->pattern_tail
= &(opt
->pattern_list
);
936 opt
->regflags
= REG_NEWLINE
;
937 revs
->grep_filter
= opt
;
939 append_grep_pattern(revs
->grep_filter
, ptn
,
940 "command line", 0, what
);
943 static void add_header_grep(struct rev_info
*revs
, const char *field
, const char *pattern
)
949 fldlen
= strlen(field
);
950 patlen
= strlen(pattern
);
951 pat
= xmalloc(patlen
+ fldlen
+ 10);
953 if (*pattern
== '^') {
957 sprintf(pat
, "^%s %s%s", field
, prefix
, pattern
);
958 add_grep(revs
, pat
, GREP_PATTERN_HEAD
);
961 static void add_message_grep(struct rev_info
*revs
, const char *pattern
)
963 add_grep(revs
, pattern
, GREP_PATTERN_BODY
);
966 static void add_ignore_packed(struct rev_info
*revs
, const char *name
)
968 int num
= ++revs
->num_ignore_packed
;
970 revs
->ignore_packed
= xrealloc(revs
->ignore_packed
,
971 sizeof(const char **) * (num
+ 1));
972 revs
->ignore_packed
[num
-1] = name
;
973 revs
->ignore_packed
[num
] = NULL
;
977 * Parse revision information, filling in the "rev_info" structure,
978 * and removing the used arguments from the argument list.
980 * Returns the number of arguments left that weren't recognized
981 * (which are also moved to the head of the argument list)
983 int setup_revisions(int argc
, const char **argv
, struct rev_info
*revs
, const char *def
)
985 int i
, flags
, seen_dashdash
, show_merge
;
986 const char **unrecognized
= argv
+ 1;
992 /* First, search for "--" */
994 for (i
= 1; i
< argc
; i
++) {
995 const char *arg
= argv
[i
];
996 if (strcmp(arg
, "--"))
1001 revs
->prune_data
= get_pathspec(revs
->prefix
, argv
+ i
+ 1);
1006 flags
= show_merge
= 0;
1007 for (i
= 1; i
< argc
; i
++) {
1008 const char *arg
= argv
[i
];
1011 if (!prefixcmp(arg
, "--max-count=")) {
1012 revs
->max_count
= atoi(arg
+ 12);
1015 if (!prefixcmp(arg
, "--skip=")) {
1016 revs
->skip_count
= atoi(arg
+ 7);
1019 /* accept -<digit>, like traditional "head" */
1020 if ((*arg
== '-') && isdigit(arg
[1])) {
1021 revs
->max_count
= atoi(arg
+ 1);
1024 if (!strcmp(arg
, "-n")) {
1026 die("-n requires an argument");
1027 revs
->max_count
= atoi(argv
[++i
]);
1030 if (!prefixcmp(arg
, "-n")) {
1031 revs
->max_count
= atoi(arg
+ 2);
1034 if (!prefixcmp(arg
, "--max-age=")) {
1035 revs
->max_age
= atoi(arg
+ 10);
1038 if (!prefixcmp(arg
, "--since=")) {
1039 revs
->max_age
= approxidate(arg
+ 8);
1042 if (!prefixcmp(arg
, "--after=")) {
1043 revs
->max_age
= approxidate(arg
+ 8);
1046 if (!prefixcmp(arg
, "--min-age=")) {
1047 revs
->min_age
= atoi(arg
+ 10);
1050 if (!prefixcmp(arg
, "--before=")) {
1051 revs
->min_age
= approxidate(arg
+ 9);
1054 if (!prefixcmp(arg
, "--until=")) {
1055 revs
->min_age
= approxidate(arg
+ 8);
1058 if (!strcmp(arg
, "--all")) {
1059 handle_refs(revs
, flags
, for_each_ref
);
1062 if (!strcmp(arg
, "--branches")) {
1063 handle_refs(revs
, flags
, for_each_branch_ref
);
1066 if (!strcmp(arg
, "--tags")) {
1067 handle_refs(revs
, flags
, for_each_tag_ref
);
1070 if (!strcmp(arg
, "--remotes")) {
1071 handle_refs(revs
, flags
, for_each_remote_ref
);
1074 if (!strcmp(arg
, "--first-parent")) {
1075 revs
->first_parent_only
= 1;
1078 if (!strcmp(arg
, "--reflog")) {
1079 handle_reflog(revs
, flags
);
1082 if (!strcmp(arg
, "-g") ||
1083 !strcmp(arg
, "--walk-reflogs")) {
1084 init_reflog_walk(&revs
->reflog_info
);
1087 if (!strcmp(arg
, "--not")) {
1088 flags
^= UNINTERESTING
;
1091 if (!strcmp(arg
, "--default")) {
1093 die("bad --default argument");
1097 if (!strcmp(arg
, "--merge")) {
1101 if (!strcmp(arg
, "--topo-order")) {
1103 revs
->topo_order
= 1;
1106 if (!strcmp(arg
, "--date-order")) {
1108 revs
->topo_order
= 1;
1111 if (!prefixcmp(arg
, "--early-output")) {
1115 count
= atoi(arg
+15);
1118 revs
->topo_order
= 1;
1119 revs
->early_output
= count
;
1123 if (!strcmp(arg
, "--parents")) {
1124 revs
->rewrite_parents
= 1;
1125 revs
->print_parents
= 1;
1128 if (!strcmp(arg
, "--dense")) {
1132 if (!strcmp(arg
, "--sparse")) {
1136 if (!strcmp(arg
, "--show-all")) {
1140 if (!strcmp(arg
, "--remove-empty")) {
1141 revs
->remove_empty_trees
= 1;
1144 if (!strcmp(arg
, "--no-merges")) {
1145 revs
->no_merges
= 1;
1148 if (!strcmp(arg
, "--boundary")) {
1152 if (!strcmp(arg
, "--left-right")) {
1153 revs
->left_right
= 1;
1156 if (!strcmp(arg
, "--cherry-pick")) {
1157 revs
->cherry_pick
= 1;
1161 if (!strcmp(arg
, "--objects")) {
1162 revs
->tag_objects
= 1;
1163 revs
->tree_objects
= 1;
1164 revs
->blob_objects
= 1;
1167 if (!strcmp(arg
, "--objects-edge")) {
1168 revs
->tag_objects
= 1;
1169 revs
->tree_objects
= 1;
1170 revs
->blob_objects
= 1;
1171 revs
->edge_hint
= 1;
1174 if (!strcmp(arg
, "--unpacked")) {
1176 free(revs
->ignore_packed
);
1177 revs
->ignore_packed
= NULL
;
1178 revs
->num_ignore_packed
= 0;
1181 if (!prefixcmp(arg
, "--unpacked=")) {
1183 add_ignore_packed(revs
, arg
+11);
1186 if (!strcmp(arg
, "-r")) {
1188 DIFF_OPT_SET(&revs
->diffopt
, RECURSIVE
);
1191 if (!strcmp(arg
, "-t")) {
1193 DIFF_OPT_SET(&revs
->diffopt
, RECURSIVE
);
1194 DIFF_OPT_SET(&revs
->diffopt
, TREE_IN_RECURSIVE
);
1197 if (!strcmp(arg
, "-m")) {
1198 revs
->ignore_merges
= 0;
1201 if (!strcmp(arg
, "-c")) {
1203 revs
->dense_combined_merges
= 0;
1204 revs
->combine_merges
= 1;
1207 if (!strcmp(arg
, "--cc")) {
1209 revs
->dense_combined_merges
= 1;
1210 revs
->combine_merges
= 1;
1213 if (!strcmp(arg
, "-v")) {
1214 revs
->verbose_header
= 1;
1217 if (!strcmp(arg
, "--pretty")) {
1218 revs
->verbose_header
= 1;
1219 get_commit_format(arg
+8, revs
);
1222 if (!prefixcmp(arg
, "--pretty=")) {
1223 revs
->verbose_header
= 1;
1224 get_commit_format(arg
+9, revs
);
1227 if (!strcmp(arg
, "--graph")) {
1228 revs
->topo_order
= 1;
1229 revs
->rewrite_parents
= 1;
1230 revs
->graph
= graph_init(revs
);
1233 if (!strcmp(arg
, "--root")) {
1234 revs
->show_root_diff
= 1;
1237 if (!strcmp(arg
, "--no-commit-id")) {
1238 revs
->no_commit_id
= 1;
1241 if (!strcmp(arg
, "--always")) {
1242 revs
->always_show_header
= 1;
1245 if (!strcmp(arg
, "--no-abbrev")) {
1249 if (!strcmp(arg
, "--abbrev")) {
1250 revs
->abbrev
= DEFAULT_ABBREV
;
1253 if (!prefixcmp(arg
, "--abbrev=")) {
1254 revs
->abbrev
= strtoul(arg
+ 9, NULL
, 10);
1255 if (revs
->abbrev
< MINIMUM_ABBREV
)
1256 revs
->abbrev
= MINIMUM_ABBREV
;
1257 else if (revs
->abbrev
> 40)
1261 if (!strcmp(arg
, "--abbrev-commit")) {
1262 revs
->abbrev_commit
= 1;
1265 if (!strcmp(arg
, "--full-diff")) {
1267 revs
->full_diff
= 1;
1270 if (!strcmp(arg
, "--full-history")) {
1271 revs
->simplify_history
= 0;
1274 if (!strcmp(arg
, "--relative-date")) {
1275 revs
->date_mode
= DATE_RELATIVE
;
1278 if (!strncmp(arg
, "--date=", 7)) {
1279 revs
->date_mode
= parse_date_format(arg
+ 7);
1282 if (!strcmp(arg
, "--log-size")) {
1283 revs
->show_log_size
= 1;
1288 * Grepping the commit log
1290 if (!prefixcmp(arg
, "--author=")) {
1291 add_header_grep(revs
, "author", arg
+9);
1294 if (!prefixcmp(arg
, "--committer=")) {
1295 add_header_grep(revs
, "committer", arg
+12);
1298 if (!prefixcmp(arg
, "--grep=")) {
1299 add_message_grep(revs
, arg
+7);
1302 if (!strcmp(arg
, "--extended-regexp") ||
1303 !strcmp(arg
, "-E")) {
1304 regflags
|= REG_EXTENDED
;
1307 if (!strcmp(arg
, "--regexp-ignore-case") ||
1308 !strcmp(arg
, "-i")) {
1309 regflags
|= REG_ICASE
;
1312 if (!strcmp(arg
, "--fixed-strings") ||
1313 !strcmp(arg
, "-F")) {
1317 if (!strcmp(arg
, "--all-match")) {
1321 if (!prefixcmp(arg
, "--encoding=")) {
1323 if (strcmp(arg
, "none"))
1324 git_log_output_encoding
= xstrdup(arg
);
1326 git_log_output_encoding
= "";
1329 if (!strcmp(arg
, "--reverse")) {
1333 if (!strcmp(arg
, "--no-walk")) {
1337 if (!strcmp(arg
, "--do-walk")) {
1342 opts
= diff_opt_parse(&revs
->diffopt
, argv
+i
, argc
-i
);
1347 *unrecognized
++ = arg
;
1352 if (handle_revision_arg(arg
, revs
, flags
, seen_dashdash
)) {
1354 if (seen_dashdash
|| *arg
== '^')
1355 die("bad revision '%s'", arg
);
1357 /* If we didn't have a "--":
1358 * (1) all filenames must exist;
1359 * (2) all rev-args must not be interpretable
1360 * as a valid filename.
1361 * but the latter we have checked in the main loop.
1363 for (j
= i
; j
< argc
; j
++)
1364 verify_filename(revs
->prefix
, argv
[j
]);
1366 revs
->prune_data
= get_pathspec(revs
->prefix
,
1372 if (revs
->grep_filter
) {
1373 revs
->grep_filter
->regflags
|= regflags
;
1374 revs
->grep_filter
->fixed
= fixed
;
1378 prepare_show_merge(revs
);
1379 if (def
&& !revs
->pending
.nr
) {
1380 unsigned char sha1
[20];
1381 struct object
*object
;
1383 if (get_sha1_with_mode(def
, sha1
, &mode
))
1384 die("bad default revision '%s'", def
);
1385 object
= get_reference(revs
, def
, sha1
, 0);
1386 add_pending_object_with_mode(revs
, object
, def
, mode
);
1389 /* Did the user ask for any diff output? Run the diff! */
1390 if (revs
->diffopt
.output_format
& ~DIFF_FORMAT_NO_OUTPUT
)
1393 /* Pickaxe, diff-filter and rename following need diffs */
1394 if (revs
->diffopt
.pickaxe
||
1395 revs
->diffopt
.filter
||
1396 DIFF_OPT_TST(&revs
->diffopt
, FOLLOW_RENAMES
))
1399 if (revs
->topo_order
)
1402 if (revs
->prune_data
) {
1403 diff_tree_setup_paths(revs
->prune_data
, &revs
->pruning
);
1404 /* Can't prune commits with rename following: the paths change.. */
1405 if (!DIFF_OPT_TST(&revs
->diffopt
, FOLLOW_RENAMES
))
1407 if (!revs
->full_diff
)
1408 diff_tree_setup_paths(revs
->prune_data
, &revs
->diffopt
);
1410 if (revs
->combine_merges
) {
1411 revs
->ignore_merges
= 0;
1412 if (revs
->dense_combined_merges
&& !revs
->diffopt
.output_format
)
1413 revs
->diffopt
.output_format
= DIFF_FORMAT_PATCH
;
1415 revs
->diffopt
.abbrev
= revs
->abbrev
;
1416 if (diff_setup_done(&revs
->diffopt
) < 0)
1417 die("diff_setup_done failed");
1419 if (revs
->grep_filter
) {
1420 revs
->grep_filter
->all_match
= all_match
;
1421 compile_grep_patterns(revs
->grep_filter
);
1424 if (revs
->reverse
&& revs
->reflog_info
)
1425 die("cannot combine --reverse with --walk-reflogs");
1428 * Limitations on the graph functionality
1430 if (revs
->reverse
&& revs
->graph
)
1431 die("cannot combine --reverse with --graph");
1433 if (revs
->reflog_info
&& revs
->graph
)
1434 die("cannot combine --walk-reflogs with --graph");
1439 int prepare_revision_walk(struct rev_info
*revs
)
1441 int nr
= revs
->pending
.nr
;
1442 struct object_array_entry
*e
, *list
;
1444 e
= list
= revs
->pending
.objects
;
1445 revs
->pending
.nr
= 0;
1446 revs
->pending
.alloc
= 0;
1447 revs
->pending
.objects
= NULL
;
1449 struct commit
*commit
= handle_commit(revs
, e
->item
, e
->name
);
1451 if (!(commit
->object
.flags
& SEEN
)) {
1452 commit
->object
.flags
|= SEEN
;
1453 insert_by_date(commit
, &revs
->commits
);
1463 if (limit_list(revs
) < 0)
1465 if (revs
->topo_order
)
1466 sort_in_topological_order(&revs
->commits
, revs
->lifo
);
1470 enum rewrite_result
{
1472 rewrite_one_noparents
,
1476 static enum rewrite_result
rewrite_one(struct rev_info
*revs
, struct commit
**pp
)
1479 struct commit
*p
= *pp
;
1481 if (add_parents_to_list(revs
, p
, &revs
->commits
) < 0)
1482 return rewrite_one_error
;
1483 if (p
->parents
&& p
->parents
->next
)
1484 return rewrite_one_ok
;
1485 if (p
->object
.flags
& UNINTERESTING
)
1486 return rewrite_one_ok
;
1487 if (!(p
->object
.flags
& TREESAME
))
1488 return rewrite_one_ok
;
1490 return rewrite_one_noparents
;
1491 *pp
= p
->parents
->item
;
1495 static void remove_duplicate_parents(struct commit
*commit
)
1497 struct commit_list
**pp
, *p
;
1499 /* Examine existing parents while marking ones we have seen... */
1500 pp
= &commit
->parents
;
1501 while ((p
= *pp
) != NULL
) {
1502 struct commit
*parent
= p
->item
;
1503 if (parent
->object
.flags
& TMP_MARK
) {
1507 parent
->object
.flags
|= TMP_MARK
;
1510 /* ... and clear the temporary mark */
1511 for (p
= commit
->parents
; p
; p
= p
->next
)
1512 p
->item
->object
.flags
&= ~TMP_MARK
;
1515 static int rewrite_parents(struct rev_info
*revs
, struct commit
*commit
)
1517 struct commit_list
**pp
= &commit
->parents
;
1519 struct commit_list
*parent
= *pp
;
1520 switch (rewrite_one(revs
, &parent
->item
)) {
1521 case rewrite_one_ok
:
1523 case rewrite_one_noparents
:
1526 case rewrite_one_error
:
1531 remove_duplicate_parents(commit
);
1535 static int commit_match(struct commit
*commit
, struct rev_info
*opt
)
1537 if (!opt
->grep_filter
)
1539 return grep_buffer(opt
->grep_filter
,
1540 NULL
, /* we say nothing, not even filename */
1541 commit
->buffer
, strlen(commit
->buffer
));
1544 enum commit_action
simplify_commit(struct rev_info
*revs
, struct commit
*commit
)
1546 if (commit
->object
.flags
& SHOWN
)
1547 return commit_ignore
;
1548 if (revs
->unpacked
&& has_sha1_pack(commit
->object
.sha1
, revs
->ignore_packed
))
1549 return commit_ignore
;
1552 if (commit
->object
.flags
& UNINTERESTING
)
1553 return commit_ignore
;
1554 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
))
1555 return commit_ignore
;
1556 if (revs
->no_merges
&& commit
->parents
&& commit
->parents
->next
)
1557 return commit_ignore
;
1558 if (!commit_match(commit
, revs
))
1559 return commit_ignore
;
1560 if (revs
->prune
&& revs
->dense
) {
1561 /* Commit without changes? */
1562 if (commit
->object
.flags
& TREESAME
) {
1563 /* drop merges unless we want parenthood */
1564 if (!revs
->rewrite_parents
)
1565 return commit_ignore
;
1566 /* non-merge - always ignore it */
1567 if (!commit
->parents
|| !commit
->parents
->next
)
1568 return commit_ignore
;
1570 if (revs
->rewrite_parents
&& rewrite_parents(revs
, commit
) < 0)
1571 return commit_error
;
1576 static struct commit
*get_revision_1(struct rev_info
*revs
)
1582 struct commit_list
*entry
= revs
->commits
;
1583 struct commit
*commit
= entry
->item
;
1585 revs
->commits
= entry
->next
;
1588 if (revs
->reflog_info
)
1589 fake_reflog_parent(revs
->reflog_info
, commit
);
1592 * If we haven't done the list limiting, we need to look at
1593 * the parents here. We also need to do the date-based limiting
1594 * that we'd otherwise have done in limit_list().
1596 if (!revs
->limited
) {
1597 if (revs
->max_age
!= -1 &&
1598 (commit
->date
< revs
->max_age
))
1600 if (add_parents_to_list(revs
, commit
, &revs
->commits
) < 0)
1604 switch (simplify_commit(revs
, commit
)) {
1612 } while (revs
->commits
);
1616 static void gc_boundary(struct object_array
*array
)
1618 unsigned nr
= array
->nr
;
1619 unsigned alloc
= array
->alloc
;
1620 struct object_array_entry
*objects
= array
->objects
;
1624 for (i
= j
= 0; i
< nr
; i
++) {
1625 if (objects
[i
].item
->flags
& SHOWN
)
1628 objects
[j
] = objects
[i
];
1631 for (i
= j
; i
< nr
; i
++)
1632 objects
[i
].item
= NULL
;
1637 static void create_boundary_commit_list(struct rev_info
*revs
)
1641 struct object_array
*array
= &revs
->boundary_commits
;
1642 struct object_array_entry
*objects
= array
->objects
;
1645 * If revs->commits is non-NULL at this point, an error occurred in
1646 * get_revision_1(). Ignore the error and continue printing the
1647 * boundary commits anyway. (This is what the code has always
1650 if (revs
->commits
) {
1651 free_commit_list(revs
->commits
);
1652 revs
->commits
= NULL
;
1656 * Put all of the actual boundary commits from revs->boundary_commits
1657 * into revs->commits
1659 for (i
= 0; i
< array
->nr
; i
++) {
1660 c
= (struct commit
*)(objects
[i
].item
);
1663 if (!(c
->object
.flags
& CHILD_SHOWN
))
1665 if (c
->object
.flags
& (SHOWN
| BOUNDARY
))
1667 c
->object
.flags
|= BOUNDARY
;
1668 commit_list_insert(c
, &revs
->commits
);
1672 * If revs->topo_order is set, sort the boundary commits
1673 * in topological order
1675 sort_in_topological_order(&revs
->commits
, revs
->lifo
);
1678 static struct commit
*get_revision_internal(struct rev_info
*revs
)
1680 struct commit
*c
= NULL
;
1681 struct commit_list
*l
;
1683 if (revs
->boundary
== 2) {
1685 * All of the normal commits have already been returned,
1686 * and we are now returning boundary commits.
1687 * create_boundary_commit_list() has populated
1688 * revs->commits with the remaining commits to return.
1690 c
= pop_commit(&revs
->commits
);
1692 c
->object
.flags
|= SHOWN
;
1696 if (revs
->reverse
) {
1699 if (0 <= revs
->max_count
) {
1700 limit
= revs
->max_count
;
1701 if (0 < revs
->skip_count
)
1702 limit
+= revs
->skip_count
;
1705 while ((c
= get_revision_1(revs
))) {
1706 commit_list_insert(c
, &l
);
1707 if ((0 < limit
) && !--limit
)
1712 revs
->max_count
= -1;
1717 * Now pick up what they want to give us
1719 c
= get_revision_1(revs
);
1721 while (0 < revs
->skip_count
) {
1723 c
= get_revision_1(revs
);
1730 * Check the max_count.
1732 switch (revs
->max_count
) {
1743 c
->object
.flags
|= SHOWN
;
1745 if (!revs
->boundary
) {
1751 * get_revision_1() runs out the commits, and
1752 * we are done computing the boundaries.
1753 * switch to boundary commits output mode.
1758 * Update revs->commits to contain the list of
1761 create_boundary_commit_list(revs
);
1763 return get_revision_internal(revs
);
1767 * boundary commits are the commits that are parents of the
1768 * ones we got from get_revision_1() but they themselves are
1769 * not returned from get_revision_1(). Before returning
1770 * 'c', we need to mark its parents that they could be boundaries.
1773 for (l
= c
->parents
; l
; l
= l
->next
) {
1775 p
= &(l
->item
->object
);
1776 if (p
->flags
& (CHILD_SHOWN
| SHOWN
))
1778 p
->flags
|= CHILD_SHOWN
;
1779 gc_boundary(&revs
->boundary_commits
);
1780 add_object_array(p
, NULL
, &revs
->boundary_commits
);
1786 struct commit
*get_revision(struct rev_info
*revs
)
1788 struct commit
*c
= get_revision_internal(revs
);
1789 if (c
&& revs
->graph
)
1790 graph_update(revs
->graph
, c
);