]>
Commit | Line | Data |
---|---|---|
453ec4bd LT |
1 | /* |
2 | * This handles recursive filename detection with exclude | |
3 | * files, index knowledge etc.. | |
4 | * | |
95a68344 AS |
5 | * See Documentation/technical/api-directory-listing.txt |
6 | * | |
453ec4bd LT |
7 | * Copyright (C) Linus Torvalds, 2005-2006 |
8 | * Junio Hamano, 2005-2006 | |
9 | */ | |
453ec4bd | 10 | #include "cache.h" |
b2141fc1 | 11 | #include "config.h" |
453ec4bd | 12 | #include "dir.h" |
cbd53a21 | 13 | #include "object-store.h" |
b0db7046 | 14 | #include "attr.h" |
09595258 | 15 | #include "refs.h" |
237ec6e4 | 16 | #include "wildmatch.h" |
64acde94 | 17 | #include "pathspec.h" |
dde843e7 | 18 | #include "utf8.h" |
83c094ad NTND |
19 | #include "varint.h" |
20 | #include "ewah/ewok.h" | |
883e248b | 21 | #include "fsmonitor.h" |
da62f786 | 22 | #include "submodule-config.h" |
453ec4bd | 23 | |
defd7c7b KB |
24 | /* |
25 | * Tells read_directory_recursive how a file or directory should be treated. | |
26 | * Values are ordered by significance, e.g. if a directory contains both | |
27 | * excluded and untracked files, it is listed as untracked because | |
28 | * path_untracked > path_excluded. | |
29 | */ | |
30 | enum path_treatment { | |
31 | path_none = 0, | |
32 | path_recurse, | |
33 | path_excluded, | |
34 | path_untracked | |
35 | }; | |
36 | ||
cf7c6148 NTND |
37 | /* |
38 | * Support data structure for our opendir/readdir/closedir wrappers | |
39 | */ | |
40 | struct cached_dir { | |
41 | DIR *fdir; | |
42 | struct untracked_cache_dir *untracked; | |
91a2288b NTND |
43 | int nr_files; |
44 | int nr_dirs; | |
45 | ||
cf7c6148 | 46 | struct dirent *de; |
91a2288b NTND |
47 | const char *file; |
48 | struct untracked_cache_dir *ucd; | |
cf7c6148 NTND |
49 | }; |
50 | ||
defd7c7b | 51 | static enum path_treatment read_directory_recursive(struct dir_struct *dir, |
0ef8e169 BW |
52 | struct index_state *istate, const char *path, int len, |
53 | struct untracked_cache_dir *untracked, | |
5aaa7fd3 | 54 | int check_only, int stop_at_first_file, const struct pathspec *pathspec); |
98f2a687 BW |
55 | static int get_dtype(struct dirent *de, struct index_state *istate, |
56 | const char *path, int len); | |
09595258 | 57 | |
e0556a92 PC |
58 | int count_slashes(const char *s) |
59 | { | |
60 | int cnt = 0; | |
61 | while (*s) | |
62 | if (*s++ == '/') | |
63 | cnt++; | |
64 | return cnt; | |
65 | } | |
66 | ||
ba0897e6 | 67 | int fspathcmp(const char *a, const char *b) |
8cf2a84e JJ |
68 | { |
69 | return ignore_case ? strcasecmp(a, b) : strcmp(a, b); | |
70 | } | |
71 | ||
ba0897e6 | 72 | int fspathncmp(const char *a, const char *b, size_t count) |
8cf2a84e JJ |
73 | { |
74 | return ignore_case ? strncasecmp(a, b, count) : strncmp(a, b, count); | |
75 | } | |
76 | ||
1f26ce61 CB |
77 | int git_fnmatch(const struct pathspec_item *item, |
78 | const char *pattern, const char *string, | |
79 | int prefix) | |
5d74762d | 80 | { |
5d74762d | 81 | if (prefix > 0) { |
93d93537 | 82 | if (ps_strncmp(item, pattern, string, prefix)) |
eb07894f | 83 | return WM_NOMATCH; |
5d74762d NTND |
84 | pattern += prefix; |
85 | string += prefix; | |
86 | } | |
bd30c2e4 | 87 | if (item->flags & PATHSPEC_ONESTAR) { |
8c6abbcd NTND |
88 | int pattern_len = strlen(++pattern); |
89 | int string_len = strlen(string); | |
90 | return string_len < pattern_len || | |
93d93537 NTND |
91 | ps_strcmp(item, pattern, |
92 | string + string_len - pattern_len); | |
8c6abbcd | 93 | } |
bd30c2e4 | 94 | if (item->magic & PATHSPEC_GLOB) |
93d93537 NTND |
95 | return wildmatch(pattern, string, |
96 | WM_PATHNAME | | |
55d34269 | 97 | (item->magic & PATHSPEC_ICASE ? WM_CASEFOLD : 0)); |
bd30c2e4 NTND |
98 | else |
99 | /* wildmatch has not learned no FNM_PATHNAME mode yet */ | |
eb07894f | 100 | return wildmatch(pattern, string, |
55d34269 | 101 | item->magic & PATHSPEC_ICASE ? WM_CASEFOLD : 0); |
5d74762d NTND |
102 | } |
103 | ||
0b6e56df JH |
104 | static int fnmatch_icase_mem(const char *pattern, int patternlen, |
105 | const char *string, int stringlen, | |
106 | int flags) | |
107 | { | |
108 | int match_status; | |
109 | struct strbuf pat_buf = STRBUF_INIT; | |
110 | struct strbuf str_buf = STRBUF_INIT; | |
111 | const char *use_pat = pattern; | |
112 | const char *use_str = string; | |
113 | ||
114 | if (pattern[patternlen]) { | |
115 | strbuf_add(&pat_buf, pattern, patternlen); | |
116 | use_pat = pat_buf.buf; | |
117 | } | |
118 | if (string[stringlen]) { | |
119 | strbuf_add(&str_buf, string, stringlen); | |
120 | use_str = str_buf.buf; | |
121 | } | |
122 | ||
f30366b2 JH |
123 | if (ignore_case) |
124 | flags |= WM_CASEFOLD; | |
55d34269 | 125 | match_status = wildmatch(use_pat, use_str, flags); |
0b6e56df JH |
126 | |
127 | strbuf_release(&pat_buf); | |
128 | strbuf_release(&str_buf); | |
129 | ||
130 | return match_status; | |
131 | } | |
132 | ||
827f4d6c | 133 | static size_t common_prefix_len(const struct pathspec *pathspec) |
3c6a370b | 134 | { |
827f4d6c | 135 | int n; |
4a085b16 | 136 | size_t max = 0; |
3c6a370b | 137 | |
93d93537 NTND |
138 | /* |
139 | * ":(icase)path" is treated as a pathspec full of | |
140 | * wildcard. In other words, only prefix is considered common | |
141 | * prefix. If the pathspec is abc/foo abc/bar, running in | |
bbbb6b0b | 142 | * subdir xyz, the common prefix is still xyz, not xyz/abc as |
93d93537 NTND |
143 | * in non-:(icase). |
144 | */ | |
5c6933d2 NTND |
145 | GUARD_PATHSPEC(pathspec, |
146 | PATHSPEC_FROMTOP | | |
147 | PATHSPEC_MAXDEPTH | | |
bd30c2e4 | 148 | PATHSPEC_LITERAL | |
93d93537 | 149 | PATHSPEC_GLOB | |
ef79b1f8 | 150 | PATHSPEC_ICASE | |
b0db7046 BW |
151 | PATHSPEC_EXCLUDE | |
152 | PATHSPEC_ATTR); | |
4a085b16 | 153 | |
827f4d6c | 154 | for (n = 0; n < pathspec->nr; n++) { |
93d93537 | 155 | size_t i = 0, len = 0, item_len; |
ef79b1f8 NTND |
156 | if (pathspec->items[n].magic & PATHSPEC_EXCLUDE) |
157 | continue; | |
93d93537 NTND |
158 | if (pathspec->items[n].magic & PATHSPEC_ICASE) |
159 | item_len = pathspec->items[n].prefix; | |
160 | else | |
161 | item_len = pathspec->items[n].nowildcard_len; | |
162 | while (i < item_len && (n == 0 || i < max)) { | |
827f4d6c NTND |
163 | char c = pathspec->items[n].match[i]; |
164 | if (c != pathspec->items[0].match[i]) | |
4a085b16 JH |
165 | break; |
166 | if (c == '/') | |
167 | len = i + 1; | |
827f4d6c | 168 | i++; |
4a085b16 | 169 | } |
827f4d6c | 170 | if (n == 0 || len < max) { |
4a085b16 JH |
171 | max = len; |
172 | if (!max) | |
173 | break; | |
174 | } | |
3c6a370b | 175 | } |
4a085b16 | 176 | return max; |
3c6a370b LT |
177 | } |
178 | ||
f950eb95 CB |
179 | /* |
180 | * Returns a copy of the longest leading path common among all | |
181 | * pathspecs. | |
182 | */ | |
827f4d6c | 183 | char *common_prefix(const struct pathspec *pathspec) |
f950eb95 CB |
184 | { |
185 | unsigned long len = common_prefix_len(pathspec); | |
186 | ||
827f4d6c | 187 | return len ? xmemdupz(pathspec->items[0].match, len) : NULL; |
f950eb95 CB |
188 | } |
189 | ||
0d32c183 BW |
190 | int fill_directory(struct dir_struct *dir, |
191 | struct index_state *istate, | |
192 | const struct pathspec *pathspec) | |
1d8842d9 | 193 | { |
bec5ab89 | 194 | const char *prefix; |
966de302 | 195 | size_t prefix_len; |
1d8842d9 LT |
196 | |
197 | /* | |
198 | * Calculate common prefix for the pathspec, and | |
199 | * use that to optimize the directory walk | |
200 | */ | |
bec5ab89 RS |
201 | prefix_len = common_prefix_len(pathspec); |
202 | prefix = prefix_len ? pathspec->items[0].match : ""; | |
1d8842d9 LT |
203 | |
204 | /* Read the directory and prune it */ | |
0d32c183 | 205 | read_directory(dir, istate, prefix, prefix_len, pathspec); |
966de302 | 206 | |
966de302 | 207 | return prefix_len; |
1d8842d9 LT |
208 | } |
209 | ||
bc96cc87 NTND |
210 | int within_depth(const char *name, int namelen, |
211 | int depth, int max_depth) | |
212 | { | |
213 | const char *cp = name, *cpe = name + namelen; | |
214 | ||
215 | while (cp < cpe) { | |
216 | if (*cp++ != '/') | |
217 | continue; | |
218 | depth++; | |
219 | if (depth > max_depth) | |
220 | return 0; | |
221 | } | |
222 | return 1; | |
223 | } | |
224 | ||
578d81d0 JH |
225 | /* |
226 | * Read the contents of the blob with the given OID into a buffer. | |
227 | * Append a trailing LF to the end if the last line doesn't have one. | |
228 | * | |
229 | * Returns: | |
230 | * -1 when the OID is invalid or unknown or does not refer to a blob. | |
231 | * 0 when the blob is empty. | |
232 | * 1 along with { data, size } of the (possibly augmented) buffer | |
233 | * when successful. | |
234 | * | |
4b33e602 | 235 | * Optionally updates the given oid_stat with the given OID (when valid). |
578d81d0 | 236 | */ |
4b33e602 PO |
237 | static int do_read_blob(const struct object_id *oid, struct oid_stat *oid_stat, |
238 | size_t *size_out, char **data_out) | |
578d81d0 JH |
239 | { |
240 | enum object_type type; | |
241 | unsigned long sz; | |
242 | char *data; | |
243 | ||
244 | *size_out = 0; | |
245 | *data_out = NULL; | |
246 | ||
b4f5aca4 | 247 | data = read_object_file(oid, &type, &sz); |
578d81d0 JH |
248 | if (!data || type != OBJ_BLOB) { |
249 | free(data); | |
250 | return -1; | |
251 | } | |
252 | ||
4b33e602 PO |
253 | if (oid_stat) { |
254 | memset(&oid_stat->stat, 0, sizeof(oid_stat->stat)); | |
255 | oidcpy(&oid_stat->oid, oid); | |
578d81d0 JH |
256 | } |
257 | ||
258 | if (sz == 0) { | |
259 | free(data); | |
260 | return 0; | |
261 | } | |
262 | ||
263 | if (data[sz - 1] != '\n') { | |
264 | data = xrealloc(data, st_add(sz, 1)); | |
265 | data[sz++] = '\n'; | |
266 | } | |
267 | ||
268 | *size_out = xsize_t(sz); | |
269 | *data_out = data; | |
270 | ||
271 | return 1; | |
272 | } | |
273 | ||
75a6315f BW |
274 | #define DO_MATCH_EXCLUDE (1<<0) |
275 | #define DO_MATCH_DIRECTORY (1<<1) | |
a3d89d8f | 276 | #define DO_MATCH_LEADING_PATHSPEC (1<<2) |
42b0874a | 277 | |
61cf2820 | 278 | /* |
29b577b9 | 279 | * Does the given pathspec match the given name? A match is found if |
61cf2820 | 280 | * |
29b577b9 EN |
281 | * (1) the pathspec string is leading directory of 'name' ("RECURSIVELY"), or |
282 | * (2) the pathspec string has a leading part matching 'name' ("LEADING"), or | |
283 | * (3) the pathspec string is a wildcard and matches 'name' ("WILDCARD"), or | |
284 | * (4) the pathspec string is exactly the same as 'name' ("EXACT"). | |
61cf2820 | 285 | * |
29b577b9 | 286 | * Return value tells which case it was (1-4), or 0 when there is no match. |
61cf2820 | 287 | * |
29b577b9 EN |
288 | * It may be instructive to look at a small table of concrete examples |
289 | * to understand the differences between 1, 2, and 4: | |
290 | * | |
291 | * Pathspecs | |
292 | * | a/b | a/b/ | a/b/c | |
293 | * ------+-----------+-----------+------------ | |
294 | * a/b | EXACT | EXACT[1] | LEADING[2] | |
295 | * Names a/b/ | RECURSIVE | EXACT | LEADING[2] | |
296 | * a/b/c | RECURSIVE | RECURSIVE | EXACT | |
297 | * | |
298 | * [1] Only if DO_MATCH_DIRECTORY is passed; otherwise, this is NOT a match. | |
299 | * [2] Only if DO_MATCH_LEADING_PATHSPEC is passed; otherwise, not a match. | |
61cf2820 | 300 | */ |
6d2df284 NTND |
301 | static int match_pathspec_item(const struct index_state *istate, |
302 | const struct pathspec_item *item, int prefix, | |
42b0874a | 303 | const char *name, int namelen, unsigned flags) |
61cf2820 NTND |
304 | { |
305 | /* name/namelen has prefix cut off by caller */ | |
306 | const char *match = item->match + prefix; | |
307 | int matchlen = item->len - prefix; | |
308 | ||
93d93537 NTND |
309 | /* |
310 | * The normal call pattern is: | |
311 | * 1. prefix = common_prefix_len(ps); | |
312 | * 2. prune something, or fill_directory | |
854b0959 | 313 | * 3. match_pathspec() |
93d93537 NTND |
314 | * |
315 | * 'prefix' at #1 may be shorter than the command's prefix and | |
316 | * it's ok for #2 to match extra files. Those extras will be | |
317 | * trimmed at #3. | |
318 | * | |
319 | * Suppose the pathspec is 'foo' and '../bar' running from | |
320 | * subdir 'xyz'. The common prefix at #1 will be empty, thanks | |
321 | * to "../". We may have xyz/foo _and_ XYZ/foo after #2. The | |
322 | * user does not want XYZ/foo, only the "foo" part should be | |
323 | * case-insensitive. We need to filter out XYZ/foo here. In | |
324 | * other words, we do not trust the caller on comparing the | |
325 | * prefix part when :(icase) is involved. We do exact | |
326 | * comparison ourselves. | |
327 | * | |
328 | * Normally the caller (common_prefix_len() in fact) does | |
329 | * _exact_ matching on name[-prefix+1..-1] and we do not need | |
330 | * to check that part. Be defensive and check it anyway, in | |
331 | * case common_prefix_len is changed, or a new caller is | |
332 | * introduced that does not use common_prefix_len. | |
333 | * | |
334 | * If the penalty turns out too high when prefix is really | |
335 | * long, maybe change it to | |
336 | * strncmp(match, name, item->prefix - prefix) | |
337 | */ | |
338 | if (item->prefix && (item->magic & PATHSPEC_ICASE) && | |
339 | strncmp(item->match, name - prefix, item->prefix)) | |
340 | return 0; | |
341 | ||
22af33be NTND |
342 | if (item->attr_match_nr && |
343 | !match_pathspec_attrs(istate, name, namelen, item)) | |
b0db7046 BW |
344 | return 0; |
345 | ||
61cf2820 NTND |
346 | /* If the match was just the prefix, we matched */ |
347 | if (!*match) | |
348 | return MATCHED_RECURSIVELY; | |
349 | ||
93d93537 | 350 | if (matchlen <= namelen && !ps_strncmp(item, match, name, matchlen)) { |
61cf2820 NTND |
351 | if (matchlen == namelen) |
352 | return MATCHED_EXACTLY; | |
353 | ||
354 | if (match[matchlen-1] == '/' || name[matchlen] == '/') | |
355 | return MATCHED_RECURSIVELY; | |
68690fdd NTND |
356 | } else if ((flags & DO_MATCH_DIRECTORY) && |
357 | match[matchlen - 1] == '/' && | |
358 | namelen == matchlen - 1 && | |
359 | !ps_strncmp(item, match, name, namelen)) | |
360 | return MATCHED_EXACTLY; | |
61cf2820 | 361 | |
5d74762d | 362 | if (item->nowildcard_len < item->len && |
bd30c2e4 | 363 | !git_fnmatch(item, match, name, |
8c6abbcd | 364 | item->nowildcard_len - prefix)) |
61cf2820 NTND |
365 | return MATCHED_FNMATCH; |
366 | ||
29b577b9 | 367 | /* Perform checks to see if "name" is a leading string of the pathspec */ |
a3d89d8f | 368 | if (flags & DO_MATCH_LEADING_PATHSPEC) { |
75a6315f | 369 | /* name is a literal prefix of the pathspec */ |
a5e916c7 | 370 | int offset = name[namelen-1] == '/' ? 1 : 0; |
75a6315f | 371 | if ((namelen < matchlen) && |
a5e916c7 | 372 | (match[namelen-offset] == '/') && |
75a6315f | 373 | !ps_strncmp(item, match, name, namelen)) |
89a1f4aa | 374 | return MATCHED_RECURSIVELY_LEADING_PATHSPEC; |
75a6315f | 375 | |
2f5d3847 | 376 | /* name doesn't match up to the first wild character */ |
75a6315f BW |
377 | if (item->nowildcard_len < item->len && |
378 | ps_strncmp(item, match, name, | |
379 | item->nowildcard_len - prefix)) | |
380 | return 0; | |
381 | ||
072a2310 EN |
382 | /* |
383 | * name has no wildcard, and it didn't match as a leading | |
384 | * pathspec so return. | |
385 | */ | |
386 | if (item->nowildcard_len == item->len) | |
387 | return 0; | |
388 | ||
75a6315f BW |
389 | /* |
390 | * Here is where we would perform a wildmatch to check if | |
391 | * "name" can be matched as a directory (or a prefix) against | |
392 | * the pathspec. Since wildmatch doesn't have this capability | |
393 | * at the present we have to punt and say that it is a match, | |
394 | * potentially returning a false positive | |
395 | * The submodules themselves will be able to perform more | |
396 | * accurate matching to determine if the pathspec matches. | |
397 | */ | |
89a1f4aa | 398 | return MATCHED_RECURSIVELY_LEADING_PATHSPEC; |
75a6315f BW |
399 | } |
400 | ||
61cf2820 NTND |
401 | return 0; |
402 | } | |
403 | ||
404 | /* | |
52ed1894 AS |
405 | * Given a name and a list of pathspecs, returns the nature of the |
406 | * closest (i.e. most specific) match of the name to any of the | |
407 | * pathspecs. | |
408 | * | |
409 | * The caller typically calls this multiple times with the same | |
410 | * pathspec and seen[] array but with different name/namelen | |
411 | * (e.g. entries from the index) and is interested in seeing if and | |
412 | * how each pathspec matches all the names it calls this function | |
413 | * with. A mark is left in the seen[] array for each pathspec element | |
414 | * indicating the closest type of match that element achieved, so if | |
415 | * seen[n] remains zero after multiple invocations, that means the nth | |
416 | * pathspec did not match any names, which could indicate that the | |
417 | * user mistyped the nth pathspec. | |
61cf2820 | 418 | */ |
6d2df284 NTND |
419 | static int do_match_pathspec(const struct index_state *istate, |
420 | const struct pathspec *ps, | |
854b0959 NTND |
421 | const char *name, int namelen, |
422 | int prefix, char *seen, | |
42b0874a | 423 | unsigned flags) |
61cf2820 | 424 | { |
42b0874a | 425 | int i, retval = 0, exclude = flags & DO_MATCH_EXCLUDE; |
61cf2820 | 426 | |
5c6933d2 NTND |
427 | GUARD_PATHSPEC(ps, |
428 | PATHSPEC_FROMTOP | | |
429 | PATHSPEC_MAXDEPTH | | |
bd30c2e4 | 430 | PATHSPEC_LITERAL | |
93d93537 | 431 | PATHSPEC_GLOB | |
ef79b1f8 | 432 | PATHSPEC_ICASE | |
b0db7046 BW |
433 | PATHSPEC_EXCLUDE | |
434 | PATHSPEC_ATTR); | |
8f4f8f45 | 435 | |
61cf2820 | 436 | if (!ps->nr) { |
6330a171 NTND |
437 | if (!ps->recursive || |
438 | !(ps->magic & PATHSPEC_MAXDEPTH) || | |
439 | ps->max_depth == -1) | |
61cf2820 NTND |
440 | return MATCHED_RECURSIVELY; |
441 | ||
442 | if (within_depth(name, namelen, 0, ps->max_depth)) | |
443 | return MATCHED_EXACTLY; | |
444 | else | |
445 | return 0; | |
446 | } | |
447 | ||
448 | name += prefix; | |
449 | namelen -= prefix; | |
450 | ||
451 | for (i = ps->nr - 1; i >= 0; i--) { | |
452 | int how; | |
ef79b1f8 NTND |
453 | |
454 | if ((!exclude && ps->items[i].magic & PATHSPEC_EXCLUDE) || | |
455 | ( exclude && !(ps->items[i].magic & PATHSPEC_EXCLUDE))) | |
456 | continue; | |
457 | ||
61cf2820 NTND |
458 | if (seen && seen[i] == MATCHED_EXACTLY) |
459 | continue; | |
ef79b1f8 NTND |
460 | /* |
461 | * Make exclude patterns optional and never report | |
462 | * "pathspec ':(exclude)foo' matches no files" | |
463 | */ | |
464 | if (seen && ps->items[i].magic & PATHSPEC_EXCLUDE) | |
465 | seen[i] = MATCHED_FNMATCH; | |
6d2df284 | 466 | how = match_pathspec_item(istate, ps->items+i, prefix, name, |
42b0874a | 467 | namelen, flags); |
6330a171 NTND |
468 | if (ps->recursive && |
469 | (ps->magic & PATHSPEC_MAXDEPTH) && | |
470 | ps->max_depth != -1 && | |
61cf2820 NTND |
471 | how && how != MATCHED_FNMATCH) { |
472 | int len = ps->items[i].len; | |
473 | if (name[len] == '/') | |
474 | len++; | |
475 | if (within_depth(name+len, namelen-len, 0, ps->max_depth)) | |
476 | how = MATCHED_EXACTLY; | |
477 | else | |
478 | how = 0; | |
479 | } | |
480 | if (how) { | |
481 | if (retval < how) | |
482 | retval = how; | |
483 | if (seen && seen[i] < how) | |
484 | seen[i] = how; | |
485 | } | |
486 | } | |
487 | return retval; | |
488 | } | |
489 | ||
6d2df284 NTND |
490 | int match_pathspec(const struct index_state *istate, |
491 | const struct pathspec *ps, | |
854b0959 | 492 | const char *name, int namelen, |
ae8d0824 | 493 | int prefix, char *seen, int is_dir) |
ef79b1f8 NTND |
494 | { |
495 | int positive, negative; | |
ae8d0824 | 496 | unsigned flags = is_dir ? DO_MATCH_DIRECTORY : 0; |
6d2df284 | 497 | positive = do_match_pathspec(istate, ps, name, namelen, |
42b0874a | 498 | prefix, seen, flags); |
ef79b1f8 NTND |
499 | if (!(ps->magic & PATHSPEC_EXCLUDE) || !positive) |
500 | return positive; | |
6d2df284 | 501 | negative = do_match_pathspec(istate, ps, name, namelen, |
42b0874a NTND |
502 | prefix, seen, |
503 | flags | DO_MATCH_EXCLUDE); | |
ef79b1f8 NTND |
504 | return negative ? 0 : positive; |
505 | } | |
506 | ||
75a6315f BW |
507 | /** |
508 | * Check if a submodule is a superset of the pathspec | |
509 | */ | |
6d2df284 NTND |
510 | int submodule_path_match(const struct index_state *istate, |
511 | const struct pathspec *ps, | |
75a6315f BW |
512 | const char *submodule_name, |
513 | char *seen) | |
514 | { | |
6d2df284 | 515 | int matched = do_match_pathspec(istate, ps, submodule_name, |
75a6315f BW |
516 | strlen(submodule_name), |
517 | 0, seen, | |
518 | DO_MATCH_DIRECTORY | | |
a3d89d8f | 519 | DO_MATCH_LEADING_PATHSPEC); |
75a6315f BW |
520 | return matched; |
521 | } | |
522 | ||
777c55a6 | 523 | int report_path_error(const char *ps_matched, |
c5c33504 | 524 | const struct pathspec *pathspec) |
777c55a6 JH |
525 | { |
526 | /* | |
527 | * Make sure all pathspec matched; otherwise it is an error. | |
528 | */ | |
777c55a6 JH |
529 | int num, errors = 0; |
530 | for (num = 0; num < pathspec->nr; num++) { | |
531 | int other, found_dup; | |
532 | ||
533 | if (ps_matched[num]) | |
534 | continue; | |
535 | /* | |
536 | * The caller might have fed identical pathspec | |
537 | * twice. Do not barf on such a mistake. | |
538 | * FIXME: parse_pathspec should have eliminated | |
539 | * duplicate pathspec. | |
540 | */ | |
541 | for (found_dup = other = 0; | |
542 | !found_dup && other < pathspec->nr; | |
543 | other++) { | |
544 | if (other == num || !ps_matched[other]) | |
545 | continue; | |
546 | if (!strcmp(pathspec->items[other].original, | |
547 | pathspec->items[num].original)) | |
548 | /* | |
549 | * Ok, we have a match already. | |
550 | */ | |
551 | found_dup = 1; | |
552 | } | |
553 | if (found_dup) | |
554 | continue; | |
555 | ||
a80897c1 | 556 | error(_("pathspec '%s' did not match any file(s) known to git"), |
777c55a6 JH |
557 | pathspec->items[num].original); |
558 | errors++; | |
559 | } | |
777c55a6 JH |
560 | return errors; |
561 | } | |
562 | ||
fcd631ed NTND |
563 | /* |
564 | * Return the length of the "simple" part of a path match limiter. | |
565 | */ | |
87323bda | 566 | int simple_length(const char *match) |
fcd631ed NTND |
567 | { |
568 | int len = -1; | |
569 | ||
570 | for (;;) { | |
571 | unsigned char c = *match++; | |
572 | len++; | |
573 | if (c == '\0' || is_glob_special(c)) | |
574 | return len; | |
575 | } | |
576 | } | |
577 | ||
87323bda | 578 | int no_wildcard(const char *string) |
68492fc7 | 579 | { |
fcd631ed | 580 | return string[simple_length(string)] == '\0'; |
68492fc7 LK |
581 | } |
582 | ||
65edd96a | 583 | void parse_path_pattern(const char **pattern, |
82dce998 | 584 | int *patternlen, |
f8708998 | 585 | unsigned *flags, |
82dce998 | 586 | int *nowildcardlen) |
84460eec NTND |
587 | { |
588 | const char *p = *pattern; | |
589 | size_t i, len; | |
590 | ||
591 | *flags = 0; | |
592 | if (*p == '!') { | |
4ff89ee5 | 593 | *flags |= PATTERN_FLAG_NEGATIVE; |
84460eec NTND |
594 | p++; |
595 | } | |
596 | len = strlen(p); | |
597 | if (len && p[len - 1] == '/') { | |
598 | len--; | |
4ff89ee5 | 599 | *flags |= PATTERN_FLAG_MUSTBEDIR; |
84460eec NTND |
600 | } |
601 | for (i = 0; i < len; i++) { | |
602 | if (p[i] == '/') | |
603 | break; | |
604 | } | |
605 | if (i == len) | |
4ff89ee5 | 606 | *flags |= PATTERN_FLAG_NODIR; |
84460eec NTND |
607 | *nowildcardlen = simple_length(p); |
608 | /* | |
609 | * we should have excluded the trailing slash from 'p' too, | |
610 | * but that's one more allocation. Instead just make sure | |
611 | * nowildcardlen does not exceed real patternlen | |
612 | */ | |
613 | if (*nowildcardlen > len) | |
614 | *nowildcardlen = len; | |
615 | if (*p == '*' && no_wildcard(p + 1)) | |
4ff89ee5 | 616 | *flags |= PATTERN_FLAG_ENDSWITH; |
84460eec NTND |
617 | *pattern = p; |
618 | *patternlen = len; | |
619 | } | |
620 | ||
65edd96a | 621 | void add_pattern(const char *string, const char *base, |
caa3d554 | 622 | int baselen, struct pattern_list *pl, int srcpos) |
453ec4bd | 623 | { |
ab8db613 | 624 | struct path_pattern *pattern; |
84460eec | 625 | int patternlen; |
f8708998 | 626 | unsigned flags; |
84460eec | 627 | int nowildcardlen; |
453ec4bd | 628 | |
65edd96a | 629 | parse_path_pattern(&string, &patternlen, &flags, &nowildcardlen); |
4ff89ee5 | 630 | if (flags & PATTERN_FLAG_MUSTBEDIR) { |
ab8db613 | 631 | FLEXPTR_ALLOC_MEM(pattern, pattern, string, patternlen); |
d6b8fc30 | 632 | } else { |
ab8db613 DS |
633 | pattern = xmalloc(sizeof(*pattern)); |
634 | pattern->pattern = string; | |
d6b8fc30 | 635 | } |
ab8db613 DS |
636 | pattern->patternlen = patternlen; |
637 | pattern->nowildcardlen = nowildcardlen; | |
638 | pattern->base = base; | |
639 | pattern->baselen = baselen; | |
640 | pattern->flags = flags; | |
641 | pattern->srcpos = srcpos; | |
caa3d554 DS |
642 | ALLOC_GROW(pl->patterns, pl->nr + 1, pl->alloc); |
643 | pl->patterns[pl->nr++] = pattern; | |
644 | pattern->pl = pl; | |
453ec4bd LT |
645 | } |
646 | ||
578d81d0 JH |
647 | static int read_skip_worktree_file_from_index(const struct index_state *istate, |
648 | const char *path, | |
4b33e602 PO |
649 | size_t *size_out, char **data_out, |
650 | struct oid_stat *oid_stat) | |
c28b3d6e NTND |
651 | { |
652 | int pos, len; | |
c28b3d6e NTND |
653 | |
654 | len = strlen(path); | |
6f52b741 | 655 | pos = index_name_pos(istate, path, len); |
c28b3d6e | 656 | if (pos < 0) |
578d81d0 | 657 | return -1; |
6f52b741 | 658 | if (!ce_skip_worktree(istate->cache[pos])) |
578d81d0 JH |
659 | return -1; |
660 | ||
4b33e602 | 661 | return do_read_blob(&istate->cache[pos]->oid, oid_stat, size_out, data_out); |
c28b3d6e NTND |
662 | } |
663 | ||
f6198812 | 664 | /* |
caa3d554 DS |
665 | * Frees memory within pl which was allocated for exclude patterns and |
666 | * the file buffer. Does not free pl itself. | |
f6198812 | 667 | */ |
65edd96a | 668 | void clear_pattern_list(struct pattern_list *pl) |
0fd0e241 NTND |
669 | { |
670 | int i; | |
671 | ||
caa3d554 DS |
672 | for (i = 0; i < pl->nr; i++) |
673 | free(pl->patterns[i]); | |
674 | free(pl->patterns); | |
675 | free(pl->filebuf); | |
0fd0e241 | 676 | |
caa3d554 | 677 | memset(pl, 0, sizeof(*pl)); |
0fd0e241 NTND |
678 | } |
679 | ||
7e2e4b37 | 680 | static void trim_trailing_spaces(char *buf) |
16402b99 | 681 | { |
e61a6c1d PB |
682 | char *p, *last_space = NULL; |
683 | ||
684 | for (p = buf; *p; p++) | |
685 | switch (*p) { | |
686 | case ' ': | |
687 | if (!last_space) | |
688 | last_space = p; | |
689 | break; | |
690 | case '\\': | |
691 | p++; | |
692 | if (!*p) | |
693 | return; | |
694 | /* fallthrough */ | |
695 | default: | |
696 | last_space = NULL; | |
697 | } | |
698 | ||
699 | if (last_space) | |
700 | *last_space = '\0'; | |
16402b99 NTND |
701 | } |
702 | ||
0dcb8d7f NTND |
703 | /* |
704 | * Given a subdirectory name and "dir" of the current directory, | |
705 | * search the subdir in "dir" and return it, or create a new one if it | |
706 | * does not exist in "dir". | |
707 | * | |
708 | * If "name" has the trailing slash, it'll be excluded in the search. | |
709 | */ | |
710 | static struct untracked_cache_dir *lookup_untracked(struct untracked_cache *uc, | |
711 | struct untracked_cache_dir *dir, | |
712 | const char *name, int len) | |
713 | { | |
714 | int first, last; | |
715 | struct untracked_cache_dir *d; | |
716 | if (!dir) | |
717 | return NULL; | |
718 | if (len && name[len - 1] == '/') | |
719 | len--; | |
720 | first = 0; | |
721 | last = dir->dirs_nr; | |
722 | while (last > first) { | |
568a05c5 | 723 | int cmp, next = first + ((last - first) >> 1); |
0dcb8d7f NTND |
724 | d = dir->dirs[next]; |
725 | cmp = strncmp(name, d->name, len); | |
726 | if (!cmp && strlen(d->name) > len) | |
727 | cmp = -1; | |
728 | if (!cmp) | |
729 | return d; | |
730 | if (cmp < 0) { | |
731 | last = next; | |
732 | continue; | |
733 | } | |
734 | first = next+1; | |
735 | } | |
736 | ||
737 | uc->dir_created++; | |
96ffc06f | 738 | FLEX_ALLOC_MEM(d, name, name, len); |
0dcb8d7f NTND |
739 | |
740 | ALLOC_GROW(dir->dirs, dir->dirs_nr + 1, dir->dirs_alloc); | |
f919ffeb SG |
741 | MOVE_ARRAY(dir->dirs + first + 1, dir->dirs + first, |
742 | dir->dirs_nr - first); | |
0dcb8d7f NTND |
743 | dir->dirs_nr++; |
744 | dir->dirs[first] = d; | |
745 | return d; | |
746 | } | |
747 | ||
ccad261f NTND |
748 | static void do_invalidate_gitignore(struct untracked_cache_dir *dir) |
749 | { | |
750 | int i; | |
751 | dir->valid = 0; | |
752 | dir->untracked_nr = 0; | |
753 | for (i = 0; i < dir->dirs_nr; i++) | |
754 | do_invalidate_gitignore(dir->dirs[i]); | |
755 | } | |
756 | ||
757 | static void invalidate_gitignore(struct untracked_cache *uc, | |
758 | struct untracked_cache_dir *dir) | |
759 | { | |
760 | uc->gitignore_invalidated++; | |
761 | do_invalidate_gitignore(dir); | |
762 | } | |
763 | ||
91a2288b NTND |
764 | static void invalidate_directory(struct untracked_cache *uc, |
765 | struct untracked_cache_dir *dir) | |
766 | { | |
26cb0182 | 767 | int i; |
b6403131 NTND |
768 | |
769 | /* | |
770 | * Invalidation increment here is just roughly correct. If | |
771 | * untracked_nr or any of dirs[].recurse is non-zero, we | |
772 | * should increment dir_invalidated too. But that's more | |
773 | * expensive to do. | |
774 | */ | |
775 | if (dir->valid) | |
776 | uc->dir_invalidated++; | |
777 | ||
91a2288b NTND |
778 | dir->valid = 0; |
779 | dir->untracked_nr = 0; | |
26cb0182 NTND |
780 | for (i = 0; i < dir->dirs_nr; i++) |
781 | dir->dirs[i]->recurse = 0; | |
91a2288b NTND |
782 | } |
783 | ||
65edd96a | 784 | static int add_patterns_from_buffer(char *buf, size_t size, |
578d81d0 | 785 | const char *base, int baselen, |
caa3d554 | 786 | struct pattern_list *pl); |
578d81d0 | 787 | |
55fe6f51 NTND |
788 | /* |
789 | * Given a file with name "fname", read it (either from disk, or from | |
473e3930 | 790 | * an index if 'istate' is non-null), parse it and store the |
caa3d554 | 791 | * exclude rules in "pl". |
55fe6f51 NTND |
792 | * |
793 | * If "ss" is not NULL, compute SHA-1 of the exclude file and fill | |
65edd96a | 794 | * stat data from disk (only valid if add_patterns returns zero). If |
55fe6f51 NTND |
795 | * ss_valid is non-zero, "ss" must contain good value as input. |
796 | */ | |
65edd96a | 797 | static int add_patterns(const char *fname, const char *base, int baselen, |
caa3d554 | 798 | struct pattern_list *pl, struct index_state *istate, |
4b33e602 | 799 | struct oid_stat *oid_stat) |
453ec4bd | 800 | { |
c470701a | 801 | struct stat st; |
578d81d0 JH |
802 | int r; |
803 | int fd; | |
9d14017a | 804 | size_t size = 0; |
578d81d0 | 805 | char *buf; |
453ec4bd LT |
806 | |
807 | fd = open(fname, O_RDONLY); | |
c28b3d6e | 808 | if (fd < 0 || fstat(fd, &st) < 0) { |
11dc1fcb NTND |
809 | if (fd < 0) |
810 | warn_on_fopen_errors(fname); | |
811 | else | |
c28b3d6e | 812 | close(fd); |
578d81d0 | 813 | if (!istate) |
c28b3d6e | 814 | return -1; |
578d81d0 JH |
815 | r = read_skip_worktree_file_from_index(istate, fname, |
816 | &size, &buf, | |
4b33e602 | 817 | oid_stat); |
578d81d0 JH |
818 | if (r != 1) |
819 | return r; | |
d961baa8 | 820 | } else { |
c28b3d6e NTND |
821 | size = xsize_t(st.st_size); |
822 | if (size == 0) { | |
4b33e602 PO |
823 | if (oid_stat) { |
824 | fill_stat_data(&oid_stat->stat, &st); | |
ba2df751 | 825 | oidcpy(&oid_stat->oid, the_hash_algo->empty_blob); |
4b33e602 | 826 | oid_stat->valid = 1; |
55fe6f51 | 827 | } |
c28b3d6e NTND |
828 | close(fd); |
829 | return 0; | |
830 | } | |
3733e694 | 831 | buf = xmallocz(size); |
c28b3d6e | 832 | if (read_in_full(fd, buf, size) != size) { |
45d76f17 | 833 | free(buf); |
c28b3d6e NTND |
834 | close(fd); |
835 | return -1; | |
836 | } | |
45d76f17 | 837 | buf[size++] = '\n'; |
c28b3d6e | 838 | close(fd); |
4b33e602 | 839 | if (oid_stat) { |
55fe6f51 | 840 | int pos; |
4b33e602 PO |
841 | if (oid_stat->valid && |
842 | !match_stat_data_racy(istate, &oid_stat->stat, &st)) | |
55fe6f51 | 843 | ; /* no content change, ss->sha1 still good */ |
473e3930 BW |
844 | else if (istate && |
845 | (pos = index_name_pos(istate, fname, strlen(fname))) >= 0 && | |
846 | !ce_stage(istate->cache[pos]) && | |
847 | ce_uptodate(istate->cache[pos]) && | |
82b474e0 | 848 | !would_convert_to_git(istate, fname)) |
4b33e602 PO |
849 | oidcpy(&oid_stat->oid, |
850 | &istate->cache[pos]->oid); | |
55fe6f51 | 851 | else |
f070facc PO |
852 | hash_object_file(buf, size, "blob", |
853 | &oid_stat->oid); | |
4b33e602 PO |
854 | fill_stat_data(&oid_stat->stat, &st); |
855 | oid_stat->valid = 1; | |
55fe6f51 | 856 | } |
6ba78238 | 857 | } |
453ec4bd | 858 | |
65edd96a | 859 | add_patterns_from_buffer(buf, size, base, baselen, pl); |
578d81d0 JH |
860 | return 0; |
861 | } | |
862 | ||
65edd96a | 863 | static int add_patterns_from_buffer(char *buf, size_t size, |
578d81d0 | 864 | const char *base, int baselen, |
caa3d554 | 865 | struct pattern_list *pl) |
578d81d0 JH |
866 | { |
867 | int i, lineno = 1; | |
868 | char *entry; | |
869 | ||
caa3d554 | 870 | pl->filebuf = buf; |
245e1c19 | 871 | |
dde843e7 | 872 | if (skip_utf8_bom(&buf, size)) |
caa3d554 | 873 | size -= buf - pl->filebuf; |
dde843e7 | 874 | |
453ec4bd | 875 | entry = buf; |
245e1c19 | 876 | |
45d76f17 NTND |
877 | for (i = 0; i < size; i++) { |
878 | if (buf[i] == '\n') { | |
453ec4bd LT |
879 | if (entry != buf + i && entry[0] != '#') { |
880 | buf[i - (i && buf[i-1] == '\r')] = 0; | |
7e2e4b37 | 881 | trim_trailing_spaces(entry); |
65edd96a | 882 | add_pattern(entry, base, baselen, pl, lineno); |
453ec4bd | 883 | } |
c04318e4 | 884 | lineno++; |
453ec4bd LT |
885 | entry = buf + i + 1; |
886 | } | |
887 | } | |
888 | return 0; | |
453ec4bd LT |
889 | } |
890 | ||
65edd96a | 891 | int add_patterns_from_file_to_list(const char *fname, const char *base, |
caa3d554 | 892 | int baselen, struct pattern_list *pl, |
473e3930 | 893 | struct index_state *istate) |
55fe6f51 | 894 | { |
65edd96a | 895 | return add_patterns(fname, base, baselen, pl, istate, NULL); |
55fe6f51 NTND |
896 | } |
897 | ||
65edd96a | 898 | int add_patterns_from_blob_to_list( |
578d81d0 JH |
899 | struct object_id *oid, |
900 | const char *base, int baselen, | |
caa3d554 | 901 | struct pattern_list *pl) |
578d81d0 JH |
902 | { |
903 | char *buf; | |
904 | size_t size; | |
905 | int r; | |
906 | ||
907 | r = do_read_blob(oid, NULL, &size, &buf); | |
908 | if (r != 1) | |
909 | return r; | |
910 | ||
65edd96a | 911 | add_patterns_from_buffer(buf, size, base, baselen, pl); |
578d81d0 JH |
912 | return 0; |
913 | } | |
914 | ||
65edd96a | 915 | struct pattern_list *add_pattern_list(struct dir_struct *dir, |
c04318e4 | 916 | int group_type, const char *src) |
c082df24 | 917 | { |
caa3d554 | 918 | struct pattern_list *pl; |
c082df24 AS |
919 | struct exclude_list_group *group; |
920 | ||
921 | group = &dir->exclude_list_group[group_type]; | |
caa3d554 DS |
922 | ALLOC_GROW(group->pl, group->nr + 1, group->alloc); |
923 | pl = &group->pl[group->nr++]; | |
924 | memset(pl, 0, sizeof(*pl)); | |
925 | pl->src = src; | |
926 | return pl; | |
c082df24 AS |
927 | } |
928 | ||
929 | /* | |
930 | * Used to set up core.excludesfile and .git/info/exclude lists. | |
931 | */ | |
65edd96a | 932 | static void add_patterns_from_file_1(struct dir_struct *dir, const char *fname, |
4b33e602 | 933 | struct oid_stat *oid_stat) |
453ec4bd | 934 | { |
caa3d554 | 935 | struct pattern_list *pl; |
ccad261f NTND |
936 | /* |
937 | * catch setup_standard_excludes() that's called before | |
938 | * dir->untracked is assigned. That function behaves | |
939 | * differently when dir->untracked is non-NULL. | |
940 | */ | |
941 | if (!dir->untracked) | |
942 | dir->unmanaged_exclude_files++; | |
65edd96a DS |
943 | pl = add_pattern_list(dir, EXC_FILE, fname); |
944 | if (add_patterns(fname, "", 0, pl, NULL, oid_stat) < 0) | |
a80897c1 | 945 | die(_("cannot use %s as an exclude file"), fname); |
453ec4bd LT |
946 | } |
947 | ||
65edd96a | 948 | void add_patterns_from_file(struct dir_struct *dir, const char *fname) |
0dcb8d7f | 949 | { |
ccad261f | 950 | dir->unmanaged_exclude_files++; /* see validate_untracked_cache() */ |
65edd96a | 951 | add_patterns_from_file_1(dir, fname, NULL); |
0dcb8d7f NTND |
952 | } |
953 | ||
82dce998 NTND |
954 | int match_basename(const char *basename, int basenamelen, |
955 | const char *pattern, int prefix, int patternlen, | |
f8708998 | 956 | unsigned flags) |
593cb880 NTND |
957 | { |
958 | if (prefix == patternlen) { | |
0b6e56df | 959 | if (patternlen == basenamelen && |
ba0897e6 | 960 | !fspathncmp(pattern, basename, basenamelen)) |
593cb880 | 961 | return 1; |
4ff89ee5 | 962 | } else if (flags & PATTERN_FLAG_ENDSWITH) { |
0b6e56df | 963 | /* "*literal" matching against "fooliteral" */ |
593cb880 | 964 | if (patternlen - 1 <= basenamelen && |
ba0897e6 | 965 | !fspathncmp(pattern + 1, |
0b6e56df JH |
966 | basename + basenamelen - (patternlen - 1), |
967 | patternlen - 1)) | |
593cb880 NTND |
968 | return 1; |
969 | } else { | |
0b6e56df JH |
970 | if (fnmatch_icase_mem(pattern, patternlen, |
971 | basename, basenamelen, | |
972 | 0) == 0) | |
593cb880 NTND |
973 | return 1; |
974 | } | |
975 | return 0; | |
976 | } | |
977 | ||
82dce998 NTND |
978 | int match_pathname(const char *pathname, int pathlen, |
979 | const char *base, int baselen, | |
980 | const char *pattern, int prefix, int patternlen, | |
f8708998 | 981 | unsigned flags) |
b5592632 NTND |
982 | { |
983 | const char *name; | |
984 | int namelen; | |
985 | ||
986 | /* | |
987 | * match with FNM_PATHNAME; the pattern has base implicitly | |
988 | * in front of it. | |
989 | */ | |
990 | if (*pattern == '/') { | |
991 | pattern++; | |
982ac873 | 992 | patternlen--; |
b5592632 NTND |
993 | prefix--; |
994 | } | |
995 | ||
996 | /* | |
997 | * baselen does not count the trailing slash. base[] may or | |
998 | * may not end with a trailing slash though. | |
999 | */ | |
1000 | if (pathlen < baselen + 1 || | |
1001 | (baselen && pathname[baselen] != '/') || | |
ba0897e6 | 1002 | fspathncmp(pathname, base, baselen)) |
b5592632 NTND |
1003 | return 0; |
1004 | ||
1005 | namelen = baselen ? pathlen - baselen - 1 : pathlen; | |
1006 | name = pathname + pathlen - namelen; | |
1007 | ||
1008 | if (prefix) { | |
1009 | /* | |
1010 | * if the non-wildcard part is longer than the | |
1011 | * remaining pathname, surely it cannot match. | |
1012 | */ | |
1013 | if (prefix > namelen) | |
1014 | return 0; | |
1015 | ||
ba0897e6 | 1016 | if (fspathncmp(pattern, name, prefix)) |
b5592632 NTND |
1017 | return 0; |
1018 | pattern += prefix; | |
ab3aebc1 | 1019 | patternlen -= prefix; |
b5592632 NTND |
1020 | name += prefix; |
1021 | namelen -= prefix; | |
ab3aebc1 JK |
1022 | |
1023 | /* | |
1024 | * If the whole pattern did not have a wildcard, | |
1025 | * then our prefix match is all we need; we | |
1026 | * do not need to call fnmatch at all. | |
1027 | */ | |
5cee3493 | 1028 | if (!patternlen && !namelen) |
ab3aebc1 | 1029 | return 1; |
b5592632 NTND |
1030 | } |
1031 | ||
ab3aebc1 JK |
1032 | return fnmatch_icase_mem(pattern, patternlen, |
1033 | name, namelen, | |
f30366b2 | 1034 | WM_PATHNAME) == 0; |
b5592632 NTND |
1035 | } |
1036 | ||
578cd7c3 AS |
1037 | /* |
1038 | * Scan the given exclude list in reverse to see whether pathname | |
1039 | * should be ignored. The first match (i.e. the last on the list), if | |
1040 | * any, determines the fate. Returns the exclude_list element which | |
1041 | * matched, or NULL for undecided. | |
453ec4bd | 1042 | */ |
65edd96a | 1043 | static struct path_pattern *last_matching_pattern_from_list(const char *pathname, |
578cd7c3 AS |
1044 | int pathlen, |
1045 | const char *basename, | |
1046 | int *dtype, | |
caa3d554 | 1047 | struct pattern_list *pl, |
2b70e88d | 1048 | struct index_state *istate) |
453ec4bd | 1049 | { |
ab8db613 | 1050 | struct path_pattern *res = NULL; /* undecided */ |
5cee3493 | 1051 | int i; |
453ec4bd | 1052 | |
caa3d554 | 1053 | if (!pl->nr) |
578cd7c3 | 1054 | return NULL; /* undefined */ |
d6b8fc30 | 1055 | |
caa3d554 DS |
1056 | for (i = pl->nr - 1; 0 <= i; i--) { |
1057 | struct path_pattern *pattern = pl->patterns[i]; | |
ab8db613 DS |
1058 | const char *exclude = pattern->pattern; |
1059 | int prefix = pattern->nowildcardlen; | |
35a94d44 | 1060 | |
4ff89ee5 | 1061 | if (pattern->flags & PATTERN_FLAG_MUSTBEDIR) { |
35a94d44 | 1062 | if (*dtype == DT_UNKNOWN) |
2b70e88d | 1063 | *dtype = get_dtype(NULL, istate, pathname, pathlen); |
35a94d44 NTND |
1064 | if (*dtype != DT_DIR) |
1065 | continue; | |
1066 | } | |
d6b8fc30 | 1067 | |
4ff89ee5 | 1068 | if (pattern->flags & PATTERN_FLAG_NODIR) { |
593cb880 NTND |
1069 | if (match_basename(basename, |
1070 | pathlen - (basename - pathname), | |
ab8db613 DS |
1071 | exclude, prefix, pattern->patternlen, |
1072 | pattern->flags)) { | |
1073 | res = pattern; | |
e6efecc4 NTND |
1074 | break; |
1075 | } | |
35a94d44 NTND |
1076 | continue; |
1077 | } | |
1078 | ||
ab8db613 DS |
1079 | assert(pattern->baselen == 0 || |
1080 | pattern->base[pattern->baselen - 1] == '/'); | |
b5592632 | 1081 | if (match_pathname(pathname, pathlen, |
ab8db613 DS |
1082 | pattern->base, |
1083 | pattern->baselen ? pattern->baselen - 1 : 0, | |
1084 | exclude, prefix, pattern->patternlen, | |
1085 | pattern->flags)) { | |
1086 | res = pattern; | |
e6efecc4 NTND |
1087 | break; |
1088 | } | |
453ec4bd | 1089 | } |
ab8db613 | 1090 | return res; |
578cd7c3 AS |
1091 | } |
1092 | ||
1093 | /* | |
468ce99b DS |
1094 | * Scan the list of patterns to determine if the ordered list |
1095 | * of patterns matches on 'pathname'. | |
1096 | * | |
1097 | * Return 1 for a match, 0 for not matched and -1 for undecided. | |
578cd7c3 | 1098 | */ |
468ce99b DS |
1099 | enum pattern_match_result path_matches_pattern_list( |
1100 | const char *pathname, int pathlen, | |
1101 | const char *basename, int *dtype, | |
1102 | struct pattern_list *pl, | |
1103 | struct index_state *istate) | |
578cd7c3 | 1104 | { |
ab8db613 | 1105 | struct path_pattern *pattern; |
65edd96a | 1106 | pattern = last_matching_pattern_from_list(pathname, pathlen, basename, |
caa3d554 | 1107 | dtype, pl, istate); |
468ce99b DS |
1108 | if (pattern) { |
1109 | if (pattern->flags & PATTERN_FLAG_NEGATIVE) | |
1110 | return NOT_MATCHED; | |
1111 | else | |
1112 | return MATCHED; | |
1113 | } | |
1114 | ||
1115 | return UNDECIDED; | |
453ec4bd LT |
1116 | } |
1117 | ||
65edd96a | 1118 | static struct path_pattern *last_matching_pattern_from_lists( |
ab8db613 DS |
1119 | struct dir_struct *dir, struct index_state *istate, |
1120 | const char *pathname, int pathlen, | |
1121 | const char *basename, int *dtype_p) | |
46aa2f95 KB |
1122 | { |
1123 | int i, j; | |
1124 | struct exclude_list_group *group; | |
ab8db613 | 1125 | struct path_pattern *pattern; |
46aa2f95 KB |
1126 | for (i = EXC_CMDL; i <= EXC_FILE; i++) { |
1127 | group = &dir->exclude_list_group[i]; | |
1128 | for (j = group->nr - 1; j >= 0; j--) { | |
65edd96a | 1129 | pattern = last_matching_pattern_from_list( |
46aa2f95 | 1130 | pathname, pathlen, basename, dtype_p, |
caa3d554 | 1131 | &group->pl[j], istate); |
ab8db613 DS |
1132 | if (pattern) |
1133 | return pattern; | |
46aa2f95 KB |
1134 | } |
1135 | } | |
1136 | return NULL; | |
1137 | } | |
1138 | ||
6cd5c582 KB |
1139 | /* |
1140 | * Loads the per-directory exclude list for the substring of base | |
1141 | * which has a char length of baselen. | |
1142 | */ | |
e799ed40 BW |
1143 | static void prep_exclude(struct dir_struct *dir, |
1144 | struct index_state *istate, | |
1145 | const char *base, int baselen) | |
6cd5c582 KB |
1146 | { |
1147 | struct exclude_list_group *group; | |
caa3d554 | 1148 | struct pattern_list *pl; |
6cd5c582 | 1149 | struct exclude_stack *stk = NULL; |
0dcb8d7f | 1150 | struct untracked_cache_dir *untracked; |
6cd5c582 KB |
1151 | int current; |
1152 | ||
6cd5c582 KB |
1153 | group = &dir->exclude_list_group[EXC_DIRS]; |
1154 | ||
d961baa8 NTND |
1155 | /* |
1156 | * Pop the exclude lists from the EXCL_DIRS exclude_list_group | |
6cd5c582 | 1157 | * which originate from directories not in the prefix of the |
d961baa8 NTND |
1158 | * path being checked. |
1159 | */ | |
6cd5c582 KB |
1160 | while ((stk = dir->exclude_stack) != NULL) { |
1161 | if (stk->baselen <= baselen && | |
aceb9429 | 1162 | !strncmp(dir->basebuf.buf, base, stk->baselen)) |
6cd5c582 | 1163 | break; |
caa3d554 | 1164 | pl = &group->pl[dir->exclude_stack->exclude_ix]; |
6cd5c582 | 1165 | dir->exclude_stack = stk->prev; |
ab8db613 | 1166 | dir->pattern = NULL; |
caa3d554 | 1167 | free((char *)pl->src); /* see strbuf_detach() below */ |
65edd96a | 1168 | clear_pattern_list(pl); |
6cd5c582 KB |
1169 | free(stk); |
1170 | group->nr--; | |
1171 | } | |
1172 | ||
95c6f271 | 1173 | /* Skip traversing into sub directories if the parent is excluded */ |
ab8db613 | 1174 | if (dir->pattern) |
95c6f271 KB |
1175 | return; |
1176 | ||
aceb9429 NTND |
1177 | /* |
1178 | * Lazy initialization. All call sites currently just | |
1179 | * memset(dir, 0, sizeof(*dir)) before use. Changing all of | |
1180 | * them seems lots of work for little benefit. | |
1181 | */ | |
1182 | if (!dir->basebuf.buf) | |
1183 | strbuf_init(&dir->basebuf, PATH_MAX); | |
1184 | ||
6cd5c582 KB |
1185 | /* Read from the parent directories and push them down. */ |
1186 | current = stk ? stk->baselen : -1; | |
aceb9429 | 1187 | strbuf_setlen(&dir->basebuf, current < 0 ? 0 : current); |
0dcb8d7f NTND |
1188 | if (dir->untracked) |
1189 | untracked = stk ? stk->ucd : dir->untracked->root; | |
1190 | else | |
1191 | untracked = NULL; | |
1192 | ||
6cd5c582 | 1193 | while (current < baselen) { |
6cd5c582 | 1194 | const char *cp; |
4b33e602 | 1195 | struct oid_stat oid_stat; |
6cd5c582 | 1196 | |
03e11a71 | 1197 | stk = xcalloc(1, sizeof(*stk)); |
6cd5c582 KB |
1198 | if (current < 0) { |
1199 | cp = base; | |
1200 | current = 0; | |
d961baa8 | 1201 | } else { |
6cd5c582 KB |
1202 | cp = strchr(base + current + 1, '/'); |
1203 | if (!cp) | |
1204 | die("oops in prep_exclude"); | |
1205 | cp++; | |
0dcb8d7f NTND |
1206 | untracked = |
1207 | lookup_untracked(dir->untracked, untracked, | |
1208 | base + current, | |
1209 | cp - base - current); | |
6cd5c582 KB |
1210 | } |
1211 | stk->prev = dir->exclude_stack; | |
1212 | stk->baselen = cp - base; | |
95c6f271 | 1213 | stk->exclude_ix = group->nr; |
0dcb8d7f | 1214 | stk->ucd = untracked; |
65edd96a | 1215 | pl = add_pattern_list(dir, EXC_DIRS, NULL); |
aceb9429 NTND |
1216 | strbuf_add(&dir->basebuf, base + current, stk->baselen - current); |
1217 | assert(stk->baselen == dir->basebuf.len); | |
95c6f271 KB |
1218 | |
1219 | /* Abort if the directory is excluded */ | |
1220 | if (stk->baselen) { | |
1221 | int dt = DT_DIR; | |
aceb9429 | 1222 | dir->basebuf.buf[stk->baselen - 1] = 0; |
65edd96a | 1223 | dir->pattern = last_matching_pattern_from_lists(dir, |
e799ed40 | 1224 | istate, |
aceb9429 NTND |
1225 | dir->basebuf.buf, stk->baselen - 1, |
1226 | dir->basebuf.buf + current, &dt); | |
1227 | dir->basebuf.buf[stk->baselen - 1] = '/'; | |
ab8db613 | 1228 | if (dir->pattern && |
4ff89ee5 | 1229 | dir->pattern->flags & PATTERN_FLAG_NEGATIVE) |
ab8db613 DS |
1230 | dir->pattern = NULL; |
1231 | if (dir->pattern) { | |
95c6f271 KB |
1232 | dir->exclude_stack = stk; |
1233 | return; | |
1234 | } | |
1235 | } | |
1236 | ||
aceb9429 | 1237 | /* Try to read per-directory file */ |
4b33e602 PO |
1238 | oidclr(&oid_stat.oid); |
1239 | oid_stat.valid = 0; | |
27b099ae NTND |
1240 | if (dir->exclude_per_dir && |
1241 | /* | |
1242 | * If we know that no files have been added in | |
1243 | * this directory (i.e. valid_cached_dir() has | |
1244 | * been executed and set untracked->valid) .. | |
1245 | */ | |
1246 | (!untracked || !untracked->valid || | |
1247 | /* | |
1248 | * .. and .gitignore does not exist before | |
70c369cd | 1249 | * (i.e. null exclude_oid). Then we can skip |
7687252f DT |
1250 | * loading .gitignore, which would result in |
1251 | * ENOENT anyway. | |
27b099ae | 1252 | */ |
70c369cd | 1253 | !is_null_oid(&untracked->exclude_oid))) { |
95c6f271 KB |
1254 | /* |
1255 | * dir->basebuf gets reused by the traversal, but we | |
1256 | * need fname to remain unchanged to ensure the src | |
ab8db613 | 1257 | * member of each struct path_pattern correctly |
95c6f271 | 1258 | * back-references its source file. Other invocations |
65edd96a | 1259 | * of add_pattern_list provide stable strings, so we |
aceb9429 | 1260 | * strbuf_detach() and free() here in the caller. |
95c6f271 | 1261 | */ |
aceb9429 NTND |
1262 | struct strbuf sb = STRBUF_INIT; |
1263 | strbuf_addbuf(&sb, &dir->basebuf); | |
1264 | strbuf_addstr(&sb, dir->exclude_per_dir); | |
caa3d554 | 1265 | pl->src = strbuf_detach(&sb, NULL); |
65edd96a | 1266 | add_patterns(pl->src, pl->src, stk->baselen, pl, istate, |
4b33e602 | 1267 | untracked ? &oid_stat : NULL); |
0dcb8d7f | 1268 | } |
5ebf79ad NTND |
1269 | /* |
1270 | * NEEDSWORK: when untracked cache is enabled, prep_exclude() | |
1271 | * will first be called in valid_cached_dir() then maybe many | |
65edd96a DS |
1272 | * times more in last_matching_pattern(). When the cache is |
1273 | * used, last_matching_pattern() will not be called and | |
5ebf79ad NTND |
1274 | * reading .gitignore content will be a waste. |
1275 | * | |
1276 | * So when it's called by valid_cached_dir() and we can get | |
1277 | * .gitignore SHA-1 from the index (i.e. .gitignore is not | |
1278 | * modified on work tree), we could delay reading the | |
1279 | * .gitignore content until we absolutely need it in | |
65edd96a | 1280 | * last_matching_pattern(). Be careful about ignore rule |
5ebf79ad NTND |
1281 | * order, though, if you do that. |
1282 | */ | |
1283 | if (untracked && | |
9001dc2a | 1284 | !oideq(&oid_stat.oid, &untracked->exclude_oid)) { |
5ebf79ad | 1285 | invalidate_gitignore(dir->untracked, untracked); |
70c369cd | 1286 | oidcpy(&untracked->exclude_oid, &oid_stat.oid); |
95c6f271 | 1287 | } |
6cd5c582 KB |
1288 | dir->exclude_stack = stk; |
1289 | current = stk->baselen; | |
1290 | } | |
aceb9429 | 1291 | strbuf_setlen(&dir->basebuf, baselen); |
6cd5c582 KB |
1292 | } |
1293 | ||
f4cd69a6 AS |
1294 | /* |
1295 | * Loads the exclude lists for the directory containing pathname, then | |
1296 | * scans all exclude lists to determine whether pathname is excluded. | |
1297 | * Returns the exclude_list element which matched, or NULL for | |
1298 | * undecided. | |
1299 | */ | |
65edd96a | 1300 | struct path_pattern *last_matching_pattern(struct dir_struct *dir, |
a0bba65b BW |
1301 | struct index_state *istate, |
1302 | const char *pathname, | |
1303 | int *dtype_p) | |
453ec4bd LT |
1304 | { |
1305 | int pathlen = strlen(pathname); | |
68492fc7 LK |
1306 | const char *basename = strrchr(pathname, '/'); |
1307 | basename = (basename) ? basename+1 : pathname; | |
453ec4bd | 1308 | |
a0bba65b | 1309 | prep_exclude(dir, istate, pathname, basename-pathname); |
c082df24 | 1310 | |
ab8db613 DS |
1311 | if (dir->pattern) |
1312 | return dir->pattern; | |
95c6f271 | 1313 | |
65edd96a | 1314 | return last_matching_pattern_from_lists(dir, istate, pathname, pathlen, |
46aa2f95 | 1315 | basename, dtype_p); |
f4cd69a6 AS |
1316 | } |
1317 | ||
1318 | /* | |
1319 | * Loads the exclude lists for the directory containing pathname, then | |
1320 | * scans all exclude lists to determine whether pathname is excluded. | |
1321 | * Returns 1 if true, otherwise 0. | |
1322 | */ | |
a0bba65b BW |
1323 | int is_excluded(struct dir_struct *dir, struct index_state *istate, |
1324 | const char *pathname, int *dtype_p) | |
f4cd69a6 | 1325 | { |
ab8db613 | 1326 | struct path_pattern *pattern = |
65edd96a | 1327 | last_matching_pattern(dir, istate, pathname, dtype_p); |
ab8db613 | 1328 | if (pattern) |
4ff89ee5 | 1329 | return pattern->flags & PATTERN_FLAG_NEGATIVE ? 0 : 1; |
453ec4bd LT |
1330 | return 0; |
1331 | } | |
1332 | ||
f3fa1838 JH |
1333 | static struct dir_entry *dir_entry_new(const char *pathname, int len) |
1334 | { | |
453ec4bd LT |
1335 | struct dir_entry *ent; |
1336 | ||
96ffc06f | 1337 | FLEX_ALLOC_MEM(ent, name, pathname, len); |
453ec4bd | 1338 | ent->len = len; |
4d06f8ac | 1339 | return ent; |
453ec4bd LT |
1340 | } |
1341 | ||
9e58beca BW |
1342 | static struct dir_entry *dir_add_name(struct dir_struct *dir, |
1343 | struct index_state *istate, | |
1344 | const char *pathname, int len) | |
6815e569 | 1345 | { |
9e58beca | 1346 | if (index_file_exists(istate, pathname, len, ignore_case)) |
6815e569 JK |
1347 | return NULL; |
1348 | ||
25fd2f7a | 1349 | ALLOC_GROW(dir->entries, dir->nr+1, dir->alloc); |
6815e569 JK |
1350 | return dir->entries[dir->nr++] = dir_entry_new(pathname, len); |
1351 | } | |
1352 | ||
9e58beca BW |
1353 | struct dir_entry *dir_add_ignored(struct dir_struct *dir, |
1354 | struct index_state *istate, | |
1355 | const char *pathname, int len) | |
2abd31b0 | 1356 | { |
9e58beca | 1357 | if (!index_name_is_other(istate, pathname, len)) |
2abd31b0 JK |
1358 | return NULL; |
1359 | ||
25fd2f7a | 1360 | ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->ignored_alloc); |
2abd31b0 JK |
1361 | return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len); |
1362 | } | |
1363 | ||
09595258 LT |
1364 | enum exist_status { |
1365 | index_nonexistent = 0, | |
1366 | index_directory, | |
4b05548f | 1367 | index_gitdir |
09595258 LT |
1368 | }; |
1369 | ||
5102c617 | 1370 | /* |
71261027 | 1371 | * Do not use the alphabetically sorted index to look up |
5102c617 | 1372 | * the directory name; instead, use the case insensitive |
ebbd7439 | 1373 | * directory hash. |
5102c617 | 1374 | */ |
ae520e36 BW |
1375 | static enum exist_status directory_exists_in_index_icase(struct index_state *istate, |
1376 | const char *dirname, int len) | |
5102c617 | 1377 | { |
41284eb0 | 1378 | struct cache_entry *ce; |
5102c617 | 1379 | |
ae520e36 | 1380 | if (index_dir_exists(istate, dirname, len)) |
5102c617 JJ |
1381 | return index_directory; |
1382 | ||
ae520e36 | 1383 | ce = index_file_exists(istate, dirname, len, ignore_case); |
41284eb0 | 1384 | if (ce && S_ISGITLINK(ce->ce_mode)) |
5102c617 JJ |
1385 | return index_gitdir; |
1386 | ||
5102c617 JJ |
1387 | return index_nonexistent; |
1388 | } | |
1389 | ||
09595258 LT |
1390 | /* |
1391 | * The index sorts alphabetically by entry name, which | |
1392 | * means that a gitlink sorts as '\0' at the end, while | |
1393 | * a directory (which is defined not as an entry, but as | |
1394 | * the files it contains) will sort with the '/' at the | |
1395 | * end. | |
1396 | */ | |
ae520e36 BW |
1397 | static enum exist_status directory_exists_in_index(struct index_state *istate, |
1398 | const char *dirname, int len) | |
453ec4bd | 1399 | { |
5102c617 JJ |
1400 | int pos; |
1401 | ||
1402 | if (ignore_case) | |
ae520e36 | 1403 | return directory_exists_in_index_icase(istate, dirname, len); |
5102c617 | 1404 | |
ae520e36 | 1405 | pos = index_name_pos(istate, dirname, len); |
09595258 LT |
1406 | if (pos < 0) |
1407 | pos = -pos-1; | |
ae520e36 BW |
1408 | while (pos < istate->cache_nr) { |
1409 | const struct cache_entry *ce = istate->cache[pos++]; | |
09595258 LT |
1410 | unsigned char endchar; |
1411 | ||
1412 | if (strncmp(ce->name, dirname, len)) | |
1413 | break; | |
1414 | endchar = ce->name[len]; | |
1415 | if (endchar > '/') | |
1416 | break; | |
1417 | if (endchar == '/') | |
1418 | return index_directory; | |
7a51ed66 | 1419 | if (!endchar && S_ISGITLINK(ce->ce_mode)) |
09595258 LT |
1420 | return index_gitdir; |
1421 | } | |
1422 | return index_nonexistent; | |
1423 | } | |
1424 | ||
1425 | /* | |
1426 | * When we find a directory when traversing the filesystem, we | |
1427 | * have three distinct cases: | |
1428 | * | |
1429 | * - ignore it | |
1430 | * - see it as a directory | |
1431 | * - recurse into it | |
1432 | * | |
1433 | * and which one we choose depends on a combination of existing | |
1434 | * git index contents and the flags passed into the directory | |
1435 | * traversal routine. | |
1436 | * | |
1437 | * Case 1: If we *already* have entries in the index under that | |
5bd8e2d8 KB |
1438 | * directory name, we always recurse into the directory to see |
1439 | * all the files. | |
09595258 LT |
1440 | * |
1441 | * Case 2: If we *already* have that directory name as a gitlink, | |
1442 | * we always continue to see it as a gitlink, regardless of whether | |
1443 | * there is an actual git directory there or not (it might not | |
1444 | * be checked out as a subproject!) | |
1445 | * | |
1446 | * Case 3: if we didn't have it in the index previously, we | |
1447 | * have a few sub-cases: | |
1448 | * | |
1449 | * (a) if "show_other_directories" is true, we show it as | |
1450 | * just a directory, unless "hide_empty_directories" is | |
defd7c7b KB |
1451 | * also true, in which case we need to check if it contains any |
1452 | * untracked and / or ignored files. | |
09595258 | 1453 | * (b) if it looks like a git directory, and we don't have |
302b9282 | 1454 | * 'no_gitlinks' set we treat it as a gitlink, and show it |
09595258 LT |
1455 | * as a directory. |
1456 | * (c) otherwise, we recurse into it. | |
1457 | */ | |
defd7c7b | 1458 | static enum path_treatment treat_directory(struct dir_struct *dir, |
0ef8e169 | 1459 | struct index_state *istate, |
0dcb8d7f | 1460 | struct untracked_cache_dir *untracked, |
2e5910f2 | 1461 | const char *dirname, int len, int baselen, int exclude, |
e1b8c7bd | 1462 | const struct pathspec *pathspec) |
09595258 LT |
1463 | { |
1464 | /* The "len-1" is to strip the final '/' */ | |
0ef8e169 | 1465 | switch (directory_exists_in_index(istate, dirname, len-1)) { |
09595258 | 1466 | case index_directory: |
defd7c7b | 1467 | return path_recurse; |
09595258 LT |
1468 | |
1469 | case index_gitdir: | |
26c986e1 | 1470 | return path_none; |
09595258 LT |
1471 | |
1472 | case index_nonexistent: | |
09487f2c EN |
1473 | if (dir->flags & DIR_SKIP_NESTED_GIT) { |
1474 | int nested_repo; | |
1475 | struct strbuf sb = STRBUF_INIT; | |
1476 | strbuf_addstr(&sb, dirname); | |
1477 | nested_repo = is_nonbare_repository_dir(&sb); | |
1478 | strbuf_release(&sb); | |
1479 | if (nested_repo) | |
1480 | return path_none; | |
1481 | } | |
1482 | ||
7c4c97c0 | 1483 | if (dir->flags & DIR_SHOW_OTHER_DIRECTORIES) |
09595258 | 1484 | break; |
eec0f7f2 JM |
1485 | if (exclude && |
1486 | (dir->flags & DIR_SHOW_IGNORED_TOO) && | |
1487 | (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING)) { | |
1488 | ||
1489 | /* | |
1490 | * This is an excluded directory and we are | |
1491 | * showing ignored paths that match an exclude | |
1492 | * pattern. (e.g. show directory as ignored | |
1493 | * only if it matches an exclude pattern). | |
1494 | * This path will either be 'path_excluded` | |
1495 | * (if we are showing empty directories or if | |
1496 | * the directory is not empty), or will be | |
1497 | * 'path_none' (empty directory, and we are | |
1498 | * not showing empty directories). | |
1499 | */ | |
1500 | if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES)) | |
1501 | return path_excluded; | |
1502 | ||
1503 | if (read_directory_recursive(dir, istate, dirname, len, | |
1504 | untracked, 1, 1, pathspec) == path_excluded) | |
1505 | return path_excluded; | |
1506 | ||
1507 | return path_none; | |
1508 | } | |
7c4c97c0 | 1509 | if (!(dir->flags & DIR_NO_GITLINKS)) { |
b2282704 KM |
1510 | struct strbuf sb = STRBUF_INIT; |
1511 | strbuf_addstr(&sb, dirname); | |
1512 | if (is_nonbare_repository_dir(&sb)) | |
fadb4820 | 1513 | return exclude ? path_excluded : path_untracked; |
b2282704 | 1514 | strbuf_release(&sb); |
09595258 | 1515 | } |
defd7c7b | 1516 | return path_recurse; |
09595258 LT |
1517 | } |
1518 | ||
1519 | /* This is the "show_other_directories" case */ | |
721ac4ed | 1520 | |
184d2a8e | 1521 | if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES)) |
defd7c7b KB |
1522 | return exclude ? path_excluded : path_untracked; |
1523 | ||
2e5910f2 DT |
1524 | untracked = lookup_untracked(dir->untracked, untracked, |
1525 | dirname + baselen, len - baselen); | |
5aaa7fd3 JM |
1526 | |
1527 | /* | |
1528 | * If this is an excluded directory, then we only need to check if | |
1529 | * the directory contains any files. | |
1530 | */ | |
0ef8e169 | 1531 | return read_directory_recursive(dir, istate, dirname, len, |
5aaa7fd3 | 1532 | untracked, 1, exclude, pathspec); |
453ec4bd LT |
1533 | } |
1534 | ||
9fc42d60 LT |
1535 | /* |
1536 | * This is an inexact early pruning of any recursive directory | |
1537 | * reading - if the path cannot possibly be in the pathspec, | |
1538 | * return true, and we'll skip it early. | |
1539 | */ | |
e1b8c7bd BW |
1540 | static int simplify_away(const char *path, int pathlen, |
1541 | const struct pathspec *pathspec) | |
9fc42d60 | 1542 | { |
e1b8c7bd | 1543 | int i; |
9fc42d60 | 1544 | |
e1b8c7bd BW |
1545 | if (!pathspec || !pathspec->nr) |
1546 | return 0; | |
1547 | ||
1548 | GUARD_PATHSPEC(pathspec, | |
1549 | PATHSPEC_FROMTOP | | |
1550 | PATHSPEC_MAXDEPTH | | |
1551 | PATHSPEC_LITERAL | | |
1552 | PATHSPEC_GLOB | | |
1553 | PATHSPEC_ICASE | | |
b0db7046 BW |
1554 | PATHSPEC_EXCLUDE | |
1555 | PATHSPEC_ATTR); | |
e1b8c7bd BW |
1556 | |
1557 | for (i = 0; i < pathspec->nr; i++) { | |
1558 | const struct pathspec_item *item = &pathspec->items[i]; | |
1559 | int len = item->nowildcard_len; | |
1560 | ||
1561 | if (len > pathlen) | |
1562 | len = pathlen; | |
1563 | if (!ps_strncmp(item, item->match, path, len)) | |
1564 | return 0; | |
9fc42d60 | 1565 | } |
e1b8c7bd BW |
1566 | |
1567 | return 1; | |
9fc42d60 LT |
1568 | } |
1569 | ||
29209cbe JK |
1570 | /* |
1571 | * This function tells us whether an excluded path matches a | |
1572 | * list of "interesting" pathspecs. That is, whether a path matched | |
1573 | * by any of the pathspecs could possibly be ignored by excluding | |
1574 | * the specified path. This can happen if: | |
1575 | * | |
1576 | * 1. the path is mentioned explicitly in the pathspec | |
1577 | * | |
1578 | * 2. the path is a directory prefix of some element in the | |
1579 | * pathspec | |
1580 | */ | |
e1b8c7bd BW |
1581 | static int exclude_matches_pathspec(const char *path, int pathlen, |
1582 | const struct pathspec *pathspec) | |
1583 | { | |
1584 | int i; | |
1585 | ||
1586 | if (!pathspec || !pathspec->nr) | |
1587 | return 0; | |
1588 | ||
1589 | GUARD_PATHSPEC(pathspec, | |
1590 | PATHSPEC_FROMTOP | | |
1591 | PATHSPEC_MAXDEPTH | | |
1592 | PATHSPEC_LITERAL | | |
1593 | PATHSPEC_GLOB | | |
1594 | PATHSPEC_ICASE | | |
1595 | PATHSPEC_EXCLUDE); | |
1596 | ||
1597 | for (i = 0; i < pathspec->nr; i++) { | |
1598 | const struct pathspec_item *item = &pathspec->items[i]; | |
1599 | int len = item->nowildcard_len; | |
1600 | ||
1601 | if (len == pathlen && | |
1602 | !ps_strncmp(item, item->match, path, pathlen)) | |
1603 | return 1; | |
1604 | if (len > pathlen && | |
1605 | item->match[pathlen] == '/' && | |
1606 | !ps_strncmp(item, item->match, path, pathlen)) | |
1607 | return 1; | |
e96980ef JK |
1608 | } |
1609 | return 0; | |
1610 | } | |
1611 | ||
98f2a687 BW |
1612 | static int get_index_dtype(struct index_state *istate, |
1613 | const char *path, int len) | |
443e061a LT |
1614 | { |
1615 | int pos; | |
9c5e6c80 | 1616 | const struct cache_entry *ce; |
443e061a | 1617 | |
98f2a687 | 1618 | ce = index_file_exists(istate, path, len, 0); |
443e061a LT |
1619 | if (ce) { |
1620 | if (!ce_uptodate(ce)) | |
1621 | return DT_UNKNOWN; | |
1622 | if (S_ISGITLINK(ce->ce_mode)) | |
1623 | return DT_DIR; | |
1624 | /* | |
1625 | * Nobody actually cares about the | |
1626 | * difference between DT_LNK and DT_REG | |
1627 | */ | |
1628 | return DT_REG; | |
1629 | } | |
1630 | ||
1631 | /* Try to look it up as a directory */ | |
98f2a687 | 1632 | pos = index_name_pos(istate, path, len); |
443e061a LT |
1633 | if (pos >= 0) |
1634 | return DT_UNKNOWN; | |
1635 | pos = -pos-1; | |
98f2a687 BW |
1636 | while (pos < istate->cache_nr) { |
1637 | ce = istate->cache[pos++]; | |
443e061a LT |
1638 | if (strncmp(ce->name, path, len)) |
1639 | break; | |
1640 | if (ce->name[len] > '/') | |
1641 | break; | |
1642 | if (ce->name[len] < '/') | |
1643 | continue; | |
1644 | if (!ce_uptodate(ce)) | |
1645 | break; /* continue? */ | |
1646 | return DT_DIR; | |
1647 | } | |
1648 | return DT_UNKNOWN; | |
1649 | } | |
1650 | ||
98f2a687 BW |
1651 | static int get_dtype(struct dirent *de, struct index_state *istate, |
1652 | const char *path, int len) | |
07134421 | 1653 | { |
6831a88a | 1654 | int dtype = de ? DTYPE(de) : DT_UNKNOWN; |
07134421 LT |
1655 | struct stat st; |
1656 | ||
1657 | if (dtype != DT_UNKNOWN) | |
1658 | return dtype; | |
98f2a687 | 1659 | dtype = get_index_dtype(istate, path, len); |
443e061a LT |
1660 | if (dtype != DT_UNKNOWN) |
1661 | return dtype; | |
1662 | if (lstat(path, &st)) | |
07134421 LT |
1663 | return dtype; |
1664 | if (S_ISREG(st.st_mode)) | |
1665 | return DT_REG; | |
1666 | if (S_ISDIR(st.st_mode)) | |
1667 | return DT_DIR; | |
1668 | if (S_ISLNK(st.st_mode)) | |
1669 | return DT_LNK; | |
1670 | return dtype; | |
1671 | } | |
1672 | ||
16e2cfa9 | 1673 | static enum path_treatment treat_one_path(struct dir_struct *dir, |
0dcb8d7f | 1674 | struct untracked_cache_dir *untracked, |
0ef8e169 | 1675 | struct index_state *istate, |
49dc2cc2 | 1676 | struct strbuf *path, |
2e5910f2 | 1677 | int baselen, |
e1b8c7bd | 1678 | const struct pathspec *pathspec, |
16e2cfa9 | 1679 | int dtype, struct dirent *de) |
53cc5356 | 1680 | { |
8aaf8d77 | 1681 | int exclude; |
0ef8e169 | 1682 | int has_path_in_index = !!index_file_exists(istate, path->buf, path->len, ignore_case); |
07966ed1 | 1683 | enum path_treatment path_treatment; |
2eac2a4c | 1684 | |
8aaf8d77 | 1685 | if (dtype == DT_UNKNOWN) |
0ef8e169 | 1686 | dtype = get_dtype(de, istate, path->buf, path->len); |
8aaf8d77 KB |
1687 | |
1688 | /* Always exclude indexed files */ | |
2eac2a4c | 1689 | if (dtype != DT_DIR && has_path_in_index) |
defd7c7b | 1690 | return path_none; |
8aaf8d77 | 1691 | |
2eac2a4c JH |
1692 | /* |
1693 | * When we are looking at a directory P in the working tree, | |
1694 | * there are three cases: | |
1695 | * | |
1696 | * (1) P exists in the index. Everything inside the directory P in | |
1697 | * the working tree needs to go when P is checked out from the | |
1698 | * index. | |
1699 | * | |
1700 | * (2) P does not exist in the index, but there is P/Q in the index. | |
1701 | * We know P will stay a directory when we check out the contents | |
1702 | * of the index, but we do not know yet if there is a directory | |
1703 | * P/Q in the working tree to be killed, so we need to recurse. | |
1704 | * | |
1705 | * (3) P does not exist in the index, and there is no P/Q in the index | |
1706 | * to require P to be a directory, either. Only in this case, we | |
1707 | * know that everything inside P will not be killed without | |
1708 | * recursing. | |
1709 | */ | |
1710 | if ((dir->flags & DIR_COLLECT_KILLED_ONLY) && | |
1711 | (dtype == DT_DIR) && | |
de372b1b | 1712 | !has_path_in_index && |
0ef8e169 | 1713 | (directory_exists_in_index(istate, path->buf, path->len) == index_nonexistent)) |
de372b1b | 1714 | return path_none; |
8aaf8d77 | 1715 | |
0ef8e169 | 1716 | exclude = is_excluded(dir, istate, path->buf, &dtype); |
53cc5356 JH |
1717 | |
1718 | /* | |
1719 | * Excluded? If we don't explicitly want to show | |
1720 | * ignored files, ignore it | |
1721 | */ | |
0aaf62b6 | 1722 | if (exclude && !(dir->flags & (DIR_SHOW_IGNORED|DIR_SHOW_IGNORED_TOO))) |
defd7c7b | 1723 | return path_excluded; |
53cc5356 | 1724 | |
53cc5356 JH |
1725 | switch (dtype) { |
1726 | default: | |
defd7c7b | 1727 | return path_none; |
53cc5356 | 1728 | case DT_DIR: |
49dc2cc2 | 1729 | strbuf_addch(path, '/'); |
07966ed1 JM |
1730 | path_treatment = treat_directory(dir, istate, untracked, |
1731 | path->buf, path->len, | |
1732 | baselen, exclude, pathspec); | |
1733 | /* | |
1734 | * If 1) we only want to return directories that | |
1735 | * match an exclude pattern and 2) this directory does | |
1736 | * not match an exclude pattern but all of its | |
1737 | * contents are excluded, then indicate that we should | |
1738 | * recurse into this directory (instead of marking the | |
1739 | * directory itself as an ignored path). | |
1740 | */ | |
1741 | if (!exclude && | |
1742 | path_treatment == path_excluded && | |
1743 | (dir->flags & DIR_SHOW_IGNORED_TOO) && | |
1744 | (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING)) | |
1745 | return path_recurse; | |
1746 | return path_treatment; | |
53cc5356 JH |
1747 | case DT_REG: |
1748 | case DT_LNK: | |
defd7c7b | 1749 | return exclude ? path_excluded : path_untracked; |
53cc5356 | 1750 | } |
53cc5356 JH |
1751 | } |
1752 | ||
91a2288b NTND |
1753 | static enum path_treatment treat_path_fast(struct dir_struct *dir, |
1754 | struct untracked_cache_dir *untracked, | |
1755 | struct cached_dir *cdir, | |
0ef8e169 | 1756 | struct index_state *istate, |
91a2288b NTND |
1757 | struct strbuf *path, |
1758 | int baselen, | |
e1b8c7bd | 1759 | const struct pathspec *pathspec) |
91a2288b NTND |
1760 | { |
1761 | strbuf_setlen(path, baselen); | |
1762 | if (!cdir->ucd) { | |
1763 | strbuf_addstr(path, cdir->file); | |
1764 | return path_untracked; | |
1765 | } | |
1766 | strbuf_addstr(path, cdir->ucd->name); | |
1767 | /* treat_one_path() does this before it calls treat_directory() */ | |
00b6c178 | 1768 | strbuf_complete(path, '/'); |
91a2288b NTND |
1769 | if (cdir->ucd->check_only) |
1770 | /* | |
1771 | * check_only is set as a result of treat_directory() getting | |
1772 | * to its bottom. Verify again the same set of directories | |
1773 | * with check_only set. | |
1774 | */ | |
0ef8e169 | 1775 | return read_directory_recursive(dir, istate, path->buf, path->len, |
5aaa7fd3 | 1776 | cdir->ucd, 1, 0, pathspec); |
91a2288b NTND |
1777 | /* |
1778 | * We get path_recurse in the first run when | |
1779 | * directory_exists_in_index() returns index_nonexistent. We | |
1780 | * are sure that new changes in the index does not impact the | |
1781 | * outcome. Return now. | |
1782 | */ | |
1783 | return path_recurse; | |
1784 | } | |
1785 | ||
16e2cfa9 | 1786 | static enum path_treatment treat_path(struct dir_struct *dir, |
0dcb8d7f | 1787 | struct untracked_cache_dir *untracked, |
cf7c6148 | 1788 | struct cached_dir *cdir, |
0ef8e169 | 1789 | struct index_state *istate, |
49dc2cc2 | 1790 | struct strbuf *path, |
16e2cfa9 | 1791 | int baselen, |
e1b8c7bd | 1792 | const struct pathspec *pathspec) |
16e2cfa9 JH |
1793 | { |
1794 | int dtype; | |
cf7c6148 | 1795 | struct dirent *de = cdir->de; |
16e2cfa9 | 1796 | |
91a2288b | 1797 | if (!de) |
0ef8e169 | 1798 | return treat_path_fast(dir, untracked, cdir, istate, path, |
e1b8c7bd | 1799 | baselen, pathspec); |
0cacebf0 | 1800 | if (is_dot_or_dotdot(de->d_name) || !fspathcmp(de->d_name, ".git")) |
defd7c7b | 1801 | return path_none; |
49dc2cc2 RS |
1802 | strbuf_setlen(path, baselen); |
1803 | strbuf_addstr(path, de->d_name); | |
e1b8c7bd | 1804 | if (simplify_away(path->buf, path->len, pathspec)) |
defd7c7b | 1805 | return path_none; |
16e2cfa9 JH |
1806 | |
1807 | dtype = DTYPE(de); | |
0ef8e169 | 1808 | return treat_one_path(dir, untracked, istate, path, baselen, pathspec, dtype, de); |
0dcb8d7f NTND |
1809 | } |
1810 | ||
1811 | static void add_untracked(struct untracked_cache_dir *dir, const char *name) | |
1812 | { | |
1813 | if (!dir) | |
1814 | return; | |
1815 | ALLOC_GROW(dir->untracked, dir->untracked_nr + 1, | |
1816 | dir->untracked_alloc); | |
1817 | dir->untracked[dir->untracked_nr++] = xstrdup(name); | |
16e2cfa9 JH |
1818 | } |
1819 | ||
91a2288b NTND |
1820 | static int valid_cached_dir(struct dir_struct *dir, |
1821 | struct untracked_cache_dir *untracked, | |
207a06ce | 1822 | struct index_state *istate, |
91a2288b NTND |
1823 | struct strbuf *path, |
1824 | int check_only) | |
1825 | { | |
1826 | struct stat st; | |
1827 | ||
1828 | if (!untracked) | |
1829 | return 0; | |
1830 | ||
883e248b BP |
1831 | /* |
1832 | * With fsmonitor, we can trust the untracked cache's valid field. | |
1833 | */ | |
1834 | refresh_fsmonitor(istate); | |
1835 | if (!(dir->untracked->use_fsmonitor && untracked->valid)) { | |
2523c4be | 1836 | if (lstat(path->len ? path->buf : ".", &st)) { |
883e248b BP |
1837 | memset(&untracked->stat_data, 0, sizeof(untracked->stat_data)); |
1838 | return 0; | |
1839 | } | |
1840 | if (!untracked->valid || | |
1841 | match_stat_data_racy(istate, &untracked->stat_data, &st)) { | |
883e248b BP |
1842 | fill_stat_data(&untracked->stat_data, &st); |
1843 | return 0; | |
1844 | } | |
91a2288b NTND |
1845 | } |
1846 | ||
b6403131 | 1847 | if (untracked->check_only != !!check_only) |
91a2288b | 1848 | return 0; |
91a2288b NTND |
1849 | |
1850 | /* | |
1851 | * prep_exclude will be called eventually on this directory, | |
65edd96a | 1852 | * but it's called much later in last_matching_pattern(). We |
91a2288b NTND |
1853 | * need it now to determine the validity of the cache for this |
1854 | * path. The next calls will be nearly no-op, the way | |
1855 | * prep_exclude() is designed. | |
1856 | */ | |
1857 | if (path->len && path->buf[path->len - 1] != '/') { | |
1858 | strbuf_addch(path, '/'); | |
207a06ce | 1859 | prep_exclude(dir, istate, path->buf, path->len); |
91a2288b NTND |
1860 | strbuf_setlen(path, path->len - 1); |
1861 | } else | |
207a06ce | 1862 | prep_exclude(dir, istate, path->buf, path->len); |
91a2288b NTND |
1863 | |
1864 | /* hopefully prep_exclude() haven't invalidated this entry... */ | |
1865 | return untracked->valid; | |
1866 | } | |
1867 | ||
cf7c6148 NTND |
1868 | static int open_cached_dir(struct cached_dir *cdir, |
1869 | struct dir_struct *dir, | |
1870 | struct untracked_cache_dir *untracked, | |
207a06ce | 1871 | struct index_state *istate, |
cf7c6148 NTND |
1872 | struct strbuf *path, |
1873 | int check_only) | |
1874 | { | |
b6731550 NTND |
1875 | const char *c_path; |
1876 | ||
cf7c6148 NTND |
1877 | memset(cdir, 0, sizeof(*cdir)); |
1878 | cdir->untracked = untracked; | |
207a06ce | 1879 | if (valid_cached_dir(dir, untracked, istate, path, check_only)) |
91a2288b | 1880 | return 0; |
b6731550 NTND |
1881 | c_path = path->len ? path->buf : "."; |
1882 | cdir->fdir = opendir(c_path); | |
1883 | if (!cdir->fdir) | |
1884 | warning_errno(_("could not open directory '%s'"), c_path); | |
b6403131 NTND |
1885 | if (dir->untracked) { |
1886 | invalidate_directory(dir->untracked, untracked); | |
91a2288b | 1887 | dir->untracked->dir_opened++; |
b6403131 | 1888 | } |
cf7c6148 NTND |
1889 | if (!cdir->fdir) |
1890 | return -1; | |
1891 | return 0; | |
1892 | } | |
1893 | ||
1894 | static int read_cached_dir(struct cached_dir *cdir) | |
1895 | { | |
1896 | if (cdir->fdir) { | |
1897 | cdir->de = readdir(cdir->fdir); | |
1898 | if (!cdir->de) | |
1899 | return -1; | |
1900 | return 0; | |
1901 | } | |
91a2288b NTND |
1902 | while (cdir->nr_dirs < cdir->untracked->dirs_nr) { |
1903 | struct untracked_cache_dir *d = cdir->untracked->dirs[cdir->nr_dirs]; | |
26cb0182 NTND |
1904 | if (!d->recurse) { |
1905 | cdir->nr_dirs++; | |
1906 | continue; | |
1907 | } | |
91a2288b NTND |
1908 | cdir->ucd = d; |
1909 | cdir->nr_dirs++; | |
1910 | return 0; | |
1911 | } | |
1912 | cdir->ucd = NULL; | |
1913 | if (cdir->nr_files < cdir->untracked->untracked_nr) { | |
1914 | struct untracked_cache_dir *d = cdir->untracked; | |
1915 | cdir->file = d->untracked[cdir->nr_files++]; | |
1916 | return 0; | |
1917 | } | |
cf7c6148 NTND |
1918 | return -1; |
1919 | } | |
1920 | ||
1921 | static void close_cached_dir(struct cached_dir *cdir) | |
1922 | { | |
1923 | if (cdir->fdir) | |
1924 | closedir(cdir->fdir); | |
91a2288b NTND |
1925 | /* |
1926 | * We have gone through this directory and found no untracked | |
1927 | * entries. Mark it valid. | |
1928 | */ | |
26cb0182 | 1929 | if (cdir->untracked) { |
91a2288b | 1930 | cdir->untracked->valid = 1; |
26cb0182 NTND |
1931 | cdir->untracked->recurse = 1; |
1932 | } | |
16e2cfa9 JH |
1933 | } |
1934 | ||
c5c4eddd EN |
1935 | static void add_path_to_appropriate_result_list(struct dir_struct *dir, |
1936 | struct untracked_cache_dir *untracked, | |
1937 | struct cached_dir *cdir, | |
1938 | struct index_state *istate, | |
1939 | struct strbuf *path, | |
1940 | int baselen, | |
1941 | const struct pathspec *pathspec, | |
1942 | enum path_treatment state) | |
1943 | { | |
1944 | /* add the path to the appropriate result list */ | |
1945 | switch (state) { | |
1946 | case path_excluded: | |
1947 | if (dir->flags & DIR_SHOW_IGNORED) | |
1948 | dir_add_name(dir, istate, path->buf, path->len); | |
1949 | else if ((dir->flags & DIR_SHOW_IGNORED_TOO) || | |
1950 | ((dir->flags & DIR_COLLECT_IGNORED) && | |
1951 | exclude_matches_pathspec(path->buf, path->len, | |
1952 | pathspec))) | |
1953 | dir_add_ignored(dir, istate, path->buf, path->len); | |
1954 | break; | |
1955 | ||
1956 | case path_untracked: | |
1957 | if (dir->flags & DIR_SHOW_IGNORED) | |
1958 | break; | |
1959 | dir_add_name(dir, istate, path->buf, path->len); | |
1960 | if (cdir->fdir) | |
1961 | add_untracked(untracked, path->buf + baselen); | |
1962 | break; | |
1963 | ||
1964 | default: | |
1965 | break; | |
1966 | } | |
1967 | } | |
1968 | ||
453ec4bd LT |
1969 | /* |
1970 | * Read a directory tree. We currently ignore anything but | |
1971 | * directories, regular files and symlinks. That's because git | |
1972 | * doesn't handle them at all yet. Maybe that will change some | |
1973 | * day. | |
1974 | * | |
1975 | * Also, we ignore the name ".git" (even if it is not a directory). | |
1976 | * That likely will not change. | |
defd7c7b | 1977 | * |
5aaa7fd3 JM |
1978 | * If 'stop_at_first_file' is specified, 'path_excluded' is returned |
1979 | * to signal that a file was found. This is the least significant value that | |
1980 | * indicates that a file was encountered that does not depend on the order of | |
1981 | * whether an untracked or exluded path was encountered first. | |
1982 | * | |
defd7c7b | 1983 | * Returns the most significant path_treatment value encountered in the scan. |
5aaa7fd3 JM |
1984 | * If 'stop_at_first_file' is specified, `path_excluded` is the most |
1985 | * significant path_treatment value that will be returned. | |
453ec4bd | 1986 | */ |
5aaa7fd3 | 1987 | |
defd7c7b | 1988 | static enum path_treatment read_directory_recursive(struct dir_struct *dir, |
0ef8e169 BW |
1989 | struct index_state *istate, const char *base, int baselen, |
1990 | struct untracked_cache_dir *untracked, int check_only, | |
5aaa7fd3 | 1991 | int stop_at_first_file, const struct pathspec *pathspec) |
453ec4bd | 1992 | { |
cf7c6148 | 1993 | struct cached_dir cdir; |
defd7c7b | 1994 | enum path_treatment state, subdir_state, dir_state = path_none; |
bef36921 | 1995 | struct strbuf path = STRBUF_INIT; |
453ec4bd | 1996 | |
bef36921 | 1997 | strbuf_add(&path, base, baselen); |
02cb6753 | 1998 | |
0ef8e169 | 1999 | if (open_cached_dir(&cdir, dir, untracked, istate, &path, check_only)) |
1528d247 RS |
2000 | goto out; |
2001 | ||
0dcb8d7f NTND |
2002 | if (untracked) |
2003 | untracked->check_only = !!check_only; | |
2004 | ||
cf7c6148 | 2005 | while (!read_cached_dir(&cdir)) { |
defd7c7b | 2006 | /* check how the file or directory should be treated */ |
0ef8e169 | 2007 | state = treat_path(dir, untracked, &cdir, istate, &path, |
e1b8c7bd | 2008 | baselen, pathspec); |
0dcb8d7f | 2009 | |
defd7c7b KB |
2010 | if (state > dir_state) |
2011 | dir_state = state; | |
2012 | ||
2013 | /* recurse into subdir if instructed by treat_path */ | |
df5bcdf8 SL |
2014 | if ((state == path_recurse) || |
2015 | ((state == path_untracked) && | |
89a1f4aa EN |
2016 | (get_dtype(cdir.de, istate, path.buf, path.len) == DT_DIR) && |
2017 | ((dir->flags & DIR_SHOW_IGNORED_TOO) || | |
69f272b9 EN |
2018 | (pathspec && |
2019 | do_match_pathspec(istate, pathspec, path.buf, path.len, | |
2020 | baselen, NULL, DO_MATCH_LEADING_PATHSPEC) == MATCHED_RECURSIVELY_LEADING_PATHSPEC)))) { | |
0dcb8d7f NTND |
2021 | struct untracked_cache_dir *ud; |
2022 | ud = lookup_untracked(dir->untracked, untracked, | |
2023 | path.buf + baselen, | |
2024 | path.len - baselen); | |
2025 | subdir_state = | |
0ef8e169 | 2026 | read_directory_recursive(dir, istate, path.buf, |
e1b8c7bd | 2027 | path.len, ud, |
5aaa7fd3 | 2028 | check_only, stop_at_first_file, pathspec); |
defd7c7b KB |
2029 | if (subdir_state > dir_state) |
2030 | dir_state = subdir_state; | |
404ebced | 2031 | |
69f272b9 EN |
2032 | if (pathspec && |
2033 | !match_pathspec(istate, pathspec, path.buf, path.len, | |
404ebced EN |
2034 | 0 /* prefix */, NULL, |
2035 | 0 /* do NOT special case dirs */)) | |
2036 | state = path_none; | |
defd7c7b KB |
2037 | } |
2038 | ||
2039 | if (check_only) { | |
5aaa7fd3 JM |
2040 | if (stop_at_first_file) { |
2041 | /* | |
2042 | * If stopping at first file, then | |
2043 | * signal that a file was found by | |
2044 | * returning `path_excluded`. This is | |
2045 | * to return a consistent value | |
2046 | * regardless of whether an ignored or | |
2047 | * excluded file happened to be | |
2048 | * encountered 1st. | |
2049 | * | |
2050 | * In current usage, the | |
2051 | * `stop_at_first_file` is passed when | |
2052 | * an ancestor directory has matched | |
2053 | * an exclude pattern, so any found | |
2054 | * files will be excluded. | |
2055 | */ | |
2056 | if (dir_state >= path_excluded) { | |
2057 | dir_state = path_excluded; | |
2058 | break; | |
2059 | } | |
2060 | } | |
2061 | ||
defd7c7b | 2062 | /* abort early if maximum state has been reached */ |
0dcb8d7f | 2063 | if (dir_state == path_untracked) { |
91a2288b | 2064 | if (cdir.fdir) |
0dcb8d7f | 2065 | add_untracked(untracked, path.buf + baselen); |
defd7c7b | 2066 | break; |
0dcb8d7f | 2067 | } |
defd7c7b | 2068 | /* skip the dir_add_* part */ |
02cb6753 | 2069 | continue; |
453ec4bd | 2070 | } |
defd7c7b | 2071 | |
c5c4eddd EN |
2072 | add_path_to_appropriate_result_list(dir, untracked, &cdir, |
2073 | istate, &path, baselen, | |
2074 | pathspec, state); | |
453ec4bd | 2075 | } |
cf7c6148 | 2076 | close_cached_dir(&cdir); |
1528d247 | 2077 | out: |
bef36921 | 2078 | strbuf_release(&path); |
453ec4bd | 2079 | |
defd7c7b | 2080 | return dir_state; |
453ec4bd LT |
2081 | } |
2082 | ||
bbf504a9 | 2083 | int cmp_dir_entry(const void *p1, const void *p2) |
453ec4bd LT |
2084 | { |
2085 | const struct dir_entry *e1 = *(const struct dir_entry **)p1; | |
2086 | const struct dir_entry *e2 = *(const struct dir_entry **)p2; | |
2087 | ||
ccdd4a0f | 2088 | return name_compare(e1->name, e1->len, e2->name, e2->len); |
453ec4bd LT |
2089 | } |
2090 | ||
fb898888 | 2091 | /* check if *out lexically strictly contains *in */ |
bbf504a9 | 2092 | int check_dir_entry_contains(const struct dir_entry *out, const struct dir_entry *in) |
fb898888 SL |
2093 | { |
2094 | return (out->len < in->len) && | |
2095 | (out->name[out->len - 1] == '/') && | |
2096 | !memcmp(out->name, in->name, out->len); | |
2097 | } | |
2098 | ||
48ffef96 | 2099 | static int treat_leading_path(struct dir_struct *dir, |
0ef8e169 | 2100 | struct index_state *istate, |
48ffef96 | 2101 | const char *path, int len, |
e1b8c7bd | 2102 | const struct pathspec *pathspec) |
48ffef96 | 2103 | { |
49dc2cc2 RS |
2104 | struct strbuf sb = STRBUF_INIT; |
2105 | int baselen, rc = 0; | |
48ffef96 JH |
2106 | const char *cp; |
2107 | ||
2108 | while (len && path[len - 1] == '/') | |
2109 | len--; | |
2110 | if (!len) | |
2111 | return 1; | |
2112 | baselen = 0; | |
2113 | while (1) { | |
2114 | cp = path + baselen + !!baselen; | |
2115 | cp = memchr(cp, '/', path + len - cp); | |
2116 | if (!cp) | |
2117 | baselen = len; | |
2118 | else | |
2119 | baselen = cp - path; | |
49dc2cc2 RS |
2120 | strbuf_setlen(&sb, 0); |
2121 | strbuf_add(&sb, path, baselen); | |
2122 | if (!is_directory(sb.buf)) | |
2123 | break; | |
e1b8c7bd | 2124 | if (simplify_away(sb.buf, sb.len, pathspec)) |
49dc2cc2 | 2125 | break; |
0ef8e169 | 2126 | if (treat_one_path(dir, NULL, istate, &sb, baselen, pathspec, |
defd7c7b | 2127 | DT_DIR, NULL) == path_none) |
49dc2cc2 RS |
2128 | break; /* do not recurse into it */ |
2129 | if (len <= baselen) { | |
2130 | rc = 1; | |
2131 | break; /* finished checking */ | |
2132 | } | |
48ffef96 | 2133 | } |
49dc2cc2 RS |
2134 | strbuf_release(&sb); |
2135 | return rc; | |
48ffef96 JH |
2136 | } |
2137 | ||
1e8fef60 NTND |
2138 | static const char *get_ident_string(void) |
2139 | { | |
2140 | static struct strbuf sb = STRBUF_INIT; | |
2141 | struct utsname uts; | |
2142 | ||
2143 | if (sb.len) | |
2144 | return sb.buf; | |
100e4337 | 2145 | if (uname(&uts) < 0) |
1e8fef60 | 2146 | die_errno(_("failed to get kernel name and information")); |
0e0f7618 CC |
2147 | strbuf_addf(&sb, "Location %s, system %s", get_git_work_tree(), |
2148 | uts.sysname); | |
1e8fef60 NTND |
2149 | return sb.buf; |
2150 | } | |
2151 | ||
2152 | static int ident_in_untracked(const struct untracked_cache *uc) | |
2153 | { | |
0e0f7618 CC |
2154 | /* |
2155 | * Previous git versions may have saved many NUL separated | |
2156 | * strings in the "ident" field, but it is insane to manage | |
2157 | * many locations, so just take care of the first one. | |
2158 | */ | |
1e8fef60 | 2159 | |
0e0f7618 | 2160 | return !strcmp(uc->ident.buf, get_ident_string()); |
1e8fef60 NTND |
2161 | } |
2162 | ||
0e0f7618 | 2163 | static void set_untracked_ident(struct untracked_cache *uc) |
1e8fef60 | 2164 | { |
0e0f7618 | 2165 | strbuf_reset(&uc->ident); |
1e8fef60 | 2166 | strbuf_addstr(&uc->ident, get_ident_string()); |
0e0f7618 CC |
2167 | |
2168 | /* | |
2169 | * This strbuf used to contain a list of NUL separated | |
2170 | * strings, so save NUL too for backward compatibility. | |
2171 | */ | |
1e8fef60 NTND |
2172 | strbuf_addch(&uc->ident, 0); |
2173 | } | |
2174 | ||
4a4ca479 CC |
2175 | static void new_untracked_cache(struct index_state *istate) |
2176 | { | |
2177 | struct untracked_cache *uc = xcalloc(1, sizeof(*uc)); | |
2178 | strbuf_init(&uc->ident, 100); | |
2179 | uc->exclude_per_dir = ".gitignore"; | |
2180 | /* should be the same flags used by git-status */ | |
2181 | uc->dir_flags = DIR_SHOW_OTHER_DIRECTORIES | DIR_HIDE_EMPTY_DIRECTORIES; | |
0e0f7618 | 2182 | set_untracked_ident(uc); |
4a4ca479 | 2183 | istate->untracked = uc; |
0e0f7618 | 2184 | istate->cache_changed |= UNTRACKED_CHANGED; |
4a4ca479 CC |
2185 | } |
2186 | ||
2187 | void add_untracked_cache(struct index_state *istate) | |
2188 | { | |
2189 | if (!istate->untracked) { | |
2190 | new_untracked_cache(istate); | |
0e0f7618 CC |
2191 | } else { |
2192 | if (!ident_in_untracked(istate->untracked)) { | |
2193 | free_untracked_cache(istate->untracked); | |
2194 | new_untracked_cache(istate); | |
2195 | } | |
2196 | } | |
4a4ca479 CC |
2197 | } |
2198 | ||
07b29bfd CC |
2199 | void remove_untracked_cache(struct index_state *istate) |
2200 | { | |
2201 | if (istate->untracked) { | |
2202 | free_untracked_cache(istate->untracked); | |
2203 | istate->untracked = NULL; | |
2204 | istate->cache_changed |= UNTRACKED_CHANGED; | |
2205 | } | |
2206 | } | |
2207 | ||
ccad261f NTND |
2208 | static struct untracked_cache_dir *validate_untracked_cache(struct dir_struct *dir, |
2209 | int base_len, | |
2210 | const struct pathspec *pathspec) | |
2211 | { | |
2212 | struct untracked_cache_dir *root; | |
026336cb | 2213 | static int untracked_cache_disabled = -1; |
ccad261f | 2214 | |
026336cb JH |
2215 | if (!dir->untracked) |
2216 | return NULL; | |
2217 | if (untracked_cache_disabled < 0) | |
2218 | untracked_cache_disabled = git_env_bool("GIT_DISABLE_UNTRACKED_CACHE", 0); | |
2219 | if (untracked_cache_disabled) | |
ccad261f NTND |
2220 | return NULL; |
2221 | ||
2222 | /* | |
2223 | * We only support $GIT_DIR/info/exclude and core.excludesfile | |
2224 | * as the global ignore rule files. Any other additions | |
2225 | * (e.g. from command line) invalidate the cache. This | |
2226 | * condition also catches running setup_standard_excludes() | |
2227 | * before setting dir->untracked! | |
2228 | */ | |
2229 | if (dir->unmanaged_exclude_files) | |
2230 | return NULL; | |
2231 | ||
2232 | /* | |
2233 | * Optimize for the main use case only: whole-tree git | |
2234 | * status. More work involved in treat_leading_path() if we | |
2235 | * use cache on just a subset of the worktree. pathspec | |
2236 | * support could make the matter even worse. | |
2237 | */ | |
2238 | if (base_len || (pathspec && pathspec->nr)) | |
2239 | return NULL; | |
2240 | ||
2241 | /* Different set of flags may produce different results */ | |
2242 | if (dir->flags != dir->untracked->dir_flags || | |
2243 | /* | |
2244 | * See treat_directory(), case index_nonexistent. Without | |
2245 | * this flag, we may need to also cache .git file content | |
2246 | * for the resolve_gitlink_ref() call, which we don't. | |
2247 | */ | |
2248 | !(dir->flags & DIR_SHOW_OTHER_DIRECTORIES) || | |
2249 | /* We don't support collecting ignore files */ | |
2250 | (dir->flags & (DIR_SHOW_IGNORED | DIR_SHOW_IGNORED_TOO | | |
2251 | DIR_COLLECT_IGNORED))) | |
2252 | return NULL; | |
2253 | ||
2254 | /* | |
2255 | * If we use .gitignore in the cache and now you change it to | |
2256 | * .gitexclude, everything will go wrong. | |
2257 | */ | |
2258 | if (dir->exclude_per_dir != dir->untracked->exclude_per_dir && | |
2259 | strcmp(dir->exclude_per_dir, dir->untracked->exclude_per_dir)) | |
2260 | return NULL; | |
2261 | ||
2262 | /* | |
2263 | * EXC_CMDL is not considered in the cache. If people set it, | |
2264 | * skip the cache. | |
2265 | */ | |
2266 | if (dir->exclude_list_group[EXC_CMDL].nr) | |
2267 | return NULL; | |
2268 | ||
1e8fef60 | 2269 | if (!ident_in_untracked(dir->untracked)) { |
1a07e59c | 2270 | warning(_("untracked cache is disabled on this system or location")); |
1e8fef60 NTND |
2271 | return NULL; |
2272 | } | |
2273 | ||
ccad261f NTND |
2274 | if (!dir->untracked->root) { |
2275 | const int len = sizeof(*dir->untracked->root); | |
2276 | dir->untracked->root = xmalloc(len); | |
2277 | memset(dir->untracked->root, 0, len); | |
2278 | } | |
2279 | ||
2280 | /* Validate $GIT_DIR/info/exclude and core.excludesfile */ | |
2281 | root = dir->untracked->root; | |
9001dc2a | 2282 | if (!oideq(&dir->ss_info_exclude.oid, |
4b33e602 | 2283 | &dir->untracked->ss_info_exclude.oid)) { |
ccad261f NTND |
2284 | invalidate_gitignore(dir->untracked, root); |
2285 | dir->untracked->ss_info_exclude = dir->ss_info_exclude; | |
2286 | } | |
9001dc2a | 2287 | if (!oideq(&dir->ss_excludes_file.oid, |
4b33e602 | 2288 | &dir->untracked->ss_excludes_file.oid)) { |
ccad261f NTND |
2289 | invalidate_gitignore(dir->untracked, root); |
2290 | dir->untracked->ss_excludes_file = dir->ss_excludes_file; | |
2291 | } | |
26cb0182 NTND |
2292 | |
2293 | /* Make sure this directory is not dropped out at saving phase */ | |
2294 | root->recurse = 1; | |
ccad261f NTND |
2295 | return root; |
2296 | } | |
2297 | ||
2c1eb104 BW |
2298 | int read_directory(struct dir_struct *dir, struct index_state *istate, |
2299 | const char *path, int len, const struct pathspec *pathspec) | |
9fc42d60 | 2300 | { |
ccad261f | 2301 | struct untracked_cache_dir *untracked; |
b4189aa8 | 2302 | |
c46c406a NTND |
2303 | trace_performance_enter(); |
2304 | ||
2305 | if (has_symlink_leading_path(path, len)) { | |
2306 | trace_performance_leave("read directory %.*s", len, path); | |
725b0605 | 2307 | return dir->nr; |
c46c406a | 2308 | } |
725b0605 | 2309 | |
ccad261f NTND |
2310 | untracked = validate_untracked_cache(dir, len, pathspec); |
2311 | if (!untracked) | |
2312 | /* | |
2313 | * make sure untracked cache code path is disabled, | |
2314 | * e.g. prep_exclude() | |
2315 | */ | |
2316 | dir->untracked = NULL; | |
2c1eb104 | 2317 | if (!len || treat_leading_path(dir, istate, path, len, pathspec)) |
5aaa7fd3 | 2318 | read_directory_recursive(dir, istate, path, len, untracked, 0, 0, pathspec); |
bbf504a9 SL |
2319 | QSORT(dir->entries, dir->nr, cmp_dir_entry); |
2320 | QSORT(dir->ignored, dir->ignored_nr, cmp_dir_entry); | |
fb898888 SL |
2321 | |
2322 | /* | |
2323 | * If DIR_SHOW_IGNORED_TOO is set, read_directory_recursive() will | |
2324 | * also pick up untracked contents of untracked dirs; by default | |
2325 | * we discard these, but given DIR_KEEP_UNTRACKED_CONTENTS we do not. | |
2326 | */ | |
2327 | if ((dir->flags & DIR_SHOW_IGNORED_TOO) && | |
2328 | !(dir->flags & DIR_KEEP_UNTRACKED_CONTENTS)) { | |
2329 | int i, j; | |
2330 | ||
2331 | /* remove from dir->entries untracked contents of untracked dirs */ | |
2332 | for (i = j = 0; j < dir->nr; j++) { | |
bbf504a9 SL |
2333 | if (i && |
2334 | check_dir_entry_contains(dir->entries[i - 1], dir->entries[j])) { | |
6a83d902 | 2335 | FREE_AND_NULL(dir->entries[j]); |
fb898888 SL |
2336 | } else { |
2337 | dir->entries[i++] = dir->entries[j]; | |
2338 | } | |
2339 | } | |
2340 | ||
2341 | dir->nr = i; | |
2342 | } | |
2343 | ||
c46c406a | 2344 | trace_performance_leave("read directory %.*s", len, path); |
c9ccb5d3 | 2345 | if (dir->untracked) { |
026336cb | 2346 | static int force_untracked_cache = -1; |
c9ccb5d3 | 2347 | static struct trace_key trace_untracked_stats = TRACE_KEY_INIT(UNTRACKED_STATS); |
026336cb JH |
2348 | |
2349 | if (force_untracked_cache < 0) | |
2350 | force_untracked_cache = | |
2351 | git_env_bool("GIT_FORCE_UNTRACKED_CACHE", 0); | |
c9ccb5d3 NTND |
2352 | trace_printf_key(&trace_untracked_stats, |
2353 | "node creation: %u\n" | |
2354 | "gitignore invalidation: %u\n" | |
2355 | "directory invalidation: %u\n" | |
2356 | "opendir: %u\n", | |
2357 | dir->untracked->dir_created, | |
2358 | dir->untracked->gitignore_invalidated, | |
2359 | dir->untracked->dir_invalidated, | |
2360 | dir->untracked->dir_opened); | |
026336cb | 2361 | if (force_untracked_cache && |
fc9ecbeb | 2362 | dir->untracked == istate->untracked && |
1bbb3dba NTND |
2363 | (dir->untracked->dir_opened || |
2364 | dir->untracked->gitignore_invalidated || | |
2365 | dir->untracked->dir_invalidated)) | |
2c1eb104 BW |
2366 | istate->cache_changed |= UNTRACKED_CHANGED; |
2367 | if (dir->untracked != istate->untracked) { | |
6a83d902 | 2368 | FREE_AND_NULL(dir->untracked); |
1bbb3dba | 2369 | } |
c9ccb5d3 | 2370 | } |
453ec4bd LT |
2371 | return dir->nr; |
2372 | } | |
c91f0d92 | 2373 | |
686a4a06 | 2374 | int file_exists(const char *f) |
c91f0d92 | 2375 | { |
686a4a06 | 2376 | struct stat sb; |
a50f9fc5 | 2377 | return lstat(f, &sb) == 0; |
c91f0d92 | 2378 | } |
e6636747 | 2379 | |
0488481e NTND |
2380 | int repo_file_exists(struct repository *repo, const char *path) |
2381 | { | |
2382 | if (repo != the_repository) | |
2383 | BUG("do not know how to check file existence in arbitrary repo"); | |
2384 | ||
2385 | return file_exists(path); | |
2386 | } | |
2387 | ||
63ec5e1f JS |
2388 | static int cmp_icase(char a, char b) |
2389 | { | |
2390 | if (a == b) | |
2391 | return 0; | |
2392 | if (ignore_case) | |
2393 | return toupper(a) - toupper(b); | |
2394 | return a - b; | |
2395 | } | |
2396 | ||
e6636747 | 2397 | /* |
9b125da4 NTND |
2398 | * Given two normalized paths (a trailing slash is ok), if subdir is |
2399 | * outside dir, return -1. Otherwise return the offset in subdir that | |
2400 | * can be used as relative path to dir. | |
e6636747 | 2401 | */ |
9b125da4 | 2402 | int dir_inside_of(const char *subdir, const char *dir) |
e6636747 | 2403 | { |
9b125da4 | 2404 | int offset = 0; |
e6636747 | 2405 | |
9b125da4 | 2406 | assert(dir && subdir && *dir && *subdir); |
e6636747 | 2407 | |
63ec5e1f | 2408 | while (*dir && *subdir && !cmp_icase(*dir, *subdir)) { |
e6636747 | 2409 | dir++; |
9b125da4 NTND |
2410 | subdir++; |
2411 | offset++; | |
490544b1 | 2412 | } |
9b125da4 NTND |
2413 | |
2414 | /* hel[p]/me vs hel[l]/yeah */ | |
2415 | if (*dir && *subdir) | |
2416 | return -1; | |
2417 | ||
2418 | if (!*subdir) | |
2419 | return !*dir ? offset : -1; /* same dir */ | |
2420 | ||
2421 | /* foo/[b]ar vs foo/[] */ | |
2422 | if (is_dir_sep(dir[-1])) | |
2423 | return is_dir_sep(subdir[-1]) ? offset : -1; | |
2424 | ||
2425 | /* foo[/]bar vs foo[] */ | |
2426 | return is_dir_sep(*subdir) ? offset + 1 : -1; | |
e6636747 JS |
2427 | } |
2428 | ||
2429 | int is_inside_dir(const char *dir) | |
2430 | { | |
56b9f6e7 RS |
2431 | char *cwd; |
2432 | int rc; | |
2433 | ||
b892913d NTND |
2434 | if (!dir) |
2435 | return 0; | |
56b9f6e7 RS |
2436 | |
2437 | cwd = xgetcwd(); | |
2438 | rc = (dir_inside_of(cwd, dir) >= 0); | |
2439 | free(cwd); | |
2440 | return rc; | |
e6636747 | 2441 | } |
7155b727 | 2442 | |
55892d23 AP |
2443 | int is_empty_dir(const char *path) |
2444 | { | |
2445 | DIR *dir = opendir(path); | |
2446 | struct dirent *e; | |
2447 | int ret = 1; | |
2448 | ||
2449 | if (!dir) | |
2450 | return 0; | |
2451 | ||
2452 | while ((e = readdir(dir)) != NULL) | |
2453 | if (!is_dot_or_dotdot(e->d_name)) { | |
2454 | ret = 0; | |
2455 | break; | |
2456 | } | |
2457 | ||
2458 | closedir(dir); | |
2459 | return ret; | |
2460 | } | |
2461 | ||
ae2f203e | 2462 | static int remove_dir_recurse(struct strbuf *path, int flag, int *kept_up) |
7155b727 | 2463 | { |
a0f4afbe | 2464 | DIR *dir; |
7155b727 | 2465 | struct dirent *e; |
ae2f203e | 2466 | int ret = 0, original_len = path->len, len, kept_down = 0; |
a0f4afbe | 2467 | int only_empty = (flag & REMOVE_DIR_EMPTY_ONLY); |
c844a803 | 2468 | int keep_toplevel = (flag & REMOVE_DIR_KEEP_TOPLEVEL); |
1053fe82 | 2469 | struct object_id submodule_head; |
7155b727 | 2470 | |
a0f4afbe | 2471 | if ((flag & REMOVE_DIR_KEEP_NESTED_GIT) && |
a98e6101 | 2472 | !resolve_gitlink_ref(path->buf, "HEAD", &submodule_head)) { |
a0f4afbe | 2473 | /* Do not descend and nuke a nested git work tree. */ |
ae2f203e JH |
2474 | if (kept_up) |
2475 | *kept_up = 1; | |
a0f4afbe | 2476 | return 0; |
ae2f203e | 2477 | } |
a0f4afbe | 2478 | |
ae2f203e | 2479 | flag &= ~REMOVE_DIR_KEEP_TOPLEVEL; |
a0f4afbe | 2480 | dir = opendir(path->buf); |
c844a803 | 2481 | if (!dir) { |
863808cd MH |
2482 | if (errno == ENOENT) |
2483 | return keep_toplevel ? -1 : 0; | |
2484 | else if (errno == EACCES && !keep_toplevel) | |
ecb2c282 MH |
2485 | /* |
2486 | * An empty dir could be removable even if it | |
2487 | * is unreadable: | |
2488 | */ | |
c844a803 JH |
2489 | return rmdir(path->buf); |
2490 | else | |
2491 | return -1; | |
2492 | } | |
00b6c178 | 2493 | strbuf_complete(path, '/'); |
7155b727 JS |
2494 | |
2495 | len = path->len; | |
2496 | while ((e = readdir(dir)) != NULL) { | |
2497 | struct stat st; | |
8ca12c0d AP |
2498 | if (is_dot_or_dotdot(e->d_name)) |
2499 | continue; | |
7155b727 JS |
2500 | |
2501 | strbuf_setlen(path, len); | |
2502 | strbuf_addstr(path, e->d_name); | |
863808cd MH |
2503 | if (lstat(path->buf, &st)) { |
2504 | if (errno == ENOENT) | |
2505 | /* | |
2506 | * file disappeared, which is what we | |
2507 | * wanted anyway | |
2508 | */ | |
2509 | continue; | |
2510 | /* fall thru */ | |
2511 | } else if (S_ISDIR(st.st_mode)) { | |
ae2f203e | 2512 | if (!remove_dir_recurse(path, flag, &kept_down)) |
7155b727 | 2513 | continue; /* happy */ |
863808cd MH |
2514 | } else if (!only_empty && |
2515 | (!unlink(path->buf) || errno == ENOENT)) { | |
7155b727 | 2516 | continue; /* happy, too */ |
863808cd | 2517 | } |
7155b727 JS |
2518 | |
2519 | /* path too long, stat fails, or non-directory still exists */ | |
2520 | ret = -1; | |
2521 | break; | |
2522 | } | |
2523 | closedir(dir); | |
2524 | ||
2525 | strbuf_setlen(path, original_len); | |
ae2f203e | 2526 | if (!ret && !keep_toplevel && !kept_down) |
863808cd | 2527 | ret = (!rmdir(path->buf) || errno == ENOENT) ? 0 : -1; |
ae2f203e JH |
2528 | else if (kept_up) |
2529 | /* | |
2530 | * report the uplevel that it is not an error that we | |
2531 | * did not rmdir() our directory. | |
2532 | */ | |
2533 | *kept_up = !ret; | |
7155b727 JS |
2534 | return ret; |
2535 | } | |
039bc64e | 2536 | |
ae2f203e JH |
2537 | int remove_dir_recursively(struct strbuf *path, int flag) |
2538 | { | |
2539 | return remove_dir_recurse(path, flag, NULL); | |
2540 | } | |
2541 | ||
f932729c JK |
2542 | static GIT_PATH_FUNC(git_path_info_exclude, "info/exclude") |
2543 | ||
039bc64e JH |
2544 | void setup_standard_excludes(struct dir_struct *dir) |
2545 | { | |
039bc64e | 2546 | dir->exclude_per_dir = ".gitignore"; |
099d2d86 | 2547 | |
51d18631 | 2548 | /* core.excludesfile defaulting to $XDG_CONFIG_HOME/git/ignore */ |
2845ce7f PT |
2549 | if (!excludes_file) |
2550 | excludes_file = xdg_config_home("ignore"); | |
4698c8fe | 2551 | if (excludes_file && !access_or_warn(excludes_file, R_OK, 0)) |
65edd96a | 2552 | add_patterns_from_file_1(dir, excludes_file, |
38ccaf93 | 2553 | dir->untracked ? &dir->ss_excludes_file : NULL); |
099d2d86 JH |
2554 | |
2555 | /* per repository user preference */ | |
f0056f64 JK |
2556 | if (startup_info->have_repository) { |
2557 | const char *path = git_path_info_exclude(); | |
2558 | if (!access_or_warn(path, R_OK, 0)) | |
65edd96a | 2559 | add_patterns_from_file_1(dir, path, |
f0056f64 JK |
2560 | dir->untracked ? &dir->ss_info_exclude : NULL); |
2561 | } | |
039bc64e | 2562 | } |
4a92d1bf AR |
2563 | |
2564 | int remove_path(const char *name) | |
2565 | { | |
2566 | char *slash; | |
2567 | ||
c7054209 | 2568 | if (unlink(name) && !is_missing_file_error(errno)) |
4a92d1bf AR |
2569 | return -1; |
2570 | ||
2571 | slash = strrchr(name, '/'); | |
2572 | if (slash) { | |
2573 | char *dirs = xstrdup(name); | |
2574 | slash = dirs + (slash - name); | |
2575 | do { | |
2576 | *slash = '\0'; | |
3fc0d131 | 2577 | } while (rmdir(dirs) == 0 && (slash = strrchr(dirs, '/'))); |
4a92d1bf AR |
2578 | free(dirs); |
2579 | } | |
2580 | return 0; | |
2581 | } | |
2582 | ||
270be816 AS |
2583 | /* |
2584 | * Frees memory within dir which was allocated for exclude lists and | |
2585 | * the exclude_stack. Does not free dir itself. | |
2586 | */ | |
2587 | void clear_directory(struct dir_struct *dir) | |
2588 | { | |
2589 | int i, j; | |
2590 | struct exclude_list_group *group; | |
caa3d554 | 2591 | struct pattern_list *pl; |
270be816 AS |
2592 | struct exclude_stack *stk; |
2593 | ||
2594 | for (i = EXC_CMDL; i <= EXC_FILE; i++) { | |
2595 | group = &dir->exclude_list_group[i]; | |
2596 | for (j = 0; j < group->nr; j++) { | |
caa3d554 | 2597 | pl = &group->pl[j]; |
270be816 | 2598 | if (i == EXC_DIRS) |
caa3d554 | 2599 | free((char *)pl->src); |
65edd96a | 2600 | clear_pattern_list(pl); |
270be816 | 2601 | } |
caa3d554 | 2602 | free(group->pl); |
270be816 AS |
2603 | } |
2604 | ||
2605 | stk = dir->exclude_stack; | |
2606 | while (stk) { | |
2607 | struct exclude_stack *prev = stk->prev; | |
2608 | free(stk); | |
2609 | stk = prev; | |
2610 | } | |
aceb9429 | 2611 | strbuf_release(&dir->basebuf); |
270be816 | 2612 | } |
83c094ad NTND |
2613 | |
2614 | struct ondisk_untracked_cache { | |
2615 | struct stat_data info_exclude_stat; | |
2616 | struct stat_data excludes_file_stat; | |
2617 | uint32_t dir_flags; | |
83c094ad NTND |
2618 | }; |
2619 | ||
268ba201 | 2620 | #define ouc_offset(x) offsetof(struct ondisk_untracked_cache, x) |
83c094ad NTND |
2621 | |
2622 | struct write_data { | |
2623 | int index; /* number of written untracked_cache_dir */ | |
2624 | struct ewah_bitmap *check_only; /* from untracked_cache_dir */ | |
2625 | struct ewah_bitmap *valid; /* from untracked_cache_dir */ | |
2626 | struct ewah_bitmap *sha1_valid; /* set if exclude_sha1 is not null */ | |
2627 | struct strbuf out; | |
2628 | struct strbuf sb_stat; | |
2629 | struct strbuf sb_sha1; | |
2630 | }; | |
2631 | ||
2632 | static void stat_data_to_disk(struct stat_data *to, const struct stat_data *from) | |
2633 | { | |
2634 | to->sd_ctime.sec = htonl(from->sd_ctime.sec); | |
2635 | to->sd_ctime.nsec = htonl(from->sd_ctime.nsec); | |
2636 | to->sd_mtime.sec = htonl(from->sd_mtime.sec); | |
2637 | to->sd_mtime.nsec = htonl(from->sd_mtime.nsec); | |
2638 | to->sd_dev = htonl(from->sd_dev); | |
2639 | to->sd_ino = htonl(from->sd_ino); | |
2640 | to->sd_uid = htonl(from->sd_uid); | |
2641 | to->sd_gid = htonl(from->sd_gid); | |
2642 | to->sd_size = htonl(from->sd_size); | |
2643 | } | |
2644 | ||
2645 | static void write_one_dir(struct untracked_cache_dir *untracked, | |
2646 | struct write_data *wd) | |
2647 | { | |
2648 | struct stat_data stat_data; | |
2649 | struct strbuf *out = &wd->out; | |
2650 | unsigned char intbuf[16]; | |
2651 | unsigned int intlen, value; | |
2652 | int i = wd->index++; | |
2653 | ||
2654 | /* | |
2655 | * untracked_nr should be reset whenever valid is clear, but | |
2656 | * for safety.. | |
2657 | */ | |
2658 | if (!untracked->valid) { | |
2659 | untracked->untracked_nr = 0; | |
2660 | untracked->check_only = 0; | |
2661 | } | |
2662 | ||
2663 | if (untracked->check_only) | |
2664 | ewah_set(wd->check_only, i); | |
2665 | if (untracked->valid) { | |
2666 | ewah_set(wd->valid, i); | |
2667 | stat_data_to_disk(&stat_data, &untracked->stat_data); | |
2668 | strbuf_add(&wd->sb_stat, &stat_data, sizeof(stat_data)); | |
2669 | } | |
70c369cd | 2670 | if (!is_null_oid(&untracked->exclude_oid)) { |
83c094ad | 2671 | ewah_set(wd->sha1_valid, i); |
70c369cd | 2672 | strbuf_add(&wd->sb_sha1, untracked->exclude_oid.hash, |
2673 | the_hash_algo->rawsz); | |
83c094ad NTND |
2674 | } |
2675 | ||
2676 | intlen = encode_varint(untracked->untracked_nr, intbuf); | |
2677 | strbuf_add(out, intbuf, intlen); | |
2678 | ||
2679 | /* skip non-recurse directories */ | |
2680 | for (i = 0, value = 0; i < untracked->dirs_nr; i++) | |
2681 | if (untracked->dirs[i]->recurse) | |
2682 | value++; | |
2683 | intlen = encode_varint(value, intbuf); | |
2684 | strbuf_add(out, intbuf, intlen); | |
2685 | ||
2686 | strbuf_add(out, untracked->name, strlen(untracked->name) + 1); | |
2687 | ||
2688 | for (i = 0; i < untracked->untracked_nr; i++) | |
2689 | strbuf_add(out, untracked->untracked[i], | |
2690 | strlen(untracked->untracked[i]) + 1); | |
2691 | ||
2692 | for (i = 0; i < untracked->dirs_nr; i++) | |
2693 | if (untracked->dirs[i]->recurse) | |
2694 | write_one_dir(untracked->dirs[i], wd); | |
2695 | } | |
2696 | ||
2697 | void write_untracked_extension(struct strbuf *out, struct untracked_cache *untracked) | |
2698 | { | |
2699 | struct ondisk_untracked_cache *ouc; | |
2700 | struct write_data wd; | |
2701 | unsigned char varbuf[16]; | |
e0b83735 | 2702 | int varint_len; |
3899b88b | 2703 | const unsigned hashsz = the_hash_algo->rawsz; |
e0b83735 | 2704 | |
3899b88b | 2705 | ouc = xcalloc(1, sizeof(*ouc)); |
83c094ad NTND |
2706 | stat_data_to_disk(&ouc->info_exclude_stat, &untracked->ss_info_exclude.stat); |
2707 | stat_data_to_disk(&ouc->excludes_file_stat, &untracked->ss_excludes_file.stat); | |
83c094ad | 2708 | ouc->dir_flags = htonl(untracked->dir_flags); |
1e8fef60 NTND |
2709 | |
2710 | varint_len = encode_varint(untracked->ident.len, varbuf); | |
2711 | strbuf_add(out, varbuf, varint_len); | |
8109984d | 2712 | strbuf_addbuf(out, &untracked->ident); |
1e8fef60 | 2713 | |
3899b88b | 2714 | strbuf_add(out, ouc, sizeof(*ouc)); |
2715 | strbuf_add(out, untracked->ss_info_exclude.oid.hash, hashsz); | |
2716 | strbuf_add(out, untracked->ss_excludes_file.oid.hash, hashsz); | |
2717 | strbuf_add(out, untracked->exclude_per_dir, strlen(untracked->exclude_per_dir) + 1); | |
6a83d902 | 2718 | FREE_AND_NULL(ouc); |
83c094ad NTND |
2719 | |
2720 | if (!untracked->root) { | |
2721 | varint_len = encode_varint(0, varbuf); | |
2722 | strbuf_add(out, varbuf, varint_len); | |
2723 | return; | |
2724 | } | |
2725 | ||
2726 | wd.index = 0; | |
2727 | wd.check_only = ewah_new(); | |
2728 | wd.valid = ewah_new(); | |
2729 | wd.sha1_valid = ewah_new(); | |
2730 | strbuf_init(&wd.out, 1024); | |
2731 | strbuf_init(&wd.sb_stat, 1024); | |
2732 | strbuf_init(&wd.sb_sha1, 1024); | |
2733 | write_one_dir(untracked->root, &wd); | |
2734 | ||
2735 | varint_len = encode_varint(wd.index, varbuf); | |
2736 | strbuf_add(out, varbuf, varint_len); | |
2737 | strbuf_addbuf(out, &wd.out); | |
2738 | ewah_serialize_strbuf(wd.valid, out); | |
2739 | ewah_serialize_strbuf(wd.check_only, out); | |
2740 | ewah_serialize_strbuf(wd.sha1_valid, out); | |
2741 | strbuf_addbuf(out, &wd.sb_stat); | |
2742 | strbuf_addbuf(out, &wd.sb_sha1); | |
2743 | strbuf_addch(out, '\0'); /* safe guard for string lists */ | |
2744 | ||
2745 | ewah_free(wd.valid); | |
2746 | ewah_free(wd.check_only); | |
2747 | ewah_free(wd.sha1_valid); | |
2748 | strbuf_release(&wd.out); | |
2749 | strbuf_release(&wd.sb_stat); | |
2750 | strbuf_release(&wd.sb_sha1); | |
2751 | } | |
f9e6c649 NTND |
2752 | |
2753 | static void free_untracked(struct untracked_cache_dir *ucd) | |
2754 | { | |
2755 | int i; | |
2756 | if (!ucd) | |
2757 | return; | |
2758 | for (i = 0; i < ucd->dirs_nr; i++) | |
2759 | free_untracked(ucd->dirs[i]); | |
2760 | for (i = 0; i < ucd->untracked_nr; i++) | |
2761 | free(ucd->untracked[i]); | |
2762 | free(ucd->untracked); | |
2763 | free(ucd->dirs); | |
2764 | free(ucd); | |
2765 | } | |
2766 | ||
2767 | void free_untracked_cache(struct untracked_cache *uc) | |
2768 | { | |
2769 | if (uc) | |
2770 | free_untracked(uc->root); | |
2771 | free(uc); | |
2772 | } | |
2773 | ||
2774 | struct read_data { | |
2775 | int index; | |
2776 | struct untracked_cache_dir **ucd; | |
2777 | struct ewah_bitmap *check_only; | |
2778 | struct ewah_bitmap *valid; | |
2779 | struct ewah_bitmap *sha1_valid; | |
2780 | const unsigned char *data; | |
2781 | const unsigned char *end; | |
2782 | }; | |
2783 | ||
268ba201 | 2784 | static void stat_data_from_disk(struct stat_data *to, const unsigned char *data) |
f9e6c649 | 2785 | { |
268ba201 RS |
2786 | memcpy(to, data, sizeof(*to)); |
2787 | to->sd_ctime.sec = ntohl(to->sd_ctime.sec); | |
2788 | to->sd_ctime.nsec = ntohl(to->sd_ctime.nsec); | |
2789 | to->sd_mtime.sec = ntohl(to->sd_mtime.sec); | |
2790 | to->sd_mtime.nsec = ntohl(to->sd_mtime.nsec); | |
2791 | to->sd_dev = ntohl(to->sd_dev); | |
2792 | to->sd_ino = ntohl(to->sd_ino); | |
2793 | to->sd_uid = ntohl(to->sd_uid); | |
2794 | to->sd_gid = ntohl(to->sd_gid); | |
2795 | to->sd_size = ntohl(to->sd_size); | |
f9e6c649 NTND |
2796 | } |
2797 | ||
2798 | static int read_one_dir(struct untracked_cache_dir **untracked_, | |
2799 | struct read_data *rd) | |
2800 | { | |
2801 | struct untracked_cache_dir ud, *untracked; | |
b511d6d5 | 2802 | const unsigned char *data = rd->data, *end = rd->end; |
c6909f99 | 2803 | const unsigned char *eos; |
f9e6c649 | 2804 | unsigned int value; |
08bf354d | 2805 | int i; |
f9e6c649 NTND |
2806 | |
2807 | memset(&ud, 0, sizeof(ud)); | |
2808 | ||
b511d6d5 JK |
2809 | value = decode_varint(&data); |
2810 | if (data > end) | |
f9e6c649 NTND |
2811 | return -1; |
2812 | ud.recurse = 1; | |
2813 | ud.untracked_alloc = value; | |
2814 | ud.untracked_nr = value; | |
2815 | if (ud.untracked_nr) | |
b32fa95f | 2816 | ALLOC_ARRAY(ud.untracked, ud.untracked_nr); |
f9e6c649 | 2817 | |
b511d6d5 JK |
2818 | ud.dirs_alloc = ud.dirs_nr = decode_varint(&data); |
2819 | if (data > end) | |
f9e6c649 | 2820 | return -1; |
b32fa95f | 2821 | ALLOC_ARRAY(ud.dirs, ud.dirs_nr); |
f9e6c649 | 2822 | |
c6909f99 JK |
2823 | eos = memchr(data, '\0', end - data); |
2824 | if (!eos || eos == end) | |
f9e6c649 | 2825 | return -1; |
c6909f99 | 2826 | |
08bf354d | 2827 | *untracked_ = untracked = xmalloc(st_add3(sizeof(*untracked), eos - data, 1)); |
f9e6c649 | 2828 | memcpy(untracked, &ud, sizeof(ud)); |
08bf354d | 2829 | memcpy(untracked->name, data, eos - data + 1); |
b511d6d5 | 2830 | data = eos + 1; |
f9e6c649 NTND |
2831 | |
2832 | for (i = 0; i < untracked->untracked_nr; i++) { | |
c6909f99 JK |
2833 | eos = memchr(data, '\0', end - data); |
2834 | if (!eos || eos == end) | |
f9e6c649 | 2835 | return -1; |
08bf354d | 2836 | untracked->untracked[i] = xmemdupz(data, eos - data); |
b511d6d5 | 2837 | data = eos + 1; |
f9e6c649 NTND |
2838 | } |
2839 | ||
2840 | rd->ucd[rd->index++] = untracked; | |
2841 | rd->data = data; | |
2842 | ||
2843 | for (i = 0; i < untracked->dirs_nr; i++) { | |
08bf354d | 2844 | if (read_one_dir(untracked->dirs + i, rd) < 0) |
f9e6c649 NTND |
2845 | return -1; |
2846 | } | |
2847 | return 0; | |
2848 | } | |
2849 | ||
2850 | static void set_check_only(size_t pos, void *cb) | |
2851 | { | |
2852 | struct read_data *rd = cb; | |
2853 | struct untracked_cache_dir *ud = rd->ucd[pos]; | |
2854 | ud->check_only = 1; | |
2855 | } | |
2856 | ||
2857 | static void read_stat(size_t pos, void *cb) | |
2858 | { | |
2859 | struct read_data *rd = cb; | |
2860 | struct untracked_cache_dir *ud = rd->ucd[pos]; | |
2861 | if (rd->data + sizeof(struct stat_data) > rd->end) { | |
2862 | rd->data = rd->end + 1; | |
2863 | return; | |
2864 | } | |
268ba201 | 2865 | stat_data_from_disk(&ud->stat_data, rd->data); |
f9e6c649 NTND |
2866 | rd->data += sizeof(struct stat_data); |
2867 | ud->valid = 1; | |
2868 | } | |
2869 | ||
70c369cd | 2870 | static void read_oid(size_t pos, void *cb) |
f9e6c649 NTND |
2871 | { |
2872 | struct read_data *rd = cb; | |
2873 | struct untracked_cache_dir *ud = rd->ucd[pos]; | |
70c369cd | 2874 | if (rd->data + the_hash_algo->rawsz > rd->end) { |
f9e6c649 NTND |
2875 | rd->data = rd->end + 1; |
2876 | return; | |
2877 | } | |
70c369cd | 2878 | hashcpy(ud->exclude_oid.hash, rd->data); |
2879 | rd->data += the_hash_algo->rawsz; | |
f9e6c649 NTND |
2880 | } |
2881 | ||
4b33e602 PO |
2882 | static void load_oid_stat(struct oid_stat *oid_stat, const unsigned char *data, |
2883 | const unsigned char *sha1) | |
f9e6c649 | 2884 | { |
4b33e602 PO |
2885 | stat_data_from_disk(&oid_stat->stat, data); |
2886 | hashcpy(oid_stat->oid.hash, sha1); | |
2887 | oid_stat->valid = 1; | |
f9e6c649 NTND |
2888 | } |
2889 | ||
2890 | struct untracked_cache *read_untracked_extension(const void *data, unsigned long sz) | |
2891 | { | |
f9e6c649 NTND |
2892 | struct untracked_cache *uc; |
2893 | struct read_data rd; | |
2894 | const unsigned char *next = data, *end = (const unsigned char *)data + sz; | |
1e8fef60 | 2895 | const char *ident; |
1140bf01 JK |
2896 | int ident_len; |
2897 | ssize_t len; | |
268ba201 | 2898 | const char *exclude_per_dir; |
3899b88b | 2899 | const unsigned hashsz = the_hash_algo->rawsz; |
2900 | const unsigned offset = sizeof(struct ondisk_untracked_cache); | |
2901 | const unsigned exclude_per_dir_offset = offset + 2 * hashsz; | |
f9e6c649 NTND |
2902 | |
2903 | if (sz <= 1 || end[-1] != '\0') | |
2904 | return NULL; | |
2905 | end--; | |
2906 | ||
1e8fef60 NTND |
2907 | ident_len = decode_varint(&next); |
2908 | if (next + ident_len > end) | |
2909 | return NULL; | |
2910 | ident = (const char *)next; | |
2911 | next += ident_len; | |
2912 | ||
3899b88b | 2913 | if (next + exclude_per_dir_offset + 1 > end) |
f9e6c649 NTND |
2914 | return NULL; |
2915 | ||
2916 | uc = xcalloc(1, sizeof(*uc)); | |
1e8fef60 NTND |
2917 | strbuf_init(&uc->ident, ident_len); |
2918 | strbuf_add(&uc->ident, ident, ident_len); | |
4b33e602 PO |
2919 | load_oid_stat(&uc->ss_info_exclude, |
2920 | next + ouc_offset(info_exclude_stat), | |
3899b88b | 2921 | next + offset); |
4b33e602 PO |
2922 | load_oid_stat(&uc->ss_excludes_file, |
2923 | next + ouc_offset(excludes_file_stat), | |
3899b88b | 2924 | next + offset + hashsz); |
268ba201 | 2925 | uc->dir_flags = get_be32(next + ouc_offset(dir_flags)); |
3899b88b | 2926 | exclude_per_dir = (const char *)next + exclude_per_dir_offset; |
268ba201 | 2927 | uc->exclude_per_dir = xstrdup(exclude_per_dir); |
f9e6c649 | 2928 | /* NUL after exclude_per_dir is covered by sizeof(*ouc) */ |
3899b88b | 2929 | next += exclude_per_dir_offset + strlen(exclude_per_dir) + 1; |
f9e6c649 NTND |
2930 | if (next >= end) |
2931 | goto done2; | |
2932 | ||
2933 | len = decode_varint(&next); | |
2934 | if (next > end || len == 0) | |
2935 | goto done2; | |
2936 | ||
2937 | rd.valid = ewah_new(); | |
2938 | rd.check_only = ewah_new(); | |
2939 | rd.sha1_valid = ewah_new(); | |
2940 | rd.data = next; | |
2941 | rd.end = end; | |
2942 | rd.index = 0; | |
b32fa95f | 2943 | ALLOC_ARRAY(rd.ucd, len); |
f9e6c649 NTND |
2944 | |
2945 | if (read_one_dir(&uc->root, &rd) || rd.index != len) | |
2946 | goto done; | |
2947 | ||
2948 | next = rd.data; | |
2949 | len = ewah_read_mmap(rd.valid, next, end - next); | |
2950 | if (len < 0) | |
2951 | goto done; | |
2952 | ||
2953 | next += len; | |
2954 | len = ewah_read_mmap(rd.check_only, next, end - next); | |
2955 | if (len < 0) | |
2956 | goto done; | |
2957 | ||
2958 | next += len; | |
2959 | len = ewah_read_mmap(rd.sha1_valid, next, end - next); | |
2960 | if (len < 0) | |
2961 | goto done; | |
2962 | ||
2963 | ewah_each_bit(rd.check_only, set_check_only, &rd); | |
2964 | rd.data = next + len; | |
2965 | ewah_each_bit(rd.valid, read_stat, &rd); | |
70c369cd | 2966 | ewah_each_bit(rd.sha1_valid, read_oid, &rd); |
f9e6c649 NTND |
2967 | next = rd.data; |
2968 | ||
2969 | done: | |
2970 | free(rd.ucd); | |
2971 | ewah_free(rd.valid); | |
2972 | ewah_free(rd.check_only); | |
2973 | ewah_free(rd.sha1_valid); | |
2974 | done2: | |
2975 | if (next != end) { | |
2976 | free_untracked_cache(uc); | |
2977 | uc = NULL; | |
2978 | } | |
2979 | return uc; | |
2980 | } | |
e931371a | 2981 | |
73f9145f NTND |
2982 | static void invalidate_one_directory(struct untracked_cache *uc, |
2983 | struct untracked_cache_dir *ucd) | |
2984 | { | |
2985 | uc->dir_invalidated++; | |
2986 | ucd->valid = 0; | |
2987 | ucd->untracked_nr = 0; | |
2988 | } | |
2989 | ||
2990 | /* | |
2991 | * Normally when an entry is added or removed from a directory, | |
2992 | * invalidating that directory is enough. No need to touch its | |
2993 | * ancestors. When a directory is shown as "foo/bar/" in git-status | |
2994 | * however, deleting or adding an entry may have cascading effect. | |
2995 | * | |
2996 | * Say the "foo/bar/file" has become untracked, we need to tell the | |
2997 | * untracked_cache_dir of "foo" that "bar/" is not an untracked | |
2998 | * directory any more (because "bar" is managed by foo as an untracked | |
2999 | * "file"). | |
3000 | * | |
3001 | * Similarly, if "foo/bar/file" moves from untracked to tracked and it | |
3002 | * was the last untracked entry in the entire "foo", we should show | |
3003 | * "foo/" instead. Which means we have to invalidate past "bar" up to | |
3004 | * "foo". | |
3005 | * | |
3006 | * This function traverses all directories from root to leaf. If there | |
3007 | * is a chance of one of the above cases happening, we invalidate back | |
3008 | * to root. Otherwise we just invalidate the leaf. There may be a more | |
3009 | * sophisticated way than checking for SHOW_OTHER_DIRECTORIES to | |
3010 | * detect these cases and avoid unnecessary invalidation, for example, | |
3011 | * checking for the untracked entry named "bar/" in "foo", but for now | |
3012 | * stick to something safe and simple. | |
3013 | */ | |
3014 | static int invalidate_one_component(struct untracked_cache *uc, | |
3015 | struct untracked_cache_dir *dir, | |
3016 | const char *path, int len) | |
3017 | { | |
3018 | const char *rest = strchr(path, '/'); | |
3019 | ||
3020 | if (rest) { | |
3021 | int component_len = rest - path; | |
3022 | struct untracked_cache_dir *d = | |
3023 | lookup_untracked(uc, dir, path, component_len); | |
3024 | int ret = | |
3025 | invalidate_one_component(uc, d, rest + 1, | |
3026 | len - (component_len + 1)); | |
3027 | if (ret) | |
3028 | invalidate_one_directory(uc, dir); | |
3029 | return ret; | |
3030 | } | |
3031 | ||
3032 | invalidate_one_directory(uc, dir); | |
3033 | return uc->dir_flags & DIR_SHOW_OTHER_DIRECTORIES; | |
3034 | } | |
3035 | ||
e931371a | 3036 | void untracked_cache_invalidate_path(struct index_state *istate, |
0cacebf0 | 3037 | const char *path, int safe_path) |
e931371a | 3038 | { |
e931371a NTND |
3039 | if (!istate->untracked || !istate->untracked->root) |
3040 | return; | |
68f95b26 | 3041 | if (!safe_path && !verify_path(path, 0)) |
0cacebf0 | 3042 | return; |
73f9145f NTND |
3043 | invalidate_one_component(istate->untracked, istate->untracked->root, |
3044 | path, strlen(path)); | |
e931371a NTND |
3045 | } |
3046 | ||
3047 | void untracked_cache_remove_from_index(struct index_state *istate, | |
3048 | const char *path) | |
3049 | { | |
0cacebf0 | 3050 | untracked_cache_invalidate_path(istate, path, 1); |
e931371a NTND |
3051 | } |
3052 | ||
3053 | void untracked_cache_add_to_index(struct index_state *istate, | |
3054 | const char *path) | |
3055 | { | |
0cacebf0 | 3056 | untracked_cache_invalidate_path(istate, path, 1); |
e931371a | 3057 | } |
47e83eb3 | 3058 | |
da62f786 SB |
3059 | static void connect_wt_gitdir_in_nested(const char *sub_worktree, |
3060 | const char *sub_gitdir) | |
3061 | { | |
3062 | int i; | |
3063 | struct repository subrepo; | |
3064 | struct strbuf sub_wt = STRBUF_INIT; | |
3065 | struct strbuf sub_gd = STRBUF_INIT; | |
3066 | ||
3067 | const struct submodule *sub; | |
3068 | ||
3069 | /* If the submodule has no working tree, we can ignore it. */ | |
3070 | if (repo_init(&subrepo, sub_gitdir, sub_worktree)) | |
3071 | return; | |
3072 | ||
3073 | if (repo_read_index(&subrepo) < 0) | |
a80897c1 | 3074 | die(_("index file corrupt in repo %s"), subrepo.gitdir); |
da62f786 SB |
3075 | |
3076 | for (i = 0; i < subrepo.index->cache_nr; i++) { | |
3077 | const struct cache_entry *ce = subrepo.index->cache[i]; | |
3078 | ||
3079 | if (!S_ISGITLINK(ce->ce_mode)) | |
3080 | continue; | |
3081 | ||
3082 | while (i + 1 < subrepo.index->cache_nr && | |
3083 | !strcmp(ce->name, subrepo.index->cache[i + 1]->name)) | |
3084 | /* | |
3085 | * Skip entries with the same name in different stages | |
3086 | * to make sure an entry is returned only once. | |
3087 | */ | |
3088 | i++; | |
3089 | ||
3090 | sub = submodule_from_path(&subrepo, &null_oid, ce->name); | |
3091 | if (!sub || !is_submodule_active(&subrepo, ce->name)) | |
3092 | /* .gitmodules broken or inactive sub */ | |
3093 | continue; | |
3094 | ||
3095 | strbuf_reset(&sub_wt); | |
3096 | strbuf_reset(&sub_gd); | |
3097 | strbuf_addf(&sub_wt, "%s/%s", sub_worktree, sub->path); | |
3098 | strbuf_addf(&sub_gd, "%s/modules/%s", sub_gitdir, sub->name); | |
3099 | ||
3100 | connect_work_tree_and_git_dir(sub_wt.buf, sub_gd.buf, 1); | |
3101 | } | |
3102 | strbuf_release(&sub_wt); | |
3103 | strbuf_release(&sub_gd); | |
3104 | repo_clear(&subrepo); | |
3105 | } | |
3106 | ||
3107 | void connect_work_tree_and_git_dir(const char *work_tree_, | |
3108 | const char *git_dir_, | |
3109 | int recurse_into_nested) | |
47e83eb3 | 3110 | { |
365444a6 SB |
3111 | struct strbuf gitfile_sb = STRBUF_INIT; |
3112 | struct strbuf cfg_sb = STRBUF_INIT; | |
47e83eb3 | 3113 | struct strbuf rel_path = STRBUF_INIT; |
365444a6 | 3114 | char *git_dir, *work_tree; |
47e83eb3 | 3115 | |
365444a6 SB |
3116 | /* Prepare .git file */ |
3117 | strbuf_addf(&gitfile_sb, "%s/.git", work_tree_); | |
3118 | if (safe_create_leading_directories_const(gitfile_sb.buf)) | |
3119 | die(_("could not create directories for %s"), gitfile_sb.buf); | |
3120 | ||
3121 | /* Prepare config file */ | |
3122 | strbuf_addf(&cfg_sb, "%s/config", git_dir_); | |
3123 | if (safe_create_leading_directories_const(cfg_sb.buf)) | |
3124 | die(_("could not create directories for %s"), cfg_sb.buf); | |
47e83eb3 | 3125 | |
e394fa01 JH |
3126 | git_dir = real_pathdup(git_dir_, 1); |
3127 | work_tree = real_pathdup(work_tree_, 1); | |
365444a6 SB |
3128 | |
3129 | /* Write .git file */ | |
3130 | write_file(gitfile_sb.buf, "gitdir: %s", | |
3131 | relative_path(git_dir, work_tree, &rel_path)); | |
47e83eb3 | 3132 | /* Update core.worktree setting */ |
365444a6 | 3133 | git_config_set_in_file(cfg_sb.buf, "core.worktree", |
47e83eb3 SB |
3134 | relative_path(work_tree, git_dir, &rel_path)); |
3135 | ||
365444a6 SB |
3136 | strbuf_release(&gitfile_sb); |
3137 | strbuf_release(&cfg_sb); | |
47e83eb3 | 3138 | strbuf_release(&rel_path); |
da62f786 SB |
3139 | |
3140 | if (recurse_into_nested) | |
3141 | connect_wt_gitdir_in_nested(work_tree, git_dir); | |
3142 | ||
47e83eb3 SB |
3143 | free(work_tree); |
3144 | free(git_dir); | |
3145 | } | |
f6f85861 SB |
3146 | |
3147 | /* | |
3148 | * Migrate the git directory of the given path from old_git_dir to new_git_dir. | |
3149 | */ | |
3150 | void relocate_gitdir(const char *path, const char *old_git_dir, const char *new_git_dir) | |
3151 | { | |
3152 | if (rename(old_git_dir, new_git_dir) < 0) | |
3153 | die_errno(_("could not migrate git directory from '%s' to '%s'"), | |
3154 | old_git_dir, new_git_dir); | |
3155 | ||
da62f786 | 3156 | connect_work_tree_and_git_dir(path, new_git_dir, 0); |
f6f85861 | 3157 | } |