]>
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" |
7912c070 | 12 | |
e99d59ff | 13 | static int line_termination = '\n'; |
6af1f019 JH |
14 | #define LS_RECURSIVE 1 |
15 | #define LS_TREE_ONLY 2 | |
0f8f45cb | 16 | #define LS_SHOW_TREES 4 |
c639a554 | 17 | #define LS_NAME_ONLY 8 |
a5bbda8b | 18 | #define LS_SHOW_SIZE 16 |
96f1e58f DR |
19 | static int abbrev; |
20 | static int ls_options; | |
aae01bda | 21 | static const char **pathspec; |
96f1e58f | 22 | static int chomp_prefix; |
a633fca0 | 23 | static const char *ls_tree_prefix; |
aa1c48df | 24 | |
3c5e8468 | 25 | static const char ls_tree_usage[] = |
e1a59774 | 26 | "git ls-tree [-d] [-r] [-t] [-l] [-z] [--name-only] [--name-status] [--full-name] [--full-tree] [--abbrev[=<n>]] <tree-ish> [path...]"; |
0f8f45cb LT |
27 | |
28 | static int show_recursive(const char *base, int baselen, const char *pathname) | |
29 | { | |
30 | const char **s; | |
31 | ||
32 | if (ls_options & LS_RECURSIVE) | |
33 | return 1; | |
34 | ||
35 | s = pathspec; | |
36 | if (!s) | |
37 | return 0; | |
38 | ||
39 | for (;;) { | |
40 | const char *spec = *s++; | |
41 | int len, speclen; | |
42 | ||
43 | if (!spec) | |
44 | return 0; | |
45 | if (strncmp(base, spec, baselen)) | |
46 | continue; | |
47 | len = strlen(pathname); | |
48 | spec += baselen; | |
49 | speclen = strlen(spec); | |
50 | if (speclen <= len) | |
51 | continue; | |
52 | if (memcmp(pathname, spec, len)) | |
53 | continue; | |
54 | return 1; | |
55 | } | |
56 | } | |
aa1c48df | 57 | |
097dc3d8 | 58 | static int show_tree(const unsigned char *sha1, const char *base, int baselen, |
671f0707 | 59 | const char *pathname, unsigned mode, int stage, void *context) |
6af1f019 | 60 | { |
0f8f45cb | 61 | int retval = 0; |
8e440259 | 62 | const char *type = blob_type; |
a5bbda8b | 63 | unsigned long size; |
ab1630a3 | 64 | |
302b9282 | 65 | if (S_ISGITLINK(mode)) { |
f35a6d3b LT |
66 | /* |
67 | * Maybe we want to have some recursive version here? | |
68 | * | |
7d0b18a4 | 69 | * Something similar to this incomplete example: |
f35a6d3b | 70 | * |
d3bee161 LH |
71 | if (show_subprojects(base, baselen, pathname)) |
72 | retval = READ_TREE_RECURSIVE; | |
f35a6d3b | 73 | * |
f35a6d3b LT |
74 | */ |
75 | type = commit_type; | |
76 | } else if (S_ISDIR(mode)) { | |
0f8f45cb LT |
77 | if (show_recursive(base, baselen, pathname)) { |
78 | retval = READ_TREE_RECURSIVE; | |
79 | if (!(ls_options & LS_SHOW_TREES)) | |
80 | return retval; | |
e2466376 | 81 | } |
8e440259 | 82 | type = tree_type; |
6af1f019 | 83 | } |
f5984671 JH |
84 | else if (ls_options & LS_TREE_ONLY) |
85 | return 0; | |
ab1630a3 | 86 | |
a69dd585 | 87 | if (chomp_prefix && |
a633fca0 | 88 | (baselen < chomp_prefix || memcmp(ls_tree_prefix, base, chomp_prefix))) |
a69dd585 JH |
89 | return 0; |
90 | ||
a5bbda8b JN |
91 | if (!(ls_options & LS_NAME_ONLY)) { |
92 | if (ls_options & LS_SHOW_SIZE) { | |
93 | if (!strcmp(type, blob_type)) { | |
94 | sha1_object_info(sha1, &size); | |
95 | printf("%06o %s %s %7lu\t", mode, type, | |
96 | abbrev ? find_unique_abbrev(sha1, abbrev) | |
97 | : sha1_to_hex(sha1), | |
98 | size); | |
99 | } else | |
100 | printf("%06o %s %s %7c\t", mode, type, | |
101 | abbrev ? find_unique_abbrev(sha1, abbrev) | |
102 | : sha1_to_hex(sha1), | |
103 | '-'); | |
104 | } else | |
105 | printf("%06o %s %s\t", mode, type, | |
106 | abbrev ? find_unique_abbrev(sha1, abbrev) | |
107 | : sha1_to_hex(sha1)); | |
108 | } | |
663af342 PH |
109 | write_name_quotedpfx(base + chomp_prefix, baselen - chomp_prefix, |
110 | pathname, stdout, line_termination); | |
0f8f45cb | 111 | return retval; |
6af1f019 | 112 | } |
0f2303f7 | 113 | |
a633fca0 | 114 | int cmd_ls_tree(int argc, const char **argv, const char *prefix) |
6af1f019 | 115 | { |
7912c070 | 116 | unsigned char sha1[20]; |
521698b1 | 117 | struct tree *tree; |
7912c070 | 118 | |
ef90d6d4 | 119 | git_config(git_default_config, NULL); |
a633fca0 | 120 | ls_tree_prefix = prefix; |
a69dd585 JH |
121 | if (prefix && *prefix) |
122 | chomp_prefix = strlen(prefix); | |
aa1c48df JH |
123 | while (1 < argc && argv[1][0] == '-') { |
124 | switch (argv[1][1]) { | |
125 | case 'z': | |
126 | line_termination = 0; | |
127 | break; | |
128 | case 'r': | |
6af1f019 JH |
129 | ls_options |= LS_RECURSIVE; |
130 | break; | |
131 | case 'd': | |
132 | ls_options |= LS_TREE_ONLY; | |
aa1c48df | 133 | break; |
0f8f45cb LT |
134 | case 't': |
135 | ls_options |= LS_SHOW_TREES; | |
136 | break; | |
a5bbda8b JN |
137 | case 'l': |
138 | ls_options |= LS_SHOW_SIZE; | |
139 | break; | |
c639a554 JH |
140 | case '-': |
141 | if (!strcmp(argv[1]+2, "name-only") || | |
142 | !strcmp(argv[1]+2, "name-status")) { | |
143 | ls_options |= LS_NAME_ONLY; | |
144 | break; | |
145 | } | |
a5bbda8b JN |
146 | if (!strcmp(argv[1]+2, "long")) { |
147 | ls_options |= LS_SHOW_SIZE; | |
148 | break; | |
149 | } | |
a69dd585 JH |
150 | if (!strcmp(argv[1]+2, "full-name")) { |
151 | chomp_prefix = 0; | |
152 | break; | |
153 | } | |
d4789c60 JH |
154 | if (!strcmp(argv[1]+2, "full-tree")) { |
155 | ls_tree_prefix = prefix = NULL; | |
156 | chomp_prefix = 0; | |
157 | break; | |
158 | } | |
1968d77d | 159 | if (!prefixcmp(argv[1]+2, "abbrev=")) { |
cb85bfe5 EW |
160 | abbrev = strtoul(argv[1]+9, NULL, 10); |
161 | if (abbrev && abbrev < MINIMUM_ABBREV) | |
162 | abbrev = MINIMUM_ABBREV; | |
163 | else if (abbrev > 40) | |
164 | abbrev = 40; | |
165 | break; | |
166 | } | |
167 | if (!strcmp(argv[1]+2, "abbrev")) { | |
168 | abbrev = DEFAULT_ABBREV; | |
169 | break; | |
170 | } | |
c639a554 | 171 | /* otherwise fallthru */ |
aa1c48df | 172 | default: |
0f2303f7 | 173 | usage(ls_tree_usage); |
aa1c48df JH |
174 | } |
175 | argc--; argv++; | |
176 | } | |
f5984671 JH |
177 | /* -d -r should imply -t, but -d by itself should not have to. */ |
178 | if ( (LS_TREE_ONLY|LS_RECURSIVE) == | |
179 | ((LS_TREE_ONLY|LS_RECURSIVE) & ls_options)) | |
180 | ls_options |= LS_SHOW_TREES; | |
aa1c48df | 181 | |
6d3a5077 | 182 | if (argc < 2) |
0f2303f7 | 183 | usage(ls_tree_usage); |
31fff305 DL |
184 | if (get_sha1(argv[1], sha1)) |
185 | die("Not a valid object name %s", argv[1]); | |
6af1f019 | 186 | |
e2466376 | 187 | pathspec = get_pathspec(prefix, argv + 2); |
521698b1 DB |
188 | tree = parse_tree_indirect(sha1); |
189 | if (!tree) | |
3c5e8468 | 190 | die("not a tree object"); |
671f0707 | 191 | read_tree_recursive(tree, "", 0, 0, pathspec, show_tree, NULL); |
3c5e8468 | 192 | |
7912c070 PB |
193 | return 0; |
194 | } |