Re: Bizarre missing changes (git bug?)
From: Junio C Hamano <hidden>
Date: 2016-06-15 22:45:05
Linus Torvalds [off-list ref] writes:
But the reverse isn't true: the current primary formats cannot be generated from your preferred format without losing something important (performance). But I'll make you a deal: if you actually write the filter in C form, I can pretty much guarantee that we can easily add it as a new flag. It really should be pretty easy to integrate it into the revision parsing machinery alongside --topo-order, since it's really the same kind of operation.
I am not Roman, but so I do not know if I did what Roman wanted to, but
here is a quick hack. "gitk --post-simplify -- kernel/printk.c" is
slightly more readable than --full-history with this patch.
-- >8 --
Subject: [PATCH] revision traversal: teach --post-simplify
The --full-history traversal keeps all merges and non-merge commits that
touch paths in the given pathspec. This is useful to view both sides of a
merge in a topology like this:
A---M---o
/ /
---O---B
when A and B makes identical change to the given paths. The revision
traversal without --full-history aims to come up with a simplest history
to explain the final state of the tree, and one of the side branches can
be pruned away.
The behaviour to keep all merges however is inconvenient if neither A nor
B touches the paths we are interested in. --full-history reduces the
topology to:
---O---M---o
in such a case, without removing M.
This adds a post processing phase on top of --full-history traversal to
remove needless merges from the resulting history.
The idea is to compute, for each commit in the "full history" result set,
the commit that should replace it in the simplified history. This
replacement commit is defined as follows:
* In any case, we first figure out the replacement commits of parents of
the commit we are looking at. The commit we are looking at is
rewritten as if its parents are replacement commits of its original
parents.
* If the commit is marked as TREESAME (i.e. it modifies the paths we are
interested in), then the replacement commit is itself. IOW, the commit
is not dropped from the final result.
* Otherwise, we examine the parents of the commit.
- If they replace to the same commit, because the commit we are looking
at itself does not touch the interesting paths, we replace the commit
we are looking at with the replacement commit of its parents.
- If some of the parents replace to one commit, and some other parents
replace to another different commit, the commit we are looking at
needs to stay as a merge in the final result.
The algorithm outlined above alone does not quite work; the reason is
because "all parents are replaced by the same commit" rule is too strict.
It needs to be relaxed to remove parents that are ancestor of some other
parents, and that is why post_simplify_one() calls a rather expensive
reduce_heads().
Signed-off-by: Junio C Hamano <redacted>
---
revision.c | 125 ++++++++++++++++++++++++++++++++++++++++++++++++++----------
revision.h | 1 +
2 files changed, 106 insertions(+), 20 deletions(-)
diff --git a/revision.c b/revision.c
index 3897fec..a843c42 100644
--- a/revision.c
+++ b/revision.c@@ -1045,6 +1045,10 @@ static int handle_revision_opt(struct rev_info *revs, int argc, const char **arg } else if (!strcmp(arg, "--topo-order")) { revs->lifo = 1; revs->topo_order = 1; + } else if (!strcmp(arg, "--post-simplify")) { + revs->post_simplify = 1; + revs->topo_order = 1; + revs->simplify_history = 0; } else if (!strcmp(arg, "--date-order")) { revs->lifo = 0; revs->topo_order = 1;
@@ -1378,6 +1382,105 @@ static void add_child(struct rev_info *revs, struct commit *parent, struct commi l->next = add_decoration(&revs->children, &parent->object, l); } +static int remove_duplicate_parents(struct commit *commit) +{ + struct commit_list **pp, *p; + int surviving_parents; + + /* Examine existing parents while marking ones we have seen... */ + pp = &commit->parents; + while ((p = *pp) != NULL) { + struct commit *parent = p->item; + if (parent->object.flags & TMP_MARK) { + *pp = p->next; + continue; + } + parent->object.flags |= TMP_MARK; + pp = &p->next; + } + /* count them while clearing the temporary mark */ + surviving_parents = 0; + for (p = commit->parents; p; p = p->next) { + p->item->object.flags &= ~TMP_MARK; + surviving_parents++; + } + return surviving_parents; +} + +static int post_simplify_one(struct commit *commit) +{ + struct commit_list *p; + int num_parents; + + for (p = commit->parents; p; p = p->next) + if (!p->item->util) + return 0; + + /* All of our parents know what they should be rewritten to */ + for (p = commit->parents; p; p = p->next) + p->item = p->item->util; + num_parents = remove_duplicate_parents(commit); + + if (1 < num_parents) { + struct commit_list *h = reduce_heads(commit->parents); + num_parents = commit_list_count(h); + free_commit_list(commit->parents); + commit->parents = h; + } + + /* + * We stand for ourselves if we are root, if we change the tree, + * or if we are a merge and our parents simplify to different + * commits. Otherwise we can be replaced by the commit our + * sole parent is replaced by. + */ + if (!num_parents || + !(commit->object.flags & TREESAME) || + (1 < num_parents)) + commit->util = commit; + else + commit->util = commit->parents->item->util; + + return 1; +} + +static void post_simplify(struct rev_info *revs) +{ + struct commit_list *list; + struct commit_list *yet_to_do, **tail; + + /* feed the list reversed */ + yet_to_do = NULL; + for (list = revs->commits; list; list = list->next) + commit_list_insert(list->item, &yet_to_do); + while (yet_to_do) { + list = yet_to_do; + yet_to_do = NULL; + tail = &yet_to_do; + while (list) { + struct commit *commit = list->item; + struct commit_list *next = list->next; + free(list); + list = next; + if (!post_simplify_one(commit)) + tail = &commit_list_insert(commit, tail)->next; + } + } + + /* clean up the result, removing the simplified ones */ + list = revs->commits; + revs->commits = NULL; + tail = &revs->commits; + while (list) { + struct commit *commit = list->item; + struct commit_list *next = list->next; + free(list); + list = next; + if (commit->util == commit) + tail = &commit_list_insert(commit, tail)->next; + } +} + static void set_children(struct rev_info *revs) { struct commit_list *l;
@@ -1418,6 +1521,8 @@ int prepare_revision_walk(struct rev_info *revs) return -1; if (revs->topo_order) sort_in_topological_order(&revs->commits, revs->lifo); + if (revs->post_simplify) + post_simplify(revs); if (revs->children.name) set_children(revs); return 0;
@@ -1450,26 +1555,6 @@ static enum rewrite_result rewrite_one(struct rev_info *revs, struct commit **pp } } -static void remove_duplicate_parents(struct commit *commit) -{ - struct commit_list **pp, *p; - - /* Examine existing parents while marking ones we have seen... */ - pp = &commit->parents; - while ((p = *pp) != NULL) { - struct commit *parent = p->item; - if (parent->object.flags & TMP_MARK) { - *pp = p->next; - continue; - } - parent->object.flags |= TMP_MARK; - pp = &p->next; - } - /* ... and clear the temporary mark */ - for (p = commit->parents; p; p = p->next) - p->item->object.flags &= ~TMP_MARK; -} - static int rewrite_parents(struct rev_info *revs, struct commit *commit) { struct commit_list **pp = &commit->parents;
diff --git a/revision.h b/revision.h
index f64e8ce..953e69b 100644
--- a/revision.h
+++ b/revision.h@@ -41,6 +41,7 @@ struct rev_info { simplify_history:1, lifo:1, topo_order:1, + post_simplify:1, tag_objects:1, tree_objects:1, blob_objects:1,
--
1.6.0.rc1.29.gc4aca