2 * This handles recursive filename detection with exclude
3 * files, index knowledge etc..
5 * See Documentation/technical/api-directory-listing.txt
7 * Copyright (C) Linus Torvalds, 2005-2006
8 * Junio Hamano, 2005-2006
13 #include "object-store.h"
16 #include "wildmatch.h"
20 #include "ewah/ewok.h"
21 #include "fsmonitor.h"
22 #include "submodule-config.h"
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.
38 * Support data structure for our opendir/readdir/closedir wrappers
42 struct untracked_cache_dir
*untracked
;
48 struct untracked_cache_dir
*ucd
;
51 static enum path_treatment
read_directory_recursive(struct dir_struct
*dir
,
52 struct index_state
*istate
, const char *path
, int len
,
53 struct untracked_cache_dir
*untracked
,
54 int check_only
, int stop_at_first_file
, const struct pathspec
*pathspec
);
55 static int get_dtype(struct dirent
*de
, struct index_state
*istate
,
56 const char *path
, int len
);
58 int count_slashes(const char *s
)
67 int fspathcmp(const char *a
, const char *b
)
69 return ignore_case
? strcasecmp(a
, b
) : strcmp(a
, b
);
72 int fspathncmp(const char *a
, const char *b
, size_t count
)
74 return ignore_case
? strncasecmp(a
, b
, count
) : strncmp(a
, b
, count
);
77 int git_fnmatch(const struct pathspec_item
*item
,
78 const char *pattern
, const char *string
,
82 if (ps_strncmp(item
, pattern
, string
, prefix
))
87 if (item
->flags
& PATHSPEC_ONESTAR
) {
88 int pattern_len
= strlen(++pattern
);
89 int string_len
= strlen(string
);
90 return string_len
< pattern_len
||
91 ps_strcmp(item
, pattern
,
92 string
+ string_len
- pattern_len
);
94 if (item
->magic
& PATHSPEC_GLOB
)
95 return wildmatch(pattern
, string
,
97 (item
->magic
& PATHSPEC_ICASE
? WM_CASEFOLD
: 0));
99 /* wildmatch has not learned no FNM_PATHNAME mode yet */
100 return wildmatch(pattern
, string
,
101 item
->magic
& PATHSPEC_ICASE
? WM_CASEFOLD
: 0);
104 static int fnmatch_icase_mem(const char *pattern
, int patternlen
,
105 const char *string
, int stringlen
,
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
;
114 if (pattern
[patternlen
]) {
115 strbuf_add(&pat_buf
, pattern
, patternlen
);
116 use_pat
= pat_buf
.buf
;
118 if (string
[stringlen
]) {
119 strbuf_add(&str_buf
, string
, stringlen
);
120 use_str
= str_buf
.buf
;
124 flags
|= WM_CASEFOLD
;
125 match_status
= wildmatch(use_pat
, use_str
, flags
);
127 strbuf_release(&pat_buf
);
128 strbuf_release(&str_buf
);
133 static size_t common_prefix_len(const struct pathspec
*pathspec
)
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
142 * subdir xyz, the common prefix is still xyz, not xyz/abc as
145 GUARD_PATHSPEC(pathspec
,
154 for (n
= 0; n
< pathspec
->nr
; n
++) {
155 size_t i
= 0, len
= 0, item_len
;
156 if (pathspec
->items
[n
].magic
& PATHSPEC_EXCLUDE
)
158 if (pathspec
->items
[n
].magic
& PATHSPEC_ICASE
)
159 item_len
= pathspec
->items
[n
].prefix
;
161 item_len
= pathspec
->items
[n
].nowildcard_len
;
162 while (i
< item_len
&& (n
== 0 || i
< max
)) {
163 char c
= pathspec
->items
[n
].match
[i
];
164 if (c
!= pathspec
->items
[0].match
[i
])
170 if (n
== 0 || len
< max
) {
180 * Returns a copy of the longest leading path common among all
183 char *common_prefix(const struct pathspec
*pathspec
)
185 unsigned long len
= common_prefix_len(pathspec
);
187 return len
? xmemdupz(pathspec
->items
[0].match
, len
) : NULL
;
190 int fill_directory(struct dir_struct
*dir
,
191 struct index_state
*istate
,
192 const struct pathspec
*pathspec
)
198 * Calculate common prefix for the pathspec, and
199 * use that to optimize the directory walk
201 prefix_len
= common_prefix_len(pathspec
);
202 prefix
= prefix_len
? pathspec
->items
[0].match
: "";
204 /* Read the directory and prune it */
205 read_directory(dir
, istate
, prefix
, prefix_len
, pathspec
);
210 int within_depth(const char *name
, int namelen
,
211 int depth
, int max_depth
)
213 const char *cp
= name
, *cpe
= name
+ namelen
;
219 if (depth
> max_depth
)
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.
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
235 * Optionally updates the given oid_stat with the given OID (when valid).
237 static int do_read_blob(const struct object_id
*oid
, struct oid_stat
*oid_stat
,
238 size_t *size_out
, char **data_out
)
240 enum object_type type
;
247 data
= read_object_file(oid
, &type
, &sz
);
248 if (!data
|| type
!= OBJ_BLOB
) {
254 memset(&oid_stat
->stat
, 0, sizeof(oid_stat
->stat
));
255 oidcpy(&oid_stat
->oid
, oid
);
263 if (data
[sz
- 1] != '\n') {
264 data
= xrealloc(data
, st_add(sz
, 1));
268 *size_out
= xsize_t(sz
);
274 #define DO_MATCH_EXCLUDE (1<<0)
275 #define DO_MATCH_DIRECTORY (1<<1)
276 #define DO_MATCH_LEADING_PATHSPEC (1<<2)
279 * Does the given pathspec match the given name? A match is found if
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").
286 * Return value tells which case it was (1-4), or 0 when there is no match.
288 * It may be instructive to look at a small table of concrete examples
289 * to understand the differences between 1, 2, and 4:
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
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.
301 static int match_pathspec_item(const struct index_state
*istate
,
302 const struct pathspec_item
*item
, int prefix
,
303 const char *name
, int namelen
, unsigned flags
)
305 /* name/namelen has prefix cut off by caller */
306 const char *match
= item
->match
+ prefix
;
307 int matchlen
= item
->len
- prefix
;
310 * The normal call pattern is:
311 * 1. prefix = common_prefix_len(ps);
312 * 2. prune something, or fill_directory
313 * 3. match_pathspec()
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
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.
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.
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)
338 if (item
->prefix
&& (item
->magic
& PATHSPEC_ICASE
) &&
339 strncmp(item
->match
, name
- prefix
, item
->prefix
))
342 if (item
->attr_match_nr
&&
343 !match_pathspec_attrs(istate
, name
, namelen
, item
))
346 /* If the match was just the prefix, we matched */
348 return MATCHED_RECURSIVELY
;
350 if (matchlen
<= namelen
&& !ps_strncmp(item
, match
, name
, matchlen
)) {
351 if (matchlen
== namelen
)
352 return MATCHED_EXACTLY
;
354 if (match
[matchlen
-1] == '/' || name
[matchlen
] == '/')
355 return MATCHED_RECURSIVELY
;
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
;
362 if (item
->nowildcard_len
< item
->len
&&
363 !git_fnmatch(item
, match
, name
,
364 item
->nowildcard_len
- prefix
))
365 return MATCHED_FNMATCH
;
367 /* Perform checks to see if "name" is a leading string of the pathspec */
368 if (flags
& DO_MATCH_LEADING_PATHSPEC
) {
369 /* name is a literal prefix of the pathspec */
370 int offset
= name
[namelen
-1] == '/' ? 1 : 0;
371 if ((namelen
< matchlen
) &&
372 (match
[namelen
-offset
] == '/') &&
373 !ps_strncmp(item
, match
, name
, namelen
))
374 return MATCHED_RECURSIVELY_LEADING_PATHSPEC
;
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
))
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.
391 return MATCHED_RECURSIVELY_LEADING_PATHSPEC
;
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
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.
412 static int do_match_pathspec(const struct index_state
*istate
,
413 const struct pathspec
*ps
,
414 const char *name
, int namelen
,
415 int prefix
, char *seen
,
418 int i
, retval
= 0, exclude
= flags
& DO_MATCH_EXCLUDE
;
430 if (!ps
->recursive
||
431 !(ps
->magic
& PATHSPEC_MAXDEPTH
) ||
433 return MATCHED_RECURSIVELY
;
435 if (within_depth(name
, namelen
, 0, ps
->max_depth
))
436 return MATCHED_EXACTLY
;
444 for (i
= ps
->nr
- 1; i
>= 0; i
--) {
447 if ((!exclude
&& ps
->items
[i
].magic
& PATHSPEC_EXCLUDE
) ||
448 ( exclude
&& !(ps
->items
[i
].magic
& PATHSPEC_EXCLUDE
)))
451 if (seen
&& seen
[i
] == MATCHED_EXACTLY
)
454 * Make exclude patterns optional and never report
455 * "pathspec ':(exclude)foo' matches no files"
457 if (seen
&& ps
->items
[i
].magic
& PATHSPEC_EXCLUDE
)
458 seen
[i
] = MATCHED_FNMATCH
;
459 how
= match_pathspec_item(istate
, ps
->items
+i
, prefix
, name
,
462 (ps
->magic
& PATHSPEC_MAXDEPTH
) &&
463 ps
->max_depth
!= -1 &&
464 how
&& how
!= MATCHED_FNMATCH
) {
465 int len
= ps
->items
[i
].len
;
466 if (name
[len
] == '/')
468 if (within_depth(name
+len
, namelen
-len
, 0, ps
->max_depth
))
469 how
= MATCHED_EXACTLY
;
476 if (seen
&& seen
[i
] < how
)
483 int match_pathspec(const struct index_state
*istate
,
484 const struct pathspec
*ps
,
485 const char *name
, int namelen
,
486 int prefix
, char *seen
, int is_dir
)
488 int positive
, negative
;
489 unsigned flags
= is_dir
? DO_MATCH_DIRECTORY
: 0;
490 positive
= do_match_pathspec(istate
, ps
, name
, namelen
,
491 prefix
, seen
, flags
);
492 if (!(ps
->magic
& PATHSPEC_EXCLUDE
) || !positive
)
494 negative
= do_match_pathspec(istate
, ps
, name
, namelen
,
496 flags
| DO_MATCH_EXCLUDE
);
497 return negative
? 0 : positive
;
501 * Check if a submodule is a superset of the pathspec
503 int submodule_path_match(const struct index_state
*istate
,
504 const struct pathspec
*ps
,
505 const char *submodule_name
,
508 int matched
= do_match_pathspec(istate
, ps
, submodule_name
,
509 strlen(submodule_name
),
512 DO_MATCH_LEADING_PATHSPEC
);
516 int report_path_error(const char *ps_matched
,
517 const struct pathspec
*pathspec
)
520 * Make sure all pathspec matched; otherwise it is an error.
523 for (num
= 0; num
< pathspec
->nr
; num
++) {
524 int other
, found_dup
;
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.
534 for (found_dup
= other
= 0;
535 !found_dup
&& other
< pathspec
->nr
;
537 if (other
== num
|| !ps_matched
[other
])
539 if (!strcmp(pathspec
->items
[other
].original
,
540 pathspec
->items
[num
].original
))
542 * Ok, we have a match already.
549 error(_("pathspec '%s' did not match any file(s) known to git"),
550 pathspec
->items
[num
].original
);
557 * Return the length of the "simple" part of a path match limiter.
559 int simple_length(const char *match
)
564 unsigned char c
= *match
++;
566 if (c
== '\0' || is_glob_special(c
))
571 int no_wildcard(const char *string
)
573 return string
[simple_length(string
)] == '\0';
576 void parse_path_pattern(const char **pattern
,
581 const char *p
= *pattern
;
586 *flags
|= PATTERN_FLAG_NEGATIVE
;
590 if (len
&& p
[len
- 1] == '/') {
592 *flags
|= PATTERN_FLAG_MUSTBEDIR
;
594 for (i
= 0; i
< len
; i
++) {
599 *flags
|= PATTERN_FLAG_NODIR
;
600 *nowildcardlen
= simple_length(p
);
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
606 if (*nowildcardlen
> len
)
607 *nowildcardlen
= len
;
608 if (*p
== '*' && no_wildcard(p
+ 1))
609 *flags
|= PATTERN_FLAG_ENDSWITH
;
614 int pl_hashmap_cmp(const void *unused_cmp_data
,
615 const struct hashmap_entry
*a
,
616 const struct hashmap_entry
*b
,
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
);
624 size_t min_len
= ee1
->patternlen
<= ee2
->patternlen
629 return strncasecmp(ee1
->pattern
, ee2
->pattern
, min_len
);
630 return strncmp(ee1
->pattern
, ee2
->pattern
, min_len
);
633 static char *dup_and_filter_pattern(const char *pattern
)
637 char *result
= xstrdup(pattern
);
643 /* skip escape characters (once) */
663 static void add_pattern_to_hashsets(struct pattern_list
*pl
, struct path_pattern
*given
)
665 struct pattern_entry
*translated
;
668 const char *prev
, *cur
, *next
;
670 if (!pl
->use_cone_patterns
)
673 if (given
->flags
& PATTERN_FLAG_NEGATIVE
&&
674 given
->flags
& PATTERN_FLAG_MUSTBEDIR
&&
675 !strcmp(given
->pattern
, "/*")) {
680 if (!given
->flags
&& !strcmp(given
->pattern
, "/*")) {
685 if (given
->patternlen
<= 2 ||
686 *given
->pattern
== '*' ||
687 strstr(given
->pattern
, "**")) {
688 /* Not a cone pattern. */
689 warning(_("unrecognized pattern: '%s'"), given
->pattern
);
693 prev
= given
->pattern
;
694 cur
= given
->pattern
+ 1;
695 next
= given
->pattern
+ 2;
698 /* Watch for glob characters '*', '\', '[', '?' */
699 if (!is_glob_special(*cur
))
702 /* But only if *prev != '\\' */
706 /* But allow the initial '\' */
708 is_glob_special(*next
))
711 /* But a trailing '/' then '*' is fine */
717 /* Not a cone pattern. */
718 warning(_("unrecognized pattern: '%s'"), given
->pattern
);
727 if (given
->patternlen
> 2 &&
728 !strcmp(given
->pattern
+ given
->patternlen
- 2, "/*")) {
729 if (!(given
->flags
& PATTERN_FLAG_NEGATIVE
)) {
730 /* Not a cone pattern. */
731 warning(_("unrecognized pattern: '%s'"), given
->pattern
);
735 truncated
= dup_and_filter_pattern(given
->pattern
);
737 translated
= xmalloc(sizeof(struct pattern_entry
));
738 translated
->pattern
= truncated
;
739 translated
->patternlen
= given
->patternlen
- 2;
740 hashmap_entry_init(&translated
->ent
,
742 strihash(translated
->pattern
) :
743 strhash(translated
->pattern
));
745 if (!hashmap_get_entry(&pl
->recursive_hashmap
,
746 translated
, ent
, NULL
)) {
747 /* We did not see the "parent" included */
748 warning(_("unrecognized negative pattern: '%s'"),
755 hashmap_add(&pl
->parent_hashmap
, &translated
->ent
);
756 hashmap_remove(&pl
->recursive_hashmap
, &translated
->ent
, &data
);
761 if (given
->flags
& PATTERN_FLAG_NEGATIVE
) {
762 warning(_("unrecognized negative pattern: '%s'"),
767 translated
= xmalloc(sizeof(struct pattern_entry
));
769 translated
->pattern
= dup_and_filter_pattern(given
->pattern
);
770 translated
->patternlen
= given
->patternlen
;
771 hashmap_entry_init(&translated
->ent
,
773 strihash(translated
->pattern
) :
774 strhash(translated
->pattern
));
776 hashmap_add(&pl
->recursive_hashmap
, &translated
->ent
);
778 if (hashmap_get_entry(&pl
->parent_hashmap
, translated
, ent
, NULL
)) {
779 /* we already included this at the parent level */
780 warning(_("your sparse-checkout file may have issues: pattern '%s' is repeated"),
782 hashmap_remove(&pl
->parent_hashmap
, &translated
->ent
, &data
);
790 warning(_("disabling cone pattern matching"));
791 hashmap_free_entries(&pl
->parent_hashmap
, struct pattern_entry
, ent
);
792 hashmap_free_entries(&pl
->recursive_hashmap
, struct pattern_entry
, ent
);
793 pl
->use_cone_patterns
= 0;
796 static int hashmap_contains_path(struct hashmap
*map
,
797 struct strbuf
*pattern
)
799 struct pattern_entry p
;
801 /* Check straight mapping */
802 p
.pattern
= pattern
->buf
;
803 p
.patternlen
= pattern
->len
;
804 hashmap_entry_init(&p
.ent
,
806 strihash(p
.pattern
) :
808 return !!hashmap_get_entry(map
, &p
, ent
, NULL
);
811 int hashmap_contains_parent(struct hashmap
*map
,
813 struct strbuf
*buffer
)
817 strbuf_setlen(buffer
, 0);
820 strbuf_addch(buffer
, '/');
822 strbuf_addstr(buffer
, path
);
824 slash_pos
= strrchr(buffer
->buf
, '/');
826 while (slash_pos
> buffer
->buf
) {
827 strbuf_setlen(buffer
, slash_pos
- buffer
->buf
);
829 if (hashmap_contains_path(map
, buffer
))
832 slash_pos
= strrchr(buffer
->buf
, '/');
838 void add_pattern(const char *string
, const char *base
,
839 int baselen
, struct pattern_list
*pl
, int srcpos
)
841 struct path_pattern
*pattern
;
846 parse_path_pattern(&string
, &patternlen
, &flags
, &nowildcardlen
);
847 if (flags
& PATTERN_FLAG_MUSTBEDIR
) {
848 FLEXPTR_ALLOC_MEM(pattern
, pattern
, string
, patternlen
);
850 pattern
= xmalloc(sizeof(*pattern
));
851 pattern
->pattern
= string
;
853 pattern
->patternlen
= patternlen
;
854 pattern
->nowildcardlen
= nowildcardlen
;
855 pattern
->base
= base
;
856 pattern
->baselen
= baselen
;
857 pattern
->flags
= flags
;
858 pattern
->srcpos
= srcpos
;
859 ALLOC_GROW(pl
->patterns
, pl
->nr
+ 1, pl
->alloc
);
860 pl
->patterns
[pl
->nr
++] = pattern
;
863 add_pattern_to_hashsets(pl
, pattern
);
866 static int read_skip_worktree_file_from_index(const struct index_state
*istate
,
868 size_t *size_out
, char **data_out
,
869 struct oid_stat
*oid_stat
)
874 pos
= index_name_pos(istate
, path
, len
);
877 if (!ce_skip_worktree(istate
->cache
[pos
]))
880 return do_read_blob(&istate
->cache
[pos
]->oid
, oid_stat
, size_out
, data_out
);
884 * Frees memory within pl which was allocated for exclude patterns and
885 * the file buffer. Does not free pl itself.
887 void clear_pattern_list(struct pattern_list
*pl
)
891 for (i
= 0; i
< pl
->nr
; i
++)
892 free(pl
->patterns
[i
]);
896 memset(pl
, 0, sizeof(*pl
));
899 static void trim_trailing_spaces(char *buf
)
901 char *p
, *last_space
= NULL
;
903 for (p
= buf
; *p
; p
++)
923 * Given a subdirectory name and "dir" of the current directory,
924 * search the subdir in "dir" and return it, or create a new one if it
925 * does not exist in "dir".
927 * If "name" has the trailing slash, it'll be excluded in the search.
929 static struct untracked_cache_dir
*lookup_untracked(struct untracked_cache
*uc
,
930 struct untracked_cache_dir
*dir
,
931 const char *name
, int len
)
934 struct untracked_cache_dir
*d
;
937 if (len
&& name
[len
- 1] == '/')
941 while (last
> first
) {
942 int cmp
, next
= first
+ ((last
- first
) >> 1);
944 cmp
= strncmp(name
, d
->name
, len
);
945 if (!cmp
&& strlen(d
->name
) > len
)
957 FLEX_ALLOC_MEM(d
, name
, name
, len
);
959 ALLOC_GROW(dir
->dirs
, dir
->dirs_nr
+ 1, dir
->dirs_alloc
);
960 MOVE_ARRAY(dir
->dirs
+ first
+ 1, dir
->dirs
+ first
,
961 dir
->dirs_nr
- first
);
963 dir
->dirs
[first
] = d
;
967 static void do_invalidate_gitignore(struct untracked_cache_dir
*dir
)
971 dir
->untracked_nr
= 0;
972 for (i
= 0; i
< dir
->dirs_nr
; i
++)
973 do_invalidate_gitignore(dir
->dirs
[i
]);
976 static void invalidate_gitignore(struct untracked_cache
*uc
,
977 struct untracked_cache_dir
*dir
)
979 uc
->gitignore_invalidated
++;
980 do_invalidate_gitignore(dir
);
983 static void invalidate_directory(struct untracked_cache
*uc
,
984 struct untracked_cache_dir
*dir
)
989 * Invalidation increment here is just roughly correct. If
990 * untracked_nr or any of dirs[].recurse is non-zero, we
991 * should increment dir_invalidated too. But that's more
995 uc
->dir_invalidated
++;
998 dir
->untracked_nr
= 0;
999 for (i
= 0; i
< dir
->dirs_nr
; i
++)
1000 dir
->dirs
[i
]->recurse
= 0;
1003 static int add_patterns_from_buffer(char *buf
, size_t size
,
1004 const char *base
, int baselen
,
1005 struct pattern_list
*pl
);
1008 * Given a file with name "fname", read it (either from disk, or from
1009 * an index if 'istate' is non-null), parse it and store the
1010 * exclude rules in "pl".
1012 * If "ss" is not NULL, compute SHA-1 of the exclude file and fill
1013 * stat data from disk (only valid if add_patterns returns zero). If
1014 * ss_valid is non-zero, "ss" must contain good value as input.
1016 static int add_patterns(const char *fname
, const char *base
, int baselen
,
1017 struct pattern_list
*pl
, struct index_state
*istate
,
1018 struct oid_stat
*oid_stat
)
1026 fd
= open(fname
, O_RDONLY
);
1027 if (fd
< 0 || fstat(fd
, &st
) < 0) {
1029 warn_on_fopen_errors(fname
);
1034 r
= read_skip_worktree_file_from_index(istate
, fname
,
1040 size
= xsize_t(st
.st_size
);
1043 fill_stat_data(&oid_stat
->stat
, &st
);
1044 oidcpy(&oid_stat
->oid
, the_hash_algo
->empty_blob
);
1045 oid_stat
->valid
= 1;
1050 buf
= xmallocz(size
);
1051 if (read_in_full(fd
, buf
, size
) != size
) {
1060 if (oid_stat
->valid
&&
1061 !match_stat_data_racy(istate
, &oid_stat
->stat
, &st
))
1062 ; /* no content change, ss->sha1 still good */
1064 (pos
= index_name_pos(istate
, fname
, strlen(fname
))) >= 0 &&
1065 !ce_stage(istate
->cache
[pos
]) &&
1066 ce_uptodate(istate
->cache
[pos
]) &&
1067 !would_convert_to_git(istate
, fname
))
1068 oidcpy(&oid_stat
->oid
,
1069 &istate
->cache
[pos
]->oid
);
1071 hash_object_file(buf
, size
, "blob",
1073 fill_stat_data(&oid_stat
->stat
, &st
);
1074 oid_stat
->valid
= 1;
1078 add_patterns_from_buffer(buf
, size
, base
, baselen
, pl
);
1082 static int add_patterns_from_buffer(char *buf
, size_t size
,
1083 const char *base
, int baselen
,
1084 struct pattern_list
*pl
)
1089 hashmap_init(&pl
->recursive_hashmap
, pl_hashmap_cmp
, NULL
, 0);
1090 hashmap_init(&pl
->parent_hashmap
, pl_hashmap_cmp
, NULL
, 0);
1094 if (skip_utf8_bom(&buf
, size
))
1095 size
-= buf
- pl
->filebuf
;
1099 for (i
= 0; i
< size
; i
++) {
1100 if (buf
[i
] == '\n') {
1101 if (entry
!= buf
+ i
&& entry
[0] != '#') {
1102 buf
[i
- (i
&& buf
[i
-1] == '\r')] = 0;
1103 trim_trailing_spaces(entry
);
1104 add_pattern(entry
, base
, baselen
, pl
, lineno
);
1107 entry
= buf
+ i
+ 1;
1113 int add_patterns_from_file_to_list(const char *fname
, const char *base
,
1114 int baselen
, struct pattern_list
*pl
,
1115 struct index_state
*istate
)
1117 return add_patterns(fname
, base
, baselen
, pl
, istate
, NULL
);
1120 int add_patterns_from_blob_to_list(
1121 struct object_id
*oid
,
1122 const char *base
, int baselen
,
1123 struct pattern_list
*pl
)
1129 r
= do_read_blob(oid
, NULL
, &size
, &buf
);
1133 add_patterns_from_buffer(buf
, size
, base
, baselen
, pl
);
1137 struct pattern_list
*add_pattern_list(struct dir_struct
*dir
,
1138 int group_type
, const char *src
)
1140 struct pattern_list
*pl
;
1141 struct exclude_list_group
*group
;
1143 group
= &dir
->exclude_list_group
[group_type
];
1144 ALLOC_GROW(group
->pl
, group
->nr
+ 1, group
->alloc
);
1145 pl
= &group
->pl
[group
->nr
++];
1146 memset(pl
, 0, sizeof(*pl
));
1152 * Used to set up core.excludesfile and .git/info/exclude lists.
1154 static void add_patterns_from_file_1(struct dir_struct
*dir
, const char *fname
,
1155 struct oid_stat
*oid_stat
)
1157 struct pattern_list
*pl
;
1159 * catch setup_standard_excludes() that's called before
1160 * dir->untracked is assigned. That function behaves
1161 * differently when dir->untracked is non-NULL.
1163 if (!dir
->untracked
)
1164 dir
->unmanaged_exclude_files
++;
1165 pl
= add_pattern_list(dir
, EXC_FILE
, fname
);
1166 if (add_patterns(fname
, "", 0, pl
, NULL
, oid_stat
) < 0)
1167 die(_("cannot use %s as an exclude file"), fname
);
1170 void add_patterns_from_file(struct dir_struct
*dir
, const char *fname
)
1172 dir
->unmanaged_exclude_files
++; /* see validate_untracked_cache() */
1173 add_patterns_from_file_1(dir
, fname
, NULL
);
1176 int match_basename(const char *basename
, int basenamelen
,
1177 const char *pattern
, int prefix
, int patternlen
,
1180 if (prefix
== patternlen
) {
1181 if (patternlen
== basenamelen
&&
1182 !fspathncmp(pattern
, basename
, basenamelen
))
1184 } else if (flags
& PATTERN_FLAG_ENDSWITH
) {
1185 /* "*literal" matching against "fooliteral" */
1186 if (patternlen
- 1 <= basenamelen
&&
1187 !fspathncmp(pattern
+ 1,
1188 basename
+ basenamelen
- (patternlen
- 1),
1192 if (fnmatch_icase_mem(pattern
, patternlen
,
1193 basename
, basenamelen
,
1200 int match_pathname(const char *pathname
, int pathlen
,
1201 const char *base
, int baselen
,
1202 const char *pattern
, int prefix
, int patternlen
,
1209 * match with FNM_PATHNAME; the pattern has base implicitly
1212 if (*pattern
== '/') {
1219 * baselen does not count the trailing slash. base[] may or
1220 * may not end with a trailing slash though.
1222 if (pathlen
< baselen
+ 1 ||
1223 (baselen
&& pathname
[baselen
] != '/') ||
1224 fspathncmp(pathname
, base
, baselen
))
1227 namelen
= baselen
? pathlen
- baselen
- 1 : pathlen
;
1228 name
= pathname
+ pathlen
- namelen
;
1232 * if the non-wildcard part is longer than the
1233 * remaining pathname, surely it cannot match.
1235 if (prefix
> namelen
)
1238 if (fspathncmp(pattern
, name
, prefix
))
1241 patternlen
-= prefix
;
1246 * If the whole pattern did not have a wildcard,
1247 * then our prefix match is all we need; we
1248 * do not need to call fnmatch at all.
1250 if (!patternlen
&& !namelen
)
1254 return fnmatch_icase_mem(pattern
, patternlen
,
1260 * Scan the given exclude list in reverse to see whether pathname
1261 * should be ignored. The first match (i.e. the last on the list), if
1262 * any, determines the fate. Returns the exclude_list element which
1263 * matched, or NULL for undecided.
1265 static struct path_pattern
*last_matching_pattern_from_list(const char *pathname
,
1267 const char *basename
,
1269 struct pattern_list
*pl
,
1270 struct index_state
*istate
)
1272 struct path_pattern
*res
= NULL
; /* undecided */
1276 return NULL
; /* undefined */
1278 for (i
= pl
->nr
- 1; 0 <= i
; i
--) {
1279 struct path_pattern
*pattern
= pl
->patterns
[i
];
1280 const char *exclude
= pattern
->pattern
;
1281 int prefix
= pattern
->nowildcardlen
;
1283 if (pattern
->flags
& PATTERN_FLAG_MUSTBEDIR
) {
1284 if (*dtype
== DT_UNKNOWN
)
1285 *dtype
= get_dtype(NULL
, istate
, pathname
, pathlen
);
1286 if (*dtype
!= DT_DIR
)
1290 if (pattern
->flags
& PATTERN_FLAG_NODIR
) {
1291 if (match_basename(basename
,
1292 pathlen
- (basename
- pathname
),
1293 exclude
, prefix
, pattern
->patternlen
,
1301 assert(pattern
->baselen
== 0 ||
1302 pattern
->base
[pattern
->baselen
- 1] == '/');
1303 if (match_pathname(pathname
, pathlen
,
1305 pattern
->baselen
? pattern
->baselen
- 1 : 0,
1306 exclude
, prefix
, pattern
->patternlen
,
1316 * Scan the list of patterns to determine if the ordered list
1317 * of patterns matches on 'pathname'.
1319 * Return 1 for a match, 0 for not matched and -1 for undecided.
1321 enum pattern_match_result
path_matches_pattern_list(
1322 const char *pathname
, int pathlen
,
1323 const char *basename
, int *dtype
,
1324 struct pattern_list
*pl
,
1325 struct index_state
*istate
)
1327 struct path_pattern
*pattern
;
1328 struct strbuf parent_pathname
= STRBUF_INIT
;
1329 int result
= NOT_MATCHED
;
1330 const char *slash_pos
;
1332 if (!pl
->use_cone_patterns
) {
1333 pattern
= last_matching_pattern_from_list(pathname
, pathlen
, basename
,
1336 if (pattern
->flags
& PATTERN_FLAG_NEGATIVE
)
1348 strbuf_addch(&parent_pathname
, '/');
1349 strbuf_add(&parent_pathname
, pathname
, pathlen
);
1351 if (hashmap_contains_path(&pl
->recursive_hashmap
,
1352 &parent_pathname
)) {
1353 result
= MATCHED_RECURSIVE
;
1357 slash_pos
= strrchr(parent_pathname
.buf
, '/');
1359 if (slash_pos
== parent_pathname
.buf
) {
1360 /* include every file in root */
1365 strbuf_setlen(&parent_pathname
, slash_pos
- parent_pathname
.buf
);
1367 if (hashmap_contains_path(&pl
->parent_hashmap
, &parent_pathname
)) {
1372 if (hashmap_contains_parent(&pl
->recursive_hashmap
,
1375 result
= MATCHED_RECURSIVE
;
1378 strbuf_release(&parent_pathname
);
1382 static struct path_pattern
*last_matching_pattern_from_lists(
1383 struct dir_struct
*dir
, struct index_state
*istate
,
1384 const char *pathname
, int pathlen
,
1385 const char *basename
, int *dtype_p
)
1388 struct exclude_list_group
*group
;
1389 struct path_pattern
*pattern
;
1390 for (i
= EXC_CMDL
; i
<= EXC_FILE
; i
++) {
1391 group
= &dir
->exclude_list_group
[i
];
1392 for (j
= group
->nr
- 1; j
>= 0; j
--) {
1393 pattern
= last_matching_pattern_from_list(
1394 pathname
, pathlen
, basename
, dtype_p
,
1395 &group
->pl
[j
], istate
);
1404 * Loads the per-directory exclude list for the substring of base
1405 * which has a char length of baselen.
1407 static void prep_exclude(struct dir_struct
*dir
,
1408 struct index_state
*istate
,
1409 const char *base
, int baselen
)
1411 struct exclude_list_group
*group
;
1412 struct pattern_list
*pl
;
1413 struct exclude_stack
*stk
= NULL
;
1414 struct untracked_cache_dir
*untracked
;
1417 group
= &dir
->exclude_list_group
[EXC_DIRS
];
1420 * Pop the exclude lists from the EXCL_DIRS exclude_list_group
1421 * which originate from directories not in the prefix of the
1422 * path being checked.
1424 while ((stk
= dir
->exclude_stack
) != NULL
) {
1425 if (stk
->baselen
<= baselen
&&
1426 !strncmp(dir
->basebuf
.buf
, base
, stk
->baselen
))
1428 pl
= &group
->pl
[dir
->exclude_stack
->exclude_ix
];
1429 dir
->exclude_stack
= stk
->prev
;
1430 dir
->pattern
= NULL
;
1431 free((char *)pl
->src
); /* see strbuf_detach() below */
1432 clear_pattern_list(pl
);
1437 /* Skip traversing into sub directories if the parent is excluded */
1442 * Lazy initialization. All call sites currently just
1443 * memset(dir, 0, sizeof(*dir)) before use. Changing all of
1444 * them seems lots of work for little benefit.
1446 if (!dir
->basebuf
.buf
)
1447 strbuf_init(&dir
->basebuf
, PATH_MAX
);
1449 /* Read from the parent directories and push them down. */
1450 current
= stk
? stk
->baselen
: -1;
1451 strbuf_setlen(&dir
->basebuf
, current
< 0 ? 0 : current
);
1453 untracked
= stk
? stk
->ucd
: dir
->untracked
->root
;
1457 while (current
< baselen
) {
1459 struct oid_stat oid_stat
;
1461 stk
= xcalloc(1, sizeof(*stk
));
1466 cp
= strchr(base
+ current
+ 1, '/');
1468 die("oops in prep_exclude");
1471 lookup_untracked(dir
->untracked
, untracked
,
1473 cp
- base
- current
);
1475 stk
->prev
= dir
->exclude_stack
;
1476 stk
->baselen
= cp
- base
;
1477 stk
->exclude_ix
= group
->nr
;
1478 stk
->ucd
= untracked
;
1479 pl
= add_pattern_list(dir
, EXC_DIRS
, NULL
);
1480 strbuf_add(&dir
->basebuf
, base
+ current
, stk
->baselen
- current
);
1481 assert(stk
->baselen
== dir
->basebuf
.len
);
1483 /* Abort if the directory is excluded */
1486 dir
->basebuf
.buf
[stk
->baselen
- 1] = 0;
1487 dir
->pattern
= last_matching_pattern_from_lists(dir
,
1489 dir
->basebuf
.buf
, stk
->baselen
- 1,
1490 dir
->basebuf
.buf
+ current
, &dt
);
1491 dir
->basebuf
.buf
[stk
->baselen
- 1] = '/';
1493 dir
->pattern
->flags
& PATTERN_FLAG_NEGATIVE
)
1494 dir
->pattern
= NULL
;
1496 dir
->exclude_stack
= stk
;
1501 /* Try to read per-directory file */
1502 oidclr(&oid_stat
.oid
);
1504 if (dir
->exclude_per_dir
&&
1506 * If we know that no files have been added in
1507 * this directory (i.e. valid_cached_dir() has
1508 * been executed and set untracked->valid) ..
1510 (!untracked
|| !untracked
->valid
||
1512 * .. and .gitignore does not exist before
1513 * (i.e. null exclude_oid). Then we can skip
1514 * loading .gitignore, which would result in
1517 !is_null_oid(&untracked
->exclude_oid
))) {
1519 * dir->basebuf gets reused by the traversal, but we
1520 * need fname to remain unchanged to ensure the src
1521 * member of each struct path_pattern correctly
1522 * back-references its source file. Other invocations
1523 * of add_pattern_list provide stable strings, so we
1524 * strbuf_detach() and free() here in the caller.
1526 struct strbuf sb
= STRBUF_INIT
;
1527 strbuf_addbuf(&sb
, &dir
->basebuf
);
1528 strbuf_addstr(&sb
, dir
->exclude_per_dir
);
1529 pl
->src
= strbuf_detach(&sb
, NULL
);
1530 add_patterns(pl
->src
, pl
->src
, stk
->baselen
, pl
, istate
,
1531 untracked
? &oid_stat
: NULL
);
1534 * NEEDSWORK: when untracked cache is enabled, prep_exclude()
1535 * will first be called in valid_cached_dir() then maybe many
1536 * times more in last_matching_pattern(). When the cache is
1537 * used, last_matching_pattern() will not be called and
1538 * reading .gitignore content will be a waste.
1540 * So when it's called by valid_cached_dir() and we can get
1541 * .gitignore SHA-1 from the index (i.e. .gitignore is not
1542 * modified on work tree), we could delay reading the
1543 * .gitignore content until we absolutely need it in
1544 * last_matching_pattern(). Be careful about ignore rule
1545 * order, though, if you do that.
1548 !oideq(&oid_stat
.oid
, &untracked
->exclude_oid
)) {
1549 invalidate_gitignore(dir
->untracked
, untracked
);
1550 oidcpy(&untracked
->exclude_oid
, &oid_stat
.oid
);
1552 dir
->exclude_stack
= stk
;
1553 current
= stk
->baselen
;
1555 strbuf_setlen(&dir
->basebuf
, baselen
);
1559 * Loads the exclude lists for the directory containing pathname, then
1560 * scans all exclude lists to determine whether pathname is excluded.
1561 * Returns the exclude_list element which matched, or NULL for
1564 struct path_pattern
*last_matching_pattern(struct dir_struct
*dir
,
1565 struct index_state
*istate
,
1566 const char *pathname
,
1569 int pathlen
= strlen(pathname
);
1570 const char *basename
= strrchr(pathname
, '/');
1571 basename
= (basename
) ? basename
+1 : pathname
;
1573 prep_exclude(dir
, istate
, pathname
, basename
-pathname
);
1576 return dir
->pattern
;
1578 return last_matching_pattern_from_lists(dir
, istate
, pathname
, pathlen
,
1583 * Loads the exclude lists for the directory containing pathname, then
1584 * scans all exclude lists to determine whether pathname is excluded.
1585 * Returns 1 if true, otherwise 0.
1587 int is_excluded(struct dir_struct
*dir
, struct index_state
*istate
,
1588 const char *pathname
, int *dtype_p
)
1590 struct path_pattern
*pattern
=
1591 last_matching_pattern(dir
, istate
, pathname
, dtype_p
);
1593 return pattern
->flags
& PATTERN_FLAG_NEGATIVE
? 0 : 1;
1597 static struct dir_entry
*dir_entry_new(const char *pathname
, int len
)
1599 struct dir_entry
*ent
;
1601 FLEX_ALLOC_MEM(ent
, name
, pathname
, len
);
1606 static struct dir_entry
*dir_add_name(struct dir_struct
*dir
,
1607 struct index_state
*istate
,
1608 const char *pathname
, int len
)
1610 if (index_file_exists(istate
, pathname
, len
, ignore_case
))
1613 ALLOC_GROW(dir
->entries
, dir
->nr
+1, dir
->alloc
);
1614 return dir
->entries
[dir
->nr
++] = dir_entry_new(pathname
, len
);
1617 struct dir_entry
*dir_add_ignored(struct dir_struct
*dir
,
1618 struct index_state
*istate
,
1619 const char *pathname
, int len
)
1621 if (!index_name_is_other(istate
, pathname
, len
))
1624 ALLOC_GROW(dir
->ignored
, dir
->ignored_nr
+1, dir
->ignored_alloc
);
1625 return dir
->ignored
[dir
->ignored_nr
++] = dir_entry_new(pathname
, len
);
1629 index_nonexistent
= 0,
1635 * Do not use the alphabetically sorted index to look up
1636 * the directory name; instead, use the case insensitive
1639 static enum exist_status
directory_exists_in_index_icase(struct index_state
*istate
,
1640 const char *dirname
, int len
)
1642 struct cache_entry
*ce
;
1644 if (index_dir_exists(istate
, dirname
, len
))
1645 return index_directory
;
1647 ce
= index_file_exists(istate
, dirname
, len
, ignore_case
);
1648 if (ce
&& S_ISGITLINK(ce
->ce_mode
))
1649 return index_gitdir
;
1651 return index_nonexistent
;
1655 * The index sorts alphabetically by entry name, which
1656 * means that a gitlink sorts as '\0' at the end, while
1657 * a directory (which is defined not as an entry, but as
1658 * the files it contains) will sort with the '/' at the
1661 static enum exist_status
directory_exists_in_index(struct index_state
*istate
,
1662 const char *dirname
, int len
)
1667 return directory_exists_in_index_icase(istate
, dirname
, len
);
1669 pos
= index_name_pos(istate
, dirname
, len
);
1672 while (pos
< istate
->cache_nr
) {
1673 const struct cache_entry
*ce
= istate
->cache
[pos
++];
1674 unsigned char endchar
;
1676 if (strncmp(ce
->name
, dirname
, len
))
1678 endchar
= ce
->name
[len
];
1682 return index_directory
;
1683 if (!endchar
&& S_ISGITLINK(ce
->ce_mode
))
1684 return index_gitdir
;
1686 return index_nonexistent
;
1690 * When we find a directory when traversing the filesystem, we
1691 * have three distinct cases:
1694 * - see it as a directory
1697 * and which one we choose depends on a combination of existing
1698 * git index contents and the flags passed into the directory
1699 * traversal routine.
1701 * Case 1: If we *already* have entries in the index under that
1702 * directory name, we always recurse into the directory to see
1705 * Case 2: If we *already* have that directory name as a gitlink,
1706 * we always continue to see it as a gitlink, regardless of whether
1707 * there is an actual git directory there or not (it might not
1708 * be checked out as a subproject!)
1710 * Case 3: if we didn't have it in the index previously, we
1711 * have a few sub-cases:
1713 * (a) if "show_other_directories" is true, we show it as
1714 * just a directory, unless "hide_empty_directories" is
1715 * also true, in which case we need to check if it contains any
1716 * untracked and / or ignored files.
1717 * (b) if it looks like a git directory, and we don't have
1718 * 'no_gitlinks' set we treat it as a gitlink, and show it
1720 * (c) otherwise, we recurse into it.
1722 static enum path_treatment
treat_directory(struct dir_struct
*dir
,
1723 struct index_state
*istate
,
1724 struct untracked_cache_dir
*untracked
,
1725 const char *dirname
, int len
, int baselen
, int exclude
,
1726 const struct pathspec
*pathspec
)
1728 /* The "len-1" is to strip the final '/' */
1729 switch (directory_exists_in_index(istate
, dirname
, len
-1)) {
1730 case index_directory
:
1731 return path_recurse
;
1736 case index_nonexistent
:
1737 if (dir
->flags
& DIR_SKIP_NESTED_GIT
) {
1739 struct strbuf sb
= STRBUF_INIT
;
1740 strbuf_addstr(&sb
, dirname
);
1741 nested_repo
= is_nonbare_repository_dir(&sb
);
1742 strbuf_release(&sb
);
1747 if (dir
->flags
& DIR_SHOW_OTHER_DIRECTORIES
)
1750 (dir
->flags
& DIR_SHOW_IGNORED_TOO
) &&
1751 (dir
->flags
& DIR_SHOW_IGNORED_TOO_MODE_MATCHING
)) {
1754 * This is an excluded directory and we are
1755 * showing ignored paths that match an exclude
1756 * pattern. (e.g. show directory as ignored
1757 * only if it matches an exclude pattern).
1758 * This path will either be 'path_excluded`
1759 * (if we are showing empty directories or if
1760 * the directory is not empty), or will be
1761 * 'path_none' (empty directory, and we are
1762 * not showing empty directories).
1764 if (!(dir
->flags
& DIR_HIDE_EMPTY_DIRECTORIES
))
1765 return path_excluded
;
1767 if (read_directory_recursive(dir
, istate
, dirname
, len
,
1768 untracked
, 1, 1, pathspec
) == path_excluded
)
1769 return path_excluded
;
1773 if (!(dir
->flags
& DIR_NO_GITLINKS
)) {
1774 struct strbuf sb
= STRBUF_INIT
;
1775 strbuf_addstr(&sb
, dirname
);
1776 if (is_nonbare_repository_dir(&sb
))
1777 return exclude
? path_excluded
: path_untracked
;
1778 strbuf_release(&sb
);
1780 return path_recurse
;
1783 /* This is the "show_other_directories" case */
1785 if (!(dir
->flags
& DIR_HIDE_EMPTY_DIRECTORIES
))
1786 return exclude
? path_excluded
: path_untracked
;
1788 untracked
= lookup_untracked(dir
->untracked
, untracked
,
1789 dirname
+ baselen
, len
- baselen
);
1792 * If this is an excluded directory, then we only need to check if
1793 * the directory contains any files.
1795 return read_directory_recursive(dir
, istate
, dirname
, len
,
1796 untracked
, 1, exclude
, pathspec
);
1800 * This is an inexact early pruning of any recursive directory
1801 * reading - if the path cannot possibly be in the pathspec,
1802 * return true, and we'll skip it early.
1804 static int simplify_away(const char *path
, int pathlen
,
1805 const struct pathspec
*pathspec
)
1809 if (!pathspec
|| !pathspec
->nr
)
1812 GUARD_PATHSPEC(pathspec
,
1821 for (i
= 0; i
< pathspec
->nr
; i
++) {
1822 const struct pathspec_item
*item
= &pathspec
->items
[i
];
1823 int len
= item
->nowildcard_len
;
1827 if (!ps_strncmp(item
, item
->match
, path
, len
))
1835 * This function tells us whether an excluded path matches a
1836 * list of "interesting" pathspecs. That is, whether a path matched
1837 * by any of the pathspecs could possibly be ignored by excluding
1838 * the specified path. This can happen if:
1840 * 1. the path is mentioned explicitly in the pathspec
1842 * 2. the path is a directory prefix of some element in the
1845 static int exclude_matches_pathspec(const char *path
, int pathlen
,
1846 const struct pathspec
*pathspec
)
1850 if (!pathspec
|| !pathspec
->nr
)
1853 GUARD_PATHSPEC(pathspec
,
1861 for (i
= 0; i
< pathspec
->nr
; i
++) {
1862 const struct pathspec_item
*item
= &pathspec
->items
[i
];
1863 int len
= item
->nowildcard_len
;
1865 if (len
== pathlen
&&
1866 !ps_strncmp(item
, item
->match
, path
, pathlen
))
1868 if (len
> pathlen
&&
1869 item
->match
[pathlen
] == '/' &&
1870 !ps_strncmp(item
, item
->match
, path
, pathlen
))
1876 static int get_index_dtype(struct index_state
*istate
,
1877 const char *path
, int len
)
1880 const struct cache_entry
*ce
;
1882 ce
= index_file_exists(istate
, path
, len
, 0);
1884 if (!ce_uptodate(ce
))
1886 if (S_ISGITLINK(ce
->ce_mode
))
1889 * Nobody actually cares about the
1890 * difference between DT_LNK and DT_REG
1895 /* Try to look it up as a directory */
1896 pos
= index_name_pos(istate
, path
, len
);
1900 while (pos
< istate
->cache_nr
) {
1901 ce
= istate
->cache
[pos
++];
1902 if (strncmp(ce
->name
, path
, len
))
1904 if (ce
->name
[len
] > '/')
1906 if (ce
->name
[len
] < '/')
1908 if (!ce_uptodate(ce
))
1909 break; /* continue? */
1915 static int get_dtype(struct dirent
*de
, struct index_state
*istate
,
1916 const char *path
, int len
)
1918 int dtype
= de
? DTYPE(de
) : DT_UNKNOWN
;
1921 if (dtype
!= DT_UNKNOWN
)
1923 dtype
= get_index_dtype(istate
, path
, len
);
1924 if (dtype
!= DT_UNKNOWN
)
1926 if (lstat(path
, &st
))
1928 if (S_ISREG(st
.st_mode
))
1930 if (S_ISDIR(st
.st_mode
))
1932 if (S_ISLNK(st
.st_mode
))
1937 static enum path_treatment
treat_one_path(struct dir_struct
*dir
,
1938 struct untracked_cache_dir
*untracked
,
1939 struct index_state
*istate
,
1940 struct strbuf
*path
,
1942 const struct pathspec
*pathspec
,
1943 int dtype
, struct dirent
*de
)
1946 int has_path_in_index
= !!index_file_exists(istate
, path
->buf
, path
->len
, ignore_case
);
1947 enum path_treatment path_treatment
;
1949 if (dtype
== DT_UNKNOWN
)
1950 dtype
= get_dtype(de
, istate
, path
->buf
, path
->len
);
1952 /* Always exclude indexed files */
1953 if (dtype
!= DT_DIR
&& has_path_in_index
)
1957 * When we are looking at a directory P in the working tree,
1958 * there are three cases:
1960 * (1) P exists in the index. Everything inside the directory P in
1961 * the working tree needs to go when P is checked out from the
1964 * (2) P does not exist in the index, but there is P/Q in the index.
1965 * We know P will stay a directory when we check out the contents
1966 * of the index, but we do not know yet if there is a directory
1967 * P/Q in the working tree to be killed, so we need to recurse.
1969 * (3) P does not exist in the index, and there is no P/Q in the index
1970 * to require P to be a directory, either. Only in this case, we
1971 * know that everything inside P will not be killed without
1974 if ((dir
->flags
& DIR_COLLECT_KILLED_ONLY
) &&
1975 (dtype
== DT_DIR
) &&
1976 !has_path_in_index
&&
1977 (directory_exists_in_index(istate
, path
->buf
, path
->len
) == index_nonexistent
))
1980 exclude
= is_excluded(dir
, istate
, path
->buf
, &dtype
);
1983 * Excluded? If we don't explicitly want to show
1984 * ignored files, ignore it
1986 if (exclude
&& !(dir
->flags
& (DIR_SHOW_IGNORED
|DIR_SHOW_IGNORED_TOO
)))
1987 return path_excluded
;
1993 strbuf_addch(path
, '/');
1994 path_treatment
= treat_directory(dir
, istate
, untracked
,
1995 path
->buf
, path
->len
,
1996 baselen
, exclude
, pathspec
);
1998 * If 1) we only want to return directories that
1999 * match an exclude pattern and 2) this directory does
2000 * not match an exclude pattern but all of its
2001 * contents are excluded, then indicate that we should
2002 * recurse into this directory (instead of marking the
2003 * directory itself as an ignored path).
2006 path_treatment
== path_excluded
&&
2007 (dir
->flags
& DIR_SHOW_IGNORED_TOO
) &&
2008 (dir
->flags
& DIR_SHOW_IGNORED_TOO_MODE_MATCHING
))
2009 return path_recurse
;
2010 return path_treatment
;
2013 return exclude
? path_excluded
: path_untracked
;
2017 static enum path_treatment
treat_path_fast(struct dir_struct
*dir
,
2018 struct untracked_cache_dir
*untracked
,
2019 struct cached_dir
*cdir
,
2020 struct index_state
*istate
,
2021 struct strbuf
*path
,
2023 const struct pathspec
*pathspec
)
2025 strbuf_setlen(path
, baselen
);
2027 strbuf_addstr(path
, cdir
->file
);
2028 return path_untracked
;
2030 strbuf_addstr(path
, cdir
->ucd
->name
);
2031 /* treat_one_path() does this before it calls treat_directory() */
2032 strbuf_complete(path
, '/');
2033 if (cdir
->ucd
->check_only
)
2035 * check_only is set as a result of treat_directory() getting
2036 * to its bottom. Verify again the same set of directories
2037 * with check_only set.
2039 return read_directory_recursive(dir
, istate
, path
->buf
, path
->len
,
2040 cdir
->ucd
, 1, 0, pathspec
);
2042 * We get path_recurse in the first run when
2043 * directory_exists_in_index() returns index_nonexistent. We
2044 * are sure that new changes in the index does not impact the
2045 * outcome. Return now.
2047 return path_recurse
;
2050 static enum path_treatment
treat_path(struct dir_struct
*dir
,
2051 struct untracked_cache_dir
*untracked
,
2052 struct cached_dir
*cdir
,
2053 struct index_state
*istate
,
2054 struct strbuf
*path
,
2056 const struct pathspec
*pathspec
)
2059 struct dirent
*de
= cdir
->de
;
2062 return treat_path_fast(dir
, untracked
, cdir
, istate
, path
,
2064 if (is_dot_or_dotdot(de
->d_name
) || !fspathcmp(de
->d_name
, ".git"))
2066 strbuf_setlen(path
, baselen
);
2067 strbuf_addstr(path
, de
->d_name
);
2068 if (simplify_away(path
->buf
, path
->len
, pathspec
))
2072 return treat_one_path(dir
, untracked
, istate
, path
, baselen
, pathspec
, dtype
, de
);
2075 static void add_untracked(struct untracked_cache_dir
*dir
, const char *name
)
2079 ALLOC_GROW(dir
->untracked
, dir
->untracked_nr
+ 1,
2080 dir
->untracked_alloc
);
2081 dir
->untracked
[dir
->untracked_nr
++] = xstrdup(name
);
2084 static int valid_cached_dir(struct dir_struct
*dir
,
2085 struct untracked_cache_dir
*untracked
,
2086 struct index_state
*istate
,
2087 struct strbuf
*path
,
2096 * With fsmonitor, we can trust the untracked cache's valid field.
2098 refresh_fsmonitor(istate
);
2099 if (!(dir
->untracked
->use_fsmonitor
&& untracked
->valid
)) {
2100 if (lstat(path
->len
? path
->buf
: ".", &st
)) {
2101 memset(&untracked
->stat_data
, 0, sizeof(untracked
->stat_data
));
2104 if (!untracked
->valid
||
2105 match_stat_data_racy(istate
, &untracked
->stat_data
, &st
)) {
2106 fill_stat_data(&untracked
->stat_data
, &st
);
2111 if (untracked
->check_only
!= !!check_only
)
2115 * prep_exclude will be called eventually on this directory,
2116 * but it's called much later in last_matching_pattern(). We
2117 * need it now to determine the validity of the cache for this
2118 * path. The next calls will be nearly no-op, the way
2119 * prep_exclude() is designed.
2121 if (path
->len
&& path
->buf
[path
->len
- 1] != '/') {
2122 strbuf_addch(path
, '/');
2123 prep_exclude(dir
, istate
, path
->buf
, path
->len
);
2124 strbuf_setlen(path
, path
->len
- 1);
2126 prep_exclude(dir
, istate
, path
->buf
, path
->len
);
2128 /* hopefully prep_exclude() haven't invalidated this entry... */
2129 return untracked
->valid
;
2132 static int open_cached_dir(struct cached_dir
*cdir
,
2133 struct dir_struct
*dir
,
2134 struct untracked_cache_dir
*untracked
,
2135 struct index_state
*istate
,
2136 struct strbuf
*path
,
2141 memset(cdir
, 0, sizeof(*cdir
));
2142 cdir
->untracked
= untracked
;
2143 if (valid_cached_dir(dir
, untracked
, istate
, path
, check_only
))
2145 c_path
= path
->len
? path
->buf
: ".";
2146 cdir
->fdir
= opendir(c_path
);
2148 warning_errno(_("could not open directory '%s'"), c_path
);
2149 if (dir
->untracked
) {
2150 invalidate_directory(dir
->untracked
, untracked
);
2151 dir
->untracked
->dir_opened
++;
2158 static int read_cached_dir(struct cached_dir
*cdir
)
2161 cdir
->de
= readdir(cdir
->fdir
);
2166 while (cdir
->nr_dirs
< cdir
->untracked
->dirs_nr
) {
2167 struct untracked_cache_dir
*d
= cdir
->untracked
->dirs
[cdir
->nr_dirs
];
2177 if (cdir
->nr_files
< cdir
->untracked
->untracked_nr
) {
2178 struct untracked_cache_dir
*d
= cdir
->untracked
;
2179 cdir
->file
= d
->untracked
[cdir
->nr_files
++];
2185 static void close_cached_dir(struct cached_dir
*cdir
)
2188 closedir(cdir
->fdir
);
2190 * We have gone through this directory and found no untracked
2191 * entries. Mark it valid.
2193 if (cdir
->untracked
) {
2194 cdir
->untracked
->valid
= 1;
2195 cdir
->untracked
->recurse
= 1;
2200 * Read a directory tree. We currently ignore anything but
2201 * directories, regular files and symlinks. That's because git
2202 * doesn't handle them at all yet. Maybe that will change some
2205 * Also, we ignore the name ".git" (even if it is not a directory).
2206 * That likely will not change.
2208 * If 'stop_at_first_file' is specified, 'path_excluded' is returned
2209 * to signal that a file was found. This is the least significant value that
2210 * indicates that a file was encountered that does not depend on the order of
2211 * whether an untracked or exluded path was encountered first.
2213 * Returns the most significant path_treatment value encountered in the scan.
2214 * If 'stop_at_first_file' is specified, `path_excluded` is the most
2215 * significant path_treatment value that will be returned.
2218 static enum path_treatment
read_directory_recursive(struct dir_struct
*dir
,
2219 struct index_state
*istate
, const char *base
, int baselen
,
2220 struct untracked_cache_dir
*untracked
, int check_only
,
2221 int stop_at_first_file
, const struct pathspec
*pathspec
)
2223 struct cached_dir cdir
;
2224 enum path_treatment state
, subdir_state
, dir_state
= path_none
;
2225 struct strbuf path
= STRBUF_INIT
;
2227 strbuf_add(&path
, base
, baselen
);
2229 if (open_cached_dir(&cdir
, dir
, untracked
, istate
, &path
, check_only
))
2233 untracked
->check_only
= !!check_only
;
2235 while (!read_cached_dir(&cdir
)) {
2236 /* check how the file or directory should be treated */
2237 state
= treat_path(dir
, untracked
, &cdir
, istate
, &path
,
2240 if (state
> dir_state
)
2243 /* recurse into subdir if instructed by treat_path */
2244 if ((state
== path_recurse
) ||
2245 ((state
== path_untracked
) &&
2246 (get_dtype(cdir
.de
, istate
, path
.buf
, path
.len
) == DT_DIR
) &&
2247 ((dir
->flags
& DIR_SHOW_IGNORED_TOO
) ||
2249 do_match_pathspec(istate
, pathspec
, path
.buf
, path
.len
,
2250 baselen
, NULL
, DO_MATCH_LEADING_PATHSPEC
) == MATCHED_RECURSIVELY_LEADING_PATHSPEC
)))) {
2251 struct untracked_cache_dir
*ud
;
2252 ud
= lookup_untracked(dir
->untracked
, untracked
,
2254 path
.len
- baselen
);
2256 read_directory_recursive(dir
, istate
, path
.buf
,
2258 check_only
, stop_at_first_file
, pathspec
);
2259 if (subdir_state
> dir_state
)
2260 dir_state
= subdir_state
;
2263 !match_pathspec(istate
, pathspec
, path
.buf
, path
.len
,
2264 0 /* prefix */, NULL
,
2265 0 /* do NOT special case dirs */))
2270 if (stop_at_first_file
) {
2272 * If stopping at first file, then
2273 * signal that a file was found by
2274 * returning `path_excluded`. This is
2275 * to return a consistent value
2276 * regardless of whether an ignored or
2277 * excluded file happened to be
2280 * In current usage, the
2281 * `stop_at_first_file` is passed when
2282 * an ancestor directory has matched
2283 * an exclude pattern, so any found
2284 * files will be excluded.
2286 if (dir_state
>= path_excluded
) {
2287 dir_state
= path_excluded
;
2292 /* abort early if maximum state has been reached */
2293 if (dir_state
== path_untracked
) {
2295 add_untracked(untracked
, path
.buf
+ baselen
);
2298 /* skip the dir_add_* part */
2302 /* add the path to the appropriate result list */
2305 if (dir
->flags
& DIR_SHOW_IGNORED
)
2306 dir_add_name(dir
, istate
, path
.buf
, path
.len
);
2307 else if ((dir
->flags
& DIR_SHOW_IGNORED_TOO
) ||
2308 ((dir
->flags
& DIR_COLLECT_IGNORED
) &&
2309 exclude_matches_pathspec(path
.buf
, path
.len
,
2311 dir_add_ignored(dir
, istate
, path
.buf
, path
.len
);
2314 case path_untracked
:
2315 if (dir
->flags
& DIR_SHOW_IGNORED
)
2317 dir_add_name(dir
, istate
, path
.buf
, path
.len
);
2319 add_untracked(untracked
, path
.buf
+ baselen
);
2326 close_cached_dir(&cdir
);
2328 strbuf_release(&path
);
2333 int cmp_dir_entry(const void *p1
, const void *p2
)
2335 const struct dir_entry
*e1
= *(const struct dir_entry
**)p1
;
2336 const struct dir_entry
*e2
= *(const struct dir_entry
**)p2
;
2338 return name_compare(e1
->name
, e1
->len
, e2
->name
, e2
->len
);
2341 /* check if *out lexically strictly contains *in */
2342 int check_dir_entry_contains(const struct dir_entry
*out
, const struct dir_entry
*in
)
2344 return (out
->len
< in
->len
) &&
2345 (out
->name
[out
->len
- 1] == '/') &&
2346 !memcmp(out
->name
, in
->name
, out
->len
);
2349 static int treat_leading_path(struct dir_struct
*dir
,
2350 struct index_state
*istate
,
2351 const char *path
, int len
,
2352 const struct pathspec
*pathspec
)
2354 struct strbuf sb
= STRBUF_INIT
;
2355 int baselen
, rc
= 0;
2357 int old_flags
= dir
->flags
;
2359 while (len
&& path
[len
- 1] == '/')
2364 dir
->flags
&= ~DIR_SHOW_OTHER_DIRECTORIES
;
2366 cp
= path
+ baselen
+ !!baselen
;
2367 cp
= memchr(cp
, '/', path
+ len
- cp
);
2371 baselen
= cp
- path
;
2372 strbuf_setlen(&sb
, 0);
2373 strbuf_add(&sb
, path
, baselen
);
2374 if (!is_directory(sb
.buf
))
2376 if (simplify_away(sb
.buf
, sb
.len
, pathspec
))
2378 if (treat_one_path(dir
, NULL
, istate
, &sb
, baselen
, pathspec
,
2379 DT_DIR
, NULL
) == path_none
)
2380 break; /* do not recurse into it */
2381 if (len
<= baselen
) {
2383 break; /* finished checking */
2386 strbuf_release(&sb
);
2387 dir
->flags
= old_flags
;
2391 static const char *get_ident_string(void)
2393 static struct strbuf sb
= STRBUF_INIT
;
2398 if (uname(&uts
) < 0)
2399 die_errno(_("failed to get kernel name and information"));
2400 strbuf_addf(&sb
, "Location %s, system %s", get_git_work_tree(),
2405 static int ident_in_untracked(const struct untracked_cache
*uc
)
2408 * Previous git versions may have saved many NUL separated
2409 * strings in the "ident" field, but it is insane to manage
2410 * many locations, so just take care of the first one.
2413 return !strcmp(uc
->ident
.buf
, get_ident_string());
2416 static void set_untracked_ident(struct untracked_cache
*uc
)
2418 strbuf_reset(&uc
->ident
);
2419 strbuf_addstr(&uc
->ident
, get_ident_string());
2422 * This strbuf used to contain a list of NUL separated
2423 * strings, so save NUL too for backward compatibility.
2425 strbuf_addch(&uc
->ident
, 0);
2428 static void new_untracked_cache(struct index_state
*istate
)
2430 struct untracked_cache
*uc
= xcalloc(1, sizeof(*uc
));
2431 strbuf_init(&uc
->ident
, 100);
2432 uc
->exclude_per_dir
= ".gitignore";
2433 /* should be the same flags used by git-status */
2434 uc
->dir_flags
= DIR_SHOW_OTHER_DIRECTORIES
| DIR_HIDE_EMPTY_DIRECTORIES
;
2435 set_untracked_ident(uc
);
2436 istate
->untracked
= uc
;
2437 istate
->cache_changed
|= UNTRACKED_CHANGED
;
2440 void add_untracked_cache(struct index_state
*istate
)
2442 if (!istate
->untracked
) {
2443 new_untracked_cache(istate
);
2445 if (!ident_in_untracked(istate
->untracked
)) {
2446 free_untracked_cache(istate
->untracked
);
2447 new_untracked_cache(istate
);
2452 void remove_untracked_cache(struct index_state
*istate
)
2454 if (istate
->untracked
) {
2455 free_untracked_cache(istate
->untracked
);
2456 istate
->untracked
= NULL
;
2457 istate
->cache_changed
|= UNTRACKED_CHANGED
;
2461 static struct untracked_cache_dir
*validate_untracked_cache(struct dir_struct
*dir
,
2463 const struct pathspec
*pathspec
)
2465 struct untracked_cache_dir
*root
;
2466 static int untracked_cache_disabled
= -1;
2468 if (!dir
->untracked
)
2470 if (untracked_cache_disabled
< 0)
2471 untracked_cache_disabled
= git_env_bool("GIT_DISABLE_UNTRACKED_CACHE", 0);
2472 if (untracked_cache_disabled
)
2476 * We only support $GIT_DIR/info/exclude and core.excludesfile
2477 * as the global ignore rule files. Any other additions
2478 * (e.g. from command line) invalidate the cache. This
2479 * condition also catches running setup_standard_excludes()
2480 * before setting dir->untracked!
2482 if (dir
->unmanaged_exclude_files
)
2486 * Optimize for the main use case only: whole-tree git
2487 * status. More work involved in treat_leading_path() if we
2488 * use cache on just a subset of the worktree. pathspec
2489 * support could make the matter even worse.
2491 if (base_len
|| (pathspec
&& pathspec
->nr
))
2494 /* Different set of flags may produce different results */
2495 if (dir
->flags
!= dir
->untracked
->dir_flags
||
2497 * See treat_directory(), case index_nonexistent. Without
2498 * this flag, we may need to also cache .git file content
2499 * for the resolve_gitlink_ref() call, which we don't.
2501 !(dir
->flags
& DIR_SHOW_OTHER_DIRECTORIES
) ||
2502 /* We don't support collecting ignore files */
2503 (dir
->flags
& (DIR_SHOW_IGNORED
| DIR_SHOW_IGNORED_TOO
|
2504 DIR_COLLECT_IGNORED
)))
2508 * If we use .gitignore in the cache and now you change it to
2509 * .gitexclude, everything will go wrong.
2511 if (dir
->exclude_per_dir
!= dir
->untracked
->exclude_per_dir
&&
2512 strcmp(dir
->exclude_per_dir
, dir
->untracked
->exclude_per_dir
))
2516 * EXC_CMDL is not considered in the cache. If people set it,
2519 if (dir
->exclude_list_group
[EXC_CMDL
].nr
)
2522 if (!ident_in_untracked(dir
->untracked
)) {
2523 warning(_("untracked cache is disabled on this system or location"));
2527 if (!dir
->untracked
->root
) {
2528 const int len
= sizeof(*dir
->untracked
->root
);
2529 dir
->untracked
->root
= xmalloc(len
);
2530 memset(dir
->untracked
->root
, 0, len
);
2533 /* Validate $GIT_DIR/info/exclude and core.excludesfile */
2534 root
= dir
->untracked
->root
;
2535 if (!oideq(&dir
->ss_info_exclude
.oid
,
2536 &dir
->untracked
->ss_info_exclude
.oid
)) {
2537 invalidate_gitignore(dir
->untracked
, root
);
2538 dir
->untracked
->ss_info_exclude
= dir
->ss_info_exclude
;
2540 if (!oideq(&dir
->ss_excludes_file
.oid
,
2541 &dir
->untracked
->ss_excludes_file
.oid
)) {
2542 invalidate_gitignore(dir
->untracked
, root
);
2543 dir
->untracked
->ss_excludes_file
= dir
->ss_excludes_file
;
2546 /* Make sure this directory is not dropped out at saving phase */
2551 int read_directory(struct dir_struct
*dir
, struct index_state
*istate
,
2552 const char *path
, int len
, const struct pathspec
*pathspec
)
2554 struct untracked_cache_dir
*untracked
;
2556 trace_performance_enter();
2558 if (has_symlink_leading_path(path
, len
)) {
2559 trace_performance_leave("read directory %.*s", len
, path
);
2563 untracked
= validate_untracked_cache(dir
, len
, pathspec
);
2566 * make sure untracked cache code path is disabled,
2567 * e.g. prep_exclude()
2569 dir
->untracked
= NULL
;
2570 if (!len
|| treat_leading_path(dir
, istate
, path
, len
, pathspec
))
2571 read_directory_recursive(dir
, istate
, path
, len
, untracked
, 0, 0, pathspec
);
2572 QSORT(dir
->entries
, dir
->nr
, cmp_dir_entry
);
2573 QSORT(dir
->ignored
, dir
->ignored_nr
, cmp_dir_entry
);
2576 * If DIR_SHOW_IGNORED_TOO is set, read_directory_recursive() will
2577 * also pick up untracked contents of untracked dirs; by default
2578 * we discard these, but given DIR_KEEP_UNTRACKED_CONTENTS we do not.
2580 if ((dir
->flags
& DIR_SHOW_IGNORED_TOO
) &&
2581 !(dir
->flags
& DIR_KEEP_UNTRACKED_CONTENTS
)) {
2584 /* remove from dir->entries untracked contents of untracked dirs */
2585 for (i
= j
= 0; j
< dir
->nr
; j
++) {
2587 check_dir_entry_contains(dir
->entries
[i
- 1], dir
->entries
[j
])) {
2588 FREE_AND_NULL(dir
->entries
[j
]);
2590 dir
->entries
[i
++] = dir
->entries
[j
];
2597 trace_performance_leave("read directory %.*s", len
, path
);
2598 if (dir
->untracked
) {
2599 static int force_untracked_cache
= -1;
2600 static struct trace_key trace_untracked_stats
= TRACE_KEY_INIT(UNTRACKED_STATS
);
2602 if (force_untracked_cache
< 0)
2603 force_untracked_cache
=
2604 git_env_bool("GIT_FORCE_UNTRACKED_CACHE", 0);
2605 trace_printf_key(&trace_untracked_stats
,
2606 "node creation: %u\n"
2607 "gitignore invalidation: %u\n"
2608 "directory invalidation: %u\n"
2610 dir
->untracked
->dir_created
,
2611 dir
->untracked
->gitignore_invalidated
,
2612 dir
->untracked
->dir_invalidated
,
2613 dir
->untracked
->dir_opened
);
2614 if (force_untracked_cache
&&
2615 dir
->untracked
== istate
->untracked
&&
2616 (dir
->untracked
->dir_opened
||
2617 dir
->untracked
->gitignore_invalidated
||
2618 dir
->untracked
->dir_invalidated
))
2619 istate
->cache_changed
|= UNTRACKED_CHANGED
;
2620 if (dir
->untracked
!= istate
->untracked
) {
2621 FREE_AND_NULL(dir
->untracked
);
2627 int file_exists(const char *f
)
2630 return lstat(f
, &sb
) == 0;
2633 int repo_file_exists(struct repository
*repo
, const char *path
)
2635 if (repo
!= the_repository
)
2636 BUG("do not know how to check file existence in arbitrary repo");
2638 return file_exists(path
);
2641 static int cmp_icase(char a
, char b
)
2646 return toupper(a
) - toupper(b
);
2651 * Given two normalized paths (a trailing slash is ok), if subdir is
2652 * outside dir, return -1. Otherwise return the offset in subdir that
2653 * can be used as relative path to dir.
2655 int dir_inside_of(const char *subdir
, const char *dir
)
2659 assert(dir
&& subdir
&& *dir
&& *subdir
);
2661 while (*dir
&& *subdir
&& !cmp_icase(*dir
, *subdir
)) {
2667 /* hel[p]/me vs hel[l]/yeah */
2668 if (*dir
&& *subdir
)
2672 return !*dir
? offset
: -1; /* same dir */
2674 /* foo/[b]ar vs foo/[] */
2675 if (is_dir_sep(dir
[-1]))
2676 return is_dir_sep(subdir
[-1]) ? offset
: -1;
2678 /* foo[/]bar vs foo[] */
2679 return is_dir_sep(*subdir
) ? offset
+ 1 : -1;
2682 int is_inside_dir(const char *dir
)
2691 rc
= (dir_inside_of(cwd
, dir
) >= 0);
2696 int is_empty_dir(const char *path
)
2698 DIR *dir
= opendir(path
);
2705 while ((e
= readdir(dir
)) != NULL
)
2706 if (!is_dot_or_dotdot(e
->d_name
)) {
2715 static int remove_dir_recurse(struct strbuf
*path
, int flag
, int *kept_up
)
2719 int ret
= 0, original_len
= path
->len
, len
, kept_down
= 0;
2720 int only_empty
= (flag
& REMOVE_DIR_EMPTY_ONLY
);
2721 int keep_toplevel
= (flag
& REMOVE_DIR_KEEP_TOPLEVEL
);
2722 struct object_id submodule_head
;
2724 if ((flag
& REMOVE_DIR_KEEP_NESTED_GIT
) &&
2725 !resolve_gitlink_ref(path
->buf
, "HEAD", &submodule_head
)) {
2726 /* Do not descend and nuke a nested git work tree. */
2732 flag
&= ~REMOVE_DIR_KEEP_TOPLEVEL
;
2733 dir
= opendir(path
->buf
);
2735 if (errno
== ENOENT
)
2736 return keep_toplevel
? -1 : 0;
2737 else if (errno
== EACCES
&& !keep_toplevel
)
2739 * An empty dir could be removable even if it
2742 return rmdir(path
->buf
);
2746 strbuf_complete(path
, '/');
2749 while ((e
= readdir(dir
)) != NULL
) {
2751 if (is_dot_or_dotdot(e
->d_name
))
2754 strbuf_setlen(path
, len
);
2755 strbuf_addstr(path
, e
->d_name
);
2756 if (lstat(path
->buf
, &st
)) {
2757 if (errno
== ENOENT
)
2759 * file disappeared, which is what we
2764 } else if (S_ISDIR(st
.st_mode
)) {
2765 if (!remove_dir_recurse(path
, flag
, &kept_down
))
2766 continue; /* happy */
2767 } else if (!only_empty
&&
2768 (!unlink(path
->buf
) || errno
== ENOENT
)) {
2769 continue; /* happy, too */
2772 /* path too long, stat fails, or non-directory still exists */
2778 strbuf_setlen(path
, original_len
);
2779 if (!ret
&& !keep_toplevel
&& !kept_down
)
2780 ret
= (!rmdir(path
->buf
) || errno
== ENOENT
) ? 0 : -1;
2783 * report the uplevel that it is not an error that we
2784 * did not rmdir() our directory.
2790 int remove_dir_recursively(struct strbuf
*path
, int flag
)
2792 return remove_dir_recurse(path
, flag
, NULL
);
2795 static GIT_PATH_FUNC(git_path_info_exclude
, "info/exclude")
2797 void setup_standard_excludes(struct dir_struct
*dir
)
2799 dir
->exclude_per_dir
= ".gitignore";
2801 /* core.excludesfile defaulting to $XDG_CONFIG_HOME/git/ignore */
2803 excludes_file
= xdg_config_home("ignore");
2804 if (excludes_file
&& !access_or_warn(excludes_file
, R_OK
, 0))
2805 add_patterns_from_file_1(dir
, excludes_file
,
2806 dir
->untracked
? &dir
->ss_excludes_file
: NULL
);
2808 /* per repository user preference */
2809 if (startup_info
->have_repository
) {
2810 const char *path
= git_path_info_exclude();
2811 if (!access_or_warn(path
, R_OK
, 0))
2812 add_patterns_from_file_1(dir
, path
,
2813 dir
->untracked
? &dir
->ss_info_exclude
: NULL
);
2817 int remove_path(const char *name
)
2821 if (unlink(name
) && !is_missing_file_error(errno
))
2824 slash
= strrchr(name
, '/');
2826 char *dirs
= xstrdup(name
);
2827 slash
= dirs
+ (slash
- name
);
2830 } while (rmdir(dirs
) == 0 && (slash
= strrchr(dirs
, '/')));
2837 * Frees memory within dir which was allocated for exclude lists and
2838 * the exclude_stack. Does not free dir itself.
2840 void clear_directory(struct dir_struct
*dir
)
2843 struct exclude_list_group
*group
;
2844 struct pattern_list
*pl
;
2845 struct exclude_stack
*stk
;
2847 for (i
= EXC_CMDL
; i
<= EXC_FILE
; i
++) {
2848 group
= &dir
->exclude_list_group
[i
];
2849 for (j
= 0; j
< group
->nr
; j
++) {
2852 free((char *)pl
->src
);
2853 clear_pattern_list(pl
);
2858 stk
= dir
->exclude_stack
;
2860 struct exclude_stack
*prev
= stk
->prev
;
2864 strbuf_release(&dir
->basebuf
);
2867 struct ondisk_untracked_cache
{
2868 struct stat_data info_exclude_stat
;
2869 struct stat_data excludes_file_stat
;
2873 #define ouc_offset(x) offsetof(struct ondisk_untracked_cache, x)
2876 int index
; /* number of written untracked_cache_dir */
2877 struct ewah_bitmap
*check_only
; /* from untracked_cache_dir */
2878 struct ewah_bitmap
*valid
; /* from untracked_cache_dir */
2879 struct ewah_bitmap
*sha1_valid
; /* set if exclude_sha1 is not null */
2881 struct strbuf sb_stat
;
2882 struct strbuf sb_sha1
;
2885 static void stat_data_to_disk(struct stat_data
*to
, const struct stat_data
*from
)
2887 to
->sd_ctime
.sec
= htonl(from
->sd_ctime
.sec
);
2888 to
->sd_ctime
.nsec
= htonl(from
->sd_ctime
.nsec
);
2889 to
->sd_mtime
.sec
= htonl(from
->sd_mtime
.sec
);
2890 to
->sd_mtime
.nsec
= htonl(from
->sd_mtime
.nsec
);
2891 to
->sd_dev
= htonl(from
->sd_dev
);
2892 to
->sd_ino
= htonl(from
->sd_ino
);
2893 to
->sd_uid
= htonl(from
->sd_uid
);
2894 to
->sd_gid
= htonl(from
->sd_gid
);
2895 to
->sd_size
= htonl(from
->sd_size
);
2898 static void write_one_dir(struct untracked_cache_dir
*untracked
,
2899 struct write_data
*wd
)
2901 struct stat_data stat_data
;
2902 struct strbuf
*out
= &wd
->out
;
2903 unsigned char intbuf
[16];
2904 unsigned int intlen
, value
;
2905 int i
= wd
->index
++;
2908 * untracked_nr should be reset whenever valid is clear, but
2911 if (!untracked
->valid
) {
2912 untracked
->untracked_nr
= 0;
2913 untracked
->check_only
= 0;
2916 if (untracked
->check_only
)
2917 ewah_set(wd
->check_only
, i
);
2918 if (untracked
->valid
) {
2919 ewah_set(wd
->valid
, i
);
2920 stat_data_to_disk(&stat_data
, &untracked
->stat_data
);
2921 strbuf_add(&wd
->sb_stat
, &stat_data
, sizeof(stat_data
));
2923 if (!is_null_oid(&untracked
->exclude_oid
)) {
2924 ewah_set(wd
->sha1_valid
, i
);
2925 strbuf_add(&wd
->sb_sha1
, untracked
->exclude_oid
.hash
,
2926 the_hash_algo
->rawsz
);
2929 intlen
= encode_varint(untracked
->untracked_nr
, intbuf
);
2930 strbuf_add(out
, intbuf
, intlen
);
2932 /* skip non-recurse directories */
2933 for (i
= 0, value
= 0; i
< untracked
->dirs_nr
; i
++)
2934 if (untracked
->dirs
[i
]->recurse
)
2936 intlen
= encode_varint(value
, intbuf
);
2937 strbuf_add(out
, intbuf
, intlen
);
2939 strbuf_add(out
, untracked
->name
, strlen(untracked
->name
) + 1);
2941 for (i
= 0; i
< untracked
->untracked_nr
; i
++)
2942 strbuf_add(out
, untracked
->untracked
[i
],
2943 strlen(untracked
->untracked
[i
]) + 1);
2945 for (i
= 0; i
< untracked
->dirs_nr
; i
++)
2946 if (untracked
->dirs
[i
]->recurse
)
2947 write_one_dir(untracked
->dirs
[i
], wd
);
2950 void write_untracked_extension(struct strbuf
*out
, struct untracked_cache
*untracked
)
2952 struct ondisk_untracked_cache
*ouc
;
2953 struct write_data wd
;
2954 unsigned char varbuf
[16];
2956 const unsigned hashsz
= the_hash_algo
->rawsz
;
2958 ouc
= xcalloc(1, sizeof(*ouc
));
2959 stat_data_to_disk(&ouc
->info_exclude_stat
, &untracked
->ss_info_exclude
.stat
);
2960 stat_data_to_disk(&ouc
->excludes_file_stat
, &untracked
->ss_excludes_file
.stat
);
2961 ouc
->dir_flags
= htonl(untracked
->dir_flags
);
2963 varint_len
= encode_varint(untracked
->ident
.len
, varbuf
);
2964 strbuf_add(out
, varbuf
, varint_len
);
2965 strbuf_addbuf(out
, &untracked
->ident
);
2967 strbuf_add(out
, ouc
, sizeof(*ouc
));
2968 strbuf_add(out
, untracked
->ss_info_exclude
.oid
.hash
, hashsz
);
2969 strbuf_add(out
, untracked
->ss_excludes_file
.oid
.hash
, hashsz
);
2970 strbuf_add(out
, untracked
->exclude_per_dir
, strlen(untracked
->exclude_per_dir
) + 1);
2973 if (!untracked
->root
) {
2974 varint_len
= encode_varint(0, varbuf
);
2975 strbuf_add(out
, varbuf
, varint_len
);
2980 wd
.check_only
= ewah_new();
2981 wd
.valid
= ewah_new();
2982 wd
.sha1_valid
= ewah_new();
2983 strbuf_init(&wd
.out
, 1024);
2984 strbuf_init(&wd
.sb_stat
, 1024);
2985 strbuf_init(&wd
.sb_sha1
, 1024);
2986 write_one_dir(untracked
->root
, &wd
);
2988 varint_len
= encode_varint(wd
.index
, varbuf
);
2989 strbuf_add(out
, varbuf
, varint_len
);
2990 strbuf_addbuf(out
, &wd
.out
);
2991 ewah_serialize_strbuf(wd
.valid
, out
);
2992 ewah_serialize_strbuf(wd
.check_only
, out
);
2993 ewah_serialize_strbuf(wd
.sha1_valid
, out
);
2994 strbuf_addbuf(out
, &wd
.sb_stat
);
2995 strbuf_addbuf(out
, &wd
.sb_sha1
);
2996 strbuf_addch(out
, '\0'); /* safe guard for string lists */
2998 ewah_free(wd
.valid
);
2999 ewah_free(wd
.check_only
);
3000 ewah_free(wd
.sha1_valid
);
3001 strbuf_release(&wd
.out
);
3002 strbuf_release(&wd
.sb_stat
);
3003 strbuf_release(&wd
.sb_sha1
);
3006 static void free_untracked(struct untracked_cache_dir
*ucd
)
3011 for (i
= 0; i
< ucd
->dirs_nr
; i
++)
3012 free_untracked(ucd
->dirs
[i
]);
3013 for (i
= 0; i
< ucd
->untracked_nr
; i
++)
3014 free(ucd
->untracked
[i
]);
3015 free(ucd
->untracked
);
3020 void free_untracked_cache(struct untracked_cache
*uc
)
3023 free_untracked(uc
->root
);
3029 struct untracked_cache_dir
**ucd
;
3030 struct ewah_bitmap
*check_only
;
3031 struct ewah_bitmap
*valid
;
3032 struct ewah_bitmap
*sha1_valid
;
3033 const unsigned char *data
;
3034 const unsigned char *end
;
3037 static void stat_data_from_disk(struct stat_data
*to
, const unsigned char *data
)
3039 memcpy(to
, data
, sizeof(*to
));
3040 to
->sd_ctime
.sec
= ntohl(to
->sd_ctime
.sec
);
3041 to
->sd_ctime
.nsec
= ntohl(to
->sd_ctime
.nsec
);
3042 to
->sd_mtime
.sec
= ntohl(to
->sd_mtime
.sec
);
3043 to
->sd_mtime
.nsec
= ntohl(to
->sd_mtime
.nsec
);
3044 to
->sd_dev
= ntohl(to
->sd_dev
);
3045 to
->sd_ino
= ntohl(to
->sd_ino
);
3046 to
->sd_uid
= ntohl(to
->sd_uid
);
3047 to
->sd_gid
= ntohl(to
->sd_gid
);
3048 to
->sd_size
= ntohl(to
->sd_size
);
3051 static int read_one_dir(struct untracked_cache_dir
**untracked_
,
3052 struct read_data
*rd
)
3054 struct untracked_cache_dir ud
, *untracked
;
3055 const unsigned char *data
= rd
->data
, *end
= rd
->end
;
3056 const unsigned char *eos
;
3060 memset(&ud
, 0, sizeof(ud
));
3062 value
= decode_varint(&data
);
3066 ud
.untracked_alloc
= value
;
3067 ud
.untracked_nr
= value
;
3068 if (ud
.untracked_nr
)
3069 ALLOC_ARRAY(ud
.untracked
, ud
.untracked_nr
);
3071 ud
.dirs_alloc
= ud
.dirs_nr
= decode_varint(&data
);
3074 ALLOC_ARRAY(ud
.dirs
, ud
.dirs_nr
);
3076 eos
= memchr(data
, '\0', end
- data
);
3077 if (!eos
|| eos
== end
)
3080 *untracked_
= untracked
= xmalloc(st_add3(sizeof(*untracked
), eos
- data
, 1));
3081 memcpy(untracked
, &ud
, sizeof(ud
));
3082 memcpy(untracked
->name
, data
, eos
- data
+ 1);
3085 for (i
= 0; i
< untracked
->untracked_nr
; i
++) {
3086 eos
= memchr(data
, '\0', end
- data
);
3087 if (!eos
|| eos
== end
)
3089 untracked
->untracked
[i
] = xmemdupz(data
, eos
- data
);
3093 rd
->ucd
[rd
->index
++] = untracked
;
3096 for (i
= 0; i
< untracked
->dirs_nr
; i
++) {
3097 if (read_one_dir(untracked
->dirs
+ i
, rd
) < 0)
3103 static void set_check_only(size_t pos
, void *cb
)
3105 struct read_data
*rd
= cb
;
3106 struct untracked_cache_dir
*ud
= rd
->ucd
[pos
];
3110 static void read_stat(size_t pos
, void *cb
)
3112 struct read_data
*rd
= cb
;
3113 struct untracked_cache_dir
*ud
= rd
->ucd
[pos
];
3114 if (rd
->data
+ sizeof(struct stat_data
) > rd
->end
) {
3115 rd
->data
= rd
->end
+ 1;
3118 stat_data_from_disk(&ud
->stat_data
, rd
->data
);
3119 rd
->data
+= sizeof(struct stat_data
);
3123 static void read_oid(size_t pos
, void *cb
)
3125 struct read_data
*rd
= cb
;
3126 struct untracked_cache_dir
*ud
= rd
->ucd
[pos
];
3127 if (rd
->data
+ the_hash_algo
->rawsz
> rd
->end
) {
3128 rd
->data
= rd
->end
+ 1;
3131 hashcpy(ud
->exclude_oid
.hash
, rd
->data
);
3132 rd
->data
+= the_hash_algo
->rawsz
;
3135 static void load_oid_stat(struct oid_stat
*oid_stat
, const unsigned char *data
,
3136 const unsigned char *sha1
)
3138 stat_data_from_disk(&oid_stat
->stat
, data
);
3139 hashcpy(oid_stat
->oid
.hash
, sha1
);
3140 oid_stat
->valid
= 1;
3143 struct untracked_cache
*read_untracked_extension(const void *data
, unsigned long sz
)
3145 struct untracked_cache
*uc
;
3146 struct read_data rd
;
3147 const unsigned char *next
= data
, *end
= (const unsigned char *)data
+ sz
;
3151 const char *exclude_per_dir
;
3152 const unsigned hashsz
= the_hash_algo
->rawsz
;
3153 const unsigned offset
= sizeof(struct ondisk_untracked_cache
);
3154 const unsigned exclude_per_dir_offset
= offset
+ 2 * hashsz
;
3156 if (sz
<= 1 || end
[-1] != '\0')
3160 ident_len
= decode_varint(&next
);
3161 if (next
+ ident_len
> end
)
3163 ident
= (const char *)next
;
3166 if (next
+ exclude_per_dir_offset
+ 1 > end
)
3169 uc
= xcalloc(1, sizeof(*uc
));
3170 strbuf_init(&uc
->ident
, ident_len
);
3171 strbuf_add(&uc
->ident
, ident
, ident_len
);
3172 load_oid_stat(&uc
->ss_info_exclude
,
3173 next
+ ouc_offset(info_exclude_stat
),
3175 load_oid_stat(&uc
->ss_excludes_file
,
3176 next
+ ouc_offset(excludes_file_stat
),
3177 next
+ offset
+ hashsz
);
3178 uc
->dir_flags
= get_be32(next
+ ouc_offset(dir_flags
));
3179 exclude_per_dir
= (const char *)next
+ exclude_per_dir_offset
;
3180 uc
->exclude_per_dir
= xstrdup(exclude_per_dir
);
3181 /* NUL after exclude_per_dir is covered by sizeof(*ouc) */
3182 next
+= exclude_per_dir_offset
+ strlen(exclude_per_dir
) + 1;
3186 len
= decode_varint(&next
);
3187 if (next
> end
|| len
== 0)
3190 rd
.valid
= ewah_new();
3191 rd
.check_only
= ewah_new();
3192 rd
.sha1_valid
= ewah_new();
3196 ALLOC_ARRAY(rd
.ucd
, len
);
3198 if (read_one_dir(&uc
->root
, &rd
) || rd
.index
!= len
)
3202 len
= ewah_read_mmap(rd
.valid
, next
, end
- next
);
3207 len
= ewah_read_mmap(rd
.check_only
, next
, end
- next
);
3212 len
= ewah_read_mmap(rd
.sha1_valid
, next
, end
- next
);
3216 ewah_each_bit(rd
.check_only
, set_check_only
, &rd
);
3217 rd
.data
= next
+ len
;
3218 ewah_each_bit(rd
.valid
, read_stat
, &rd
);
3219 ewah_each_bit(rd
.sha1_valid
, read_oid
, &rd
);
3224 ewah_free(rd
.valid
);
3225 ewah_free(rd
.check_only
);
3226 ewah_free(rd
.sha1_valid
);
3229 free_untracked_cache(uc
);
3235 static void invalidate_one_directory(struct untracked_cache
*uc
,
3236 struct untracked_cache_dir
*ucd
)
3238 uc
->dir_invalidated
++;
3240 ucd
->untracked_nr
= 0;
3244 * Normally when an entry is added or removed from a directory,
3245 * invalidating that directory is enough. No need to touch its
3246 * ancestors. When a directory is shown as "foo/bar/" in git-status
3247 * however, deleting or adding an entry may have cascading effect.
3249 * Say the "foo/bar/file" has become untracked, we need to tell the
3250 * untracked_cache_dir of "foo" that "bar/" is not an untracked
3251 * directory any more (because "bar" is managed by foo as an untracked
3254 * Similarly, if "foo/bar/file" moves from untracked to tracked and it
3255 * was the last untracked entry in the entire "foo", we should show
3256 * "foo/" instead. Which means we have to invalidate past "bar" up to
3259 * This function traverses all directories from root to leaf. If there
3260 * is a chance of one of the above cases happening, we invalidate back
3261 * to root. Otherwise we just invalidate the leaf. There may be a more
3262 * sophisticated way than checking for SHOW_OTHER_DIRECTORIES to
3263 * detect these cases and avoid unnecessary invalidation, for example,
3264 * checking for the untracked entry named "bar/" in "foo", but for now
3265 * stick to something safe and simple.
3267 static int invalidate_one_component(struct untracked_cache
*uc
,
3268 struct untracked_cache_dir
*dir
,
3269 const char *path
, int len
)
3271 const char *rest
= strchr(path
, '/');
3274 int component_len
= rest
- path
;
3275 struct untracked_cache_dir
*d
=
3276 lookup_untracked(uc
, dir
, path
, component_len
);
3278 invalidate_one_component(uc
, d
, rest
+ 1,
3279 len
- (component_len
+ 1));
3281 invalidate_one_directory(uc
, dir
);
3285 invalidate_one_directory(uc
, dir
);
3286 return uc
->dir_flags
& DIR_SHOW_OTHER_DIRECTORIES
;
3289 void untracked_cache_invalidate_path(struct index_state
*istate
,
3290 const char *path
, int safe_path
)
3292 if (!istate
->untracked
|| !istate
->untracked
->root
)
3294 if (!safe_path
&& !verify_path(path
, 0))
3296 invalidate_one_component(istate
->untracked
, istate
->untracked
->root
,
3297 path
, strlen(path
));
3300 void untracked_cache_remove_from_index(struct index_state
*istate
,
3303 untracked_cache_invalidate_path(istate
, path
, 1);
3306 void untracked_cache_add_to_index(struct index_state
*istate
,
3309 untracked_cache_invalidate_path(istate
, path
, 1);
3312 static void connect_wt_gitdir_in_nested(const char *sub_worktree
,
3313 const char *sub_gitdir
)
3316 struct repository subrepo
;
3317 struct strbuf sub_wt
= STRBUF_INIT
;
3318 struct strbuf sub_gd
= STRBUF_INIT
;
3320 const struct submodule
*sub
;
3322 /* If the submodule has no working tree, we can ignore it. */
3323 if (repo_init(&subrepo
, sub_gitdir
, sub_worktree
))
3326 if (repo_read_index(&subrepo
) < 0)
3327 die(_("index file corrupt in repo %s"), subrepo
.gitdir
);
3329 for (i
= 0; i
< subrepo
.index
->cache_nr
; i
++) {
3330 const struct cache_entry
*ce
= subrepo
.index
->cache
[i
];
3332 if (!S_ISGITLINK(ce
->ce_mode
))
3335 while (i
+ 1 < subrepo
.index
->cache_nr
&&
3336 !strcmp(ce
->name
, subrepo
.index
->cache
[i
+ 1]->name
))
3338 * Skip entries with the same name in different stages
3339 * to make sure an entry is returned only once.
3343 sub
= submodule_from_path(&subrepo
, &null_oid
, ce
->name
);
3344 if (!sub
|| !is_submodule_active(&subrepo
, ce
->name
))
3345 /* .gitmodules broken or inactive sub */
3348 strbuf_reset(&sub_wt
);
3349 strbuf_reset(&sub_gd
);
3350 strbuf_addf(&sub_wt
, "%s/%s", sub_worktree
, sub
->path
);
3351 strbuf_addf(&sub_gd
, "%s/modules/%s", sub_gitdir
, sub
->name
);
3353 connect_work_tree_and_git_dir(sub_wt
.buf
, sub_gd
.buf
, 1);
3355 strbuf_release(&sub_wt
);
3356 strbuf_release(&sub_gd
);
3357 repo_clear(&subrepo
);
3360 void connect_work_tree_and_git_dir(const char *work_tree_
,
3361 const char *git_dir_
,
3362 int recurse_into_nested
)
3364 struct strbuf gitfile_sb
= STRBUF_INIT
;
3365 struct strbuf cfg_sb
= STRBUF_INIT
;
3366 struct strbuf rel_path
= STRBUF_INIT
;
3367 char *git_dir
, *work_tree
;
3369 /* Prepare .git file */
3370 strbuf_addf(&gitfile_sb
, "%s/.git", work_tree_
);
3371 if (safe_create_leading_directories_const(gitfile_sb
.buf
))
3372 die(_("could not create directories for %s"), gitfile_sb
.buf
);
3374 /* Prepare config file */
3375 strbuf_addf(&cfg_sb
, "%s/config", git_dir_
);
3376 if (safe_create_leading_directories_const(cfg_sb
.buf
))
3377 die(_("could not create directories for %s"), cfg_sb
.buf
);
3379 git_dir
= real_pathdup(git_dir_
, 1);
3380 work_tree
= real_pathdup(work_tree_
, 1);
3382 /* Write .git file */
3383 write_file(gitfile_sb
.buf
, "gitdir: %s",
3384 relative_path(git_dir
, work_tree
, &rel_path
));
3385 /* Update core.worktree setting */
3386 git_config_set_in_file(cfg_sb
.buf
, "core.worktree",
3387 relative_path(work_tree
, git_dir
, &rel_path
));
3389 strbuf_release(&gitfile_sb
);
3390 strbuf_release(&cfg_sb
);
3391 strbuf_release(&rel_path
);
3393 if (recurse_into_nested
)
3394 connect_wt_gitdir_in_nested(work_tree
, git_dir
);
3401 * Migrate the git directory of the given path from old_git_dir to new_git_dir.
3403 void relocate_gitdir(const char *path
, const char *old_git_dir
, const char *new_git_dir
)
3405 if (rename(old_git_dir
, new_git_dir
) < 0)
3406 die_errno(_("could not migrate git directory from '%s' to '%s'"),
3407 old_git_dir
, new_git_dir
);
3409 connect_work_tree_and_git_dir(path
, new_git_dir
, 0);