Remove "pathlen" from "struct name_entry"
[git/git.git] / tree.c
CommitLineData
8f1d2e6f 1#include "cache.h"
175785e5
DB
2#include "tree.h"
3#include "blob.h"
77675e2a
DB
4#include "commit.h"
5#include "tag.h"
136f2e54 6#include "tree-walk.h"
175785e5
DB
7
8const char *tree_type = "tree";
9
3a7c352b 10static int read_one_entry(const unsigned char *sha1, const char *base, int baselen, const char *pathname, unsigned mode, int stage)
94537c78 11{
3c5e8468
LT
12 int len;
13 unsigned int size;
14 struct cache_entry *ce;
15
16 if (S_ISDIR(mode))
17 return READ_TREE_RECURSIVE;
18
19 len = strlen(pathname);
20 size = cache_entry_size(baselen + len);
90321c10 21 ce = xcalloc(1, size);
94537c78
LT
22
23 ce->ce_mode = create_ce_mode(mode);
24 ce->ce_flags = create_ce_flags(baselen + len, stage);
25 memcpy(ce->name, base, baselen);
26 memcpy(ce->name + baselen, pathname, len+1);
e702496e 27 hashcpy(ce->sha1, sha1);
b155725d 28 return add_cache_entry(ce, ADD_CACHE_OK_TO_ADD|ADD_CACHE_SKIP_DFCHECK);
94537c78
LT
29}
30
3e587635 31static int match_tree_entry(const char *base, int baselen, const char *path, unsigned int mode, const char **paths)
0ca14a57 32{
3e587635 33 const char *match;
0ca14a57
LT
34 int pathlen;
35
36 if (!paths)
37 return 1;
38 pathlen = strlen(path);
39 while ((match = *paths++) != NULL) {
40 int matchlen = strlen(match);
41
42 if (baselen >= matchlen) {
43 /* If it doesn't match, move along... */
44 if (strncmp(base, match, matchlen))
45 continue;
46 /* The base is a subdirectory of a path which was specified. */
47 return 1;
48 }
49
50 /* Does the base match? */
51 if (strncmp(base, match, baselen))
52 continue;
53
54 match += baselen;
55 matchlen -= baselen;
56
57 if (pathlen > matchlen)
58 continue;
59
60 if (matchlen > pathlen) {
61 if (match[pathlen] != '/')
62 continue;
63 if (!S_ISDIR(mode))
64 continue;
65 }
66
67 if (strncmp(path, match, pathlen))
68 continue;
3e587635
LT
69
70 return 1;
0ca14a57
LT
71 }
72 return 0;
73}
74
521698b1 75int read_tree_recursive(struct tree *tree,
3c5e8468
LT
76 const char *base, int baselen,
77 int stage, const char **match,
78 read_tree_fn_t fn)
94537c78 79{
0790a42a 80 struct tree_desc desc;
4c068a98 81 struct name_entry entry;
0790a42a 82
521698b1
DB
83 if (parse_tree(tree))
84 return -1;
0790a42a
LT
85
86 desc.buf = tree->buffer;
87 desc.size = tree->size;
88
4c068a98
LT
89 while (tree_entry(&desc, &entry)) {
90 if (!match_tree_entry(base, baselen, entry.path, entry.mode, match))
0ca14a57
LT
91 continue;
92
4c068a98 93 switch (fn(entry.sha1, base, baselen, entry.path, entry.mode, stage)) {
3c5e8468
LT
94 case 0:
95 continue;
96 case READ_TREE_RECURSIVE:
97 break;;
98 default:
99 return -1;
100 }
4c068a98 101 if (S_ISDIR(entry.mode)) {
94537c78 102 int retval;
1c9da46d 103 char *newbase;
a8c40471 104 unsigned int pathlen = tree_entry_len(entry.path, entry.sha1);
94537c78 105
a8c40471 106 newbase = xmalloc(baselen + 1 + pathlen);
94537c78 107 memcpy(newbase, base, baselen);
a8c40471
LT
108 memcpy(newbase + baselen, entry.path, pathlen);
109 newbase[baselen + pathlen] = '/';
4c068a98 110 retval = read_tree_recursive(lookup_tree(entry.sha1),
94537c78 111 newbase,
a8c40471 112 baselen + pathlen + 1,
3c5e8468 113 stage, match, fn);
94537c78
LT
114 free(newbase);
115 if (retval)
116 return -1;
117 continue;
118 }
94537c78
LT
119 }
120 return 0;
121}
122
521698b1 123int read_tree(struct tree *tree, int stage, const char **match)
94537c78 124{
521698b1 125 return read_tree_recursive(tree, "", 0, stage, match, read_one_entry);
94537c78
LT
126}
127
5d6ccf5c 128struct tree *lookup_tree(const unsigned char *sha1)
175785e5
DB
129{
130 struct object *obj = lookup_object(sha1);
131 if (!obj) {
855419f7 132 struct tree *ret = alloc_tree_node();
175785e5 133 created_object(sha1, &ret->object);
1974632c 134 ret->object.type = OBJ_TREE;
175785e5
DB
135 return ret;
136 }
d1af002d 137 if (!obj->type)
1974632c
LT
138 obj->type = OBJ_TREE;
139 if (obj->type != OBJ_TREE) {
885a86ab
LT
140 error("Object %s is a %s, not a tree",
141 sha1_to_hex(sha1), typename(obj->type));
175785e5
DB
142 return NULL;
143 }
144 return (struct tree *) obj;
145}
146
74b504f6 147static void track_tree_refs(struct tree *item)
175785e5 148{
2d9c58c6
LT
149 int n_refs = 0, i;
150 struct object_refs *refs;
136f2e54 151 struct tree_desc desc;
4c068a98 152 struct name_entry entry;
bd2c39f5 153
2d9c58c6
LT
154 /* Count how many entries there are.. */
155 desc.buf = item->buffer;
156 desc.size = item->size;
c711a214 157 while (tree_entry(&desc, &entry))
2d9c58c6 158 n_refs++;
2d9c58c6
LT
159
160 /* Allocate object refs and walk it again.. */
161 i = 0;
162 refs = alloc_object_refs(n_refs);
163 desc.buf = item->buffer;
164 desc.size = item->size;
4c068a98 165 while (tree_entry(&desc, &entry)) {
2d9c58c6
LT
166 struct object *obj;
167
4c068a98
LT
168 if (S_ISDIR(entry.mode))
169 obj = &lookup_tree(entry.sha1)->object;
2d9c58c6 170 else
4c068a98 171 obj = &lookup_blob(entry.sha1)->object;
2d9c58c6
LT
172 refs->ref[i++] = obj;
173 }
174 set_object_refs(&item->object, refs);
2d9c58c6
LT
175}
176
177int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size)
178{
175785e5
DB
179 if (item->object.parsed)
180 return 0;
181 item->object.parsed = 1;
136f2e54
LT
182 item->buffer = buffer;
183 item->size = size;
184
2d9c58c6
LT
185 if (track_object_refs)
186 track_tree_refs(item);
187 return 0;
188}
189
bd2c39f5
NP
190int parse_tree(struct tree *item)
191{
21666f1a 192 enum object_type type;
bd2c39f5
NP
193 void *buffer;
194 unsigned long size;
bd2c39f5
NP
195
196 if (item->object.parsed)
197 return 0;
21666f1a 198 buffer = read_sha1_file(item->object.sha1, &type, &size);
bd2c39f5
NP
199 if (!buffer)
200 return error("Could not read %s",
201 sha1_to_hex(item->object.sha1));
21666f1a 202 if (type != OBJ_TREE) {
bd2c39f5
NP
203 free(buffer);
204 return error("Object %s not a tree",
205 sha1_to_hex(item->object.sha1));
206 }
136f2e54 207 return parse_tree_buffer(item, buffer, size);
bd2c39f5 208}
77675e2a
DB
209
210struct tree *parse_tree_indirect(const unsigned char *sha1)
211{
212 struct object *obj = parse_object(sha1);
213 do {
214 if (!obj)
215 return NULL;
1974632c 216 if (obj->type == OBJ_TREE)
77675e2a 217 return (struct tree *) obj;
1974632c 218 else if (obj->type == OBJ_COMMIT)
77675e2a 219 obj = &(((struct commit *) obj)->tree->object);
1974632c 220 else if (obj->type == OBJ_TAG)
77675e2a
DB
221 obj = ((struct tag *) obj)->tagged;
222 else
223 return NULL;
224 if (!obj->parsed)
225 parse_object(obj->sha1);
226 } while (1);
227}