]>
Commit | Line | Data |
---|---|---|
8bc9a0c7 LT |
1 | /* |
2 | * GIT - The information manager from hell | |
3 | * | |
4 | * Copyright (C) Linus Torvalds, 2005 | |
5 | */ | |
4aab5b46 | 6 | #define NO_THE_INDEX_COMPATIBILITY_MACROS |
e83c5163 | 7 | #include "cache.h" |
b2141fc1 | 8 | #include "config.h" |
f6ecc62d | 9 | #include "tempfile.h" |
697cc8ef | 10 | #include "lockfile.h" |
bad68ec9 | 11 | #include "cache-tree.h" |
f35a6d3b | 12 | #include "refs.h" |
d616813d | 13 | #include "dir.h" |
041aee31 JH |
14 | #include "tree.h" |
15 | #include "commit.h" | |
39425819 | 16 | #include "blob.h" |
cfc5789a | 17 | #include "resolve-undo.h" |
6c9cd161 JH |
18 | #include "strbuf.h" |
19 | #include "varint.h" | |
5fc2fc8f | 20 | #include "split-index.h" |
a42643aa | 21 | #include "utf8.h" |
883e248b | 22 | #include "fsmonitor.h" |
bad68ec9 | 23 | |
b60e188c TG |
24 | /* Mask for the name length in ce_flags in the on-disk index */ |
25 | ||
26 | #define CE_NAMEMASK (0x0fff) | |
27 | ||
bad68ec9 JH |
28 | /* Index extensions. |
29 | * | |
30 | * The first letter should be 'A'..'Z' for extensions that are not | |
31 | * necessary for a correct operation (i.e. optimization data). | |
32 | * When new extensions are added that _needs_ to be understood in | |
33 | * order to correctly interpret the index file, pick character that | |
34 | * is outside the range, to cause the reader to abort. | |
35 | */ | |
36 | ||
37 | #define CACHE_EXT(s) ( (s[0]<<24)|(s[1]<<16)|(s[2]<<8)|(s[3]) ) | |
38 | #define CACHE_EXT_TREE 0x54524545 /* "TREE" */ | |
b659b49b | 39 | #define CACHE_EXT_RESOLVE_UNDO 0x52455543 /* "REUC" */ |
5fc2fc8f | 40 | #define CACHE_EXT_LINK 0x6c696e6b /* "link" */ |
83c094ad | 41 | #define CACHE_EXT_UNTRACKED 0x554E5452 /* "UNTR" */ |
883e248b | 42 | #define CACHE_EXT_FSMONITOR 0x46534D4E /* "FSMN" */ |
5fc2fc8f NTND |
43 | |
44 | /* changes that can be kept in $GIT_DIR/index (basically all extensions) */ | |
e0cf0d7d | 45 | #define EXTMASK (RESOLVE_UNDO_CHANGED | CACHE_TREE_CHANGED | \ |
c18b80a0 | 46 | CE_ENTRY_ADDED | CE_ENTRY_REMOVED | CE_ENTRY_CHANGED | \ |
883e248b | 47 | SPLIT_INDEX_ORDERED | UNTRACKED_CHANGED | FSMONITOR_CHANGED) |
e83c5163 | 48 | |
228e94f9 | 49 | struct index_state the_index; |
626f35c8 | 50 | static const char *alternate_index_output; |
8fd2cb40 | 51 | |
9cb76b8c JH |
52 | static void set_index_entry(struct index_state *istate, int nr, struct cache_entry *ce) |
53 | { | |
54 | istate->cache[nr] = ce; | |
96872bc2 | 55 | add_name_hash(istate, ce); |
9cb76b8c JH |
56 | } |
57 | ||
cf558704 LT |
58 | static void replace_index_entry(struct index_state *istate, int nr, struct cache_entry *ce) |
59 | { | |
60 | struct cache_entry *old = istate->cache[nr]; | |
61 | ||
078a58e8 | 62 | replace_index_entry_in_base(istate, old, ce); |
2092678c | 63 | remove_name_hash(istate, old); |
5699d17e | 64 | free(old); |
a22c6371 | 65 | set_index_entry(istate, nr, ce); |
078a58e8 | 66 | ce->ce_flags |= CE_UPDATE_IN_BASE; |
883e248b | 67 | mark_fsmonitor_invalid(istate, ce); |
e636a7b4 | 68 | istate->cache_changed |= CE_ENTRY_CHANGED; |
cf558704 LT |
69 | } |
70 | ||
81dc2307 PB |
71 | void rename_index_entry_at(struct index_state *istate, int nr, const char *new_name) |
72 | { | |
73 | struct cache_entry *old = istate->cache[nr], *new; | |
74 | int namelen = strlen(new_name); | |
75 | ||
76 | new = xmalloc(cache_entry_size(namelen)); | |
77 | copy_cache_entry(new, old); | |
419a597f | 78 | new->ce_flags &= ~CE_HASHED; |
b60e188c | 79 | new->ce_namelen = namelen; |
5fc2fc8f | 80 | new->index = 0; |
81dc2307 PB |
81 | memcpy(new->name, new_name, namelen + 1); |
82 | ||
a5400efe | 83 | cache_tree_invalidate_path(istate, old->name); |
e931371a | 84 | untracked_cache_remove_from_index(istate, old->name); |
81dc2307 PB |
85 | remove_index_entry_at(istate, nr); |
86 | add_index_entry(istate, new, ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE); | |
87 | } | |
88 | ||
c21d39d7 MH |
89 | void fill_stat_data(struct stat_data *sd, struct stat *st) |
90 | { | |
91 | sd->sd_ctime.sec = (unsigned int)st->st_ctime; | |
92 | sd->sd_mtime.sec = (unsigned int)st->st_mtime; | |
93 | sd->sd_ctime.nsec = ST_CTIME_NSEC(*st); | |
94 | sd->sd_mtime.nsec = ST_MTIME_NSEC(*st); | |
95 | sd->sd_dev = st->st_dev; | |
96 | sd->sd_ino = st->st_ino; | |
97 | sd->sd_uid = st->st_uid; | |
98 | sd->sd_gid = st->st_gid; | |
99 | sd->sd_size = st->st_size; | |
100 | } | |
101 | ||
102 | int match_stat_data(const struct stat_data *sd, struct stat *st) | |
103 | { | |
104 | int changed = 0; | |
105 | ||
106 | if (sd->sd_mtime.sec != (unsigned int)st->st_mtime) | |
107 | changed |= MTIME_CHANGED; | |
108 | if (trust_ctime && check_stat && | |
109 | sd->sd_ctime.sec != (unsigned int)st->st_ctime) | |
110 | changed |= CTIME_CHANGED; | |
111 | ||
112 | #ifdef USE_NSEC | |
113 | if (check_stat && sd->sd_mtime.nsec != ST_MTIME_NSEC(*st)) | |
114 | changed |= MTIME_CHANGED; | |
115 | if (trust_ctime && check_stat && | |
116 | sd->sd_ctime.nsec != ST_CTIME_NSEC(*st)) | |
117 | changed |= CTIME_CHANGED; | |
118 | #endif | |
119 | ||
120 | if (check_stat) { | |
121 | if (sd->sd_uid != (unsigned int) st->st_uid || | |
122 | sd->sd_gid != (unsigned int) st->st_gid) | |
123 | changed |= OWNER_CHANGED; | |
124 | if (sd->sd_ino != (unsigned int) st->st_ino) | |
125 | changed |= INODE_CHANGED; | |
126 | } | |
127 | ||
128 | #ifdef USE_STDEV | |
129 | /* | |
130 | * st_dev breaks on network filesystems where different | |
131 | * clients will have different views of what "device" | |
132 | * the filesystem is on | |
133 | */ | |
134 | if (check_stat && sd->sd_dev != (unsigned int) st->st_dev) | |
135 | changed |= INODE_CHANGED; | |
136 | #endif | |
137 | ||
138 | if (sd->sd_size != (unsigned int) st->st_size) | |
139 | changed |= DATA_CHANGED; | |
140 | ||
141 | return changed; | |
142 | } | |
143 | ||
415e96c8 JH |
144 | /* |
145 | * This only updates the "non-critical" parts of the directory | |
146 | * cache, ie the parts that aren't tracked by GIT, and only used | |
147 | * to validate the cache. | |
148 | */ | |
149 | void fill_stat_cache_info(struct cache_entry *ce, struct stat *st) | |
150 | { | |
c21d39d7 | 151 | fill_stat_data(&ce->ce_stat_data, st); |
5f73076c JH |
152 | |
153 | if (assume_unchanged) | |
7a51ed66 | 154 | ce->ce_flags |= CE_VALID; |
eadb5831 | 155 | |
883e248b | 156 | if (S_ISREG(st->st_mode)) { |
eadb5831 | 157 | ce_mark_uptodate(ce); |
883e248b BP |
158 | mark_fsmonitor_valid(ce); |
159 | } | |
415e96c8 JH |
160 | } |
161 | ||
21a6b9fa | 162 | static int ce_compare_data(const struct cache_entry *ce, struct stat *st) |
29e4d363 JH |
163 | { |
164 | int match = -1; | |
1b8ac5ea | 165 | int fd = git_open_cloexec(ce->name, O_RDONLY); |
29e4d363 JH |
166 | |
167 | if (fd >= 0) { | |
bebfecb9 | 168 | struct object_id oid; |
e3506559 | 169 | if (!index_fd(&oid, fd, st, OBJ_BLOB, ce->name, 0)) |
bebfecb9 | 170 | match = oidcmp(&oid, &ce->oid); |
7f8508e8 | 171 | /* index_fd() closed the file descriptor already */ |
29e4d363 JH |
172 | } |
173 | return match; | |
174 | } | |
175 | ||
21a6b9fa | 176 | static int ce_compare_link(const struct cache_entry *ce, size_t expected_size) |
29e4d363 JH |
177 | { |
178 | int match = -1; | |
29e4d363 JH |
179 | void *buffer; |
180 | unsigned long size; | |
21666f1a | 181 | enum object_type type; |
a60272b3 | 182 | struct strbuf sb = STRBUF_INIT; |
29e4d363 | 183 | |
a60272b3 | 184 | if (strbuf_readlink(&sb, ce->name, expected_size)) |
29e4d363 | 185 | return -1; |
a60272b3 | 186 | |
99d1a986 | 187 | buffer = read_sha1_file(ce->oid.hash, &type, &size); |
a60272b3 LT |
188 | if (buffer) { |
189 | if (size == sb.len) | |
190 | match = memcmp(buffer, sb.buf, size); | |
191 | free(buffer); | |
29e4d363 | 192 | } |
a60272b3 | 193 | strbuf_release(&sb); |
29e4d363 JH |
194 | return match; |
195 | } | |
196 | ||
21a6b9fa | 197 | static int ce_compare_gitlink(const struct cache_entry *ce) |
f35a6d3b | 198 | { |
1053fe82 | 199 | struct object_id oid; |
f35a6d3b LT |
200 | |
201 | /* | |
202 | * We don't actually require that the .git directory | |
302b9282 | 203 | * under GITLINK directory be a valid git directory. It |
f35a6d3b LT |
204 | * might even be missing (in case nobody populated that |
205 | * sub-project). | |
206 | * | |
207 | * If so, we consider it always to match. | |
208 | */ | |
a98e6101 | 209 | if (resolve_gitlink_ref(ce->name, "HEAD", &oid) < 0) |
f35a6d3b | 210 | return 0; |
1053fe82 | 211 | return oidcmp(&oid, &ce->oid); |
f35a6d3b LT |
212 | } |
213 | ||
21a6b9fa | 214 | static int ce_modified_check_fs(const struct cache_entry *ce, struct stat *st) |
29e4d363 JH |
215 | { |
216 | switch (st->st_mode & S_IFMT) { | |
217 | case S_IFREG: | |
218 | if (ce_compare_data(ce, st)) | |
219 | return DATA_CHANGED; | |
220 | break; | |
221 | case S_IFLNK: | |
dc49cd76 | 222 | if (ce_compare_link(ce, xsize_t(st->st_size))) |
29e4d363 JH |
223 | return DATA_CHANGED; |
224 | break; | |
a8ee75bc | 225 | case S_IFDIR: |
7a51ed66 | 226 | if (S_ISGITLINK(ce->ce_mode)) |
c70115b4 | 227 | return ce_compare_gitlink(ce) ? DATA_CHANGED : 0; |
1cf01a34 | 228 | /* else fallthrough */ |
29e4d363 JH |
229 | default: |
230 | return TYPE_CHANGED; | |
231 | } | |
232 | return 0; | |
233 | } | |
234 | ||
21a6b9fa | 235 | static int ce_match_stat_basic(const struct cache_entry *ce, struct stat *st) |
734aab75 LT |
236 | { |
237 | unsigned int changed = 0; | |
238 | ||
7a51ed66 LT |
239 | if (ce->ce_flags & CE_REMOVE) |
240 | return MODE_CHANGED | DATA_CHANGED | TYPE_CHANGED; | |
241 | ||
242 | switch (ce->ce_mode & S_IFMT) { | |
8ae0a8c5 KS |
243 | case S_IFREG: |
244 | changed |= !S_ISREG(st->st_mode) ? TYPE_CHANGED : 0; | |
3e09cdfd JH |
245 | /* We consider only the owner x bit to be relevant for |
246 | * "mode changes" | |
247 | */ | |
248 | if (trust_executable_bit && | |
7a51ed66 | 249 | (0100 & (ce->ce_mode ^ st->st_mode))) |
ffbe1add | 250 | changed |= MODE_CHANGED; |
8ae0a8c5 KS |
251 | break; |
252 | case S_IFLNK: | |
78a8d641 JS |
253 | if (!S_ISLNK(st->st_mode) && |
254 | (has_symlinks || !S_ISREG(st->st_mode))) | |
255 | changed |= TYPE_CHANGED; | |
8ae0a8c5 | 256 | break; |
302b9282 | 257 | case S_IFGITLINK: |
c70115b4 | 258 | /* We ignore most of the st_xxx fields for gitlinks */ |
f35a6d3b LT |
259 | if (!S_ISDIR(st->st_mode)) |
260 | changed |= TYPE_CHANGED; | |
261 | else if (ce_compare_gitlink(ce)) | |
262 | changed |= DATA_CHANGED; | |
a8ee75bc | 263 | return changed; |
8ae0a8c5 | 264 | default: |
7a51ed66 | 265 | die("internal error: ce_mode is %o", ce->ce_mode); |
8ae0a8c5 | 266 | } |
2cb45e95 | 267 | |
c21d39d7 | 268 | changed |= match_stat_data(&ce->ce_stat_data, st); |
b0391890 | 269 | |
f49c2c22 | 270 | /* Racily smudged entry? */ |
c21d39d7 | 271 | if (!ce->ce_stat_data.sd_size) { |
99d1a986 | 272 | if (!is_empty_blob_sha1(ce->oid.hash)) |
f49c2c22 LT |
273 | changed |= DATA_CHANGED; |
274 | } | |
275 | ||
407c8eb0 JH |
276 | return changed; |
277 | } | |
278 | ||
2bb4cda1 NTND |
279 | static int is_racy_stat(const struct index_state *istate, |
280 | const struct stat_data *sd) | |
6d91da6d | 281 | { |
2bb4cda1 | 282 | return (istate->timestamp.sec && |
fba2f38a KB |
283 | #ifdef USE_NSEC |
284 | /* nanosecond timestamped files can also be racy! */ | |
2bb4cda1 NTND |
285 | (istate->timestamp.sec < sd->sd_mtime.sec || |
286 | (istate->timestamp.sec == sd->sd_mtime.sec && | |
287 | istate->timestamp.nsec <= sd->sd_mtime.nsec)) | |
fba2f38a | 288 | #else |
2bb4cda1 | 289 | istate->timestamp.sec <= sd->sd_mtime.sec |
fba2f38a | 290 | #endif |
2bb4cda1 NTND |
291 | ); |
292 | } | |
293 | ||
294 | static int is_racy_timestamp(const struct index_state *istate, | |
295 | const struct cache_entry *ce) | |
296 | { | |
297 | return (!S_ISGITLINK(ce->ce_mode) && | |
298 | is_racy_stat(istate, &ce->ce_stat_data)); | |
6d91da6d JH |
299 | } |
300 | ||
ed4efab1 NTND |
301 | int match_stat_data_racy(const struct index_state *istate, |
302 | const struct stat_data *sd, struct stat *st) | |
303 | { | |
304 | if (is_racy_stat(istate, sd)) | |
305 | return MTIME_CHANGED; | |
306 | return match_stat_data(sd, st); | |
6d91da6d JH |
307 | } |
308 | ||
883e248b | 309 | int ie_match_stat(struct index_state *istate, |
21a6b9fa | 310 | const struct cache_entry *ce, struct stat *st, |
4bd5b7da | 311 | unsigned int options) |
407c8eb0 | 312 | { |
5f73076c | 313 | unsigned int changed; |
4bd5b7da | 314 | int ignore_valid = options & CE_MATCH_IGNORE_VALID; |
56cac48c | 315 | int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE; |
4bd5b7da | 316 | int assume_racy_is_modified = options & CE_MATCH_RACY_IS_DIRTY; |
883e248b | 317 | int ignore_fsmonitor = options & CE_MATCH_IGNORE_FSMONITOR; |
5f73076c | 318 | |
883e248b BP |
319 | if (!ignore_fsmonitor) |
320 | refresh_fsmonitor(istate); | |
5f73076c JH |
321 | /* |
322 | * If it's marked as always valid in the index, it's | |
323 | * valid whatever the checked-out copy says. | |
56cac48c NTND |
324 | * |
325 | * skip-worktree has the same effect with higher precedence | |
5f73076c | 326 | */ |
56cac48c NTND |
327 | if (!ignore_skip_worktree && ce_skip_worktree(ce)) |
328 | return 0; | |
7a51ed66 | 329 | if (!ignore_valid && (ce->ce_flags & CE_VALID)) |
5f73076c | 330 | return 0; |
883e248b BP |
331 | if (!ignore_fsmonitor && (ce->ce_flags & CE_FSMONITOR_VALID)) |
332 | return 0; | |
5f73076c | 333 | |
331fcb59 JH |
334 | /* |
335 | * Intent-to-add entries have not been added, so the index entry | |
336 | * by definition never matches what is in the work tree until it | |
337 | * actually gets added. | |
338 | */ | |
895ff3b2 | 339 | if (ce_intent_to_add(ce)) |
331fcb59 JH |
340 | return DATA_CHANGED | TYPE_CHANGED | MODE_CHANGED; |
341 | ||
5f73076c | 342 | changed = ce_match_stat_basic(ce, st); |
407c8eb0 | 343 | |
29e4d363 JH |
344 | /* |
345 | * Within 1 second of this sequence: | |
346 | * echo xyzzy >file && git-update-index --add file | |
347 | * running this command: | |
348 | * echo frotz >file | |
349 | * would give a falsely clean cache entry. The mtime and | |
350 | * length match the cache, and other stat fields do not change. | |
351 | * | |
352 | * We could detect this at update-index time (the cache entry | |
353 | * being registered/updated records the same time as "now") | |
354 | * and delay the return from git-update-index, but that would | |
355 | * effectively mean we can make at most one commit per second, | |
356 | * which is not acceptable. Instead, we check cache entries | |
357 | * whose mtime are the same as the index file timestamp more | |
5f73076c | 358 | * carefully than others. |
29e4d363 | 359 | */ |
6d91da6d | 360 | if (!changed && is_racy_timestamp(istate, ce)) { |
42f77406 JH |
361 | if (assume_racy_is_modified) |
362 | changed |= DATA_CHANGED; | |
363 | else | |
364 | changed |= ce_modified_check_fs(ce, st); | |
365 | } | |
b0391890 | 366 | |
29e4d363 | 367 | return changed; |
b0391890 JH |
368 | } |
369 | ||
883e248b | 370 | int ie_modified(struct index_state *istate, |
21a6b9fa RS |
371 | const struct cache_entry *ce, |
372 | struct stat *st, unsigned int options) | |
b0391890 | 373 | { |
29e4d363 | 374 | int changed, changed_fs; |
4bd5b7da JH |
375 | |
376 | changed = ie_match_stat(istate, ce, st, options); | |
b0391890 JH |
377 | if (!changed) |
378 | return 0; | |
b0391890 JH |
379 | /* |
380 | * If the mode or type has changed, there's no point in trying | |
381 | * to refresh the entry - it's not going to match | |
382 | */ | |
383 | if (changed & (MODE_CHANGED | TYPE_CHANGED)) | |
384 | return changed; | |
385 | ||
c70115b4 JH |
386 | /* |
387 | * Immediately after read-tree or update-index --cacheinfo, | |
388 | * the length field is zero, as we have never even read the | |
389 | * lstat(2) information once, and we cannot trust DATA_CHANGED | |
390 | * returned by ie_match_stat() which in turn was returned by | |
391 | * ce_match_stat_basic() to signal that the filesize of the | |
392 | * blob changed. We have to actually go to the filesystem to | |
393 | * see if the contents match, and if so, should answer "unchanged". | |
394 | * | |
395 | * The logic does not apply to gitlinks, as ce_match_stat_basic() | |
396 | * already has checked the actual HEAD from the filesystem in the | |
397 | * subproject. If ie_match_stat() already said it is different, | |
398 | * then we know it is. | |
b0391890 | 399 | */ |
c70115b4 | 400 | if ((changed & DATA_CHANGED) && |
c21d39d7 | 401 | (S_ISGITLINK(ce->ce_mode) || ce->ce_stat_data.sd_size != 0)) |
b0391890 JH |
402 | return changed; |
403 | ||
29e4d363 JH |
404 | changed_fs = ce_modified_check_fs(ce, st); |
405 | if (changed_fs) | |
406 | return changed | changed_fs; | |
b0391890 JH |
407 | return 0; |
408 | } | |
409 | ||
958ba6c9 LT |
410 | int base_name_compare(const char *name1, int len1, int mode1, |
411 | const char *name2, int len2, int mode2) | |
412 | { | |
413 | unsigned char c1, c2; | |
414 | int len = len1 < len2 ? len1 : len2; | |
415 | int cmp; | |
416 | ||
417 | cmp = memcmp(name1, name2, len); | |
418 | if (cmp) | |
419 | return cmp; | |
420 | c1 = name1[len]; | |
421 | c2 = name2[len]; | |
1833a925 | 422 | if (!c1 && S_ISDIR(mode1)) |
958ba6c9 | 423 | c1 = '/'; |
1833a925 | 424 | if (!c2 && S_ISDIR(mode2)) |
958ba6c9 LT |
425 | c2 = '/'; |
426 | return (c1 < c2) ? -1 : (c1 > c2) ? 1 : 0; | |
427 | } | |
428 | ||
0ab9e1e8 LT |
429 | /* |
430 | * df_name_compare() is identical to base_name_compare(), except it | |
431 | * compares conflicting directory/file entries as equal. Note that | |
432 | * while a directory name compares as equal to a regular file, they | |
433 | * then individually compare _differently_ to a filename that has | |
434 | * a dot after the basename (because '\0' < '.' < '/'). | |
435 | * | |
436 | * This is used by routines that want to traverse the git namespace | |
437 | * but then handle conflicting entries together when possible. | |
438 | */ | |
439 | int df_name_compare(const char *name1, int len1, int mode1, | |
440 | const char *name2, int len2, int mode2) | |
441 | { | |
442 | int len = len1 < len2 ? len1 : len2, cmp; | |
443 | unsigned char c1, c2; | |
444 | ||
445 | cmp = memcmp(name1, name2, len); | |
446 | if (cmp) | |
447 | return cmp; | |
448 | /* Directories and files compare equal (same length, same name) */ | |
449 | if (len1 == len2) | |
450 | return 0; | |
451 | c1 = name1[len]; | |
452 | if (!c1 && S_ISDIR(mode1)) | |
453 | c1 = '/'; | |
454 | c2 = name2[len]; | |
455 | if (!c2 && S_ISDIR(mode2)) | |
456 | c2 = '/'; | |
457 | if (c1 == '/' && !c2) | |
458 | return 0; | |
459 | if (c2 == '/' && !c1) | |
460 | return 0; | |
461 | return c1 - c2; | |
462 | } | |
463 | ||
ccdd4a0f | 464 | int name_compare(const char *name1, size_t len1, const char *name2, size_t len2) |
eb38c22f | 465 | { |
ccdd4a0f JM |
466 | size_t min_len = (len1 < len2) ? len1 : len2; |
467 | int cmp = memcmp(name1, name2, min_len); | |
eb38c22f LT |
468 | if (cmp) |
469 | return cmp; | |
470 | if (len1 < len2) | |
471 | return -1; | |
472 | if (len1 > len2) | |
473 | return 1; | |
ccdd4a0f JM |
474 | return 0; |
475 | } | |
476 | ||
477 | int cache_name_stage_compare(const char *name1, int len1, int stage1, const char *name2, int len2, int stage2) | |
478 | { | |
479 | int cmp; | |
480 | ||
481 | cmp = name_compare(name1, len1, name2, len2); | |
482 | if (cmp) | |
483 | return cmp; | |
5f73076c | 484 | |
b60e188c | 485 | if (stage1 < stage2) |
95fd5bf8 | 486 | return -1; |
b60e188c | 487 | if (stage1 > stage2) |
95fd5bf8 | 488 | return 1; |
eb38c22f LT |
489 | return 0; |
490 | } | |
491 | ||
357e9c69 | 492 | static int index_name_stage_pos(const struct index_state *istate, const char *name, int namelen, int stage) |
eb38c22f LT |
493 | { |
494 | int first, last; | |
495 | ||
496 | first = 0; | |
4aab5b46 | 497 | last = istate->cache_nr; |
eb38c22f LT |
498 | while (last > first) { |
499 | int next = (last + first) >> 1; | |
4aab5b46 | 500 | struct cache_entry *ce = istate->cache[next]; |
b60e188c | 501 | int cmp = cache_name_stage_compare(name, namelen, stage, ce->name, ce_namelen(ce), ce_stage(ce)); |
eb38c22f | 502 | if (!cmp) |
76e7f4ec | 503 | return next; |
eb38c22f LT |
504 | if (cmp < 0) { |
505 | last = next; | |
506 | continue; | |
507 | } | |
508 | first = next+1; | |
509 | } | |
76e7f4ec | 510 | return -first-1; |
eb38c22f LT |
511 | } |
512 | ||
b60e188c TG |
513 | int index_name_pos(const struct index_state *istate, const char *name, int namelen) |
514 | { | |
515 | return index_name_stage_pos(istate, name, namelen, 0); | |
516 | } | |
517 | ||
4aab5b46 | 518 | int remove_index_entry_at(struct index_state *istate, int pos) |
7b937ca3 | 519 | { |
cf558704 LT |
520 | struct cache_entry *ce = istate->cache[pos]; |
521 | ||
cfc5789a | 522 | record_resolve_undo(istate, ce); |
2092678c | 523 | remove_name_hash(istate, ce); |
045113a5 | 524 | save_or_free_index_entry(istate, ce); |
e636a7b4 | 525 | istate->cache_changed |= CE_ENTRY_REMOVED; |
4aab5b46 JH |
526 | istate->cache_nr--; |
527 | if (pos >= istate->cache_nr) | |
7b937ca3 | 528 | return 0; |
f331ab9d RS |
529 | MOVE_ARRAY(istate->cache + pos, istate->cache + pos + 1, |
530 | istate->cache_nr - pos); | |
7b937ca3 LT |
531 | return 1; |
532 | } | |
533 | ||
36419c8e | 534 | /* |
98e023de | 535 | * Remove all cache entries marked for removal, that is where |
36419c8e KB |
536 | * CE_REMOVE is set in ce_flags. This is much more effective than |
537 | * calling remove_index_entry_at() for each entry to be removed. | |
538 | */ | |
539 | void remove_marked_cache_entries(struct index_state *istate) | |
540 | { | |
541 | struct cache_entry **ce_array = istate->cache; | |
542 | unsigned int i, j; | |
543 | ||
544 | for (i = j = 0; i < istate->cache_nr; i++) { | |
5699d17e | 545 | if (ce_array[i]->ce_flags & CE_REMOVE) { |
2092678c | 546 | remove_name_hash(istate, ce_array[i]); |
045113a5 | 547 | save_or_free_index_entry(istate, ce_array[i]); |
5699d17e | 548 | } |
36419c8e KB |
549 | else |
550 | ce_array[j++] = ce_array[i]; | |
551 | } | |
ad837d9e NTND |
552 | if (j == istate->cache_nr) |
553 | return; | |
e636a7b4 | 554 | istate->cache_changed |= CE_ENTRY_REMOVED; |
36419c8e KB |
555 | istate->cache_nr = j; |
556 | } | |
557 | ||
4aab5b46 | 558 | int remove_file_from_index(struct index_state *istate, const char *path) |
197ee8c9 | 559 | { |
4aab5b46 | 560 | int pos = index_name_pos(istate, path, strlen(path)); |
c4e3cca1 JH |
561 | if (pos < 0) |
562 | pos = -pos-1; | |
a5400efe | 563 | cache_tree_invalidate_path(istate, path); |
e931371a | 564 | untracked_cache_remove_from_index(istate, path); |
4aab5b46 JH |
565 | while (pos < istate->cache_nr && !strcmp(istate->cache[pos]->name, path)) |
566 | remove_index_entry_at(istate, pos); | |
197ee8c9 LT |
567 | return 0; |
568 | } | |
569 | ||
20314271 JS |
570 | static int compare_name(struct cache_entry *ce, const char *path, int namelen) |
571 | { | |
572 | return namelen != ce_namelen(ce) || memcmp(path, ce->name, namelen); | |
573 | } | |
574 | ||
575 | static int index_name_pos_also_unmerged(struct index_state *istate, | |
576 | const char *path, int namelen) | |
577 | { | |
578 | int pos = index_name_pos(istate, path, namelen); | |
579 | struct cache_entry *ce; | |
580 | ||
581 | if (pos >= 0) | |
582 | return pos; | |
583 | ||
584 | /* maybe unmerged? */ | |
585 | pos = -1 - pos; | |
586 | if (pos >= istate->cache_nr || | |
587 | compare_name((ce = istate->cache[pos]), path, namelen)) | |
588 | return -1; | |
589 | ||
590 | /* order of preference: stage 2, 1, 3 */ | |
591 | if (ce_stage(ce) == 1 && pos + 1 < istate->cache_nr && | |
592 | ce_stage((ce = istate->cache[pos + 1])) == 2 && | |
593 | !compare_name(ce, path, namelen)) | |
594 | pos++; | |
595 | return pos; | |
596 | } | |
597 | ||
1102952b LT |
598 | static int different_name(struct cache_entry *ce, struct cache_entry *alias) |
599 | { | |
600 | int len = ce_namelen(ce); | |
601 | return ce_namelen(alias) != len || memcmp(ce->name, alias->name, len); | |
602 | } | |
603 | ||
604 | /* | |
605 | * If we add a filename that aliases in the cache, we will use the | |
606 | * name that we already have - but we don't want to update the same | |
607 | * alias twice, because that implies that there were actually two | |
608 | * different files with aliasing names! | |
609 | * | |
610 | * So we use the CE_ADDED flag to verify that the alias was an old | |
611 | * one before we accept it as | |
612 | */ | |
045113a5 NTND |
613 | static struct cache_entry *create_alias_ce(struct index_state *istate, |
614 | struct cache_entry *ce, | |
615 | struct cache_entry *alias) | |
1102952b LT |
616 | { |
617 | int len; | |
618 | struct cache_entry *new; | |
619 | ||
620 | if (alias->ce_flags & CE_ADDED) | |
621 | die("Will not add file alias '%s' ('%s' already exists in index)", ce->name, alias->name); | |
622 | ||
623 | /* Ok, create the new entry using the name of the existing alias */ | |
624 | len = ce_namelen(alias); | |
625 | new = xcalloc(1, cache_entry_size(len)); | |
626 | memcpy(new->name, alias->name, len); | |
627 | copy_cache_entry(new, ce); | |
045113a5 | 628 | save_or_free_index_entry(istate, ce); |
1102952b LT |
629 | return new; |
630 | } | |
631 | ||
b4b313f9 | 632 | void set_object_name_for_intent_to_add_entry(struct cache_entry *ce) |
39425819 JH |
633 | { |
634 | unsigned char sha1[20]; | |
635 | if (write_sha1_file("", 0, blob_type, sha1)) | |
636 | die("cannot create an empty blob in the object database"); | |
99d1a986 | 637 | hashcpy(ce->oid.hash, sha1); |
39425819 JH |
638 | } |
639 | ||
610d55af | 640 | int add_to_index(struct index_state *istate, const char *path, struct stat *st, int flags) |
11be42a4 | 641 | { |
38ed1d89 | 642 | int size, namelen, was_same; |
d177cab0 | 643 | mode_t st_mode = st->st_mode; |
9472935d | 644 | struct cache_entry *ce, *alias = NULL; |
56cac48c | 645 | unsigned ce_option = CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE|CE_MATCH_RACY_IS_DIRTY; |
38ed1d89 JH |
646 | int verbose = flags & (ADD_CACHE_VERBOSE | ADD_CACHE_PRETEND); |
647 | int pretend = flags & ADD_CACHE_PRETEND; | |
39425819 JH |
648 | int intent_only = flags & ADD_CACHE_INTENT; |
649 | int add_option = (ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE| | |
650 | (intent_only ? ADD_CACHE_NEW_ONLY : 0)); | |
9472935d TB |
651 | int newflags = HASH_WRITE_OBJECT; |
652 | ||
653 | if (flags & HASH_RENORMALIZE) | |
654 | newflags |= HASH_RENORMALIZE; | |
11be42a4 | 655 | |
d177cab0 | 656 | if (!S_ISREG(st_mode) && !S_ISLNK(st_mode) && !S_ISDIR(st_mode)) |
960b8ad1 | 657 | return error("%s: can only add regular files, symbolic links or git-directories", path); |
11be42a4 JS |
658 | |
659 | namelen = strlen(path); | |
d177cab0 | 660 | if (S_ISDIR(st_mode)) { |
09595258 LT |
661 | while (namelen && path[namelen-1] == '/') |
662 | namelen--; | |
663 | } | |
11be42a4 JS |
664 | size = cache_entry_size(namelen); |
665 | ce = xcalloc(1, size); | |
666 | memcpy(ce->name, path, namelen); | |
b60e188c | 667 | ce->ce_namelen = namelen; |
39425819 JH |
668 | if (!intent_only) |
669 | fill_stat_cache_info(ce, st); | |
388b2acd JH |
670 | else |
671 | ce->ce_flags |= CE_INTENT_TO_ADD; | |
11be42a4 | 672 | |
610d55af TG |
673 | |
674 | if (trust_executable_bit && has_symlinks) { | |
d177cab0 | 675 | ce->ce_mode = create_ce_mode(st_mode); |
610d55af | 676 | } else { |
78a8d641 JS |
677 | /* If there is an existing entry, pick the mode bits and type |
678 | * from it, otherwise assume unexecutable regular file. | |
11be42a4 | 679 | */ |
185c975f | 680 | struct cache_entry *ent; |
20314271 | 681 | int pos = index_name_pos_also_unmerged(istate, path, namelen); |
185c975f | 682 | |
4aab5b46 | 683 | ent = (0 <= pos) ? istate->cache[pos] : NULL; |
d177cab0 | 684 | ce->ce_mode = ce_mode_from_stat(ent, st_mode); |
11be42a4 JS |
685 | } |
686 | ||
dc1ae704 JJ |
687 | /* When core.ignorecase=true, determine if a directory of the same name but differing |
688 | * case already exists within the Git repository. If it does, ensure the directory | |
689 | * case of the file being added to the repository matches (is folded into) the existing | |
690 | * entry's directory case. | |
691 | */ | |
692 | if (ignore_case) { | |
41284eb0 | 693 | adjust_dirname_case(istate, ce->name); |
dc1ae704 | 694 | } |
9472935d TB |
695 | if (!(flags & HASH_RENORMALIZE)) { |
696 | alias = index_file_exists(istate, ce->name, | |
697 | ce_namelen(ce), ignore_case); | |
698 | if (alias && | |
699 | !ce_stage(alias) && | |
700 | !ie_match_stat(istate, alias, st, ce_option)) { | |
701 | /* Nothing changed, really */ | |
702 | if (!S_ISGITLINK(alias->ce_mode)) | |
703 | ce_mark_uptodate(alias); | |
704 | alias->ce_flags |= CE_ADDED; | |
dc1ae704 | 705 | |
9472935d TB |
706 | free(ce); |
707 | return 0; | |
708 | } | |
0781b8a9 | 709 | } |
39425819 | 710 | if (!intent_only) { |
9472935d | 711 | if (index_path(&ce->oid, path, st, newflags)) { |
2d9426b0 | 712 | free(ce); |
39425819 | 713 | return error("unable to index file %s", path); |
2d9426b0 | 714 | } |
39425819 | 715 | } else |
b4b313f9 | 716 | set_object_name_for_intent_to_add_entry(ce); |
39425819 | 717 | |
1102952b | 718 | if (ignore_case && alias && different_name(ce, alias)) |
045113a5 | 719 | ce = create_alias_ce(istate, ce, alias); |
1102952b | 720 | ce->ce_flags |= CE_ADDED; |
38ed1d89 | 721 | |
3bf0dd1f | 722 | /* It was suspected to be racily clean, but it turns out to be Ok */ |
38ed1d89 JH |
723 | was_same = (alias && |
724 | !ce_stage(alias) && | |
99d1a986 | 725 | !oidcmp(&alias->oid, &ce->oid) && |
38ed1d89 JH |
726 | ce->ce_mode == alias->ce_mode); |
727 | ||
728 | if (pretend) | |
067178ed JH |
729 | free(ce); |
730 | else if (add_index_entry(istate, ce, add_option)) { | |
731 | free(ce); | |
732 | return error("unable to add %s to index", path); | |
733 | } | |
38ed1d89 | 734 | if (verbose && !was_same) |
11be42a4 | 735 | printf("add '%s'\n", path); |
11be42a4 JS |
736 | return 0; |
737 | } | |
738 | ||
610d55af | 739 | int add_file_to_index(struct index_state *istate, const char *path, int flags) |
d177cab0 LT |
740 | { |
741 | struct stat st; | |
742 | if (lstat(path, &st)) | |
d824cbba | 743 | die_errno("unable to stat '%s'", path); |
610d55af | 744 | return add_to_index(istate, path, &st, flags); |
d177cab0 LT |
745 | } |
746 | ||
6640f881 CR |
747 | struct cache_entry *make_cache_entry(unsigned int mode, |
748 | const unsigned char *sha1, const char *path, int stage, | |
25762726 | 749 | unsigned int refresh_options) |
6640f881 CR |
750 | { |
751 | int size, len; | |
bc1c2caa | 752 | struct cache_entry *ce, *ret; |
6640f881 | 753 | |
7e7abea9 DP |
754 | if (!verify_path(path)) { |
755 | error("Invalid path '%s'", path); | |
6640f881 | 756 | return NULL; |
7e7abea9 | 757 | } |
6640f881 CR |
758 | |
759 | len = strlen(path); | |
760 | size = cache_entry_size(len); | |
761 | ce = xcalloc(1, size); | |
762 | ||
99d1a986 | 763 | hashcpy(ce->oid.hash, sha1); |
6640f881 | 764 | memcpy(ce->name, path, len); |
b60e188c TG |
765 | ce->ce_flags = create_ce_flags(stage); |
766 | ce->ce_namelen = len; | |
6640f881 CR |
767 | ce->ce_mode = create_ce_mode(mode); |
768 | ||
bc1c2caa | 769 | ret = refresh_cache_entry(ce, refresh_options); |
915e44c6 | 770 | if (ret != ce) |
bc1c2caa | 771 | free(ce); |
915e44c6 | 772 | return ret; |
6640f881 CR |
773 | } |
774 | ||
d9d70966 TG |
775 | /* |
776 | * Chmod an index entry with either +x or -x. | |
777 | * | |
778 | * Returns -1 if the chmod for the particular cache entry failed (if it's | |
779 | * not a regular file), -2 if an invalid flip argument is passed in, 0 | |
780 | * otherwise. | |
781 | */ | |
782 | int chmod_index_entry(struct index_state *istate, struct cache_entry *ce, | |
783 | char flip) | |
784 | { | |
785 | if (!S_ISREG(ce->ce_mode)) | |
786 | return -1; | |
787 | switch (flip) { | |
788 | case '+': | |
789 | ce->ce_mode |= 0111; | |
790 | break; | |
791 | case '-': | |
792 | ce->ce_mode &= ~0111; | |
793 | break; | |
794 | default: | |
795 | return -2; | |
796 | } | |
797 | cache_tree_invalidate_path(istate, ce->name); | |
798 | ce->ce_flags |= CE_UPDATE_IN_BASE; | |
883e248b | 799 | mark_fsmonitor_invalid(istate, ce); |
d9d70966 TG |
800 | istate->cache_changed |= CE_ENTRY_CHANGED; |
801 | ||
802 | return 0; | |
803 | } | |
804 | ||
9c5e6c80 | 805 | int ce_same_name(const struct cache_entry *a, const struct cache_entry *b) |
7b937ca3 LT |
806 | { |
807 | int len = ce_namelen(a); | |
808 | return ce_namelen(b) == len && !memcmp(a->name, b->name, len); | |
809 | } | |
810 | ||
8dcf39c4 LT |
811 | /* |
812 | * We fundamentally don't like some paths: we don't want | |
813 | * dot or dot-dot anywhere, and for obvious reasons don't | |
814 | * want to recurse into ".git" either. | |
815 | * | |
816 | * Also, we don't want double slashes or slashes at the | |
817 | * end that can make pathnames ambiguous. | |
818 | */ | |
819 | static int verify_dotfile(const char *rest) | |
820 | { | |
821 | /* | |
822 | * The first character was '.', but that | |
823 | * has already been discarded, we now test | |
824 | * the rest. | |
825 | */ | |
e0f530ff | 826 | |
8dcf39c4 | 827 | /* "." is not allowed */ |
e0f530ff | 828 | if (*rest == '\0' || is_dir_sep(*rest)) |
8dcf39c4 LT |
829 | return 0; |
830 | ||
e0f530ff | 831 | switch (*rest) { |
8dcf39c4 LT |
832 | /* |
833 | * ".git" followed by NUL or slash is bad. This | |
834 | * shares the path end test with the ".." case. | |
835 | */ | |
836 | case 'g': | |
cc2fc7c2 JK |
837 | case 'G': |
838 | if (rest[1] != 'i' && rest[1] != 'I') | |
8dcf39c4 | 839 | break; |
cc2fc7c2 | 840 | if (rest[2] != 't' && rest[2] != 'T') |
8dcf39c4 LT |
841 | break; |
842 | rest += 2; | |
843 | /* fallthrough */ | |
844 | case '.': | |
e0f530ff | 845 | if (rest[1] == '\0' || is_dir_sep(rest[1])) |
8dcf39c4 LT |
846 | return 0; |
847 | } | |
848 | return 1; | |
849 | } | |
850 | ||
851 | int verify_path(const char *path) | |
852 | { | |
853 | char c; | |
854 | ||
56948cb6 EFL |
855 | if (has_dos_drive_prefix(path)) |
856 | return 0; | |
857 | ||
8dcf39c4 LT |
858 | goto inside; |
859 | for (;;) { | |
860 | if (!c) | |
861 | return 1; | |
56948cb6 | 862 | if (is_dir_sep(c)) { |
8dcf39c4 | 863 | inside: |
a42643aa JK |
864 | if (protect_hfs && is_hfs_dotgit(path)) |
865 | return 0; | |
2b4c6efc JS |
866 | if (protect_ntfs && is_ntfs_dotgit(path)) |
867 | return 0; | |
8dcf39c4 | 868 | c = *path++; |
3bdf09c7 JH |
869 | if ((c == '.' && !verify_dotfile(path)) || |
870 | is_dir_sep(c) || c == '\0') | |
871 | return 0; | |
8dcf39c4 LT |
872 | } |
873 | c = *path++; | |
874 | } | |
875 | } | |
876 | ||
12676608 LT |
877 | /* |
878 | * Do we have another file that has the beginning components being a | |
879 | * proper superset of the name we're trying to add? | |
0f1e4f04 | 880 | */ |
4aab5b46 JH |
881 | static int has_file_name(struct index_state *istate, |
882 | const struct cache_entry *ce, int pos, int ok_to_replace) | |
0f1e4f04 | 883 | { |
12676608 LT |
884 | int retval = 0; |
885 | int len = ce_namelen(ce); | |
b155725d | 886 | int stage = ce_stage(ce); |
12676608 | 887 | const char *name = ce->name; |
0f1e4f04 | 888 | |
4aab5b46 JH |
889 | while (pos < istate->cache_nr) { |
890 | struct cache_entry *p = istate->cache[pos++]; | |
0f1e4f04 | 891 | |
12676608 | 892 | if (len >= ce_namelen(p)) |
0f1e4f04 | 893 | break; |
12676608 LT |
894 | if (memcmp(name, p->name, len)) |
895 | break; | |
b155725d JH |
896 | if (ce_stage(p) != stage) |
897 | continue; | |
12676608 LT |
898 | if (p->name[len] != '/') |
899 | continue; | |
7a51ed66 | 900 | if (p->ce_flags & CE_REMOVE) |
21cd8d00 | 901 | continue; |
12676608 LT |
902 | retval = -1; |
903 | if (!ok_to_replace) | |
904 | break; | |
4aab5b46 | 905 | remove_index_entry_at(istate, --pos); |
0f1e4f04 | 906 | } |
12676608 LT |
907 | return retval; |
908 | } | |
0f1e4f04 | 909 | |
a6db3fbb JH |
910 | |
911 | /* | |
912 | * Like strcmp(), but also return the offset of the first change. | |
913 | * If strings are equal, return the length. | |
914 | */ | |
915 | int strcmp_offset(const char *s1, const char *s2, size_t *first_change) | |
916 | { | |
917 | size_t k; | |
918 | ||
919 | if (!first_change) | |
920 | return strcmp(s1, s2); | |
921 | ||
922 | for (k = 0; s1[k] == s2[k]; k++) | |
923 | if (s1[k] == '\0') | |
924 | break; | |
925 | ||
926 | *first_change = k; | |
927 | return (unsigned char)s1[k] - (unsigned char)s2[k]; | |
928 | } | |
929 | ||
12676608 LT |
930 | /* |
931 | * Do we have another file with a pathname that is a proper | |
932 | * subset of the name we're trying to add? | |
06b6d81b JH |
933 | * |
934 | * That is, is there another file in the index with a path | |
935 | * that matches a sub-directory in the given entry? | |
12676608 | 936 | */ |
4aab5b46 JH |
937 | static int has_dir_name(struct index_state *istate, |
938 | const struct cache_entry *ce, int pos, int ok_to_replace) | |
12676608 LT |
939 | { |
940 | int retval = 0; | |
b155725d | 941 | int stage = ce_stage(ce); |
12676608 LT |
942 | const char *name = ce->name; |
943 | const char *slash = name + ce_namelen(ce); | |
06b6d81b JH |
944 | size_t len_eq_last; |
945 | int cmp_last = 0; | |
946 | ||
947 | /* | |
948 | * We are frequently called during an iteration on a sorted | |
949 | * list of pathnames and while building a new index. Therefore, | |
950 | * there is a high probability that this entry will eventually | |
951 | * be appended to the index, rather than inserted in the middle. | |
952 | * If we can confirm that, we can avoid binary searches on the | |
953 | * components of the pathname. | |
954 | * | |
955 | * Compare the entry's full path with the last path in the index. | |
956 | */ | |
957 | if (istate->cache_nr > 0) { | |
958 | cmp_last = strcmp_offset(name, | |
959 | istate->cache[istate->cache_nr - 1]->name, | |
960 | &len_eq_last); | |
961 | if (cmp_last > 0) { | |
962 | if (len_eq_last == 0) { | |
963 | /* | |
964 | * The entry sorts AFTER the last one in the | |
965 | * index and their paths have no common prefix, | |
966 | * so there cannot be a F/D conflict. | |
967 | */ | |
968 | return retval; | |
969 | } else { | |
970 | /* | |
971 | * The entry sorts AFTER the last one in the | |
972 | * index, but has a common prefix. Fall through | |
973 | * to the loop below to disect the entry's path | |
974 | * and see where the difference is. | |
975 | */ | |
976 | } | |
977 | } else if (cmp_last == 0) { | |
978 | /* | |
979 | * The entry exactly matches the last one in the | |
980 | * index, but because of multiple stage and CE_REMOVE | |
981 | * items, we fall through and let the regular search | |
982 | * code handle it. | |
983 | */ | |
984 | } | |
985 | } | |
0f1e4f04 | 986 | |
12676608 | 987 | for (;;) { |
b986df5c | 988 | size_t len; |
0f1e4f04 | 989 | |
12676608 LT |
990 | for (;;) { |
991 | if (*--slash == '/') | |
992 | break; | |
993 | if (slash <= ce->name) | |
994 | return retval; | |
995 | } | |
996 | len = slash - name; | |
0f1e4f04 | 997 | |
b986df5c JH |
998 | if (cmp_last > 0) { |
999 | /* | |
1000 | * (len + 1) is a directory boundary (including | |
1001 | * the trailing slash). And since the loop is | |
1002 | * decrementing "slash", the first iteration is | |
1003 | * the longest directory prefix; subsequent | |
1004 | * iterations consider parent directories. | |
1005 | */ | |
1006 | ||
1007 | if (len + 1 <= len_eq_last) { | |
1008 | /* | |
1009 | * The directory prefix (including the trailing | |
1010 | * slash) also appears as a prefix in the last | |
1011 | * entry, so the remainder cannot collide (because | |
1012 | * strcmp said the whole path was greater). | |
1013 | * | |
1014 | * EQ: last: xxx/A | |
1015 | * this: xxx/B | |
1016 | * | |
1017 | * LT: last: xxx/file_A | |
1018 | * this: xxx/file_B | |
1019 | */ | |
1020 | return retval; | |
1021 | } | |
1022 | ||
1023 | if (len > len_eq_last) { | |
1024 | /* | |
1025 | * This part of the directory prefix (excluding | |
1026 | * the trailing slash) is longer than the known | |
1027 | * equal portions, so this sub-directory cannot | |
1028 | * collide with a file. | |
1029 | * | |
1030 | * GT: last: xxxA | |
1031 | * this: xxxB/file | |
1032 | */ | |
1033 | return retval; | |
1034 | } | |
1035 | ||
1036 | if (istate->cache_nr > 0 && | |
1037 | ce_namelen(istate->cache[istate->cache_nr - 1]) > len) { | |
1038 | /* | |
1039 | * The directory prefix lines up with part of | |
1040 | * a longer file or directory name, but sorts | |
1041 | * after it, so this sub-directory cannot | |
1042 | * collide with a file. | |
1043 | * | |
1044 | * last: xxx/yy-file (because '-' sorts before '/') | |
1045 | * this: xxx/yy/abc | |
1046 | */ | |
1047 | return retval; | |
1048 | } | |
1049 | ||
1050 | /* | |
1051 | * This is a possible collision. Fall through and | |
1052 | * let the regular search code handle it. | |
1053 | * | |
1054 | * last: xxx | |
1055 | * this: xxx/file | |
1056 | */ | |
1057 | } | |
1058 | ||
b60e188c | 1059 | pos = index_name_stage_pos(istate, name, len, stage); |
12676608 | 1060 | if (pos >= 0) { |
21cd8d00 JH |
1061 | /* |
1062 | * Found one, but not so fast. This could | |
1063 | * be a marker that says "I was here, but | |
1064 | * I am being removed". Such an entry is | |
1065 | * not a part of the resulting tree, and | |
1066 | * it is Ok to have a directory at the same | |
1067 | * path. | |
1068 | */ | |
077c48df | 1069 | if (!(istate->cache[pos]->ce_flags & CE_REMOVE)) { |
21cd8d00 JH |
1070 | retval = -1; |
1071 | if (!ok_to_replace) | |
1072 | break; | |
4aab5b46 | 1073 | remove_index_entry_at(istate, pos); |
21cd8d00 JH |
1074 | continue; |
1075 | } | |
12676608 | 1076 | } |
21cd8d00 JH |
1077 | else |
1078 | pos = -pos-1; | |
12676608 LT |
1079 | |
1080 | /* | |
1081 | * Trivial optimization: if we find an entry that | |
1082 | * already matches the sub-directory, then we know | |
b155725d | 1083 | * we're ok, and we can exit. |
12676608 | 1084 | */ |
4aab5b46 JH |
1085 | while (pos < istate->cache_nr) { |
1086 | struct cache_entry *p = istate->cache[pos]; | |
b155725d JH |
1087 | if ((ce_namelen(p) <= len) || |
1088 | (p->name[len] != '/') || | |
1089 | memcmp(p->name, name, len)) | |
1090 | break; /* not our subdirectory */ | |
077c48df JH |
1091 | if (ce_stage(p) == stage && !(p->ce_flags & CE_REMOVE)) |
1092 | /* | |
1093 | * p is at the same stage as our entry, and | |
b155725d JH |
1094 | * is a subdirectory of what we are looking |
1095 | * at, so we cannot have conflicts at our | |
1096 | * level or anything shorter. | |
1097 | */ | |
1098 | return retval; | |
1099 | pos++; | |
192268c1 | 1100 | } |
0f1e4f04 | 1101 | } |
12676608 LT |
1102 | return retval; |
1103 | } | |
1104 | ||
1105 | /* We may be in a situation where we already have path/file and path | |
1106 | * is being added, or we already have path and path/file is being | |
1107 | * added. Either one would result in a nonsense tree that has path | |
1108 | * twice when git-write-tree tries to write it out. Prevent it. | |
a6080a0a | 1109 | * |
12676608 LT |
1110 | * If ok-to-replace is specified, we remove the conflicting entries |
1111 | * from the cache so the caller should recompute the insert position. | |
1112 | * When this happens, we return non-zero. | |
1113 | */ | |
4aab5b46 JH |
1114 | static int check_file_directory_conflict(struct index_state *istate, |
1115 | const struct cache_entry *ce, | |
1116 | int pos, int ok_to_replace) | |
12676608 | 1117 | { |
21cd8d00 JH |
1118 | int retval; |
1119 | ||
1120 | /* | |
1121 | * When ce is an "I am going away" entry, we allow it to be added | |
1122 | */ | |
7a51ed66 | 1123 | if (ce->ce_flags & CE_REMOVE) |
21cd8d00 JH |
1124 | return 0; |
1125 | ||
12676608 LT |
1126 | /* |
1127 | * We check if the path is a sub-path of a subsequent pathname | |
1128 | * first, since removing those will not change the position | |
21cd8d00 | 1129 | * in the array. |
12676608 | 1130 | */ |
4aab5b46 | 1131 | retval = has_file_name(istate, ce, pos, ok_to_replace); |
21cd8d00 | 1132 | |
12676608 LT |
1133 | /* |
1134 | * Then check if the path might have a clashing sub-directory | |
1135 | * before it. | |
1136 | */ | |
4aab5b46 | 1137 | return retval + has_dir_name(istate, ce, pos, ok_to_replace); |
0f1e4f04 JH |
1138 | } |
1139 | ||
af3785dc | 1140 | static int add_index_entry_with_check(struct index_state *istate, struct cache_entry *ce, int option) |
197ee8c9 LT |
1141 | { |
1142 | int pos; | |
192268c1 JH |
1143 | int ok_to_add = option & ADD_CACHE_OK_TO_ADD; |
1144 | int ok_to_replace = option & ADD_CACHE_OK_TO_REPLACE; | |
b155725d | 1145 | int skip_df_check = option & ADD_CACHE_SKIP_DFCHECK; |
39425819 | 1146 | int new_only = option & ADD_CACHE_NEW_ONLY; |
5f73076c | 1147 | |
ce7c614b NTND |
1148 | if (!(option & ADD_CACHE_KEEP_CACHE_TREE)) |
1149 | cache_tree_invalidate_path(istate, ce->name); | |
e5494631 JH |
1150 | |
1151 | /* | |
1152 | * If this entry's path sorts after the last entry in the index, | |
1153 | * we can avoid searching for it. | |
1154 | */ | |
1155 | if (istate->cache_nr > 0 && | |
1156 | strcmp(ce->name, istate->cache[istate->cache_nr - 1]->name) > 0) | |
1157 | pos = -istate->cache_nr - 1; | |
1158 | else | |
1159 | pos = index_name_stage_pos(istate, ce->name, ce_namelen(ce), ce_stage(ce)); | |
197ee8c9 | 1160 | |
3e09cdfd | 1161 | /* existing match? Just replace it. */ |
76e7f4ec | 1162 | if (pos >= 0) { |
39425819 JH |
1163 | if (!new_only) |
1164 | replace_index_entry(istate, pos, ce); | |
197ee8c9 LT |
1165 | return 0; |
1166 | } | |
76e7f4ec | 1167 | pos = -pos-1; |
197ee8c9 | 1168 | |
ffcc9ba7 NTND |
1169 | if (!(option & ADD_CACHE_KEEP_CACHE_TREE)) |
1170 | untracked_cache_add_to_index(istate, ce->name); | |
e931371a | 1171 | |
7b937ca3 LT |
1172 | /* |
1173 | * Inserting a merged entry ("stage 0") into the index | |
1174 | * will always replace all non-merged entries.. | |
1175 | */ | |
4aab5b46 JH |
1176 | if (pos < istate->cache_nr && ce_stage(ce) == 0) { |
1177 | while (ce_same_name(istate->cache[pos], ce)) { | |
7b937ca3 | 1178 | ok_to_add = 1; |
4aab5b46 | 1179 | if (!remove_index_entry_at(istate, pos)) |
7b937ca3 LT |
1180 | break; |
1181 | } | |
1182 | } | |
1183 | ||
121481ab LT |
1184 | if (!ok_to_add) |
1185 | return -1; | |
8dcf39c4 | 1186 | if (!verify_path(ce->name)) |
7e7abea9 | 1187 | return error("Invalid path '%s'", ce->name); |
121481ab | 1188 | |
3e09cdfd | 1189 | if (!skip_df_check && |
4aab5b46 | 1190 | check_file_directory_conflict(istate, ce, pos, ok_to_replace)) { |
192268c1 | 1191 | if (!ok_to_replace) |
4aab5b46 JH |
1192 | return error("'%s' appears as both a file and as a directory", |
1193 | ce->name); | |
b60e188c | 1194 | pos = index_name_stage_pos(istate, ce->name, ce_namelen(ce), ce_stage(ce)); |
192268c1 JH |
1195 | pos = -pos-1; |
1196 | } | |
af3785dc JH |
1197 | return pos + 1; |
1198 | } | |
1199 | ||
1200 | int add_index_entry(struct index_state *istate, struct cache_entry *ce, int option) | |
1201 | { | |
1202 | int pos; | |
1203 | ||
1204 | if (option & ADD_CACHE_JUST_APPEND) | |
1205 | pos = istate->cache_nr; | |
1206 | else { | |
1207 | int ret; | |
1208 | ret = add_index_entry_with_check(istate, ce, option); | |
1209 | if (ret <= 0) | |
1210 | return ret; | |
1211 | pos = ret - 1; | |
1212 | } | |
0f1e4f04 | 1213 | |
197ee8c9 | 1214 | /* Make sure the array is big enough .. */ |
999f5660 | 1215 | ALLOC_GROW(istate->cache, istate->cache_nr + 1, istate->cache_alloc); |
197ee8c9 LT |
1216 | |
1217 | /* Add it in.. */ | |
4aab5b46 | 1218 | istate->cache_nr++; |
af3785dc | 1219 | if (istate->cache_nr > pos + 1) |
f919ffeb SG |
1220 | MOVE_ARRAY(istate->cache + pos + 1, istate->cache + pos, |
1221 | istate->cache_nr - pos - 1); | |
cf558704 | 1222 | set_index_entry(istate, pos, ce); |
e636a7b4 | 1223 | istate->cache_changed |= CE_ENTRY_ADDED; |
197ee8c9 LT |
1224 | return 0; |
1225 | } | |
1226 | ||
405e5b2f LT |
1227 | /* |
1228 | * "refresh" does not calculate a new sha1 file or bring the | |
1229 | * cache up-to-date for mode/content changes. But what it | |
1230 | * _does_ do is to "re-match" the stat information of a file | |
1231 | * with the cache, so that you can refresh the cache for a | |
1232 | * file that hasn't been changed but where the stat entry is | |
1233 | * out of date. | |
1234 | * | |
1235 | * For example, you'd want to do this after doing a "git-read-tree", | |
1236 | * to link up the stat cache details with the proper files. | |
1237 | */ | |
4aab5b46 | 1238 | static struct cache_entry *refresh_cache_ent(struct index_state *istate, |
4bd5b7da | 1239 | struct cache_entry *ce, |
d05e6970 JK |
1240 | unsigned int options, int *err, |
1241 | int *changed_ret) | |
405e5b2f LT |
1242 | { |
1243 | struct stat st; | |
1244 | struct cache_entry *updated; | |
1245 | int changed, size; | |
25762726 | 1246 | int refresh = options & CE_MATCH_REFRESH; |
4bd5b7da | 1247 | int ignore_valid = options & CE_MATCH_IGNORE_VALID; |
56cac48c | 1248 | int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE; |
2e2e7ec1 | 1249 | int ignore_missing = options & CE_MATCH_IGNORE_MISSING; |
883e248b | 1250 | int ignore_fsmonitor = options & CE_MATCH_IGNORE_FSMONITOR; |
405e5b2f | 1251 | |
25762726 | 1252 | if (!refresh || ce_uptodate(ce)) |
eadb5831 JH |
1253 | return ce; |
1254 | ||
883e248b BP |
1255 | if (!ignore_fsmonitor) |
1256 | refresh_fsmonitor(istate); | |
aa9349d4 | 1257 | /* |
56cac48c NTND |
1258 | * CE_VALID or CE_SKIP_WORKTREE means the user promised us |
1259 | * that the change to the work tree does not matter and told | |
1260 | * us not to worry. | |
aa9349d4 | 1261 | */ |
56cac48c NTND |
1262 | if (!ignore_skip_worktree && ce_skip_worktree(ce)) { |
1263 | ce_mark_uptodate(ce); | |
1264 | return ce; | |
1265 | } | |
aa9349d4 MSO |
1266 | if (!ignore_valid && (ce->ce_flags & CE_VALID)) { |
1267 | ce_mark_uptodate(ce); | |
1268 | return ce; | |
1269 | } | |
883e248b BP |
1270 | if (!ignore_fsmonitor && (ce->ce_flags & CE_FSMONITOR_VALID)) { |
1271 | ce_mark_uptodate(ce); | |
1272 | return ce; | |
1273 | } | |
aa9349d4 | 1274 | |
ccad42d4 RS |
1275 | if (has_symlink_leading_path(ce->name, ce_namelen(ce))) { |
1276 | if (ignore_missing) | |
1277 | return ce; | |
1278 | if (err) | |
1279 | *err = ENOENT; | |
1280 | return NULL; | |
1281 | } | |
1282 | ||
8fd2cb40 | 1283 | if (lstat(ce->name, &st) < 0) { |
2e2e7ec1 BK |
1284 | if (ignore_missing && errno == ENOENT) |
1285 | return ce; | |
ec0cc704 JH |
1286 | if (err) |
1287 | *err = errno; | |
8fd2cb40 JS |
1288 | return NULL; |
1289 | } | |
405e5b2f | 1290 | |
4bd5b7da | 1291 | changed = ie_match_stat(istate, ce, &st, options); |
d05e6970 JK |
1292 | if (changed_ret) |
1293 | *changed_ret = changed; | |
405e5b2f | 1294 | if (!changed) { |
4bd5b7da JH |
1295 | /* |
1296 | * The path is unchanged. If we were told to ignore | |
1297 | * valid bit, then we did the actual stat check and | |
1298 | * found that the entry is unmodified. If the entry | |
1299 | * is not marked VALID, this is the place to mark it | |
1300 | * valid again, under "assume unchanged" mode. | |
1301 | */ | |
1302 | if (ignore_valid && assume_unchanged && | |
7a51ed66 | 1303 | !(ce->ce_flags & CE_VALID)) |
405e5b2f | 1304 | ; /* mark this one VALID again */ |
eadb5831 JH |
1305 | else { |
1306 | /* | |
1307 | * We do not mark the index itself "modified" | |
1308 | * because CE_UPTODATE flag is in-core only; | |
1309 | * we are not going to write this change out. | |
1310 | */ | |
883e248b | 1311 | if (!S_ISGITLINK(ce->ce_mode)) { |
125fd984 | 1312 | ce_mark_uptodate(ce); |
883e248b BP |
1313 | mark_fsmonitor_valid(ce); |
1314 | } | |
8fd2cb40 | 1315 | return ce; |
eadb5831 | 1316 | } |
405e5b2f LT |
1317 | } |
1318 | ||
4bd5b7da | 1319 | if (ie_modified(istate, ce, &st, options)) { |
ec0cc704 JH |
1320 | if (err) |
1321 | *err = EINVAL; | |
8fd2cb40 JS |
1322 | return NULL; |
1323 | } | |
405e5b2f LT |
1324 | |
1325 | size = ce_size(ce); | |
1326 | updated = xmalloc(size); | |
1327 | memcpy(updated, ce, size); | |
1328 | fill_stat_cache_info(updated, &st); | |
4bd5b7da JH |
1329 | /* |
1330 | * If ignore_valid is not set, we should leave CE_VALID bit | |
1331 | * alone. Otherwise, paths marked with --no-assume-unchanged | |
1332 | * (i.e. things to be edited) will reacquire CE_VALID bit | |
1333 | * automatically, which is not really what we want. | |
405e5b2f | 1334 | */ |
4bd5b7da | 1335 | if (!ignore_valid && assume_unchanged && |
7a51ed66 LT |
1336 | !(ce->ce_flags & CE_VALID)) |
1337 | updated->ce_flags &= ~CE_VALID; | |
405e5b2f | 1338 | |
e636a7b4 | 1339 | /* istate->cache_changed is updated in the caller */ |
405e5b2f LT |
1340 | return updated; |
1341 | } | |
1342 | ||
3deffc52 | 1343 | static void show_file(const char * fmt, const char * name, int in_porcelain, |
046613c5 | 1344 | int * first, const char *header_msg) |
3deffc52 MM |
1345 | { |
1346 | if (in_porcelain && *first && header_msg) { | |
1347 | printf("%s\n", header_msg); | |
cd2b8ae9 | 1348 | *first = 0; |
3deffc52 MM |
1349 | } |
1350 | printf(fmt, name); | |
1351 | } | |
1352 | ||
9b2d6149 NTND |
1353 | int refresh_index(struct index_state *istate, unsigned int flags, |
1354 | const struct pathspec *pathspec, | |
046613c5 | 1355 | char *seen, const char *header_msg) |
405e5b2f LT |
1356 | { |
1357 | int i; | |
1358 | int has_errors = 0; | |
1359 | int really = (flags & REFRESH_REALLY) != 0; | |
1360 | int allow_unmerged = (flags & REFRESH_UNMERGED) != 0; | |
1361 | int quiet = (flags & REFRESH_QUIET) != 0; | |
1362 | int not_new = (flags & REFRESH_IGNORE_MISSING) != 0; | |
5fdeacb0 | 1363 | int ignore_submodules = (flags & REFRESH_IGNORE_SUBMODULES) != 0; |
3deffc52 MM |
1364 | int first = 1; |
1365 | int in_porcelain = (flags & REFRESH_IN_PORCELAIN); | |
25762726 BK |
1366 | unsigned int options = (CE_MATCH_REFRESH | |
1367 | (really ? CE_MATCH_IGNORE_VALID : 0) | | |
2e2e7ec1 | 1368 | (not_new ? CE_MATCH_IGNORE_MISSING : 0)); |
4bd4e730 | 1369 | const char *modified_fmt; |
73b7eae6 JK |
1370 | const char *deleted_fmt; |
1371 | const char *typechange_fmt; | |
1372 | const char *added_fmt; | |
4bd4e730 | 1373 | const char *unmerged_fmt; |
405e5b2f | 1374 | |
4bd4e730 | 1375 | modified_fmt = (in_porcelain ? "M\t%s\n" : "%s: needs update\n"); |
73b7eae6 JK |
1376 | deleted_fmt = (in_porcelain ? "D\t%s\n" : "%s: needs update\n"); |
1377 | typechange_fmt = (in_porcelain ? "T\t%s\n" : "%s needs update\n"); | |
1378 | added_fmt = (in_porcelain ? "A\t%s\n" : "%s needs update\n"); | |
4bd4e730 | 1379 | unmerged_fmt = (in_porcelain ? "U\t%s\n" : "%s: needs merge\n"); |
4aab5b46 | 1380 | for (i = 0; i < istate->cache_nr; i++) { |
405e5b2f | 1381 | struct cache_entry *ce, *new; |
ec0cc704 | 1382 | int cache_errno = 0; |
73b7eae6 | 1383 | int changed = 0; |
3d1f148c | 1384 | int filtered = 0; |
ec0cc704 | 1385 | |
4aab5b46 | 1386 | ce = istate->cache[i]; |
5fdeacb0 JS |
1387 | if (ignore_submodules && S_ISGITLINK(ce->ce_mode)) |
1388 | continue; | |
1389 | ||
429bb40a | 1390 | if (pathspec && !ce_path_match(ce, pathspec, seen)) |
3d1f148c JH |
1391 | filtered = 1; |
1392 | ||
405e5b2f | 1393 | if (ce_stage(ce)) { |
4aab5b46 JH |
1394 | while ((i < istate->cache_nr) && |
1395 | ! strcmp(istate->cache[i]->name, ce->name)) | |
405e5b2f LT |
1396 | i++; |
1397 | i--; | |
1398 | if (allow_unmerged) | |
1399 | continue; | |
3d1f148c JH |
1400 | if (!filtered) |
1401 | show_file(unmerged_fmt, ce->name, in_porcelain, | |
1402 | &first, header_msg); | |
405e5b2f LT |
1403 | has_errors = 1; |
1404 | continue; | |
1405 | } | |
1406 | ||
3d1f148c | 1407 | if (filtered) |
d616813d AJ |
1408 | continue; |
1409 | ||
73b7eae6 | 1410 | new = refresh_cache_ent(istate, ce, options, &cache_errno, &changed); |
8fd2cb40 | 1411 | if (new == ce) |
405e5b2f | 1412 | continue; |
8fd2cb40 | 1413 | if (!new) { |
73b7eae6 JK |
1414 | const char *fmt; |
1415 | ||
8fd2cb40 | 1416 | if (really && cache_errno == EINVAL) { |
405e5b2f LT |
1417 | /* If we are doing --really-refresh that |
1418 | * means the index is not valid anymore. | |
1419 | */ | |
7a51ed66 | 1420 | ce->ce_flags &= ~CE_VALID; |
078a58e8 | 1421 | ce->ce_flags |= CE_UPDATE_IN_BASE; |
883e248b | 1422 | mark_fsmonitor_invalid(istate, ce); |
e636a7b4 | 1423 | istate->cache_changed |= CE_ENTRY_CHANGED; |
405e5b2f LT |
1424 | } |
1425 | if (quiet) | |
1426 | continue; | |
73b7eae6 JK |
1427 | |
1428 | if (cache_errno == ENOENT) | |
1429 | fmt = deleted_fmt; | |
895ff3b2 | 1430 | else if (ce_intent_to_add(ce)) |
73b7eae6 JK |
1431 | fmt = added_fmt; /* must be before other checks */ |
1432 | else if (changed & TYPE_CHANGED) | |
1433 | fmt = typechange_fmt; | |
1434 | else | |
1435 | fmt = modified_fmt; | |
1436 | show_file(fmt, | |
1437 | ce->name, in_porcelain, &first, header_msg); | |
405e5b2f LT |
1438 | has_errors = 1; |
1439 | continue; | |
1440 | } | |
cf558704 LT |
1441 | |
1442 | replace_index_entry(istate, i, new); | |
405e5b2f LT |
1443 | } |
1444 | return has_errors; | |
1445 | } | |
1446 | ||
1335d76e | 1447 | struct cache_entry *refresh_cache_entry(struct cache_entry *ce, |
25762726 | 1448 | unsigned int options) |
ec0cc704 | 1449 | { |
25762726 | 1450 | return refresh_cache_ent(&the_index, ce, options, NULL, NULL); |
ec0cc704 JH |
1451 | } |
1452 | ||
db3b313c JH |
1453 | |
1454 | /***************************************************************** | |
1455 | * Index File I/O | |
1456 | *****************************************************************/ | |
1457 | ||
9d227781 JH |
1458 | #define INDEX_FORMAT_DEFAULT 3 |
1459 | ||
136347d7 TG |
1460 | static unsigned int get_index_format_default(void) |
1461 | { | |
1462 | char *envversion = getenv("GIT_INDEX_VERSION"); | |
3c09d684 | 1463 | char *endp; |
b27a5720 | 1464 | int value; |
3c09d684 TG |
1465 | unsigned int version = INDEX_FORMAT_DEFAULT; |
1466 | ||
136347d7 | 1467 | if (!envversion) { |
b27a5720 TA |
1468 | if (!git_config_get_int("index.version", &value)) |
1469 | version = value; | |
3c09d684 TG |
1470 | if (version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < version) { |
1471 | warning(_("index.version set, but the value is invalid.\n" | |
136347d7 | 1472 | "Using version %i"), INDEX_FORMAT_DEFAULT); |
3c09d684 | 1473 | return INDEX_FORMAT_DEFAULT; |
136347d7 TG |
1474 | } |
1475 | return version; | |
1476 | } | |
3c09d684 TG |
1477 | |
1478 | version = strtoul(envversion, &endp, 10); | |
1479 | if (*endp || | |
1480 | version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < version) { | |
1481 | warning(_("GIT_INDEX_VERSION set, but the value is invalid.\n" | |
1482 | "Using version %i"), INDEX_FORMAT_DEFAULT); | |
1483 | version = INDEX_FORMAT_DEFAULT; | |
1484 | } | |
1485 | return version; | |
136347d7 TG |
1486 | } |
1487 | ||
db3b313c JH |
1488 | /* |
1489 | * dev/ino/uid/gid/size are also just tracked to the low 32 bits | |
1490 | * Again - this is just a (very strong in practice) heuristic that | |
1491 | * the inode hasn't changed. | |
1492 | * | |
1493 | * We save the fields in big-endian order to allow using the | |
1494 | * index file over NFS transparently. | |
1495 | */ | |
1496 | struct ondisk_cache_entry { | |
1497 | struct cache_time ctime; | |
1498 | struct cache_time mtime; | |
7800c1eb TG |
1499 | uint32_t dev; |
1500 | uint32_t ino; | |
1501 | uint32_t mode; | |
1502 | uint32_t uid; | |
1503 | uint32_t gid; | |
1504 | uint32_t size; | |
db3b313c | 1505 | unsigned char sha1[20]; |
7800c1eb | 1506 | uint16_t flags; |
db3b313c JH |
1507 | char name[FLEX_ARRAY]; /* more */ |
1508 | }; | |
1509 | ||
1510 | /* | |
1511 | * This struct is used when CE_EXTENDED bit is 1 | |
1512 | * The struct must match ondisk_cache_entry exactly from | |
1513 | * ctime till flags | |
1514 | */ | |
1515 | struct ondisk_cache_entry_extended { | |
1516 | struct cache_time ctime; | |
1517 | struct cache_time mtime; | |
7800c1eb TG |
1518 | uint32_t dev; |
1519 | uint32_t ino; | |
1520 | uint32_t mode; | |
1521 | uint32_t uid; | |
1522 | uint32_t gid; | |
1523 | uint32_t size; | |
db3b313c | 1524 | unsigned char sha1[20]; |
7800c1eb TG |
1525 | uint16_t flags; |
1526 | uint16_t flags2; | |
db3b313c JH |
1527 | char name[FLEX_ARRAY]; /* more */ |
1528 | }; | |
1529 | ||
6c9cd161 | 1530 | /* These are only used for v3 or lower */ |
ce012deb | 1531 | #define align_padding_size(size, len) ((size + (len) + 8) & ~7) - (size + len) |
db3b313c JH |
1532 | #define align_flex_name(STRUCT,len) ((offsetof(struct STRUCT,name) + (len) + 8) & ~7) |
1533 | #define ondisk_cache_entry_size(len) align_flex_name(ondisk_cache_entry,len) | |
1534 | #define ondisk_cache_entry_extended_size(len) align_flex_name(ondisk_cache_entry_extended,len) | |
1535 | #define ondisk_ce_size(ce) (((ce)->ce_flags & CE_EXTENDED) ? \ | |
1536 | ondisk_cache_entry_extended_size(ce_namelen(ce)) : \ | |
1537 | ondisk_cache_entry_size(ce_namelen(ce))) | |
1538 | ||
a33fc72f JH |
1539 | /* Allow fsck to force verification of the index checksum. */ |
1540 | int verify_index_checksum; | |
1541 | ||
00ec50e5 BP |
1542 | /* Allow fsck to force verification of the cache entry order. */ |
1543 | int verify_ce_order; | |
1544 | ||
bad68ec9 | 1545 | static int verify_hdr(struct cache_header *hdr, unsigned long size) |
e83c5163 | 1546 | { |
9126f009 | 1547 | git_SHA_CTX c; |
bad68ec9 | 1548 | unsigned char sha1[20]; |
0136bac9 | 1549 | int hdr_version; |
e83c5163 | 1550 | |
ccc4feb5 | 1551 | if (hdr->hdr_signature != htonl(CACHE_SIGNATURE)) |
e83c5163 | 1552 | return error("bad signature"); |
0136bac9 | 1553 | hdr_version = ntohl(hdr->hdr_version); |
b82a7b5b | 1554 | if (hdr_version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < hdr_version) |
0136bac9 | 1555 | return error("bad index version %d", hdr_version); |
a33fc72f JH |
1556 | |
1557 | if (!verify_index_checksum) | |
1558 | return 0; | |
1559 | ||
9126f009 NP |
1560 | git_SHA1_Init(&c); |
1561 | git_SHA1_Update(&c, hdr, size - 20); | |
1562 | git_SHA1_Final(sha1, &c); | |
a89fccd2 | 1563 | if (hashcmp(sha1, (unsigned char *)hdr + size - 20)) |
ca9be054 | 1564 | return error("bad index file sha1 signature"); |
e83c5163 LT |
1565 | return 0; |
1566 | } | |
1567 | ||
4aab5b46 JH |
1568 | static int read_index_extension(struct index_state *istate, |
1569 | const char *ext, void *data, unsigned long sz) | |
bad68ec9 JH |
1570 | { |
1571 | switch (CACHE_EXT(ext)) { | |
1572 | case CACHE_EXT_TREE: | |
4aab5b46 | 1573 | istate->cache_tree = cache_tree_read(data, sz); |
bad68ec9 | 1574 | break; |
cfc5789a JH |
1575 | case CACHE_EXT_RESOLVE_UNDO: |
1576 | istate->resolve_undo = resolve_undo_read(data, sz); | |
1577 | break; | |
5fc2fc8f NTND |
1578 | case CACHE_EXT_LINK: |
1579 | if (read_link_extension(istate, data, sz)) | |
1580 | return -1; | |
1581 | break; | |
f9e6c649 NTND |
1582 | case CACHE_EXT_UNTRACKED: |
1583 | istate->untracked = read_untracked_extension(data, sz); | |
1584 | break; | |
883e248b BP |
1585 | case CACHE_EXT_FSMONITOR: |
1586 | read_fsmonitor_extension(istate, data, sz); | |
1587 | break; | |
bad68ec9 JH |
1588 | default: |
1589 | if (*ext < 'A' || 'Z' < *ext) | |
1590 | return error("index uses %.4s extension, which we do not understand", | |
1591 | ext); | |
1592 | fprintf(stderr, "ignoring %.4s extension\n", ext); | |
1593 | break; | |
1594 | } | |
1595 | return 0; | |
1596 | } | |
1597 | ||
b3e83cc7 | 1598 | int hold_locked_index(struct lock_file *lk, int lock_flags) |
216aab1e | 1599 | { |
b3e83cc7 | 1600 | return hold_lock_file_for_update(lk, get_index_file(), lock_flags); |
216aab1e MH |
1601 | } |
1602 | ||
4aab5b46 | 1603 | int read_index(struct index_state *istate) |
8fd2cb40 | 1604 | { |
a125a223 | 1605 | return read_index_from(istate, get_index_file(), get_git_dir()); |
8fd2cb40 JS |
1606 | } |
1607 | ||
3fc22b53 JH |
1608 | static struct cache_entry *cache_entry_from_ondisk(struct ondisk_cache_entry *ondisk, |
1609 | unsigned int flags, | |
1610 | const char *name, | |
1611 | size_t len) | |
1612 | { | |
1613 | struct cache_entry *ce = xmalloc(cache_entry_size(len)); | |
1614 | ||
c3d8da57 JK |
1615 | ce->ce_stat_data.sd_ctime.sec = get_be32(&ondisk->ctime.sec); |
1616 | ce->ce_stat_data.sd_mtime.sec = get_be32(&ondisk->mtime.sec); | |
1617 | ce->ce_stat_data.sd_ctime.nsec = get_be32(&ondisk->ctime.nsec); | |
1618 | ce->ce_stat_data.sd_mtime.nsec = get_be32(&ondisk->mtime.nsec); | |
1619 | ce->ce_stat_data.sd_dev = get_be32(&ondisk->dev); | |
1620 | ce->ce_stat_data.sd_ino = get_be32(&ondisk->ino); | |
1621 | ce->ce_mode = get_be32(&ondisk->mode); | |
1622 | ce->ce_stat_data.sd_uid = get_be32(&ondisk->uid); | |
1623 | ce->ce_stat_data.sd_gid = get_be32(&ondisk->gid); | |
1624 | ce->ce_stat_data.sd_size = get_be32(&ondisk->size); | |
b60e188c TG |
1625 | ce->ce_flags = flags & ~CE_NAMEMASK; |
1626 | ce->ce_namelen = len; | |
5fc2fc8f | 1627 | ce->index = 0; |
99d1a986 | 1628 | hashcpy(ce->oid.hash, ondisk->sha1); |
3fc22b53 JH |
1629 | memcpy(ce->name, name, len); |
1630 | ce->name[len] = '\0'; | |
1631 | return ce; | |
1632 | } | |
1633 | ||
6c9cd161 JH |
1634 | /* |
1635 | * Adjacent cache entries tend to share the leading paths, so it makes | |
1636 | * sense to only store the differences in later entries. In the v4 | |
1637 | * on-disk format of the index, each on-disk cache entry stores the | |
1638 | * number of bytes to be stripped from the end of the previous name, | |
1639 | * and the bytes to append to the result, to come up with its name. | |
1640 | */ | |
1641 | static unsigned long expand_name_field(struct strbuf *name, const char *cp_) | |
1642 | { | |
1643 | const unsigned char *ep, *cp = (const unsigned char *)cp_; | |
1644 | size_t len = decode_varint(&cp); | |
1645 | ||
1646 | if (name->len < len) | |
1647 | die("malformed name field in the index"); | |
1648 | strbuf_remove(name, name->len - len, len); | |
1649 | for (ep = cp; *ep; ep++) | |
1650 | ; /* find the end */ | |
1651 | strbuf_add(name, cp, ep - cp); | |
1652 | return (const char *)ep + 1 - cp_; | |
1653 | } | |
1654 | ||
936f53d0 | 1655 | static struct cache_entry *create_from_disk(struct ondisk_cache_entry *ondisk, |
6c9cd161 JH |
1656 | unsigned long *ent_size, |
1657 | struct strbuf *previous_name) | |
7a51ed66 | 1658 | { |
debed2a6 | 1659 | struct cache_entry *ce; |
7fec10b7 | 1660 | size_t len; |
06aaaa0b | 1661 | const char *name; |
debed2a6 | 1662 | unsigned int flags; |
7fec10b7 | 1663 | |
7a51ed66 | 1664 | /* On-disk flags are just 16 bits */ |
c3d8da57 | 1665 | flags = get_be16(&ondisk->flags); |
debed2a6 | 1666 | len = flags & CE_NAMEMASK; |
7fec10b7 | 1667 | |
debed2a6 | 1668 | if (flags & CE_EXTENDED) { |
06aaaa0b NTND |
1669 | struct ondisk_cache_entry_extended *ondisk2; |
1670 | int extended_flags; | |
1671 | ondisk2 = (struct ondisk_cache_entry_extended *)ondisk; | |
c3d8da57 | 1672 | extended_flags = get_be16(&ondisk2->flags2) << 16; |
06aaaa0b NTND |
1673 | /* We do not yet understand any bit out of CE_EXTENDED_FLAGS */ |
1674 | if (extended_flags & ~CE_EXTENDED_FLAGS) | |
1675 | die("Unknown index entry format %08x", extended_flags); | |
debed2a6 | 1676 | flags |= extended_flags; |
06aaaa0b NTND |
1677 | name = ondisk2->name; |
1678 | } | |
1679 | else | |
1680 | name = ondisk->name; | |
1681 | ||
6c9cd161 JH |
1682 | if (!previous_name) { |
1683 | /* v3 and earlier */ | |
1684 | if (len == CE_NAMEMASK) | |
1685 | len = strlen(name); | |
1686 | ce = cache_entry_from_ondisk(ondisk, flags, name, len); | |
1687 | ||
1688 | *ent_size = ondisk_ce_size(ce); | |
1689 | } else { | |
1690 | unsigned long consumed; | |
1691 | consumed = expand_name_field(previous_name, name); | |
1692 | ce = cache_entry_from_ondisk(ondisk, flags, | |
1693 | previous_name->buf, | |
1694 | previous_name->len); | |
1695 | ||
1696 | *ent_size = (name - ((char *)ondisk)) + consumed; | |
1697 | } | |
debed2a6 | 1698 | return ce; |
cf558704 LT |
1699 | } |
1700 | ||
03f15a79 | 1701 | static void check_ce_order(struct index_state *istate) |
15999d0b | 1702 | { |
03f15a79 TG |
1703 | unsigned int i; |
1704 | ||
00ec50e5 BP |
1705 | if (!verify_ce_order) |
1706 | return; | |
1707 | ||
03f15a79 TG |
1708 | for (i = 1; i < istate->cache_nr; i++) { |
1709 | struct cache_entry *ce = istate->cache[i - 1]; | |
1710 | struct cache_entry *next_ce = istate->cache[i]; | |
1711 | int name_compare = strcmp(ce->name, next_ce->name); | |
1712 | ||
1713 | if (0 < name_compare) | |
1714 | die("unordered stage entries in index"); | |
1715 | if (!name_compare) { | |
1716 | if (!ce_stage(ce)) | |
1717 | die("multiple stage entries for merged file '%s'", | |
1718 | ce->name); | |
1719 | if (ce_stage(ce) > ce_stage(next_ce)) | |
1720 | die("unordered stage entries for '%s'", | |
1721 | ce->name); | |
1722 | } | |
15999d0b JSP |
1723 | } |
1724 | } | |
1725 | ||
435ec090 CC |
1726 | static void tweak_untracked_cache(struct index_state *istate) |
1727 | { | |
1728 | switch (git_config_get_untracked_cache()) { | |
1729 | case -1: /* keep: do nothing */ | |
1730 | break; | |
1731 | case 0: /* false */ | |
1732 | remove_untracked_cache(istate); | |
1733 | break; | |
1734 | case 1: /* true */ | |
1735 | add_untracked_cache(istate); | |
1736 | break; | |
1737 | default: /* unknown value: do nothing */ | |
1738 | break; | |
1739 | } | |
1740 | } | |
1741 | ||
43925312 CC |
1742 | static void tweak_split_index(struct index_state *istate) |
1743 | { | |
1744 | switch (git_config_get_split_index()) { | |
1745 | case -1: /* unset: do nothing */ | |
1746 | break; | |
1747 | case 0: /* false */ | |
1748 | remove_split_index(istate); | |
1749 | break; | |
1750 | case 1: /* true */ | |
1751 | add_split_index(istate); | |
1752 | break; | |
1753 | default: /* unknown value: do nothing */ | |
1754 | break; | |
1755 | } | |
1756 | } | |
1757 | ||
435ec090 CC |
1758 | static void post_read_index_from(struct index_state *istate) |
1759 | { | |
1760 | check_ce_order(istate); | |
1761 | tweak_untracked_cache(istate); | |
43925312 | 1762 | tweak_split_index(istate); |
883e248b | 1763 | tweak_fsmonitor(istate); |
435ec090 CC |
1764 | } |
1765 | ||
8fd2cb40 | 1766 | /* remember to discard_cache() before reading a different cache! */ |
3e52f70b | 1767 | int do_read_index(struct index_state *istate, const char *path, int must_exist) |
e83c5163 LT |
1768 | { |
1769 | int fd, i; | |
1770 | struct stat st; | |
debed2a6 | 1771 | unsigned long src_offset; |
e83c5163 | 1772 | struct cache_header *hdr; |
7a51ed66 LT |
1773 | void *mmap; |
1774 | size_t mmap_size; | |
6c9cd161 | 1775 | struct strbuf previous_name_buf = STRBUF_INIT, *previous_name; |
e83c5163 | 1776 | |
913e0e99 | 1777 | if (istate->initialized) |
4aab5b46 | 1778 | return istate->cache_nr; |
5d1a5c02 | 1779 | |
fba2f38a KB |
1780 | istate->timestamp.sec = 0; |
1781 | istate->timestamp.nsec = 0; | |
8fd2cb40 | 1782 | fd = open(path, O_RDONLY); |
5d1a5c02 | 1783 | if (fd < 0) { |
5fc2fc8f | 1784 | if (!must_exist && errno == ENOENT) |
5d1a5c02 | 1785 | return 0; |
5fc2fc8f | 1786 | die_errno("%s: index file open failed", path); |
5d1a5c02 | 1787 | } |
e83c5163 | 1788 | |
3511a377 | 1789 | if (fstat(fd, &st)) |
d824cbba | 1790 | die_errno("cannot stat the open index"); |
3511a377 | 1791 | |
7a51ed66 LT |
1792 | mmap_size = xsize_t(st.st_size); |
1793 | if (mmap_size < sizeof(struct cache_header) + 20) | |
3511a377 LFC |
1794 | die("index file smaller than expected"); |
1795 | ||
a1293ef7 | 1796 | mmap = xmmap(NULL, mmap_size, PROT_READ, MAP_PRIVATE, fd, 0); |
7a51ed66 | 1797 | if (mmap == MAP_FAILED) |
0721c314 | 1798 | die_errno("unable to map index file"); |
57d84f8d | 1799 | close(fd); |
e83c5163 | 1800 | |
7a51ed66 LT |
1801 | hdr = mmap; |
1802 | if (verify_hdr(hdr, mmap_size) < 0) | |
e83c5163 LT |
1803 | goto unmap; |
1804 | ||
e93021b2 | 1805 | hashcpy(istate->sha1, (const unsigned char *)hdr + mmap_size - 20); |
9d227781 | 1806 | istate->version = ntohl(hdr->hdr_version); |
4aab5b46 JH |
1807 | istate->cache_nr = ntohl(hdr->hdr_entries); |
1808 | istate->cache_alloc = alloc_nr(istate->cache_nr); | |
c4aa3167 | 1809 | istate->cache = xcalloc(istate->cache_alloc, sizeof(*istate->cache)); |
913e0e99 | 1810 | istate->initialized = 1; |
7a51ed66 | 1811 | |
9d227781 | 1812 | if (istate->version == 4) |
6c9cd161 JH |
1813 | previous_name = &previous_name_buf; |
1814 | else | |
1815 | previous_name = NULL; | |
1816 | ||
7a51ed66 | 1817 | src_offset = sizeof(*hdr); |
4aab5b46 | 1818 | for (i = 0; i < istate->cache_nr; i++) { |
7a51ed66 | 1819 | struct ondisk_cache_entry *disk_ce; |
4aab5b46 | 1820 | struct cache_entry *ce; |
936f53d0 | 1821 | unsigned long consumed; |
4aab5b46 | 1822 | |
7a51ed66 | 1823 | disk_ce = (struct ondisk_cache_entry *)((char *)mmap + src_offset); |
6c9cd161 | 1824 | ce = create_from_disk(disk_ce, &consumed, previous_name); |
cf558704 | 1825 | set_index_entry(istate, i, ce); |
7a51ed66 | 1826 | |
936f53d0 | 1827 | src_offset += consumed; |
e83c5163 | 1828 | } |
6c9cd161 | 1829 | strbuf_release(&previous_name_buf); |
fba2f38a | 1830 | istate->timestamp.sec = st.st_mtime; |
c06ff490 | 1831 | istate->timestamp.nsec = ST_MTIME_NSEC(st); |
fba2f38a | 1832 | |
7a51ed66 | 1833 | while (src_offset <= mmap_size - 20 - 8) { |
bad68ec9 JH |
1834 | /* After an array of active_nr index entries, |
1835 | * there can be arbitrary number of extended | |
1836 | * sections, each of which is prefixed with | |
1837 | * extension name (4-byte) and section length | |
1838 | * in 4-byte network byte order. | |
1839 | */ | |
07cc8eca | 1840 | uint32_t extsize; |
7a51ed66 | 1841 | memcpy(&extsize, (char *)mmap + src_offset + 4, 4); |
bad68ec9 | 1842 | extsize = ntohl(extsize); |
4aab5b46 | 1843 | if (read_index_extension(istate, |
7a51ed66 LT |
1844 | (const char *) mmap + src_offset, |
1845 | (char *) mmap + src_offset + 8, | |
1d7f171c | 1846 | extsize) < 0) |
bad68ec9 | 1847 | goto unmap; |
7a51ed66 LT |
1848 | src_offset += 8; |
1849 | src_offset += extsize; | |
bad68ec9 | 1850 | } |
7a51ed66 | 1851 | munmap(mmap, mmap_size); |
4aab5b46 | 1852 | return istate->cache_nr; |
e83c5163 LT |
1853 | |
1854 | unmap: | |
7a51ed66 | 1855 | munmap(mmap, mmap_size); |
5d1a5c02 | 1856 | die("index file corrupt"); |
e83c5163 LT |
1857 | } |
1858 | ||
0d59ffb4 CC |
1859 | /* |
1860 | * Signal that the shared index is used by updating its mtime. | |
1861 | * | |
1862 | * This way, shared index can be removed if they have not been used | |
1863 | * for some time. | |
1864 | */ | |
a125a223 | 1865 | static void freshen_shared_index(const char *shared_index, int warn) |
0d59ffb4 | 1866 | { |
0d59ffb4 CC |
1867 | if (!check_and_freshen_file(shared_index, 1) && warn) |
1868 | warning("could not freshen shared index '%s'", shared_index); | |
1869 | } | |
1870 | ||
a125a223 TG |
1871 | int read_index_from(struct index_state *istate, const char *path, |
1872 | const char *gitdir) | |
5fc2fc8f NTND |
1873 | { |
1874 | struct split_index *split_index; | |
1875 | int ret; | |
de6ae5f9 | 1876 | char *base_sha1_hex; |
a125a223 | 1877 | char *base_path; |
5fc2fc8f NTND |
1878 | |
1879 | /* istate->initialized covers both .git/index and .git/sharedindex.xxx */ | |
1880 | if (istate->initialized) | |
1881 | return istate->cache_nr; | |
1882 | ||
1883 | ret = do_read_index(istate, path, 0); | |
435ec090 | 1884 | |
5fc2fc8f | 1885 | split_index = istate->split_index; |
03f15a79 | 1886 | if (!split_index || is_null_sha1(split_index->base_sha1)) { |
435ec090 | 1887 | post_read_index_from(istate); |
5fc2fc8f | 1888 | return ret; |
03f15a79 | 1889 | } |
5fc2fc8f NTND |
1890 | |
1891 | if (split_index->base) | |
1892 | discard_index(split_index->base); | |
1893 | else | |
1894 | split_index->base = xcalloc(1, sizeof(*split_index->base)); | |
de6ae5f9 CC |
1895 | |
1896 | base_sha1_hex = sha1_to_hex(split_index->base_sha1); | |
a125a223 | 1897 | base_path = xstrfmt("%s/sharedindex.%s", gitdir, base_sha1_hex); |
de6ae5f9 | 1898 | ret = do_read_index(split_index->base, base_path, 1); |
5fc2fc8f NTND |
1899 | if (hashcmp(split_index->base_sha1, split_index->base->sha1)) |
1900 | die("broken index, expect %s in %s, got %s", | |
de6ae5f9 | 1901 | base_sha1_hex, base_path, |
5fc2fc8f | 1902 | sha1_to_hex(split_index->base->sha1)); |
de6ae5f9 | 1903 | |
a125a223 | 1904 | freshen_shared_index(base_path, 0); |
5fc2fc8f | 1905 | merge_base_index(istate); |
435ec090 | 1906 | post_read_index_from(istate); |
a125a223 | 1907 | free(base_path); |
5fc2fc8f NTND |
1908 | return ret; |
1909 | } | |
1910 | ||
fa7b3c2f JH |
1911 | int is_index_unborn(struct index_state *istate) |
1912 | { | |
debed2a6 | 1913 | return (!istate->cache_nr && !istate->timestamp.sec); |
fa7b3c2f JH |
1914 | } |
1915 | ||
4aab5b46 | 1916 | int discard_index(struct index_state *istate) |
6d297f81 | 1917 | { |
debed2a6 RS |
1918 | int i; |
1919 | ||
64719b11 JH |
1920 | for (i = 0; i < istate->cache_nr; i++) { |
1921 | if (istate->cache[i]->index && | |
1922 | istate->split_index && | |
1923 | istate->split_index->base && | |
1924 | istate->cache[i]->index <= istate->split_index->base->cache_nr && | |
1925 | istate->cache[i] == istate->split_index->base->cache[istate->cache[i]->index - 1]) | |
1926 | continue; | |
debed2a6 | 1927 | free(istate->cache[i]); |
64719b11 | 1928 | } |
cfc5789a | 1929 | resolve_undo_clear_index(istate); |
4aab5b46 JH |
1930 | istate->cache_nr = 0; |
1931 | istate->cache_changed = 0; | |
fba2f38a KB |
1932 | istate->timestamp.sec = 0; |
1933 | istate->timestamp.nsec = 0; | |
2092678c | 1934 | free_name_hash(istate); |
4aab5b46 | 1935 | cache_tree_free(&(istate->cache_tree)); |
913e0e99 | 1936 | istate->initialized = 0; |
6a83d902 | 1937 | FREE_AND_NULL(istate->cache); |
a0fc4db0 | 1938 | istate->cache_alloc = 0; |
5fc2fc8f | 1939 | discard_split_index(istate); |
f9e6c649 NTND |
1940 | free_untracked_cache(istate->untracked); |
1941 | istate->untracked = NULL; | |
7a51ed66 | 1942 | return 0; |
6d297f81 JS |
1943 | } |
1944 | ||
d1f128b0 | 1945 | int unmerged_index(const struct index_state *istate) |
94a5728c DB |
1946 | { |
1947 | int i; | |
1948 | for (i = 0; i < istate->cache_nr; i++) { | |
1949 | if (ce_stage(istate->cache[i])) | |
1950 | return 1; | |
1951 | } | |
1952 | return 0; | |
1953 | } | |
1954 | ||
4990aadc | 1955 | #define WRITE_BUFFER_SIZE 8192 |
bf0f910d | 1956 | static unsigned char write_buffer[WRITE_BUFFER_SIZE]; |
4990aadc LT |
1957 | static unsigned long write_buffer_len; |
1958 | ||
9126f009 | 1959 | static int ce_write_flush(git_SHA_CTX *context, int fd) |
6015c28b JH |
1960 | { |
1961 | unsigned int buffered = write_buffer_len; | |
1962 | if (buffered) { | |
9126f009 | 1963 | git_SHA1_Update(context, write_buffer, buffered); |
06f46f23 | 1964 | if (write_in_full(fd, write_buffer, buffered) < 0) |
6015c28b JH |
1965 | return -1; |
1966 | write_buffer_len = 0; | |
1967 | } | |
1968 | return 0; | |
1969 | } | |
1970 | ||
9126f009 | 1971 | static int ce_write(git_SHA_CTX *context, int fd, void *data, unsigned int len) |
4990aadc LT |
1972 | { |
1973 | while (len) { | |
1974 | unsigned int buffered = write_buffer_len; | |
1975 | unsigned int partial = WRITE_BUFFER_SIZE - buffered; | |
1976 | if (partial > len) | |
1977 | partial = len; | |
1978 | memcpy(write_buffer + buffered, data, partial); | |
1979 | buffered += partial; | |
1980 | if (buffered == WRITE_BUFFER_SIZE) { | |
6015c28b JH |
1981 | write_buffer_len = buffered; |
1982 | if (ce_write_flush(context, fd)) | |
4990aadc LT |
1983 | return -1; |
1984 | buffered = 0; | |
1985 | } | |
1986 | write_buffer_len = buffered; | |
1987 | len -= partial; | |
1d7f171c | 1988 | data = (char *) data + partial; |
a6080a0a JH |
1989 | } |
1990 | return 0; | |
4990aadc LT |
1991 | } |
1992 | ||
9126f009 | 1993 | static int write_index_ext_header(git_SHA_CTX *context, int fd, |
ac58c7b1 | 1994 | unsigned int ext, unsigned int sz) |
bad68ec9 JH |
1995 | { |
1996 | ext = htonl(ext); | |
1997 | sz = htonl(sz); | |
968a1d65 DR |
1998 | return ((ce_write(context, fd, &ext, 4) < 0) || |
1999 | (ce_write(context, fd, &sz, 4) < 0)) ? -1 : 0; | |
bad68ec9 JH |
2000 | } |
2001 | ||
e93021b2 | 2002 | static int ce_flush(git_SHA_CTX *context, int fd, unsigned char *sha1) |
4990aadc LT |
2003 | { |
2004 | unsigned int left = write_buffer_len; | |
ca9be054 | 2005 | |
4990aadc LT |
2006 | if (left) { |
2007 | write_buffer_len = 0; | |
9126f009 | 2008 | git_SHA1_Update(context, write_buffer, left); |
4990aadc | 2009 | } |
ca9be054 | 2010 | |
2c865d9a QH |
2011 | /* Flush first if not enough space for SHA1 signature */ |
2012 | if (left + 20 > WRITE_BUFFER_SIZE) { | |
06f46f23 | 2013 | if (write_in_full(fd, write_buffer, left) < 0) |
2c865d9a QH |
2014 | return -1; |
2015 | left = 0; | |
2016 | } | |
2017 | ||
ca9be054 | 2018 | /* Append the SHA1 signature at the end */ |
9126f009 | 2019 | git_SHA1_Final(write_buffer + left, context); |
e93021b2 | 2020 | hashcpy(sha1, write_buffer + left); |
ca9be054 | 2021 | left += 20; |
06f46f23 | 2022 | return (write_in_full(fd, write_buffer, left) < 0) ? -1 : 0; |
4990aadc LT |
2023 | } |
2024 | ||
407c8eb0 JH |
2025 | static void ce_smudge_racily_clean_entry(struct cache_entry *ce) |
2026 | { | |
2027 | /* | |
2028 | * The only thing we care about in this function is to smudge the | |
2029 | * falsely clean entry due to touch-update-touch race, so we leave | |
2030 | * everything else as they are. We are called for entries whose | |
c21d39d7 | 2031 | * ce_stat_data.sd_mtime match the index file mtime. |
c70115b4 JH |
2032 | * |
2033 | * Note that this actually does not do much for gitlinks, for | |
2034 | * which ce_match_stat_basic() always goes to the actual | |
2035 | * contents. The caller checks with is_racy_timestamp() which | |
2036 | * always says "no" for gitlinks, so we are not called for them ;-) | |
407c8eb0 JH |
2037 | */ |
2038 | struct stat st; | |
2039 | ||
2040 | if (lstat(ce->name, &st) < 0) | |
2041 | return; | |
2042 | if (ce_match_stat_basic(ce, &st)) | |
2043 | return; | |
2044 | if (ce_modified_check_fs(ce, &st)) { | |
4b3511b0 JH |
2045 | /* This is "racily clean"; smudge it. Note that this |
2046 | * is a tricky code. At first glance, it may appear | |
2047 | * that it can break with this sequence: | |
2048 | * | |
2049 | * $ echo xyzzy >frotz | |
2050 | * $ git-update-index --add frotz | |
2051 | * $ : >frotz | |
2052 | * $ sleep 3 | |
2053 | * $ echo filfre >nitfol | |
2054 | * $ git-update-index --add nitfol | |
2055 | * | |
b7e58b17 | 2056 | * but it does not. When the second update-index runs, |
4b3511b0 JH |
2057 | * it notices that the entry "frotz" has the same timestamp |
2058 | * as index, and if we were to smudge it by resetting its | |
2059 | * size to zero here, then the object name recorded | |
2060 | * in index is the 6-byte file but the cached stat information | |
2061 | * becomes zero --- which would then match what we would | |
a6080a0a | 2062 | * obtain from the filesystem next time we stat("frotz"). |
4b3511b0 JH |
2063 | * |
2064 | * However, the second update-index, before calling | |
2065 | * this function, notices that the cached size is 6 | |
2066 | * bytes and what is on the filesystem is an empty | |
2067 | * file, and never calls us, so the cached size information | |
2068 | * for "frotz" stays 6 which does not match the filesystem. | |
2069 | */ | |
c21d39d7 | 2070 | ce->ce_stat_data.sd_size = 0; |
407c8eb0 JH |
2071 | } |
2072 | } | |
2073 | ||
f136f7bf | 2074 | /* Copy miscellaneous fields but not the name */ |
ce012deb | 2075 | static void copy_cache_entry_to_ondisk(struct ondisk_cache_entry *ondisk, |
f136f7bf | 2076 | struct cache_entry *ce) |
7a51ed66 | 2077 | { |
b60e188c TG |
2078 | short flags; |
2079 | ||
c21d39d7 MH |
2080 | ondisk->ctime.sec = htonl(ce->ce_stat_data.sd_ctime.sec); |
2081 | ondisk->mtime.sec = htonl(ce->ce_stat_data.sd_mtime.sec); | |
2082 | ondisk->ctime.nsec = htonl(ce->ce_stat_data.sd_ctime.nsec); | |
2083 | ondisk->mtime.nsec = htonl(ce->ce_stat_data.sd_mtime.nsec); | |
2084 | ondisk->dev = htonl(ce->ce_stat_data.sd_dev); | |
2085 | ondisk->ino = htonl(ce->ce_stat_data.sd_ino); | |
7a51ed66 | 2086 | ondisk->mode = htonl(ce->ce_mode); |
c21d39d7 MH |
2087 | ondisk->uid = htonl(ce->ce_stat_data.sd_uid); |
2088 | ondisk->gid = htonl(ce->ce_stat_data.sd_gid); | |
2089 | ondisk->size = htonl(ce->ce_stat_data.sd_size); | |
99d1a986 | 2090 | hashcpy(ondisk->sha1, ce->oid.hash); |
b60e188c | 2091 | |
ce51bf09 | 2092 | flags = ce->ce_flags & ~CE_NAMEMASK; |
b60e188c TG |
2093 | flags |= (ce_namelen(ce) >= CE_NAMEMASK ? CE_NAMEMASK : ce_namelen(ce)); |
2094 | ondisk->flags = htons(flags); | |
06aaaa0b NTND |
2095 | if (ce->ce_flags & CE_EXTENDED) { |
2096 | struct ondisk_cache_entry_extended *ondisk2; | |
2097 | ondisk2 = (struct ondisk_cache_entry_extended *)ondisk; | |
2098 | ondisk2->flags2 = htons((ce->ce_flags & CE_EXTENDED_FLAGS) >> 16); | |
f136f7bf JH |
2099 | } |
2100 | } | |
2101 | ||
9d227781 | 2102 | static int ce_write_entry(git_SHA_CTX *c, int fd, struct cache_entry *ce, |
ce012deb | 2103 | struct strbuf *previous_name, struct ondisk_cache_entry *ondisk) |
f136f7bf | 2104 | { |
9d227781 | 2105 | int size; |
b3c96fb1 | 2106 | int saved_namelen = saved_namelen; /* compiler workaround */ |
f136f7bf | 2107 | int result; |
ce012deb | 2108 | static unsigned char padding[8] = { 0x00 }; |
f136f7bf | 2109 | |
b3c96fb1 NTND |
2110 | if (ce->ce_flags & CE_STRIP_NAME) { |
2111 | saved_namelen = ce_namelen(ce); | |
2112 | ce->ce_namelen = 0; | |
2113 | } | |
2114 | ||
ce012deb KW |
2115 | if (ce->ce_flags & CE_EXTENDED) |
2116 | size = offsetof(struct ondisk_cache_entry_extended, name); | |
2117 | else | |
2118 | size = offsetof(struct ondisk_cache_entry, name); | |
2119 | ||
9d227781 | 2120 | if (!previous_name) { |
ce012deb KW |
2121 | int len = ce_namelen(ce); |
2122 | copy_cache_entry_to_ondisk(ondisk, ce); | |
2123 | result = ce_write(c, fd, ondisk, size); | |
2124 | if (!result) | |
2125 | result = ce_write(c, fd, ce->name, len); | |
2126 | if (!result) | |
2127 | result = ce_write(c, fd, padding, align_padding_size(size, len)); | |
9d227781 JH |
2128 | } else { |
2129 | int common, to_remove, prefix_size; | |
2130 | unsigned char to_remove_vi[16]; | |
2131 | for (common = 0; | |
2132 | (ce->name[common] && | |
2133 | common < previous_name->len && | |
2134 | ce->name[common] == previous_name->buf[common]); | |
2135 | common++) | |
2136 | ; /* still matching */ | |
2137 | to_remove = previous_name->len - common; | |
2138 | prefix_size = encode_varint(to_remove, to_remove_vi); | |
2139 | ||
ce012deb KW |
2140 | copy_cache_entry_to_ondisk(ondisk, ce); |
2141 | result = ce_write(c, fd, ondisk, size); | |
2142 | if (!result) | |
2143 | result = ce_write(c, fd, to_remove_vi, prefix_size); | |
2144 | if (!result) | |
0b90b881 TG |
2145 | result = ce_write(c, fd, ce->name + common, ce_namelen(ce) - common); |
2146 | if (!result) | |
2147 | result = ce_write(c, fd, padding, 1); | |
9d227781 JH |
2148 | |
2149 | strbuf_splice(previous_name, common, to_remove, | |
2150 | ce->name + common, ce_namelen(ce) - common); | |
06aaaa0b | 2151 | } |
b3c96fb1 NTND |
2152 | if (ce->ce_flags & CE_STRIP_NAME) { |
2153 | ce->ce_namelen = saved_namelen; | |
2154 | ce->ce_flags &= ~CE_STRIP_NAME; | |
2155 | } | |
7a51ed66 | 2156 | |
59efba64 | 2157 | return result; |
7a51ed66 LT |
2158 | } |
2159 | ||
426ddeea YM |
2160 | /* |
2161 | * This function verifies if index_state has the correct sha1 of the | |
2162 | * index file. Don't die if we have any other failure, just return 0. | |
2163 | */ | |
2164 | static int verify_index_from(const struct index_state *istate, const char *path) | |
2165 | { | |
2166 | int fd; | |
2167 | ssize_t n; | |
2168 | struct stat st; | |
2169 | unsigned char sha1[20]; | |
2170 | ||
2171 | if (!istate->initialized) | |
2172 | return 0; | |
2173 | ||
2174 | fd = open(path, O_RDONLY); | |
2175 | if (fd < 0) | |
2176 | return 0; | |
2177 | ||
2178 | if (fstat(fd, &st)) | |
2179 | goto out; | |
2180 | ||
2181 | if (st.st_size < sizeof(struct cache_header) + 20) | |
2182 | goto out; | |
2183 | ||
2184 | n = pread_in_full(fd, sha1, 20, st.st_size - 20); | |
2185 | if (n != 20) | |
2186 | goto out; | |
2187 | ||
2188 | if (hashcmp(istate->sha1, sha1)) | |
2189 | goto out; | |
2190 | ||
2191 | close(fd); | |
2192 | return 1; | |
2193 | ||
2194 | out: | |
2195 | close(fd); | |
2196 | return 0; | |
2197 | } | |
2198 | ||
2199 | static int verify_index(const struct index_state *istate) | |
2200 | { | |
2201 | return verify_index_from(istate, get_index_file()); | |
2202 | } | |
2203 | ||
483fbe2b JH |
2204 | static int has_racy_timestamp(struct index_state *istate) |
2205 | { | |
2206 | int entries = istate->cache_nr; | |
2207 | int i; | |
2208 | ||
2209 | for (i = 0; i < entries; i++) { | |
2210 | struct cache_entry *ce = istate->cache[i]; | |
2211 | if (is_racy_timestamp(istate, ce)) | |
2212 | return 1; | |
2213 | } | |
2214 | return 0; | |
2215 | } | |
2216 | ||
ccdc4ec3 JH |
2217 | void update_index_if_able(struct index_state *istate, struct lock_file *lockfile) |
2218 | { | |
483fbe2b | 2219 | if ((istate->cache_changed || has_racy_timestamp(istate)) && |
df60cf57 MÅ |
2220 | verify_index(istate)) |
2221 | write_locked_index(istate, lockfile, COMMIT_LOCK); | |
b74c90fb MÅ |
2222 | else |
2223 | rollback_lock_file(lockfile); | |
ccdc4ec3 JH |
2224 | } |
2225 | ||
812d6b00 MÅ |
2226 | /* |
2227 | * On success, `tempfile` is closed. If it is the temporary file | |
2228 | * of a `struct lock_file`, we will therefore effectively perform | |
2229 | * a 'close_lock_file_gently()`. Since that is an implementation | |
2230 | * detail of lockfiles, callers of `do_write_index()` should not | |
2231 | * rely on it. | |
2232 | */ | |
9f41c7a6 | 2233 | static int do_write_index(struct index_state *istate, struct tempfile *tempfile, |
c18b80a0 | 2234 | int strip_extensions) |
197ee8c9 | 2235 | { |
9f41c7a6 | 2236 | int newfd = tempfile->fd; |
9126f009 | 2237 | git_SHA_CTX c; |
197ee8c9 | 2238 | struct cache_header hdr; |
b50386c7 | 2239 | int i, err = 0, removed, extended, hdr_version; |
4aab5b46 JH |
2240 | struct cache_entry **cache = istate->cache; |
2241 | int entries = istate->cache_nr; | |
e1afca4f | 2242 | struct stat st; |
ce012deb | 2243 | struct ondisk_cache_entry_extended ondisk; |
9d227781 | 2244 | struct strbuf previous_name_buf = STRBUF_INIT, *previous_name; |
4bddd983 | 2245 | int drop_cache_tree = istate->drop_cache_tree; |
025a0709 | 2246 | |
06aaaa0b | 2247 | for (i = removed = extended = 0; i < entries; i++) { |
7a51ed66 | 2248 | if (cache[i]->ce_flags & CE_REMOVE) |
025a0709 | 2249 | removed++; |
197ee8c9 | 2250 | |
06aaaa0b NTND |
2251 | /* reduce extended entries if possible */ |
2252 | cache[i]->ce_flags &= ~CE_EXTENDED; | |
2253 | if (cache[i]->ce_flags & CE_EXTENDED_FLAGS) { | |
2254 | extended++; | |
2255 | cache[i]->ce_flags |= CE_EXTENDED; | |
2256 | } | |
2257 | } | |
2258 | ||
d6e3c181 | 2259 | if (!istate->version) { |
136347d7 | 2260 | istate->version = get_index_format_default(); |
d6e3c181 NTND |
2261 | if (getenv("GIT_TEST_SPLIT_INDEX")) |
2262 | init_split_index(istate); | |
2263 | } | |
9d227781 JH |
2264 | |
2265 | /* demote version 3 to version 2 when the latter suffices */ | |
2266 | if (istate->version == 3 || istate->version == 2) | |
2267 | istate->version = extended ? 3 : 2; | |
2268 | ||
2269 | hdr_version = istate->version; | |
2270 | ||
ccc4feb5 | 2271 | hdr.hdr_signature = htonl(CACHE_SIGNATURE); |
9d227781 | 2272 | hdr.hdr_version = htonl(hdr_version); |
025a0709 | 2273 | hdr.hdr_entries = htonl(entries - removed); |
197ee8c9 | 2274 | |
9126f009 | 2275 | git_SHA1_Init(&c); |
ca9be054 | 2276 | if (ce_write(&c, newfd, &hdr, sizeof(hdr)) < 0) |
197ee8c9 LT |
2277 | return -1; |
2278 | ||
9d227781 | 2279 | previous_name = (hdr_version == 4) ? &previous_name_buf : NULL; |
ce012deb | 2280 | |
197ee8c9 LT |
2281 | for (i = 0; i < entries; i++) { |
2282 | struct cache_entry *ce = cache[i]; | |
7a51ed66 | 2283 | if (ce->ce_flags & CE_REMOVE) |
aa16021e | 2284 | continue; |
e06c43c7 | 2285 | if (!ce_uptodate(ce) && is_racy_timestamp(istate, ce)) |
407c8eb0 | 2286 | ce_smudge_racily_clean_entry(ce); |
99d1a986 | 2287 | if (is_null_oid(&ce->oid)) { |
83bd7437 JK |
2288 | static const char msg[] = "cache entry has null sha1: %s"; |
2289 | static int allow = -1; | |
2290 | ||
2291 | if (allow < 0) | |
2292 | allow = git_env_bool("GIT_ALLOW_NULL_SHA1", 0); | |
2293 | if (allow) | |
2294 | warning(msg, ce->name); | |
2295 | else | |
b50386c7 | 2296 | err = error(msg, ce->name); |
a96d3cc3 JK |
2297 | |
2298 | drop_cache_tree = 1; | |
83bd7437 | 2299 | } |
ce012deb | 2300 | if (ce_write_entry(&c, newfd, ce, previous_name, (struct ondisk_cache_entry *)&ondisk) < 0) |
b50386c7 KW |
2301 | err = -1; |
2302 | ||
2303 | if (err) | |
2304 | break; | |
197ee8c9 | 2305 | } |
9d227781 | 2306 | strbuf_release(&previous_name_buf); |
1af1c2b6 | 2307 | |
b50386c7 KW |
2308 | if (err) |
2309 | return err; | |
2310 | ||
bad68ec9 | 2311 | /* Write extension data here */ |
c18b80a0 | 2312 | if (!strip_extensions && istate->split_index) { |
5fc2fc8f NTND |
2313 | struct strbuf sb = STRBUF_INIT; |
2314 | ||
2315 | err = write_link_extension(&sb, istate) < 0 || | |
2316 | write_index_ext_header(&c, newfd, CACHE_EXT_LINK, | |
2317 | sb.len) < 0 || | |
2318 | ce_write(&c, newfd, sb.buf, sb.len) < 0; | |
2319 | strbuf_release(&sb); | |
2320 | if (err) | |
2321 | return -1; | |
2322 | } | |
a96d3cc3 | 2323 | if (!strip_extensions && !drop_cache_tree && istate->cache_tree) { |
f285a2d7 | 2324 | struct strbuf sb = STRBUF_INIT; |
1dffb8fa | 2325 | |
1dffb8fa PH |
2326 | cache_tree_write(&sb, istate->cache_tree); |
2327 | err = write_index_ext_header(&c, newfd, CACHE_EXT_TREE, sb.len) < 0 | |
2328 | || ce_write(&c, newfd, sb.buf, sb.len) < 0; | |
2329 | strbuf_release(&sb); | |
2330 | if (err) | |
bad68ec9 | 2331 | return -1; |
bad68ec9 | 2332 | } |
c18b80a0 | 2333 | if (!strip_extensions && istate->resolve_undo) { |
cfc5789a JH |
2334 | struct strbuf sb = STRBUF_INIT; |
2335 | ||
2336 | resolve_undo_write(&sb, istate->resolve_undo); | |
2337 | err = write_index_ext_header(&c, newfd, CACHE_EXT_RESOLVE_UNDO, | |
2338 | sb.len) < 0 | |
2339 | || ce_write(&c, newfd, sb.buf, sb.len) < 0; | |
2340 | strbuf_release(&sb); | |
2341 | if (err) | |
2342 | return -1; | |
2343 | } | |
83c094ad NTND |
2344 | if (!strip_extensions && istate->untracked) { |
2345 | struct strbuf sb = STRBUF_INIT; | |
2346 | ||
2347 | write_untracked_extension(&sb, istate->untracked); | |
2348 | err = write_index_ext_header(&c, newfd, CACHE_EXT_UNTRACKED, | |
2349 | sb.len) < 0 || | |
2350 | ce_write(&c, newfd, sb.buf, sb.len) < 0; | |
2351 | strbuf_release(&sb); | |
2352 | if (err) | |
2353 | return -1; | |
2354 | } | |
883e248b BP |
2355 | if (!strip_extensions && istate->fsmonitor_last_update) { |
2356 | struct strbuf sb = STRBUF_INIT; | |
2357 | ||
2358 | write_fsmonitor_extension(&sb, istate); | |
2359 | err = write_index_ext_header(&c, newfd, CACHE_EXT_FSMONITOR, sb.len) < 0 | |
2360 | || ce_write(&c, newfd, sb.buf, sb.len) < 0; | |
2361 | strbuf_release(&sb); | |
2362 | if (err) | |
2363 | return -1; | |
2364 | } | |
e1afca4f | 2365 | |
9f41c7a6 JH |
2366 | if (ce_flush(&c, newfd, istate->sha1)) |
2367 | return -1; | |
49bd0fc2 JK |
2368 | if (close_tempfile_gently(tempfile)) { |
2369 | error(_("could not close '%s'"), tempfile->filename.buf); | |
49bd0fc2 JK |
2370 | return -1; |
2371 | } | |
9f41c7a6 | 2372 | if (stat(tempfile->filename.buf, &st)) |
e1afca4f | 2373 | return -1; |
5bcf109c KB |
2374 | istate->timestamp.sec = (unsigned int)st.st_mtime; |
2375 | istate->timestamp.nsec = ST_MTIME_NSEC(st); | |
e1afca4f | 2376 | return 0; |
197ee8c9 | 2377 | } |
e46bbcf6 | 2378 | |
626f35c8 NTND |
2379 | void set_alternate_index_output(const char *name) |
2380 | { | |
2381 | alternate_index_output = name; | |
2382 | } | |
2383 | ||
2384 | static int commit_locked_index(struct lock_file *lk) | |
2385 | { | |
751baced MH |
2386 | if (alternate_index_output) |
2387 | return commit_lock_file_to(lk, alternate_index_output); | |
2388 | else | |
626f35c8 | 2389 | return commit_lock_file(lk); |
626f35c8 NTND |
2390 | } |
2391 | ||
03b86647 NTND |
2392 | static int do_write_locked_index(struct index_state *istate, struct lock_file *lock, |
2393 | unsigned flags) | |
2394 | { | |
076aa2cb | 2395 | int ret = do_write_index(istate, lock->tempfile, 0); |
03b86647 NTND |
2396 | if (ret) |
2397 | return ret; | |
03b86647 NTND |
2398 | if (flags & COMMIT_LOCK) |
2399 | return commit_locked_index(lock); | |
812d6b00 | 2400 | return close_lock_file_gently(lock); |
03b86647 NTND |
2401 | } |
2402 | ||
5fc2fc8f NTND |
2403 | static int write_split_index(struct index_state *istate, |
2404 | struct lock_file *lock, | |
2405 | unsigned flags) | |
2406 | { | |
2407 | int ret; | |
2408 | prepare_to_write_split_index(istate); | |
2409 | ret = do_write_locked_index(istate, lock, flags); | |
2410 | finish_writing_split_index(istate); | |
2411 | return ret; | |
2412 | } | |
2413 | ||
b9683722 CC |
2414 | static const char *shared_index_expire = "2.weeks.ago"; |
2415 | ||
2416 | static unsigned long get_shared_index_expire_date(void) | |
2417 | { | |
2418 | static unsigned long shared_index_expire_date; | |
2419 | static int shared_index_expire_date_prepared; | |
2420 | ||
2421 | if (!shared_index_expire_date_prepared) { | |
2422 | git_config_get_expiry("splitindex.sharedindexexpire", | |
2423 | &shared_index_expire); | |
2424 | shared_index_expire_date = approxidate(shared_index_expire); | |
2425 | shared_index_expire_date_prepared = 1; | |
2426 | } | |
2427 | ||
2428 | return shared_index_expire_date; | |
2429 | } | |
2430 | ||
2431 | static int should_delete_shared_index(const char *shared_index_path) | |
2432 | { | |
2433 | struct stat st; | |
2434 | unsigned long expiration; | |
2435 | ||
2436 | /* Check timestamp */ | |
2437 | expiration = get_shared_index_expire_date(); | |
2438 | if (!expiration) | |
2439 | return 0; | |
2440 | if (stat(shared_index_path, &st)) | |
78bde923 | 2441 | return error_errno(_("could not stat '%s'"), shared_index_path); |
b9683722 CC |
2442 | if (st.st_mtime > expiration) |
2443 | return 0; | |
2444 | ||
2445 | return 1; | |
2446 | } | |
2447 | ||
2448 | static int clean_shared_index_files(const char *current_hex) | |
2449 | { | |
2450 | struct dirent *de; | |
2451 | DIR *dir = opendir(get_git_dir()); | |
2452 | ||
2453 | if (!dir) | |
2454 | return error_errno(_("unable to open git dir: %s"), get_git_dir()); | |
2455 | ||
2456 | while ((de = readdir(dir)) != NULL) { | |
2457 | const char *sha1_hex; | |
2458 | const char *shared_index_path; | |
2459 | if (!skip_prefix(de->d_name, "sharedindex.", &sha1_hex)) | |
2460 | continue; | |
2461 | if (!strcmp(sha1_hex, current_hex)) | |
2462 | continue; | |
2463 | shared_index_path = git_path("%s", de->d_name); | |
2464 | if (should_delete_shared_index(shared_index_path) > 0 && | |
2465 | unlink(shared_index_path)) | |
2466 | warning_errno(_("unable to unlink: %s"), shared_index_path); | |
2467 | } | |
2468 | closedir(dir); | |
2469 | ||
2470 | return 0; | |
2471 | } | |
2472 | ||
a0a96756 | 2473 | static int write_shared_index(struct index_state *istate, |
59f9d2dd | 2474 | struct tempfile **temp) |
c18b80a0 NTND |
2475 | { |
2476 | struct split_index *si = istate->split_index; | |
076aa2cb | 2477 | int ret; |
c18b80a0 | 2478 | |
c18b80a0 | 2479 | move_cache_to_base_index(istate); |
7db2d08c | 2480 | ret = do_write_index(si->base, *temp, 1); |
59f9d2dd | 2481 | if (ret) |
c18b80a0 | 2482 | return ret; |
7db2d08c | 2483 | ret = adjust_shared_perm(get_tempfile_path(*temp)); |
df801f3f | 2484 | if (ret) { |
7db2d08c | 2485 | error("cannot fix permission bits on %s", get_tempfile_path(*temp)); |
df801f3f CC |
2486 | return ret; |
2487 | } | |
7db2d08c | 2488 | ret = rename_tempfile(temp, |
f6ecc62d | 2489 | git_path("sharedindex.%s", sha1_to_hex(si->base->sha1))); |
b9683722 | 2490 | if (!ret) { |
c18b80a0 | 2491 | hashcpy(si->base_sha1, si->base->sha1); |
b9683722 CC |
2492 | clean_shared_index_files(sha1_to_hex(si->base->sha1)); |
2493 | } | |
2494 | ||
c18b80a0 NTND |
2495 | return ret; |
2496 | } | |
2497 | ||
e6a1dd77 CC |
2498 | static const int default_max_percent_split_change = 20; |
2499 | ||
2500 | static int too_many_not_shared_entries(struct index_state *istate) | |
2501 | { | |
2502 | int i, not_shared = 0; | |
2503 | int max_split = git_config_get_max_percent_split_change(); | |
2504 | ||
2505 | switch (max_split) { | |
2506 | case -1: | |
2507 | /* not or badly configured: use the default value */ | |
2508 | max_split = default_max_percent_split_change; | |
2509 | break; | |
2510 | case 0: | |
2511 | return 1; /* 0% means always write a new shared index */ | |
2512 | case 100: | |
2513 | return 0; /* 100% means never write a new shared index */ | |
2514 | default: | |
2515 | break; /* just use the configured value */ | |
2516 | } | |
2517 | ||
2518 | /* Count not shared entries */ | |
2519 | for (i = 0; i < istate->cache_nr; i++) { | |
2520 | struct cache_entry *ce = istate->cache[i]; | |
2521 | if (!ce->index) | |
2522 | not_shared++; | |
2523 | } | |
2524 | ||
2525 | return (int64_t)istate->cache_nr * max_split < (int64_t)not_shared * 100; | |
2526 | } | |
2527 | ||
03b86647 NTND |
2528 | int write_locked_index(struct index_state *istate, struct lock_file *lock, |
2529 | unsigned flags) | |
2530 | { | |
0d59ffb4 | 2531 | int new_shared_index, ret; |
5fc2fc8f NTND |
2532 | struct split_index *si = istate->split_index; |
2533 | ||
3bd28eb2 AV |
2534 | if (istate->fsmonitor_last_update) |
2535 | fill_fsmonitor_bitmap(istate); | |
2536 | ||
5165dd59 NTND |
2537 | if (!si || alternate_index_output || |
2538 | (istate->cache_changed & ~EXTMASK)) { | |
5fc2fc8f NTND |
2539 | if (si) |
2540 | hashclr(si->base_sha1); | |
df60cf57 MÅ |
2541 | ret = do_write_locked_index(istate, lock, flags); |
2542 | goto out; | |
5fc2fc8f NTND |
2543 | } |
2544 | ||
d6e3c181 NTND |
2545 | if (getenv("GIT_TEST_SPLIT_INDEX")) { |
2546 | int v = si->base_sha1[0]; | |
2547 | if ((v & 15) < 6) | |
2548 | istate->cache_changed |= SPLIT_INDEX_ORDERED; | |
2549 | } | |
e6a1dd77 CC |
2550 | if (too_many_not_shared_entries(istate)) |
2551 | istate->cache_changed |= SPLIT_INDEX_ORDERED; | |
0d59ffb4 CC |
2552 | |
2553 | new_shared_index = istate->cache_changed & SPLIT_INDEX_ORDERED; | |
2554 | ||
2555 | if (new_shared_index) { | |
59f9d2dd NTND |
2556 | struct tempfile *temp; |
2557 | int saved_errno; | |
2558 | ||
2559 | temp = mks_tempfile(git_path("sharedindex_XXXXXX")); | |
2560 | if (!temp) { | |
2561 | hashclr(si->base_sha1); | |
2562 | ret = do_write_locked_index(istate, lock, flags); | |
ef5b3a6c NTND |
2563 | goto out; |
2564 | } | |
2565 | ret = write_shared_index(istate, &temp); | |
59f9d2dd NTND |
2566 | |
2567 | saved_errno = errno; | |
2568 | if (is_tempfile_active(temp)) | |
2569 | delete_tempfile(&temp); | |
2570 | errno = saved_errno; | |
2571 | ||
c18b80a0 | 2572 | if (ret) |
df60cf57 | 2573 | goto out; |
c18b80a0 NTND |
2574 | } |
2575 | ||
0d59ffb4 CC |
2576 | ret = write_split_index(istate, lock, flags); |
2577 | ||
2578 | /* Freshen the shared index only if the split-index was written */ | |
a125a223 TG |
2579 | if (!ret && !new_shared_index) { |
2580 | const char *shared_index = git_path("sharedindex.%s", | |
2581 | sha1_to_hex(si->base_sha1)); | |
2582 | freshen_shared_index(shared_index, 1); | |
2583 | } | |
0d59ffb4 | 2584 | |
df60cf57 MÅ |
2585 | out: |
2586 | if (flags & COMMIT_LOCK) | |
2587 | rollback_lock_file(lock); | |
0d59ffb4 | 2588 | return ret; |
03b86647 NTND |
2589 | } |
2590 | ||
e46bbcf6 MV |
2591 | /* |
2592 | * Read the index file that is potentially unmerged into given | |
63e8dc5b | 2593 | * index_state, dropping any unmerged entries. Returns true if |
e46bbcf6 MV |
2594 | * the index is unmerged. Callers who want to refuse to work |
2595 | * from an unmerged state can call this and check its return value, | |
2596 | * instead of calling read_cache(). | |
2597 | */ | |
2598 | int read_index_unmerged(struct index_state *istate) | |
2599 | { | |
2600 | int i; | |
d1a43f2a | 2601 | int unmerged = 0; |
e46bbcf6 MV |
2602 | |
2603 | read_index(istate); | |
e46bbcf6 MV |
2604 | for (i = 0; i < istate->cache_nr; i++) { |
2605 | struct cache_entry *ce = istate->cache[i]; | |
d1a43f2a JH |
2606 | struct cache_entry *new_ce; |
2607 | int size, len; | |
2608 | ||
2609 | if (!ce_stage(ce)) | |
e46bbcf6 | 2610 | continue; |
d1a43f2a | 2611 | unmerged = 1; |
68c4f6a5 | 2612 | len = ce_namelen(ce); |
d1a43f2a JH |
2613 | size = cache_entry_size(len); |
2614 | new_ce = xcalloc(1, size); | |
d1a43f2a | 2615 | memcpy(new_ce->name, ce->name, len); |
b60e188c TG |
2616 | new_ce->ce_flags = create_ce_flags(0) | CE_CONFLICTED; |
2617 | new_ce->ce_namelen = len; | |
d1a43f2a JH |
2618 | new_ce->ce_mode = ce->ce_mode; |
2619 | if (add_index_entry(istate, new_ce, 0)) | |
2620 | return error("%s: cannot drop to stage #0", | |
5699d17e | 2621 | new_ce->name); |
e46bbcf6 | 2622 | } |
d1a43f2a | 2623 | return unmerged; |
e46bbcf6 | 2624 | } |
041aee31 | 2625 | |
98fa4738 JK |
2626 | /* |
2627 | * Returns 1 if the path is an "other" path with respect to | |
2628 | * the index; that is, the path is not mentioned in the index at all, | |
2629 | * either as a file, a directory with some files in the index, | |
2630 | * or as an unmerged entry. | |
2631 | * | |
2632 | * We helpfully remove a trailing "/" from directories so that | |
2633 | * the output of read_directory can be used as-is. | |
2634 | */ | |
2635 | int index_name_is_other(const struct index_state *istate, const char *name, | |
2636 | int namelen) | |
2637 | { | |
2638 | int pos; | |
2639 | if (namelen && name[namelen - 1] == '/') | |
2640 | namelen--; | |
2641 | pos = index_name_pos(istate, name, namelen); | |
2642 | if (0 <= pos) | |
2643 | return 0; /* exact match */ | |
2644 | pos = -pos - 1; | |
2645 | if (pos < istate->cache_nr) { | |
2646 | struct cache_entry *ce = istate->cache[pos]; | |
2647 | if (ce_namelen(ce) == namelen && | |
2648 | !memcmp(ce->name, name, namelen)) | |
2649 | return 0; /* Yup, this one exists unmerged */ | |
2650 | } | |
2651 | return 1; | |
2652 | } | |
29fb37b2 | 2653 | |
87542508 BW |
2654 | void *read_blob_data_from_index(const struct index_state *istate, |
2655 | const char *path, unsigned long *size) | |
29fb37b2 LF |
2656 | { |
2657 | int pos, len; | |
2658 | unsigned long sz; | |
2659 | enum object_type type; | |
2660 | void *data; | |
2661 | ||
2662 | len = strlen(path); | |
2663 | pos = index_name_pos(istate, path, len); | |
2664 | if (pos < 0) { | |
2665 | /* | |
2666 | * We might be in the middle of a merge, in which | |
2667 | * case we would read stage #2 (ours). | |
2668 | */ | |
2669 | int i; | |
2670 | for (i = -pos - 1; | |
2671 | (pos < 0 && i < istate->cache_nr && | |
2672 | !strcmp(istate->cache[i]->name, path)); | |
2673 | i++) | |
2674 | if (ce_stage(istate->cache[i]) == 2) | |
2675 | pos = i; | |
2676 | } | |
2677 | if (pos < 0) | |
2678 | return NULL; | |
99d1a986 | 2679 | data = read_sha1_file(istate->cache[pos]->oid.hash, &type, &sz); |
29fb37b2 LF |
2680 | if (!data || type != OBJ_BLOB) { |
2681 | free(data); | |
2682 | return NULL; | |
2683 | } | |
ff366825 LF |
2684 | if (size) |
2685 | *size = sz; | |
29fb37b2 LF |
2686 | return data; |
2687 | } | |
38612532 MH |
2688 | |
2689 | void stat_validity_clear(struct stat_validity *sv) | |
2690 | { | |
6a83d902 | 2691 | FREE_AND_NULL(sv->sd); |
38612532 MH |
2692 | } |
2693 | ||
2694 | int stat_validity_check(struct stat_validity *sv, const char *path) | |
2695 | { | |
2696 | struct stat st; | |
2697 | ||
2698 | if (stat(path, &st) < 0) | |
2699 | return sv->sd == NULL; | |
2700 | if (!sv->sd) | |
2701 | return 0; | |
2702 | return S_ISREG(st.st_mode) && !match_stat_data(sv->sd, &st); | |
2703 | } | |
2704 | ||
2705 | void stat_validity_update(struct stat_validity *sv, int fd) | |
2706 | { | |
2707 | struct stat st; | |
2708 | ||
2709 | if (fstat(fd, &st) < 0 || !S_ISREG(st.st_mode)) | |
2710 | stat_validity_clear(sv); | |
2711 | else { | |
2712 | if (!sv->sd) | |
2713 | sv->sd = xcalloc(1, sizeof(struct stat_data)); | |
2714 | fill_stat_data(sv->sd, &st); | |
2715 | } | |
2716 | } | |
edf3b905 DT |
2717 | |
2718 | void move_index_extensions(struct index_state *dst, struct index_state *src) | |
2719 | { | |
2720 | dst->untracked = src->untracked; | |
2721 | src->untracked = NULL; | |
2722 | } |