Add option handler for RevTree values
[egit/zawir.git] / org.spearce.jgit.pgm / src / org / spearce / jgit / pgm / LsTree.java
bloba0a72161758e8f9fd34ccff8c4f360316d498f39
1 /*
2 * Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org>
4 * All rights reserved.
6 * Redistribution and use in source and binary forms, with or
7 * without modification, are permitted provided that the following
8 * conditions are met:
10 * - Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * - Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
18 * - Neither the name of the Git Development Community nor the
19 * names of its contributors may be used to endorse or promote
20 * products derived from this software without specific prior
21 * written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
24 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
25 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
26 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
28 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
29 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
30 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
31 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
32 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
33 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
35 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
38 package org.spearce.jgit.pgm;
40 import java.io.File;
42 import org.spearce.jgit.lib.Constants;
43 import org.spearce.jgit.lib.FileMode;
44 import org.spearce.jgit.treewalk.FileTreeIterator;
45 import org.spearce.jgit.treewalk.TreeWalk;
47 class LsTree extends TextBuiltin {
48 @Override
49 public void execute(final String[] args) throws Exception {
50 final TreeWalk walk = new TreeWalk(db);
51 int argi = 0;
52 for (; argi < args.length; argi++) {
53 final String a = args[argi];
54 if ("--".equals(a)) {
55 argi++;
56 break;
57 } else if ("-r".equals(a))
58 walk.setRecursive(true);
59 else
60 break;
63 if (argi == args.length)
64 throw die("usage: [-r] treename");
65 else if (argi + 1 < args.length)
66 throw die("too many arguments");
68 walk.reset(); // drop the first empty tree, which we do not need here
69 final String n = args[argi];
70 if (is_WorkDir(n))
71 walk.addTree(new FileTreeIterator(new File(n)));
72 else
73 walk.addTree(resolve(n));
75 while (walk.next()) {
76 final FileMode mode = walk.getFileMode(0);
77 if (mode == FileMode.TREE)
78 out.print('0');
79 out.print(mode);
80 out.print(' ');
81 out.print(Constants.typeString(mode.getObjectType()));
83 out.print(' ');
84 out.print(walk.getObjectId(0));
86 out.print('\t');
87 out.print(walk.getPathString());
88 out.println();
92 private boolean is_WorkDir(final String name) {
93 return new File(name).isDirectory();