You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

InterIndexDiffFilter.java 3.7KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105
  1. /*
  2. * Copyright (C) 2013, Robin Rosenberg <robin.rosenberg@dewire.com>
  3. * and other copyright owners as documented in the project's IP log.
  4. *
  5. * This program and the accompanying materials are made available
  6. * under the terms of the Eclipse Distribution License v1.0 which
  7. * accompanies this distribution, is reproduced below, and is
  8. * available at http://www.eclipse.org/org/documents/edl-v10.php
  9. *
  10. * All rights reserved.
  11. *
  12. * Redistribution and use in source and binary forms, with or
  13. * without modification, are permitted provided that the following
  14. * conditions are met:
  15. *
  16. * - Redistributions of source code must retain the above copyright
  17. * notice, this list of conditions and the following disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials provided
  22. * with the distribution.
  23. *
  24. * - Neither the name of the Eclipse Foundation, Inc. nor the
  25. * names of its contributors may be used to endorse or promote
  26. * products derived from this software without specific prior
  27. * written permission.
  28. *
  29. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  30. * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  31. * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  32. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  33. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  34. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  35. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  36. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  37. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  38. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  39. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  40. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  41. * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  42. */
  43. package org.eclipse.jgit.treewalk.filter;
  44. import org.eclipse.jgit.dircache.DirCacheEntry;
  45. import org.eclipse.jgit.dircache.DirCacheIterator;
  46. import org.eclipse.jgit.treewalk.TreeWalk;
  47. /**
  48. * A filter for extracting changes between two versions of the dircache. In
  49. * addition to what {@link TreeFilter#ANY_DIFF} would do, it also detects
  50. * changes that will affect decorations and show up in an attempt to commit.
  51. */
  52. public final class InterIndexDiffFilter extends TreeFilter {
  53. private static final int baseTree = 0;
  54. /**
  55. * Predefined InterIndexDiffFilter for finding changes between two dircaches
  56. */
  57. public static final TreeFilter INSTANCE = new InterIndexDiffFilter();
  58. @Override
  59. public boolean include(final TreeWalk walker) {
  60. final int n = walker.getTreeCount();
  61. if (n == 1) // Assume they meant difference to empty tree.
  62. return true;
  63. final int m = walker.getRawMode(baseTree);
  64. for (int i = 1; i < n; i++) {
  65. DirCacheIterator baseDirCache = walker.getTree(baseTree,
  66. DirCacheIterator.class);
  67. DirCacheIterator newDirCache = walker.getTree(i,
  68. DirCacheIterator.class);
  69. if (baseDirCache != null && newDirCache != null) {
  70. DirCacheEntry baseDci = baseDirCache.getDirCacheEntry();
  71. DirCacheEntry newDci = newDirCache.getDirCacheEntry();
  72. if (baseDci != null && newDci != null) {
  73. if (baseDci.isAssumeValid() != newDci.isAssumeValid())
  74. return true;
  75. if (baseDci.isAssumeValid()) // && newDci.isAssumeValid()
  76. return false;
  77. }
  78. }
  79. if (walker.getRawMode(i) != m || !walker.idEqual(i, baseTree))
  80. return true;
  81. }
  82. return false;
  83. }
  84. @Override
  85. public boolean shouldBeRecursive() {
  86. return false;
  87. }
  88. @Override
  89. public TreeFilter clone() {
  90. return this;
  91. }
  92. @Override
  93. public String toString() {
  94. return "INTERINDEX_DIFF"; //$NON-NLS-1$
  95. }
  96. }