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 2.6KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394
  1. /*
  2. * Copyright (C) 2008, Jonas Fonseca <fonseca@diku.dk>
  3. * Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org> and others
  4. *
  5. * This program and the accompanying materials are made available under the
  6. * terms of the Eclipse Distribution License v. 1.0 which is available at
  7. * https://www.eclipse.org/org/documents/edl-v10.php.
  8. *
  9. * SPDX-License-Identifier: BSD-3-Clause
  10. */
  11. package org.eclipse.jgit.pgm;
  12. import java.io.IOException;
  13. import java.util.ArrayList;
  14. import java.util.List;
  15. import org.eclipse.jgit.lib.FileMode;
  16. import org.eclipse.jgit.pgm.opt.PathTreeFilterHandler;
  17. import org.eclipse.jgit.treewalk.AbstractTreeIterator;
  18. import org.eclipse.jgit.treewalk.TreeWalk;
  19. import org.eclipse.jgit.treewalk.filter.AndTreeFilter;
  20. import org.eclipse.jgit.treewalk.filter.TreeFilter;
  21. import org.kohsuke.args4j.Argument;
  22. import org.kohsuke.args4j.Option;
  23. @Command(usage = "usage_ShowDiffTree")
  24. class DiffTree extends TextBuiltin {
  25. @Option(name = "--recursive", usage = "usage_recurseIntoSubtrees", aliases = { "-r" })
  26. private boolean recursive;
  27. @Argument(index = 0, metaVar = "metaVar_treeish", required = true)
  28. void tree_0(final AbstractTreeIterator c) {
  29. trees.add(c);
  30. }
  31. @Argument(index = 1, metaVar = "metaVar_treeish", required = true)
  32. private List<AbstractTreeIterator> trees = new ArrayList<>();
  33. @Option(name = "--", metaVar = "metaVar_path", handler = PathTreeFilterHandler.class)
  34. private TreeFilter pathFilter = TreeFilter.ALL;
  35. /** {@inheritDoc} */
  36. @Override
  37. protected void run() {
  38. try (TreeWalk walk = new TreeWalk(db)) {
  39. walk.setRecursive(recursive);
  40. for (AbstractTreeIterator i : trees)
  41. walk.addTree(i);
  42. walk.setFilter(AndTreeFilter.create(TreeFilter.ANY_DIFF, pathFilter));
  43. final int nTree = walk.getTreeCount();
  44. while (walk.next()) {
  45. for (int i = 1; i < nTree; i++) {
  46. outw.print(':');
  47. }
  48. for (int i = 0; i < nTree; i++) {
  49. final FileMode m = walk.getFileMode(i);
  50. final String s = m.toString();
  51. for (int pad = 6 - s.length(); pad > 0; pad--) {
  52. outw.print('0');
  53. }
  54. outw.print(s);
  55. outw.print(' ');
  56. }
  57. for (int i = 0; i < nTree; i++) {
  58. outw.print(walk.getObjectId(i).name());
  59. outw.print(' ');
  60. }
  61. char chg = 'M';
  62. if (nTree == 2) {
  63. final int m0 = walk.getRawMode(0);
  64. final int m1 = walk.getRawMode(1);
  65. if (m0 == 0 && m1 != 0) {
  66. chg = 'A';
  67. } else if (m0 != 0 && m1 == 0) {
  68. chg = 'D';
  69. } else if (m0 != m1 && walk.idEqual(0, 1)) {
  70. chg = 'T';
  71. }
  72. }
  73. outw.print(chg);
  74. outw.print('\t');
  75. outw.print(walk.getPathString());
  76. outw.println();
  77. }
  78. } catch (IOException e) {
  79. throw die(e.getMessage(), e);
  80. }
  81. }
  82. }