View Javadoc
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  
45  package org.eclipse.jgit.pgm;
46  
47  import java.util.ArrayList;
48  import java.util.List;
49  
50  import org.eclipse.jgit.lib.FileMode;
51  import org.eclipse.jgit.pgm.opt.PathTreeFilterHandler;
52  import org.eclipse.jgit.treewalk.AbstractTreeIterator;
53  import org.eclipse.jgit.treewalk.TreeWalk;
54  import org.eclipse.jgit.treewalk.filter.AndTreeFilter;
55  import org.eclipse.jgit.treewalk.filter.TreeFilter;
56  import org.kohsuke.args4j.Argument;
57  import org.kohsuke.args4j.Option;
58  
59  @Command(usage = "usage_ShowDiffTree")
60  class DiffTree extends TextBuiltin {
61  	@Option(name = "--recursive", usage = "usage_recurseIntoSubtrees", aliases = { "-r" })
62  	private boolean recursive;
63  
64  	@Argument(index = 0, metaVar = "metaVar_treeish", required = true)
65  	void tree_0(final AbstractTreeIterator c) {
66  		trees.add(c);
67  	}
68  
69  	@Argument(index = 1, metaVar = "metaVar_treeish", required = true)
70  	private List<AbstractTreeIterator> trees = new ArrayList<>();
71  
72  	@Option(name = "--", metaVar = "metaVar_path", handler = PathTreeFilterHandler.class)
73  	private TreeFilter pathFilter = TreeFilter.ALL;
74  
75  	/** {@inheritDoc} */
76  	@Override
77  	protected void run() throws Exception {
78  		try (TreeWalk walk = new TreeWalk(db)) {
79  			walk.setRecursive(recursive);
80  			for (AbstractTreeIterator i : trees)
81  				walk.addTree(i);
82  			walk.setFilter(AndTreeFilter.create(TreeFilter.ANY_DIFF, pathFilter));
83  
84  			final int nTree = walk.getTreeCount();
85  			while (walk.next()) {
86  				for (int i = 1; i < nTree; i++)
87  					outw.print(':');
88  				for (int i = 0; i < nTree; i++) {
89  					final FileMode m = walk.getFileMode(i);
90  					final String s = m.toString();
91  					for (int pad = 6 - s.length(); pad > 0; pad--)
92  						outw.print('0');
93  					outw.print(s);
94  					outw.print(' ');
95  				}
96  
97  				for (int i = 0; i < nTree; i++) {
98  					outw.print(walk.getObjectId(i).name());
99  					outw.print(' ');
100 				}
101 
102 				char chg = 'M';
103 				if (nTree == 2) {
104 					final int m0 = walk.getRawMode(0);
105 					final int m1 = walk.getRawMode(1);
106 					if (m0 == 0 && m1 != 0)
107 						chg = 'A';
108 					else if (m0 != 0 && m1 == 0)
109 						chg = 'D';
110 					else if (m0 != m1 && walk.idEqual(0, 1))
111 						chg = 'T';
112 				}
113 				outw.print(chg);
114 
115 				outw.print('\t');
116 				outw.print(walk.getPathString());
117 				outw.println();
118 			}
119 		}
120 	}
121 }