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