2 #include "object-store.h"
8 #include "diff-merges.h"
11 #include "repository.h"
14 #include "reflog-walk.h"
15 #include "patch-ids.h"
18 #include "string-list.h"
21 #include "commit-slab.h"
23 #include "cache-tree.h"
28 #include "commit-reach.h"
29 #include "commit-graph.h"
30 #include "prio-queue.h"
34 #include "json-writer.h"
36 volatile show_early_output_fn_t show_early_output
;
38 static const char *term_bad
;
39 static const char *term_good
;
41 implement_shared_commit_slab(revision_sources
, char *);
43 static inline int want_ancestry(const struct rev_info
*revs
);
45 void show_object_with_name(FILE *out
, struct object
*obj
, const char *name
)
49 fprintf(out
, "%s ", oid_to_hex(&obj
->oid
));
50 for (p
= name
; *p
&& *p
!= '\n'; p
++)
55 static void mark_blob_uninteresting(struct blob
*blob
)
59 if (blob
->object
.flags
& UNINTERESTING
)
61 blob
->object
.flags
|= UNINTERESTING
;
64 static void mark_tree_contents_uninteresting(struct repository
*r
,
67 struct tree_desc desc
;
68 struct name_entry entry
;
70 if (parse_tree_gently(tree
, 1) < 0)
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(r
, lookup_tree(r
, &entry
.oid
));
80 mark_blob_uninteresting(lookup_blob(r
, &entry
.oid
));
83 /* Subproject commit - not in this repository */
89 * We don't care about the tree any more
90 * after it has been marked uninteresting.
92 free_tree_buffer(tree
);
95 void mark_tree_uninteresting(struct repository
*r
, struct tree
*tree
)
103 if (obj
->flags
& UNINTERESTING
)
105 obj
->flags
|= UNINTERESTING
;
106 mark_tree_contents_uninteresting(r
, tree
);
109 struct path_and_oids_entry
{
110 struct hashmap_entry ent
;
115 static int path_and_oids_cmp(const void *hashmap_cmp_fn_data
,
116 const struct hashmap_entry
*eptr
,
117 const struct hashmap_entry
*entry_or_key
,
120 const struct path_and_oids_entry
*e1
, *e2
;
122 e1
= container_of(eptr
, const struct path_and_oids_entry
, ent
);
123 e2
= container_of(entry_or_key
, const struct path_and_oids_entry
, ent
);
125 return strcmp(e1
->path
, e2
->path
);
128 static void paths_and_oids_clear(struct hashmap
*map
)
130 struct hashmap_iter iter
;
131 struct path_and_oids_entry
*entry
;
133 hashmap_for_each_entry(map
, &iter
, entry
, ent
/* member name */) {
134 oidset_clear(&entry
->trees
);
138 hashmap_clear_and_free(map
, struct path_and_oids_entry
, ent
);
141 static void paths_and_oids_insert(struct hashmap
*map
,
143 const struct object_id
*oid
)
145 int hash
= strhash(path
);
146 struct path_and_oids_entry key
;
147 struct path_and_oids_entry
*entry
;
149 hashmap_entry_init(&key
.ent
, hash
);
151 /* use a shallow copy for the lookup */
152 key
.path
= (char *)path
;
153 oidset_init(&key
.trees
, 0);
155 entry
= hashmap_get_entry(map
, &key
, ent
, NULL
);
157 CALLOC_ARRAY(entry
, 1);
158 hashmap_entry_init(&entry
->ent
, hash
);
159 entry
->path
= xstrdup(key
.path
);
160 oidset_init(&entry
->trees
, 16);
161 hashmap_put(map
, &entry
->ent
);
164 oidset_insert(&entry
->trees
, oid
);
167 static void add_children_by_path(struct repository
*r
,
171 struct tree_desc desc
;
172 struct name_entry entry
;
177 if (parse_tree_gently(tree
, 1) < 0)
180 init_tree_desc(&desc
, tree
->buffer
, tree
->size
);
181 while (tree_entry(&desc
, &entry
)) {
182 switch (object_type(entry
.mode
)) {
184 paths_and_oids_insert(map
, entry
.path
, &entry
.oid
);
186 if (tree
->object
.flags
& UNINTERESTING
) {
187 struct tree
*child
= lookup_tree(r
, &entry
.oid
);
189 child
->object
.flags
|= UNINTERESTING
;
193 if (tree
->object
.flags
& UNINTERESTING
) {
194 struct blob
*child
= lookup_blob(r
, &entry
.oid
);
196 child
->object
.flags
|= UNINTERESTING
;
200 /* Subproject commit - not in this repository */
205 free_tree_buffer(tree
);
208 void mark_trees_uninteresting_sparse(struct repository
*r
,
209 struct oidset
*trees
)
211 unsigned has_interesting
= 0, has_uninteresting
= 0;
212 struct hashmap map
= HASHMAP_INIT(path_and_oids_cmp
, NULL
);
213 struct hashmap_iter map_iter
;
214 struct path_and_oids_entry
*entry
;
215 struct object_id
*oid
;
216 struct oidset_iter iter
;
218 oidset_iter_init(trees
, &iter
);
219 while ((!has_interesting
|| !has_uninteresting
) &&
220 (oid
= oidset_iter_next(&iter
))) {
221 struct tree
*tree
= lookup_tree(r
, oid
);
226 if (tree
->object
.flags
& UNINTERESTING
)
227 has_uninteresting
= 1;
232 /* Do not walk unless we have both types of trees. */
233 if (!has_uninteresting
|| !has_interesting
)
236 oidset_iter_init(trees
, &iter
);
237 while ((oid
= oidset_iter_next(&iter
))) {
238 struct tree
*tree
= lookup_tree(r
, oid
);
239 add_children_by_path(r
, tree
, &map
);
242 hashmap_for_each_entry(&map
, &map_iter
, entry
, ent
/* member name */)
243 mark_trees_uninteresting_sparse(r
, &entry
->trees
);
245 paths_and_oids_clear(&map
);
248 struct commit_stack
{
249 struct commit
**items
;
252 #define COMMIT_STACK_INIT { NULL, 0, 0 }
254 static void commit_stack_push(struct commit_stack
*stack
, struct commit
*commit
)
256 ALLOC_GROW(stack
->items
, stack
->nr
+ 1, stack
->alloc
);
257 stack
->items
[stack
->nr
++] = commit
;
260 static struct commit
*commit_stack_pop(struct commit_stack
*stack
)
262 return stack
->nr
? stack
->items
[--stack
->nr
] : NULL
;
265 static void commit_stack_clear(struct commit_stack
*stack
)
267 FREE_AND_NULL(stack
->items
);
268 stack
->nr
= stack
->alloc
= 0;
271 static void mark_one_parent_uninteresting(struct commit
*commit
,
272 struct commit_stack
*pending
)
274 struct commit_list
*l
;
276 if (commit
->object
.flags
& UNINTERESTING
)
278 commit
->object
.flags
|= UNINTERESTING
;
281 * Normally we haven't parsed the parent
282 * yet, so we won't have a parent of a parent
283 * here. However, it may turn out that we've
284 * reached this commit some other way (where it
285 * wasn't uninteresting), in which case we need
286 * to mark its parents recursively too..
288 for (l
= commit
->parents
; l
; l
= l
->next
)
289 commit_stack_push(pending
, l
->item
);
292 void mark_parents_uninteresting(struct commit
*commit
)
294 struct commit_stack pending
= COMMIT_STACK_INIT
;
295 struct commit_list
*l
;
297 for (l
= commit
->parents
; l
; l
= l
->next
)
298 mark_one_parent_uninteresting(l
->item
, &pending
);
300 while (pending
.nr
> 0)
301 mark_one_parent_uninteresting(commit_stack_pop(&pending
),
304 commit_stack_clear(&pending
);
307 static void add_pending_object_with_path(struct rev_info
*revs
,
309 const char *name
, unsigned mode
,
312 struct interpret_branch_name_options options
= { 0 };
315 if (revs
->no_walk
&& (obj
->flags
& UNINTERESTING
))
317 if (revs
->reflog_info
&& obj
->type
== OBJ_COMMIT
) {
318 struct strbuf buf
= STRBUF_INIT
;
319 size_t namelen
= strlen(name
);
320 int len
= interpret_branch_name(name
, namelen
, &buf
, &options
);
322 if (0 < len
&& len
< namelen
&& buf
.len
)
323 strbuf_addstr(&buf
, name
+ len
);
324 add_reflog_for_walk(revs
->reflog_info
,
325 (struct commit
*)obj
,
326 buf
.buf
[0] ? buf
.buf
: name
);
327 strbuf_release(&buf
);
328 return; /* do not add the commit itself */
330 add_object_array_with_path(obj
, name
, &revs
->pending
, mode
, path
);
333 static void add_pending_object_with_mode(struct rev_info
*revs
,
335 const char *name
, unsigned mode
)
337 add_pending_object_with_path(revs
, obj
, name
, mode
, NULL
);
340 void add_pending_object(struct rev_info
*revs
,
341 struct object
*obj
, const char *name
)
343 add_pending_object_with_mode(revs
, obj
, name
, S_IFINVALID
);
346 void add_head_to_pending(struct rev_info
*revs
)
348 struct object_id oid
;
350 if (get_oid("HEAD", &oid
))
352 obj
= parse_object(revs
->repo
, &oid
);
355 add_pending_object(revs
, obj
, "HEAD");
358 static struct object
*get_reference(struct rev_info
*revs
, const char *name
,
359 const struct object_id
*oid
,
362 struct object
*object
;
365 * If the repository has commit graphs, repo_parse_commit() avoids
366 * reading the object buffer, so use it whenever possible.
368 if (oid_object_info(revs
->repo
, oid
, NULL
) == OBJ_COMMIT
) {
369 struct commit
*c
= lookup_commit(revs
->repo
, oid
);
370 if (!repo_parse_commit(revs
->repo
, c
))
371 object
= (struct object
*) c
;
375 object
= parse_object(revs
->repo
, oid
);
379 if (revs
->ignore_missing
)
381 if (revs
->exclude_promisor_objects
&& is_promisor_object(oid
))
383 die("bad object %s", name
);
385 object
->flags
|= flags
;
389 void add_pending_oid(struct rev_info
*revs
, const char *name
,
390 const struct object_id
*oid
, unsigned int flags
)
392 struct object
*object
= get_reference(revs
, name
, oid
, flags
);
393 add_pending_object(revs
, object
, name
);
396 static struct commit
*handle_commit(struct rev_info
*revs
,
397 struct object_array_entry
*entry
)
399 struct object
*object
= entry
->item
;
400 const char *name
= entry
->name
;
401 const char *path
= entry
->path
;
402 unsigned int mode
= entry
->mode
;
403 unsigned long flags
= object
->flags
;
406 * Tag object? Look what it points to..
408 while (object
->type
== OBJ_TAG
) {
409 struct tag
*tag
= (struct tag
*) object
;
410 if (revs
->tag_objects
&& !(flags
& UNINTERESTING
))
411 add_pending_object(revs
, object
, tag
->tag
);
412 object
= parse_object(revs
->repo
, get_tagged_oid(tag
));
414 if (revs
->ignore_missing_links
|| (flags
& UNINTERESTING
))
416 if (revs
->exclude_promisor_objects
&&
417 is_promisor_object(&tag
->tagged
->oid
))
419 die("bad object %s", oid_to_hex(&tag
->tagged
->oid
));
421 object
->flags
|= flags
;
423 * We'll handle the tagged object by looping or dropping
424 * through to the non-tag handlers below. Do not
425 * propagate path data from the tag's pending entry.
432 * Commit object? Just return it, we'll do all the complex
435 if (object
->type
== OBJ_COMMIT
) {
436 struct commit
*commit
= (struct commit
*)object
;
438 if (repo_parse_commit(revs
->repo
, commit
) < 0)
439 die("unable to parse commit %s", name
);
440 if (flags
& UNINTERESTING
) {
441 mark_parents_uninteresting(commit
);
443 if (!revs
->topo_order
|| !generation_numbers_enabled(the_repository
))
447 char **slot
= revision_sources_at(revs
->sources
, commit
);
450 *slot
= xstrdup(name
);
456 * Tree object? Either mark it uninteresting, or add it
457 * to the list of objects to look at later..
459 if (object
->type
== OBJ_TREE
) {
460 struct tree
*tree
= (struct tree
*)object
;
461 if (!revs
->tree_objects
)
463 if (flags
& UNINTERESTING
) {
464 mark_tree_contents_uninteresting(revs
->repo
, tree
);
467 add_pending_object_with_path(revs
, object
, name
, mode
, path
);
472 * Blob object? You know the drill by now..
474 if (object
->type
== OBJ_BLOB
) {
475 if (!revs
->blob_objects
)
477 if (flags
& UNINTERESTING
)
479 add_pending_object_with_path(revs
, object
, name
, mode
, path
);
482 die("%s is unknown object", name
);
485 static int everybody_uninteresting(struct commit_list
*orig
,
486 struct commit
**interesting_cache
)
488 struct commit_list
*list
= orig
;
490 if (*interesting_cache
) {
491 struct commit
*commit
= *interesting_cache
;
492 if (!(commit
->object
.flags
& UNINTERESTING
))
497 struct commit
*commit
= list
->item
;
499 if (commit
->object
.flags
& UNINTERESTING
)
502 *interesting_cache
= commit
;
509 * A definition of "relevant" commit that we can use to simplify limited graphs
510 * by eliminating side branches.
512 * A "relevant" commit is one that is !UNINTERESTING (ie we are including it
513 * in our list), or that is a specified BOTTOM commit. Then after computing
514 * a limited list, during processing we can generally ignore boundary merges
515 * coming from outside the graph, (ie from irrelevant parents), and treat
516 * those merges as if they were single-parent. TREESAME is defined to consider
517 * only relevant parents, if any. If we are TREESAME to our on-graph parents,
518 * we don't care if we were !TREESAME to non-graph parents.
520 * Treating bottom commits as relevant ensures that a limited graph's
521 * connection to the actual bottom commit is not viewed as a side branch, but
522 * treated as part of the graph. For example:
524 * ....Z...A---X---o---o---B
528 * When computing "A..B", the A-X connection is at least as important as
529 * Y-X, despite A being flagged UNINTERESTING.
531 * And when computing --ancestry-path "A..B", the A-X connection is more
532 * important than Y-X, despite both A and Y being flagged UNINTERESTING.
534 static inline int relevant_commit(struct commit
*commit
)
536 return (commit
->object
.flags
& (UNINTERESTING
| BOTTOM
)) != UNINTERESTING
;
540 * Return a single relevant commit from a parent list. If we are a TREESAME
541 * commit, and this selects one of our parents, then we can safely simplify to
544 static struct commit
*one_relevant_parent(const struct rev_info
*revs
,
545 struct commit_list
*orig
)
547 struct commit_list
*list
= orig
;
548 struct commit
*relevant
= NULL
;
554 * For 1-parent commits, or if first-parent-only, then return that
555 * first parent (even if not "relevant" by the above definition).
556 * TREESAME will have been set purely on that parent.
558 if (revs
->first_parent_only
|| !orig
->next
)
562 * For multi-parent commits, identify a sole relevant parent, if any.
563 * If we have only one relevant parent, then TREESAME will be set purely
564 * with regard to that parent, and we can simplify accordingly.
566 * If we have more than one relevant parent, or no relevant parents
567 * (and multiple irrelevant ones), then we can't select a parent here
571 struct commit
*commit
= list
->item
;
573 if (relevant_commit(commit
)) {
583 * The goal is to get REV_TREE_NEW as the result only if the
584 * diff consists of all '+' (and no other changes), REV_TREE_OLD
585 * if the whole diff is removal of old data, and otherwise
586 * REV_TREE_DIFFERENT (of course if the trees are the same we
587 * want REV_TREE_SAME).
589 * The only time we care about the distinction is when
590 * remove_empty_trees is in effect, in which case we care only about
591 * whether the whole change is REV_TREE_NEW, or if there's another type
592 * of change. Which means we can stop the diff early in either of these
595 * 1. We're not using remove_empty_trees at all.
597 * 2. We saw anything except REV_TREE_NEW.
599 static int tree_difference
= REV_TREE_SAME
;
601 static void file_add_remove(struct diff_options
*options
,
602 int addremove
, unsigned mode
,
603 const struct object_id
*oid
,
605 const char *fullpath
, unsigned dirty_submodule
)
607 int diff
= addremove
== '+' ? REV_TREE_NEW
: REV_TREE_OLD
;
608 struct rev_info
*revs
= options
->change_fn_data
;
610 tree_difference
|= diff
;
611 if (!revs
->remove_empty_trees
|| tree_difference
!= REV_TREE_NEW
)
612 options
->flags
.has_changes
= 1;
615 static void file_change(struct diff_options
*options
,
616 unsigned old_mode
, unsigned new_mode
,
617 const struct object_id
*old_oid
,
618 const struct object_id
*new_oid
,
619 int old_oid_valid
, int new_oid_valid
,
620 const char *fullpath
,
621 unsigned old_dirty_submodule
, unsigned new_dirty_submodule
)
623 tree_difference
= REV_TREE_DIFFERENT
;
624 options
->flags
.has_changes
= 1;
627 static int bloom_filter_atexit_registered
;
628 static unsigned int count_bloom_filter_maybe
;
629 static unsigned int count_bloom_filter_definitely_not
;
630 static unsigned int count_bloom_filter_false_positive
;
631 static unsigned int count_bloom_filter_not_present
;
633 static void trace2_bloom_filter_statistics_atexit(void)
635 struct json_writer jw
= JSON_WRITER_INIT
;
637 jw_object_begin(&jw
, 0);
638 jw_object_intmax(&jw
, "filter_not_present", count_bloom_filter_not_present
);
639 jw_object_intmax(&jw
, "maybe", count_bloom_filter_maybe
);
640 jw_object_intmax(&jw
, "definitely_not", count_bloom_filter_definitely_not
);
641 jw_object_intmax(&jw
, "false_positive", count_bloom_filter_false_positive
);
644 trace2_data_json("bloom", the_repository
, "statistics", &jw
);
649 static int forbid_bloom_filters(struct pathspec
*spec
)
651 if (spec
->has_wildcard
)
655 if (spec
->magic
& ~PATHSPEC_LITERAL
)
657 if (spec
->nr
&& (spec
->items
[0].magic
& ~PATHSPEC_LITERAL
))
663 static void prepare_to_use_bloom_filter(struct rev_info
*revs
)
665 struct pathspec_item
*pi
;
666 char *path_alloc
= NULL
;
667 const char *path
, *p
;
669 int path_component_nr
= 1;
674 if (forbid_bloom_filters(&revs
->prune_data
))
677 repo_parse_commit(revs
->repo
, revs
->commits
->item
);
679 revs
->bloom_filter_settings
= get_bloom_filter_settings(revs
->repo
);
680 if (!revs
->bloom_filter_settings
)
683 if (!revs
->pruning
.pathspec
.nr
)
686 pi
= &revs
->pruning
.pathspec
.items
[0];
688 /* remove single trailing slash from path, if needed */
689 if (pi
->len
> 0 && pi
->match
[pi
->len
- 1] == '/') {
690 path_alloc
= xmemdupz(pi
->match
, pi
->len
- 1);
697 revs
->bloom_filter_settings
= NULL
;
705 * At this point, the path is normalized to use Unix-style
706 * path separators. This is required due to how the
707 * changed-path Bloom filters store the paths.
714 revs
->bloom_keys_nr
= path_component_nr
;
715 ALLOC_ARRAY(revs
->bloom_keys
, revs
->bloom_keys_nr
);
717 fill_bloom_key(path
, len
, &revs
->bloom_keys
[0],
718 revs
->bloom_filter_settings
);
719 path_component_nr
= 1;
724 fill_bloom_key(path
, p
- path
,
725 &revs
->bloom_keys
[path_component_nr
++],
726 revs
->bloom_filter_settings
);
730 if (trace2_is_enabled() && !bloom_filter_atexit_registered
) {
731 atexit(trace2_bloom_filter_statistics_atexit
);
732 bloom_filter_atexit_registered
= 1;
738 static int check_maybe_different_in_bloom_filter(struct rev_info
*revs
,
739 struct commit
*commit
)
741 struct bloom_filter
*filter
;
744 if (!revs
->repo
->objects
->commit_graph
)
747 if (commit_graph_generation(commit
) == GENERATION_NUMBER_INFINITY
)
750 filter
= get_bloom_filter(revs
->repo
, commit
);
753 count_bloom_filter_not_present
++;
757 for (j
= 0; result
&& j
< revs
->bloom_keys_nr
; j
++) {
758 result
= bloom_filter_contains(filter
,
759 &revs
->bloom_keys
[j
],
760 revs
->bloom_filter_settings
);
764 count_bloom_filter_maybe
++;
766 count_bloom_filter_definitely_not
++;
771 static int rev_compare_tree(struct rev_info
*revs
,
772 struct commit
*parent
, struct commit
*commit
, int nth_parent
)
774 struct tree
*t1
= get_commit_tree(parent
);
775 struct tree
*t2
= get_commit_tree(commit
);
783 if (revs
->simplify_by_decoration
) {
785 * If we are simplifying by decoration, then the commit
786 * is worth showing if it has a tag pointing at it.
788 if (get_name_decoration(&commit
->object
))
789 return REV_TREE_DIFFERENT
;
791 * A commit that is not pointed by a tag is uninteresting
792 * if we are not limited by path. This means that you will
793 * see the usual "commits that touch the paths" plus any
794 * tagged commit by specifying both --simplify-by-decoration
797 if (!revs
->prune_data
.nr
)
798 return REV_TREE_SAME
;
801 if (revs
->bloom_keys_nr
&& !nth_parent
) {
802 bloom_ret
= check_maybe_different_in_bloom_filter(revs
, commit
);
805 return REV_TREE_SAME
;
808 tree_difference
= REV_TREE_SAME
;
809 revs
->pruning
.flags
.has_changes
= 0;
810 diff_tree_oid(&t1
->object
.oid
, &t2
->object
.oid
, "", &revs
->pruning
);
813 if (bloom_ret
== 1 && tree_difference
== REV_TREE_SAME
)
814 count_bloom_filter_false_positive
++;
816 return tree_difference
;
819 static int rev_same_tree_as_empty(struct rev_info
*revs
, struct commit
*commit
)
821 struct tree
*t1
= get_commit_tree(commit
);
826 tree_difference
= REV_TREE_SAME
;
827 revs
->pruning
.flags
.has_changes
= 0;
828 diff_tree_oid(NULL
, &t1
->object
.oid
, "", &revs
->pruning
);
830 return tree_difference
== REV_TREE_SAME
;
833 struct treesame_state
{
834 unsigned int nparents
;
835 unsigned char treesame
[FLEX_ARRAY
];
838 static struct treesame_state
*initialise_treesame(struct rev_info
*revs
, struct commit
*commit
)
840 unsigned n
= commit_list_count(commit
->parents
);
841 struct treesame_state
*st
= xcalloc(1, st_add(sizeof(*st
), n
));
843 add_decoration(&revs
->treesame
, &commit
->object
, st
);
848 * Must be called immediately after removing the nth_parent from a commit's
849 * parent list, if we are maintaining the per-parent treesame[] decoration.
850 * This does not recalculate the master TREESAME flag - update_treesame()
851 * should be called to update it after a sequence of treesame[] modifications
852 * that may have affected it.
854 static int compact_treesame(struct rev_info
*revs
, struct commit
*commit
, unsigned nth_parent
)
856 struct treesame_state
*st
;
859 if (!commit
->parents
) {
861 * Have just removed the only parent from a non-merge.
862 * Different handling, as we lack decoration.
865 die("compact_treesame %u", nth_parent
);
866 old_same
= !!(commit
->object
.flags
& TREESAME
);
867 if (rev_same_tree_as_empty(revs
, commit
))
868 commit
->object
.flags
|= TREESAME
;
870 commit
->object
.flags
&= ~TREESAME
;
874 st
= lookup_decoration(&revs
->treesame
, &commit
->object
);
875 if (!st
|| nth_parent
>= st
->nparents
)
876 die("compact_treesame %u", nth_parent
);
878 old_same
= st
->treesame
[nth_parent
];
879 memmove(st
->treesame
+ nth_parent
,
880 st
->treesame
+ nth_parent
+ 1,
881 st
->nparents
- nth_parent
- 1);
884 * If we've just become a non-merge commit, update TREESAME
885 * immediately, and remove the no-longer-needed decoration.
886 * If still a merge, defer update until update_treesame().
888 if (--st
->nparents
== 1) {
889 if (commit
->parents
->next
)
890 die("compact_treesame parents mismatch");
891 if (st
->treesame
[0] && revs
->dense
)
892 commit
->object
.flags
|= TREESAME
;
894 commit
->object
.flags
&= ~TREESAME
;
895 free(add_decoration(&revs
->treesame
, &commit
->object
, NULL
));
901 static unsigned update_treesame(struct rev_info
*revs
, struct commit
*commit
)
903 if (commit
->parents
&& commit
->parents
->next
) {
905 struct treesame_state
*st
;
906 struct commit_list
*p
;
907 unsigned relevant_parents
;
908 unsigned relevant_change
, irrelevant_change
;
910 st
= lookup_decoration(&revs
->treesame
, &commit
->object
);
912 die("update_treesame %s", oid_to_hex(&commit
->object
.oid
));
913 relevant_parents
= 0;
914 relevant_change
= irrelevant_change
= 0;
915 for (p
= commit
->parents
, n
= 0; p
; n
++, p
= p
->next
) {
916 if (relevant_commit(p
->item
)) {
917 relevant_change
|= !st
->treesame
[n
];
920 irrelevant_change
|= !st
->treesame
[n
];
922 if (relevant_parents
? relevant_change
: irrelevant_change
)
923 commit
->object
.flags
&= ~TREESAME
;
925 commit
->object
.flags
|= TREESAME
;
928 return commit
->object
.flags
& TREESAME
;
931 static inline int limiting_can_increase_treesame(const struct rev_info
*revs
)
934 * TREESAME is irrelevant unless prune && dense;
935 * if simplify_history is set, we can't have a mixture of TREESAME and
936 * !TREESAME INTERESTING parents (and we don't have treesame[]
937 * decoration anyway);
938 * if first_parent_only is set, then the TREESAME flag is locked
939 * against the first parent (and again we lack treesame[] decoration).
941 return revs
->prune
&& revs
->dense
&&
942 !revs
->simplify_history
&&
943 !revs
->first_parent_only
;
946 static void try_to_simplify_commit(struct rev_info
*revs
, struct commit
*commit
)
948 struct commit_list
**pp
, *parent
;
949 struct treesame_state
*ts
= NULL
;
950 int relevant_change
= 0, irrelevant_change
= 0;
951 int relevant_parents
, nth_parent
;
954 * If we don't do pruning, everything is interesting
959 if (!get_commit_tree(commit
))
962 if (!commit
->parents
) {
963 if (rev_same_tree_as_empty(revs
, commit
))
964 commit
->object
.flags
|= TREESAME
;
969 * Normal non-merge commit? If we don't want to make the
970 * history dense, we consider it always to be a change..
972 if (!revs
->dense
&& !commit
->parents
->next
)
975 for (pp
= &commit
->parents
, nth_parent
= 0, relevant_parents
= 0;
976 (parent
= *pp
) != NULL
;
977 pp
= &parent
->next
, nth_parent
++) {
978 struct commit
*p
= parent
->item
;
979 if (relevant_commit(p
))
982 if (nth_parent
== 1) {
984 * This our second loop iteration - so we now know
985 * we're dealing with a merge.
987 * Do not compare with later parents when we care only about
988 * the first parent chain, in order to avoid derailing the
989 * traversal to follow a side branch that brought everything
990 * in the path we are limited to by the pathspec.
992 if (revs
->first_parent_only
)
995 * If this will remain a potentially-simplifiable
996 * merge, remember per-parent treesame if needed.
997 * Initialise the array with the comparison from our
1000 if (revs
->treesame
.name
&&
1001 !revs
->simplify_history
&&
1002 !(commit
->object
.flags
& UNINTERESTING
)) {
1003 ts
= initialise_treesame(revs
, commit
);
1004 if (!(irrelevant_change
|| relevant_change
))
1005 ts
->treesame
[0] = 1;
1008 if (repo_parse_commit(revs
->repo
, p
) < 0)
1009 die("cannot simplify commit %s (because of %s)",
1010 oid_to_hex(&commit
->object
.oid
),
1011 oid_to_hex(&p
->object
.oid
));
1012 switch (rev_compare_tree(revs
, p
, commit
, nth_parent
)) {
1014 if (!revs
->simplify_history
|| !relevant_commit(p
)) {
1015 /* Even if a merge with an uninteresting
1016 * side branch brought the entire change
1017 * we are interested in, we do not want
1018 * to lose the other branches of this
1019 * merge, so we just keep going.
1022 ts
->treesame
[nth_parent
] = 1;
1025 parent
->next
= NULL
;
1026 commit
->parents
= parent
;
1029 * A merge commit is a "diversion" if it is not
1030 * TREESAME to its first parent but is TREESAME
1031 * to a later parent. In the simplified history,
1032 * we "divert" the history walk to the later
1033 * parent. These commits are shown when "show_pulls"
1034 * is enabled, so do not mark the object as
1037 if (!revs
->show_pulls
|| !nth_parent
)
1038 commit
->object
.flags
|= TREESAME
;
1043 if (revs
->remove_empty_trees
&&
1044 rev_same_tree_as_empty(revs
, p
)) {
1045 /* We are adding all the specified
1046 * paths from this parent, so the
1047 * history beyond this parent is not
1048 * interesting. Remove its parents
1049 * (they are grandparents for us).
1050 * IOW, we pretend this parent is a
1053 if (repo_parse_commit(revs
->repo
, p
) < 0)
1054 die("cannot simplify commit %s (invalid %s)",
1055 oid_to_hex(&commit
->object
.oid
),
1056 oid_to_hex(&p
->object
.oid
));
1061 case REV_TREE_DIFFERENT
:
1062 if (relevant_commit(p
))
1063 relevant_change
= 1;
1065 irrelevant_change
= 1;
1068 commit
->object
.flags
|= PULL_MERGE
;
1072 die("bad tree compare for commit %s", oid_to_hex(&commit
->object
.oid
));
1076 * TREESAME is straightforward for single-parent commits. For merge
1077 * commits, it is most useful to define it so that "irrelevant"
1078 * parents cannot make us !TREESAME - if we have any relevant
1079 * parents, then we only consider TREESAMEness with respect to them,
1080 * allowing irrelevant merges from uninteresting branches to be
1081 * simplified away. Only if we have only irrelevant parents do we
1082 * base TREESAME on them. Note that this logic is replicated in
1083 * update_treesame, which should be kept in sync.
1085 if (relevant_parents
? !relevant_change
: !irrelevant_change
)
1086 commit
->object
.flags
|= TREESAME
;
1089 static int process_parents(struct rev_info
*revs
, struct commit
*commit
,
1090 struct commit_list
**list
, struct prio_queue
*queue
)
1092 struct commit_list
*parent
= commit
->parents
;
1095 if (commit
->object
.flags
& ADDED
)
1097 commit
->object
.flags
|= ADDED
;
1099 if (revs
->include_check
&&
1100 !revs
->include_check(commit
, revs
->include_check_data
))
1104 * If the commit is uninteresting, don't try to
1105 * prune parents - we want the maximal uninteresting
1108 * Normally we haven't parsed the parent
1109 * yet, so we won't have a parent of a parent
1110 * here. However, it may turn out that we've
1111 * reached this commit some other way (where it
1112 * wasn't uninteresting), in which case we need
1113 * to mark its parents recursively too..
1115 if (commit
->object
.flags
& UNINTERESTING
) {
1117 struct commit
*p
= parent
->item
;
1118 parent
= parent
->next
;
1120 p
->object
.flags
|= UNINTERESTING
;
1121 if (repo_parse_commit_gently(revs
->repo
, p
, 1) < 0)
1124 mark_parents_uninteresting(p
);
1125 if (p
->object
.flags
& SEEN
)
1127 p
->object
.flags
|= (SEEN
| NOT_USER_GIVEN
);
1129 commit_list_insert_by_date(p
, list
);
1131 prio_queue_put(queue
, p
);
1137 * Ok, the commit wasn't uninteresting. Try to
1138 * simplify the commit history and find the parent
1139 * that has no differences in the path set if one exists.
1141 try_to_simplify_commit(revs
, commit
);
1146 left_flag
= (commit
->object
.flags
& SYMMETRIC_LEFT
);
1148 for (parent
= commit
->parents
; parent
; parent
= parent
->next
) {
1149 struct commit
*p
= parent
->item
;
1150 int gently
= revs
->ignore_missing_links
||
1151 revs
->exclude_promisor_objects
;
1152 if (repo_parse_commit_gently(revs
->repo
, p
, gently
) < 0) {
1153 if (revs
->exclude_promisor_objects
&&
1154 is_promisor_object(&p
->object
.oid
)) {
1155 if (revs
->first_parent_only
)
1161 if (revs
->sources
) {
1162 char **slot
= revision_sources_at(revs
->sources
, p
);
1165 *slot
= *revision_sources_at(revs
->sources
, commit
);
1167 p
->object
.flags
|= left_flag
;
1168 if (!(p
->object
.flags
& SEEN
)) {
1169 p
->object
.flags
|= (SEEN
| NOT_USER_GIVEN
);
1171 commit_list_insert_by_date(p
, list
);
1173 prio_queue_put(queue
, p
);
1175 if (revs
->first_parent_only
)
1181 static void cherry_pick_list(struct commit_list
*list
, struct rev_info
*revs
)
1183 struct commit_list
*p
;
1184 int left_count
= 0, right_count
= 0;
1186 struct patch_ids ids
;
1187 unsigned cherry_flag
;
1189 /* First count the commits on the left and on the right */
1190 for (p
= list
; p
; p
= p
->next
) {
1191 struct commit
*commit
= p
->item
;
1192 unsigned flags
= commit
->object
.flags
;
1193 if (flags
& BOUNDARY
)
1195 else if (flags
& SYMMETRIC_LEFT
)
1201 if (!left_count
|| !right_count
)
1204 left_first
= left_count
< right_count
;
1205 init_patch_ids(revs
->repo
, &ids
);
1206 ids
.diffopts
.pathspec
= revs
->diffopt
.pathspec
;
1208 /* Compute patch-ids for one side */
1209 for (p
= list
; p
; p
= p
->next
) {
1210 struct commit
*commit
= p
->item
;
1211 unsigned flags
= commit
->object
.flags
;
1213 if (flags
& BOUNDARY
)
1216 * If we have fewer left, left_first is set and we omit
1217 * commits on the right branch in this loop. If we have
1218 * fewer right, we skip the left ones.
1220 if (left_first
!= !!(flags
& SYMMETRIC_LEFT
))
1222 add_commit_patch_id(commit
, &ids
);
1225 /* either cherry_mark or cherry_pick are true */
1226 cherry_flag
= revs
->cherry_mark
? PATCHSAME
: SHOWN
;
1228 /* Check the other side */
1229 for (p
= list
; p
; p
= p
->next
) {
1230 struct commit
*commit
= p
->item
;
1231 struct patch_id
*id
;
1232 unsigned flags
= commit
->object
.flags
;
1234 if (flags
& BOUNDARY
)
1237 * If we have fewer left, left_first is set and we omit
1238 * commits on the left branch in this loop.
1240 if (left_first
== !!(flags
& SYMMETRIC_LEFT
))
1244 * Have we seen the same patch id?
1246 id
= patch_id_iter_first(commit
, &ids
);
1250 commit
->object
.flags
|= cherry_flag
;
1252 id
->commit
->object
.flags
|= cherry_flag
;
1253 } while ((id
= patch_id_iter_next(id
, &ids
)));
1256 free_patch_ids(&ids
);
1259 /* How many extra uninteresting commits we want to see.. */
1262 static int still_interesting(struct commit_list
*src
, timestamp_t date
, int slop
,
1263 struct commit
**interesting_cache
)
1266 * No source list at all? We're definitely done..
1272 * Does the destination list contain entries with a date
1273 * before the source list? Definitely _not_ done.
1275 if (date
<= src
->item
->date
)
1279 * Does the source list still have interesting commits in
1280 * it? Definitely not done..
1282 if (!everybody_uninteresting(src
, interesting_cache
))
1285 /* Ok, we're closing in.. */
1290 * "rev-list --ancestry-path A..B" computes commits that are ancestors
1291 * of B but not ancestors of A but further limits the result to those
1292 * that are descendants of A. This takes the list of bottom commits and
1293 * the result of "A..B" without --ancestry-path, and limits the latter
1294 * further to the ones that can reach one of the commits in "bottom".
1296 static void limit_to_ancestry(struct commit_list
*bottom
, struct commit_list
*list
)
1298 struct commit_list
*p
;
1299 struct commit_list
*rlist
= NULL
;
1303 * Reverse the list so that it will be likely that we would
1304 * process parents before children.
1306 for (p
= list
; p
; p
= p
->next
)
1307 commit_list_insert(p
->item
, &rlist
);
1309 for (p
= bottom
; p
; p
= p
->next
)
1310 p
->item
->object
.flags
|= TMP_MARK
;
1313 * Mark the ones that can reach bottom commits in "list",
1314 * in a bottom-up fashion.
1318 for (p
= rlist
; p
; p
= p
->next
) {
1319 struct commit
*c
= p
->item
;
1320 struct commit_list
*parents
;
1321 if (c
->object
.flags
& (TMP_MARK
| UNINTERESTING
))
1323 for (parents
= c
->parents
;
1325 parents
= parents
->next
) {
1326 if (!(parents
->item
->object
.flags
& TMP_MARK
))
1328 c
->object
.flags
|= TMP_MARK
;
1333 } while (made_progress
);
1336 * NEEDSWORK: decide if we want to remove parents that are
1337 * not marked with TMP_MARK from commit->parents for commits
1338 * in the resulting list. We may not want to do that, though.
1342 * The ones that are not marked with TMP_MARK are uninteresting
1344 for (p
= list
; p
; p
= p
->next
) {
1345 struct commit
*c
= p
->item
;
1346 if (c
->object
.flags
& TMP_MARK
)
1348 c
->object
.flags
|= UNINTERESTING
;
1351 /* We are done with the TMP_MARK */
1352 for (p
= list
; p
; p
= p
->next
)
1353 p
->item
->object
.flags
&= ~TMP_MARK
;
1354 for (p
= bottom
; p
; p
= p
->next
)
1355 p
->item
->object
.flags
&= ~TMP_MARK
;
1356 free_commit_list(rlist
);
1360 * Before walking the history, keep the set of "negative" refs the
1361 * caller has asked to exclude.
1363 * This is used to compute "rev-list --ancestry-path A..B", as we need
1364 * to filter the result of "A..B" further to the ones that can actually
1367 static struct commit_list
*collect_bottom_commits(struct commit_list
*list
)
1369 struct commit_list
*elem
, *bottom
= NULL
;
1370 for (elem
= list
; elem
; elem
= elem
->next
)
1371 if (elem
->item
->object
.flags
& BOTTOM
)
1372 commit_list_insert(elem
->item
, &bottom
);
1376 /* Assumes either left_only or right_only is set */
1377 static void limit_left_right(struct commit_list
*list
, struct rev_info
*revs
)
1379 struct commit_list
*p
;
1381 for (p
= list
; p
; p
= p
->next
) {
1382 struct commit
*commit
= p
->item
;
1384 if (revs
->right_only
) {
1385 if (commit
->object
.flags
& SYMMETRIC_LEFT
)
1386 commit
->object
.flags
|= SHOWN
;
1387 } else /* revs->left_only is set */
1388 if (!(commit
->object
.flags
& SYMMETRIC_LEFT
))
1389 commit
->object
.flags
|= SHOWN
;
1393 static int limit_list(struct rev_info
*revs
)
1396 timestamp_t date
= TIME_MAX
;
1397 struct commit_list
*original_list
= revs
->commits
;
1398 struct commit_list
*newlist
= NULL
;
1399 struct commit_list
**p
= &newlist
;
1400 struct commit_list
*bottom
= NULL
;
1401 struct commit
*interesting_cache
= NULL
;
1403 if (revs
->ancestry_path
) {
1404 bottom
= collect_bottom_commits(original_list
);
1406 die("--ancestry-path given but there are no bottom commits");
1409 while (original_list
) {
1410 struct commit
*commit
= pop_commit(&original_list
);
1411 struct object
*obj
= &commit
->object
;
1412 show_early_output_fn_t show
;
1414 if (commit
== interesting_cache
)
1415 interesting_cache
= NULL
;
1417 if (revs
->max_age
!= -1 && (commit
->date
< revs
->max_age
))
1418 obj
->flags
|= UNINTERESTING
;
1419 if (process_parents(revs
, commit
, &original_list
, NULL
) < 0)
1421 if (obj
->flags
& UNINTERESTING
) {
1422 mark_parents_uninteresting(commit
);
1423 slop
= still_interesting(original_list
, date
, slop
, &interesting_cache
);
1428 if (revs
->min_age
!= -1 && (commit
->date
> revs
->min_age
) &&
1429 !revs
->line_level_traverse
)
1431 date
= commit
->date
;
1432 p
= &commit_list_insert(commit
, p
)->next
;
1434 show
= show_early_output
;
1438 show(revs
, newlist
);
1439 show_early_output
= NULL
;
1441 if (revs
->cherry_pick
|| revs
->cherry_mark
)
1442 cherry_pick_list(newlist
, revs
);
1444 if (revs
->left_only
|| revs
->right_only
)
1445 limit_left_right(newlist
, revs
);
1448 limit_to_ancestry(bottom
, newlist
);
1449 free_commit_list(bottom
);
1453 * Check if any commits have become TREESAME by some of their parents
1454 * becoming UNINTERESTING.
1456 if (limiting_can_increase_treesame(revs
)) {
1457 struct commit_list
*list
= NULL
;
1458 for (list
= newlist
; list
; list
= list
->next
) {
1459 struct commit
*c
= list
->item
;
1460 if (c
->object
.flags
& (UNINTERESTING
| TREESAME
))
1462 update_treesame(revs
, c
);
1466 free_commit_list(original_list
);
1467 revs
->commits
= newlist
;
1472 * Add an entry to refs->cmdline with the specified information.
1475 static void add_rev_cmdline(struct rev_info
*revs
,
1476 struct object
*item
,
1481 struct rev_cmdline_info
*info
= &revs
->cmdline
;
1482 unsigned int nr
= info
->nr
;
1484 ALLOC_GROW(info
->rev
, nr
+ 1, info
->alloc
);
1485 info
->rev
[nr
].item
= item
;
1486 info
->rev
[nr
].name
= xstrdup(name
);
1487 info
->rev
[nr
].whence
= whence
;
1488 info
->rev
[nr
].flags
= flags
;
1492 static void add_rev_cmdline_list(struct rev_info
*revs
,
1493 struct commit_list
*commit_list
,
1497 while (commit_list
) {
1498 struct object
*object
= &commit_list
->item
->object
;
1499 add_rev_cmdline(revs
, object
, oid_to_hex(&object
->oid
),
1501 commit_list
= commit_list
->next
;
1505 struct all_refs_cb
{
1507 int warned_bad_reflog
;
1508 struct rev_info
*all_revs
;
1509 const char *name_for_errormsg
;
1510 struct worktree
*wt
;
1513 int ref_excluded(struct string_list
*ref_excludes
, const char *path
)
1515 struct string_list_item
*item
;
1519 for_each_string_list_item(item
, ref_excludes
) {
1520 if (!wildmatch(item
->string
, path
, 0))
1526 static int handle_one_ref(const char *path
, const struct object_id
*oid
,
1527 int flag
, void *cb_data
)
1529 struct all_refs_cb
*cb
= cb_data
;
1530 struct object
*object
;
1532 if (ref_excluded(cb
->all_revs
->ref_excludes
, path
))
1535 object
= get_reference(cb
->all_revs
, path
, oid
, cb
->all_flags
);
1536 add_rev_cmdline(cb
->all_revs
, object
, path
, REV_CMD_REF
, cb
->all_flags
);
1537 add_pending_object(cb
->all_revs
, object
, path
);
1541 static void init_all_refs_cb(struct all_refs_cb
*cb
, struct rev_info
*revs
,
1544 cb
->all_revs
= revs
;
1545 cb
->all_flags
= flags
;
1546 revs
->rev_input_given
= 1;
1550 void clear_ref_exclusion(struct string_list
**ref_excludes_p
)
1552 if (*ref_excludes_p
) {
1553 string_list_clear(*ref_excludes_p
, 0);
1554 free(*ref_excludes_p
);
1556 *ref_excludes_p
= NULL
;
1559 void add_ref_exclusion(struct string_list
**ref_excludes_p
, const char *exclude
)
1561 if (!*ref_excludes_p
) {
1562 CALLOC_ARRAY(*ref_excludes_p
, 1);
1563 (*ref_excludes_p
)->strdup_strings
= 1;
1565 string_list_append(*ref_excludes_p
, exclude
);
1568 static void handle_refs(struct ref_store
*refs
,
1569 struct rev_info
*revs
, unsigned flags
,
1570 int (*for_each
)(struct ref_store
*, each_ref_fn
, void *))
1572 struct all_refs_cb cb
;
1575 /* this could happen with uninitialized submodules */
1579 init_all_refs_cb(&cb
, revs
, flags
);
1580 for_each(refs
, handle_one_ref
, &cb
);
1583 static void handle_one_reflog_commit(struct object_id
*oid
, void *cb_data
)
1585 struct all_refs_cb
*cb
= cb_data
;
1586 if (!is_null_oid(oid
)) {
1587 struct object
*o
= parse_object(cb
->all_revs
->repo
, oid
);
1589 o
->flags
|= cb
->all_flags
;
1590 /* ??? CMDLINEFLAGS ??? */
1591 add_pending_object(cb
->all_revs
, o
, "");
1593 else if (!cb
->warned_bad_reflog
) {
1594 warning("reflog of '%s' references pruned commits",
1595 cb
->name_for_errormsg
);
1596 cb
->warned_bad_reflog
= 1;
1601 static int handle_one_reflog_ent(struct object_id
*ooid
, struct object_id
*noid
,
1602 const char *email
, timestamp_t timestamp
, int tz
,
1603 const char *message
, void *cb_data
)
1605 handle_one_reflog_commit(ooid
, cb_data
);
1606 handle_one_reflog_commit(noid
, cb_data
);
1610 static int handle_one_reflog(const char *refname_in_wt
,
1611 const struct object_id
*oid
,
1612 int flag
, void *cb_data
)
1614 struct all_refs_cb
*cb
= cb_data
;
1615 struct strbuf refname
= STRBUF_INIT
;
1617 cb
->warned_bad_reflog
= 0;
1618 strbuf_worktree_ref(cb
->wt
, &refname
, refname_in_wt
);
1619 cb
->name_for_errormsg
= refname
.buf
;
1620 refs_for_each_reflog_ent(get_main_ref_store(the_repository
),
1622 handle_one_reflog_ent
, cb_data
);
1623 strbuf_release(&refname
);
1627 static void add_other_reflogs_to_pending(struct all_refs_cb
*cb
)
1629 struct worktree
**worktrees
, **p
;
1631 worktrees
= get_worktrees();
1632 for (p
= worktrees
; *p
; p
++) {
1633 struct worktree
*wt
= *p
;
1639 refs_for_each_reflog(get_worktree_ref_store(wt
),
1643 free_worktrees(worktrees
);
1646 void add_reflogs_to_pending(struct rev_info
*revs
, unsigned flags
)
1648 struct all_refs_cb cb
;
1651 cb
.all_flags
= flags
;
1653 for_each_reflog(handle_one_reflog
, &cb
);
1655 if (!revs
->single_worktree
)
1656 add_other_reflogs_to_pending(&cb
);
1659 static void add_cache_tree(struct cache_tree
*it
, struct rev_info
*revs
,
1660 struct strbuf
*path
, unsigned int flags
)
1662 size_t baselen
= path
->len
;
1665 if (it
->entry_count
>= 0) {
1666 struct tree
*tree
= lookup_tree(revs
->repo
, &it
->oid
);
1667 tree
->object
.flags
|= flags
;
1668 add_pending_object_with_path(revs
, &tree
->object
, "",
1672 for (i
= 0; i
< it
->subtree_nr
; i
++) {
1673 struct cache_tree_sub
*sub
= it
->down
[i
];
1674 strbuf_addf(path
, "%s%s", baselen
? "/" : "", sub
->name
);
1675 add_cache_tree(sub
->cache_tree
, revs
, path
, flags
);
1676 strbuf_setlen(path
, baselen
);
1681 static void do_add_index_objects_to_pending(struct rev_info
*revs
,
1682 struct index_state
*istate
,
1687 /* TODO: audit for interaction with sparse-index. */
1688 ensure_full_index(istate
);
1689 for (i
= 0; i
< istate
->cache_nr
; i
++) {
1690 struct cache_entry
*ce
= istate
->cache
[i
];
1693 if (S_ISGITLINK(ce
->ce_mode
))
1696 blob
= lookup_blob(revs
->repo
, &ce
->oid
);
1698 die("unable to add index blob to traversal");
1699 blob
->object
.flags
|= flags
;
1700 add_pending_object_with_path(revs
, &blob
->object
, "",
1701 ce
->ce_mode
, ce
->name
);
1704 if (istate
->cache_tree
) {
1705 struct strbuf path
= STRBUF_INIT
;
1706 add_cache_tree(istate
->cache_tree
, revs
, &path
, flags
);
1707 strbuf_release(&path
);
1711 void add_index_objects_to_pending(struct rev_info
*revs
, unsigned int flags
)
1713 struct worktree
**worktrees
, **p
;
1715 repo_read_index(revs
->repo
);
1716 do_add_index_objects_to_pending(revs
, revs
->repo
->index
, flags
);
1718 if (revs
->single_worktree
)
1721 worktrees
= get_worktrees();
1722 for (p
= worktrees
; *p
; p
++) {
1723 struct worktree
*wt
= *p
;
1724 struct index_state istate
= { NULL
};
1727 continue; /* current index already taken care of */
1729 if (read_index_from(&istate
,
1730 worktree_git_path(wt
, "index"),
1731 get_worktree_git_dir(wt
)) > 0)
1732 do_add_index_objects_to_pending(revs
, &istate
, flags
);
1733 discard_index(&istate
);
1735 free_worktrees(worktrees
);
1738 struct add_alternate_refs_data
{
1739 struct rev_info
*revs
;
1743 static void add_one_alternate_ref(const struct object_id
*oid
,
1746 const char *name
= ".alternate";
1747 struct add_alternate_refs_data
*data
= vdata
;
1750 obj
= get_reference(data
->revs
, name
, oid
, data
->flags
);
1751 add_rev_cmdline(data
->revs
, obj
, name
, REV_CMD_REV
, data
->flags
);
1752 add_pending_object(data
->revs
, obj
, name
);
1755 static void add_alternate_refs_to_pending(struct rev_info
*revs
,
1758 struct add_alternate_refs_data data
;
1761 for_each_alternate_ref(add_one_alternate_ref
, &data
);
1764 static int add_parents_only(struct rev_info
*revs
, const char *arg_
, int flags
,
1767 struct object_id oid
;
1769 struct commit
*commit
;
1770 struct commit_list
*parents
;
1772 const char *arg
= arg_
;
1775 flags
^= UNINTERESTING
| BOTTOM
;
1778 if (get_oid_committish(arg
, &oid
))
1781 it
= get_reference(revs
, arg
, &oid
, 0);
1782 if (!it
&& revs
->ignore_missing
)
1784 if (it
->type
!= OBJ_TAG
)
1786 if (!((struct tag
*)it
)->tagged
)
1788 oidcpy(&oid
, &((struct tag
*)it
)->tagged
->oid
);
1790 if (it
->type
!= OBJ_COMMIT
)
1792 commit
= (struct commit
*)it
;
1793 if (exclude_parent
&&
1794 exclude_parent
> commit_list_count(commit
->parents
))
1796 for (parents
= commit
->parents
, parent_number
= 1;
1798 parents
= parents
->next
, parent_number
++) {
1799 if (exclude_parent
&& parent_number
!= exclude_parent
)
1802 it
= &parents
->item
->object
;
1804 add_rev_cmdline(revs
, it
, arg_
, REV_CMD_PARENTS_ONLY
, flags
);
1805 add_pending_object(revs
, it
, arg
);
1810 void repo_init_revisions(struct repository
*r
,
1811 struct rev_info
*revs
,
1814 memset(revs
, 0, sizeof(*revs
));
1817 revs
->abbrev
= DEFAULT_ABBREV
;
1818 revs
->simplify_history
= 1;
1819 revs
->pruning
.repo
= r
;
1820 revs
->pruning
.flags
.recursive
= 1;
1821 revs
->pruning
.flags
.quick
= 1;
1822 revs
->pruning
.add_remove
= file_add_remove
;
1823 revs
->pruning
.change
= file_change
;
1824 revs
->pruning
.change_fn_data
= revs
;
1825 revs
->sort_order
= REV_SORT_IN_GRAPH_ORDER
;
1827 revs
->prefix
= prefix
;
1830 revs
->skip_count
= -1;
1831 revs
->max_count
= -1;
1832 revs
->max_parents
= -1;
1833 revs
->expand_tabs_in_log
= -1;
1835 revs
->commit_format
= CMIT_FMT_DEFAULT
;
1836 revs
->expand_tabs_in_log_default
= 8;
1838 grep_init(&revs
->grep_filter
, revs
->repo
, prefix
);
1839 revs
->grep_filter
.status_only
= 1;
1841 repo_diff_setup(revs
->repo
, &revs
->diffopt
);
1842 if (prefix
&& !revs
->diffopt
.prefix
) {
1843 revs
->diffopt
.prefix
= prefix
;
1844 revs
->diffopt
.prefix_length
= strlen(prefix
);
1847 init_display_notes(&revs
->notes_opt
);
1850 static void add_pending_commit_list(struct rev_info
*revs
,
1851 struct commit_list
*commit_list
,
1854 while (commit_list
) {
1855 struct object
*object
= &commit_list
->item
->object
;
1856 object
->flags
|= flags
;
1857 add_pending_object(revs
, object
, oid_to_hex(&object
->oid
));
1858 commit_list
= commit_list
->next
;
1862 static void prepare_show_merge(struct rev_info
*revs
)
1864 struct commit_list
*bases
;
1865 struct commit
*head
, *other
;
1866 struct object_id oid
;
1867 const char **prune
= NULL
;
1868 int i
, prune_num
= 1; /* counting terminating NULL */
1869 struct index_state
*istate
= revs
->repo
->index
;
1871 if (get_oid("HEAD", &oid
))
1872 die("--merge without HEAD?");
1873 head
= lookup_commit_or_die(&oid
, "HEAD");
1874 if (get_oid("MERGE_HEAD", &oid
))
1875 die("--merge without MERGE_HEAD?");
1876 other
= lookup_commit_or_die(&oid
, "MERGE_HEAD");
1877 add_pending_object(revs
, &head
->object
, "HEAD");
1878 add_pending_object(revs
, &other
->object
, "MERGE_HEAD");
1879 bases
= get_merge_bases(head
, other
);
1880 add_rev_cmdline_list(revs
, bases
, REV_CMD_MERGE_BASE
, UNINTERESTING
| BOTTOM
);
1881 add_pending_commit_list(revs
, bases
, UNINTERESTING
| BOTTOM
);
1882 free_commit_list(bases
);
1883 head
->object
.flags
|= SYMMETRIC_LEFT
;
1885 if (!istate
->cache_nr
)
1886 repo_read_index(revs
->repo
);
1887 for (i
= 0; i
< istate
->cache_nr
; i
++) {
1888 const struct cache_entry
*ce
= istate
->cache
[i
];
1891 if (ce_path_match(istate
, ce
, &revs
->prune_data
, NULL
)) {
1893 REALLOC_ARRAY(prune
, prune_num
);
1894 prune
[prune_num
-2] = ce
->name
;
1895 prune
[prune_num
-1] = NULL
;
1897 while ((i
+1 < istate
->cache_nr
) &&
1898 ce_same_name(ce
, istate
->cache
[i
+1]))
1901 clear_pathspec(&revs
->prune_data
);
1902 parse_pathspec(&revs
->prune_data
, PATHSPEC_ALL_MAGIC
& ~PATHSPEC_LITERAL
,
1903 PATHSPEC_PREFER_FULL
| PATHSPEC_LITERAL_PATH
, "", prune
);
1907 static int dotdot_missing(const char *arg
, char *dotdot
,
1908 struct rev_info
*revs
, int symmetric
)
1910 if (revs
->ignore_missing
)
1912 /* de-munge so we report the full argument */
1915 ? "Invalid symmetric difference expression %s"
1916 : "Invalid revision range %s", arg
);
1919 static int handle_dotdot_1(const char *arg
, char *dotdot
,
1920 struct rev_info
*revs
, int flags
,
1921 int cant_be_filename
,
1922 struct object_context
*a_oc
,
1923 struct object_context
*b_oc
)
1925 const char *a_name
, *b_name
;
1926 struct object_id a_oid
, b_oid
;
1927 struct object
*a_obj
, *b_obj
;
1928 unsigned int a_flags
, b_flags
;
1930 unsigned int flags_exclude
= flags
^ (UNINTERESTING
| BOTTOM
);
1931 unsigned int oc_flags
= GET_OID_COMMITTISH
| GET_OID_RECORD_PATH
;
1937 b_name
= dotdot
+ 2;
1938 if (*b_name
== '.') {
1945 if (get_oid_with_context(revs
->repo
, a_name
, oc_flags
, &a_oid
, a_oc
) ||
1946 get_oid_with_context(revs
->repo
, b_name
, oc_flags
, &b_oid
, b_oc
))
1949 if (!cant_be_filename
) {
1951 verify_non_filename(revs
->prefix
, arg
);
1955 a_obj
= parse_object(revs
->repo
, &a_oid
);
1956 b_obj
= parse_object(revs
->repo
, &b_oid
);
1957 if (!a_obj
|| !b_obj
)
1958 return dotdot_missing(arg
, dotdot
, revs
, symmetric
);
1963 a_flags
= flags_exclude
;
1965 /* A...B -- find merge bases between the two */
1966 struct commit
*a
, *b
;
1967 struct commit_list
*exclude
;
1969 a
= lookup_commit_reference(revs
->repo
, &a_obj
->oid
);
1970 b
= lookup_commit_reference(revs
->repo
, &b_obj
->oid
);
1972 return dotdot_missing(arg
, dotdot
, revs
, symmetric
);
1974 exclude
= get_merge_bases(a
, b
);
1975 add_rev_cmdline_list(revs
, exclude
, REV_CMD_MERGE_BASE
,
1977 add_pending_commit_list(revs
, exclude
, flags_exclude
);
1978 free_commit_list(exclude
);
1981 a_flags
= flags
| SYMMETRIC_LEFT
;
1984 a_obj
->flags
|= a_flags
;
1985 b_obj
->flags
|= b_flags
;
1986 add_rev_cmdline(revs
, a_obj
, a_name
, REV_CMD_LEFT
, a_flags
);
1987 add_rev_cmdline(revs
, b_obj
, b_name
, REV_CMD_RIGHT
, b_flags
);
1988 add_pending_object_with_path(revs
, a_obj
, a_name
, a_oc
->mode
, a_oc
->path
);
1989 add_pending_object_with_path(revs
, b_obj
, b_name
, b_oc
->mode
, b_oc
->path
);
1993 static int handle_dotdot(const char *arg
,
1994 struct rev_info
*revs
, int flags
,
1995 int cant_be_filename
)
1997 struct object_context a_oc
, b_oc
;
1998 char *dotdot
= strstr(arg
, "..");
2004 memset(&a_oc
, 0, sizeof(a_oc
));
2005 memset(&b_oc
, 0, sizeof(b_oc
));
2008 ret
= handle_dotdot_1(arg
, dotdot
, revs
, flags
, cant_be_filename
,
2018 static int handle_revision_arg_1(const char *arg_
, struct rev_info
*revs
, int flags
, unsigned revarg_opt
)
2020 struct object_context oc
;
2022 struct object
*object
;
2023 struct object_id oid
;
2025 const char *arg
= arg_
;
2026 int cant_be_filename
= revarg_opt
& REVARG_CANNOT_BE_FILENAME
;
2027 unsigned get_sha1_flags
= GET_OID_RECORD_PATH
;
2029 flags
= flags
& UNINTERESTING
? flags
| BOTTOM
: flags
& ~BOTTOM
;
2031 if (!cant_be_filename
&& !strcmp(arg
, "..")) {
2033 * Just ".."? That is not a range but the
2034 * pathspec for the parent directory.
2039 if (!handle_dotdot(arg
, revs
, flags
, revarg_opt
))
2042 mark
= strstr(arg
, "^@");
2043 if (mark
&& !mark
[2]) {
2045 if (add_parents_only(revs
, arg
, flags
, 0))
2049 mark
= strstr(arg
, "^!");
2050 if (mark
&& !mark
[2]) {
2052 if (!add_parents_only(revs
, arg
, flags
^ (UNINTERESTING
| BOTTOM
), 0))
2055 mark
= strstr(arg
, "^-");
2057 int exclude_parent
= 1;
2061 exclude_parent
= strtoul(mark
+ 2, &end
, 10);
2062 if (*end
!= '\0' || !exclude_parent
)
2067 if (!add_parents_only(revs
, arg
, flags
^ (UNINTERESTING
| BOTTOM
), exclude_parent
))
2073 local_flags
= UNINTERESTING
| BOTTOM
;
2077 if (revarg_opt
& REVARG_COMMITTISH
)
2078 get_sha1_flags
|= GET_OID_COMMITTISH
;
2080 if (get_oid_with_context(revs
->repo
, arg
, get_sha1_flags
, &oid
, &oc
))
2081 return revs
->ignore_missing
? 0 : -1;
2082 if (!cant_be_filename
)
2083 verify_non_filename(revs
->prefix
, arg
);
2084 object
= get_reference(revs
, arg
, &oid
, flags
^ local_flags
);
2086 return revs
->ignore_missing
? 0 : -1;
2087 add_rev_cmdline(revs
, object
, arg_
, REV_CMD_REV
, flags
^ local_flags
);
2088 add_pending_object_with_path(revs
, object
, arg
, oc
.mode
, oc
.path
);
2093 int handle_revision_arg(const char *arg
, struct rev_info
*revs
, int flags
, unsigned revarg_opt
)
2095 int ret
= handle_revision_arg_1(arg
, revs
, flags
, revarg_opt
);
2097 revs
->rev_input_given
= 1;
2101 static void read_pathspec_from_stdin(struct strbuf
*sb
,
2102 struct strvec
*prune
)
2104 while (strbuf_getline(sb
, stdin
) != EOF
)
2105 strvec_push(prune
, sb
->buf
);
2108 static void read_revisions_from_stdin(struct rev_info
*revs
,
2109 struct strvec
*prune
)
2112 int seen_dashdash
= 0;
2115 save_warning
= warn_on_object_refname_ambiguity
;
2116 warn_on_object_refname_ambiguity
= 0;
2118 strbuf_init(&sb
, 1000);
2119 while (strbuf_getline(&sb
, stdin
) != EOF
) {
2123 if (sb
.buf
[0] == '-') {
2124 if (len
== 2 && sb
.buf
[1] == '-') {
2128 die("options not supported in --stdin mode");
2130 if (handle_revision_arg(sb
.buf
, revs
, 0,
2131 REVARG_CANNOT_BE_FILENAME
))
2132 die("bad revision '%s'", sb
.buf
);
2135 read_pathspec_from_stdin(&sb
, prune
);
2137 strbuf_release(&sb
);
2138 warn_on_object_refname_ambiguity
= save_warning
;
2141 static void add_grep(struct rev_info
*revs
, const char *ptn
, enum grep_pat_token what
)
2143 append_grep_pattern(&revs
->grep_filter
, ptn
, "command line", 0, what
);
2146 static void add_header_grep(struct rev_info
*revs
, enum grep_header_field field
, const char *pattern
)
2148 append_header_grep_pattern(&revs
->grep_filter
, field
, pattern
);
2151 static void add_message_grep(struct rev_info
*revs
, const char *pattern
)
2153 add_grep(revs
, pattern
, GREP_PATTERN_BODY
);
2156 static int handle_revision_opt(struct rev_info
*revs
, int argc
, const char **argv
,
2157 int *unkc
, const char **unkv
,
2158 const struct setup_revision_opt
* opt
)
2160 const char *arg
= argv
[0];
2163 const unsigned hexsz
= the_hash_algo
->hexsz
;
2165 /* pseudo revision arguments */
2166 if (!strcmp(arg
, "--all") || !strcmp(arg
, "--branches") ||
2167 !strcmp(arg
, "--tags") || !strcmp(arg
, "--remotes") ||
2168 !strcmp(arg
, "--reflog") || !strcmp(arg
, "--not") ||
2169 !strcmp(arg
, "--no-walk") || !strcmp(arg
, "--do-walk") ||
2170 !strcmp(arg
, "--bisect") || starts_with(arg
, "--glob=") ||
2171 !strcmp(arg
, "--indexed-objects") ||
2172 !strcmp(arg
, "--alternate-refs") ||
2173 starts_with(arg
, "--exclude=") ||
2174 starts_with(arg
, "--branches=") || starts_with(arg
, "--tags=") ||
2175 starts_with(arg
, "--remotes=") || starts_with(arg
, "--no-walk="))
2177 unkv
[(*unkc
)++] = arg
;
2181 if ((argcount
= parse_long_opt("max-count", argv
, &optarg
))) {
2182 revs
->max_count
= atoi(optarg
);
2185 } else if ((argcount
= parse_long_opt("skip", argv
, &optarg
))) {
2186 revs
->skip_count
= atoi(optarg
);
2188 } else if ((*arg
== '-') && isdigit(arg
[1])) {
2189 /* accept -<digit>, like traditional "head" */
2190 if (strtol_i(arg
+ 1, 10, &revs
->max_count
) < 0 ||
2191 revs
->max_count
< 0)
2192 die("'%s': not a non-negative integer", arg
+ 1);
2194 } else if (!strcmp(arg
, "-n")) {
2196 return error("-n requires an argument");
2197 revs
->max_count
= atoi(argv
[1]);
2200 } else if (skip_prefix(arg
, "-n", &optarg
)) {
2201 revs
->max_count
= atoi(optarg
);
2203 } else if ((argcount
= parse_long_opt("max-age", argv
, &optarg
))) {
2204 revs
->max_age
= atoi(optarg
);
2206 } else if ((argcount
= parse_long_opt("since", argv
, &optarg
))) {
2207 revs
->max_age
= approxidate(optarg
);
2209 } else if ((argcount
= parse_long_opt("after", argv
, &optarg
))) {
2210 revs
->max_age
= approxidate(optarg
);
2212 } else if ((argcount
= parse_long_opt("min-age", argv
, &optarg
))) {
2213 revs
->min_age
= atoi(optarg
);
2215 } else if ((argcount
= parse_long_opt("before", argv
, &optarg
))) {
2216 revs
->min_age
= approxidate(optarg
);
2218 } else if ((argcount
= parse_long_opt("until", argv
, &optarg
))) {
2219 revs
->min_age
= approxidate(optarg
);
2221 } else if (!strcmp(arg
, "--first-parent")) {
2222 revs
->first_parent_only
= 1;
2223 } else if (!strcmp(arg
, "--ancestry-path")) {
2224 revs
->ancestry_path
= 1;
2225 revs
->simplify_history
= 0;
2227 } else if (!strcmp(arg
, "-g") || !strcmp(arg
, "--walk-reflogs")) {
2228 init_reflog_walk(&revs
->reflog_info
);
2229 } else if (!strcmp(arg
, "--default")) {
2231 return error("bad --default argument");
2232 revs
->def
= argv
[1];
2234 } else if (!strcmp(arg
, "--merge")) {
2235 revs
->show_merge
= 1;
2236 } else if (!strcmp(arg
, "--topo-order")) {
2237 revs
->sort_order
= REV_SORT_IN_GRAPH_ORDER
;
2238 revs
->topo_order
= 1;
2239 } else if (!strcmp(arg
, "--simplify-merges")) {
2240 revs
->simplify_merges
= 1;
2241 revs
->topo_order
= 1;
2242 revs
->rewrite_parents
= 1;
2243 revs
->simplify_history
= 0;
2245 } else if (!strcmp(arg
, "--simplify-by-decoration")) {
2246 revs
->simplify_merges
= 1;
2247 revs
->topo_order
= 1;
2248 revs
->rewrite_parents
= 1;
2249 revs
->simplify_history
= 0;
2250 revs
->simplify_by_decoration
= 1;
2253 } else if (!strcmp(arg
, "--date-order")) {
2254 revs
->sort_order
= REV_SORT_BY_COMMIT_DATE
;
2255 revs
->topo_order
= 1;
2256 } else if (!strcmp(arg
, "--author-date-order")) {
2257 revs
->sort_order
= REV_SORT_BY_AUTHOR_DATE
;
2258 revs
->topo_order
= 1;
2259 } else if (!strcmp(arg
, "--unsorted-input")) {
2261 die(_("--unsorted-input is incompatible with --no-walk"));
2262 revs
->unsorted_input
= 1;
2263 } else if (!strcmp(arg
, "--early-output")) {
2264 revs
->early_output
= 100;
2265 revs
->topo_order
= 1;
2266 } else if (skip_prefix(arg
, "--early-output=", &optarg
)) {
2267 if (strtoul_ui(optarg
, 10, &revs
->early_output
) < 0)
2268 die("'%s': not a non-negative integer", optarg
);
2269 revs
->topo_order
= 1;
2270 } else if (!strcmp(arg
, "--parents")) {
2271 revs
->rewrite_parents
= 1;
2272 revs
->print_parents
= 1;
2273 } else if (!strcmp(arg
, "--dense")) {
2275 } else if (!strcmp(arg
, "--sparse")) {
2277 } else if (!strcmp(arg
, "--in-commit-order")) {
2278 revs
->tree_blobs_in_commit_order
= 1;
2279 } else if (!strcmp(arg
, "--remove-empty")) {
2280 revs
->remove_empty_trees
= 1;
2281 } else if (!strcmp(arg
, "--merges")) {
2282 revs
->min_parents
= 2;
2283 } else if (!strcmp(arg
, "--no-merges")) {
2284 revs
->max_parents
= 1;
2285 } else if (skip_prefix(arg
, "--min-parents=", &optarg
)) {
2286 revs
->min_parents
= atoi(optarg
);
2287 } else if (!strcmp(arg
, "--no-min-parents")) {
2288 revs
->min_parents
= 0;
2289 } else if (skip_prefix(arg
, "--max-parents=", &optarg
)) {
2290 revs
->max_parents
= atoi(optarg
);
2291 } else if (!strcmp(arg
, "--no-max-parents")) {
2292 revs
->max_parents
= -1;
2293 } else if (!strcmp(arg
, "--boundary")) {
2295 } else if (!strcmp(arg
, "--left-right")) {
2296 revs
->left_right
= 1;
2297 } else if (!strcmp(arg
, "--left-only")) {
2298 if (revs
->right_only
)
2299 die("--left-only is incompatible with --right-only"
2301 revs
->left_only
= 1;
2302 } else if (!strcmp(arg
, "--right-only")) {
2303 if (revs
->left_only
)
2304 die("--right-only is incompatible with --left-only");
2305 revs
->right_only
= 1;
2306 } else if (!strcmp(arg
, "--cherry")) {
2307 if (revs
->left_only
)
2308 die("--cherry is incompatible with --left-only");
2309 revs
->cherry_mark
= 1;
2310 revs
->right_only
= 1;
2311 revs
->max_parents
= 1;
2313 } else if (!strcmp(arg
, "--count")) {
2315 } else if (!strcmp(arg
, "--cherry-mark")) {
2316 if (revs
->cherry_pick
)
2317 die("--cherry-mark is incompatible with --cherry-pick");
2318 revs
->cherry_mark
= 1;
2319 revs
->limited
= 1; /* needs limit_list() */
2320 } else if (!strcmp(arg
, "--cherry-pick")) {
2321 if (revs
->cherry_mark
)
2322 die("--cherry-pick is incompatible with --cherry-mark");
2323 revs
->cherry_pick
= 1;
2325 } else if (!strcmp(arg
, "--objects")) {
2326 revs
->tag_objects
= 1;
2327 revs
->tree_objects
= 1;
2328 revs
->blob_objects
= 1;
2329 } else if (!strcmp(arg
, "--objects-edge")) {
2330 revs
->tag_objects
= 1;
2331 revs
->tree_objects
= 1;
2332 revs
->blob_objects
= 1;
2333 revs
->edge_hint
= 1;
2334 } else if (!strcmp(arg
, "--objects-edge-aggressive")) {
2335 revs
->tag_objects
= 1;
2336 revs
->tree_objects
= 1;
2337 revs
->blob_objects
= 1;
2338 revs
->edge_hint
= 1;
2339 revs
->edge_hint_aggressive
= 1;
2340 } else if (!strcmp(arg
, "--verify-objects")) {
2341 revs
->tag_objects
= 1;
2342 revs
->tree_objects
= 1;
2343 revs
->blob_objects
= 1;
2344 revs
->verify_objects
= 1;
2345 } else if (!strcmp(arg
, "--unpacked")) {
2347 } else if (starts_with(arg
, "--unpacked=")) {
2348 die(_("--unpacked=<packfile> no longer supported"));
2349 } else if (!strcmp(arg
, "--no-kept-objects")) {
2350 revs
->no_kept_objects
= 1;
2351 revs
->keep_pack_cache_flags
|= IN_CORE_KEEP_PACKS
;
2352 revs
->keep_pack_cache_flags
|= ON_DISK_KEEP_PACKS
;
2353 } else if (skip_prefix(arg
, "--no-kept-objects=", &optarg
)) {
2354 revs
->no_kept_objects
= 1;
2355 if (!strcmp(optarg
, "in-core"))
2356 revs
->keep_pack_cache_flags
|= IN_CORE_KEEP_PACKS
;
2357 if (!strcmp(optarg
, "on-disk"))
2358 revs
->keep_pack_cache_flags
|= ON_DISK_KEEP_PACKS
;
2359 } else if (!strcmp(arg
, "-r")) {
2361 revs
->diffopt
.flags
.recursive
= 1;
2362 } else if (!strcmp(arg
, "-t")) {
2364 revs
->diffopt
.flags
.recursive
= 1;
2365 revs
->diffopt
.flags
.tree_in_recursive
= 1;
2366 } else if ((argcount
= diff_merges_parse_opts(revs
, argv
))) {
2368 } else if (!strcmp(arg
, "-v")) {
2369 revs
->verbose_header
= 1;
2370 } else if (!strcmp(arg
, "--pretty")) {
2371 revs
->verbose_header
= 1;
2372 revs
->pretty_given
= 1;
2373 get_commit_format(NULL
, revs
);
2374 } else if (skip_prefix(arg
, "--pretty=", &optarg
) ||
2375 skip_prefix(arg
, "--format=", &optarg
)) {
2377 * Detached form ("--pretty X" as opposed to "--pretty=X")
2378 * not allowed, since the argument is optional.
2380 revs
->verbose_header
= 1;
2381 revs
->pretty_given
= 1;
2382 get_commit_format(optarg
, revs
);
2383 } else if (!strcmp(arg
, "--expand-tabs")) {
2384 revs
->expand_tabs_in_log
= 8;
2385 } else if (!strcmp(arg
, "--no-expand-tabs")) {
2386 revs
->expand_tabs_in_log
= 0;
2387 } else if (skip_prefix(arg
, "--expand-tabs=", &arg
)) {
2389 if (strtol_i(arg
, 10, &val
) < 0 || val
< 0)
2390 die("'%s': not a non-negative integer", arg
);
2391 revs
->expand_tabs_in_log
= val
;
2392 } else if (!strcmp(arg
, "--show-notes") || !strcmp(arg
, "--notes")) {
2393 enable_default_display_notes(&revs
->notes_opt
, &revs
->show_notes
);
2394 revs
->show_notes_given
= 1;
2395 } else if (!strcmp(arg
, "--show-signature")) {
2396 revs
->show_signature
= 1;
2397 } else if (!strcmp(arg
, "--no-show-signature")) {
2398 revs
->show_signature
= 0;
2399 } else if (!strcmp(arg
, "--show-linear-break")) {
2400 revs
->break_bar
= " ..........";
2401 revs
->track_linear
= 1;
2402 revs
->track_first_time
= 1;
2403 } else if (skip_prefix(arg
, "--show-linear-break=", &optarg
)) {
2404 revs
->break_bar
= xstrdup(optarg
);
2405 revs
->track_linear
= 1;
2406 revs
->track_first_time
= 1;
2407 } else if (skip_prefix(arg
, "--show-notes=", &optarg
) ||
2408 skip_prefix(arg
, "--notes=", &optarg
)) {
2409 if (starts_with(arg
, "--show-notes=") &&
2410 revs
->notes_opt
.use_default_notes
< 0)
2411 revs
->notes_opt
.use_default_notes
= 1;
2412 enable_ref_display_notes(&revs
->notes_opt
, &revs
->show_notes
, optarg
);
2413 revs
->show_notes_given
= 1;
2414 } else if (!strcmp(arg
, "--no-notes")) {
2415 disable_display_notes(&revs
->notes_opt
, &revs
->show_notes
);
2416 revs
->show_notes_given
= 1;
2417 } else if (!strcmp(arg
, "--standard-notes")) {
2418 revs
->show_notes_given
= 1;
2419 revs
->notes_opt
.use_default_notes
= 1;
2420 } else if (!strcmp(arg
, "--no-standard-notes")) {
2421 revs
->notes_opt
.use_default_notes
= 0;
2422 } else if (!strcmp(arg
, "--oneline")) {
2423 revs
->verbose_header
= 1;
2424 get_commit_format("oneline", revs
);
2425 revs
->pretty_given
= 1;
2426 revs
->abbrev_commit
= 1;
2427 } else if (!strcmp(arg
, "--graph")) {
2428 revs
->topo_order
= 1;
2429 revs
->rewrite_parents
= 1;
2430 revs
->graph
= graph_init(revs
);
2431 } else if (!strcmp(arg
, "--encode-email-headers")) {
2432 revs
->encode_email_headers
= 1;
2433 } else if (!strcmp(arg
, "--no-encode-email-headers")) {
2434 revs
->encode_email_headers
= 0;
2435 } else if (!strcmp(arg
, "--root")) {
2436 revs
->show_root_diff
= 1;
2437 } else if (!strcmp(arg
, "--no-commit-id")) {
2438 revs
->no_commit_id
= 1;
2439 } else if (!strcmp(arg
, "--always")) {
2440 revs
->always_show_header
= 1;
2441 } else if (!strcmp(arg
, "--no-abbrev")) {
2443 } else if (!strcmp(arg
, "--abbrev")) {
2444 revs
->abbrev
= DEFAULT_ABBREV
;
2445 } else if (skip_prefix(arg
, "--abbrev=", &optarg
)) {
2446 revs
->abbrev
= strtoul(optarg
, NULL
, 10);
2447 if (revs
->abbrev
< MINIMUM_ABBREV
)
2448 revs
->abbrev
= MINIMUM_ABBREV
;
2449 else if (revs
->abbrev
> hexsz
)
2450 revs
->abbrev
= hexsz
;
2451 } else if (!strcmp(arg
, "--abbrev-commit")) {
2452 revs
->abbrev_commit
= 1;
2453 revs
->abbrev_commit_given
= 1;
2454 } else if (!strcmp(arg
, "--no-abbrev-commit")) {
2455 revs
->abbrev_commit
= 0;
2456 } else if (!strcmp(arg
, "--full-diff")) {
2458 revs
->full_diff
= 1;
2459 } else if (!strcmp(arg
, "--show-pulls")) {
2460 revs
->show_pulls
= 1;
2461 } else if (!strcmp(arg
, "--full-history")) {
2462 revs
->simplify_history
= 0;
2463 } else if (!strcmp(arg
, "--relative-date")) {
2464 revs
->date_mode
.type
= DATE_RELATIVE
;
2465 revs
->date_mode_explicit
= 1;
2466 } else if ((argcount
= parse_long_opt("date", argv
, &optarg
))) {
2467 parse_date_format(optarg
, &revs
->date_mode
);
2468 revs
->date_mode_explicit
= 1;
2470 } else if (!strcmp(arg
, "--log-size")) {
2471 revs
->show_log_size
= 1;
2474 * Grepping the commit log
2476 else if ((argcount
= parse_long_opt("author", argv
, &optarg
))) {
2477 add_header_grep(revs
, GREP_HEADER_AUTHOR
, optarg
);
2479 } else if ((argcount
= parse_long_opt("committer", argv
, &optarg
))) {
2480 add_header_grep(revs
, GREP_HEADER_COMMITTER
, optarg
);
2482 } else if ((argcount
= parse_long_opt("grep-reflog", argv
, &optarg
))) {
2483 add_header_grep(revs
, GREP_HEADER_REFLOG
, optarg
);
2485 } else if ((argcount
= parse_long_opt("grep", argv
, &optarg
))) {
2486 add_message_grep(revs
, optarg
);
2488 } else if (!strcmp(arg
, "--basic-regexp")) {
2489 revs
->grep_filter
.pattern_type_option
= GREP_PATTERN_TYPE_BRE
;
2490 } else if (!strcmp(arg
, "--extended-regexp") || !strcmp(arg
, "-E")) {
2491 revs
->grep_filter
.pattern_type_option
= GREP_PATTERN_TYPE_ERE
;
2492 } else if (!strcmp(arg
, "--regexp-ignore-case") || !strcmp(arg
, "-i")) {
2493 revs
->grep_filter
.ignore_case
= 1;
2494 revs
->diffopt
.pickaxe_opts
|= DIFF_PICKAXE_IGNORE_CASE
;
2495 } else if (!strcmp(arg
, "--fixed-strings") || !strcmp(arg
, "-F")) {
2496 revs
->grep_filter
.pattern_type_option
= GREP_PATTERN_TYPE_FIXED
;
2497 } else if (!strcmp(arg
, "--perl-regexp") || !strcmp(arg
, "-P")) {
2498 revs
->grep_filter
.pattern_type_option
= GREP_PATTERN_TYPE_PCRE
;
2499 } else if (!strcmp(arg
, "--all-match")) {
2500 revs
->grep_filter
.all_match
= 1;
2501 } else if (!strcmp(arg
, "--invert-grep")) {
2502 revs
->invert_grep
= 1;
2503 } else if ((argcount
= parse_long_opt("encoding", argv
, &optarg
))) {
2504 if (strcmp(optarg
, "none"))
2505 git_log_output_encoding
= xstrdup(optarg
);
2507 git_log_output_encoding
= "";
2509 } else if (!strcmp(arg
, "--reverse")) {
2511 } else if (!strcmp(arg
, "--children")) {
2512 revs
->children
.name
= "children";
2514 } else if (!strcmp(arg
, "--ignore-missing")) {
2515 revs
->ignore_missing
= 1;
2516 } else if (opt
&& opt
->allow_exclude_promisor_objects
&&
2517 !strcmp(arg
, "--exclude-promisor-objects")) {
2518 if (fetch_if_missing
)
2519 BUG("exclude_promisor_objects can only be used when fetch_if_missing is 0");
2520 revs
->exclude_promisor_objects
= 1;
2522 int opts
= diff_opt_parse(&revs
->diffopt
, argv
, argc
, revs
->prefix
);
2524 unkv
[(*unkc
)++] = arg
;
2527 if (revs
->graph
&& revs
->track_linear
)
2528 die("--show-linear-break and --graph are incompatible");
2533 void parse_revision_opt(struct rev_info
*revs
, struct parse_opt_ctx_t
*ctx
,
2534 const struct option
*options
,
2535 const char * const usagestr
[])
2537 int n
= handle_revision_opt(revs
, ctx
->argc
, ctx
->argv
,
2538 &ctx
->cpidx
, ctx
->out
, NULL
);
2540 error("unknown option `%s'", ctx
->argv
[0]);
2541 usage_with_options(usagestr
, options
);
2547 static int for_each_bisect_ref(struct ref_store
*refs
, each_ref_fn fn
,
2548 void *cb_data
, const char *term
)
2550 struct strbuf bisect_refs
= STRBUF_INIT
;
2552 strbuf_addf(&bisect_refs
, "refs/bisect/%s", term
);
2553 status
= refs_for_each_fullref_in(refs
, bisect_refs
.buf
, fn
, cb_data
, 0);
2554 strbuf_release(&bisect_refs
);
2558 static int for_each_bad_bisect_ref(struct ref_store
*refs
, each_ref_fn fn
, void *cb_data
)
2560 return for_each_bisect_ref(refs
, fn
, cb_data
, term_bad
);
2563 static int for_each_good_bisect_ref(struct ref_store
*refs
, each_ref_fn fn
, void *cb_data
)
2565 return for_each_bisect_ref(refs
, fn
, cb_data
, term_good
);
2568 static int handle_revision_pseudo_opt(const char *submodule
,
2569 struct rev_info
*revs
,
2570 const char **argv
, int *flags
)
2572 const char *arg
= argv
[0];
2574 struct ref_store
*refs
;
2579 * We need some something like get_submodule_worktrees()
2580 * before we can go through all worktrees of a submodule,
2581 * .e.g with adding all HEADs from --all, which is not
2582 * supported right now, so stick to single worktree.
2584 if (!revs
->single_worktree
)
2585 BUG("--single-worktree cannot be used together with submodule");
2586 refs
= get_submodule_ref_store(submodule
);
2588 refs
= get_main_ref_store(revs
->repo
);
2593 * Commands like "git shortlog" will not accept the options below
2594 * unless parse_revision_opt queues them (as opposed to erroring
2597 * When implementing your new pseudo-option, remember to
2598 * register it in the list at the top of handle_revision_opt.
2600 if (!strcmp(arg
, "--all")) {
2601 handle_refs(refs
, revs
, *flags
, refs_for_each_ref
);
2602 handle_refs(refs
, revs
, *flags
, refs_head_ref
);
2603 if (!revs
->single_worktree
) {
2604 struct all_refs_cb cb
;
2606 init_all_refs_cb(&cb
, revs
, *flags
);
2607 other_head_refs(handle_one_ref
, &cb
);
2609 clear_ref_exclusion(&revs
->ref_excludes
);
2610 } else if (!strcmp(arg
, "--branches")) {
2611 handle_refs(refs
, revs
, *flags
, refs_for_each_branch_ref
);
2612 clear_ref_exclusion(&revs
->ref_excludes
);
2613 } else if (!strcmp(arg
, "--bisect")) {
2614 read_bisect_terms(&term_bad
, &term_good
);
2615 handle_refs(refs
, revs
, *flags
, for_each_bad_bisect_ref
);
2616 handle_refs(refs
, revs
, *flags
^ (UNINTERESTING
| BOTTOM
),
2617 for_each_good_bisect_ref
);
2619 } else if (!strcmp(arg
, "--tags")) {
2620 handle_refs(refs
, revs
, *flags
, refs_for_each_tag_ref
);
2621 clear_ref_exclusion(&revs
->ref_excludes
);
2622 } else if (!strcmp(arg
, "--remotes")) {
2623 handle_refs(refs
, revs
, *flags
, refs_for_each_remote_ref
);
2624 clear_ref_exclusion(&revs
->ref_excludes
);
2625 } else if ((argcount
= parse_long_opt("glob", argv
, &optarg
))) {
2626 struct all_refs_cb cb
;
2627 init_all_refs_cb(&cb
, revs
, *flags
);
2628 for_each_glob_ref(handle_one_ref
, optarg
, &cb
);
2629 clear_ref_exclusion(&revs
->ref_excludes
);
2631 } else if ((argcount
= parse_long_opt("exclude", argv
, &optarg
))) {
2632 add_ref_exclusion(&revs
->ref_excludes
, optarg
);
2634 } else if (skip_prefix(arg
, "--branches=", &optarg
)) {
2635 struct all_refs_cb cb
;
2636 init_all_refs_cb(&cb
, revs
, *flags
);
2637 for_each_glob_ref_in(handle_one_ref
, optarg
, "refs/heads/", &cb
);
2638 clear_ref_exclusion(&revs
->ref_excludes
);
2639 } else if (skip_prefix(arg
, "--tags=", &optarg
)) {
2640 struct all_refs_cb cb
;
2641 init_all_refs_cb(&cb
, revs
, *flags
);
2642 for_each_glob_ref_in(handle_one_ref
, optarg
, "refs/tags/", &cb
);
2643 clear_ref_exclusion(&revs
->ref_excludes
);
2644 } else if (skip_prefix(arg
, "--remotes=", &optarg
)) {
2645 struct all_refs_cb cb
;
2646 init_all_refs_cb(&cb
, revs
, *flags
);
2647 for_each_glob_ref_in(handle_one_ref
, optarg
, "refs/remotes/", &cb
);
2648 clear_ref_exclusion(&revs
->ref_excludes
);
2649 } else if (!strcmp(arg
, "--reflog")) {
2650 add_reflogs_to_pending(revs
, *flags
);
2651 } else if (!strcmp(arg
, "--indexed-objects")) {
2652 add_index_objects_to_pending(revs
, *flags
);
2653 } else if (!strcmp(arg
, "--alternate-refs")) {
2654 add_alternate_refs_to_pending(revs
, *flags
);
2655 } else if (!strcmp(arg
, "--not")) {
2656 *flags
^= UNINTERESTING
| BOTTOM
;
2657 } else if (!strcmp(arg
, "--no-walk")) {
2658 if (!revs
->no_walk
&& revs
->unsorted_input
)
2659 die(_("--no-walk is incompatible with --unsorted-input"));
2661 } else if (skip_prefix(arg
, "--no-walk=", &optarg
)) {
2662 if (!revs
->no_walk
&& revs
->unsorted_input
)
2663 die(_("--no-walk is incompatible with --unsorted-input"));
2666 * Detached form ("--no-walk X" as opposed to "--no-walk=X")
2667 * not allowed, since the argument is optional.
2670 if (!strcmp(optarg
, "sorted"))
2671 revs
->unsorted_input
= 0;
2672 else if (!strcmp(optarg
, "unsorted"))
2673 revs
->unsorted_input
= 1;
2675 return error("invalid argument to --no-walk");
2676 } else if (!strcmp(arg
, "--do-walk")) {
2678 } else if (!strcmp(arg
, "--single-worktree")) {
2679 revs
->single_worktree
= 1;
2687 static void NORETURN
diagnose_missing_default(const char *def
)
2690 const char *refname
;
2692 refname
= resolve_ref_unsafe(def
, 0, NULL
, &flags
);
2693 if (!refname
|| !(flags
& REF_ISSYMREF
) || (flags
& REF_ISBROKEN
))
2694 die(_("your current branch appears to be broken"));
2696 skip_prefix(refname
, "refs/heads/", &refname
);
2697 die(_("your current branch '%s' does not have any commits yet"),
2702 * Parse revision information, filling in the "rev_info" structure,
2703 * and removing the used arguments from the argument list.
2705 * Returns the number of arguments left that weren't recognized
2706 * (which are also moved to the head of the argument list)
2708 int setup_revisions(int argc
, const char **argv
, struct rev_info
*revs
, struct setup_revision_opt
*opt
)
2710 int i
, flags
, left
, seen_dashdash
, revarg_opt
;
2711 struct strvec prune_data
= STRVEC_INIT
;
2712 const char *submodule
= NULL
;
2713 int seen_end_of_options
= 0;
2716 submodule
= opt
->submodule
;
2718 /* First, search for "--" */
2719 if (opt
&& opt
->assume_dashdash
) {
2723 for (i
= 1; i
< argc
; i
++) {
2724 const char *arg
= argv
[i
];
2725 if (strcmp(arg
, "--"))
2730 strvec_pushv(&prune_data
, argv
+ i
+ 1);
2736 /* Second, deal with arguments and options */
2738 revarg_opt
= opt
? opt
->revarg_opt
: 0;
2740 revarg_opt
|= REVARG_CANNOT_BE_FILENAME
;
2741 for (left
= i
= 1; i
< argc
; i
++) {
2742 const char *arg
= argv
[i
];
2743 if (!seen_end_of_options
&& *arg
== '-') {
2746 opts
= handle_revision_pseudo_opt(submodule
,
2754 if (!strcmp(arg
, "--stdin")) {
2755 if (revs
->disable_stdin
) {
2759 if (revs
->read_from_stdin
++)
2760 die("--stdin given twice?");
2761 read_revisions_from_stdin(revs
, &prune_data
);
2765 if (!strcmp(arg
, "--end-of-options")) {
2766 seen_end_of_options
= 1;
2770 opts
= handle_revision_opt(revs
, argc
- i
, argv
+ i
,
2782 if (handle_revision_arg(arg
, revs
, flags
, revarg_opt
)) {
2784 if (seen_dashdash
|| *arg
== '^')
2785 die("bad revision '%s'", arg
);
2787 /* If we didn't have a "--":
2788 * (1) all filenames must exist;
2789 * (2) all rev-args must not be interpretable
2790 * as a valid filename.
2791 * but the latter we have checked in the main loop.
2793 for (j
= i
; j
< argc
; j
++)
2794 verify_filename(revs
->prefix
, argv
[j
], j
== i
);
2796 strvec_pushv(&prune_data
, argv
+ i
);
2801 if (prune_data
.nr
) {
2803 * If we need to introduce the magic "a lone ':' means no
2804 * pathspec whatsoever", here is the place to do so.
2806 * if (prune_data.nr == 1 && !strcmp(prune_data[0], ":")) {
2807 * prune_data.nr = 0;
2808 * prune_data.alloc = 0;
2809 * free(prune_data.path);
2810 * prune_data.path = NULL;
2812 * terminate prune_data.alloc with NULL and
2813 * call init_pathspec() to set revs->prune_data here.
2816 parse_pathspec(&revs
->prune_data
, 0, 0,
2817 revs
->prefix
, prune_data
.v
);
2819 strvec_clear(&prune_data
);
2821 if (revs
->def
== NULL
)
2822 revs
->def
= opt
? opt
->def
: NULL
;
2823 if (opt
&& opt
->tweak
)
2824 opt
->tweak(revs
, opt
);
2825 if (revs
->show_merge
)
2826 prepare_show_merge(revs
);
2827 if (revs
->def
&& !revs
->pending
.nr
&& !revs
->rev_input_given
) {
2828 struct object_id oid
;
2829 struct object
*object
;
2830 struct object_context oc
;
2831 if (get_oid_with_context(revs
->repo
, revs
->def
, 0, &oid
, &oc
))
2832 diagnose_missing_default(revs
->def
);
2833 object
= get_reference(revs
, revs
->def
, &oid
, 0);
2834 add_pending_object_with_mode(revs
, object
, revs
->def
, oc
.mode
);
2837 /* Did the user ask for any diff output? Run the diff! */
2838 if (revs
->diffopt
.output_format
& ~DIFF_FORMAT_NO_OUTPUT
)
2841 /* Pickaxe, diff-filter and rename following need diffs */
2842 if ((revs
->diffopt
.pickaxe_opts
& DIFF_PICKAXE_KINDS_MASK
) ||
2843 revs
->diffopt
.filter
||
2844 revs
->diffopt
.flags
.follow_renames
)
2847 if (revs
->diffopt
.objfind
)
2848 revs
->simplify_history
= 0;
2850 if (revs
->line_level_traverse
) {
2851 if (want_ancestry(revs
))
2853 revs
->topo_order
= 1;
2856 if (revs
->topo_order
&& !generation_numbers_enabled(the_repository
))
2859 if (revs
->prune_data
.nr
) {
2860 copy_pathspec(&revs
->pruning
.pathspec
, &revs
->prune_data
);
2861 /* Can't prune commits with rename following: the paths change.. */
2862 if (!revs
->diffopt
.flags
.follow_renames
)
2864 if (!revs
->full_diff
)
2865 copy_pathspec(&revs
->diffopt
.pathspec
,
2869 diff_merges_setup_revs(revs
);
2871 revs
->diffopt
.abbrev
= revs
->abbrev
;
2873 diff_setup_done(&revs
->diffopt
);
2875 grep_commit_pattern_type(GREP_PATTERN_TYPE_UNSPECIFIED
,
2876 &revs
->grep_filter
);
2877 if (!is_encoding_utf8(get_log_output_encoding()))
2878 revs
->grep_filter
.ignore_locale
= 1;
2879 compile_grep_patterns(&revs
->grep_filter
);
2881 if (revs
->reverse
&& revs
->reflog_info
)
2882 die("cannot combine --reverse with --walk-reflogs");
2883 if (revs
->reflog_info
&& revs
->limited
)
2884 die("cannot combine --walk-reflogs with history-limiting options");
2885 if (revs
->rewrite_parents
&& revs
->children
.name
)
2886 die("cannot combine --parents and --children");
2889 * Limitations on the graph functionality
2891 if (revs
->reverse
&& revs
->graph
)
2892 die("cannot combine --reverse with --graph");
2894 if (revs
->reflog_info
&& revs
->graph
)
2895 die("cannot combine --walk-reflogs with --graph");
2896 if (revs
->no_walk
&& revs
->graph
)
2897 die("cannot combine --no-walk with --graph");
2898 if (!revs
->reflog_info
&& revs
->grep_filter
.use_reflog_filter
)
2899 die("cannot use --grep-reflog without --walk-reflogs");
2901 if (revs
->line_level_traverse
&&
2902 (revs
->diffopt
.output_format
& ~(DIFF_FORMAT_PATCH
| DIFF_FORMAT_NO_OUTPUT
)))
2903 die(_("-L does not yet support diff formats besides -p and -s"));
2905 if (revs
->expand_tabs_in_log
< 0)
2906 revs
->expand_tabs_in_log
= revs
->expand_tabs_in_log_default
;
2911 static void add_child(struct rev_info
*revs
, struct commit
*parent
, struct commit
*child
)
2913 struct commit_list
*l
= xcalloc(1, sizeof(*l
));
2916 l
->next
= add_decoration(&revs
->children
, &parent
->object
, l
);
2919 static int remove_duplicate_parents(struct rev_info
*revs
, struct commit
*commit
)
2921 struct treesame_state
*ts
= lookup_decoration(&revs
->treesame
, &commit
->object
);
2922 struct commit_list
**pp
, *p
;
2923 int surviving_parents
;
2925 /* Examine existing parents while marking ones we have seen... */
2926 pp
= &commit
->parents
;
2927 surviving_parents
= 0;
2928 while ((p
= *pp
) != NULL
) {
2929 struct commit
*parent
= p
->item
;
2930 if (parent
->object
.flags
& TMP_MARK
) {
2933 compact_treesame(revs
, commit
, surviving_parents
);
2936 parent
->object
.flags
|= TMP_MARK
;
2937 surviving_parents
++;
2940 /* clear the temporary mark */
2941 for (p
= commit
->parents
; p
; p
= p
->next
) {
2942 p
->item
->object
.flags
&= ~TMP_MARK
;
2944 /* no update_treesame() - removing duplicates can't affect TREESAME */
2945 return surviving_parents
;
2948 struct merge_simplify_state
{
2949 struct commit
*simplified
;
2952 static struct merge_simplify_state
*locate_simplify_state(struct rev_info
*revs
, struct commit
*commit
)
2954 struct merge_simplify_state
*st
;
2956 st
= lookup_decoration(&revs
->merge_simplification
, &commit
->object
);
2958 CALLOC_ARRAY(st
, 1);
2959 add_decoration(&revs
->merge_simplification
, &commit
->object
, st
);
2964 static int mark_redundant_parents(struct commit
*commit
)
2966 struct commit_list
*h
= reduce_heads(commit
->parents
);
2967 int i
= 0, marked
= 0;
2968 struct commit_list
*po
, *pn
;
2970 /* Want these for sanity-checking only */
2971 int orig_cnt
= commit_list_count(commit
->parents
);
2972 int cnt
= commit_list_count(h
);
2975 * Not ready to remove items yet, just mark them for now, based
2976 * on the output of reduce_heads(). reduce_heads outputs the reduced
2977 * set in its original order, so this isn't too hard.
2979 po
= commit
->parents
;
2982 if (pn
&& po
->item
== pn
->item
) {
2986 po
->item
->object
.flags
|= TMP_MARK
;
2992 if (i
!= cnt
|| cnt
+marked
!= orig_cnt
)
2993 die("mark_redundant_parents %d %d %d %d", orig_cnt
, cnt
, i
, marked
);
2995 free_commit_list(h
);
3000 static int mark_treesame_root_parents(struct commit
*commit
)
3002 struct commit_list
*p
;
3005 for (p
= commit
->parents
; p
; p
= p
->next
) {
3006 struct commit
*parent
= p
->item
;
3007 if (!parent
->parents
&& (parent
->object
.flags
& TREESAME
)) {
3008 parent
->object
.flags
|= TMP_MARK
;
3017 * Awkward naming - this means one parent we are TREESAME to.
3018 * cf mark_treesame_root_parents: root parents that are TREESAME (to an
3019 * empty tree). Better name suggestions?
3021 static int leave_one_treesame_to_parent(struct rev_info
*revs
, struct commit
*commit
)
3023 struct treesame_state
*ts
= lookup_decoration(&revs
->treesame
, &commit
->object
);
3024 struct commit
*unmarked
= NULL
, *marked
= NULL
;
3025 struct commit_list
*p
;
3028 for (p
= commit
->parents
, n
= 0; p
; p
= p
->next
, n
++) {
3029 if (ts
->treesame
[n
]) {
3030 if (p
->item
->object
.flags
& TMP_MARK
) {
3043 * If we are TREESAME to a marked-for-deletion parent, but not to any
3044 * unmarked parents, unmark the first TREESAME parent. This is the
3045 * parent that the default simplify_history==1 scan would have followed,
3046 * and it doesn't make sense to omit that path when asking for a
3047 * simplified full history. Retaining it improves the chances of
3048 * understanding odd missed merges that took an old version of a file.
3052 * I--------*X A modified the file, but mainline merge X used
3053 * \ / "-s ours", so took the version from I. X is
3054 * `-*A--' TREESAME to I and !TREESAME to A.
3056 * Default log from X would produce "I". Without this check,
3057 * --full-history --simplify-merges would produce "I-A-X", showing
3058 * the merge commit X and that it changed A, but not making clear that
3059 * it had just taken the I version. With this check, the topology above
3062 * Note that it is possible that the simplification chooses a different
3063 * TREESAME parent from the default, in which case this test doesn't
3064 * activate, and we _do_ drop the default parent. Example:
3066 * I------X A modified the file, but it was reverted in B,
3067 * \ / meaning mainline merge X is TREESAME to both
3070 * Default log would produce "I" by following the first parent;
3071 * --full-history --simplify-merges will produce "I-A-B". But this is a
3072 * reasonable result - it presents a logical full history leading from
3073 * I to X, and X is not an important merge.
3075 if (!unmarked
&& marked
) {
3076 marked
->object
.flags
&= ~TMP_MARK
;
3083 static int remove_marked_parents(struct rev_info
*revs
, struct commit
*commit
)
3085 struct commit_list
**pp
, *p
;
3086 int nth_parent
, removed
= 0;
3088 pp
= &commit
->parents
;
3090 while ((p
= *pp
) != NULL
) {
3091 struct commit
*parent
= p
->item
;
3092 if (parent
->object
.flags
& TMP_MARK
) {
3093 parent
->object
.flags
&= ~TMP_MARK
;
3097 compact_treesame(revs
, commit
, nth_parent
);
3104 /* Removing parents can only increase TREESAMEness */
3105 if (removed
&& !(commit
->object
.flags
& TREESAME
))
3106 update_treesame(revs
, commit
);
3111 static struct commit_list
**simplify_one(struct rev_info
*revs
, struct commit
*commit
, struct commit_list
**tail
)
3113 struct commit_list
*p
;
3114 struct commit
*parent
;
3115 struct merge_simplify_state
*st
, *pst
;
3118 st
= locate_simplify_state(revs
, commit
);
3121 * Have we handled this one?
3127 * An UNINTERESTING commit simplifies to itself, so does a
3128 * root commit. We do not rewrite parents of such commit
3131 if ((commit
->object
.flags
& UNINTERESTING
) || !commit
->parents
) {
3132 st
->simplified
= commit
;
3137 * Do we know what commit all of our parents that matter
3138 * should be rewritten to? Otherwise we are not ready to
3139 * rewrite this one yet.
3141 for (cnt
= 0, p
= commit
->parents
; p
; p
= p
->next
) {
3142 pst
= locate_simplify_state(revs
, p
->item
);
3143 if (!pst
->simplified
) {
3144 tail
= &commit_list_insert(p
->item
, tail
)->next
;
3147 if (revs
->first_parent_only
)
3151 tail
= &commit_list_insert(commit
, tail
)->next
;
3156 * Rewrite our list of parents. Note that this cannot
3157 * affect our TREESAME flags in any way - a commit is
3158 * always TREESAME to its simplification.
3160 for (p
= commit
->parents
; p
; p
= p
->next
) {
3161 pst
= locate_simplify_state(revs
, p
->item
);
3162 p
->item
= pst
->simplified
;
3163 if (revs
->first_parent_only
)
3167 if (revs
->first_parent_only
)
3170 cnt
= remove_duplicate_parents(revs
, commit
);
3173 * It is possible that we are a merge and one side branch
3174 * does not have any commit that touches the given paths;
3175 * in such a case, the immediate parent from that branch
3176 * will be rewritten to be the merge base.
3178 * o----X X: the commit we are looking at;
3179 * / / o: a commit that touches the paths;
3182 * Further, a merge of an independent branch that doesn't
3183 * touch the path will reduce to a treesame root parent:
3185 * ----o----X X: the commit we are looking at;
3186 * / o: a commit that touches the paths;
3187 * r r: a root commit not touching the paths
3189 * Detect and simplify both cases.
3192 int marked
= mark_redundant_parents(commit
);
3193 marked
+= mark_treesame_root_parents(commit
);
3195 marked
-= leave_one_treesame_to_parent(revs
, commit
);
3197 cnt
= remove_marked_parents(revs
, commit
);
3201 * A commit simplifies to itself if it is a root, if it is
3202 * UNINTERESTING, if it touches the given paths, or if it is a
3203 * merge and its parents don't simplify to one relevant commit
3204 * (the first two cases are already handled at the beginning of
3207 * Otherwise, it simplifies to what its sole relevant parent
3211 (commit
->object
.flags
& UNINTERESTING
) ||
3212 !(commit
->object
.flags
& TREESAME
) ||
3213 (parent
= one_relevant_parent(revs
, commit
->parents
)) == NULL
||
3214 (revs
->show_pulls
&& (commit
->object
.flags
& PULL_MERGE
)))
3215 st
->simplified
= commit
;
3217 pst
= locate_simplify_state(revs
, parent
);
3218 st
->simplified
= pst
->simplified
;
3223 static void simplify_merges(struct rev_info
*revs
)
3225 struct commit_list
*list
, *next
;
3226 struct commit_list
*yet_to_do
, **tail
;
3227 struct commit
*commit
;
3232 /* feed the list reversed */
3234 for (list
= revs
->commits
; list
; list
= next
) {
3235 commit
= list
->item
;
3238 * Do not free(list) here yet; the original list
3239 * is used later in this function.
3241 commit_list_insert(commit
, &yet_to_do
);
3248 commit
= pop_commit(&list
);
3249 tail
= simplify_one(revs
, commit
, tail
);
3253 /* clean up the result, removing the simplified ones */
3254 list
= revs
->commits
;
3255 revs
->commits
= NULL
;
3256 tail
= &revs
->commits
;
3258 struct merge_simplify_state
*st
;
3260 commit
= pop_commit(&list
);
3261 st
= locate_simplify_state(revs
, commit
);
3262 if (st
->simplified
== commit
)
3263 tail
= &commit_list_insert(commit
, tail
)->next
;
3267 static void set_children(struct rev_info
*revs
)
3269 struct commit_list
*l
;
3270 for (l
= revs
->commits
; l
; l
= l
->next
) {
3271 struct commit
*commit
= l
->item
;
3272 struct commit_list
*p
;
3274 for (p
= commit
->parents
; p
; p
= p
->next
)
3275 add_child(revs
, p
->item
, commit
);
3279 void reset_revision_walk(void)
3281 clear_object_flags(SEEN
| ADDED
| SHOWN
| TOPO_WALK_EXPLORED
| TOPO_WALK_INDEGREE
);
3284 static int mark_uninteresting(const struct object_id
*oid
,
3285 struct packed_git
*pack
,
3289 struct rev_info
*revs
= cb
;
3290 struct object
*o
= lookup_unknown_object(revs
->repo
, oid
);
3291 o
->flags
|= UNINTERESTING
| SEEN
;
3295 define_commit_slab(indegree_slab
, int);
3296 define_commit_slab(author_date_slab
, timestamp_t
);
3298 struct topo_walk_info
{
3299 timestamp_t min_generation
;
3300 struct prio_queue explore_queue
;
3301 struct prio_queue indegree_queue
;
3302 struct prio_queue topo_queue
;
3303 struct indegree_slab indegree
;
3304 struct author_date_slab author_date
;
3307 static int topo_walk_atexit_registered
;
3308 static unsigned int count_explore_walked
;
3309 static unsigned int count_indegree_walked
;
3310 static unsigned int count_topo_walked
;
3312 static void trace2_topo_walk_statistics_atexit(void)
3314 struct json_writer jw
= JSON_WRITER_INIT
;
3316 jw_object_begin(&jw
, 0);
3317 jw_object_intmax(&jw
, "count_explore_walked", count_explore_walked
);
3318 jw_object_intmax(&jw
, "count_indegree_walked", count_indegree_walked
);
3319 jw_object_intmax(&jw
, "count_topo_walked", count_topo_walked
);
3322 trace2_data_json("topo_walk", the_repository
, "statistics", &jw
);
3327 static inline void test_flag_and_insert(struct prio_queue
*q
, struct commit
*c
, int flag
)
3329 if (c
->object
.flags
& flag
)
3332 c
->object
.flags
|= flag
;
3333 prio_queue_put(q
, c
);
3336 static void explore_walk_step(struct rev_info
*revs
)
3338 struct topo_walk_info
*info
= revs
->topo_walk_info
;
3339 struct commit_list
*p
;
3340 struct commit
*c
= prio_queue_get(&info
->explore_queue
);
3345 if (repo_parse_commit_gently(revs
->repo
, c
, 1) < 0)
3348 count_explore_walked
++;
3350 if (revs
->sort_order
== REV_SORT_BY_AUTHOR_DATE
)
3351 record_author_date(&info
->author_date
, c
);
3353 if (revs
->max_age
!= -1 && (c
->date
< revs
->max_age
))
3354 c
->object
.flags
|= UNINTERESTING
;
3356 if (process_parents(revs
, c
, NULL
, NULL
) < 0)
3359 if (c
->object
.flags
& UNINTERESTING
)
3360 mark_parents_uninteresting(c
);
3362 for (p
= c
->parents
; p
; p
= p
->next
)
3363 test_flag_and_insert(&info
->explore_queue
, p
->item
, TOPO_WALK_EXPLORED
);
3366 static void explore_to_depth(struct rev_info
*revs
,
3367 timestamp_t gen_cutoff
)
3369 struct topo_walk_info
*info
= revs
->topo_walk_info
;
3371 while ((c
= prio_queue_peek(&info
->explore_queue
)) &&
3372 commit_graph_generation(c
) >= gen_cutoff
)
3373 explore_walk_step(revs
);
3376 static void indegree_walk_step(struct rev_info
*revs
)
3378 struct commit_list
*p
;
3379 struct topo_walk_info
*info
= revs
->topo_walk_info
;
3380 struct commit
*c
= prio_queue_get(&info
->indegree_queue
);
3385 if (repo_parse_commit_gently(revs
->repo
, c
, 1) < 0)
3388 count_indegree_walked
++;
3390 explore_to_depth(revs
, commit_graph_generation(c
));
3392 for (p
= c
->parents
; p
; p
= p
->next
) {
3393 struct commit
*parent
= p
->item
;
3394 int *pi
= indegree_slab_at(&info
->indegree
, parent
);
3396 if (repo_parse_commit_gently(revs
->repo
, parent
, 1) < 0)
3404 test_flag_and_insert(&info
->indegree_queue
, parent
, TOPO_WALK_INDEGREE
);
3406 if (revs
->first_parent_only
)
3411 static void compute_indegrees_to_depth(struct rev_info
*revs
,
3412 timestamp_t gen_cutoff
)
3414 struct topo_walk_info
*info
= revs
->topo_walk_info
;
3416 while ((c
= prio_queue_peek(&info
->indegree_queue
)) &&
3417 commit_graph_generation(c
) >= gen_cutoff
)
3418 indegree_walk_step(revs
);
3421 static void reset_topo_walk(struct rev_info
*revs
)
3423 struct topo_walk_info
*info
= revs
->topo_walk_info
;
3425 clear_prio_queue(&info
->explore_queue
);
3426 clear_prio_queue(&info
->indegree_queue
);
3427 clear_prio_queue(&info
->topo_queue
);
3428 clear_indegree_slab(&info
->indegree
);
3429 clear_author_date_slab(&info
->author_date
);
3431 FREE_AND_NULL(revs
->topo_walk_info
);
3434 static void init_topo_walk(struct rev_info
*revs
)
3436 struct topo_walk_info
*info
;
3437 struct commit_list
*list
;
3438 if (revs
->topo_walk_info
)
3439 reset_topo_walk(revs
);
3441 revs
->topo_walk_info
= xmalloc(sizeof(struct topo_walk_info
));
3442 info
= revs
->topo_walk_info
;
3443 memset(info
, 0, sizeof(struct topo_walk_info
));
3445 init_indegree_slab(&info
->indegree
);
3446 memset(&info
->explore_queue
, 0, sizeof(info
->explore_queue
));
3447 memset(&info
->indegree_queue
, 0, sizeof(info
->indegree_queue
));
3448 memset(&info
->topo_queue
, 0, sizeof(info
->topo_queue
));
3450 switch (revs
->sort_order
) {
3451 default: /* REV_SORT_IN_GRAPH_ORDER */
3452 info
->topo_queue
.compare
= NULL
;
3454 case REV_SORT_BY_COMMIT_DATE
:
3455 info
->topo_queue
.compare
= compare_commits_by_commit_date
;
3457 case REV_SORT_BY_AUTHOR_DATE
:
3458 init_author_date_slab(&info
->author_date
);
3459 info
->topo_queue
.compare
= compare_commits_by_author_date
;
3460 info
->topo_queue
.cb_data
= &info
->author_date
;
3464 info
->explore_queue
.compare
= compare_commits_by_gen_then_commit_date
;
3465 info
->indegree_queue
.compare
= compare_commits_by_gen_then_commit_date
;
3467 info
->min_generation
= GENERATION_NUMBER_INFINITY
;
3468 for (list
= revs
->commits
; list
; list
= list
->next
) {
3469 struct commit
*c
= list
->item
;
3470 timestamp_t generation
;
3472 if (repo_parse_commit_gently(revs
->repo
, c
, 1))
3475 test_flag_and_insert(&info
->explore_queue
, c
, TOPO_WALK_EXPLORED
);
3476 test_flag_and_insert(&info
->indegree_queue
, c
, TOPO_WALK_INDEGREE
);
3478 generation
= commit_graph_generation(c
);
3479 if (generation
< info
->min_generation
)
3480 info
->min_generation
= generation
;
3482 *(indegree_slab_at(&info
->indegree
, c
)) = 1;
3484 if (revs
->sort_order
== REV_SORT_BY_AUTHOR_DATE
)
3485 record_author_date(&info
->author_date
, c
);
3487 compute_indegrees_to_depth(revs
, info
->min_generation
);
3489 for (list
= revs
->commits
; list
; list
= list
->next
) {
3490 struct commit
*c
= list
->item
;
3492 if (*(indegree_slab_at(&info
->indegree
, c
)) == 1)
3493 prio_queue_put(&info
->topo_queue
, c
);
3497 * This is unfortunate; the initial tips need to be shown
3498 * in the order given from the revision traversal machinery.
3500 if (revs
->sort_order
== REV_SORT_IN_GRAPH_ORDER
)
3501 prio_queue_reverse(&info
->topo_queue
);
3503 if (trace2_is_enabled() && !topo_walk_atexit_registered
) {
3504 atexit(trace2_topo_walk_statistics_atexit
);
3505 topo_walk_atexit_registered
= 1;
3509 static struct commit
*next_topo_commit(struct rev_info
*revs
)
3512 struct topo_walk_info
*info
= revs
->topo_walk_info
;
3514 /* pop next off of topo_queue */
3515 c
= prio_queue_get(&info
->topo_queue
);
3518 *(indegree_slab_at(&info
->indegree
, c
)) = 0;
3523 static void expand_topo_walk(struct rev_info
*revs
, struct commit
*commit
)
3525 struct commit_list
*p
;
3526 struct topo_walk_info
*info
= revs
->topo_walk_info
;
3527 if (process_parents(revs
, commit
, NULL
, NULL
) < 0) {
3528 if (!revs
->ignore_missing_links
)
3529 die("Failed to traverse parents of commit %s",
3530 oid_to_hex(&commit
->object
.oid
));
3533 count_topo_walked
++;
3535 for (p
= commit
->parents
; p
; p
= p
->next
) {
3536 struct commit
*parent
= p
->item
;
3538 timestamp_t generation
;
3540 if (parent
->object
.flags
& UNINTERESTING
)
3543 if (repo_parse_commit_gently(revs
->repo
, parent
, 1) < 0)
3546 generation
= commit_graph_generation(parent
);
3547 if (generation
< info
->min_generation
) {
3548 info
->min_generation
= generation
;
3549 compute_indegrees_to_depth(revs
, info
->min_generation
);
3552 pi
= indegree_slab_at(&info
->indegree
, parent
);
3556 prio_queue_put(&info
->topo_queue
, parent
);
3558 if (revs
->first_parent_only
)
3563 int prepare_revision_walk(struct rev_info
*revs
)
3566 struct object_array old_pending
;
3567 struct commit_list
**next
= &revs
->commits
;
3569 memcpy(&old_pending
, &revs
->pending
, sizeof(old_pending
));
3570 revs
->pending
.nr
= 0;
3571 revs
->pending
.alloc
= 0;
3572 revs
->pending
.objects
= NULL
;
3573 for (i
= 0; i
< old_pending
.nr
; i
++) {
3574 struct object_array_entry
*e
= old_pending
.objects
+ i
;
3575 struct commit
*commit
= handle_commit(revs
, e
);
3577 if (!(commit
->object
.flags
& SEEN
)) {
3578 commit
->object
.flags
|= SEEN
;
3579 next
= commit_list_append(commit
, next
);
3583 object_array_clear(&old_pending
);
3585 /* Signal whether we need per-parent treesame decoration */
3586 if (revs
->simplify_merges
||
3587 (revs
->limited
&& limiting_can_increase_treesame(revs
)))
3588 revs
->treesame
.name
= "treesame";
3590 if (revs
->exclude_promisor_objects
) {
3591 for_each_packed_object(mark_uninteresting
, revs
,
3592 FOR_EACH_OBJECT_PROMISOR_ONLY
);
3595 if (!revs
->reflog_info
)
3596 prepare_to_use_bloom_filter(revs
);
3597 if (!revs
->unsorted_input
)
3598 commit_list_sort_by_date(&revs
->commits
);
3601 if (revs
->limited
) {
3602 if (limit_list(revs
) < 0)
3604 if (revs
->topo_order
)
3605 sort_in_topological_order(&revs
->commits
, revs
->sort_order
);
3606 } else if (revs
->topo_order
)
3607 init_topo_walk(revs
);
3608 if (revs
->line_level_traverse
&& want_ancestry(revs
))
3610 * At the moment we can only do line-level log with parent
3611 * rewriting by performing this expensive pre-filtering step.
3612 * If parent rewriting is not requested, then we rather
3613 * perform the line-level log filtering during the regular
3614 * history traversal.
3616 line_log_filter(revs
);
3617 if (revs
->simplify_merges
)
3618 simplify_merges(revs
);
3619 if (revs
->children
.name
)
3625 static enum rewrite_result
rewrite_one_1(struct rev_info
*revs
,
3627 struct prio_queue
*queue
)
3630 struct commit
*p
= *pp
;
3632 if (process_parents(revs
, p
, NULL
, queue
) < 0)
3633 return rewrite_one_error
;
3634 if (p
->object
.flags
& UNINTERESTING
)
3635 return rewrite_one_ok
;
3636 if (!(p
->object
.flags
& TREESAME
))
3637 return rewrite_one_ok
;
3639 return rewrite_one_noparents
;
3640 if ((p
= one_relevant_parent(revs
, p
->parents
)) == NULL
)
3641 return rewrite_one_ok
;
3646 static void merge_queue_into_list(struct prio_queue
*q
, struct commit_list
**list
)
3649 struct commit
*item
= prio_queue_peek(q
);
3650 struct commit_list
*p
= *list
;
3652 if (p
&& p
->item
->date
>= item
->date
)
3655 p
= commit_list_insert(item
, list
);
3656 list
= &p
->next
; /* skip newly added item */
3657 prio_queue_get(q
); /* pop item */
3662 static enum rewrite_result
rewrite_one(struct rev_info
*revs
, struct commit
**pp
)
3664 struct prio_queue queue
= { compare_commits_by_commit_date
};
3665 enum rewrite_result ret
= rewrite_one_1(revs
, pp
, &queue
);
3666 merge_queue_into_list(&queue
, &revs
->commits
);
3667 clear_prio_queue(&queue
);
3671 int rewrite_parents(struct rev_info
*revs
, struct commit
*commit
,
3672 rewrite_parent_fn_t rewrite_parent
)
3674 struct commit_list
**pp
= &commit
->parents
;
3676 struct commit_list
*parent
= *pp
;
3677 switch (rewrite_parent(revs
, &parent
->item
)) {
3678 case rewrite_one_ok
:
3680 case rewrite_one_noparents
:
3683 case rewrite_one_error
:
3688 remove_duplicate_parents(revs
, commit
);
3692 static int commit_rewrite_person(struct strbuf
*buf
, const char *what
, struct string_list
*mailmap
)
3694 char *person
, *endp
;
3695 size_t len
, namelen
, maillen
;
3698 struct ident_split ident
;
3700 person
= strstr(buf
->buf
, what
);
3704 person
+= strlen(what
);
3705 endp
= strchr(person
, '\n');
3709 len
= endp
- person
;
3711 if (split_ident_line(&ident
, person
, len
))
3714 mail
= ident
.mail_begin
;
3715 maillen
= ident
.mail_end
- ident
.mail_begin
;
3716 name
= ident
.name_begin
;
3717 namelen
= ident
.name_end
- ident
.name_begin
;
3719 if (map_user(mailmap
, &mail
, &maillen
, &name
, &namelen
)) {
3720 struct strbuf namemail
= STRBUF_INIT
;
3722 strbuf_addf(&namemail
, "%.*s <%.*s>",
3723 (int)namelen
, name
, (int)maillen
, mail
);
3725 strbuf_splice(buf
, ident
.name_begin
- buf
->buf
,
3726 ident
.mail_end
- ident
.name_begin
+ 1,
3727 namemail
.buf
, namemail
.len
);
3729 strbuf_release(&namemail
);
3737 static int commit_match(struct commit
*commit
, struct rev_info
*opt
)
3740 const char *encoding
;
3741 const char *message
;
3742 struct strbuf buf
= STRBUF_INIT
;
3744 if (!opt
->grep_filter
.pattern_list
&& !opt
->grep_filter
.header_list
)
3747 /* Prepend "fake" headers as needed */
3748 if (opt
->grep_filter
.use_reflog_filter
) {
3749 strbuf_addstr(&buf
, "reflog ");
3750 get_reflog_message(&buf
, opt
->reflog_info
);
3751 strbuf_addch(&buf
, '\n');
3755 * We grep in the user's output encoding, under the assumption that it
3756 * is the encoding they are most likely to write their grep pattern
3757 * for. In addition, it means we will match the "notes" encoding below,
3758 * so we will not end up with a buffer that has two different encodings
3761 encoding
= get_log_output_encoding();
3762 message
= logmsg_reencode(commit
, NULL
, encoding
);
3764 /* Copy the commit to temporary if we are using "fake" headers */
3766 strbuf_addstr(&buf
, message
);
3768 if (opt
->grep_filter
.header_list
&& opt
->mailmap
) {
3770 strbuf_addstr(&buf
, message
);
3772 commit_rewrite_person(&buf
, "\nauthor ", opt
->mailmap
);
3773 commit_rewrite_person(&buf
, "\ncommitter ", opt
->mailmap
);
3776 /* Append "fake" message parts as needed */
3777 if (opt
->show_notes
) {
3779 strbuf_addstr(&buf
, message
);
3780 format_display_notes(&commit
->object
.oid
, &buf
, encoding
, 1);
3784 * Find either in the original commit message, or in the temporary.
3785 * Note that we cast away the constness of "message" here. It is
3786 * const because it may come from the cached commit buffer. That's OK,
3787 * because we know that it is modifiable heap memory, and that while
3788 * grep_buffer may modify it for speed, it will restore any
3789 * changes before returning.
3792 retval
= grep_buffer(&opt
->grep_filter
, buf
.buf
, buf
.len
);
3794 retval
= grep_buffer(&opt
->grep_filter
,
3795 (char *)message
, strlen(message
));
3796 strbuf_release(&buf
);
3797 unuse_commit_buffer(commit
, message
);
3798 return opt
->invert_grep
? !retval
: retval
;
3801 static inline int want_ancestry(const struct rev_info
*revs
)
3803 return (revs
->rewrite_parents
|| revs
->children
.name
);
3807 * Return a timestamp to be used for --since/--until comparisons for this
3808 * commit, based on the revision options.
3810 static timestamp_t
comparison_date(const struct rev_info
*revs
,
3811 struct commit
*commit
)
3813 return revs
->reflog_info
?
3814 get_reflog_timestamp(revs
->reflog_info
) :
3818 enum commit_action
get_commit_action(struct rev_info
*revs
, struct commit
*commit
)
3820 if (commit
->object
.flags
& SHOWN
)
3821 return commit_ignore
;
3822 if (revs
->unpacked
&& has_object_pack(&commit
->object
.oid
))
3823 return commit_ignore
;
3824 if (revs
->no_kept_objects
) {
3825 if (has_object_kept_pack(&commit
->object
.oid
,
3826 revs
->keep_pack_cache_flags
))
3827 return commit_ignore
;
3829 if (commit
->object
.flags
& UNINTERESTING
)
3830 return commit_ignore
;
3831 if (revs
->line_level_traverse
&& !want_ancestry(revs
)) {
3833 * In case of line-level log with parent rewriting
3834 * prepare_revision_walk() already took care of all line-level
3835 * log filtering, and there is nothing left to do here.
3837 * If parent rewriting was not requested, then this is the
3838 * place to perform the line-level log filtering. Notably,
3839 * this check, though expensive, must come before the other,
3840 * cheaper filtering conditions, because the tracked line
3841 * ranges must be adjusted even when the commit will end up
3842 * being ignored based on other conditions.
3844 if (!line_log_process_ranges_arbitrary_commit(revs
, commit
))
3845 return commit_ignore
;
3847 if (revs
->min_age
!= -1 &&
3848 comparison_date(revs
, commit
) > revs
->min_age
)
3849 return commit_ignore
;
3850 if (revs
->min_parents
|| (revs
->max_parents
>= 0)) {
3851 int n
= commit_list_count(commit
->parents
);
3852 if ((n
< revs
->min_parents
) ||
3853 ((revs
->max_parents
>= 0) && (n
> revs
->max_parents
)))
3854 return commit_ignore
;
3856 if (!commit_match(commit
, revs
))
3857 return commit_ignore
;
3858 if (revs
->prune
&& revs
->dense
) {
3859 /* Commit without changes? */
3860 if (commit
->object
.flags
& TREESAME
) {
3862 struct commit_list
*p
;
3863 /* drop merges unless we want parenthood */
3864 if (!want_ancestry(revs
))
3865 return commit_ignore
;
3867 if (revs
->show_pulls
&& (commit
->object
.flags
& PULL_MERGE
))
3871 * If we want ancestry, then need to keep any merges
3872 * between relevant commits to tie together topology.
3873 * For consistency with TREESAME and simplification
3874 * use "relevant" here rather than just INTERESTING,
3875 * to treat bottom commit(s) as part of the topology.
3877 for (n
= 0, p
= commit
->parents
; p
; p
= p
->next
)
3878 if (relevant_commit(p
->item
))
3881 return commit_ignore
;
3887 define_commit_slab(saved_parents
, struct commit_list
*);
3889 #define EMPTY_PARENT_LIST ((struct commit_list *)-1)
3892 * You may only call save_parents() once per commit (this is checked
3893 * for non-root commits).
3895 static void save_parents(struct rev_info
*revs
, struct commit
*commit
)
3897 struct commit_list
**pp
;
3899 if (!revs
->saved_parents_slab
) {
3900 revs
->saved_parents_slab
= xmalloc(sizeof(struct saved_parents
));
3901 init_saved_parents(revs
->saved_parents_slab
);
3904 pp
= saved_parents_at(revs
->saved_parents_slab
, commit
);
3907 * When walking with reflogs, we may visit the same commit
3908 * several times: once for each appearance in the reflog.
3910 * In this case, save_parents() will be called multiple times.
3911 * We want to keep only the first set of parents. We need to
3912 * store a sentinel value for an empty (i.e., NULL) parent
3913 * list to distinguish it from a not-yet-saved list, however.
3917 if (commit
->parents
)
3918 *pp
= copy_commit_list(commit
->parents
);
3920 *pp
= EMPTY_PARENT_LIST
;
3923 static void free_saved_parents(struct rev_info
*revs
)
3925 if (revs
->saved_parents_slab
)
3926 clear_saved_parents(revs
->saved_parents_slab
);
3929 struct commit_list
*get_saved_parents(struct rev_info
*revs
, const struct commit
*commit
)
3931 struct commit_list
*parents
;
3933 if (!revs
->saved_parents_slab
)
3934 return commit
->parents
;
3936 parents
= *saved_parents_at(revs
->saved_parents_slab
, commit
);
3937 if (parents
== EMPTY_PARENT_LIST
)
3942 enum commit_action
simplify_commit(struct rev_info
*revs
, struct commit
*commit
)
3944 enum commit_action action
= get_commit_action(revs
, commit
);
3946 if (action
== commit_show
&&
3947 revs
->prune
&& revs
->dense
&& want_ancestry(revs
)) {
3949 * --full-diff on simplified parents is no good: it
3950 * will show spurious changes from the commits that
3951 * were elided. So we save the parents on the side
3952 * when --full-diff is in effect.
3954 if (revs
->full_diff
)
3955 save_parents(revs
, commit
);
3956 if (rewrite_parents(revs
, commit
, rewrite_one
) < 0)
3957 return commit_error
;
3962 static void track_linear(struct rev_info
*revs
, struct commit
*commit
)
3964 if (revs
->track_first_time
) {
3966 revs
->track_first_time
= 0;
3968 struct commit_list
*p
;
3969 for (p
= revs
->previous_parents
; p
; p
= p
->next
)
3970 if (p
->item
== NULL
|| /* first commit */
3971 oideq(&p
->item
->object
.oid
, &commit
->object
.oid
))
3973 revs
->linear
= p
!= NULL
;
3975 if (revs
->reverse
) {
3977 commit
->object
.flags
|= TRACK_LINEAR
;
3979 free_commit_list(revs
->previous_parents
);
3980 revs
->previous_parents
= copy_commit_list(commit
->parents
);
3983 static struct commit
*get_revision_1(struct rev_info
*revs
)
3986 struct commit
*commit
;
3988 if (revs
->reflog_info
)
3989 commit
= next_reflog_entry(revs
->reflog_info
);
3990 else if (revs
->topo_walk_info
)
3991 commit
= next_topo_commit(revs
);
3993 commit
= pop_commit(&revs
->commits
);
3998 if (revs
->reflog_info
)
3999 commit
->object
.flags
&= ~(ADDED
| SEEN
| SHOWN
);
4002 * If we haven't done the list limiting, we need to look at
4003 * the parents here. We also need to do the date-based limiting
4004 * that we'd otherwise have done in limit_list().
4006 if (!revs
->limited
) {
4007 if (revs
->max_age
!= -1 &&
4008 comparison_date(revs
, commit
) < revs
->max_age
)
4011 if (revs
->reflog_info
)
4012 try_to_simplify_commit(revs
, commit
);
4013 else if (revs
->topo_walk_info
)
4014 expand_topo_walk(revs
, commit
);
4015 else if (process_parents(revs
, commit
, &revs
->commits
, NULL
) < 0) {
4016 if (!revs
->ignore_missing_links
)
4017 die("Failed to traverse parents of commit %s",
4018 oid_to_hex(&commit
->object
.oid
));
4022 switch (simplify_commit(revs
, commit
)) {
4026 die("Failed to simplify parents of commit %s",
4027 oid_to_hex(&commit
->object
.oid
));
4029 if (revs
->track_linear
)
4030 track_linear(revs
, commit
);
4037 * Return true for entries that have not yet been shown. (This is an
4038 * object_array_each_func_t.)
4040 static int entry_unshown(struct object_array_entry
*entry
, void *cb_data_unused
)
4042 return !(entry
->item
->flags
& SHOWN
);
4046 * If array is on the verge of a realloc, garbage-collect any entries
4047 * that have already been shown to try to free up some space.
4049 static void gc_boundary(struct object_array
*array
)
4051 if (array
->nr
== array
->alloc
)
4052 object_array_filter(array
, entry_unshown
, NULL
);
4055 static void create_boundary_commit_list(struct rev_info
*revs
)
4059 struct object_array
*array
= &revs
->boundary_commits
;
4060 struct object_array_entry
*objects
= array
->objects
;
4063 * If revs->commits is non-NULL at this point, an error occurred in
4064 * get_revision_1(). Ignore the error and continue printing the
4065 * boundary commits anyway. (This is what the code has always
4068 if (revs
->commits
) {
4069 free_commit_list(revs
->commits
);
4070 revs
->commits
= NULL
;
4074 * Put all of the actual boundary commits from revs->boundary_commits
4075 * into revs->commits
4077 for (i
= 0; i
< array
->nr
; i
++) {
4078 c
= (struct commit
*)(objects
[i
].item
);
4081 if (!(c
->object
.flags
& CHILD_SHOWN
))
4083 if (c
->object
.flags
& (SHOWN
| BOUNDARY
))
4085 c
->object
.flags
|= BOUNDARY
;
4086 commit_list_insert(c
, &revs
->commits
);
4090 * If revs->topo_order is set, sort the boundary commits
4091 * in topological order
4093 sort_in_topological_order(&revs
->commits
, revs
->sort_order
);
4096 static struct commit
*get_revision_internal(struct rev_info
*revs
)
4098 struct commit
*c
= NULL
;
4099 struct commit_list
*l
;
4101 if (revs
->boundary
== 2) {
4103 * All of the normal commits have already been returned,
4104 * and we are now returning boundary commits.
4105 * create_boundary_commit_list() has populated
4106 * revs->commits with the remaining commits to return.
4108 c
= pop_commit(&revs
->commits
);
4110 c
->object
.flags
|= SHOWN
;
4115 * If our max_count counter has reached zero, then we are done. We
4116 * don't simply return NULL because we still might need to show
4117 * boundary commits. But we want to avoid calling get_revision_1, which
4118 * might do a considerable amount of work finding the next commit only
4119 * for us to throw it away.
4121 * If it is non-zero, then either we don't have a max_count at all
4122 * (-1), or it is still counting, in which case we decrement.
4124 if (revs
->max_count
) {
4125 c
= get_revision_1(revs
);
4127 while (revs
->skip_count
> 0) {
4129 c
= get_revision_1(revs
);
4135 if (revs
->max_count
> 0)
4140 c
->object
.flags
|= SHOWN
;
4142 if (!revs
->boundary
)
4147 * get_revision_1() runs out the commits, and
4148 * we are done computing the boundaries.
4149 * switch to boundary commits output mode.
4154 * Update revs->commits to contain the list of
4157 create_boundary_commit_list(revs
);
4159 return get_revision_internal(revs
);
4163 * boundary commits are the commits that are parents of the
4164 * ones we got from get_revision_1() but they themselves are
4165 * not returned from get_revision_1(). Before returning
4166 * 'c', we need to mark its parents that they could be boundaries.
4169 for (l
= c
->parents
; l
; l
= l
->next
) {
4171 p
= &(l
->item
->object
);
4172 if (p
->flags
& (CHILD_SHOWN
| SHOWN
))
4174 p
->flags
|= CHILD_SHOWN
;
4175 gc_boundary(&revs
->boundary_commits
);
4176 add_object_array(p
, NULL
, &revs
->boundary_commits
);
4182 struct commit
*get_revision(struct rev_info
*revs
)
4185 struct commit_list
*reversed
;
4187 if (revs
->reverse
) {
4189 while ((c
= get_revision_internal(revs
)))
4190 commit_list_insert(c
, &reversed
);
4191 revs
->commits
= reversed
;
4193 revs
->reverse_output_stage
= 1;
4196 if (revs
->reverse_output_stage
) {
4197 c
= pop_commit(&revs
->commits
);
4198 if (revs
->track_linear
)
4199 revs
->linear
= !!(c
&& c
->object
.flags
& TRACK_LINEAR
);
4203 c
= get_revision_internal(revs
);
4204 if (c
&& revs
->graph
)
4205 graph_update(revs
->graph
, c
);
4207 free_saved_parents(revs
);
4208 if (revs
->previous_parents
) {
4209 free_commit_list(revs
->previous_parents
);
4210 revs
->previous_parents
= NULL
;
4216 const char *get_revision_mark(const struct rev_info
*revs
, const struct commit
*commit
)
4218 if (commit
->object
.flags
& BOUNDARY
)
4220 else if (commit
->object
.flags
& UNINTERESTING
)
4222 else if (commit
->object
.flags
& PATCHSAME
)
4224 else if (!revs
|| revs
->left_right
) {
4225 if (commit
->object
.flags
& SYMMETRIC_LEFT
)
4229 } else if (revs
->graph
)
4231 else if (revs
->cherry_mark
)
4236 void put_revision_mark(const struct rev_info
*revs
, const struct commit
*commit
)
4238 const char *mark
= get_revision_mark(revs
, commit
);
4241 fputs(mark
, stdout
);