2 * GIT - The information manager from hell
4 * Copyright (C) Linus Torvalds, 2005
6 #define NO_THE_INDEX_COMPATIBILITY_MACROS
11 #include "cache-tree.h"
17 #include "resolve-undo.h"
20 #include "split-index.h"
23 /* Mask for the name length in ce_flags in the on-disk index */
25 #define CE_NAMEMASK (0x0fff)
29 * The first letter should be 'A'..'Z' for extensions that are not
30 * necessary for a correct operation (i.e. optimization data).
31 * When new extensions are added that _needs_ to be understood in
32 * order to correctly interpret the index file, pick character that
33 * is outside the range, to cause the reader to abort.
36 #define CACHE_EXT(s) ( (s[0]<<24)|(s[1]<<16)|(s[2]<<8)|(s[3]) )
37 #define CACHE_EXT_TREE 0x54524545 /* "TREE" */
38 #define CACHE_EXT_RESOLVE_UNDO 0x52455543 /* "REUC" */
39 #define CACHE_EXT_LINK 0x6c696e6b /* "link" */
40 #define CACHE_EXT_UNTRACKED 0x554E5452 /* "UNTR" */
42 /* changes that can be kept in $GIT_DIR/index (basically all extensions) */
43 #define EXTMASK (RESOLVE_UNDO_CHANGED | CACHE_TREE_CHANGED | \
44 CE_ENTRY_ADDED | CE_ENTRY_REMOVED | CE_ENTRY_CHANGED | \
45 SPLIT_INDEX_ORDERED | UNTRACKED_CHANGED)
47 struct index_state the_index;
48 static const char *alternate_index_output;
50 static void set_index_entry(struct index_state *istate, int nr, struct cache_entry *ce)
52 istate->cache[nr] = ce;
53 add_name_hash(istate, ce);
56 static void replace_index_entry(struct index_state *istate, int nr, struct cache_entry *ce)
58 struct cache_entry *old = istate->cache[nr];
60 replace_index_entry_in_base(istate, old, ce);
61 remove_name_hash(istate, old);
63 set_index_entry(istate, nr, ce);
64 ce->ce_flags |= CE_UPDATE_IN_BASE;
65 istate->cache_changed |= CE_ENTRY_CHANGED;
68 void rename_index_entry_at(struct index_state *istate, int nr, const char *new_name)
70 struct cache_entry *old = istate->cache[nr], *new;
71 int namelen = strlen(new_name);
73 new = xmalloc(cache_entry_size(namelen));
74 copy_cache_entry(new, old);
75 new->ce_flags &= ~CE_HASHED;
76 new->ce_namelen = namelen;
78 memcpy(new->name, new_name, namelen + 1);
80 cache_tree_invalidate_path(istate, old->name);
81 untracked_cache_remove_from_index(istate, old->name);
82 remove_index_entry_at(istate, nr);
83 add_index_entry(istate, new, ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE);
86 void fill_stat_data(struct stat_data *sd, struct stat *st)
88 sd->sd_ctime.sec = (unsigned int)st->st_ctime;
89 sd->sd_mtime.sec = (unsigned int)st->st_mtime;
90 sd->sd_ctime.nsec = ST_CTIME_NSEC(*st);
91 sd->sd_mtime.nsec = ST_MTIME_NSEC(*st);
92 sd->sd_dev = st->st_dev;
93 sd->sd_ino = st->st_ino;
94 sd->sd_uid = st->st_uid;
95 sd->sd_gid = st->st_gid;
96 sd->sd_size = st->st_size;
99 int match_stat_data(const struct stat_data *sd, struct stat *st)
103 if (sd->sd_mtime.sec != (unsigned int)st->st_mtime)
104 changed |= MTIME_CHANGED;
105 if (trust_ctime && check_stat &&
106 sd->sd_ctime.sec != (unsigned int)st->st_ctime)
107 changed |= CTIME_CHANGED;
110 if (check_stat && sd->sd_mtime.nsec != ST_MTIME_NSEC(*st))
111 changed |= MTIME_CHANGED;
112 if (trust_ctime && check_stat &&
113 sd->sd_ctime.nsec != ST_CTIME_NSEC(*st))
114 changed |= CTIME_CHANGED;
118 if (sd->sd_uid != (unsigned int) st->st_uid ||
119 sd->sd_gid != (unsigned int) st->st_gid)
120 changed |= OWNER_CHANGED;
121 if (sd->sd_ino != (unsigned int) st->st_ino)
122 changed |= INODE_CHANGED;
127 * st_dev breaks on network filesystems where different
128 * clients will have different views of what "device"
129 * the filesystem is on
131 if (check_stat && sd->sd_dev != (unsigned int) st->st_dev)
132 changed |= INODE_CHANGED;
135 if (sd->sd_size != (unsigned int) st->st_size)
136 changed |= DATA_CHANGED;
142 * This only updates the "non-critical" parts of the directory
143 * cache, ie the parts that aren't tracked by GIT, and only used
144 * to validate the cache.
146 void fill_stat_cache_info(struct cache_entry *ce, struct stat *st)
148 fill_stat_data(&ce->ce_stat_data, st);
150 if (assume_unchanged)
151 ce->ce_flags |= CE_VALID;
153 if (S_ISREG(st->st_mode))
154 ce_mark_uptodate(ce);
157 static int ce_compare_data(const struct cache_entry *ce, struct stat *st)
160 int fd = git_open_cloexec(ce->name, O_RDONLY);
163 unsigned char sha1[20];
164 if (!index_fd(sha1, fd, st, OBJ_BLOB, ce->name, 0))
165 match = hashcmp(sha1, ce->oid.hash);
166 /* index_fd() closed the file descriptor already */
171 static int ce_compare_link(const struct cache_entry *ce, size_t expected_size)
176 enum object_type type;
177 struct strbuf sb = STRBUF_INIT;
179 if (strbuf_readlink(&sb, ce->name, expected_size))
182 buffer = read_sha1_file(ce->oid.hash, &type, &size);
185 match = memcmp(buffer, sb.buf, size);
192 static int ce_compare_gitlink(const struct cache_entry *ce)
194 unsigned char sha1[20];
197 * We don't actually require that the .git directory
198 * under GITLINK directory be a valid git directory. It
199 * might even be missing (in case nobody populated that
202 * If so, we consider it always to match.
204 if (resolve_gitlink_ref(ce->name, "HEAD", sha1) < 0)
206 return hashcmp(sha1, ce->oid.hash);
209 static int ce_modified_check_fs(const struct cache_entry *ce, struct stat *st)
211 switch (st->st_mode & S_IFMT) {
213 if (ce_compare_data(ce, st))
217 if (ce_compare_link(ce, xsize_t(st->st_size)))
221 if (S_ISGITLINK(ce->ce_mode))
222 return ce_compare_gitlink(ce) ? DATA_CHANGED : 0;
229 static int ce_match_stat_basic(const struct cache_entry *ce, struct stat *st)
231 unsigned int changed = 0;
233 if (ce->ce_flags & CE_REMOVE)
234 return MODE_CHANGED | DATA_CHANGED | TYPE_CHANGED;
236 switch (ce->ce_mode & S_IFMT) {
238 changed |= !S_ISREG(st->st_mode) ? TYPE_CHANGED : 0;
239 /* We consider only the owner x bit to be relevant for
242 if (trust_executable_bit &&
243 (0100 & (ce->ce_mode ^ st->st_mode)))
244 changed |= MODE_CHANGED;
247 if (!S_ISLNK(st->st_mode) &&
248 (has_symlinks || !S_ISREG(st->st_mode)))
249 changed |= TYPE_CHANGED;
252 /* We ignore most of the st_xxx fields for gitlinks */
253 if (!S_ISDIR(st->st_mode))
254 changed |= TYPE_CHANGED;
255 else if (ce_compare_gitlink(ce))
256 changed |= DATA_CHANGED;
259 die("internal error: ce_mode is %o", ce->ce_mode);
262 changed |= match_stat_data(&ce->ce_stat_data, st);
264 /* Racily smudged entry? */
265 if (!ce->ce_stat_data.sd_size) {
266 if (!is_empty_blob_sha1(ce->oid.hash))
267 changed |= DATA_CHANGED;
273 static int is_racy_stat(const struct index_state *istate,
274 const struct stat_data *sd)
276 return (istate->timestamp.sec &&
278 /* nanosecond timestamped files can also be racy! */
279 (istate->timestamp.sec < sd->sd_mtime.sec ||
280 (istate->timestamp.sec == sd->sd_mtime.sec &&
281 istate->timestamp.nsec <= sd->sd_mtime.nsec))
283 istate->timestamp.sec <= sd->sd_mtime.sec
288 static int is_racy_timestamp(const struct index_state *istate,
289 const struct cache_entry *ce)
291 return (!S_ISGITLINK(ce->ce_mode) &&
292 is_racy_stat(istate, &ce->ce_stat_data));
295 int match_stat_data_racy(const struct index_state *istate,
296 const struct stat_data *sd, struct stat *st)
298 if (is_racy_stat(istate, sd))
299 return MTIME_CHANGED;
300 return match_stat_data(sd, st);
303 int ie_match_stat(const struct index_state *istate,
304 const struct cache_entry *ce, struct stat *st,
305 unsigned int options)
307 unsigned int changed;
308 int ignore_valid = options & CE_MATCH_IGNORE_VALID;
309 int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE;
310 int assume_racy_is_modified = options & CE_MATCH_RACY_IS_DIRTY;
313 * If it's marked as always valid in the index, it's
314 * valid whatever the checked-out copy says.
316 * skip-worktree has the same effect with higher precedence
318 if (!ignore_skip_worktree && ce_skip_worktree(ce))
320 if (!ignore_valid && (ce->ce_flags & CE_VALID))
324 * Intent-to-add entries have not been added, so the index entry
325 * by definition never matches what is in the work tree until it
326 * actually gets added.
328 if (ce_intent_to_add(ce))
329 return DATA_CHANGED | TYPE_CHANGED | MODE_CHANGED;
331 changed = ce_match_stat_basic(ce, st);
334 * Within 1 second of this sequence:
335 * echo xyzzy >file && git-update-index --add file
336 * running this command:
338 * would give a falsely clean cache entry. The mtime and
339 * length match the cache, and other stat fields do not change.
341 * We could detect this at update-index time (the cache entry
342 * being registered/updated records the same time as "now")
343 * and delay the return from git-update-index, but that would
344 * effectively mean we can make at most one commit per second,
345 * which is not acceptable. Instead, we check cache entries
346 * whose mtime are the same as the index file timestamp more
347 * carefully than others.
349 if (!changed && is_racy_timestamp(istate, ce)) {
350 if (assume_racy_is_modified)
351 changed |= DATA_CHANGED;
353 changed |= ce_modified_check_fs(ce, st);
359 int ie_modified(const struct index_state *istate,
360 const struct cache_entry *ce,
361 struct stat *st, unsigned int options)
363 int changed, changed_fs;
365 changed = ie_match_stat(istate, ce, st, options);
369 * If the mode or type has changed, there's no point in trying
370 * to refresh the entry - it's not going to match
372 if (changed & (MODE_CHANGED | TYPE_CHANGED))
376 * Immediately after read-tree or update-index --cacheinfo,
377 * the length field is zero, as we have never even read the
378 * lstat(2) information once, and we cannot trust DATA_CHANGED
379 * returned by ie_match_stat() which in turn was returned by
380 * ce_match_stat_basic() to signal that the filesize of the
381 * blob changed. We have to actually go to the filesystem to
382 * see if the contents match, and if so, should answer "unchanged".
384 * The logic does not apply to gitlinks, as ce_match_stat_basic()
385 * already has checked the actual HEAD from the filesystem in the
386 * subproject. If ie_match_stat() already said it is different,
387 * then we know it is.
389 if ((changed & DATA_CHANGED) &&
390 (S_ISGITLINK(ce->ce_mode) || ce->ce_stat_data.sd_size != 0))
393 changed_fs = ce_modified_check_fs(ce, st);
395 return changed | changed_fs;
399 int base_name_compare(const char *name1, int len1, int mode1,
400 const char *name2, int len2, int mode2)
402 unsigned char c1, c2;
403 int len = len1 < len2 ? len1 : len2;
406 cmp = memcmp(name1, name2, len);
411 if (!c1 && S_ISDIR(mode1))
413 if (!c2 && S_ISDIR(mode2))
415 return (c1 < c2) ? -1 : (c1 > c2) ? 1 : 0;
419 * df_name_compare() is identical to base_name_compare(), except it
420 * compares conflicting directory/file entries as equal. Note that
421 * while a directory name compares as equal to a regular file, they
422 * then individually compare _differently_ to a filename that has
423 * a dot after the basename (because '\0' < '.' < '/').
425 * This is used by routines that want to traverse the git namespace
426 * but then handle conflicting entries together when possible.
428 int df_name_compare(const char *name1, int len1, int mode1,
429 const char *name2, int len2, int mode2)
431 int len = len1 < len2 ? len1 : len2, cmp;
432 unsigned char c1, c2;
434 cmp = memcmp(name1, name2, len);
437 /* Directories and files compare equal (same length, same name) */
441 if (!c1 && S_ISDIR(mode1))
444 if (!c2 && S_ISDIR(mode2))
446 if (c1 == '/' && !c2)
448 if (c2 == '/' && !c1)
453 int name_compare(const char *name1, size_t len1, const char *name2, size_t len2)
455 size_t min_len = (len1 < len2) ? len1 : len2;
456 int cmp = memcmp(name1, name2, min_len);
466 int cache_name_stage_compare(const char *name1, int len1, int stage1, const char *name2, int len2, int stage2)
470 cmp = name_compare(name1, len1, name2, len2);
481 static int index_name_stage_pos(const struct index_state *istate, const char *name, int namelen, int stage)
486 last = istate->cache_nr;
487 while (last > first) {
488 int next = (last + first) >> 1;
489 struct cache_entry *ce = istate->cache[next];
490 int cmp = cache_name_stage_compare(name, namelen, stage, ce->name, ce_namelen(ce), ce_stage(ce));
502 int index_name_pos(const struct index_state *istate, const char *name, int namelen)
504 return index_name_stage_pos(istate, name, namelen, 0);
507 int remove_index_entry_at(struct index_state *istate, int pos)
509 struct cache_entry *ce = istate->cache[pos];
511 record_resolve_undo(istate, ce);
512 remove_name_hash(istate, ce);
513 save_or_free_index_entry(istate, ce);
514 istate->cache_changed |= CE_ENTRY_REMOVED;
516 if (pos >= istate->cache_nr)
518 MOVE_ARRAY(istate->cache + pos, istate->cache + pos + 1,
519 istate->cache_nr - pos);
524 * Remove all cache entries marked for removal, that is where
525 * CE_REMOVE is set in ce_flags. This is much more effective than
526 * calling remove_index_entry_at() for each entry to be removed.
528 void remove_marked_cache_entries(struct index_state *istate)
530 struct cache_entry **ce_array = istate->cache;
533 for (i = j = 0; i < istate->cache_nr; i++) {
534 if (ce_array[i]->ce_flags & CE_REMOVE) {
535 remove_name_hash(istate, ce_array[i]);
536 save_or_free_index_entry(istate, ce_array[i]);
539 ce_array[j++] = ce_array[i];
541 if (j == istate->cache_nr)
543 istate->cache_changed |= CE_ENTRY_REMOVED;
544 istate->cache_nr = j;
547 int remove_file_from_index(struct index_state *istate, const char *path)
549 int pos = index_name_pos(istate, path, strlen(path));
552 cache_tree_invalidate_path(istate, path);
553 untracked_cache_remove_from_index(istate, path);
554 while (pos < istate->cache_nr && !strcmp(istate->cache[pos]->name, path))
555 remove_index_entry_at(istate, pos);
559 static int compare_name(struct cache_entry *ce, const char *path, int namelen)
561 return namelen != ce_namelen(ce) || memcmp(path, ce->name, namelen);
564 static int index_name_pos_also_unmerged(struct index_state *istate,
565 const char *path, int namelen)
567 int pos = index_name_pos(istate, path, namelen);
568 struct cache_entry *ce;
573 /* maybe unmerged? */
575 if (pos >= istate->cache_nr ||
576 compare_name((ce = istate->cache[pos]), path, namelen))
579 /* order of preference: stage 2, 1, 3 */
580 if (ce_stage(ce) == 1 && pos + 1 < istate->cache_nr &&
581 ce_stage((ce = istate->cache[pos + 1])) == 2 &&
582 !compare_name(ce, path, namelen))
587 static int different_name(struct cache_entry *ce, struct cache_entry *alias)
589 int len = ce_namelen(ce);
590 return ce_namelen(alias) != len || memcmp(ce->name, alias->name, len);
594 * If we add a filename that aliases in the cache, we will use the
595 * name that we already have - but we don't want to update the same
596 * alias twice, because that implies that there were actually two
597 * different files with aliasing names!
599 * So we use the CE_ADDED flag to verify that the alias was an old
600 * one before we accept it as
602 static struct cache_entry *create_alias_ce(struct index_state *istate,
603 struct cache_entry *ce,
604 struct cache_entry *alias)
607 struct cache_entry *new;
609 if (alias->ce_flags & CE_ADDED)
610 die("Will not add file alias '%s' ('%s' already exists in index)", ce->name, alias->name);
612 /* Ok, create the new entry using the name of the existing alias */
613 len = ce_namelen(alias);
614 new = xcalloc(1, cache_entry_size(len));
615 memcpy(new->name, alias->name, len);
616 copy_cache_entry(new, ce);
617 save_or_free_index_entry(istate, ce);
621 void set_object_name_for_intent_to_add_entry(struct cache_entry *ce)
623 unsigned char sha1[20];
624 if (write_sha1_file("", 0, blob_type, sha1))
625 die("cannot create an empty blob in the object database");
626 hashcpy(ce->oid.hash, sha1);
629 int add_to_index(struct index_state *istate, const char *path, struct stat *st, int flags)
631 int size, namelen, was_same;
632 mode_t st_mode = st->st_mode;
633 struct cache_entry *ce, *alias;
634 unsigned ce_option = CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE|CE_MATCH_RACY_IS_DIRTY;
635 int verbose = flags & (ADD_CACHE_VERBOSE | ADD_CACHE_PRETEND);
636 int pretend = flags & ADD_CACHE_PRETEND;
637 int intent_only = flags & ADD_CACHE_INTENT;
638 int add_option = (ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE|
639 (intent_only ? ADD_CACHE_NEW_ONLY : 0));
641 if (!S_ISREG(st_mode) && !S_ISLNK(st_mode) && !S_ISDIR(st_mode))
642 return error("%s: can only add regular files, symbolic links or git-directories", path);
644 namelen = strlen(path);
645 if (S_ISDIR(st_mode)) {
646 while (namelen && path[namelen-1] == '/')
649 size = cache_entry_size(namelen);
650 ce = xcalloc(1, size);
651 memcpy(ce->name, path, namelen);
652 ce->ce_namelen = namelen;
654 fill_stat_cache_info(ce, st);
656 ce->ce_flags |= CE_INTENT_TO_ADD;
659 if (trust_executable_bit && has_symlinks) {
660 ce->ce_mode = create_ce_mode(st_mode);
662 /* If there is an existing entry, pick the mode bits and type
663 * from it, otherwise assume unexecutable regular file.
665 struct cache_entry *ent;
666 int pos = index_name_pos_also_unmerged(istate, path, namelen);
668 ent = (0 <= pos) ? istate->cache[pos] : NULL;
669 ce->ce_mode = ce_mode_from_stat(ent, st_mode);
672 /* When core.ignorecase=true, determine if a directory of the same name but differing
673 * case already exists within the Git repository. If it does, ensure the directory
674 * case of the file being added to the repository matches (is folded into) the existing
675 * entry's directory case.
678 adjust_dirname_case(istate, ce->name);
681 alias = index_file_exists(istate, ce->name, ce_namelen(ce), ignore_case);
682 if (alias && !ce_stage(alias) && !ie_match_stat(istate, alias, st, ce_option)) {
683 /* Nothing changed, really */
684 if (!S_ISGITLINK(alias->ce_mode))
685 ce_mark_uptodate(alias);
686 alias->ce_flags |= CE_ADDED;
692 if (index_path(ce->oid.hash, path, st, HASH_WRITE_OBJECT)) {
694 return error("unable to index file %s", path);
697 set_object_name_for_intent_to_add_entry(ce);
699 if (ignore_case && alias && different_name(ce, alias))
700 ce = create_alias_ce(istate, ce, alias);
701 ce->ce_flags |= CE_ADDED;
703 /* It was suspected to be racily clean, but it turns out to be Ok */
706 !oidcmp(&alias->oid, &ce->oid) &&
707 ce->ce_mode == alias->ce_mode);
711 else if (add_index_entry(istate, ce, add_option)) {
713 return error("unable to add %s to index", path);
715 if (verbose && !was_same)
716 printf("add '%s'\n", path);
720 int add_file_to_index(struct index_state *istate, const char *path, int flags)
723 if (lstat(path, &st))
724 die_errno("unable to stat '%s'", path);
725 return add_to_index(istate, path, &st, flags);
728 struct cache_entry *make_cache_entry(unsigned int mode,
729 const unsigned char *sha1, const char *path, int stage,
730 unsigned int refresh_options)
733 struct cache_entry *ce, *ret;
735 if (!verify_path(path, mode)) {
736 error("Invalid path '%s'", path);
741 size = cache_entry_size(len);
742 ce = xcalloc(1, size);
744 hashcpy(ce->oid.hash, sha1);
745 memcpy(ce->name, path, len);
746 ce->ce_flags = create_ce_flags(stage);
747 ce->ce_namelen = len;
748 ce->ce_mode = create_ce_mode(mode);
750 ret = refresh_cache_entry(ce, refresh_options);
757 * Chmod an index entry with either +x or -x.
759 * Returns -1 if the chmod for the particular cache entry failed (if it's
760 * not a regular file), -2 if an invalid flip argument is passed in, 0
763 int chmod_index_entry(struct index_state *istate, struct cache_entry *ce,
766 if (!S_ISREG(ce->ce_mode))
773 ce->ce_mode &= ~0111;
778 cache_tree_invalidate_path(istate, ce->name);
779 ce->ce_flags |= CE_UPDATE_IN_BASE;
780 istate->cache_changed |= CE_ENTRY_CHANGED;
785 int ce_same_name(const struct cache_entry *a, const struct cache_entry *b)
787 int len = ce_namelen(a);
788 return ce_namelen(b) == len && !memcmp(a->name, b->name, len);
792 * We fundamentally don't like some paths: we don't want
793 * dot or dot-dot anywhere, and for obvious reasons don't
794 * want to recurse into ".git" either.
796 * Also, we don't want double slashes or slashes at the
797 * end that can make pathnames ambiguous.
799 static int verify_dotfile(const char *rest, unsigned mode)
802 * The first character was '.', but that
803 * has already been discarded, we now test
807 /* "." is not allowed */
808 if (*rest == '\0' || is_dir_sep(*rest))
813 * ".git" followed by NUL or slash is bad. Note that we match
814 * case-insensitively here, even if ignore_case is not set.
815 * This outlaws ".GIT" everywhere out of an abundance of caution,
816 * since there's really no good reason to allow it.
818 * Once we've seen ".git", we can also find ".gitmodules", etc (also
819 * case-insensitively).
823 if (rest[1] != 'i' && rest[1] != 'I')
825 if (rest[2] != 't' && rest[2] != 'T')
827 if (rest[3] == '\0' || is_dir_sep(rest[3]))
831 if (skip_iprefix(rest, "modules", &rest) &&
832 (*rest == '\0' || is_dir_sep(*rest)))
837 if (rest[1] == '\0' || is_dir_sep(rest[1]))
843 int verify_path(const char *path, unsigned mode)
847 if (has_dos_drive_prefix(path))
857 if (is_hfs_dotgit(path))
860 if (is_hfs_dotgitmodules(path))
865 if (is_ntfs_dotgit(path))
868 if (is_ntfs_dotgitmodules(path))
874 if ((c == '.' && !verify_dotfile(path, mode)) ||
875 is_dir_sep(c) || c == '\0')
877 } else if (c == '\\' && protect_ntfs) {
878 if (is_ntfs_dotgit(path))
881 if (is_ntfs_dotgitmodules(path))
891 * Do we have another file that has the beginning components being a
892 * proper superset of the name we're trying to add?
894 static int has_file_name(struct index_state *istate,
895 const struct cache_entry *ce, int pos, int ok_to_replace)
898 int len = ce_namelen(ce);
899 int stage = ce_stage(ce);
900 const char *name = ce->name;
902 while (pos < istate->cache_nr) {
903 struct cache_entry *p = istate->cache[pos++];
905 if (len >= ce_namelen(p))
907 if (memcmp(name, p->name, len))
909 if (ce_stage(p) != stage)
911 if (p->name[len] != '/')
913 if (p->ce_flags & CE_REMOVE)
918 remove_index_entry_at(istate, --pos);
925 * Like strcmp(), but also return the offset of the first change.
926 * If strings are equal, return the length.
928 int strcmp_offset(const char *s1, const char *s2, size_t *first_change)
933 return strcmp(s1, s2);
935 for (k = 0; s1[k] == s2[k]; k++)
940 return (unsigned char)s1[k] - (unsigned char)s2[k];
944 * Do we have another file with a pathname that is a proper
945 * subset of the name we're trying to add?
947 * That is, is there another file in the index with a path
948 * that matches a sub-directory in the given entry?
950 static int has_dir_name(struct index_state *istate,
951 const struct cache_entry *ce, int pos, int ok_to_replace)
954 int stage = ce_stage(ce);
955 const char *name = ce->name;
956 const char *slash = name + ce_namelen(ce);
961 * We are frequently called during an iteration on a sorted
962 * list of pathnames and while building a new index. Therefore,
963 * there is a high probability that this entry will eventually
964 * be appended to the index, rather than inserted in the middle.
965 * If we can confirm that, we can avoid binary searches on the
966 * components of the pathname.
968 * Compare the entry's full path with the last path in the index.
970 if (istate->cache_nr > 0) {
971 cmp_last = strcmp_offset(name,
972 istate->cache[istate->cache_nr - 1]->name,
975 if (len_eq_last == 0) {
977 * The entry sorts AFTER the last one in the
978 * index and their paths have no common prefix,
979 * so there cannot be a F/D conflict.
984 * The entry sorts AFTER the last one in the
985 * index, but has a common prefix. Fall through
986 * to the loop below to disect the entry's path
987 * and see where the difference is.
990 } else if (cmp_last == 0) {
992 * The entry exactly matches the last one in the
993 * index, but because of multiple stage and CE_REMOVE
994 * items, we fall through and let the regular search
1004 if (*--slash == '/')
1006 if (slash <= ce->name)
1013 * (len + 1) is a directory boundary (including
1014 * the trailing slash). And since the loop is
1015 * decrementing "slash", the first iteration is
1016 * the longest directory prefix; subsequent
1017 * iterations consider parent directories.
1020 if (len + 1 <= len_eq_last) {
1022 * The directory prefix (including the trailing
1023 * slash) also appears as a prefix in the last
1024 * entry, so the remainder cannot collide (because
1025 * strcmp said the whole path was greater).
1030 * LT: last: xxx/file_A
1036 if (len > len_eq_last) {
1038 * This part of the directory prefix (excluding
1039 * the trailing slash) is longer than the known
1040 * equal portions, so this sub-directory cannot
1041 * collide with a file.
1049 if (istate->cache_nr > 0 &&
1050 ce_namelen(istate->cache[istate->cache_nr - 1]) > len) {
1052 * The directory prefix lines up with part of
1053 * a longer file or directory name, but sorts
1054 * after it, so this sub-directory cannot
1055 * collide with a file.
1057 * last: xxx/yy-file (because '-' sorts before '/')
1064 * This is a possible collision. Fall through and
1065 * let the regular search code handle it.
1072 pos = index_name_stage_pos(istate, name, len, stage);
1075 * Found one, but not so fast. This could
1076 * be a marker that says "I was here, but
1077 * I am being removed". Such an entry is
1078 * not a part of the resulting tree, and
1079 * it is Ok to have a directory at the same
1082 if (!(istate->cache[pos]->ce_flags & CE_REMOVE)) {
1086 remove_index_entry_at(istate, pos);
1094 * Trivial optimization: if we find an entry that
1095 * already matches the sub-directory, then we know
1096 * we're ok, and we can exit.
1098 while (pos < istate->cache_nr) {
1099 struct cache_entry *p = istate->cache[pos];
1100 if ((ce_namelen(p) <= len) ||
1101 (p->name[len] != '/') ||
1102 memcmp(p->name, name, len))
1103 break; /* not our subdirectory */
1104 if (ce_stage(p) == stage && !(p->ce_flags & CE_REMOVE))
1106 * p is at the same stage as our entry, and
1107 * is a subdirectory of what we are looking
1108 * at, so we cannot have conflicts at our
1109 * level or anything shorter.
1118 /* We may be in a situation where we already have path/file and path
1119 * is being added, or we already have path and path/file is being
1120 * added. Either one would result in a nonsense tree that has path
1121 * twice when git-write-tree tries to write it out. Prevent it.
1123 * If ok-to-replace is specified, we remove the conflicting entries
1124 * from the cache so the caller should recompute the insert position.
1125 * When this happens, we return non-zero.
1127 static int check_file_directory_conflict(struct index_state *istate,
1128 const struct cache_entry *ce,
1129 int pos, int ok_to_replace)
1134 * When ce is an "I am going away" entry, we allow it to be added
1136 if (ce->ce_flags & CE_REMOVE)
1140 * We check if the path is a sub-path of a subsequent pathname
1141 * first, since removing those will not change the position
1144 retval = has_file_name(istate, ce, pos, ok_to_replace);
1147 * Then check if the path might have a clashing sub-directory
1150 return retval + has_dir_name(istate, ce, pos, ok_to_replace);
1153 static int add_index_entry_with_check(struct index_state *istate, struct cache_entry *ce, int option)
1156 int ok_to_add = option & ADD_CACHE_OK_TO_ADD;
1157 int ok_to_replace = option & ADD_CACHE_OK_TO_REPLACE;
1158 int skip_df_check = option & ADD_CACHE_SKIP_DFCHECK;
1159 int new_only = option & ADD_CACHE_NEW_ONLY;
1161 if (!(option & ADD_CACHE_KEEP_CACHE_TREE))
1162 cache_tree_invalidate_path(istate, ce->name);
1165 * If this entry's path sorts after the last entry in the index,
1166 * we can avoid searching for it.
1168 if (istate->cache_nr > 0 &&
1169 strcmp(ce->name, istate->cache[istate->cache_nr - 1]->name) > 0)
1170 pos = -istate->cache_nr - 1;
1172 pos = index_name_stage_pos(istate, ce->name, ce_namelen(ce), ce_stage(ce));
1174 /* existing match? Just replace it. */
1177 replace_index_entry(istate, pos, ce);
1182 if (!(option & ADD_CACHE_KEEP_CACHE_TREE))
1183 untracked_cache_add_to_index(istate, ce->name);
1186 * Inserting a merged entry ("stage 0") into the index
1187 * will always replace all non-merged entries..
1189 if (pos < istate->cache_nr && ce_stage(ce) == 0) {
1190 while (ce_same_name(istate->cache[pos], ce)) {
1192 if (!remove_index_entry_at(istate, pos))
1199 if (!verify_path(ce->name, ce->ce_mode))
1200 return error("Invalid path '%s'", ce->name);
1202 if (!skip_df_check &&
1203 check_file_directory_conflict(istate, ce, pos, ok_to_replace)) {
1205 return error("'%s' appears as both a file and as a directory",
1207 pos = index_name_stage_pos(istate, ce->name, ce_namelen(ce), ce_stage(ce));
1213 int add_index_entry(struct index_state *istate, struct cache_entry *ce, int option)
1217 if (option & ADD_CACHE_JUST_APPEND)
1218 pos = istate->cache_nr;
1221 ret = add_index_entry_with_check(istate, ce, option);
1227 /* Make sure the array is big enough .. */
1228 ALLOC_GROW(istate->cache, istate->cache_nr + 1, istate->cache_alloc);
1232 if (istate->cache_nr > pos + 1)
1233 memmove(istate->cache + pos + 1,
1234 istate->cache + pos,
1235 (istate->cache_nr - pos - 1) * sizeof(ce));
1236 set_index_entry(istate, pos, ce);
1237 istate->cache_changed |= CE_ENTRY_ADDED;
1242 * "refresh" does not calculate a new sha1 file or bring the
1243 * cache up-to-date for mode/content changes. But what it
1244 * _does_ do is to "re-match" the stat information of a file
1245 * with the cache, so that you can refresh the cache for a
1246 * file that hasn't been changed but where the stat entry is
1249 * For example, you'd want to do this after doing a "git-read-tree",
1250 * to link up the stat cache details with the proper files.
1252 static struct cache_entry *refresh_cache_ent(struct index_state *istate,
1253 struct cache_entry *ce,
1254 unsigned int options, int *err,
1258 struct cache_entry *updated;
1260 int refresh = options & CE_MATCH_REFRESH;
1261 int ignore_valid = options & CE_MATCH_IGNORE_VALID;
1262 int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE;
1263 int ignore_missing = options & CE_MATCH_IGNORE_MISSING;
1265 if (!refresh || ce_uptodate(ce))
1269 * CE_VALID or CE_SKIP_WORKTREE means the user promised us
1270 * that the change to the work tree does not matter and told
1273 if (!ignore_skip_worktree && ce_skip_worktree(ce)) {
1274 ce_mark_uptodate(ce);
1277 if (!ignore_valid && (ce->ce_flags & CE_VALID)) {
1278 ce_mark_uptodate(ce);
1282 if (has_symlink_leading_path(ce->name, ce_namelen(ce))) {
1290 if (lstat(ce->name, &st) < 0) {
1291 if (ignore_missing && errno == ENOENT)
1298 changed = ie_match_stat(istate, ce, &st, options);
1300 *changed_ret = changed;
1303 * The path is unchanged. If we were told to ignore
1304 * valid bit, then we did the actual stat check and
1305 * found that the entry is unmodified. If the entry
1306 * is not marked VALID, this is the place to mark it
1307 * valid again, under "assume unchanged" mode.
1309 if (ignore_valid && assume_unchanged &&
1310 !(ce->ce_flags & CE_VALID))
1311 ; /* mark this one VALID again */
1314 * We do not mark the index itself "modified"
1315 * because CE_UPTODATE flag is in-core only;
1316 * we are not going to write this change out.
1318 if (!S_ISGITLINK(ce->ce_mode))
1319 ce_mark_uptodate(ce);
1324 if (ie_modified(istate, ce, &st, options)) {
1331 updated = xmalloc(size);
1332 memcpy(updated, ce, size);
1333 fill_stat_cache_info(updated, &st);
1335 * If ignore_valid is not set, we should leave CE_VALID bit
1336 * alone. Otherwise, paths marked with --no-assume-unchanged
1337 * (i.e. things to be edited) will reacquire CE_VALID bit
1338 * automatically, which is not really what we want.
1340 if (!ignore_valid && assume_unchanged &&
1341 !(ce->ce_flags & CE_VALID))
1342 updated->ce_flags &= ~CE_VALID;
1344 /* istate->cache_changed is updated in the caller */
1348 static void show_file(const char * fmt, const char * name, int in_porcelain,
1349 int * first, const char *header_msg)
1351 if (in_porcelain && *first && header_msg) {
1352 printf("%s\n", header_msg);
1358 int refresh_index(struct index_state *istate, unsigned int flags,
1359 const struct pathspec *pathspec,
1360 char *seen, const char *header_msg)
1364 int really = (flags & REFRESH_REALLY) != 0;
1365 int allow_unmerged = (flags & REFRESH_UNMERGED) != 0;
1366 int quiet = (flags & REFRESH_QUIET) != 0;
1367 int not_new = (flags & REFRESH_IGNORE_MISSING) != 0;
1368 int ignore_submodules = (flags & REFRESH_IGNORE_SUBMODULES) != 0;
1370 int in_porcelain = (flags & REFRESH_IN_PORCELAIN);
1371 unsigned int options = (CE_MATCH_REFRESH |
1372 (really ? CE_MATCH_IGNORE_VALID : 0) |
1373 (not_new ? CE_MATCH_IGNORE_MISSING : 0));
1374 const char *modified_fmt;
1375 const char *deleted_fmt;
1376 const char *typechange_fmt;
1377 const char *added_fmt;
1378 const char *unmerged_fmt;
1380 modified_fmt = (in_porcelain ? "M\t%s\n" : "%s: needs update\n");
1381 deleted_fmt = (in_porcelain ? "D\t%s\n" : "%s: needs update\n");
1382 typechange_fmt = (in_porcelain ? "T\t%s\n" : "%s needs update\n");
1383 added_fmt = (in_porcelain ? "A\t%s\n" : "%s needs update\n");
1384 unmerged_fmt = (in_porcelain ? "U\t%s\n" : "%s: needs merge\n");
1385 for (i = 0; i < istate->cache_nr; i++) {
1386 struct cache_entry *ce, *new;
1387 int cache_errno = 0;
1391 ce = istate->cache[i];
1392 if (ignore_submodules && S_ISGITLINK(ce->ce_mode))
1395 if (pathspec && !ce_path_match(ce, pathspec, seen))
1399 while ((i < istate->cache_nr) &&
1400 ! strcmp(istate->cache[i]->name, ce->name))
1406 show_file(unmerged_fmt, ce->name, in_porcelain,
1407 &first, header_msg);
1415 new = refresh_cache_ent(istate, ce, options, &cache_errno, &changed);
1421 if (really && cache_errno == EINVAL) {
1422 /* If we are doing --really-refresh that
1423 * means the index is not valid anymore.
1425 ce->ce_flags &= ~CE_VALID;
1426 ce->ce_flags |= CE_UPDATE_IN_BASE;
1427 istate->cache_changed |= CE_ENTRY_CHANGED;
1432 if (cache_errno == ENOENT)
1434 else if (ce_intent_to_add(ce))
1435 fmt = added_fmt; /* must be before other checks */
1436 else if (changed & TYPE_CHANGED)
1437 fmt = typechange_fmt;
1441 ce->name, in_porcelain, &first, header_msg);
1446 replace_index_entry(istate, i, new);
1451 struct cache_entry *refresh_cache_entry(struct cache_entry *ce,
1452 unsigned int options)
1454 return refresh_cache_ent(&the_index, ce, options, NULL, NULL);
1458 /*****************************************************************
1460 *****************************************************************/
1462 #define INDEX_FORMAT_DEFAULT 3
1464 static unsigned int get_index_format_default(void)
1466 char *envversion = getenv("GIT_INDEX_VERSION");
1469 unsigned int version = INDEX_FORMAT_DEFAULT;
1472 if (!git_config_get_int("index.version", &value))
1474 if (version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < version) {
1475 warning(_("index.version set, but the value is invalid.\n"
1476 "Using version %i"), INDEX_FORMAT_DEFAULT);
1477 return INDEX_FORMAT_DEFAULT;
1482 version = strtoul(envversion, &endp, 10);
1484 version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < version) {
1485 warning(_("GIT_INDEX_VERSION set, but the value is invalid.\n"
1486 "Using version %i"), INDEX_FORMAT_DEFAULT);
1487 version = INDEX_FORMAT_DEFAULT;
1493 * dev/ino/uid/gid/size are also just tracked to the low 32 bits
1494 * Again - this is just a (very strong in practice) heuristic that
1495 * the inode hasn't changed.
1497 * We save the fields in big-endian order to allow using the
1498 * index file over NFS transparently.
1500 struct ondisk_cache_entry {
1501 struct cache_time ctime;
1502 struct cache_time mtime;
1509 unsigned char sha1[20];
1511 char name[FLEX_ARRAY]; /* more */
1515 * This struct is used when CE_EXTENDED bit is 1
1516 * The struct must match ondisk_cache_entry exactly from
1519 struct ondisk_cache_entry_extended {
1520 struct cache_time ctime;
1521 struct cache_time mtime;
1528 unsigned char sha1[20];
1531 char name[FLEX_ARRAY]; /* more */
1534 /* These are only used for v3 or lower */
1535 #define align_flex_name(STRUCT,len) ((offsetof(struct STRUCT,name) + (len) + 8) & ~7)
1536 #define ondisk_cache_entry_size(len) align_flex_name(ondisk_cache_entry,len)
1537 #define ondisk_cache_entry_extended_size(len) align_flex_name(ondisk_cache_entry_extended,len)
1538 #define ondisk_ce_size(ce) (((ce)->ce_flags & CE_EXTENDED) ? \
1539 ondisk_cache_entry_extended_size(ce_namelen(ce)) : \
1540 ondisk_cache_entry_size(ce_namelen(ce)))
1542 /* Allow fsck to force verification of the index checksum. */
1543 int verify_index_checksum;
1545 static int verify_hdr(struct cache_header *hdr, unsigned long size)
1548 unsigned char sha1[20];
1551 if (hdr->hdr_signature != htonl(CACHE_SIGNATURE))
1552 return error("bad signature");
1553 hdr_version = ntohl(hdr->hdr_version);
1554 if (hdr_version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < hdr_version)
1555 return error("bad index version %d", hdr_version);
1557 if (!verify_index_checksum)
1561 git_SHA1_Update(&c, hdr, size - 20);
1562 git_SHA1_Final(sha1, &c);
1563 if (hashcmp(sha1, (unsigned char *)hdr + size - 20))
1564 return error("bad index file sha1 signature");
1568 static int read_index_extension(struct index_state *istate,
1569 const char *ext, void *data, unsigned long sz)
1571 switch (CACHE_EXT(ext)) {
1572 case CACHE_EXT_TREE:
1573 istate->cache_tree = cache_tree_read(data, sz);
1575 case CACHE_EXT_RESOLVE_UNDO:
1576 istate->resolve_undo = resolve_undo_read(data, sz);
1578 case CACHE_EXT_LINK:
1579 if (read_link_extension(istate, data, sz))
1582 case CACHE_EXT_UNTRACKED:
1583 istate->untracked = read_untracked_extension(data, sz);
1586 if (*ext < 'A' || 'Z' < *ext)
1587 return error("index uses %.4s extension, which we do not understand",
1589 fprintf(stderr, "ignoring %.4s extension\n", ext);
1595 int hold_locked_index(struct lock_file *lk, int lock_flags)
1597 return hold_lock_file_for_update(lk, get_index_file(), lock_flags);
1600 int read_index(struct index_state *istate)
1602 return read_index_from(istate, get_index_file());
1605 static struct cache_entry *cache_entry_from_ondisk(struct ondisk_cache_entry *ondisk,
1610 struct cache_entry *ce = xmalloc(cache_entry_size(len));
1612 ce->ce_stat_data.sd_ctime.sec = get_be32(&ondisk->ctime.sec);
1613 ce->ce_stat_data.sd_mtime.sec = get_be32(&ondisk->mtime.sec);
1614 ce->ce_stat_data.sd_ctime.nsec = get_be32(&ondisk->ctime.nsec);
1615 ce->ce_stat_data.sd_mtime.nsec = get_be32(&ondisk->mtime.nsec);
1616 ce->ce_stat_data.sd_dev = get_be32(&ondisk->dev);
1617 ce->ce_stat_data.sd_ino = get_be32(&ondisk->ino);
1618 ce->ce_mode = get_be32(&ondisk->mode);
1619 ce->ce_stat_data.sd_uid = get_be32(&ondisk->uid);
1620 ce->ce_stat_data.sd_gid = get_be32(&ondisk->gid);
1621 ce->ce_stat_data.sd_size = get_be32(&ondisk->size);
1622 ce->ce_flags = flags & ~CE_NAMEMASK;
1623 ce->ce_namelen = len;
1625 hashcpy(ce->oid.hash, ondisk->sha1);
1626 memcpy(ce->name, name, len);
1627 ce->name[len] = '\0';
1632 * Adjacent cache entries tend to share the leading paths, so it makes
1633 * sense to only store the differences in later entries. In the v4
1634 * on-disk format of the index, each on-disk cache entry stores the
1635 * number of bytes to be stripped from the end of the previous name,
1636 * and the bytes to append to the result, to come up with its name.
1638 static unsigned long expand_name_field(struct strbuf *name, const char *cp_)
1640 const unsigned char *ep, *cp = (const unsigned char *)cp_;
1641 size_t len = decode_varint(&cp);
1643 if (name->len < len)
1644 die("malformed name field in the index");
1645 strbuf_remove(name, name->len - len, len);
1646 for (ep = cp; *ep; ep++)
1647 ; /* find the end */
1648 strbuf_add(name, cp, ep - cp);
1649 return (const char *)ep + 1 - cp_;
1652 static struct cache_entry *create_from_disk(struct ondisk_cache_entry *ondisk,
1653 unsigned long *ent_size,
1654 struct strbuf *previous_name)
1656 struct cache_entry *ce;
1661 /* On-disk flags are just 16 bits */
1662 flags = get_be16(&ondisk->flags);
1663 len = flags & CE_NAMEMASK;
1665 if (flags & CE_EXTENDED) {
1666 struct ondisk_cache_entry_extended *ondisk2;
1668 ondisk2 = (struct ondisk_cache_entry_extended *)ondisk;
1669 extended_flags = get_be16(&ondisk2->flags2) << 16;
1670 /* We do not yet understand any bit out of CE_EXTENDED_FLAGS */
1671 if (extended_flags & ~CE_EXTENDED_FLAGS)
1672 die("Unknown index entry format %08x", extended_flags);
1673 flags |= extended_flags;
1674 name = ondisk2->name;
1677 name = ondisk->name;
1679 if (!previous_name) {
1680 /* v3 and earlier */
1681 if (len == CE_NAMEMASK)
1683 ce = cache_entry_from_ondisk(ondisk, flags, name, len);
1685 *ent_size = ondisk_ce_size(ce);
1687 unsigned long consumed;
1688 consumed = expand_name_field(previous_name, name);
1689 ce = cache_entry_from_ondisk(ondisk, flags,
1691 previous_name->len);
1693 *ent_size = (name - ((char *)ondisk)) + consumed;
1698 static void check_ce_order(struct index_state *istate)
1702 for (i = 1; i < istate->cache_nr; i++) {
1703 struct cache_entry *ce = istate->cache[i - 1];
1704 struct cache_entry *next_ce = istate->cache[i];
1705 int name_compare = strcmp(ce->name, next_ce->name);
1707 if (0 < name_compare)
1708 die("unordered stage entries in index");
1709 if (!name_compare) {
1711 die("multiple stage entries for merged file '%s'",
1713 if (ce_stage(ce) > ce_stage(next_ce))
1714 die("unordered stage entries for '%s'",
1720 static void tweak_untracked_cache(struct index_state *istate)
1722 switch (git_config_get_untracked_cache()) {
1723 case -1: /* keep: do nothing */
1726 remove_untracked_cache(istate);
1729 add_untracked_cache(istate);
1731 default: /* unknown value: do nothing */
1736 static void tweak_split_index(struct index_state *istate)
1738 switch (git_config_get_split_index()) {
1739 case -1: /* unset: do nothing */
1742 remove_split_index(istate);
1745 add_split_index(istate);
1747 default: /* unknown value: do nothing */
1752 static void post_read_index_from(struct index_state *istate)
1754 check_ce_order(istate);
1755 tweak_untracked_cache(istate);
1756 tweak_split_index(istate);
1759 /* remember to discard_cache() before reading a different cache! */
1760 int do_read_index(struct index_state *istate, const char *path, int must_exist)
1764 unsigned long src_offset;
1765 struct cache_header *hdr;
1768 struct strbuf previous_name_buf = STRBUF_INIT, *previous_name;
1770 if (istate->initialized)
1771 return istate->cache_nr;
1773 istate->timestamp.sec = 0;
1774 istate->timestamp.nsec = 0;
1775 fd = open(path, O_RDONLY);
1777 if (!must_exist && errno == ENOENT)
1779 die_errno("%s: index file open failed", path);
1783 die_errno("cannot stat the open index");
1785 mmap_size = xsize_t(st.st_size);
1786 if (mmap_size < sizeof(struct cache_header) + 20)
1787 die("index file smaller than expected");
1789 mmap = xmmap(NULL, mmap_size, PROT_READ, MAP_PRIVATE, fd, 0);
1790 if (mmap == MAP_FAILED)
1791 die_errno("unable to map index file");
1795 if (verify_hdr(hdr, mmap_size) < 0)
1798 hashcpy(istate->sha1, (const unsigned char *)hdr + mmap_size - 20);
1799 istate->version = ntohl(hdr->hdr_version);
1800 istate->cache_nr = ntohl(hdr->hdr_entries);
1801 istate->cache_alloc = alloc_nr(istate->cache_nr);
1802 istate->cache = xcalloc(istate->cache_alloc, sizeof(*istate->cache));
1803 istate->initialized = 1;
1805 if (istate->version == 4)
1806 previous_name = &previous_name_buf;
1808 previous_name = NULL;
1810 src_offset = sizeof(*hdr);
1811 for (i = 0; i < istate->cache_nr; i++) {
1812 struct ondisk_cache_entry *disk_ce;
1813 struct cache_entry *ce;
1814 unsigned long consumed;
1816 disk_ce = (struct ondisk_cache_entry *)((char *)mmap + src_offset);
1817 ce = create_from_disk(disk_ce, &consumed, previous_name);
1818 set_index_entry(istate, i, ce);
1820 src_offset += consumed;
1822 strbuf_release(&previous_name_buf);
1823 istate->timestamp.sec = st.st_mtime;
1824 istate->timestamp.nsec = ST_MTIME_NSEC(st);
1826 while (src_offset <= mmap_size - 20 - 8) {
1827 /* After an array of active_nr index entries,
1828 * there can be arbitrary number of extended
1829 * sections, each of which is prefixed with
1830 * extension name (4-byte) and section length
1831 * in 4-byte network byte order.
1834 memcpy(&extsize, (char *)mmap + src_offset + 4, 4);
1835 extsize = ntohl(extsize);
1836 if (read_index_extension(istate,
1837 (const char *) mmap + src_offset,
1838 (char *) mmap + src_offset + 8,
1842 src_offset += extsize;
1844 munmap(mmap, mmap_size);
1845 return istate->cache_nr;
1848 munmap(mmap, mmap_size);
1849 die("index file corrupt");
1853 * Signal that the shared index is used by updating its mtime.
1855 * This way, shared index can be removed if they have not been used
1858 static void freshen_shared_index(char *base_sha1_hex, int warn)
1860 char *shared_index = git_pathdup("sharedindex.%s", base_sha1_hex);
1861 if (!check_and_freshen_file(shared_index, 1) && warn)
1862 warning("could not freshen shared index '%s'", shared_index);
1866 int read_index_from(struct index_state *istate, const char *path)
1868 struct split_index *split_index;
1870 char *base_sha1_hex;
1871 const char *base_path;
1873 /* istate->initialized covers both .git/index and .git/sharedindex.xxx */
1874 if (istate->initialized)
1875 return istate->cache_nr;
1877 ret = do_read_index(istate, path, 0);
1879 split_index = istate->split_index;
1880 if (!split_index || is_null_sha1(split_index->base_sha1)) {
1881 post_read_index_from(istate);
1885 if (split_index->base)
1886 discard_index(split_index->base);
1888 split_index->base = xcalloc(1, sizeof(*split_index->base));
1890 base_sha1_hex = sha1_to_hex(split_index->base_sha1);
1891 base_path = git_path("sharedindex.%s", base_sha1_hex);
1892 ret = do_read_index(split_index->base, base_path, 1);
1893 if (hashcmp(split_index->base_sha1, split_index->base->sha1))
1894 die("broken index, expect %s in %s, got %s",
1895 base_sha1_hex, base_path,
1896 sha1_to_hex(split_index->base->sha1));
1898 freshen_shared_index(base_sha1_hex, 0);
1899 merge_base_index(istate);
1900 post_read_index_from(istate);
1904 int is_index_unborn(struct index_state *istate)
1906 return (!istate->cache_nr && !istate->timestamp.sec);
1909 int discard_index(struct index_state *istate)
1913 for (i = 0; i < istate->cache_nr; i++) {
1914 if (istate->cache[i]->index &&
1915 istate->split_index &&
1916 istate->split_index->base &&
1917 istate->cache[i]->index <= istate->split_index->base->cache_nr &&
1918 istate->cache[i] == istate->split_index->base->cache[istate->cache[i]->index - 1])
1920 free(istate->cache[i]);
1922 resolve_undo_clear_index(istate);
1923 istate->cache_nr = 0;
1924 istate->cache_changed = 0;
1925 istate->timestamp.sec = 0;
1926 istate->timestamp.nsec = 0;
1927 free_name_hash(istate);
1928 cache_tree_free(&(istate->cache_tree));
1929 istate->initialized = 0;
1930 FREE_AND_NULL(istate->cache);
1931 istate->cache_alloc = 0;
1932 discard_split_index(istate);
1933 free_untracked_cache(istate->untracked);
1934 istate->untracked = NULL;
1938 int unmerged_index(const struct index_state *istate)
1941 for (i = 0; i < istate->cache_nr; i++) {
1942 if (ce_stage(istate->cache[i]))
1948 #define WRITE_BUFFER_SIZE 8192
1949 static unsigned char write_buffer[WRITE_BUFFER_SIZE];
1950 static unsigned long write_buffer_len;
1952 static int ce_write_flush(git_SHA_CTX *context, int fd)
1954 unsigned int buffered = write_buffer_len;
1956 git_SHA1_Update(context, write_buffer, buffered);
1957 if (write_in_full(fd, write_buffer, buffered) < 0)
1959 write_buffer_len = 0;
1964 static int ce_write(git_SHA_CTX *context, int fd, void *data, unsigned int len)
1967 unsigned int buffered = write_buffer_len;
1968 unsigned int partial = WRITE_BUFFER_SIZE - buffered;
1971 memcpy(write_buffer + buffered, data, partial);
1972 buffered += partial;
1973 if (buffered == WRITE_BUFFER_SIZE) {
1974 write_buffer_len = buffered;
1975 if (ce_write_flush(context, fd))
1979 write_buffer_len = buffered;
1981 data = (char *) data + partial;
1986 static int write_index_ext_header(git_SHA_CTX *context, int fd,
1987 unsigned int ext, unsigned int sz)
1991 return ((ce_write(context, fd, &ext, 4) < 0) ||
1992 (ce_write(context, fd, &sz, 4) < 0)) ? -1 : 0;
1995 static int ce_flush(git_SHA_CTX *context, int fd, unsigned char *sha1)
1997 unsigned int left = write_buffer_len;
2000 write_buffer_len = 0;
2001 git_SHA1_Update(context, write_buffer, left);
2004 /* Flush first if not enough space for SHA1 signature */
2005 if (left + 20 > WRITE_BUFFER_SIZE) {
2006 if (write_in_full(fd, write_buffer, left) < 0)
2011 /* Append the SHA1 signature at the end */
2012 git_SHA1_Final(write_buffer + left, context);
2013 hashcpy(sha1, write_buffer + left);
2015 return (write_in_full(fd, write_buffer, left) < 0) ? -1 : 0;
2018 static void ce_smudge_racily_clean_entry(struct cache_entry *ce)
2021 * The only thing we care about in this function is to smudge the
2022 * falsely clean entry due to touch-update-touch race, so we leave
2023 * everything else as they are. We are called for entries whose
2024 * ce_stat_data.sd_mtime match the index file mtime.
2026 * Note that this actually does not do much for gitlinks, for
2027 * which ce_match_stat_basic() always goes to the actual
2028 * contents. The caller checks with is_racy_timestamp() which
2029 * always says "no" for gitlinks, so we are not called for them ;-)
2033 if (lstat(ce->name, &st) < 0)
2035 if (ce_match_stat_basic(ce, &st))
2037 if (ce_modified_check_fs(ce, &st)) {
2038 /* This is "racily clean"; smudge it. Note that this
2039 * is a tricky code. At first glance, it may appear
2040 * that it can break with this sequence:
2042 * $ echo xyzzy >frotz
2043 * $ git-update-index --add frotz
2046 * $ echo filfre >nitfol
2047 * $ git-update-index --add nitfol
2049 * but it does not. When the second update-index runs,
2050 * it notices that the entry "frotz" has the same timestamp
2051 * as index, and if we were to smudge it by resetting its
2052 * size to zero here, then the object name recorded
2053 * in index is the 6-byte file but the cached stat information
2054 * becomes zero --- which would then match what we would
2055 * obtain from the filesystem next time we stat("frotz").
2057 * However, the second update-index, before calling
2058 * this function, notices that the cached size is 6
2059 * bytes and what is on the filesystem is an empty
2060 * file, and never calls us, so the cached size information
2061 * for "frotz" stays 6 which does not match the filesystem.
2063 ce->ce_stat_data.sd_size = 0;
2067 /* Copy miscellaneous fields but not the name */
2068 static char *copy_cache_entry_to_ondisk(struct ondisk_cache_entry *ondisk,
2069 struct cache_entry *ce)
2073 ondisk->ctime.sec = htonl(ce->ce_stat_data.sd_ctime.sec);
2074 ondisk->mtime.sec = htonl(ce->ce_stat_data.sd_mtime.sec);
2075 ondisk->ctime.nsec = htonl(ce->ce_stat_data.sd_ctime.nsec);
2076 ondisk->mtime.nsec = htonl(ce->ce_stat_data.sd_mtime.nsec);
2077 ondisk->dev = htonl(ce->ce_stat_data.sd_dev);
2078 ondisk->ino = htonl(ce->ce_stat_data.sd_ino);
2079 ondisk->mode = htonl(ce->ce_mode);
2080 ondisk->uid = htonl(ce->ce_stat_data.sd_uid);
2081 ondisk->gid = htonl(ce->ce_stat_data.sd_gid);
2082 ondisk->size = htonl(ce->ce_stat_data.sd_size);
2083 hashcpy(ondisk->sha1, ce->oid.hash);
2085 flags = ce->ce_flags & ~CE_NAMEMASK;
2086 flags |= (ce_namelen(ce) >= CE_NAMEMASK ? CE_NAMEMASK : ce_namelen(ce));
2087 ondisk->flags = htons(flags);
2088 if (ce->ce_flags & CE_EXTENDED) {
2089 struct ondisk_cache_entry_extended *ondisk2;
2090 ondisk2 = (struct ondisk_cache_entry_extended *)ondisk;
2091 ondisk2->flags2 = htons((ce->ce_flags & CE_EXTENDED_FLAGS) >> 16);
2092 return ondisk2->name;
2095 return ondisk->name;
2099 static int ce_write_entry(git_SHA_CTX *c, int fd, struct cache_entry *ce,
2100 struct strbuf *previous_name)
2103 struct ondisk_cache_entry *ondisk;
2104 int saved_namelen = saved_namelen; /* compiler workaround */
2108 if (ce->ce_flags & CE_STRIP_NAME) {
2109 saved_namelen = ce_namelen(ce);
2113 if (!previous_name) {
2114 size = ondisk_ce_size(ce);
2115 ondisk = xcalloc(1, size);
2116 name = copy_cache_entry_to_ondisk(ondisk, ce);
2117 memcpy(name, ce->name, ce_namelen(ce));
2119 int common, to_remove, prefix_size;
2120 unsigned char to_remove_vi[16];
2122 (ce->name[common] &&
2123 common < previous_name->len &&
2124 ce->name[common] == previous_name->buf[common]);
2126 ; /* still matching */
2127 to_remove = previous_name->len - common;
2128 prefix_size = encode_varint(to_remove, to_remove_vi);
2130 if (ce->ce_flags & CE_EXTENDED)
2131 size = offsetof(struct ondisk_cache_entry_extended, name);
2133 size = offsetof(struct ondisk_cache_entry, name);
2134 size += prefix_size + (ce_namelen(ce) - common + 1);
2136 ondisk = xcalloc(1, size);
2137 name = copy_cache_entry_to_ondisk(ondisk, ce);
2138 memcpy(name, to_remove_vi, prefix_size);
2139 memcpy(name + prefix_size, ce->name + common, ce_namelen(ce) - common);
2141 strbuf_splice(previous_name, common, to_remove,
2142 ce->name + common, ce_namelen(ce) - common);
2144 if (ce->ce_flags & CE_STRIP_NAME) {
2145 ce->ce_namelen = saved_namelen;
2146 ce->ce_flags &= ~CE_STRIP_NAME;
2149 result = ce_write(c, fd, ondisk, size);
2155 * This function verifies if index_state has the correct sha1 of the
2156 * index file. Don't die if we have any other failure, just return 0.
2158 static int verify_index_from(const struct index_state *istate, const char *path)
2163 unsigned char sha1[20];
2165 if (!istate->initialized)
2168 fd = open(path, O_RDONLY);
2175 if (st.st_size < sizeof(struct cache_header) + 20)
2178 n = pread_in_full(fd, sha1, 20, st.st_size - 20);
2182 if (hashcmp(istate->sha1, sha1))
2193 static int verify_index(const struct index_state *istate)
2195 return verify_index_from(istate, get_index_file());
2198 static int has_racy_timestamp(struct index_state *istate)
2200 int entries = istate->cache_nr;
2203 for (i = 0; i < entries; i++) {
2204 struct cache_entry *ce = istate->cache[i];
2205 if (is_racy_timestamp(istate, ce))
2212 * Opportunistically update the index but do not complain if we can't
2214 void update_index_if_able(struct index_state *istate, struct lock_file *lockfile)
2216 if ((istate->cache_changed || has_racy_timestamp(istate)) &&
2217 verify_index(istate) &&
2218 write_locked_index(istate, lockfile, COMMIT_LOCK))
2219 rollback_lock_file(lockfile);
2222 static int do_write_index(struct index_state *istate, struct tempfile *tempfile,
2223 int strip_extensions)
2225 int newfd = tempfile->fd;
2227 struct cache_header hdr;
2228 int i, err, removed, extended, hdr_version;
2229 struct cache_entry **cache = istate->cache;
2230 int entries = istate->cache_nr;
2232 struct strbuf previous_name_buf = STRBUF_INIT, *previous_name;
2233 int drop_cache_tree = 0;
2235 for (i = removed = extended = 0; i < entries; i++) {
2236 if (cache[i]->ce_flags & CE_REMOVE)
2239 /* reduce extended entries if possible */
2240 cache[i]->ce_flags &= ~CE_EXTENDED;
2241 if (cache[i]->ce_flags & CE_EXTENDED_FLAGS) {
2243 cache[i]->ce_flags |= CE_EXTENDED;
2247 if (!istate->version) {
2248 istate->version = get_index_format_default();
2249 if (getenv("GIT_TEST_SPLIT_INDEX"))
2250 init_split_index(istate);
2253 /* demote version 3 to version 2 when the latter suffices */
2254 if (istate->version == 3 || istate->version == 2)
2255 istate->version = extended ? 3 : 2;
2257 hdr_version = istate->version;
2259 hdr.hdr_signature = htonl(CACHE_SIGNATURE);
2260 hdr.hdr_version = htonl(hdr_version);
2261 hdr.hdr_entries = htonl(entries - removed);
2264 if (ce_write(&c, newfd, &hdr, sizeof(hdr)) < 0)
2267 previous_name = (hdr_version == 4) ? &previous_name_buf : NULL;
2268 for (i = 0; i < entries; i++) {
2269 struct cache_entry *ce = cache[i];
2270 if (ce->ce_flags & CE_REMOVE)
2272 if (!ce_uptodate(ce) && is_racy_timestamp(istate, ce))
2273 ce_smudge_racily_clean_entry(ce);
2274 if (is_null_oid(&ce->oid)) {
2275 static const char msg[] = "cache entry has null sha1: %s";
2276 static int allow = -1;
2279 allow = git_env_bool("GIT_ALLOW_NULL_SHA1", 0);
2281 warning(msg, ce->name);
2283 return error(msg, ce->name);
2285 drop_cache_tree = 1;
2287 if (ce_write_entry(&c, newfd, ce, previous_name) < 0)
2290 strbuf_release(&previous_name_buf);
2292 /* Write extension data here */
2293 if (!strip_extensions && istate->split_index) {
2294 struct strbuf sb = STRBUF_INIT;
2296 err = write_link_extension(&sb, istate) < 0 ||
2297 write_index_ext_header(&c, newfd, CACHE_EXT_LINK,
2299 ce_write(&c, newfd, sb.buf, sb.len) < 0;
2300 strbuf_release(&sb);
2304 if (!strip_extensions && !drop_cache_tree && istate->cache_tree) {
2305 struct strbuf sb = STRBUF_INIT;
2307 cache_tree_write(&sb, istate->cache_tree);
2308 err = write_index_ext_header(&c, newfd, CACHE_EXT_TREE, sb.len) < 0
2309 || ce_write(&c, newfd, sb.buf, sb.len) < 0;
2310 strbuf_release(&sb);
2314 if (!strip_extensions && istate->resolve_undo) {
2315 struct strbuf sb = STRBUF_INIT;
2317 resolve_undo_write(&sb, istate->resolve_undo);
2318 err = write_index_ext_header(&c, newfd, CACHE_EXT_RESOLVE_UNDO,
2320 || ce_write(&c, newfd, sb.buf, sb.len) < 0;
2321 strbuf_release(&sb);
2325 if (!strip_extensions && istate->untracked) {
2326 struct strbuf sb = STRBUF_INIT;
2328 write_untracked_extension(&sb, istate->untracked);
2329 err = write_index_ext_header(&c, newfd, CACHE_EXT_UNTRACKED,
2331 ce_write(&c, newfd, sb.buf, sb.len) < 0;
2332 strbuf_release(&sb);
2337 if (ce_flush(&c, newfd, istate->sha1))
2339 if (close_tempfile(tempfile))
2340 return error(_("could not close '%s'"), tempfile->filename.buf);
2341 if (stat(tempfile->filename.buf, &st))
2343 istate->timestamp.sec = (unsigned int)st.st_mtime;
2344 istate->timestamp.nsec = ST_MTIME_NSEC(st);
2348 void set_alternate_index_output(const char *name)
2350 alternate_index_output = name;
2353 static int commit_locked_index(struct lock_file *lk)
2355 if (alternate_index_output)
2356 return commit_lock_file_to(lk, alternate_index_output);
2358 return commit_lock_file(lk);
2361 static int do_write_locked_index(struct index_state *istate, struct lock_file *lock,
2364 int ret = do_write_index(istate, &lock->tempfile, 0);
2367 assert((flags & (COMMIT_LOCK | CLOSE_LOCK)) !=
2368 (COMMIT_LOCK | CLOSE_LOCK));
2369 if (flags & COMMIT_LOCK)
2370 return commit_locked_index(lock);
2371 else if (flags & CLOSE_LOCK)
2372 return close_lock_file(lock);
2377 static int write_split_index(struct index_state *istate,
2378 struct lock_file *lock,
2382 prepare_to_write_split_index(istate);
2383 ret = do_write_locked_index(istate, lock, flags);
2384 finish_writing_split_index(istate);
2388 static const char *shared_index_expire = "2.weeks.ago";
2390 static unsigned long get_shared_index_expire_date(void)
2392 static unsigned long shared_index_expire_date;
2393 static int shared_index_expire_date_prepared;
2395 if (!shared_index_expire_date_prepared) {
2396 git_config_get_expiry("splitindex.sharedindexexpire",
2397 &shared_index_expire);
2398 shared_index_expire_date = approxidate(shared_index_expire);
2399 shared_index_expire_date_prepared = 1;
2402 return shared_index_expire_date;
2405 static int should_delete_shared_index(const char *shared_index_path)
2408 unsigned long expiration;
2410 /* Check timestamp */
2411 expiration = get_shared_index_expire_date();
2414 if (stat(shared_index_path, &st))
2415 return error_errno(_("could not stat '%s'"), shared_index_path);
2416 if (st.st_mtime > expiration)
2422 static int clean_shared_index_files(const char *current_hex)
2425 DIR *dir = opendir(get_git_dir());
2428 return error_errno(_("unable to open git dir: %s"), get_git_dir());
2430 while ((de = readdir(dir)) != NULL) {
2431 const char *sha1_hex;
2432 const char *shared_index_path;
2433 if (!skip_prefix(de->d_name, "sharedindex.", &sha1_hex))
2435 if (!strcmp(sha1_hex, current_hex))
2437 shared_index_path = git_path("%s", de->d_name);
2438 if (should_delete_shared_index(shared_index_path) > 0 &&
2439 unlink(shared_index_path))
2440 warning_errno(_("unable to unlink: %s"), shared_index_path);
2447 static struct tempfile temporary_sharedindex;
2449 static int write_shared_index(struct index_state *istate,
2450 struct lock_file *lock, unsigned flags)
2452 struct split_index *si = istate->split_index;
2455 fd = mks_tempfile(&temporary_sharedindex, git_path("sharedindex_XXXXXX"));
2457 hashclr(si->base_sha1);
2458 return do_write_locked_index(istate, lock, flags);
2460 move_cache_to_base_index(istate);
2461 ret = do_write_index(si->base, &temporary_sharedindex, 1);
2463 delete_tempfile(&temporary_sharedindex);
2466 ret = adjust_shared_perm(get_tempfile_path(&temporary_sharedindex));
2468 int save_errno = errno;
2469 error("cannot fix permission bits on %s", get_tempfile_path(&temporary_sharedindex));
2470 delete_tempfile(&temporary_sharedindex);
2474 ret = rename_tempfile(&temporary_sharedindex,
2475 git_path("sharedindex.%s", sha1_to_hex(si->base->sha1)));
2477 hashcpy(si->base_sha1, si->base->sha1);
2478 clean_shared_index_files(sha1_to_hex(si->base->sha1));
2484 static const int default_max_percent_split_change = 20;
2486 static int too_many_not_shared_entries(struct index_state *istate)
2488 int i, not_shared = 0;
2489 int max_split = git_config_get_max_percent_split_change();
2491 switch (max_split) {
2493 /* not or badly configured: use the default value */
2494 max_split = default_max_percent_split_change;
2497 return 1; /* 0% means always write a new shared index */
2499 return 0; /* 100% means never write a new shared index */
2501 break; /* just use the configured value */
2504 /* Count not shared entries */
2505 for (i = 0; i < istate->cache_nr; i++) {
2506 struct cache_entry *ce = istate->cache[i];
2511 return (int64_t)istate->cache_nr * max_split < (int64_t)not_shared * 100;
2514 int write_locked_index(struct index_state *istate, struct lock_file *lock,
2517 int new_shared_index, ret;
2518 struct split_index *si = istate->split_index;
2520 if (!si || alternate_index_output ||
2521 (istate->cache_changed & ~EXTMASK)) {
2523 hashclr(si->base_sha1);
2524 return do_write_locked_index(istate, lock, flags);
2527 if (getenv("GIT_TEST_SPLIT_INDEX")) {
2528 int v = si->base_sha1[0];
2530 istate->cache_changed |= SPLIT_INDEX_ORDERED;
2532 if (too_many_not_shared_entries(istate))
2533 istate->cache_changed |= SPLIT_INDEX_ORDERED;
2535 new_shared_index = istate->cache_changed & SPLIT_INDEX_ORDERED;
2537 if (new_shared_index) {
2538 ret = write_shared_index(istate, lock, flags);
2543 ret = write_split_index(istate, lock, flags);
2545 /* Freshen the shared index only if the split-index was written */
2546 if (!ret && !new_shared_index)
2547 freshen_shared_index(sha1_to_hex(si->base_sha1), 1);
2553 * Read the index file that is potentially unmerged into given
2554 * index_state, dropping any unmerged entries. Returns true if
2555 * the index is unmerged. Callers who want to refuse to work
2556 * from an unmerged state can call this and check its return value,
2557 * instead of calling read_cache().
2559 int read_index_unmerged(struct index_state *istate)
2565 for (i = 0; i < istate->cache_nr; i++) {
2566 struct cache_entry *ce = istate->cache[i];
2567 struct cache_entry *new_ce;
2573 len = ce_namelen(ce);
2574 size = cache_entry_size(len);
2575 new_ce = xcalloc(1, size);
2576 memcpy(new_ce->name, ce->name, len);
2577 new_ce->ce_flags = create_ce_flags(0) | CE_CONFLICTED;
2578 new_ce->ce_namelen = len;
2579 new_ce->ce_mode = ce->ce_mode;
2580 if (add_index_entry(istate, new_ce, 0))
2581 return error("%s: cannot drop to stage #0",
2588 * Returns 1 if the path is an "other" path with respect to
2589 * the index; that is, the path is not mentioned in the index at all,
2590 * either as a file, a directory with some files in the index,
2591 * or as an unmerged entry.
2593 * We helpfully remove a trailing "/" from directories so that
2594 * the output of read_directory can be used as-is.
2596 int index_name_is_other(const struct index_state *istate, const char *name,
2600 if (namelen && name[namelen - 1] == '/')
2602 pos = index_name_pos(istate, name, namelen);
2604 return 0; /* exact match */
2606 if (pos < istate->cache_nr) {
2607 struct cache_entry *ce = istate->cache[pos];
2608 if (ce_namelen(ce) == namelen &&
2609 !memcmp(ce->name, name, namelen))
2610 return 0; /* Yup, this one exists unmerged */
2615 void *read_blob_data_from_index(const struct index_state *istate,
2616 const char *path, unsigned long *size)
2620 enum object_type type;
2624 pos = index_name_pos(istate, path, len);
2627 * We might be in the middle of a merge, in which
2628 * case we would read stage #2 (ours).
2632 (pos < 0 && i < istate->cache_nr &&
2633 !strcmp(istate->cache[i]->name, path));
2635 if (ce_stage(istate->cache[i]) == 2)
2640 data = read_sha1_file(istate->cache[pos]->oid.hash, &type, &sz);
2641 if (!data || type != OBJ_BLOB) {
2650 void stat_validity_clear(struct stat_validity *sv)
2652 FREE_AND_NULL(sv->sd);
2655 int stat_validity_check(struct stat_validity *sv, const char *path)
2659 if (stat(path, &st) < 0)
2660 return sv->sd == NULL;
2663 return S_ISREG(st.st_mode) && !match_stat_data(sv->sd, &st);
2666 void stat_validity_update(struct stat_validity *sv, int fd)
2670 if (fstat(fd, &st) < 0 || !S_ISREG(st.st_mode))
2671 stat_validity_clear(sv);
2674 sv->sd = xcalloc(1, sizeof(struct stat_data));
2675 fill_stat_data(sv->sd, &st);
2679 void move_index_extensions(struct index_state *dst, struct index_state *src)
2681 dst->untracked = src->untracked;
2682 src->untracked = NULL;