From: Dave Borowitz Date: Thu, 12 Jun 2014 17:04:01 +0000 (-0700) Subject: Rename RewriteTreeFilter to TreeRevFilter and make it public X-Git-Tag: v3.5.0.201409071800-rc1~99 X-Git-Url: https://source.dussan.org/?a=commitdiff_plain;h=eb69cef35c2fa9d6f1f8493e3ae03cd65b86b5cc;p=jgit.git Rename RewriteTreeFilter to TreeRevFilter and make it public The current behavior of passing a TreeFilter to RevWalk has limited usefulness, since the RevFilter derived from the TreeFilter is always ANDed together with any other RevFilters. It is also tied fairly tightly to the parent rewriting mechanism. Make TreeRevFilter a generic RevFilter that matches modified paths against any TreeFilter. This allows for more complex logic like (modified this path OR authored by this person). Leave the rewrite flag logic in this class, since it's closely tied to the parent comparison code, but hidden behind a protected constructor. Change-Id: Ia72ef591a99415e6f340c5f64583a49c91f1b82f --- diff --git a/org.eclipse.jgit.test/tst/org/eclipse/jgit/revwalk/TreeRevFilterTest.java b/org.eclipse.jgit.test/tst/org/eclipse/jgit/revwalk/TreeRevFilterTest.java new file mode 100644 index 0000000000..9548992a2b --- /dev/null +++ b/org.eclipse.jgit.test/tst/org/eclipse/jgit/revwalk/TreeRevFilterTest.java @@ -0,0 +1,188 @@ +/* + * Copyright (C) 2014, Google Inc. + * and other copyright owners as documented in the project's IP log. + * + * This program and the accompanying materials are made available + * under the terms of the Eclipse Distribution License v1.0 which + * accompanies this distribution, is reproduced below, and is + * available at http://www.eclipse.org/org/documents/edl-v10.php + * + * All rights reserved. + * + * Redistribution and use in source and binary forms, with or + * without modification, are permitted provided that the following + * conditions are met: + * + * - Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * + * - Redistributions in binary form must reproduce the above + * copyright notice, this list of conditions and the following + * disclaimer in the documentation and/or other materials provided + * with the distribution. + * + * - Neither the name of the Eclipse Foundation, Inc. nor the + * names of its contributors may be used to endorse or promote + * products derived from this software without specific prior + * written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND + * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, + * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES + * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE + * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR + * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, + * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT + * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; + * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, + * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) + * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF + * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + */ + +package org.eclipse.jgit.revwalk; + +import static org.junit.Assert.assertEquals; +import static org.junit.Assert.assertNull; + +import java.util.Collections; + +import org.eclipse.jgit.revwalk.filter.OrRevFilter; +import org.eclipse.jgit.revwalk.filter.RevFilter; +import org.eclipse.jgit.revwalk.filter.SkipRevFilter; +import org.eclipse.jgit.treewalk.filter.AndTreeFilter; +import org.eclipse.jgit.treewalk.filter.PathFilterGroup; +import org.eclipse.jgit.treewalk.filter.TreeFilter; +import org.junit.Test; + +public class TreeRevFilterTest extends RevWalkTestCase { + private RevFilter treeRevFilter(String path) { + return new TreeRevFilter(rw, treeFilter(path)); + } + + private static TreeFilter treeFilter(String path) { + return AndTreeFilter.create( + PathFilterGroup.createFromStrings(Collections.singleton(path)), + TreeFilter.ANY_DIFF); + } + + @Test + public void testStringOfPearls_FilePath1() + throws Exception { + RevCommit a = commit(tree(file("d/f", blob("a")))); + RevCommit b = commit(tree(file("d/f", blob("a"))), a); + RevCommit c = commit(tree(file("d/f", blob("b"))), b); + rw.setRevFilter(treeRevFilter("d/f")); + markStart(c); + + assertCommit(c, rw.next()); + assertEquals(1, c.getParentCount()); + assertCommit(b, c.getParent(0)); + + assertCommit(a, rw.next()); // b was skipped + assertEquals(0, a.getParentCount()); + assertNull(rw.next()); + } + + @Test + public void testStringOfPearls_FilePath2() throws Exception { + RevCommit a = commit(tree(file("d/f", blob("a")))); + RevCommit b = commit(tree(file("d/f", blob("a"))), a); + RevCommit c = commit(tree(file("d/f", blob("b"))), b); + RevCommit d = commit(tree(file("d/f", blob("b"))), c); + rw.setRevFilter(treeRevFilter("d/f")); + markStart(d); + + // d was skipped + assertCommit(c, rw.next()); + assertEquals(1, c.getParentCount()); + assertCommit(b, c.getParent(0)); + + // b was skipped + assertCommit(a, rw.next()); + assertEquals(0, a.getParentCount()); + assertNull(rw.next()); + } + + @Test + public void testStringOfPearls_DirPath2() throws Exception { + RevCommit a = commit(tree(file("d/f", blob("a")))); + RevCommit b = commit(tree(file("d/f", blob("a"))), a); + RevCommit c = commit(tree(file("d/f", blob("b"))), b); + RevCommit d = commit(tree(file("d/f", blob("b"))), c); + rw.setRevFilter(treeRevFilter("d")); + markStart(d); + + // d was skipped + assertCommit(c, rw.next()); + assertEquals(1, c.getParentCount()); + assertCommit(b, c.getParent(0)); + + // b was skipped + assertCommit(a, rw.next()); + assertEquals(0, a.getParentCount()); + assertNull(rw.next()); + } + + @Test + public void testStringOfPearls_FilePath3() throws Exception { + RevCommit a = commit(tree(file("d/f", blob("a")))); + RevCommit b = commit(tree(file("d/f", blob("a"))), a); + RevCommit c = commit(tree(file("d/f", blob("b"))), b); + RevCommit d = commit(tree(file("d/f", blob("b"))), c); + RevCommit e = commit(tree(file("d/f", blob("b"))), d); + RevCommit f = commit(tree(file("d/f", blob("b"))), e); + RevCommit g = commit(tree(file("d/f", blob("b"))), f); + RevCommit h = commit(tree(file("d/f", blob("b"))), g); + RevCommit i = commit(tree(file("d/f", blob("c"))), h); + rw.setRevFilter(treeRevFilter("d/f")); + markStart(i); + + assertCommit(i, rw.next()); + assertEquals(1, i.getParentCount()); + assertCommit(h, i.getParent(0)); + + // h..d was skipped + assertCommit(c, rw.next()); + assertEquals(1, c.getParentCount()); + assertCommit(b, c.getParent(0)); + + // b was skipped + assertCommit(a, rw.next()); + assertEquals(0, a.getParentCount()); + assertNull(rw.next()); + } + + @Test + public void testPathFilterOrOtherFilter() throws Exception { + RevFilter pathFilter = treeRevFilter("d/f"); + RevFilter skipFilter = SkipRevFilter.create(1); + RevFilter orFilter = OrRevFilter.create(skipFilter, pathFilter); + + RevCommit a = parseBody(commit(5, tree(file("d/f", blob("a"))))); + RevCommit b = parseBody(commit(5, tree(file("d/f", blob("a"))), a)); + RevCommit c = parseBody(commit(5, tree(file("d/f", blob("b"))), b)); + + // Path filter matches c, a. + rw.setRevFilter(pathFilter); + markStart(c); + assertCommit(c, rw.next()); + assertCommit(a, rw.next()); + + // Skip filter matches b, a. + rw.reset(); + rw.setRevFilter(skipFilter); + markStart(c); + assertCommit(b, rw.next()); + assertCommit(a, rw.next()); + + // (Path OR Skip) matches c, b, a. + rw.reset(); + rw.setRevFilter(orFilter); + markStart(c); + assertCommit(c, rw.next()); + assertCommit(b, rw.next()); + assertCommit(a, rw.next()); + } +} diff --git a/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/RewriteGenerator.java b/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/RewriteGenerator.java index 87a56a9e8f..3ab96ca228 100644 --- a/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/RewriteGenerator.java +++ b/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/RewriteGenerator.java @@ -57,7 +57,7 @@ import org.eclipse.jgit.errors.MissingObjectException; * commit that matched the revision walker's filters. *

* This generator is the second phase of a path limited revision walk and - * assumes it is receiving RevCommits from {@link RewriteTreeFilter}, + * assumes it is receiving RevCommits from {@link TreeRevFilter}, * after they have been fully buffered by {@link AbstractRevQueue}. The full * buffering is necessary to allow the simple loop used within our own * {@link #rewrite(RevCommit)} to pull completely through a strand of @@ -66,7 +66,7 @@ import org.eclipse.jgit.errors.MissingObjectException; * this loop to abort early, due to commits not being parsed and colored * correctly. * - * @see RewriteTreeFilter + * @see TreeRevFilter */ class RewriteGenerator extends Generator { private static final int REWRITE = RevWalk.REWRITE; diff --git a/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/RewriteTreeFilter.java b/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/RewriteTreeFilter.java deleted file mode 100644 index a84e80e650..0000000000 --- a/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/RewriteTreeFilter.java +++ /dev/null @@ -1,268 +0,0 @@ -/* - * Copyright (C) 2008, Shawn O. Pearce - * and other copyright owners as documented in the project's IP log. - * - * This program and the accompanying materials are made available - * under the terms of the Eclipse Distribution License v1.0 which - * accompanies this distribution, is reproduced below, and is - * available at http://www.eclipse.org/org/documents/edl-v10.php - * - * All rights reserved. - * - * Redistribution and use in source and binary forms, with or - * without modification, are permitted provided that the following - * conditions are met: - * - * - Redistributions of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * - Redistributions in binary form must reproduce the above - * copyright notice, this list of conditions and the following - * disclaimer in the documentation and/or other materials provided - * with the distribution. - * - * - Neither the name of the Eclipse Foundation, Inc. nor the - * names of its contributors may be used to endorse or promote - * products derived from this software without specific prior - * written permission. - * - * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND - * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, - * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES - * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE - * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR - * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, - * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT - * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER - * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, - * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) - * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF - * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - */ - -package org.eclipse.jgit.revwalk; - -import java.io.IOException; -import java.util.List; - -import org.eclipse.jgit.diff.DiffConfig; -import org.eclipse.jgit.diff.DiffEntry; -import org.eclipse.jgit.diff.DiffEntry.ChangeType; -import org.eclipse.jgit.diff.RenameDetector; -import org.eclipse.jgit.errors.CorruptObjectException; -import org.eclipse.jgit.errors.IncorrectObjectTypeException; -import org.eclipse.jgit.errors.MissingObjectException; -import org.eclipse.jgit.errors.StopWalkException; -import org.eclipse.jgit.lib.ObjectId; -import org.eclipse.jgit.revwalk.filter.RevFilter; -import org.eclipse.jgit.treewalk.TreeWalk; -import org.eclipse.jgit.treewalk.filter.TreeFilter; - -/** - * First phase of a path limited revision walk. - *

- * This filter is ANDed to evaluate after all other filters and ties the - * configured {@link TreeFilter} into the revision walking process. - *

- * Each commit is differenced concurrently against all of its parents to look - * for tree entries that are interesting to the TreeFilter. If none are found - * the commit is colored with {@link RevWalk#REWRITE}, allowing a later pass - * implemented by {@link RewriteGenerator} to remove those colored commits from - * the DAG. - * - * @see RewriteGenerator - */ -class RewriteTreeFilter extends RevFilter { - private static final int PARSED = RevWalk.PARSED; - - private static final int UNINTERESTING = RevWalk.UNINTERESTING; - - private static final int REWRITE = RevWalk.REWRITE; - - private final TreeWalk pathFilter; - - RewriteTreeFilter(final RevWalk walker, final TreeFilter t) { - pathFilter = new TreeWalk(walker.reader); - pathFilter.setFilter(t); - pathFilter.setRecursive(t.shouldBeRecursive()); - } - - @Override - public RevFilter clone() { - throw new UnsupportedOperationException(); - } - - @Override - public boolean include(final RevWalk walker, final RevCommit c) - throws StopWalkException, MissingObjectException, - IncorrectObjectTypeException, IOException { - // Reset the tree filter to scan this commit and parents. - // - final RevCommit[] pList = c.parents; - final int nParents = pList.length; - final TreeWalk tw = pathFilter; - final ObjectId[] trees = new ObjectId[nParents + 1]; - for (int i = 0; i < nParents; i++) { - final RevCommit p = c.parents[i]; - if ((p.flags & PARSED) == 0) - p.parseHeaders(walker); - trees[i] = p.getTree(); - } - trees[nParents] = c.getTree(); - tw.reset(trees); - - if (nParents == 1) { - // We have exactly one parent. This is a very common case. - // - int chgs = 0, adds = 0; - while (tw.next()) { - chgs++; - if (tw.getRawMode(0) == 0 && tw.getRawMode(1) != 0) - adds++; - else - break; // no point in looking at this further. - } - - if (chgs == 0) { - // No changes, so our tree is effectively the same as - // our parent tree. We pass the buck to our parent. - // - c.flags |= REWRITE; - return false; - } else { - // We have interesting items, but neither of the special - // cases denoted above. - // - if (adds > 0 && tw.getFilter() instanceof FollowFilter) { - // One of the paths we care about was added in this - // commit. We need to update our filter to its older - // name, if we can discover it. Find out what that is. - // - updateFollowFilter(trees, ((FollowFilter) tw.getFilter()).cfg); - } - return true; - } - } else if (nParents == 0) { - // We have no parents to compare against. Consider us to be - // REWRITE only if we have no paths matching our filter. - // - if (tw.next()) - return true; - c.flags |= REWRITE; - return false; - } - - // We are a merge commit. We can only be REWRITE if we are same - // to _all_ parents. We may also be able to eliminate a parent if - // it does not contribute changes to us. Such a parent may be an - // uninteresting side branch. - // - final int[] chgs = new int[nParents]; - final int[] adds = new int[nParents]; - while (tw.next()) { - final int myMode = tw.getRawMode(nParents); - for (int i = 0; i < nParents; i++) { - final int pMode = tw.getRawMode(i); - if (myMode == pMode && tw.idEqual(i, nParents)) - continue; - - chgs[i]++; - if (pMode == 0 && myMode != 0) - adds[i]++; - } - } - - boolean same = false; - boolean diff = false; - for (int i = 0; i < nParents; i++) { - if (chgs[i] == 0) { - // No changes, so our tree is effectively the same as - // this parent tree. We pass the buck to only this one - // parent commit. - // - - final RevCommit p = pList[i]; - if ((p.flags & UNINTERESTING) != 0) { - // This parent was marked as not interesting by the - // application. We should look for another parent - // that is interesting. - // - same = true; - continue; - } - - c.flags |= REWRITE; - c.parents = new RevCommit[] { p }; - return false; - } - - if (chgs[i] == adds[i]) { - // All of the differences from this parent were because we - // added files that they did not have. This parent is our - // "empty tree root" and thus their history is not relevant. - // Cut our grandparents to be an empty list. - // - pList[i].parents = RevCommit.NO_PARENTS; - } - - // We have an interesting difference relative to this parent. - // - diff = true; - } - - if (diff && !same) { - // We did not abort above, so we are different in at least one - // way from all of our parents. We have to take the blame for - // that difference. - // - return true; - } - - // We are the same as all of our parents. We must keep them - // as they are and allow those parents to flow into pending - // for further scanning. - // - c.flags |= REWRITE; - return false; - } - - @Override - public boolean requiresCommitBody() { - return false; - } - - private void updateFollowFilter(ObjectId[] trees, DiffConfig cfg) - throws MissingObjectException, IncorrectObjectTypeException, - CorruptObjectException, IOException { - TreeWalk tw = pathFilter; - FollowFilter oldFilter = (FollowFilter) tw.getFilter(); - tw.setFilter(TreeFilter.ANY_DIFF); - tw.reset(trees); - - List files = DiffEntry.scan(tw); - RenameDetector rd = new RenameDetector(tw.getObjectReader(), cfg); - rd.addAll(files); - files = rd.compute(); - - TreeFilter newFilter = oldFilter; - for (DiffEntry ent : files) { - if (isRename(ent) && ent.getNewPath().equals(oldFilter.getPath())) { - newFilter = FollowFilter.create(ent.getOldPath(), cfg); - RenameCallback callback = oldFilter.getRenameCallback(); - if (callback != null) { - callback.renamed(ent); - // forward the callback to the new follow filter - ((FollowFilter) newFilter).setRenameCallback(callback); - } - break; - } - } - tw.setFilter(newFilter); - } - - private static boolean isRename(DiffEntry ent) { - return ent.getChangeType() == ChangeType.RENAME - || ent.getChangeType() == ChangeType.COPY; - } -} diff --git a/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/StartGenerator.java b/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/StartGenerator.java index 9c4e53c979..aab678cd7b 100644 --- a/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/StartGenerator.java +++ b/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/StartGenerator.java @@ -127,7 +127,8 @@ class StartGenerator extends Generator { else pending = new DateRevQueue(q); if (tf != TreeFilter.ALL) { - rf = AndRevFilter.create(new RewriteTreeFilter(w, tf), rf); + rf = AndRevFilter.create( + new TreeRevFilter(w, tf, RevWalk.REWRITE), rf); pendingOutputType |= HAS_REWRITE; if (w.getRewriteParents()) pendingOutputType |= NEEDS_REWRITE; diff --git a/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/TreeRevFilter.java b/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/TreeRevFilter.java new file mode 100644 index 0000000000..b2c0fcdf73 --- /dev/null +++ b/org.eclipse.jgit/src/org/eclipse/jgit/revwalk/TreeRevFilter.java @@ -0,0 +1,301 @@ +/* + * Copyright (C) 2008, Shawn O. Pearce + * and other copyright owners as documented in the project's IP log. + * + * This program and the accompanying materials are made available + * under the terms of the Eclipse Distribution License v1.0 which + * accompanies this distribution, is reproduced below, and is + * available at http://www.eclipse.org/org/documents/edl-v10.php + * + * All rights reserved. + * + * Redistribution and use in source and binary forms, with or + * without modification, are permitted provided that the following + * conditions are met: + * + * - Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * + * - Redistributions in binary form must reproduce the above + * copyright notice, this list of conditions and the following + * disclaimer in the documentation and/or other materials provided + * with the distribution. + * + * - Neither the name of the Eclipse Foundation, Inc. nor the + * names of its contributors may be used to endorse or promote + * products derived from this software without specific prior + * written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND + * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, + * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES + * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE + * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR + * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, + * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT + * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; + * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, + * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) + * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF + * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + */ + +package org.eclipse.jgit.revwalk; + +import java.io.IOException; +import java.util.List; + +import org.eclipse.jgit.diff.DiffConfig; +import org.eclipse.jgit.diff.DiffEntry; +import org.eclipse.jgit.diff.DiffEntry.ChangeType; +import org.eclipse.jgit.diff.RenameDetector; +import org.eclipse.jgit.errors.CorruptObjectException; +import org.eclipse.jgit.errors.IncorrectObjectTypeException; +import org.eclipse.jgit.errors.MissingObjectException; +import org.eclipse.jgit.errors.StopWalkException; +import org.eclipse.jgit.lib.ObjectId; +import org.eclipse.jgit.revwalk.filter.RevFilter; +import org.eclipse.jgit.treewalk.TreeWalk; +import org.eclipse.jgit.treewalk.filter.TreeFilter; + +/** + * Filter applying a {@link TreeFilter} against changed paths in each commit. + *

+ * Each commit is differenced concurrently against all of its parents to look + * for tree entries that are interesting to the {@link TreeFilter}. + * + * @since 3.5 + */ +public class TreeRevFilter extends RevFilter { + private static final int PARSED = RevWalk.PARSED; + + private static final int UNINTERESTING = RevWalk.UNINTERESTING; + + private final int rewriteFlag; + private final TreeWalk pathFilter; + + /** + * Create a {@link RevFilter} from a {@link TreeFilter}. + * + * @param walker + * walker used for reading trees. + * @param t + * filter to compare against any changed paths in each commit. If a + * {@link FollowFilter}, will be replaced with a new filter + * following new paths after a rename. + * @since 3.5 + */ + public TreeRevFilter(final RevWalk walker, final TreeFilter t) { + this(walker, t, 0); + } + + + /** + * Create a filter for the first phase of a parent-rewriting limited revision + * walk. + *

+ * This filter is ANDed to evaluate before all other filters and ties the + * configured {@link TreeFilter} into the revision walking process. + *

+ * If no interesting tree entries are found the commit is colored with + * {@code rewriteFlag}, allowing a later pass implemented by + * {@link RewriteGenerator} to remove those colored commits from the DAG. + * + * @see RewriteGenerator + * + * @param walker + * walker used for reading trees. + * @param t + * filter to compare against any changed paths in each commit. If a + * {@link FollowFilter}, will be replaced with a new filter + * following new paths after a rename. + * @param rewriteFlag + * flag to color commits to be removed from the simplified DAT. + */ + TreeRevFilter(final RevWalk walker, final TreeFilter t, + final int rewriteFlag) { + pathFilter = new TreeWalk(walker.reader); + pathFilter.setFilter(t); + pathFilter.setRecursive(t.shouldBeRecursive()); + this.rewriteFlag = rewriteFlag; + } + + @Override + public RevFilter clone() { + throw new UnsupportedOperationException(); + } + + @Override + public boolean include(final RevWalk walker, final RevCommit c) + throws StopWalkException, MissingObjectException, + IncorrectObjectTypeException, IOException { + // Reset the tree filter to scan this commit and parents. + // + final RevCommit[] pList = c.parents; + final int nParents = pList.length; + final TreeWalk tw = pathFilter; + final ObjectId[] trees = new ObjectId[nParents + 1]; + for (int i = 0; i < nParents; i++) { + final RevCommit p = c.parents[i]; + if ((p.flags & PARSED) == 0) + p.parseHeaders(walker); + trees[i] = p.getTree(); + } + trees[nParents] = c.getTree(); + tw.reset(trees); + + if (nParents == 1) { + // We have exactly one parent. This is a very common case. + // + int chgs = 0, adds = 0; + while (tw.next()) { + chgs++; + if (tw.getRawMode(0) == 0 && tw.getRawMode(1) != 0) + adds++; + else + break; // no point in looking at this further. + } + + if (chgs == 0) { + // No changes, so our tree is effectively the same as + // our parent tree. We pass the buck to our parent. + // + c.flags |= rewriteFlag; + return false; + } else { + // We have interesting items, but neither of the special + // cases denoted above. + // + if (adds > 0 && tw.getFilter() instanceof FollowFilter) { + // One of the paths we care about was added in this + // commit. We need to update our filter to its older + // name, if we can discover it. Find out what that is. + // + updateFollowFilter(trees, ((FollowFilter) tw.getFilter()).cfg); + } + return true; + } + } else if (nParents == 0) { + // We have no parents to compare against. Consider us to be + // REWRITE only if we have no paths matching our filter. + // + if (tw.next()) + return true; + c.flags |= rewriteFlag; + return false; + } + + // We are a merge commit. We can only be REWRITE if we are same + // to _all_ parents. We may also be able to eliminate a parent if + // it does not contribute changes to us. Such a parent may be an + // uninteresting side branch. + // + final int[] chgs = new int[nParents]; + final int[] adds = new int[nParents]; + while (tw.next()) { + final int myMode = tw.getRawMode(nParents); + for (int i = 0; i < nParents; i++) { + final int pMode = tw.getRawMode(i); + if (myMode == pMode && tw.idEqual(i, nParents)) + continue; + + chgs[i]++; + if (pMode == 0 && myMode != 0) + adds[i]++; + } + } + + boolean same = false; + boolean diff = false; + for (int i = 0; i < nParents; i++) { + if (chgs[i] == 0) { + // No changes, so our tree is effectively the same as + // this parent tree. We pass the buck to only this one + // parent commit. + // + + final RevCommit p = pList[i]; + if ((p.flags & UNINTERESTING) != 0) { + // This parent was marked as not interesting by the + // application. We should look for another parent + // that is interesting. + // + same = true; + continue; + } + + c.flags |= rewriteFlag; + c.parents = new RevCommit[] { p }; + return false; + } + + if (chgs[i] == adds[i]) { + // All of the differences from this parent were because we + // added files that they did not have. This parent is our + // "empty tree root" and thus their history is not relevant. + // Cut our grandparents to be an empty list. + // + pList[i].parents = RevCommit.NO_PARENTS; + } + + // We have an interesting difference relative to this parent. + // + diff = true; + } + + if (diff && !same) { + // We did not abort above, so we are different in at least one + // way from all of our parents. We have to take the blame for + // that difference. + // + return true; + } + + // We are the same as all of our parents. We must keep them + // as they are and allow those parents to flow into pending + // for further scanning. + // + c.flags |= rewriteFlag; + return false; + } + + @Override + public boolean requiresCommitBody() { + return false; + } + + private void updateFollowFilter(ObjectId[] trees, DiffConfig cfg) + throws MissingObjectException, IncorrectObjectTypeException, + CorruptObjectException, IOException { + TreeWalk tw = pathFilter; + FollowFilter oldFilter = (FollowFilter) tw.getFilter(); + tw.setFilter(TreeFilter.ANY_DIFF); + tw.reset(trees); + + List files = DiffEntry.scan(tw); + RenameDetector rd = new RenameDetector(tw.getObjectReader(), cfg); + rd.addAll(files); + files = rd.compute(); + + TreeFilter newFilter = oldFilter; + for (DiffEntry ent : files) { + if (isRename(ent) && ent.getNewPath().equals(oldFilter.getPath())) { + newFilter = FollowFilter.create(ent.getOldPath(), cfg); + RenameCallback callback = oldFilter.getRenameCallback(); + if (callback != null) { + callback.renamed(ent); + // forward the callback to the new follow filter + ((FollowFilter) newFilter).setRenameCallback(callback); + } + break; + } + } + tw.setFilter(newFilter); + } + + private static boolean isRename(DiffEntry ent) { + return ent.getChangeType() == ChangeType.RENAME + || ent.getChangeType() == ChangeType.COPY; + } +}