10 #include "reflog-walk.h"
12 static char *path_name(struct name_path
*path
, const char *name
)
16 int nlen
= strlen(name
);
19 for (p
= path
; p
; p
= p
->up
) {
21 len
+= p
->elem_len
+ 1;
24 m
= n
+ len
- (nlen
+ 1);
26 for (p
= path
; p
; p
= p
->up
) {
29 memcpy(m
, p
->elem
, p
->elem_len
);
36 void add_object(struct object
*obj
,
37 struct object_array
*p
,
38 struct name_path
*path
,
41 add_object_array(obj
, path_name(path
, name
), p
);
44 static void mark_blob_uninteresting(struct blob
*blob
)
46 if (blob
->object
.flags
& UNINTERESTING
)
48 blob
->object
.flags
|= UNINTERESTING
;
51 void mark_tree_uninteresting(struct tree
*tree
)
53 struct tree_desc desc
;
54 struct name_entry entry
;
55 struct object
*obj
= &tree
->object
;
57 if (obj
->flags
& UNINTERESTING
)
59 obj
->flags
|= UNINTERESTING
;
60 if (!has_sha1_file(obj
->sha1
))
62 if (parse_tree(tree
) < 0)
63 die("bad tree %s", sha1_to_hex(obj
->sha1
));
65 desc
.buf
= tree
->buffer
;
66 desc
.size
= tree
->size
;
67 while (tree_entry(&desc
, &entry
)) {
68 if (S_ISDIR(entry
.mode
))
69 mark_tree_uninteresting(lookup_tree(entry
.sha1
));
71 mark_blob_uninteresting(lookup_blob(entry
.sha1
));
75 * We don't care about the tree any more
76 * after it has been marked uninteresting.
82 void mark_parents_uninteresting(struct commit
*commit
)
84 struct commit_list
*parents
= commit
->parents
;
87 struct commit
*commit
= parents
->item
;
88 if (!(commit
->object
.flags
& UNINTERESTING
)) {
89 commit
->object
.flags
|= UNINTERESTING
;
92 * Normally we haven't parsed the parent
93 * yet, so we won't have a parent of a parent
94 * here. However, it may turn out that we've
95 * reached this commit some other way (where it
96 * wasn't uninteresting), in which case we need
97 * to mark its parents recursively too..
100 mark_parents_uninteresting(commit
);
104 * A missing commit is ok iff its parent is marked
107 * We just mark such a thing parsed, so that when
108 * it is popped next time around, we won't be trying
109 * to parse it and get an error.
111 if (!has_sha1_file(commit
->object
.sha1
))
112 commit
->object
.parsed
= 1;
113 parents
= parents
->next
;
117 void add_pending_object(struct rev_info
*revs
, struct object
*obj
, const char *name
)
119 if (revs
->no_walk
&& (obj
->flags
& UNINTERESTING
))
120 die("object ranges do not make sense when not walking revisions");
121 add_object_array(obj
, name
, &revs
->pending
);
122 if (revs
->reflog_info
&& obj
->type
== OBJ_COMMIT
)
123 add_reflog_for_walk(revs
->reflog_info
,
124 (struct commit
*)obj
, name
);
127 static struct object
*get_reference(struct rev_info
*revs
, const char *name
, const unsigned char *sha1
, unsigned int flags
)
129 struct object
*object
;
131 object
= parse_object(sha1
);
133 die("bad object %s", name
);
134 object
->flags
|= flags
;
138 static struct commit
*handle_commit(struct rev_info
*revs
, struct object
*object
, const char *name
)
140 unsigned long flags
= object
->flags
;
143 * Tag object? Look what it points to..
145 while (object
->type
== OBJ_TAG
) {
146 struct tag
*tag
= (struct tag
*) object
;
147 if (revs
->tag_objects
&& !(flags
& UNINTERESTING
))
148 add_pending_object(revs
, object
, tag
->tag
);
149 object
= parse_object(tag
->tagged
->sha1
);
151 die("bad object %s", sha1_to_hex(tag
->tagged
->sha1
));
155 * Commit object? Just return it, we'll do all the complex
158 if (object
->type
== OBJ_COMMIT
) {
159 struct commit
*commit
= (struct commit
*)object
;
160 if (parse_commit(commit
) < 0)
161 die("unable to parse commit %s", name
);
162 if (flags
& UNINTERESTING
) {
163 commit
->object
.flags
|= UNINTERESTING
;
164 mark_parents_uninteresting(commit
);
171 * Tree object? Either mark it uniniteresting, or add it
172 * to the list of objects to look at later..
174 if (object
->type
== OBJ_TREE
) {
175 struct tree
*tree
= (struct tree
*)object
;
176 if (!revs
->tree_objects
)
178 if (flags
& UNINTERESTING
) {
179 mark_tree_uninteresting(tree
);
182 add_pending_object(revs
, object
, "");
187 * Blob object? You know the drill by now..
189 if (object
->type
== OBJ_BLOB
) {
190 struct blob
*blob
= (struct blob
*)object
;
191 if (!revs
->blob_objects
)
193 if (flags
& UNINTERESTING
) {
194 mark_blob_uninteresting(blob
);
197 add_pending_object(revs
, object
, "");
200 die("%s is unknown object", name
);
203 static int everybody_uninteresting(struct commit_list
*orig
)
205 struct commit_list
*list
= orig
;
207 struct commit
*commit
= list
->item
;
209 if (commit
->object
.flags
& UNINTERESTING
)
216 static int tree_difference
= REV_TREE_SAME
;
218 static void file_add_remove(struct diff_options
*options
,
219 int addremove
, unsigned mode
,
220 const unsigned char *sha1
,
221 const char *base
, const char *path
)
223 int diff
= REV_TREE_DIFFERENT
;
226 * Is it an add of a new file? It means that the old tree
227 * didn't have it at all, so we will turn "REV_TREE_SAME" ->
228 * "REV_TREE_NEW", but leave any "REV_TREE_DIFFERENT" alone
229 * (and if it already was "REV_TREE_NEW", we'll keep it
230 * "REV_TREE_NEW" of course).
232 if (addremove
== '+') {
233 diff
= tree_difference
;
234 if (diff
!= REV_TREE_SAME
)
238 tree_difference
= diff
;
241 static void file_change(struct diff_options
*options
,
242 unsigned old_mode
, unsigned new_mode
,
243 const unsigned char *old_sha1
,
244 const unsigned char *new_sha1
,
245 const char *base
, const char *path
)
247 tree_difference
= REV_TREE_DIFFERENT
;
250 int rev_compare_tree(struct rev_info
*revs
, struct tree
*t1
, struct tree
*t2
)
255 return REV_TREE_DIFFERENT
;
256 tree_difference
= REV_TREE_SAME
;
257 if (diff_tree_sha1(t1
->object
.sha1
, t2
->object
.sha1
, "",
259 return REV_TREE_DIFFERENT
;
260 return tree_difference
;
263 int rev_same_tree_as_empty(struct rev_info
*revs
, struct tree
*t1
)
267 struct tree_desc empty
, real
;
272 tree
= read_object_with_reference(t1
->object
.sha1
, tree_type
, &real
.size
, NULL
);
281 retval
= diff_tree(&empty
, &real
, "", &revs
->pruning
);
284 return retval
>= 0 && !tree_difference
;
287 static void try_to_simplify_commit(struct rev_info
*revs
, struct commit
*commit
)
289 struct commit_list
**pp
, *parent
;
290 int tree_changed
= 0, tree_same
= 0;
295 if (!commit
->parents
) {
296 if (!rev_same_tree_as_empty(revs
, commit
->tree
))
297 commit
->object
.flags
|= TREECHANGE
;
301 pp
= &commit
->parents
;
302 while ((parent
= *pp
) != NULL
) {
303 struct commit
*p
= parent
->item
;
306 switch (rev_compare_tree(revs
, p
->tree
, commit
->tree
)) {
309 if (!revs
->simplify_history
|| (p
->object
.flags
& UNINTERESTING
)) {
310 /* Even if a merge with an uninteresting
311 * side branch brought the entire change
312 * we are interested in, we do not want
313 * to lose the other branches of this
314 * merge, so we just keep going.
320 commit
->parents
= parent
;
324 if (revs
->remove_empty_trees
&&
325 rev_same_tree_as_empty(revs
, p
->tree
)) {
326 /* We are adding all the specified
327 * paths from this parent, so the
328 * history beyond this parent is not
329 * interesting. Remove its parents
330 * (they are grandparents for us).
331 * IOW, we pretend this parent is a
338 case REV_TREE_DIFFERENT
:
343 die("bad tree compare for commit %s", sha1_to_hex(commit
->object
.sha1
));
345 if (tree_changed
&& !tree_same
)
346 commit
->object
.flags
|= TREECHANGE
;
349 static void add_parents_to_list(struct rev_info
*revs
, struct commit
*commit
, struct commit_list
**list
)
351 struct commit_list
*parent
= commit
->parents
;
355 if (commit
->object
.flags
& ADDED
)
357 commit
->object
.flags
|= ADDED
;
360 * If the commit is uninteresting, don't try to
361 * prune parents - we want the maximal uninteresting
364 * Normally we haven't parsed the parent
365 * yet, so we won't have a parent of a parent
366 * here. However, it may turn out that we've
367 * reached this commit some other way (where it
368 * wasn't uninteresting), in which case we need
369 * to mark its parents recursively too..
371 if (commit
->object
.flags
& UNINTERESTING
) {
373 struct commit
*p
= parent
->item
;
374 parent
= parent
->next
;
376 p
->object
.flags
|= UNINTERESTING
;
378 mark_parents_uninteresting(p
);
379 if (p
->object
.flags
& SEEN
)
381 p
->object
.flags
|= SEEN
;
382 insert_by_date(p
, list
);
388 * Ok, the commit wasn't uninteresting. Try to
389 * simplify the commit history and find the parent
390 * that has no differences in the path set if one exists.
393 revs
->prune_fn(revs
, commit
);
398 left_flag
= (commit
->object
.flags
& SYMMETRIC_LEFT
);
400 rest
= !revs
->first_parent_only
;
401 for (parent
= commit
->parents
, add
= 1; parent
; add
= rest
) {
402 struct commit
*p
= parent
->item
;
404 parent
= parent
->next
;
406 p
->object
.flags
|= left_flag
;
407 if (p
->object
.flags
& SEEN
)
409 p
->object
.flags
|= SEEN
;
411 insert_by_date(p
, list
);
415 static void limit_list(struct rev_info
*revs
)
417 struct commit_list
*list
= revs
->commits
;
418 struct commit_list
*newlist
= NULL
;
419 struct commit_list
**p
= &newlist
;
422 struct commit_list
*entry
= list
;
423 struct commit
*commit
= list
->item
;
424 struct object
*obj
= &commit
->object
;
429 if (revs
->max_age
!= -1 && (commit
->date
< revs
->max_age
))
430 obj
->flags
|= UNINTERESTING
;
431 add_parents_to_list(revs
, commit
, &list
);
432 if (obj
->flags
& UNINTERESTING
) {
433 mark_parents_uninteresting(commit
);
434 if (everybody_uninteresting(list
))
438 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
))
440 p
= &commit_list_insert(commit
, p
)->next
;
442 revs
->commits
= newlist
;
447 int warned_bad_reflog
;
448 struct rev_info
*all_revs
;
449 const char *name_for_errormsg
;
452 static int handle_one_ref(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
454 struct all_refs_cb
*cb
= cb_data
;
455 struct object
*object
= get_reference(cb
->all_revs
, path
, sha1
,
457 add_pending_object(cb
->all_revs
, object
, path
);
461 static void handle_all(struct rev_info
*revs
, unsigned flags
)
463 struct all_refs_cb cb
;
465 cb
.all_flags
= flags
;
466 for_each_ref(handle_one_ref
, &cb
);
469 static void handle_one_reflog_commit(unsigned char *sha1
, void *cb_data
)
471 struct all_refs_cb
*cb
= cb_data
;
472 if (!is_null_sha1(sha1
)) {
473 struct object
*o
= parse_object(sha1
);
475 o
->flags
|= cb
->all_flags
;
476 add_pending_object(cb
->all_revs
, o
, "");
478 else if (!cb
->warned_bad_reflog
) {
479 warn("reflog of '%s' references pruned commits",
480 cb
->name_for_errormsg
);
481 cb
->warned_bad_reflog
= 1;
486 static int handle_one_reflog_ent(unsigned char *osha1
, unsigned char *nsha1
,
487 const char *email
, unsigned long timestamp
, int tz
,
488 const char *message
, void *cb_data
)
490 handle_one_reflog_commit(osha1
, cb_data
);
491 handle_one_reflog_commit(nsha1
, cb_data
);
495 static int handle_one_reflog(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
497 struct all_refs_cb
*cb
= cb_data
;
498 cb
->warned_bad_reflog
= 0;
499 cb
->name_for_errormsg
= path
;
500 for_each_reflog_ent(path
, handle_one_reflog_ent
, cb_data
);
504 static void handle_reflog(struct rev_info
*revs
, unsigned flags
)
506 struct all_refs_cb cb
;
508 cb
.all_flags
= flags
;
509 for_each_reflog(handle_one_reflog
, &cb
);
512 static int add_parents_only(struct rev_info
*revs
, const char *arg
, int flags
)
514 unsigned char sha1
[20];
516 struct commit
*commit
;
517 struct commit_list
*parents
;
520 flags
^= UNINTERESTING
;
523 if (get_sha1(arg
, sha1
))
526 it
= get_reference(revs
, arg
, sha1
, 0);
527 if (it
->type
!= OBJ_TAG
)
529 hashcpy(sha1
, ((struct tag
*)it
)->tagged
->sha1
);
531 if (it
->type
!= OBJ_COMMIT
)
533 commit
= (struct commit
*)it
;
534 for (parents
= commit
->parents
; parents
; parents
= parents
->next
) {
535 it
= &parents
->item
->object
;
537 add_pending_object(revs
, it
, arg
);
542 void init_revisions(struct rev_info
*revs
, const char *prefix
)
544 memset(revs
, 0, sizeof(*revs
));
546 revs
->abbrev
= DEFAULT_ABBREV
;
547 revs
->ignore_merges
= 1;
548 revs
->simplify_history
= 1;
549 revs
->pruning
.recursive
= 1;
550 revs
->pruning
.add_remove
= file_add_remove
;
551 revs
->pruning
.change
= file_change
;
554 revs
->prefix
= prefix
;
557 revs
->skip_count
= -1;
558 revs
->max_count
= -1;
560 revs
->prune_fn
= NULL
;
561 revs
->prune_data
= NULL
;
563 revs
->topo_setter
= topo_sort_default_setter
;
564 revs
->topo_getter
= topo_sort_default_getter
;
566 revs
->commit_format
= CMIT_FMT_DEFAULT
;
568 diff_setup(&revs
->diffopt
);
571 static void add_pending_commit_list(struct rev_info
*revs
,
572 struct commit_list
*commit_list
,
575 while (commit_list
) {
576 struct object
*object
= &commit_list
->item
->object
;
577 object
->flags
|= flags
;
578 add_pending_object(revs
, object
, sha1_to_hex(object
->sha1
));
579 commit_list
= commit_list
->next
;
583 static void prepare_show_merge(struct rev_info
*revs
)
585 struct commit_list
*bases
;
586 struct commit
*head
, *other
;
587 unsigned char sha1
[20];
588 const char **prune
= NULL
;
589 int i
, prune_num
= 1; /* counting terminating NULL */
591 if (get_sha1("HEAD", sha1
) || !(head
= lookup_commit(sha1
)))
592 die("--merge without HEAD?");
593 if (get_sha1("MERGE_HEAD", sha1
) || !(other
= lookup_commit(sha1
)))
594 die("--merge without MERGE_HEAD?");
595 add_pending_object(revs
, &head
->object
, "HEAD");
596 add_pending_object(revs
, &other
->object
, "MERGE_HEAD");
597 bases
= get_merge_bases(head
, other
, 1);
599 struct commit
*it
= bases
->item
;
600 struct commit_list
*n
= bases
->next
;
603 it
->object
.flags
|= UNINTERESTING
;
604 add_pending_object(revs
, &it
->object
, "(merge-base)");
609 for (i
= 0; i
< active_nr
; i
++) {
610 struct cache_entry
*ce
= active_cache
[i
];
613 if (ce_path_match(ce
, revs
->prune_data
)) {
615 prune
= xrealloc(prune
, sizeof(*prune
) * prune_num
);
616 prune
[prune_num
-2] = ce
->name
;
617 prune
[prune_num
-1] = NULL
;
619 while ((i
+1 < active_nr
) &&
620 ce_same_name(ce
, active_cache
[i
+1]))
623 revs
->prune_data
= prune
;
626 int handle_revision_arg(const char *arg
, struct rev_info
*revs
,
628 int cant_be_filename
)
631 struct object
*object
;
632 unsigned char sha1
[20];
635 dotdot
= strstr(arg
, "..");
637 unsigned char from_sha1
[20];
638 const char *next
= dotdot
+ 2;
639 const char *this = arg
;
640 int symmetric
= *next
== '.';
641 unsigned int flags_exclude
= flags
^ UNINTERESTING
;
650 if (!get_sha1(this, from_sha1
) &&
651 !get_sha1(next
, sha1
)) {
652 struct commit
*a
, *b
;
653 struct commit_list
*exclude
;
655 a
= lookup_commit_reference(from_sha1
);
656 b
= lookup_commit_reference(sha1
);
659 "Invalid symmetric difference expression %s...%s" :
660 "Invalid revision range %s..%s",
664 if (!cant_be_filename
) {
666 verify_non_filename(revs
->prefix
, arg
);
670 exclude
= get_merge_bases(a
, b
, 1);
671 add_pending_commit_list(revs
, exclude
,
673 free_commit_list(exclude
);
674 a
->object
.flags
|= flags
| SYMMETRIC_LEFT
;
676 a
->object
.flags
|= flags_exclude
;
677 b
->object
.flags
|= flags
;
678 add_pending_object(revs
, &a
->object
, this);
679 add_pending_object(revs
, &b
->object
, next
);
684 dotdot
= strstr(arg
, "^@");
685 if (dotdot
&& !dotdot
[2]) {
687 if (add_parents_only(revs
, arg
, flags
))
691 dotdot
= strstr(arg
, "^!");
692 if (dotdot
&& !dotdot
[2]) {
694 if (!add_parents_only(revs
, arg
, flags
^ UNINTERESTING
))
700 local_flags
= UNINTERESTING
;
703 if (get_sha1(arg
, sha1
))
705 if (!cant_be_filename
)
706 verify_non_filename(revs
->prefix
, arg
);
707 object
= get_reference(revs
, arg
, sha1
, flags
^ local_flags
);
708 add_pending_object(revs
, object
, arg
);
712 static void add_grep(struct rev_info
*revs
, const char *ptn
, enum grep_pat_token what
)
714 if (!revs
->grep_filter
) {
715 struct grep_opt
*opt
= xcalloc(1, sizeof(*opt
));
716 opt
->status_only
= 1;
717 opt
->pattern_tail
= &(opt
->pattern_list
);
718 opt
->regflags
= REG_NEWLINE
;
719 revs
->grep_filter
= opt
;
721 append_grep_pattern(revs
->grep_filter
, ptn
,
722 "command line", 0, what
);
725 static void add_header_grep(struct rev_info
*revs
, const char *field
, const char *pattern
)
731 fldlen
= strlen(field
);
732 patlen
= strlen(pattern
);
733 pat
= xmalloc(patlen
+ fldlen
+ 10);
735 if (*pattern
== '^') {
739 sprintf(pat
, "^%s %s%s", field
, prefix
, pattern
);
740 add_grep(revs
, pat
, GREP_PATTERN_HEAD
);
743 static void add_message_grep(struct rev_info
*revs
, const char *pattern
)
745 add_grep(revs
, pattern
, GREP_PATTERN_BODY
);
748 static void add_ignore_packed(struct rev_info
*revs
, const char *name
)
750 int num
= ++revs
->num_ignore_packed
;
752 revs
->ignore_packed
= xrealloc(revs
->ignore_packed
,
753 sizeof(const char **) * (num
+ 1));
754 revs
->ignore_packed
[num
-1] = name
;
755 revs
->ignore_packed
[num
] = NULL
;
759 * Parse revision information, filling in the "rev_info" structure,
760 * and removing the used arguments from the argument list.
762 * Returns the number of arguments left that weren't recognized
763 * (which are also moved to the head of the argument list)
765 int setup_revisions(int argc
, const char **argv
, struct rev_info
*revs
, const char *def
)
767 int i
, flags
, seen_dashdash
, show_merge
;
768 const char **unrecognized
= argv
+ 1;
772 /* First, search for "--" */
774 for (i
= 1; i
< argc
; i
++) {
775 const char *arg
= argv
[i
];
776 if (strcmp(arg
, "--"))
780 revs
->prune_data
= get_pathspec(revs
->prefix
, argv
+ i
+ 1);
785 flags
= show_merge
= 0;
786 for (i
= 1; i
< argc
; i
++) {
787 const char *arg
= argv
[i
];
790 if (!prefixcmp(arg
, "--max-count=")) {
791 revs
->max_count
= atoi(arg
+ 12);
794 if (!prefixcmp(arg
, "--skip=")) {
795 revs
->skip_count
= atoi(arg
+ 7);
798 /* accept -<digit>, like traditional "head" */
799 if ((*arg
== '-') && isdigit(arg
[1])) {
800 revs
->max_count
= atoi(arg
+ 1);
803 if (!strcmp(arg
, "-n")) {
805 die("-n requires an argument");
806 revs
->max_count
= atoi(argv
[++i
]);
809 if (!prefixcmp(arg
, "-n")) {
810 revs
->max_count
= atoi(arg
+ 2);
813 if (!prefixcmp(arg
, "--max-age=")) {
814 revs
->max_age
= atoi(arg
+ 10);
817 if (!prefixcmp(arg
, "--since=")) {
818 revs
->max_age
= approxidate(arg
+ 8);
821 if (!prefixcmp(arg
, "--after=")) {
822 revs
->max_age
= approxidate(arg
+ 8);
825 if (!prefixcmp(arg
, "--min-age=")) {
826 revs
->min_age
= atoi(arg
+ 10);
829 if (!prefixcmp(arg
, "--before=")) {
830 revs
->min_age
= approxidate(arg
+ 9);
833 if (!prefixcmp(arg
, "--until=")) {
834 revs
->min_age
= approxidate(arg
+ 8);
837 if (!strcmp(arg
, "--all")) {
838 handle_all(revs
, flags
);
841 if (!strcmp(arg
, "--first-parent")) {
842 revs
->first_parent_only
= 1;
845 if (!strcmp(arg
, "--reflog")) {
846 handle_reflog(revs
, flags
);
849 if (!strcmp(arg
, "-g") ||
850 !strcmp(arg
, "--walk-reflogs")) {
851 init_reflog_walk(&revs
->reflog_info
);
854 if (!strcmp(arg
, "--not")) {
855 flags
^= UNINTERESTING
;
858 if (!strcmp(arg
, "--default")) {
860 die("bad --default argument");
864 if (!strcmp(arg
, "--merge")) {
868 if (!strcmp(arg
, "--topo-order")) {
869 revs
->topo_order
= 1;
872 if (!strcmp(arg
, "--date-order")) {
874 revs
->topo_order
= 1;
877 if (!strcmp(arg
, "--parents")) {
881 if (!strcmp(arg
, "--dense")) {
885 if (!strcmp(arg
, "--sparse")) {
889 if (!strcmp(arg
, "--remove-empty")) {
890 revs
->remove_empty_trees
= 1;
893 if (!strcmp(arg
, "--no-merges")) {
897 if (!strcmp(arg
, "--boundary")) {
901 if (!strcmp(arg
, "--left-right")) {
902 revs
->left_right
= 1;
905 if (!strcmp(arg
, "--objects")) {
906 revs
->tag_objects
= 1;
907 revs
->tree_objects
= 1;
908 revs
->blob_objects
= 1;
911 if (!strcmp(arg
, "--objects-edge")) {
912 revs
->tag_objects
= 1;
913 revs
->tree_objects
= 1;
914 revs
->blob_objects
= 1;
918 if (!strcmp(arg
, "--unpacked")) {
920 free(revs
->ignore_packed
);
921 revs
->ignore_packed
= NULL
;
922 revs
->num_ignore_packed
= 0;
925 if (!prefixcmp(arg
, "--unpacked=")) {
927 add_ignore_packed(revs
, arg
+11);
930 if (!strcmp(arg
, "-r")) {
932 revs
->diffopt
.recursive
= 1;
935 if (!strcmp(arg
, "-t")) {
937 revs
->diffopt
.recursive
= 1;
938 revs
->diffopt
.tree_in_recursive
= 1;
941 if (!strcmp(arg
, "-m")) {
942 revs
->ignore_merges
= 0;
945 if (!strcmp(arg
, "-c")) {
947 revs
->dense_combined_merges
= 0;
948 revs
->combine_merges
= 1;
951 if (!strcmp(arg
, "--cc")) {
953 revs
->dense_combined_merges
= 1;
954 revs
->combine_merges
= 1;
957 if (!strcmp(arg
, "-v")) {
958 revs
->verbose_header
= 1;
961 if (!prefixcmp(arg
, "--pretty")) {
962 revs
->verbose_header
= 1;
963 revs
->commit_format
= get_commit_format(arg
+8);
966 if (!strcmp(arg
, "--root")) {
967 revs
->show_root_diff
= 1;
970 if (!strcmp(arg
, "--no-commit-id")) {
971 revs
->no_commit_id
= 1;
974 if (!strcmp(arg
, "--always")) {
975 revs
->always_show_header
= 1;
978 if (!strcmp(arg
, "--no-abbrev")) {
982 if (!strcmp(arg
, "--abbrev")) {
983 revs
->abbrev
= DEFAULT_ABBREV
;
986 if (!prefixcmp(arg
, "--abbrev=")) {
987 revs
->abbrev
= strtoul(arg
+ 9, NULL
, 10);
988 if (revs
->abbrev
< MINIMUM_ABBREV
)
989 revs
->abbrev
= MINIMUM_ABBREV
;
990 else if (revs
->abbrev
> 40)
994 if (!strcmp(arg
, "--abbrev-commit")) {
995 revs
->abbrev_commit
= 1;
998 if (!strcmp(arg
, "--full-diff")) {
1000 revs
->full_diff
= 1;
1003 if (!strcmp(arg
, "--full-history")) {
1004 revs
->simplify_history
= 0;
1007 if (!strcmp(arg
, "--relative-date")) {
1008 revs
->relative_date
= 1;
1013 * Grepping the commit log
1015 if (!prefixcmp(arg
, "--author=")) {
1016 add_header_grep(revs
, "author", arg
+9);
1019 if (!prefixcmp(arg
, "--committer=")) {
1020 add_header_grep(revs
, "committer", arg
+12);
1023 if (!prefixcmp(arg
, "--grep=")) {
1024 add_message_grep(revs
, arg
+7);
1027 if (!strcmp(arg
, "--all-match")) {
1031 if (!prefixcmp(arg
, "--encoding=")) {
1033 if (strcmp(arg
, "none"))
1034 git_log_output_encoding
= strdup(arg
);
1036 git_log_output_encoding
= "";
1039 if (!strcmp(arg
, "--reverse")) {
1044 opts
= diff_opt_parse(&revs
->diffopt
, argv
+i
, argc
-i
);
1050 *unrecognized
++ = arg
;
1055 if (handle_revision_arg(arg
, revs
, flags
, seen_dashdash
)) {
1057 if (seen_dashdash
|| *arg
== '^')
1058 die("bad revision '%s'", arg
);
1060 /* If we didn't have a "--":
1061 * (1) all filenames must exist;
1062 * (2) all rev-args must not be interpretable
1063 * as a valid filename.
1064 * but the latter we have checked in the main loop.
1066 for (j
= i
; j
< argc
; j
++)
1067 verify_filename(revs
->prefix
, argv
[j
]);
1069 revs
->prune_data
= get_pathspec(revs
->prefix
,
1076 prepare_show_merge(revs
);
1077 if (def
&& !revs
->pending
.nr
) {
1078 unsigned char sha1
[20];
1079 struct object
*object
;
1080 if (get_sha1(def
, sha1
))
1081 die("bad default revision '%s'", def
);
1082 object
= get_reference(revs
, def
, sha1
, 0);
1083 add_pending_object(revs
, object
, def
);
1086 if (revs
->topo_order
)
1089 if (revs
->prune_data
) {
1090 diff_tree_setup_paths(revs
->prune_data
, &revs
->pruning
);
1091 revs
->prune_fn
= try_to_simplify_commit
;
1092 if (!revs
->full_diff
)
1093 diff_tree_setup_paths(revs
->prune_data
, &revs
->diffopt
);
1095 if (revs
->combine_merges
) {
1096 revs
->ignore_merges
= 0;
1097 if (revs
->dense_combined_merges
&& !revs
->diffopt
.output_format
)
1098 revs
->diffopt
.output_format
= DIFF_FORMAT_PATCH
;
1100 revs
->diffopt
.abbrev
= revs
->abbrev
;
1101 if (diff_setup_done(&revs
->diffopt
) < 0)
1102 die("diff_setup_done failed");
1104 if (revs
->grep_filter
) {
1105 revs
->grep_filter
->all_match
= all_match
;
1106 compile_grep_patterns(revs
->grep_filter
);
1112 void prepare_revision_walk(struct rev_info
*revs
)
1114 int nr
= revs
->pending
.nr
;
1115 struct object_array_entry
*e
, *list
;
1117 e
= list
= revs
->pending
.objects
;
1118 revs
->pending
.nr
= 0;
1119 revs
->pending
.alloc
= 0;
1120 revs
->pending
.objects
= NULL
;
1122 struct commit
*commit
= handle_commit(revs
, e
->item
, e
->name
);
1124 if (!(commit
->object
.flags
& SEEN
)) {
1125 commit
->object
.flags
|= SEEN
;
1126 insert_by_date(commit
, &revs
->commits
);
1137 if (revs
->topo_order
)
1138 sort_in_topological_order_fn(&revs
->commits
, revs
->lifo
,
1143 static int rewrite_one(struct rev_info
*revs
, struct commit
**pp
)
1146 struct commit
*p
= *pp
;
1148 add_parents_to_list(revs
, p
, &revs
->commits
);
1149 if (p
->parents
&& p
->parents
->next
)
1151 if (p
->object
.flags
& (TREECHANGE
| UNINTERESTING
))
1155 *pp
= p
->parents
->item
;
1159 static void rewrite_parents(struct rev_info
*revs
, struct commit
*commit
)
1161 struct commit_list
**pp
= &commit
->parents
;
1163 struct commit_list
*parent
= *pp
;
1164 if (rewrite_one(revs
, &parent
->item
) < 0) {
1172 static int commit_match(struct commit
*commit
, struct rev_info
*opt
)
1174 if (!opt
->grep_filter
)
1176 return grep_buffer(opt
->grep_filter
,
1177 NULL
, /* we say nothing, not even filename */
1178 commit
->buffer
, strlen(commit
->buffer
));
1181 static struct commit
*get_revision_1(struct rev_info
*revs
)
1187 struct commit_list
*entry
= revs
->commits
;
1188 struct commit
*commit
= entry
->item
;
1190 revs
->commits
= entry
->next
;
1193 if (revs
->reflog_info
)
1194 fake_reflog_parent(revs
->reflog_info
, commit
);
1197 * If we haven't done the list limiting, we need to look at
1198 * the parents here. We also need to do the date-based limiting
1199 * that we'd otherwise have done in limit_list().
1201 if (!revs
->limited
) {
1202 if (revs
->max_age
!= -1 &&
1203 (commit
->date
< revs
->max_age
))
1205 add_parents_to_list(revs
, commit
, &revs
->commits
);
1207 if (commit
->object
.flags
& SHOWN
)
1210 if (revs
->unpacked
&& has_sha1_pack(commit
->object
.sha1
,
1211 revs
->ignore_packed
))
1214 if (commit
->object
.flags
& UNINTERESTING
)
1216 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
))
1218 if (revs
->no_merges
&&
1219 commit
->parents
&& commit
->parents
->next
)
1221 if (!commit_match(commit
, revs
))
1223 if (revs
->prune_fn
&& revs
->dense
) {
1224 /* Commit without changes? */
1225 if (!(commit
->object
.flags
& TREECHANGE
)) {
1226 /* drop merges unless we want parenthood */
1229 /* non-merge - always ignore it */
1230 if (!commit
->parents
|| !commit
->parents
->next
)
1234 rewrite_parents(revs
, commit
);
1237 } while (revs
->commits
);
1241 static void gc_boundary(struct object_array
*array
)
1243 unsigned nr
= array
->nr
;
1244 unsigned alloc
= array
->alloc
;
1245 struct object_array_entry
*objects
= array
->objects
;
1249 for (i
= j
= 0; i
< nr
; i
++) {
1250 if (objects
[i
].item
->flags
& SHOWN
)
1253 objects
[j
] = objects
[i
];
1256 for (i
= j
; i
< nr
; i
++)
1257 objects
[i
].item
= NULL
;
1262 struct commit
*get_revision(struct rev_info
*revs
)
1264 struct commit
*c
= NULL
;
1265 struct commit_list
*l
;
1267 if (revs
->boundary
== 2) {
1269 struct object_array
*array
= &revs
->boundary_commits
;
1270 struct object_array_entry
*objects
= array
->objects
;
1271 for (i
= 0; i
< array
->nr
; i
++) {
1272 c
= (struct commit
*)(objects
[i
].item
);
1275 if (!(c
->object
.flags
& CHILD_SHOWN
))
1277 if (!(c
->object
.flags
& SHOWN
))
1283 c
->object
.flags
|= SHOWN
| BOUNDARY
;
1287 if (revs
->reverse
) {
1290 if (0 <= revs
->max_count
) {
1291 limit
= revs
->max_count
;
1292 if (0 < revs
->skip_count
)
1293 limit
+= revs
->skip_count
;
1296 while ((c
= get_revision_1(revs
))) {
1297 commit_list_insert(c
, &l
);
1298 if ((0 < limit
) && !--limit
)
1303 revs
->max_count
= -1;
1308 * Now pick up what they want to give us
1310 c
= get_revision_1(revs
);
1312 while (0 < revs
->skip_count
) {
1314 c
= get_revision_1(revs
);
1321 * Check the max_count.
1323 switch (revs
->max_count
) {
1334 c
->object
.flags
|= SHOWN
;
1336 if (!revs
->boundary
) {
1342 * get_revision_1() runs out the commits, and
1343 * we are done computing the boundaries.
1344 * switch to boundary commits output mode.
1347 return get_revision(revs
);
1351 * boundary commits are the commits that are parents of the
1352 * ones we got from get_revision_1() but they themselves are
1353 * not returned from get_revision_1(). Before returning
1354 * 'c', we need to mark its parents that they could be boundaries.
1357 for (l
= c
->parents
; l
; l
= l
->next
) {
1359 p
= &(l
->item
->object
);
1360 if (p
->flags
& (CHILD_SHOWN
| SHOWN
))
1362 p
->flags
|= CHILD_SHOWN
;
1363 gc_boundary(&revs
->boundary_commits
);
1364 add_object_array(p
, NULL
, &revs
->boundary_commits
);