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