tree.c: update read_tree_recursive callback to pass strbuf as base
[git/git.git] / builtin / ls-tree.c
CommitLineData
7912c070
PB
1/*
2 * GIT - The information manager from hell
3 *
4 * Copyright (C) Linus Torvalds, 2005
5 */
6#include "cache.h"
6af1f019
JH
7#include "blob.h"
8#include "tree.h"
f35a6d3b 9#include "commit.h"
22ddf719 10#include "quote.h"
aae01bda 11#include "builtin.h"
61fdbcf9 12#include "parse-options.h"
64acde94 13#include "pathspec.h"
7912c070 14
e99d59ff 15static int line_termination = '\n';
6af1f019
JH
16#define LS_RECURSIVE 1
17#define LS_TREE_ONLY 2
0f8f45cb 18#define LS_SHOW_TREES 4
c639a554 19#define LS_NAME_ONLY 8
a5bbda8b 20#define LS_SHOW_SIZE 16
96f1e58f
DR
21static int abbrev;
22static int ls_options;
f0096c06 23static struct pathspec pathspec;
96f1e58f 24static int chomp_prefix;
a633fca0 25static const char *ls_tree_prefix;
aa1c48df 26
61fdbcf9 27static const char * const ls_tree_usage[] = {
373f9221 28 N_("git ls-tree [<options>] <tree-ish> [<path>...]"),
61fdbcf9
SB
29 NULL
30};
0f8f45cb
LT
31
32static int show_recursive(const char *base, int baselen, const char *pathname)
33{
34 const char **s;
35
36 if (ls_options & LS_RECURSIVE)
37 return 1;
38
b3920bbd 39 s = pathspec._raw;
0f8f45cb
LT
40 if (!s)
41 return 0;
42
43 for (;;) {
44 const char *spec = *s++;
45 int len, speclen;
46
47 if (!spec)
48 return 0;
49 if (strncmp(base, spec, baselen))
50 continue;
51 len = strlen(pathname);
52 spec += baselen;
53 speclen = strlen(spec);
54 if (speclen <= len)
55 continue;
b294ed63
JH
56 if (spec[len] && spec[len] != '/')
57 continue;
0f8f45cb
LT
58 if (memcmp(pathname, spec, len))
59 continue;
60 return 1;
61 }
62}
aa1c48df 63
6a0b0b6d 64static int show_tree(const unsigned char *sha1, struct strbuf *base,
671f0707 65 const char *pathname, unsigned mode, int stage, void *context)
6af1f019 66{
0f8f45cb 67 int retval = 0;
8e440259 68 const char *type = blob_type;
ab1630a3 69
302b9282 70 if (S_ISGITLINK(mode)) {
f35a6d3b
LT
71 /*
72 * Maybe we want to have some recursive version here?
73 *
7d0b18a4 74 * Something similar to this incomplete example:
f35a6d3b 75 *
d3bee161
LH
76 if (show_subprojects(base, baselen, pathname))
77 retval = READ_TREE_RECURSIVE;
f35a6d3b 78 *
f35a6d3b
LT
79 */
80 type = commit_type;
81 } else if (S_ISDIR(mode)) {
6a0b0b6d 82 if (show_recursive(base->buf, base->len, pathname)) {
0f8f45cb
LT
83 retval = READ_TREE_RECURSIVE;
84 if (!(ls_options & LS_SHOW_TREES))
85 return retval;
e2466376 86 }
8e440259 87 type = tree_type;
6af1f019 88 }
f5984671
JH
89 else if (ls_options & LS_TREE_ONLY)
90 return 0;
ab1630a3 91
a69dd585 92 if (chomp_prefix &&
6a0b0b6d
NTND
93 (base->len < chomp_prefix ||
94 memcmp(ls_tree_prefix, base->buf, chomp_prefix)))
a69dd585
JH
95 return 0;
96
a5bbda8b
JN
97 if (!(ls_options & LS_NAME_ONLY)) {
98 if (ls_options & LS_SHOW_SIZE) {
e392a852 99 char size_text[24];
a5bbda8b 100 if (!strcmp(type, blob_type)) {
e392a852
AR
101 unsigned long size;
102 if (sha1_object_info(sha1, &size) == OBJ_BAD)
103 strcpy(size_text, "BAD");
104 else
105 snprintf(size_text, sizeof(size_text),
106 "%lu", size);
a5bbda8b 107 } else
e392a852
AR
108 strcpy(size_text, "-");
109 printf("%06o %s %s %7s\t", mode, type,
531e758d 110 find_unique_abbrev(sha1, abbrev),
e392a852 111 size_text);
a5bbda8b
JN
112 } else
113 printf("%06o %s %s\t", mode, type,
531e758d 114 find_unique_abbrev(sha1, abbrev));
a5bbda8b 115 }
6a0b0b6d 116 write_name_quotedpfx(base->buf + chomp_prefix, base->len - chomp_prefix,
663af342 117 pathname, stdout, line_termination);
0f8f45cb 118 return retval;
6af1f019 119}
0f2303f7 120
a633fca0 121int cmd_ls_tree(int argc, const char **argv, const char *prefix)
6af1f019 122{
7912c070 123 unsigned char sha1[20];
521698b1 124 struct tree *tree;
f0096c06 125 int i, full_tree = 0;
61fdbcf9 126 const struct option ls_tree_options[] = {
373f9221 127 OPT_BIT('d', NULL, &ls_options, N_("only show trees"),
61fdbcf9 128 LS_TREE_ONLY),
373f9221 129 OPT_BIT('r', NULL, &ls_options, N_("recurse into subtrees"),
61fdbcf9 130 LS_RECURSIVE),
373f9221 131 OPT_BIT('t', NULL, &ls_options, N_("show trees when recursing"),
61fdbcf9
SB
132 LS_SHOW_TREES),
133 OPT_SET_INT('z', NULL, &line_termination,
373f9221
NTND
134 N_("terminate entries with NUL byte"), 0),
135 OPT_BIT('l', "long", &ls_options, N_("include object size"),
61fdbcf9 136 LS_SHOW_SIZE),
373f9221 137 OPT_BIT(0, "name-only", &ls_options, N_("list only filenames"),
61fdbcf9 138 LS_NAME_ONLY),
373f9221 139 OPT_BIT(0, "name-status", &ls_options, N_("list only filenames"),
61fdbcf9
SB
140 LS_NAME_ONLY),
141 OPT_SET_INT(0, "full-name", &chomp_prefix,
373f9221 142 N_("use full path names"), 0),
d5d09d47
SB
143 OPT_BOOL(0, "full-tree", &full_tree,
144 N_("list entire tree; not just current directory "
145 "(implies --full-name)")),
61fdbcf9
SB
146 OPT__ABBREV(&abbrev),
147 OPT_END()
148 };
7912c070 149
ef90d6d4 150 git_config(git_default_config, NULL);
a633fca0 151 ls_tree_prefix = prefix;
a69dd585
JH
152 if (prefix && *prefix)
153 chomp_prefix = strlen(prefix);
61fdbcf9
SB
154
155 argc = parse_options(argc, argv, prefix, ls_tree_options,
156 ls_tree_usage, 0);
157 if (full_tree) {
158 ls_tree_prefix = prefix = NULL;
159 chomp_prefix = 0;
aa1c48df 160 }
f5984671
JH
161 /* -d -r should imply -t, but -d by itself should not have to. */
162 if ( (LS_TREE_ONLY|LS_RECURSIVE) ==
163 ((LS_TREE_ONLY|LS_RECURSIVE) & ls_options))
164 ls_options |= LS_SHOW_TREES;
aa1c48df 165
61fdbcf9
SB
166 if (argc < 1)
167 usage_with_options(ls_tree_usage, ls_tree_options);
168 if (get_sha1(argv[0], sha1))
169 die("Not a valid object name %s", argv[0]);
6af1f019 170
0fdc2ae5
NTND
171 /*
172 * show_recursive() rolls its own matching code and is
173 * generally ignorant of 'struct pathspec'. The magic mask
174 * cannot be lifted until it is converted to use
854b0959 175 * match_pathspec() or tree_entry_interesting()
0fdc2ae5 176 */
93d93537 177 parse_pathspec(&pathspec, PATHSPEC_GLOB | PATHSPEC_ICASE,
0fdc2ae5
NTND
178 PATHSPEC_PREFER_CWD,
179 prefix, argv + 1);
f0096c06 180 for (i = 0; i < pathspec.nr; i++)
170260ae 181 pathspec.items[i].nowildcard_len = pathspec.items[i].len;
33e0f62b 182 pathspec.has_wildcard = 0;
521698b1
DB
183 tree = parse_tree_indirect(sha1);
184 if (!tree)
3c5e8468 185 die("not a tree object");
04f89259 186 return !!read_tree_recursive(tree, "", 0, 0, &pathspec, show_tree, NULL);
7912c070 187}