1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/*
* GIT - The information manager from hell
*
* Copyright (C) Linus Torvalds, 2005
*/
#include "cache.h"
static int line_termination = '\n';
static int recursive = 0;
struct path_prefix {
struct path_prefix *prev;
const char *name;
};
#define DEBUG(fmt, ...)
static int string_path_prefix(char *buff, size_t blen, struct path_prefix *prefix)
{
int len = 0;
if (prefix) {
if (prefix->prev) {
len = string_path_prefix(buff,blen,prefix->prev);
buff += len;
blen -= len;
if (blen > 0) {
*buff = '/';
len++;
buff++;
blen--;
}
}
strncpy(buff,prefix->name,blen);
return len + strlen(prefix->name);
}
return 0;
}
static void print_path_prefix(struct path_prefix *prefix)
{
if (prefix) {
if (prefix->prev) {
print_path_prefix(prefix->prev);
putchar('/');
}
fputs(prefix->name, stdout);
}
}
/*
* return:
* -1 if prefix is *not* a subset of path
* 0 if prefix == path
* 1 if prefix is a subset of path
*/
static int pathcmp(const char *path, struct path_prefix *prefix)
{
char buff[PATH_MAX];
int len,slen;
if (prefix == NULL)
return 1;
len = string_path_prefix(buff, sizeof buff, prefix);
slen = strlen(path);
if (slen < len)
return -1;
if (strncmp(path,buff,len) == 0) {
if (slen == len)
return 0;
else
return 1;
}
return -1;
}
/*
* match may be NULL, or a *sorted* list of paths
*/
static void list_recursive(void *buffer,
const char *type,
unsigned long size,
struct path_prefix *prefix,
char **match, int matches)
{
struct path_prefix this_prefix;
this_prefix.prev = prefix;
if (strcmp(type, "tree"))
die("expected a 'tree' node");
if (matches)
recursive = 1;
while (size) {
int namelen = strlen(buffer)+1;
void *eltbuf = NULL;
char elttype[20];
unsigned long eltsize;
unsigned char *sha1 = buffer + namelen;
char *path = strchr(buffer, ' ') + 1;
unsigned int mode;
const char *matched = NULL;
int mtype = -1;
int mindex;
if (size < namelen + 20 || sscanf(buffer, "%o", &mode) != 1)
die("corrupt 'tree' file");
buffer = sha1 + 20;
size -= namelen + 20;
this_prefix.name = path;
for ( mindex = 0; mindex < matches; mindex++) {
mtype = pathcmp(match[mindex],&this_prefix);
if (mtype >= 0) {
matched = match[mindex];
break;
}
}
/*
* If we're not matching, or if this is an exact match,
* print out the info
*/
if (!matches || (matched != NULL && mtype == 0)) {
printf("%06o\t%s\t%s\t", mode,
S_ISDIR(mode) ? "tree" : "blob",
sha1_to_hex(sha1));
print_path_prefix(&this_prefix);
putchar(line_termination);
}
if (! recursive || ! S_ISDIR(mode))
continue;
if (matches && ! matched)
continue;
if (! (eltbuf = read_sha1_file(sha1, elttype, &eltsize)) ) {
error("cannot read %s", sha1_to_hex(sha1));
continue;
}
/* If this is an exact directory match, we may have
* directory files following this path. Match on them.
* Otherwise, we're at a pach subcomponent, and we need
* to try to match again.
*/
if (mtype == 0)
mindex++;
list_recursive(eltbuf, elttype, eltsize, &this_prefix, &match[mindex], matches-mindex);
free(eltbuf);
}
}
static int qcmp(const void *a, const void *b)
{
return strcmp(*(char **)a, *(char **)b);
}
static int list(unsigned char *sha1,char **path)
{
void *buffer;
unsigned long size;
int npaths;
for (npaths = 0; path[npaths] != NULL; npaths++)
;
qsort(path,npaths,sizeof(char *),qcmp);
buffer = read_object_with_reference(sha1, "tree", &size, NULL);
if (!buffer)
die("unable to read sha1 file");
list_recursive(buffer, "tree", size, NULL, path, npaths);
free(buffer);
return 0;
}
static const char *ls_tree_usage = "git-ls-tree [-r] [-z] <key> [paths...]";
int main(int argc, char **argv)
{
unsigned char sha1[20];
while (1 < argc && argv[1][0] == '-') {
switch (argv[1][1]) {
case 'z':
line_termination = 0;
break;
case 'r':
recursive = 1;
break;
default:
usage(ls_tree_usage);
}
argc--; argv++;
}
if (argc < 2)
usage(ls_tree_usage);
if (get_sha1(argv[1], sha1) < 0)
usage(ls_tree_usage);
if (list(sha1, &argv[2]) < 0)
die("list failed");
return 0;
}
|
