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