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