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