10 #include "reflog-walk.h"
11 #include "patch-ids.h"
13 static char *path_name(struct name_path
*path
, const char *name
)
17 int nlen
= strlen(name
);
20 for (p
= path
; p
; p
= p
->up
) {
22 len
+= p
->elem_len
+ 1;
25 m
= n
+ len
- (nlen
+ 1);
27 for (p
= path
; p
; p
= p
->up
) {
30 memcpy(m
, p
->elem
, p
->elem_len
);
37 void add_object(struct object
*obj
,
38 struct object_array
*p
,
39 struct name_path
*path
,
42 add_object_array(obj
, path_name(path
, name
), p
);
45 static void mark_blob_uninteresting(struct blob
*blob
)
47 if (blob
->object
.flags
& UNINTERESTING
)
49 blob
->object
.flags
|= UNINTERESTING
;
52 void mark_tree_uninteresting(struct tree
*tree
)
54 struct tree_desc desc
;
55 struct name_entry entry
;
56 struct object
*obj
= &tree
->object
;
58 if (obj
->flags
& UNINTERESTING
)
60 obj
->flags
|= UNINTERESTING
;
61 if (!has_sha1_file(obj
->sha1
))
63 if (parse_tree(tree
) < 0)
64 die("bad tree %s", sha1_to_hex(obj
->sha1
));
66 init_tree_desc(&desc
, tree
->buffer
, tree
->size
);
67 while (tree_entry(&desc
, &entry
)) {
68 switch (object_type(entry
.mode
)) {
70 mark_tree_uninteresting(lookup_tree(entry
.sha1
));
73 mark_blob_uninteresting(lookup_blob(entry
.sha1
));
76 /* Subproject commit - not in this repository */
82 * We don't care about the tree any more
83 * after it has been marked uninteresting.
89 void mark_parents_uninteresting(struct commit
*commit
)
91 struct commit_list
*parents
= commit
->parents
;
94 struct commit
*commit
= parents
->item
;
95 if (!(commit
->object
.flags
& UNINTERESTING
)) {
96 commit
->object
.flags
|= UNINTERESTING
;
99 * Normally we haven't parsed the parent
100 * yet, so we won't have a parent of a parent
101 * here. However, it may turn out that we've
102 * reached this commit some other way (where it
103 * wasn't uninteresting), in which case we need
104 * to mark its parents recursively too..
107 mark_parents_uninteresting(commit
);
111 * A missing commit is ok iff its parent is marked
114 * We just mark such a thing parsed, so that when
115 * it is popped next time around, we won't be trying
116 * to parse it and get an error.
118 if (!has_sha1_file(commit
->object
.sha1
))
119 commit
->object
.parsed
= 1;
120 parents
= parents
->next
;
124 static void add_pending_object_with_mode(struct rev_info
*revs
, struct object
*obj
, const char *name
, unsigned mode
)
126 if (revs
->no_walk
&& (obj
->flags
& UNINTERESTING
))
127 die("object ranges do not make sense when not walking revisions");
128 if (revs
->reflog_info
&& obj
->type
== OBJ_COMMIT
&&
129 add_reflog_for_walk(revs
->reflog_info
,
130 (struct commit
*)obj
, name
))
132 add_object_array_with_mode(obj
, name
, &revs
->pending
, mode
);
135 void add_pending_object(struct rev_info
*revs
, struct object
*obj
, const char *name
)
137 add_pending_object_with_mode(revs
, obj
, name
, S_IFINVALID
);
140 static struct object
*get_reference(struct rev_info
*revs
, const char *name
, const unsigned char *sha1
, unsigned int flags
)
142 struct object
*object
;
144 object
= parse_object(sha1
);
146 die("bad object %s", name
);
147 object
->flags
|= flags
;
151 static struct commit
*handle_commit(struct rev_info
*revs
, struct object
*object
, const char *name
)
153 unsigned long flags
= object
->flags
;
156 * Tag object? Look what it points to..
158 while (object
->type
== OBJ_TAG
) {
159 struct tag
*tag
= (struct tag
*) object
;
160 if (revs
->tag_objects
&& !(flags
& UNINTERESTING
))
161 add_pending_object(revs
, object
, tag
->tag
);
162 object
= parse_object(tag
->tagged
->sha1
);
164 die("bad object %s", sha1_to_hex(tag
->tagged
->sha1
));
168 * Commit object? Just return it, we'll do all the complex
171 if (object
->type
== OBJ_COMMIT
) {
172 struct commit
*commit
= (struct commit
*)object
;
173 if (parse_commit(commit
) < 0)
174 die("unable to parse commit %s", name
);
175 if (flags
& UNINTERESTING
) {
176 commit
->object
.flags
|= UNINTERESTING
;
177 mark_parents_uninteresting(commit
);
184 * Tree object? Either mark it uniniteresting, or add it
185 * to the list of objects to look at later..
187 if (object
->type
== OBJ_TREE
) {
188 struct tree
*tree
= (struct tree
*)object
;
189 if (!revs
->tree_objects
)
191 if (flags
& UNINTERESTING
) {
192 mark_tree_uninteresting(tree
);
195 add_pending_object(revs
, object
, "");
200 * Blob object? You know the drill by now..
202 if (object
->type
== OBJ_BLOB
) {
203 struct blob
*blob
= (struct blob
*)object
;
204 if (!revs
->blob_objects
)
206 if (flags
& UNINTERESTING
) {
207 mark_blob_uninteresting(blob
);
210 add_pending_object(revs
, object
, "");
213 die("%s is unknown object", name
);
216 static int everybody_uninteresting(struct commit_list
*orig
)
218 struct commit_list
*list
= orig
;
220 struct commit
*commit
= list
->item
;
222 if (commit
->object
.flags
& UNINTERESTING
)
230 * The goal is to get REV_TREE_NEW as the result only if the
231 * diff consists of all '+' (and no other changes), and
232 * REV_TREE_DIFFERENT otherwise (of course if the trees are
233 * the same we want REV_TREE_SAME). That means that once we
234 * get to REV_TREE_DIFFERENT, we do not have to look any further.
236 static int tree_difference
= REV_TREE_SAME
;
238 static void file_add_remove(struct diff_options
*options
,
239 int addremove
, unsigned mode
,
240 const unsigned char *sha1
,
241 const char *base
, const char *path
)
243 int diff
= REV_TREE_DIFFERENT
;
246 * Is it an add of a new file? It means that the old tree
247 * didn't have it at all, so we will turn "REV_TREE_SAME" ->
248 * "REV_TREE_NEW", but leave any "REV_TREE_DIFFERENT" alone
249 * (and if it already was "REV_TREE_NEW", we'll keep it
250 * "REV_TREE_NEW" of course).
252 if (addremove
== '+') {
253 diff
= tree_difference
;
254 if (diff
!= REV_TREE_SAME
)
258 tree_difference
= diff
;
259 if (tree_difference
== REV_TREE_DIFFERENT
)
260 options
->has_changes
= 1;
263 static void file_change(struct diff_options
*options
,
264 unsigned old_mode
, unsigned new_mode
,
265 const unsigned char *old_sha1
,
266 const unsigned char *new_sha1
,
267 const char *base
, const char *path
)
269 tree_difference
= REV_TREE_DIFFERENT
;
270 options
->has_changes
= 1;
273 static int rev_compare_tree(struct rev_info
*revs
, struct tree
*t1
, struct tree
*t2
)
278 return REV_TREE_DIFFERENT
;
279 tree_difference
= REV_TREE_SAME
;
280 revs
->pruning
.has_changes
= 0;
281 if (diff_tree_sha1(t1
->object
.sha1
, t2
->object
.sha1
, "",
283 return REV_TREE_DIFFERENT
;
284 return tree_difference
;
287 static int rev_same_tree_as_empty(struct rev_info
*revs
, struct tree
*t1
)
292 struct tree_desc empty
, real
;
297 tree
= read_object_with_reference(t1
->object
.sha1
, tree_type
, &size
, NULL
);
300 init_tree_desc(&real
, tree
, size
);
301 init_tree_desc(&empty
, "", 0);
303 tree_difference
= REV_TREE_SAME
;
304 revs
->pruning
.has_changes
= 0;
305 retval
= diff_tree(&empty
, &real
, "", &revs
->pruning
);
308 return retval
>= 0 && (tree_difference
== REV_TREE_SAME
);
311 static void try_to_simplify_commit(struct rev_info
*revs
, struct commit
*commit
)
313 struct commit_list
**pp
, *parent
;
314 int tree_changed
= 0, tree_same
= 0;
319 if (!commit
->parents
) {
320 if (!rev_same_tree_as_empty(revs
, commit
->tree
))
321 commit
->object
.flags
|= TREECHANGE
;
325 pp
= &commit
->parents
;
326 while ((parent
= *pp
) != NULL
) {
327 struct commit
*p
= parent
->item
;
329 if (parse_commit(p
) < 0)
330 die("cannot simplify commit %s (because of %s)",
331 sha1_to_hex(commit
->object
.sha1
),
332 sha1_to_hex(p
->object
.sha1
));
333 switch (rev_compare_tree(revs
, p
->tree
, commit
->tree
)) {
336 if (!revs
->simplify_history
|| (p
->object
.flags
& UNINTERESTING
)) {
337 /* Even if a merge with an uninteresting
338 * side branch brought the entire change
339 * we are interested in, we do not want
340 * to lose the other branches of this
341 * merge, so we just keep going.
347 commit
->parents
= parent
;
351 if (revs
->remove_empty_trees
&&
352 rev_same_tree_as_empty(revs
, p
->tree
)) {
353 /* We are adding all the specified
354 * paths from this parent, so the
355 * history beyond this parent is not
356 * interesting. Remove its parents
357 * (they are grandparents for us).
358 * IOW, we pretend this parent is a
361 if (parse_commit(p
) < 0)
362 die("cannot simplify commit %s (invalid %s)",
363 sha1_to_hex(commit
->object
.sha1
),
364 sha1_to_hex(p
->object
.sha1
));
368 case REV_TREE_DIFFERENT
:
373 die("bad tree compare for commit %s", sha1_to_hex(commit
->object
.sha1
));
375 if (tree_changed
&& !tree_same
)
376 commit
->object
.flags
|= TREECHANGE
;
379 static int add_parents_to_list(struct rev_info
*revs
, struct commit
*commit
, struct commit_list
**list
)
381 struct commit_list
*parent
= commit
->parents
;
385 if (commit
->object
.flags
& ADDED
)
387 commit
->object
.flags
|= ADDED
;
390 * If the commit is uninteresting, don't try to
391 * prune parents - we want the maximal uninteresting
394 * Normally we haven't parsed the parent
395 * yet, so we won't have a parent of a parent
396 * here. However, it may turn out that we've
397 * reached this commit some other way (where it
398 * wasn't uninteresting), in which case we need
399 * to mark its parents recursively too..
401 if (commit
->object
.flags
& UNINTERESTING
) {
403 struct commit
*p
= parent
->item
;
404 parent
= parent
->next
;
405 if (parse_commit(p
) < 0)
407 p
->object
.flags
|= UNINTERESTING
;
409 mark_parents_uninteresting(p
);
410 if (p
->object
.flags
& SEEN
)
412 p
->object
.flags
|= SEEN
;
413 insert_by_date(p
, list
);
419 * Ok, the commit wasn't uninteresting. Try to
420 * simplify the commit history and find the parent
421 * that has no differences in the path set if one exists.
424 revs
->prune_fn(revs
, commit
);
429 left_flag
= (commit
->object
.flags
& SYMMETRIC_LEFT
);
431 rest
= !revs
->first_parent_only
;
432 for (parent
= commit
->parents
, add
= 1; parent
; add
= rest
) {
433 struct commit
*p
= parent
->item
;
435 parent
= parent
->next
;
436 if (parse_commit(p
) < 0)
438 p
->object
.flags
|= left_flag
;
439 if (p
->object
.flags
& SEEN
)
441 p
->object
.flags
|= SEEN
;
443 insert_by_date(p
, list
);
448 static void cherry_pick_list(struct commit_list
*list
, struct rev_info
*revs
)
450 struct commit_list
*p
;
451 int left_count
= 0, right_count
= 0;
453 struct patch_ids ids
;
455 /* First count the commits on the left and on the right */
456 for (p
= list
; p
; p
= p
->next
) {
457 struct commit
*commit
= p
->item
;
458 unsigned flags
= commit
->object
.flags
;
459 if (flags
& BOUNDARY
)
461 else if (flags
& SYMMETRIC_LEFT
)
467 left_first
= left_count
< right_count
;
468 init_patch_ids(&ids
);
469 if (revs
->diffopt
.nr_paths
) {
470 ids
.diffopts
.nr_paths
= revs
->diffopt
.nr_paths
;
471 ids
.diffopts
.paths
= revs
->diffopt
.paths
;
472 ids
.diffopts
.pathlens
= revs
->diffopt
.pathlens
;
475 /* Compute patch-ids for one side */
476 for (p
= list
; p
; p
= p
->next
) {
477 struct commit
*commit
= p
->item
;
478 unsigned flags
= commit
->object
.flags
;
480 if (flags
& BOUNDARY
)
483 * If we have fewer left, left_first is set and we omit
484 * commits on the right branch in this loop. If we have
485 * fewer right, we skip the left ones.
487 if (left_first
!= !!(flags
& SYMMETRIC_LEFT
))
489 commit
->util
= add_commit_patch_id(commit
, &ids
);
492 /* Check the other side */
493 for (p
= list
; p
; p
= p
->next
) {
494 struct commit
*commit
= p
->item
;
496 unsigned flags
= commit
->object
.flags
;
498 if (flags
& BOUNDARY
)
501 * If we have fewer left, left_first is set and we omit
502 * commits on the left branch in this loop.
504 if (left_first
== !!(flags
& SYMMETRIC_LEFT
))
508 * Have we seen the same patch id?
510 id
= has_commit_patch_id(commit
, &ids
);
514 commit
->object
.flags
|= SHOWN
;
517 /* Now check the original side for seen ones */
518 for (p
= list
; p
; p
= p
->next
) {
519 struct commit
*commit
= p
->item
;
520 struct patch_id
*ent
;
526 commit
->object
.flags
|= SHOWN
;
530 free_patch_ids(&ids
);
533 static int limit_list(struct rev_info
*revs
)
535 struct commit_list
*list
= revs
->commits
;
536 struct commit_list
*newlist
= NULL
;
537 struct commit_list
**p
= &newlist
;
540 struct commit_list
*entry
= list
;
541 struct commit
*commit
= list
->item
;
542 struct object
*obj
= &commit
->object
;
547 if (revs
->max_age
!= -1 && (commit
->date
< revs
->max_age
))
548 obj
->flags
|= UNINTERESTING
;
549 if (add_parents_to_list(revs
, commit
, &list
) < 0)
551 if (obj
->flags
& UNINTERESTING
) {
552 mark_parents_uninteresting(commit
);
553 if (everybody_uninteresting(list
))
557 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
))
559 p
= &commit_list_insert(commit
, p
)->next
;
561 if (revs
->cherry_pick
)
562 cherry_pick_list(newlist
, revs
);
564 revs
->commits
= newlist
;
570 int warned_bad_reflog
;
571 struct rev_info
*all_revs
;
572 const char *name_for_errormsg
;
575 static int handle_one_ref(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
577 struct all_refs_cb
*cb
= cb_data
;
578 struct object
*object
= get_reference(cb
->all_revs
, path
, sha1
,
580 add_pending_object(cb
->all_revs
, object
, path
);
584 static void handle_all(struct rev_info
*revs
, unsigned flags
)
586 struct all_refs_cb cb
;
588 cb
.all_flags
= flags
;
589 for_each_ref(handle_one_ref
, &cb
);
592 static void handle_one_reflog_commit(unsigned char *sha1
, void *cb_data
)
594 struct all_refs_cb
*cb
= cb_data
;
595 if (!is_null_sha1(sha1
)) {
596 struct object
*o
= parse_object(sha1
);
598 o
->flags
|= cb
->all_flags
;
599 add_pending_object(cb
->all_revs
, o
, "");
601 else if (!cb
->warned_bad_reflog
) {
602 warning("reflog of '%s' references pruned commits",
603 cb
->name_for_errormsg
);
604 cb
->warned_bad_reflog
= 1;
609 static int handle_one_reflog_ent(unsigned char *osha1
, unsigned char *nsha1
,
610 const char *email
, unsigned long timestamp
, int tz
,
611 const char *message
, void *cb_data
)
613 handle_one_reflog_commit(osha1
, cb_data
);
614 handle_one_reflog_commit(nsha1
, cb_data
);
618 static int handle_one_reflog(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
620 struct all_refs_cb
*cb
= cb_data
;
621 cb
->warned_bad_reflog
= 0;
622 cb
->name_for_errormsg
= path
;
623 for_each_reflog_ent(path
, handle_one_reflog_ent
, cb_data
);
627 static void handle_reflog(struct rev_info
*revs
, unsigned flags
)
629 struct all_refs_cb cb
;
631 cb
.all_flags
= flags
;
632 for_each_reflog(handle_one_reflog
, &cb
);
635 static int add_parents_only(struct rev_info
*revs
, const char *arg
, int flags
)
637 unsigned char sha1
[20];
639 struct commit
*commit
;
640 struct commit_list
*parents
;
643 flags
^= UNINTERESTING
;
646 if (get_sha1(arg
, sha1
))
649 it
= get_reference(revs
, arg
, sha1
, 0);
650 if (it
->type
!= OBJ_TAG
)
652 hashcpy(sha1
, ((struct tag
*)it
)->tagged
->sha1
);
654 if (it
->type
!= OBJ_COMMIT
)
656 commit
= (struct commit
*)it
;
657 for (parents
= commit
->parents
; parents
; parents
= parents
->next
) {
658 it
= &parents
->item
->object
;
660 add_pending_object(revs
, it
, arg
);
665 void init_revisions(struct rev_info
*revs
, const char *prefix
)
667 memset(revs
, 0, sizeof(*revs
));
669 revs
->abbrev
= DEFAULT_ABBREV
;
670 revs
->ignore_merges
= 1;
671 revs
->simplify_history
= 1;
672 revs
->pruning
.recursive
= 1;
673 revs
->pruning
.quiet
= 1;
674 revs
->pruning
.add_remove
= file_add_remove
;
675 revs
->pruning
.change
= file_change
;
678 revs
->prefix
= prefix
;
681 revs
->skip_count
= -1;
682 revs
->max_count
= -1;
684 revs
->prune_fn
= NULL
;
685 revs
->prune_data
= NULL
;
687 revs
->topo_setter
= topo_sort_default_setter
;
688 revs
->topo_getter
= topo_sort_default_getter
;
690 revs
->commit_format
= CMIT_FMT_DEFAULT
;
692 diff_setup(&revs
->diffopt
);
695 static void add_pending_commit_list(struct rev_info
*revs
,
696 struct commit_list
*commit_list
,
699 while (commit_list
) {
700 struct object
*object
= &commit_list
->item
->object
;
701 object
->flags
|= flags
;
702 add_pending_object(revs
, object
, sha1_to_hex(object
->sha1
));
703 commit_list
= commit_list
->next
;
707 static void prepare_show_merge(struct rev_info
*revs
)
709 struct commit_list
*bases
;
710 struct commit
*head
, *other
;
711 unsigned char sha1
[20];
712 const char **prune
= NULL
;
713 int i
, prune_num
= 1; /* counting terminating NULL */
715 if (get_sha1("HEAD", sha1
) || !(head
= lookup_commit(sha1
)))
716 die("--merge without HEAD?");
717 if (get_sha1("MERGE_HEAD", sha1
) || !(other
= lookup_commit(sha1
)))
718 die("--merge without MERGE_HEAD?");
719 add_pending_object(revs
, &head
->object
, "HEAD");
720 add_pending_object(revs
, &other
->object
, "MERGE_HEAD");
721 bases
= get_merge_bases(head
, other
, 1);
723 struct commit
*it
= bases
->item
;
724 struct commit_list
*n
= bases
->next
;
727 it
->object
.flags
|= UNINTERESTING
;
728 add_pending_object(revs
, &it
->object
, "(merge-base)");
733 for (i
= 0; i
< active_nr
; i
++) {
734 struct cache_entry
*ce
= active_cache
[i
];
737 if (ce_path_match(ce
, revs
->prune_data
)) {
739 prune
= xrealloc(prune
, sizeof(*prune
) * prune_num
);
740 prune
[prune_num
-2] = ce
->name
;
741 prune
[prune_num
-1] = NULL
;
743 while ((i
+1 < active_nr
) &&
744 ce_same_name(ce
, active_cache
[i
+1]))
747 revs
->prune_data
= prune
;
750 int handle_revision_arg(const char *arg
, struct rev_info
*revs
,
752 int cant_be_filename
)
756 struct object
*object
;
757 unsigned char sha1
[20];
760 dotdot
= strstr(arg
, "..");
762 unsigned char from_sha1
[20];
763 const char *next
= dotdot
+ 2;
764 const char *this = arg
;
765 int symmetric
= *next
== '.';
766 unsigned int flags_exclude
= flags
^ UNINTERESTING
;
775 if (!get_sha1(this, from_sha1
) &&
776 !get_sha1(next
, sha1
)) {
777 struct commit
*a
, *b
;
778 struct commit_list
*exclude
;
780 a
= lookup_commit_reference(from_sha1
);
781 b
= lookup_commit_reference(sha1
);
784 "Invalid symmetric difference expression %s...%s" :
785 "Invalid revision range %s..%s",
789 if (!cant_be_filename
) {
791 verify_non_filename(revs
->prefix
, arg
);
795 exclude
= get_merge_bases(a
, b
, 1);
796 add_pending_commit_list(revs
, exclude
,
798 free_commit_list(exclude
);
799 a
->object
.flags
|= flags
| SYMMETRIC_LEFT
;
801 a
->object
.flags
|= flags_exclude
;
802 b
->object
.flags
|= flags
;
803 add_pending_object(revs
, &a
->object
, this);
804 add_pending_object(revs
, &b
->object
, next
);
809 dotdot
= strstr(arg
, "^@");
810 if (dotdot
&& !dotdot
[2]) {
812 if (add_parents_only(revs
, arg
, flags
))
816 dotdot
= strstr(arg
, "^!");
817 if (dotdot
&& !dotdot
[2]) {
819 if (!add_parents_only(revs
, arg
, flags
^ UNINTERESTING
))
825 local_flags
= UNINTERESTING
;
828 if (get_sha1_with_mode(arg
, sha1
, &mode
))
830 if (!cant_be_filename
)
831 verify_non_filename(revs
->prefix
, arg
);
832 object
= get_reference(revs
, arg
, sha1
, flags
^ local_flags
);
833 add_pending_object_with_mode(revs
, object
, arg
, mode
);
837 static void add_grep(struct rev_info
*revs
, const char *ptn
, enum grep_pat_token what
)
839 if (!revs
->grep_filter
) {
840 struct grep_opt
*opt
= xcalloc(1, sizeof(*opt
));
841 opt
->status_only
= 1;
842 opt
->pattern_tail
= &(opt
->pattern_list
);
843 opt
->regflags
= REG_NEWLINE
;
844 revs
->grep_filter
= opt
;
846 append_grep_pattern(revs
->grep_filter
, ptn
,
847 "command line", 0, what
);
850 static void add_header_grep(struct rev_info
*revs
, const char *field
, const char *pattern
)
856 fldlen
= strlen(field
);
857 patlen
= strlen(pattern
);
858 pat
= xmalloc(patlen
+ fldlen
+ 10);
860 if (*pattern
== '^') {
864 sprintf(pat
, "^%s %s%s", field
, prefix
, pattern
);
865 add_grep(revs
, pat
, GREP_PATTERN_HEAD
);
868 static void add_message_grep(struct rev_info
*revs
, const char *pattern
)
870 add_grep(revs
, pattern
, GREP_PATTERN_BODY
);
873 static void add_ignore_packed(struct rev_info
*revs
, const char *name
)
875 int num
= ++revs
->num_ignore_packed
;
877 revs
->ignore_packed
= xrealloc(revs
->ignore_packed
,
878 sizeof(const char **) * (num
+ 1));
879 revs
->ignore_packed
[num
-1] = name
;
880 revs
->ignore_packed
[num
] = NULL
;
884 * Parse revision information, filling in the "rev_info" structure,
885 * and removing the used arguments from the argument list.
887 * Returns the number of arguments left that weren't recognized
888 * (which are also moved to the head of the argument list)
890 int setup_revisions(int argc
, const char **argv
, struct rev_info
*revs
, const char *def
)
892 int i
, flags
, seen_dashdash
, show_merge
;
893 const char **unrecognized
= argv
+ 1;
898 /* First, search for "--" */
900 for (i
= 1; i
< argc
; i
++) {
901 const char *arg
= argv
[i
];
902 if (strcmp(arg
, "--"))
907 revs
->prune_data
= get_pathspec(revs
->prefix
, argv
+ i
+ 1);
912 flags
= show_merge
= 0;
913 for (i
= 1; i
< argc
; i
++) {
914 const char *arg
= argv
[i
];
917 if (!prefixcmp(arg
, "--max-count=")) {
918 revs
->max_count
= atoi(arg
+ 12);
921 if (!prefixcmp(arg
, "--skip=")) {
922 revs
->skip_count
= atoi(arg
+ 7);
925 /* accept -<digit>, like traditional "head" */
926 if ((*arg
== '-') && isdigit(arg
[1])) {
927 revs
->max_count
= atoi(arg
+ 1);
930 if (!strcmp(arg
, "-n")) {
932 die("-n requires an argument");
933 revs
->max_count
= atoi(argv
[++i
]);
936 if (!prefixcmp(arg
, "-n")) {
937 revs
->max_count
= atoi(arg
+ 2);
940 if (!prefixcmp(arg
, "--max-age=")) {
941 revs
->max_age
= atoi(arg
+ 10);
944 if (!prefixcmp(arg
, "--since=")) {
945 revs
->max_age
= approxidate(arg
+ 8);
948 if (!prefixcmp(arg
, "--after=")) {
949 revs
->max_age
= approxidate(arg
+ 8);
952 if (!prefixcmp(arg
, "--min-age=")) {
953 revs
->min_age
= atoi(arg
+ 10);
956 if (!prefixcmp(arg
, "--before=")) {
957 revs
->min_age
= approxidate(arg
+ 9);
960 if (!prefixcmp(arg
, "--until=")) {
961 revs
->min_age
= approxidate(arg
+ 8);
964 if (!strcmp(arg
, "--all")) {
965 handle_all(revs
, flags
);
968 if (!strcmp(arg
, "--first-parent")) {
969 revs
->first_parent_only
= 1;
972 if (!strcmp(arg
, "--reflog")) {
973 handle_reflog(revs
, flags
);
976 if (!strcmp(arg
, "-g") ||
977 !strcmp(arg
, "--walk-reflogs")) {
978 init_reflog_walk(&revs
->reflog_info
);
981 if (!strcmp(arg
, "--not")) {
982 flags
^= UNINTERESTING
;
985 if (!strcmp(arg
, "--default")) {
987 die("bad --default argument");
991 if (!strcmp(arg
, "--merge")) {
995 if (!strcmp(arg
, "--topo-order")) {
996 revs
->topo_order
= 1;
999 if (!strcmp(arg
, "--date-order")) {
1001 revs
->topo_order
= 1;
1004 if (!strcmp(arg
, "--parents")) {
1008 if (!strcmp(arg
, "--dense")) {
1012 if (!strcmp(arg
, "--sparse")) {
1016 if (!strcmp(arg
, "--remove-empty")) {
1017 revs
->remove_empty_trees
= 1;
1020 if (!strcmp(arg
, "--no-merges")) {
1021 revs
->no_merges
= 1;
1024 if (!strcmp(arg
, "--boundary")) {
1028 if (!strcmp(arg
, "--left-right")) {
1029 revs
->left_right
= 1;
1032 if (!strcmp(arg
, "--cherry-pick")) {
1033 revs
->cherry_pick
= 1;
1037 if (!strcmp(arg
, "--objects")) {
1038 revs
->tag_objects
= 1;
1039 revs
->tree_objects
= 1;
1040 revs
->blob_objects
= 1;
1043 if (!strcmp(arg
, "--objects-edge")) {
1044 revs
->tag_objects
= 1;
1045 revs
->tree_objects
= 1;
1046 revs
->blob_objects
= 1;
1047 revs
->edge_hint
= 1;
1050 if (!strcmp(arg
, "--unpacked")) {
1052 free(revs
->ignore_packed
);
1053 revs
->ignore_packed
= NULL
;
1054 revs
->num_ignore_packed
= 0;
1057 if (!prefixcmp(arg
, "--unpacked=")) {
1059 add_ignore_packed(revs
, arg
+11);
1062 if (!strcmp(arg
, "-r")) {
1064 revs
->diffopt
.recursive
= 1;
1067 if (!strcmp(arg
, "-t")) {
1069 revs
->diffopt
.recursive
= 1;
1070 revs
->diffopt
.tree_in_recursive
= 1;
1073 if (!strcmp(arg
, "-m")) {
1074 revs
->ignore_merges
= 0;
1077 if (!strcmp(arg
, "-c")) {
1079 revs
->dense_combined_merges
= 0;
1080 revs
->combine_merges
= 1;
1083 if (!strcmp(arg
, "--cc")) {
1085 revs
->dense_combined_merges
= 1;
1086 revs
->combine_merges
= 1;
1089 if (!strcmp(arg
, "-v")) {
1090 revs
->verbose_header
= 1;
1093 if (!prefixcmp(arg
, "--pretty")) {
1094 revs
->verbose_header
= 1;
1095 revs
->commit_format
= get_commit_format(arg
+8);
1098 if (!strcmp(arg
, "--root")) {
1099 revs
->show_root_diff
= 1;
1102 if (!strcmp(arg
, "--no-commit-id")) {
1103 revs
->no_commit_id
= 1;
1106 if (!strcmp(arg
, "--always")) {
1107 revs
->always_show_header
= 1;
1110 if (!strcmp(arg
, "--no-abbrev")) {
1114 if (!strcmp(arg
, "--abbrev")) {
1115 revs
->abbrev
= DEFAULT_ABBREV
;
1118 if (!prefixcmp(arg
, "--abbrev=")) {
1119 revs
->abbrev
= strtoul(arg
+ 9, NULL
, 10);
1120 if (revs
->abbrev
< MINIMUM_ABBREV
)
1121 revs
->abbrev
= MINIMUM_ABBREV
;
1122 else if (revs
->abbrev
> 40)
1126 if (!strcmp(arg
, "--abbrev-commit")) {
1127 revs
->abbrev_commit
= 1;
1130 if (!strcmp(arg
, "--full-diff")) {
1132 revs
->full_diff
= 1;
1135 if (!strcmp(arg
, "--full-history")) {
1136 revs
->simplify_history
= 0;
1139 if (!strcmp(arg
, "--relative-date")) {
1140 revs
->date_mode
= DATE_RELATIVE
;
1143 if (!strncmp(arg
, "--date=", 7)) {
1144 if (!strcmp(arg
+ 7, "relative"))
1145 revs
->date_mode
= DATE_RELATIVE
;
1146 else if (!strcmp(arg
+ 7, "iso8601") ||
1147 !strcmp(arg
+ 7, "iso"))
1148 revs
->date_mode
= DATE_ISO8601
;
1149 else if (!strcmp(arg
+ 7, "rfc2822") ||
1150 !strcmp(arg
+ 7, "rfc"))
1151 revs
->date_mode
= DATE_RFC2822
;
1152 else if (!strcmp(arg
+ 7, "short"))
1153 revs
->date_mode
= DATE_SHORT
;
1154 else if (!strcmp(arg
+ 7, "local"))
1155 revs
->date_mode
= DATE_LOCAL
;
1156 else if (!strcmp(arg
+ 7, "default"))
1157 revs
->date_mode
= DATE_NORMAL
;
1159 die("unknown date format %s", arg
);
1162 if (!strcmp(arg
, "--log-size")) {
1163 revs
->show_log_size
= 1;
1168 * Grepping the commit log
1170 if (!prefixcmp(arg
, "--author=")) {
1171 add_header_grep(revs
, "author", arg
+9);
1174 if (!prefixcmp(arg
, "--committer=")) {
1175 add_header_grep(revs
, "committer", arg
+12);
1178 if (!prefixcmp(arg
, "--grep=")) {
1179 add_message_grep(revs
, arg
+7);
1182 if (!strcmp(arg
, "--extended-regexp") ||
1183 !strcmp(arg
, "-E")) {
1184 regflags
|= REG_EXTENDED
;
1187 if (!strcmp(arg
, "--regexp-ignore-case") ||
1188 !strcmp(arg
, "-i")) {
1189 regflags
|= REG_ICASE
;
1192 if (!strcmp(arg
, "--all-match")) {
1196 if (!prefixcmp(arg
, "--encoding=")) {
1198 if (strcmp(arg
, "none"))
1199 git_log_output_encoding
= xstrdup(arg
);
1201 git_log_output_encoding
= "";
1204 if (!strcmp(arg
, "--reverse")) {
1208 if (!strcmp(arg
, "--no-walk")) {
1212 if (!strcmp(arg
, "--do-walk")) {
1217 opts
= diff_opt_parse(&revs
->diffopt
, argv
+i
, argc
-i
);
1222 *unrecognized
++ = arg
;
1227 if (handle_revision_arg(arg
, revs
, flags
, seen_dashdash
)) {
1229 if (seen_dashdash
|| *arg
== '^')
1230 die("bad revision '%s'", arg
);
1232 /* If we didn't have a "--":
1233 * (1) all filenames must exist;
1234 * (2) all rev-args must not be interpretable
1235 * as a valid filename.
1236 * but the latter we have checked in the main loop.
1238 for (j
= i
; j
< argc
; j
++)
1239 verify_filename(revs
->prefix
, argv
[j
]);
1241 revs
->prune_data
= get_pathspec(revs
->prefix
,
1247 if (revs
->grep_filter
)
1248 revs
->grep_filter
->regflags
|= regflags
;
1251 prepare_show_merge(revs
);
1252 if (def
&& !revs
->pending
.nr
) {
1253 unsigned char sha1
[20];
1254 struct object
*object
;
1256 if (get_sha1_with_mode(def
, sha1
, &mode
))
1257 die("bad default revision '%s'", def
);
1258 object
= get_reference(revs
, def
, sha1
, 0);
1259 add_pending_object_with_mode(revs
, object
, def
, mode
);
1262 /* Did the user ask for any diff output? Run the diff! */
1263 if (revs
->diffopt
.output_format
& ~DIFF_FORMAT_NO_OUTPUT
)
1266 /* Pickaxe and rename following needs diffs */
1267 if (revs
->diffopt
.pickaxe
|| revs
->diffopt
.follow_renames
)
1270 if (revs
->topo_order
)
1273 if (revs
->prune_data
) {
1274 diff_tree_setup_paths(revs
->prune_data
, &revs
->pruning
);
1275 /* Can't prune commits with rename following: the paths change.. */
1276 if (!revs
->diffopt
.follow_renames
)
1277 revs
->prune_fn
= try_to_simplify_commit
;
1278 if (!revs
->full_diff
)
1279 diff_tree_setup_paths(revs
->prune_data
, &revs
->diffopt
);
1281 if (revs
->combine_merges
) {
1282 revs
->ignore_merges
= 0;
1283 if (revs
->dense_combined_merges
&& !revs
->diffopt
.output_format
)
1284 revs
->diffopt
.output_format
= DIFF_FORMAT_PATCH
;
1286 revs
->diffopt
.abbrev
= revs
->abbrev
;
1287 if (diff_setup_done(&revs
->diffopt
) < 0)
1288 die("diff_setup_done failed");
1290 if (revs
->grep_filter
) {
1291 revs
->grep_filter
->all_match
= all_match
;
1292 compile_grep_patterns(revs
->grep_filter
);
1295 if (revs
->reverse
&& revs
->reflog_info
)
1296 die("cannot combine --reverse with --walk-reflogs");
1301 int prepare_revision_walk(struct rev_info
*revs
)
1303 int nr
= revs
->pending
.nr
;
1304 struct object_array_entry
*e
, *list
;
1306 e
= list
= revs
->pending
.objects
;
1307 revs
->pending
.nr
= 0;
1308 revs
->pending
.alloc
= 0;
1309 revs
->pending
.objects
= NULL
;
1311 struct commit
*commit
= handle_commit(revs
, e
->item
, e
->name
);
1313 if (!(commit
->object
.flags
& SEEN
)) {
1314 commit
->object
.flags
|= SEEN
;
1315 insert_by_date(commit
, &revs
->commits
);
1325 if (limit_list(revs
) < 0)
1327 if (revs
->topo_order
)
1328 sort_in_topological_order_fn(&revs
->commits
, revs
->lifo
,
1334 enum rewrite_result
{
1336 rewrite_one_noparents
,
1340 static enum rewrite_result
rewrite_one(struct rev_info
*revs
, struct commit
**pp
)
1343 struct commit
*p
= *pp
;
1345 if (add_parents_to_list(revs
, p
, &revs
->commits
) < 0)
1346 return rewrite_one_error
;
1347 if (p
->parents
&& p
->parents
->next
)
1348 return rewrite_one_ok
;
1349 if (p
->object
.flags
& (TREECHANGE
| UNINTERESTING
))
1350 return rewrite_one_ok
;
1352 return rewrite_one_noparents
;
1353 *pp
= p
->parents
->item
;
1357 static void remove_duplicate_parents(struct commit
*commit
)
1359 struct commit_list
**pp
, *p
;
1361 /* Examine existing parents while marking ones we have seen... */
1362 pp
= &commit
->parents
;
1363 while ((p
= *pp
) != NULL
) {
1364 struct commit
*parent
= p
->item
;
1365 if (parent
->object
.flags
& TMP_MARK
) {
1369 parent
->object
.flags
|= TMP_MARK
;
1372 /* ... and clear the temporary mark */
1373 for (p
= commit
->parents
; p
; p
= p
->next
)
1374 p
->item
->object
.flags
&= ~TMP_MARK
;
1377 static int rewrite_parents(struct rev_info
*revs
, struct commit
*commit
)
1379 struct commit_list
**pp
= &commit
->parents
;
1381 struct commit_list
*parent
= *pp
;
1382 switch (rewrite_one(revs
, &parent
->item
)) {
1383 case rewrite_one_ok
:
1385 case rewrite_one_noparents
:
1388 case rewrite_one_error
:
1393 remove_duplicate_parents(commit
);
1397 static int commit_match(struct commit
*commit
, struct rev_info
*opt
)
1399 if (!opt
->grep_filter
)
1401 return grep_buffer(opt
->grep_filter
,
1402 NULL
, /* we say nothing, not even filename */
1403 commit
->buffer
, strlen(commit
->buffer
));
1406 static struct commit
*get_revision_1(struct rev_info
*revs
)
1412 struct commit_list
*entry
= revs
->commits
;
1413 struct commit
*commit
= entry
->item
;
1415 revs
->commits
= entry
->next
;
1418 if (revs
->reflog_info
)
1419 fake_reflog_parent(revs
->reflog_info
, commit
);
1422 * If we haven't done the list limiting, we need to look at
1423 * the parents here. We also need to do the date-based limiting
1424 * that we'd otherwise have done in limit_list().
1426 if (!revs
->limited
) {
1427 if (revs
->max_age
!= -1 &&
1428 (commit
->date
< revs
->max_age
))
1430 if (add_parents_to_list(revs
, commit
, &revs
->commits
) < 0)
1433 if (commit
->object
.flags
& SHOWN
)
1436 if (revs
->unpacked
&& has_sha1_pack(commit
->object
.sha1
,
1437 revs
->ignore_packed
))
1440 if (commit
->object
.flags
& UNINTERESTING
)
1442 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
))
1444 if (revs
->no_merges
&&
1445 commit
->parents
&& commit
->parents
->next
)
1447 if (!commit_match(commit
, revs
))
1449 if (revs
->prune_fn
&& revs
->dense
) {
1450 /* Commit without changes? */
1451 if (!(commit
->object
.flags
& TREECHANGE
)) {
1452 /* drop merges unless we want parenthood */
1455 /* non-merge - always ignore it */
1456 if (!commit
->parents
|| !commit
->parents
->next
)
1459 if (revs
->parents
&& rewrite_parents(revs
, commit
) < 0)
1463 } while (revs
->commits
);
1467 static void gc_boundary(struct object_array
*array
)
1469 unsigned nr
= array
->nr
;
1470 unsigned alloc
= array
->alloc
;
1471 struct object_array_entry
*objects
= array
->objects
;
1475 for (i
= j
= 0; i
< nr
; i
++) {
1476 if (objects
[i
].item
->flags
& SHOWN
)
1479 objects
[j
] = objects
[i
];
1482 for (i
= j
; i
< nr
; i
++)
1483 objects
[i
].item
= NULL
;
1488 struct commit
*get_revision(struct rev_info
*revs
)
1490 struct commit
*c
= NULL
;
1491 struct commit_list
*l
;
1493 if (revs
->boundary
== 2) {
1495 struct object_array
*array
= &revs
->boundary_commits
;
1496 struct object_array_entry
*objects
= array
->objects
;
1497 for (i
= 0; i
< array
->nr
; i
++) {
1498 c
= (struct commit
*)(objects
[i
].item
);
1501 if (!(c
->object
.flags
& CHILD_SHOWN
))
1503 if (!(c
->object
.flags
& SHOWN
))
1509 c
->object
.flags
|= SHOWN
| BOUNDARY
;
1513 if (revs
->reverse
) {
1516 if (0 <= revs
->max_count
) {
1517 limit
= revs
->max_count
;
1518 if (0 < revs
->skip_count
)
1519 limit
+= revs
->skip_count
;
1522 while ((c
= get_revision_1(revs
))) {
1523 commit_list_insert(c
, &l
);
1524 if ((0 < limit
) && !--limit
)
1529 revs
->max_count
= -1;
1534 * Now pick up what they want to give us
1536 c
= get_revision_1(revs
);
1538 while (0 < revs
->skip_count
) {
1540 c
= get_revision_1(revs
);
1547 * Check the max_count.
1549 switch (revs
->max_count
) {
1560 c
->object
.flags
|= SHOWN
;
1562 if (!revs
->boundary
) {
1568 * get_revision_1() runs out the commits, and
1569 * we are done computing the boundaries.
1570 * switch to boundary commits output mode.
1573 return get_revision(revs
);
1577 * boundary commits are the commits that are parents of the
1578 * ones we got from get_revision_1() but they themselves are
1579 * not returned from get_revision_1(). Before returning
1580 * 'c', we need to mark its parents that they could be boundaries.
1583 for (l
= c
->parents
; l
; l
= l
->next
) {
1585 p
= &(l
->item
->object
);
1586 if (p
->flags
& (CHILD_SHOWN
| SHOWN
))
1588 p
->flags
|= CHILD_SHOWN
;
1589 gc_boundary(&revs
->boundary_commits
);
1590 add_object_array(p
, NULL
, &revs
->boundary_commits
);