]>
Commit | Line | Data |
---|---|---|
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 | 15 | static 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 |
21 | static int abbrev; |
22 | static int ls_options; | |
f0096c06 | 23 | static struct pathspec pathspec; |
96f1e58f | 24 | static int chomp_prefix; |
a633fca0 | 25 | static const char *ls_tree_prefix; |
aa1c48df | 26 | |
61fdbcf9 | 27 | static const char * const ls_tree_usage[] = { |
373f9221 | 28 | N_("git ls-tree [<options>] <tree-ish> [<path>...]"), |
61fdbcf9 SB |
29 | NULL |
30 | }; | |
0f8f45cb LT |
31 | |
32 | static 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 | |
097dc3d8 | 64 | static int show_tree(const unsigned char *sha1, const char *base, int baselen, |
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)) { | |
0f8f45cb LT |
82 | if (show_recursive(base, baselen, pathname)) { |
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 && |
a633fca0 | 93 | (baselen < chomp_prefix || memcmp(ls_tree_prefix, base, chomp_prefix))) |
a69dd585 JH |
94 | return 0; |
95 | ||
a5bbda8b JN |
96 | if (!(ls_options & LS_NAME_ONLY)) { |
97 | if (ls_options & LS_SHOW_SIZE) { | |
e392a852 | 98 | char size_text[24]; |
a5bbda8b | 99 | if (!strcmp(type, blob_type)) { |
e392a852 AR |
100 | unsigned long size; |
101 | if (sha1_object_info(sha1, &size) == OBJ_BAD) | |
102 | strcpy(size_text, "BAD"); | |
103 | else | |
104 | snprintf(size_text, sizeof(size_text), | |
105 | "%lu", size); | |
a5bbda8b | 106 | } else |
e392a852 AR |
107 | strcpy(size_text, "-"); |
108 | printf("%06o %s %s %7s\t", mode, type, | |
531e758d | 109 | find_unique_abbrev(sha1, abbrev), |
e392a852 | 110 | size_text); |
a5bbda8b JN |
111 | } else |
112 | printf("%06o %s %s\t", mode, type, | |
531e758d | 113 | find_unique_abbrev(sha1, abbrev)); |
a5bbda8b | 114 | } |
663af342 PH |
115 | write_name_quotedpfx(base + chomp_prefix, baselen - chomp_prefix, |
116 | pathname, stdout, line_termination); | |
0f8f45cb | 117 | return retval; |
6af1f019 | 118 | } |
0f2303f7 | 119 | |
a633fca0 | 120 | int cmd_ls_tree(int argc, const char **argv, const char *prefix) |
6af1f019 | 121 | { |
7912c070 | 122 | unsigned char sha1[20]; |
521698b1 | 123 | struct tree *tree; |
f0096c06 | 124 | int i, full_tree = 0; |
61fdbcf9 | 125 | const struct option ls_tree_options[] = { |
373f9221 | 126 | OPT_BIT('d', NULL, &ls_options, N_("only show trees"), |
61fdbcf9 | 127 | LS_TREE_ONLY), |
373f9221 | 128 | OPT_BIT('r', NULL, &ls_options, N_("recurse into subtrees"), |
61fdbcf9 | 129 | LS_RECURSIVE), |
373f9221 | 130 | OPT_BIT('t', NULL, &ls_options, N_("show trees when recursing"), |
61fdbcf9 SB |
131 | LS_SHOW_TREES), |
132 | OPT_SET_INT('z', NULL, &line_termination, | |
373f9221 NTND |
133 | N_("terminate entries with NUL byte"), 0), |
134 | OPT_BIT('l', "long", &ls_options, N_("include object size"), | |
61fdbcf9 | 135 | LS_SHOW_SIZE), |
373f9221 | 136 | OPT_BIT(0, "name-only", &ls_options, N_("list only filenames"), |
61fdbcf9 | 137 | LS_NAME_ONLY), |
373f9221 | 138 | OPT_BIT(0, "name-status", &ls_options, N_("list only filenames"), |
61fdbcf9 SB |
139 | LS_NAME_ONLY), |
140 | OPT_SET_INT(0, "full-name", &chomp_prefix, | |
373f9221 | 141 | N_("use full path names"), 0), |
d5d09d47 SB |
142 | OPT_BOOL(0, "full-tree", &full_tree, |
143 | N_("list entire tree; not just current directory " | |
144 | "(implies --full-name)")), | |
61fdbcf9 SB |
145 | OPT__ABBREV(&abbrev), |
146 | OPT_END() | |
147 | }; | |
7912c070 | 148 | |
ef90d6d4 | 149 | git_config(git_default_config, NULL); |
a633fca0 | 150 | ls_tree_prefix = prefix; |
a69dd585 JH |
151 | if (prefix && *prefix) |
152 | chomp_prefix = strlen(prefix); | |
61fdbcf9 SB |
153 | |
154 | argc = parse_options(argc, argv, prefix, ls_tree_options, | |
155 | ls_tree_usage, 0); | |
156 | if (full_tree) { | |
157 | ls_tree_prefix = prefix = NULL; | |
158 | chomp_prefix = 0; | |
aa1c48df | 159 | } |
f5984671 JH |
160 | /* -d -r should imply -t, but -d by itself should not have to. */ |
161 | if ( (LS_TREE_ONLY|LS_RECURSIVE) == | |
162 | ((LS_TREE_ONLY|LS_RECURSIVE) & ls_options)) | |
163 | ls_options |= LS_SHOW_TREES; | |
aa1c48df | 164 | |
61fdbcf9 SB |
165 | if (argc < 1) |
166 | usage_with_options(ls_tree_usage, ls_tree_options); | |
167 | if (get_sha1(argv[0], sha1)) | |
168 | die("Not a valid object name %s", argv[0]); | |
6af1f019 | 169 | |
0fdc2ae5 NTND |
170 | /* |
171 | * show_recursive() rolls its own matching code and is | |
172 | * generally ignorant of 'struct pathspec'. The magic mask | |
173 | * cannot be lifted until it is converted to use | |
854b0959 | 174 | * match_pathspec() or tree_entry_interesting() |
0fdc2ae5 | 175 | */ |
93d93537 | 176 | parse_pathspec(&pathspec, PATHSPEC_GLOB | PATHSPEC_ICASE, |
0fdc2ae5 NTND |
177 | PATHSPEC_PREFER_CWD, |
178 | prefix, argv + 1); | |
f0096c06 | 179 | for (i = 0; i < pathspec.nr; i++) |
170260ae | 180 | pathspec.items[i].nowildcard_len = pathspec.items[i].len; |
33e0f62b | 181 | pathspec.has_wildcard = 0; |
521698b1 DB |
182 | tree = parse_tree_indirect(sha1); |
183 | if (!tree) | |
3c5e8468 | 184 | die("not a tree object"); |
04f89259 | 185 | return !!read_tree_recursive(tree, "", 0, 0, &pathspec, show_tree, NULL); |
7912c070 | 186 | } |