11 static char *path_name(struct name_path
*path
, const char *name
)
15 int nlen
= strlen(name
);
18 for (p
= path
; p
; p
= p
->up
) {
20 len
+= p
->elem_len
+ 1;
23 m
= n
+ len
- (nlen
+ 1);
25 for (p
= path
; p
; p
= p
->up
) {
28 memcpy(m
, p
->elem
, p
->elem_len
);
35 void add_object(struct object
*obj
,
36 struct object_array
*p
,
37 struct name_path
*path
,
40 add_object_array(obj
, path_name(path
, name
), p
);
43 static void mark_blob_uninteresting(struct blob
*blob
)
45 if (blob
->object
.flags
& UNINTERESTING
)
47 blob
->object
.flags
|= UNINTERESTING
;
50 void mark_tree_uninteresting(struct tree
*tree
)
52 struct tree_desc desc
;
53 struct name_entry entry
;
54 struct object
*obj
= &tree
->object
;
56 if (obj
->flags
& UNINTERESTING
)
58 obj
->flags
|= UNINTERESTING
;
59 if (!has_sha1_file(obj
->sha1
))
61 if (parse_tree(tree
) < 0)
62 die("bad tree %s", sha1_to_hex(obj
->sha1
));
64 desc
.buf
= tree
->buffer
;
65 desc
.size
= tree
->size
;
66 while (tree_entry(&desc
, &entry
)) {
67 if (S_ISDIR(entry
.mode
))
68 mark_tree_uninteresting(lookup_tree(entry
.sha1
));
70 mark_blob_uninteresting(lookup_blob(entry
.sha1
));
74 * We don't care about the tree any more
75 * after it has been marked uninteresting.
81 void mark_parents_uninteresting(struct commit
*commit
)
83 struct commit_list
*parents
= commit
->parents
;
86 struct commit
*commit
= parents
->item
;
87 if (!(commit
->object
.flags
& UNINTERESTING
)) {
88 commit
->object
.flags
|= UNINTERESTING
;
91 * Normally we haven't parsed the parent
92 * yet, so we won't have a parent of a parent
93 * here. However, it may turn out that we've
94 * reached this commit some other way (where it
95 * wasn't uninteresting), in which case we need
96 * to mark its parents recursively too..
99 mark_parents_uninteresting(commit
);
103 * A missing commit is ok iff its parent is marked
106 * We just mark such a thing parsed, so that when
107 * it is popped next time around, we won't be trying
108 * to parse it and get an error.
110 if (!has_sha1_file(commit
->object
.sha1
))
111 commit
->object
.parsed
= 1;
112 parents
= parents
->next
;
116 void add_pending_object(struct rev_info
*revs
, struct object
*obj
, const char *name
)
118 add_object_array(obj
, name
, &revs
->pending
);
121 static struct object
*get_reference(struct rev_info
*revs
, const char *name
, const unsigned char *sha1
, unsigned int flags
)
123 struct object
*object
;
125 object
= parse_object(sha1
);
127 die("bad object %s", name
);
128 object
->flags
|= flags
;
132 static struct commit
*handle_commit(struct rev_info
*revs
, struct object
*object
, const char *name
)
134 unsigned long flags
= object
->flags
;
137 * Tag object? Look what it points to..
139 while (object
->type
== OBJ_TAG
) {
140 struct tag
*tag
= (struct tag
*) object
;
141 if (revs
->tag_objects
&& !(flags
& UNINTERESTING
))
142 add_pending_object(revs
, object
, tag
->tag
);
143 object
= parse_object(tag
->tagged
->sha1
);
145 die("bad object %s", sha1_to_hex(tag
->tagged
->sha1
));
149 * Commit object? Just return it, we'll do all the complex
152 if (object
->type
== OBJ_COMMIT
) {
153 struct commit
*commit
= (struct commit
*)object
;
154 if (parse_commit(commit
) < 0)
155 die("unable to parse commit %s", name
);
156 if (flags
& UNINTERESTING
) {
157 commit
->object
.flags
|= UNINTERESTING
;
158 mark_parents_uninteresting(commit
);
165 * Tree object? Either mark it uniniteresting, or add it
166 * to the list of objects to look at later..
168 if (object
->type
== OBJ_TREE
) {
169 struct tree
*tree
= (struct tree
*)object
;
170 if (!revs
->tree_objects
)
172 if (flags
& UNINTERESTING
) {
173 mark_tree_uninteresting(tree
);
176 add_pending_object(revs
, object
, "");
181 * Blob object? You know the drill by now..
183 if (object
->type
== OBJ_BLOB
) {
184 struct blob
*blob
= (struct blob
*)object
;
185 if (!revs
->blob_objects
)
187 if (flags
& UNINTERESTING
) {
188 mark_blob_uninteresting(blob
);
191 add_pending_object(revs
, object
, "");
194 die("%s is unknown object", name
);
197 static int everybody_uninteresting(struct commit_list
*orig
)
199 struct commit_list
*list
= orig
;
201 struct commit
*commit
= list
->item
;
203 if (commit
->object
.flags
& UNINTERESTING
)
210 static int tree_difference
= REV_TREE_SAME
;
212 static void file_add_remove(struct diff_options
*options
,
213 int addremove
, unsigned mode
,
214 const unsigned char *sha1
,
215 const char *base
, const char *path
)
217 int diff
= REV_TREE_DIFFERENT
;
220 * Is it an add of a new file? It means that the old tree
221 * didn't have it at all, so we will turn "REV_TREE_SAME" ->
222 * "REV_TREE_NEW", but leave any "REV_TREE_DIFFERENT" alone
223 * (and if it already was "REV_TREE_NEW", we'll keep it
224 * "REV_TREE_NEW" of course).
226 if (addremove
== '+') {
227 diff
= tree_difference
;
228 if (diff
!= REV_TREE_SAME
)
232 tree_difference
= diff
;
235 static void file_change(struct diff_options
*options
,
236 unsigned old_mode
, unsigned new_mode
,
237 const unsigned char *old_sha1
,
238 const unsigned char *new_sha1
,
239 const char *base
, const char *path
)
241 tree_difference
= REV_TREE_DIFFERENT
;
244 int rev_compare_tree(struct rev_info
*revs
, struct tree
*t1
, struct tree
*t2
)
249 return REV_TREE_DIFFERENT
;
250 tree_difference
= REV_TREE_SAME
;
251 if (diff_tree_sha1(t1
->object
.sha1
, t2
->object
.sha1
, "",
253 return REV_TREE_DIFFERENT
;
254 return tree_difference
;
257 int rev_same_tree_as_empty(struct rev_info
*revs
, struct tree
*t1
)
261 struct tree_desc empty
, real
;
266 tree
= read_object_with_reference(t1
->object
.sha1
, tree_type
, &real
.size
, NULL
);
275 retval
= diff_tree(&empty
, &real
, "", &revs
->pruning
);
278 return retval
>= 0 && !tree_difference
;
281 static void try_to_simplify_commit(struct rev_info
*revs
, struct commit
*commit
)
283 struct commit_list
**pp
, *parent
;
284 int tree_changed
= 0, tree_same
= 0;
289 if (!commit
->parents
) {
290 if (!rev_same_tree_as_empty(revs
, commit
->tree
))
291 commit
->object
.flags
|= TREECHANGE
;
295 pp
= &commit
->parents
;
296 while ((parent
= *pp
) != NULL
) {
297 struct commit
*p
= parent
->item
;
300 switch (rev_compare_tree(revs
, p
->tree
, commit
->tree
)) {
303 if (!revs
->simplify_history
|| (p
->object
.flags
& UNINTERESTING
)) {
304 /* Even if a merge with an uninteresting
305 * side branch brought the entire change
306 * we are interested in, we do not want
307 * to lose the other branches of this
308 * merge, so we just keep going.
314 commit
->parents
= parent
;
318 if (revs
->remove_empty_trees
&&
319 rev_same_tree_as_empty(revs
, p
->tree
)) {
320 /* We are adding all the specified
321 * paths from this parent, so the
322 * history beyond this parent is not
323 * interesting. Remove its parents
324 * (they are grandparents for us).
325 * IOW, we pretend this parent is a
332 case REV_TREE_DIFFERENT
:
337 die("bad tree compare for commit %s", sha1_to_hex(commit
->object
.sha1
));
339 if (tree_changed
&& !tree_same
)
340 commit
->object
.flags
|= TREECHANGE
;
343 static void add_parents_to_list(struct rev_info
*revs
, struct commit
*commit
, struct commit_list
**list
)
345 struct commit_list
*parent
= commit
->parents
;
348 if (commit
->object
.flags
& ADDED
)
350 commit
->object
.flags
|= ADDED
;
353 * If the commit is uninteresting, don't try to
354 * prune parents - we want the maximal uninteresting
357 * Normally we haven't parsed the parent
358 * yet, so we won't have a parent of a parent
359 * here. However, it may turn out that we've
360 * reached this commit some other way (where it
361 * wasn't uninteresting), in which case we need
362 * to mark its parents recursively too..
364 if (commit
->object
.flags
& UNINTERESTING
) {
366 struct commit
*p
= parent
->item
;
367 parent
= parent
->next
;
369 p
->object
.flags
|= UNINTERESTING
;
371 mark_parents_uninteresting(p
);
372 if (p
->object
.flags
& SEEN
)
374 p
->object
.flags
|= SEEN
;
375 insert_by_date(p
, list
);
381 * Ok, the commit wasn't uninteresting. Try to
382 * simplify the commit history and find the parent
383 * that has no differences in the path set if one exists.
386 revs
->prune_fn(revs
, commit
);
391 left_flag
= (commit
->object
.flags
& SYMMETRIC_LEFT
);
392 parent
= commit
->parents
;
394 struct commit
*p
= parent
->item
;
396 parent
= parent
->next
;
399 p
->object
.flags
|= left_flag
;
400 if (p
->object
.flags
& SEEN
)
402 p
->object
.flags
|= SEEN
;
403 insert_by_date(p
, list
);
407 static void limit_list(struct rev_info
*revs
)
409 struct commit_list
*list
= revs
->commits
;
410 struct commit_list
*newlist
= NULL
;
411 struct commit_list
**p
= &newlist
;
414 struct commit_list
*entry
= list
;
415 struct commit
*commit
= list
->item
;
416 struct object
*obj
= &commit
->object
;
421 if (revs
->max_age
!= -1 && (commit
->date
< revs
->max_age
))
422 obj
->flags
|= UNINTERESTING
;
423 add_parents_to_list(revs
, commit
, &list
);
424 if (obj
->flags
& UNINTERESTING
) {
425 mark_parents_uninteresting(commit
);
426 if (everybody_uninteresting(list
))
430 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
))
432 p
= &commit_list_insert(commit
, p
)->next
;
434 if (revs
->boundary
) {
435 /* mark the ones that are on the result list first */
436 for (list
= newlist
; list
; list
= list
->next
) {
437 struct commit
*commit
= list
->item
;
438 commit
->object
.flags
|= TMP_MARK
;
440 for (list
= newlist
; list
; list
= list
->next
) {
441 struct commit
*commit
= list
->item
;
442 struct object
*obj
= &commit
->object
;
443 struct commit_list
*parent
;
444 if (obj
->flags
& UNINTERESTING
)
446 for (parent
= commit
->parents
;
448 parent
= parent
->next
) {
449 struct commit
*pcommit
= parent
->item
;
450 if (!(pcommit
->object
.flags
& UNINTERESTING
))
452 pcommit
->object
.flags
|= BOUNDARY
;
453 if (pcommit
->object
.flags
& TMP_MARK
)
455 pcommit
->object
.flags
|= TMP_MARK
;
456 p
= &commit_list_insert(pcommit
, p
)->next
;
459 for (list
= newlist
; list
; list
= list
->next
) {
460 struct commit
*commit
= list
->item
;
461 commit
->object
.flags
&= ~TMP_MARK
;
464 revs
->commits
= newlist
;
469 int warned_bad_reflog
;
470 struct rev_info
*all_revs
;
471 const char *name_for_errormsg
;
474 static int handle_one_ref(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
476 struct all_refs_cb
*cb
= cb_data
;
477 struct object
*object
= get_reference(cb
->all_revs
, path
, sha1
,
479 add_pending_object(cb
->all_revs
, object
, "");
483 static void handle_all(struct rev_info
*revs
, unsigned flags
)
485 struct all_refs_cb cb
;
487 cb
.all_flags
= flags
;
488 for_each_ref(handle_one_ref
, &cb
);
491 static void handle_one_reflog_commit(unsigned char *sha1
, void *cb_data
)
493 struct all_refs_cb
*cb
= cb_data
;
494 if (!is_null_sha1(sha1
)) {
495 struct object
*o
= parse_object(sha1
);
497 o
->flags
|= cb
->all_flags
;
498 add_pending_object(cb
->all_revs
, o
, "");
500 else if (!cb
->warned_bad_reflog
) {
501 warn("reflog of '%s' references pruned commits",
502 cb
->name_for_errormsg
);
503 cb
->warned_bad_reflog
= 1;
508 static int handle_one_reflog_ent(unsigned char *osha1
, unsigned char *nsha1
, char *detail
, void *cb_data
)
510 handle_one_reflog_commit(osha1
, cb_data
);
511 handle_one_reflog_commit(nsha1
, cb_data
);
515 static int handle_one_reflog(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
517 struct all_refs_cb
*cb
= cb_data
;
518 cb
->warned_bad_reflog
= 0;
519 cb
->name_for_errormsg
= path
;
520 for_each_reflog_ent(path
, handle_one_reflog_ent
, cb_data
);
524 static void handle_reflog(struct rev_info
*revs
, unsigned flags
)
526 struct all_refs_cb cb
;
528 cb
.all_flags
= flags
;
529 for_each_ref(handle_one_reflog
, &cb
);
532 static int add_parents_only(struct rev_info
*revs
, const char *arg
, int flags
)
534 unsigned char sha1
[20];
536 struct commit
*commit
;
537 struct commit_list
*parents
;
540 flags
^= UNINTERESTING
;
543 if (get_sha1(arg
, sha1
))
546 it
= get_reference(revs
, arg
, sha1
, 0);
547 if (it
->type
!= OBJ_TAG
)
549 hashcpy(sha1
, ((struct tag
*)it
)->tagged
->sha1
);
551 if (it
->type
!= OBJ_COMMIT
)
553 commit
= (struct commit
*)it
;
554 for (parents
= commit
->parents
; parents
; parents
= parents
->next
) {
555 it
= &parents
->item
->object
;
557 add_pending_object(revs
, it
, arg
);
562 void init_revisions(struct rev_info
*revs
, const char *prefix
)
564 memset(revs
, 0, sizeof(*revs
));
566 revs
->abbrev
= DEFAULT_ABBREV
;
567 revs
->ignore_merges
= 1;
568 revs
->simplify_history
= 1;
569 revs
->pruning
.recursive
= 1;
570 revs
->pruning
.add_remove
= file_add_remove
;
571 revs
->pruning
.change
= file_change
;
574 revs
->prefix
= prefix
;
577 revs
->skip_count
= -1;
578 revs
->max_count
= -1;
580 revs
->prune_fn
= NULL
;
581 revs
->prune_data
= NULL
;
583 revs
->topo_setter
= topo_sort_default_setter
;
584 revs
->topo_getter
= topo_sort_default_getter
;
586 revs
->commit_format
= CMIT_FMT_DEFAULT
;
588 diff_setup(&revs
->diffopt
);
591 static void add_pending_commit_list(struct rev_info
*revs
,
592 struct commit_list
*commit_list
,
595 while (commit_list
) {
596 struct object
*object
= &commit_list
->item
->object
;
597 object
->flags
|= flags
;
598 add_pending_object(revs
, object
, sha1_to_hex(object
->sha1
));
599 commit_list
= commit_list
->next
;
603 static void prepare_show_merge(struct rev_info
*revs
)
605 struct commit_list
*bases
;
606 struct commit
*head
, *other
;
607 unsigned char sha1
[20];
608 const char **prune
= NULL
;
609 int i
, prune_num
= 1; /* counting terminating NULL */
611 if (get_sha1("HEAD", sha1
) || !(head
= lookup_commit(sha1
)))
612 die("--merge without HEAD?");
613 if (get_sha1("MERGE_HEAD", sha1
) || !(other
= lookup_commit(sha1
)))
614 die("--merge without MERGE_HEAD?");
615 add_pending_object(revs
, &head
->object
, "HEAD");
616 add_pending_object(revs
, &other
->object
, "MERGE_HEAD");
617 bases
= get_merge_bases(head
, other
, 1);
619 struct commit
*it
= bases
->item
;
620 struct commit_list
*n
= bases
->next
;
623 it
->object
.flags
|= UNINTERESTING
;
624 add_pending_object(revs
, &it
->object
, "(merge-base)");
629 for (i
= 0; i
< active_nr
; i
++) {
630 struct cache_entry
*ce
= active_cache
[i
];
633 if (ce_path_match(ce
, revs
->prune_data
)) {
635 prune
= xrealloc(prune
, sizeof(*prune
) * prune_num
);
636 prune
[prune_num
-2] = ce
->name
;
637 prune
[prune_num
-1] = NULL
;
639 while ((i
+1 < active_nr
) &&
640 ce_same_name(ce
, active_cache
[i
+1]))
643 revs
->prune_data
= prune
;
646 int handle_revision_arg(const char *arg
, struct rev_info
*revs
,
648 int cant_be_filename
)
651 struct object
*object
;
652 unsigned char sha1
[20];
655 dotdot
= strstr(arg
, "..");
657 unsigned char from_sha1
[20];
658 const char *next
= dotdot
+ 2;
659 const char *this = arg
;
660 int symmetric
= *next
== '.';
661 unsigned int flags_exclude
= flags
^ UNINTERESTING
;
670 if (!get_sha1(this, from_sha1
) &&
671 !get_sha1(next
, sha1
)) {
672 struct commit
*a
, *b
;
673 struct commit_list
*exclude
;
675 a
= lookup_commit_reference(from_sha1
);
676 b
= lookup_commit_reference(sha1
);
679 "Invalid symmetric difference expression %s...%s" :
680 "Invalid revision range %s..%s",
684 if (!cant_be_filename
) {
686 verify_non_filename(revs
->prefix
, arg
);
690 exclude
= get_merge_bases(a
, b
, 1);
691 add_pending_commit_list(revs
, exclude
,
693 free_commit_list(exclude
);
694 a
->object
.flags
|= flags
| SYMMETRIC_LEFT
;
696 a
->object
.flags
|= flags_exclude
;
697 b
->object
.flags
|= flags
;
698 add_pending_object(revs
, &a
->object
, this);
699 add_pending_object(revs
, &b
->object
, next
);
704 dotdot
= strstr(arg
, "^@");
705 if (dotdot
&& !dotdot
[2]) {
707 if (add_parents_only(revs
, arg
, flags
))
711 dotdot
= strstr(arg
, "^!");
712 if (dotdot
&& !dotdot
[2]) {
714 if (!add_parents_only(revs
, arg
, flags
^ UNINTERESTING
))
720 local_flags
= UNINTERESTING
;
723 if (get_sha1(arg
, sha1
))
725 if (!cant_be_filename
)
726 verify_non_filename(revs
->prefix
, arg
);
727 object
= get_reference(revs
, arg
, sha1
, flags
^ local_flags
);
728 add_pending_object(revs
, object
, arg
);
732 static void add_grep(struct rev_info
*revs
, const char *ptn
, enum grep_pat_token what
)
734 if (!revs
->grep_filter
) {
735 struct grep_opt
*opt
= xcalloc(1, sizeof(*opt
));
736 opt
->status_only
= 1;
737 opt
->pattern_tail
= &(opt
->pattern_list
);
738 opt
->regflags
= REG_NEWLINE
;
739 revs
->grep_filter
= opt
;
741 append_grep_pattern(revs
->grep_filter
, ptn
,
742 "command line", 0, what
);
745 static void add_header_grep(struct rev_info
*revs
, const char *field
, const char *pattern
)
751 fldlen
= strlen(field
);
752 patlen
= strlen(pattern
);
753 pat
= xmalloc(patlen
+ fldlen
+ 10);
755 if (*pattern
== '^') {
759 sprintf(pat
, "^%s %s%s", field
, prefix
, pattern
);
760 add_grep(revs
, pat
, GREP_PATTERN_HEAD
);
763 static void add_message_grep(struct rev_info
*revs
, const char *pattern
)
765 add_grep(revs
, pattern
, GREP_PATTERN_BODY
);
768 static void add_ignore_packed(struct rev_info
*revs
, const char *name
)
770 int num
= ++revs
->num_ignore_packed
;
772 revs
->ignore_packed
= xrealloc(revs
->ignore_packed
,
773 sizeof(const char **) * (num
+ 1));
774 revs
->ignore_packed
[num
-1] = name
;
775 revs
->ignore_packed
[num
] = NULL
;
779 * Parse revision information, filling in the "rev_info" structure,
780 * and removing the used arguments from the argument list.
782 * Returns the number of arguments left that weren't recognized
783 * (which are also moved to the head of the argument list)
785 int setup_revisions(int argc
, const char **argv
, struct rev_info
*revs
, const char *def
)
787 int i
, flags
, seen_dashdash
, show_merge
;
788 const char **unrecognized
= argv
+ 1;
792 /* First, search for "--" */
794 for (i
= 1; i
< argc
; i
++) {
795 const char *arg
= argv
[i
];
796 if (strcmp(arg
, "--"))
800 revs
->prune_data
= get_pathspec(revs
->prefix
, argv
+ i
+ 1);
805 flags
= show_merge
= 0;
806 for (i
= 1; i
< argc
; i
++) {
807 const char *arg
= argv
[i
];
810 if (!strncmp(arg
, "--max-count=", 12)) {
811 revs
->max_count
= atoi(arg
+ 12);
814 if (!strncmp(arg
, "--skip=", 7)) {
815 revs
->skip_count
= atoi(arg
+ 7);
818 /* accept -<digit>, like traditional "head" */
819 if ((*arg
== '-') && isdigit(arg
[1])) {
820 revs
->max_count
= atoi(arg
+ 1);
823 if (!strcmp(arg
, "-n")) {
825 die("-n requires an argument");
826 revs
->max_count
= atoi(argv
[++i
]);
829 if (!strncmp(arg
,"-n",2)) {
830 revs
->max_count
= atoi(arg
+ 2);
833 if (!strncmp(arg
, "--max-age=", 10)) {
834 revs
->max_age
= atoi(arg
+ 10);
837 if (!strncmp(arg
, "--since=", 8)) {
838 revs
->max_age
= approxidate(arg
+ 8);
841 if (!strncmp(arg
, "--after=", 8)) {
842 revs
->max_age
= approxidate(arg
+ 8);
845 if (!strncmp(arg
, "--min-age=", 10)) {
846 revs
->min_age
= atoi(arg
+ 10);
849 if (!strncmp(arg
, "--before=", 9)) {
850 revs
->min_age
= approxidate(arg
+ 9);
853 if (!strncmp(arg
, "--until=", 8)) {
854 revs
->min_age
= approxidate(arg
+ 8);
857 if (!strcmp(arg
, "--all")) {
858 handle_all(revs
, flags
);
861 if (!strcmp(arg
, "--reflog")) {
862 handle_reflog(revs
, flags
);
865 if (!strcmp(arg
, "--not")) {
866 flags
^= UNINTERESTING
;
869 if (!strcmp(arg
, "--default")) {
871 die("bad --default argument");
875 if (!strcmp(arg
, "--merge")) {
879 if (!strcmp(arg
, "--topo-order")) {
880 revs
->topo_order
= 1;
883 if (!strcmp(arg
, "--date-order")) {
885 revs
->topo_order
= 1;
888 if (!strcmp(arg
, "--parents")) {
892 if (!strcmp(arg
, "--dense")) {
896 if (!strcmp(arg
, "--sparse")) {
900 if (!strcmp(arg
, "--remove-empty")) {
901 revs
->remove_empty_trees
= 1;
904 if (!strcmp(arg
, "--no-merges")) {
908 if (!strcmp(arg
, "--boundary")) {
912 if (!strcmp(arg
, "--left-right")) {
913 revs
->left_right
= 1;
916 if (!strcmp(arg
, "--objects")) {
917 revs
->tag_objects
= 1;
918 revs
->tree_objects
= 1;
919 revs
->blob_objects
= 1;
922 if (!strcmp(arg
, "--objects-edge")) {
923 revs
->tag_objects
= 1;
924 revs
->tree_objects
= 1;
925 revs
->blob_objects
= 1;
929 if (!strcmp(arg
, "--unpacked")) {
931 free(revs
->ignore_packed
);
932 revs
->ignore_packed
= NULL
;
933 revs
->num_ignore_packed
= 0;
936 if (!strncmp(arg
, "--unpacked=", 11)) {
938 add_ignore_packed(revs
, arg
+11);
941 if (!strcmp(arg
, "-r")) {
943 revs
->diffopt
.recursive
= 1;
946 if (!strcmp(arg
, "-t")) {
948 revs
->diffopt
.recursive
= 1;
949 revs
->diffopt
.tree_in_recursive
= 1;
952 if (!strcmp(arg
, "-m")) {
953 revs
->ignore_merges
= 0;
956 if (!strcmp(arg
, "-c")) {
958 revs
->dense_combined_merges
= 0;
959 revs
->combine_merges
= 1;
962 if (!strcmp(arg
, "--cc")) {
964 revs
->dense_combined_merges
= 1;
965 revs
->combine_merges
= 1;
968 if (!strcmp(arg
, "-v")) {
969 revs
->verbose_header
= 1;
972 if (!strncmp(arg
, "--pretty", 8)) {
973 revs
->verbose_header
= 1;
974 revs
->commit_format
= get_commit_format(arg
+8);
977 if (!strcmp(arg
, "--root")) {
978 revs
->show_root_diff
= 1;
981 if (!strcmp(arg
, "--no-commit-id")) {
982 revs
->no_commit_id
= 1;
985 if (!strcmp(arg
, "--always")) {
986 revs
->always_show_header
= 1;
989 if (!strcmp(arg
, "--no-abbrev")) {
993 if (!strcmp(arg
, "--abbrev")) {
994 revs
->abbrev
= DEFAULT_ABBREV
;
997 if (!strncmp(arg
, "--abbrev=", 9)) {
998 revs
->abbrev
= strtoul(arg
+ 9, NULL
, 10);
999 if (revs
->abbrev
< MINIMUM_ABBREV
)
1000 revs
->abbrev
= MINIMUM_ABBREV
;
1001 else if (revs
->abbrev
> 40)
1005 if (!strcmp(arg
, "--abbrev-commit")) {
1006 revs
->abbrev_commit
= 1;
1009 if (!strcmp(arg
, "--full-diff")) {
1011 revs
->full_diff
= 1;
1014 if (!strcmp(arg
, "--full-history")) {
1015 revs
->simplify_history
= 0;
1018 if (!strcmp(arg
, "--relative-date")) {
1019 revs
->relative_date
= 1;
1024 * Grepping the commit log
1026 if (!strncmp(arg
, "--author=", 9)) {
1027 add_header_grep(revs
, "author", arg
+9);
1030 if (!strncmp(arg
, "--committer=", 12)) {
1031 add_header_grep(revs
, "committer", arg
+12);
1034 if (!strncmp(arg
, "--grep=", 7)) {
1035 add_message_grep(revs
, arg
+7);
1038 if (!strcmp(arg
, "--all-match")) {
1043 opts
= diff_opt_parse(&revs
->diffopt
, argv
+i
, argc
-i
);
1049 *unrecognized
++ = arg
;
1054 if (handle_revision_arg(arg
, revs
, flags
, seen_dashdash
)) {
1056 if (seen_dashdash
|| *arg
== '^')
1057 die("bad revision '%s'", arg
);
1059 /* If we didn't have a "--":
1060 * (1) all filenames must exist;
1061 * (2) all rev-args must not be interpretable
1062 * as a valid filename.
1063 * but the latter we have checked in the main loop.
1065 for (j
= i
; j
< argc
; j
++)
1066 verify_filename(revs
->prefix
, argv
[j
]);
1068 revs
->prune_data
= get_pathspec(revs
->prefix
,
1075 prepare_show_merge(revs
);
1076 if (def
&& !revs
->pending
.nr
) {
1077 unsigned char sha1
[20];
1078 struct object
*object
;
1079 if (get_sha1(def
, sha1
))
1080 die("bad default revision '%s'", def
);
1081 object
= get_reference(revs
, def
, sha1
, 0);
1082 add_pending_object(revs
, object
, def
);
1085 if (revs
->topo_order
)
1088 if (revs
->prune_data
) {
1089 diff_tree_setup_paths(revs
->prune_data
, &revs
->pruning
);
1090 revs
->prune_fn
= try_to_simplify_commit
;
1091 if (!revs
->full_diff
)
1092 diff_tree_setup_paths(revs
->prune_data
, &revs
->diffopt
);
1094 if (revs
->combine_merges
) {
1095 revs
->ignore_merges
= 0;
1096 if (revs
->dense_combined_merges
&& !revs
->diffopt
.output_format
)
1097 revs
->diffopt
.output_format
= DIFF_FORMAT_PATCH
;
1099 revs
->diffopt
.abbrev
= revs
->abbrev
;
1100 if (diff_setup_done(&revs
->diffopt
) < 0)
1101 die("diff_setup_done failed");
1103 if (revs
->grep_filter
) {
1104 revs
->grep_filter
->all_match
= all_match
;
1105 compile_grep_patterns(revs
->grep_filter
);
1111 void prepare_revision_walk(struct rev_info
*revs
)
1113 int nr
= revs
->pending
.nr
;
1114 struct object_array_entry
*list
= revs
->pending
.objects
;
1116 revs
->pending
.nr
= 0;
1117 revs
->pending
.alloc
= 0;
1118 revs
->pending
.objects
= NULL
;
1120 struct commit
*commit
= handle_commit(revs
, list
->item
, list
->name
);
1122 if (!(commit
->object
.flags
& SEEN
)) {
1123 commit
->object
.flags
|= SEEN
;
1124 insert_by_date(commit
, &revs
->commits
);
1134 if (revs
->topo_order
)
1135 sort_in_topological_order_fn(&revs
->commits
, revs
->lifo
,
1140 static int rewrite_one(struct rev_info
*revs
, struct commit
**pp
)
1143 struct commit
*p
= *pp
;
1145 add_parents_to_list(revs
, p
, &revs
->commits
);
1146 if (p
->parents
&& p
->parents
->next
)
1148 if (p
->object
.flags
& (TREECHANGE
| UNINTERESTING
))
1152 *pp
= p
->parents
->item
;
1156 static void rewrite_parents(struct rev_info
*revs
, struct commit
*commit
)
1158 struct commit_list
**pp
= &commit
->parents
;
1160 struct commit_list
*parent
= *pp
;
1161 if (rewrite_one(revs
, &parent
->item
) < 0) {
1169 static void mark_boundary_to_show(struct commit
*commit
)
1171 struct commit_list
*p
= commit
->parents
;
1175 if (commit
->object
.flags
& BOUNDARY
)
1176 commit
->object
.flags
|= BOUNDARY_SHOW
;
1180 static int commit_match(struct commit
*commit
, struct rev_info
*opt
)
1182 if (!opt
->grep_filter
)
1184 return grep_buffer(opt
->grep_filter
,
1185 NULL
, /* we say nothing, not even filename */
1186 commit
->buffer
, strlen(commit
->buffer
));
1189 static struct commit
*get_revision_1(struct rev_info
*revs
)
1195 struct commit_list
*entry
= revs
->commits
;
1196 struct commit
*commit
= entry
->item
;
1198 revs
->commits
= entry
->next
;
1202 * If we haven't done the list limiting, we need to look at
1203 * the parents here. We also need to do the date-based limiting
1204 * that we'd otherwise have done in limit_list().
1206 if (!revs
->limited
) {
1207 if (revs
->max_age
!= -1 &&
1208 (commit
->date
< revs
->max_age
))
1210 add_parents_to_list(revs
, commit
, &revs
->commits
);
1212 if (commit
->object
.flags
& SHOWN
)
1215 if (revs
->unpacked
&& has_sha1_pack(commit
->object
.sha1
,
1216 revs
->ignore_packed
))
1219 /* We want to show boundary commits only when their
1220 * children are shown. When path-limiter is in effect,
1221 * rewrite_parents() drops some commits from getting shown,
1222 * and there is no point showing boundary parents that
1223 * are not shown. After rewrite_parents() rewrites the
1224 * parents of a commit that is shown, we mark the boundary
1225 * parents with BOUNDARY_SHOW.
1227 if (commit
->object
.flags
& BOUNDARY_SHOW
) {
1228 commit
->object
.flags
|= SHOWN
;
1231 if (commit
->object
.flags
& UNINTERESTING
)
1233 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
))
1235 if (revs
->no_merges
&&
1236 commit
->parents
&& commit
->parents
->next
)
1238 if (!commit_match(commit
, revs
))
1240 if (revs
->prune_fn
&& revs
->dense
) {
1241 /* Commit without changes? */
1242 if (!(commit
->object
.flags
& TREECHANGE
)) {
1243 /* drop merges unless we want parenthood */
1246 /* non-merge - always ignore it */
1247 if (!commit
->parents
|| !commit
->parents
->next
)
1251 rewrite_parents(revs
, commit
);
1254 mark_boundary_to_show(commit
);
1255 commit
->object
.flags
|= SHOWN
;
1257 } while (revs
->commits
);
1261 struct commit
*get_revision(struct rev_info
*revs
)
1263 struct commit
*c
= NULL
;
1265 if (0 < revs
->skip_count
) {
1266 while ((c
= get_revision_1(revs
)) != NULL
) {
1267 if (revs
->skip_count
-- <= 0)
1272 /* Check the max_count ... */
1273 switch (revs
->max_count
) {
1283 return get_revision_1(revs
);