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.

DiffTree.java 4.1KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119
  1. /*
  2. * Copyright (C) 2008, Jonas Fonseca <fonseca@diku.dk>
  3. * Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org>
  4. * and other copyright owners as documented in the project's IP log.
  5. *
  6. * This program and the accompanying materials are made available
  7. * under the terms of the Eclipse Distribution License v1.0 which
  8. * accompanies this distribution, is reproduced below, and is
  9. * available at http://www.eclipse.org/org/documents/edl-v10.php
  10. *
  11. * All rights reserved.
  12. *
  13. * Redistribution and use in source and binary forms, with or
  14. * without modification, are permitted provided that the following
  15. * conditions are met:
  16. *
  17. * - Redistributions of source code must retain the above copyright
  18. * notice, this list of conditions and the following disclaimer.
  19. *
  20. * - Redistributions in binary form must reproduce the above
  21. * copyright notice, this list of conditions and the following
  22. * disclaimer in the documentation and/or other materials provided
  23. * with the distribution.
  24. *
  25. * - Neither the name of the Eclipse Foundation, Inc. nor the
  26. * names of its contributors may be used to endorse or promote
  27. * products derived from this software without specific prior
  28. * written permission.
  29. *
  30. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  31. * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  32. * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  33. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  34. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  35. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  36. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  37. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  38. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  39. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  40. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  41. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  42. * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  43. */
  44. package org.eclipse.jgit.pgm;
  45. import java.util.ArrayList;
  46. import java.util.List;
  47. import org.kohsuke.args4j.Argument;
  48. import org.kohsuke.args4j.Option;
  49. import org.eclipse.jgit.lib.FileMode;
  50. import org.eclipse.jgit.pgm.opt.PathTreeFilterHandler;
  51. import org.eclipse.jgit.treewalk.AbstractTreeIterator;
  52. import org.eclipse.jgit.treewalk.TreeWalk;
  53. import org.eclipse.jgit.treewalk.filter.AndTreeFilter;
  54. import org.eclipse.jgit.treewalk.filter.TreeFilter;
  55. class DiffTree extends TextBuiltin {
  56. @Option(name = "--recursive", usage = "recurse into subtrees", aliases = { "-r" })
  57. private boolean recursive;
  58. @Argument(index = 0, metaVar = "tree-ish", required = true)
  59. void tree_0(final AbstractTreeIterator c) {
  60. trees.add(c);
  61. }
  62. @Argument(index = 1, metaVar = "tree-ish", required = true)
  63. private final List<AbstractTreeIterator> trees = new ArrayList<AbstractTreeIterator>();
  64. @Option(name = "--", metaVar = "path", multiValued = true, handler = PathTreeFilterHandler.class)
  65. private TreeFilter pathFilter = TreeFilter.ALL;
  66. @Override
  67. protected void run() throws Exception {
  68. final TreeWalk walk = new TreeWalk(db);
  69. walk.reset();
  70. walk.setRecursive(recursive);
  71. for (final AbstractTreeIterator i : trees)
  72. walk.addTree(i);
  73. walk.setFilter(AndTreeFilter.create(TreeFilter.ANY_DIFF, pathFilter));
  74. final int nTree = walk.getTreeCount();
  75. while (walk.next()) {
  76. for (int i = 1; i < nTree; i++)
  77. out.print(':');
  78. for (int i = 0; i < nTree; i++) {
  79. final FileMode m = walk.getFileMode(i);
  80. final String s = m.toString();
  81. for (int pad = 6 - s.length(); pad > 0; pad--)
  82. out.print('0');
  83. out.print(s);
  84. out.print(' ');
  85. }
  86. for (int i = 0; i < nTree; i++) {
  87. out.print(walk.getObjectId(i).name());
  88. out.print(' ');
  89. }
  90. char chg = 'M';
  91. if (nTree == 2) {
  92. final int m0 = walk.getRawMode(0);
  93. final int m1 = walk.getRawMode(1);
  94. if (m0 == 0 && m1 != 0)
  95. chg = 'A';
  96. else if (m0 != 0 && m1 == 0)
  97. chg = 'D';
  98. else if (m0 != m1 && walk.idEqual(0, 1))
  99. chg = 'T';
  100. }
  101. out.print(chg);
  102. out.print('\t');
  103. out.print(walk.getPathString());
  104. out.println();
  105. }
  106. }
  107. }