Line | Count | Source (jump to first uncovered line) |
1 | | #define USE_THE_REPOSITORY_VARIABLE |
2 | | |
3 | | #include "git-compat-util.h" |
4 | | #include "object-store-ll.h" |
5 | | #include "dir.h" |
6 | | #include "environment.h" |
7 | | #include "gettext.h" |
8 | | #include "hex.h" |
9 | | #include "name-hash.h" |
10 | | #include "sparse-index.h" |
11 | | #include "streaming.h" |
12 | | #include "submodule.h" |
13 | | #include "symlinks.h" |
14 | | #include "progress.h" |
15 | | #include "fsmonitor.h" |
16 | | #include "entry.h" |
17 | | #include "parallel-checkout.h" |
18 | | |
19 | | static void create_directories(const char *path, int path_len, |
20 | | const struct checkout *state) |
21 | 0 | { |
22 | 0 | char *buf = xmallocz(path_len); |
23 | 0 | int len = 0; |
24 | |
|
25 | 0 | while (len < path_len) { |
26 | 0 | do { |
27 | 0 | buf[len] = path[len]; |
28 | 0 | len++; |
29 | 0 | } while (len < path_len && path[len] != '/'); |
30 | 0 | if (len >= path_len) |
31 | 0 | break; |
32 | 0 | buf[len] = 0; |
33 | | |
34 | | /* |
35 | | * For 'checkout-index --prefix=<dir>', <dir> is |
36 | | * allowed to be a symlink to an existing directory, |
37 | | * and we set 'state->base_dir_len' below, such that |
38 | | * we test the path components of the prefix with the |
39 | | * stat() function instead of the lstat() function. |
40 | | */ |
41 | 0 | if (has_dirs_only_path(buf, len, state->base_dir_len)) |
42 | 0 | continue; /* ok, it is already a directory. */ |
43 | | |
44 | | /* |
45 | | * If this mkdir() would fail, it could be that there |
46 | | * is already a symlink or something else exists |
47 | | * there, therefore we then try to unlink it and try |
48 | | * one more time to create the directory. |
49 | | */ |
50 | 0 | if (mkdir(buf, 0777)) { |
51 | 0 | if (errno == EEXIST && state->force && |
52 | 0 | !unlink_or_warn(buf) && !mkdir(buf, 0777)) |
53 | 0 | continue; |
54 | 0 | die_errno("cannot create directory at '%s'", buf); |
55 | 0 | } |
56 | 0 | } |
57 | 0 | free(buf); |
58 | 0 | } |
59 | | |
60 | | static void remove_subtree(struct strbuf *path) |
61 | 0 | { |
62 | 0 | DIR *dir = opendir(path->buf); |
63 | 0 | struct dirent *de; |
64 | 0 | int origlen = path->len; |
65 | |
|
66 | 0 | if (!dir) |
67 | 0 | die_errno("cannot opendir '%s'", path->buf); |
68 | 0 | while ((de = readdir_skip_dot_and_dotdot(dir)) != NULL) { |
69 | 0 | struct stat st; |
70 | |
|
71 | 0 | strbuf_addch(path, '/'); |
72 | 0 | strbuf_addstr(path, de->d_name); |
73 | 0 | if (lstat(path->buf, &st)) |
74 | 0 | die_errno("cannot lstat '%s'", path->buf); |
75 | 0 | if (S_ISDIR(st.st_mode)) |
76 | 0 | remove_subtree(path); |
77 | 0 | else if (unlink(path->buf)) |
78 | 0 | die_errno("cannot unlink '%s'", path->buf); |
79 | 0 | strbuf_setlen(path, origlen); |
80 | 0 | } |
81 | 0 | closedir(dir); |
82 | 0 | if (rmdir(path->buf)) |
83 | 0 | die_errno("cannot rmdir '%s'", path->buf); |
84 | 0 | } |
85 | | |
86 | | static int create_file(const char *path, unsigned int mode) |
87 | 0 | { |
88 | 0 | mode = (mode & 0100) ? 0777 : 0666; |
89 | 0 | return open(path, O_WRONLY | O_CREAT | O_EXCL, mode); |
90 | 0 | } |
91 | | |
92 | | void *read_blob_entry(const struct cache_entry *ce, size_t *size) |
93 | 0 | { |
94 | 0 | enum object_type type; |
95 | 0 | unsigned long ul; |
96 | 0 | void *blob_data = repo_read_object_file(the_repository, &ce->oid, |
97 | 0 | &type, &ul); |
98 | |
|
99 | 0 | *size = ul; |
100 | 0 | if (blob_data) { |
101 | 0 | if (type == OBJ_BLOB) |
102 | 0 | return blob_data; |
103 | 0 | free(blob_data); |
104 | 0 | } |
105 | 0 | return NULL; |
106 | 0 | } |
107 | | |
108 | | static int open_output_fd(char *path, const struct cache_entry *ce, int to_tempfile) |
109 | 0 | { |
110 | 0 | int symlink = (ce->ce_mode & S_IFMT) != S_IFREG; |
111 | 0 | if (to_tempfile) { |
112 | 0 | xsnprintf(path, TEMPORARY_FILENAME_LENGTH, "%s", |
113 | 0 | symlink ? ".merge_link_XXXXXX" : ".merge_file_XXXXXX"); |
114 | 0 | return mkstemp(path); |
115 | 0 | } else { |
116 | 0 | return create_file(path, !symlink ? ce->ce_mode : 0666); |
117 | 0 | } |
118 | 0 | } |
119 | | |
120 | | int fstat_checkout_output(int fd, const struct checkout *state, struct stat *st) |
121 | 0 | { |
122 | | /* use fstat() only when path == ce->name */ |
123 | 0 | if (fstat_is_reliable() && |
124 | 0 | state->refresh_cache && !state->base_dir_len) { |
125 | 0 | return !fstat(fd, st); |
126 | 0 | } |
127 | 0 | return 0; |
128 | 0 | } |
129 | | |
130 | | static int streaming_write_entry(const struct cache_entry *ce, char *path, |
131 | | struct stream_filter *filter, |
132 | | const struct checkout *state, int to_tempfile, |
133 | | int *fstat_done, struct stat *statbuf) |
134 | 0 | { |
135 | 0 | int result = 0; |
136 | 0 | int fd; |
137 | |
|
138 | 0 | fd = open_output_fd(path, ce, to_tempfile); |
139 | 0 | if (fd < 0) |
140 | 0 | return -1; |
141 | | |
142 | 0 | result |= stream_blob_to_fd(fd, &ce->oid, filter, 1); |
143 | 0 | *fstat_done = fstat_checkout_output(fd, state, statbuf); |
144 | 0 | result |= close(fd); |
145 | |
|
146 | 0 | if (result) |
147 | 0 | unlink(path); |
148 | 0 | return result; |
149 | 0 | } |
150 | | |
151 | | void enable_delayed_checkout(struct checkout *state) |
152 | 0 | { |
153 | 0 | if (!state->delayed_checkout) { |
154 | 0 | state->delayed_checkout = xmalloc(sizeof(*state->delayed_checkout)); |
155 | 0 | state->delayed_checkout->state = CE_CAN_DELAY; |
156 | 0 | string_list_init_nodup(&state->delayed_checkout->filters); |
157 | 0 | string_list_init_nodup(&state->delayed_checkout->paths); |
158 | 0 | } |
159 | 0 | } |
160 | | |
161 | | static int remove_available_paths(struct string_list_item *item, void *cb_data) |
162 | 0 | { |
163 | 0 | struct string_list *available_paths = cb_data; |
164 | 0 | struct string_list_item *available; |
165 | |
|
166 | 0 | available = string_list_lookup(available_paths, item->string); |
167 | 0 | if (available) |
168 | 0 | available->util = item->util; |
169 | 0 | return !available; |
170 | 0 | } |
171 | | |
172 | | static int string_is_not_null(struct string_list_item *item, void *data UNUSED) |
173 | 0 | { |
174 | 0 | return !!item->string; |
175 | 0 | } |
176 | | |
177 | | int finish_delayed_checkout(struct checkout *state, int show_progress) |
178 | 0 | { |
179 | 0 | int errs = 0; |
180 | 0 | unsigned processed_paths = 0; |
181 | 0 | off_t filtered_bytes = 0; |
182 | 0 | struct string_list_item *filter, *path; |
183 | 0 | struct progress *progress = NULL; |
184 | 0 | struct delayed_checkout *dco = state->delayed_checkout; |
185 | |
|
186 | 0 | if (!state->delayed_checkout) |
187 | 0 | return errs; |
188 | | |
189 | 0 | dco->state = CE_RETRY; |
190 | 0 | if (show_progress) |
191 | 0 | progress = start_delayed_progress(_("Filtering content"), dco->paths.nr); |
192 | 0 | while (dco->filters.nr > 0) { |
193 | 0 | for_each_string_list_item(filter, &dco->filters) { |
194 | 0 | struct string_list available_paths = STRING_LIST_INIT_DUP; |
195 | |
|
196 | 0 | if (!async_query_available_blobs(filter->string, &available_paths)) { |
197 | | /* Filter reported an error */ |
198 | 0 | errs = 1; |
199 | 0 | filter->string = NULL; |
200 | 0 | continue; |
201 | 0 | } |
202 | 0 | if (available_paths.nr <= 0) { |
203 | | /* |
204 | | * Filter responded with no entries. That means |
205 | | * the filter is done and we can remove the |
206 | | * filter from the list (see |
207 | | * "string_list_remove_empty_items" call below). |
208 | | */ |
209 | 0 | filter->string = NULL; |
210 | 0 | continue; |
211 | 0 | } |
212 | | |
213 | | /* |
214 | | * In dco->paths we store a list of all delayed paths. |
215 | | * The filter just send us a list of available paths. |
216 | | * Remove them from the list. |
217 | | */ |
218 | 0 | filter_string_list(&dco->paths, 0, |
219 | 0 | &remove_available_paths, &available_paths); |
220 | |
|
221 | 0 | for_each_string_list_item(path, &available_paths) { |
222 | 0 | struct cache_entry* ce; |
223 | |
|
224 | 0 | if (!path->util) { |
225 | 0 | error("external filter '%s' signaled that '%s' " |
226 | 0 | "is now available although it has not been " |
227 | 0 | "delayed earlier", |
228 | 0 | filter->string, path->string); |
229 | 0 | errs |= 1; |
230 | | |
231 | | /* |
232 | | * Do not ask the filter for available blobs, |
233 | | * again, as the filter is likely buggy. |
234 | | */ |
235 | 0 | filter->string = NULL; |
236 | 0 | continue; |
237 | 0 | } |
238 | 0 | ce = index_file_exists(state->istate, path->string, |
239 | 0 | strlen(path->string), 0); |
240 | 0 | if (ce) { |
241 | 0 | display_progress(progress, ++processed_paths); |
242 | 0 | errs |= checkout_entry(ce, state, NULL, path->util); |
243 | 0 | filtered_bytes += ce->ce_stat_data.sd_size; |
244 | 0 | display_throughput(progress, filtered_bytes); |
245 | 0 | } else |
246 | 0 | errs = 1; |
247 | 0 | } |
248 | |
|
249 | 0 | string_list_clear(&available_paths, 0); |
250 | 0 | } |
251 | |
|
252 | 0 | filter_string_list(&dco->filters, 0, string_is_not_null, NULL); |
253 | 0 | } |
254 | 0 | stop_progress(&progress); |
255 | 0 | string_list_clear(&dco->filters, 0); |
256 | | |
257 | | /* At this point we should not have any delayed paths anymore. */ |
258 | 0 | errs |= dco->paths.nr; |
259 | 0 | for_each_string_list_item(path, &dco->paths) { |
260 | 0 | error("'%s' was not filtered properly", path->string); |
261 | 0 | } |
262 | 0 | string_list_clear(&dco->paths, 0); |
263 | |
|
264 | 0 | free(dco); |
265 | 0 | state->delayed_checkout = NULL; |
266 | |
|
267 | 0 | return errs; |
268 | 0 | } |
269 | | |
270 | | void update_ce_after_write(const struct checkout *state, struct cache_entry *ce, |
271 | | struct stat *st) |
272 | 0 | { |
273 | 0 | if (state->refresh_cache) { |
274 | 0 | assert(state->istate); |
275 | 0 | fill_stat_cache_info(state->istate, ce, st); |
276 | 0 | ce->ce_flags |= CE_UPDATE_IN_BASE; |
277 | 0 | mark_fsmonitor_invalid(state->istate, ce); |
278 | 0 | state->istate->cache_changed |= CE_ENTRY_CHANGED; |
279 | 0 | } |
280 | 0 | } |
281 | | |
282 | | /* Note: ca is used (and required) iff the entry refers to a regular file. */ |
283 | | static int write_entry(struct cache_entry *ce, char *path, struct conv_attrs *ca, |
284 | | const struct checkout *state, int to_tempfile, |
285 | | int *nr_checkouts) |
286 | 0 | { |
287 | 0 | unsigned int ce_mode_s_ifmt = ce->ce_mode & S_IFMT; |
288 | 0 | struct delayed_checkout *dco = state->delayed_checkout; |
289 | 0 | int fd, ret, fstat_done = 0; |
290 | 0 | char *new_blob; |
291 | 0 | struct strbuf buf = STRBUF_INIT; |
292 | 0 | size_t size; |
293 | 0 | ssize_t wrote; |
294 | 0 | size_t newsize = 0; |
295 | 0 | struct stat st; |
296 | 0 | const struct submodule *sub; |
297 | 0 | struct checkout_metadata meta; |
298 | 0 | static int scratch_nr_checkouts; |
299 | |
|
300 | 0 | clone_checkout_metadata(&meta, &state->meta, &ce->oid); |
301 | |
|
302 | 0 | if (ce_mode_s_ifmt == S_IFREG) { |
303 | 0 | struct stream_filter *filter = get_stream_filter_ca(ca, &ce->oid); |
304 | 0 | if (filter && |
305 | 0 | !streaming_write_entry(ce, path, filter, |
306 | 0 | state, to_tempfile, |
307 | 0 | &fstat_done, &st)) |
308 | 0 | goto finish; |
309 | 0 | } |
310 | | |
311 | 0 | switch (ce_mode_s_ifmt) { |
312 | 0 | case S_IFLNK: |
313 | 0 | new_blob = read_blob_entry(ce, &size); |
314 | 0 | if (!new_blob) |
315 | 0 | return error("unable to read sha1 file of %s (%s)", |
316 | 0 | ce->name, oid_to_hex(&ce->oid)); |
317 | | |
318 | | /* |
319 | | * We can't make a real symlink; write out a regular file entry |
320 | | * with the symlink destination as its contents. |
321 | | */ |
322 | 0 | if (!has_symlinks || to_tempfile) |
323 | 0 | goto write_file_entry; |
324 | | |
325 | 0 | ret = symlink(new_blob, path); |
326 | 0 | free(new_blob); |
327 | 0 | if (ret) |
328 | 0 | return error_errno("unable to create symlink %s", path); |
329 | 0 | break; |
330 | | |
331 | 0 | case S_IFREG: |
332 | | /* |
333 | | * We do not send the blob in case of a retry, so do not |
334 | | * bother reading it at all. |
335 | | */ |
336 | 0 | if (dco && dco->state == CE_RETRY) { |
337 | 0 | new_blob = NULL; |
338 | 0 | size = 0; |
339 | 0 | } else { |
340 | 0 | new_blob = read_blob_entry(ce, &size); |
341 | 0 | if (!new_blob) |
342 | 0 | return error("unable to read sha1 file of %s (%s)", |
343 | 0 | ce->name, oid_to_hex(&ce->oid)); |
344 | 0 | } |
345 | | |
346 | | /* |
347 | | * Convert from git internal format to working tree format |
348 | | */ |
349 | 0 | if (dco && dco->state != CE_NO_DELAY) { |
350 | 0 | ret = async_convert_to_working_tree_ca(ca, ce->name, |
351 | 0 | new_blob, size, |
352 | 0 | &buf, &meta, dco); |
353 | 0 | if (ret) { |
354 | 0 | struct string_list_item *item = |
355 | 0 | string_list_lookup(&dco->paths, ce->name); |
356 | 0 | if (item) { |
357 | 0 | item->util = nr_checkouts ? nr_checkouts |
358 | 0 | : &scratch_nr_checkouts; |
359 | 0 | free(new_blob); |
360 | 0 | goto delayed; |
361 | 0 | } |
362 | 0 | } |
363 | 0 | } else { |
364 | 0 | ret = convert_to_working_tree_ca(ca, ce->name, new_blob, |
365 | 0 | size, &buf, &meta); |
366 | 0 | } |
367 | | |
368 | 0 | if (ret) { |
369 | 0 | free(new_blob); |
370 | 0 | new_blob = strbuf_detach(&buf, &newsize); |
371 | 0 | size = newsize; |
372 | 0 | } |
373 | | /* |
374 | | * No "else" here as errors from convert are OK at this |
375 | | * point. If the error would have been fatal (e.g. |
376 | | * filter is required), then we would have died already. |
377 | | */ |
378 | |
|
379 | 0 | write_file_entry: |
380 | 0 | fd = open_output_fd(path, ce, to_tempfile); |
381 | 0 | if (fd < 0) { |
382 | 0 | free(new_blob); |
383 | 0 | return error_errno("unable to create file %s", path); |
384 | 0 | } |
385 | | |
386 | 0 | wrote = write_in_full(fd, new_blob, size); |
387 | 0 | if (!to_tempfile) |
388 | 0 | fstat_done = fstat_checkout_output(fd, state, &st); |
389 | 0 | close(fd); |
390 | 0 | free(new_blob); |
391 | 0 | if (wrote < 0) |
392 | 0 | return error("unable to write file %s", path); |
393 | 0 | break; |
394 | | |
395 | 0 | case S_IFGITLINK: |
396 | 0 | if (to_tempfile) |
397 | 0 | return error("cannot create temporary submodule %s", ce->name); |
398 | 0 | if (mkdir(path, 0777) < 0) |
399 | 0 | return error("cannot create submodule directory %s", path); |
400 | 0 | sub = submodule_from_ce(ce); |
401 | 0 | if (sub) |
402 | 0 | return submodule_move_head(ce->name, state->super_prefix, |
403 | 0 | NULL, oid_to_hex(&ce->oid), |
404 | 0 | state->force ? SUBMODULE_MOVE_HEAD_FORCE : 0); |
405 | 0 | break; |
406 | | |
407 | 0 | default: |
408 | 0 | return error("unknown file mode for %s in index", ce->name); |
409 | 0 | } |
410 | | |
411 | 0 | finish: |
412 | 0 | if (state->refresh_cache) { |
413 | 0 | if (!fstat_done && lstat(ce->name, &st) < 0) |
414 | 0 | return error_errno("unable to stat just-written file %s", |
415 | 0 | ce->name); |
416 | 0 | update_ce_after_write(state, ce , &st); |
417 | 0 | } |
418 | 0 | if (nr_checkouts) |
419 | 0 | (*nr_checkouts)++; |
420 | 0 | delayed: |
421 | 0 | return 0; |
422 | 0 | } |
423 | | |
424 | | /* |
425 | | * This is like 'lstat()', except it refuses to follow symlinks |
426 | | * in the path, after skipping "skiplen". |
427 | | */ |
428 | | static int check_path(const char *path, int len, struct stat *st, int skiplen) |
429 | 0 | { |
430 | 0 | const char *slash = path + len; |
431 | |
|
432 | 0 | while (path < slash && *slash != '/') |
433 | 0 | slash--; |
434 | 0 | if (!has_dirs_only_path(path, slash - path, skiplen)) { |
435 | 0 | errno = ENOENT; |
436 | 0 | return -1; |
437 | 0 | } |
438 | 0 | return lstat(path, st); |
439 | 0 | } |
440 | | |
441 | | static void mark_colliding_entries(const struct checkout *state, |
442 | | struct cache_entry *ce, struct stat *st) |
443 | 0 | { |
444 | 0 | int i, trust_ino = check_stat; |
445 | |
|
446 | | #if defined(GIT_WINDOWS_NATIVE) || defined(__CYGWIN__) |
447 | | trust_ino = 0; |
448 | | #endif |
449 | |
|
450 | 0 | ce->ce_flags |= CE_MATCHED; |
451 | | |
452 | | /* TODO: audit for interaction with sparse-index. */ |
453 | 0 | ensure_full_index(state->istate); |
454 | 0 | for (i = 0; i < state->istate->cache_nr; i++) { |
455 | 0 | struct cache_entry *dup = state->istate->cache[i]; |
456 | |
|
457 | 0 | if (dup == ce) { |
458 | | /* |
459 | | * Parallel checkout doesn't create the files in index |
460 | | * order. So the other side of the collision may appear |
461 | | * after the given cache_entry in the array. |
462 | | */ |
463 | 0 | if (parallel_checkout_status() == PC_RUNNING) |
464 | 0 | continue; |
465 | 0 | else |
466 | 0 | break; |
467 | 0 | } |
468 | | |
469 | 0 | if (dup->ce_flags & (CE_MATCHED | CE_VALID | CE_SKIP_WORKTREE)) |
470 | 0 | continue; |
471 | | |
472 | 0 | if ((trust_ino && !match_stat_data(&dup->ce_stat_data, st)) || |
473 | 0 | paths_collide(ce->name, dup->name)) { |
474 | 0 | dup->ce_flags |= CE_MATCHED; |
475 | 0 | break; |
476 | 0 | } |
477 | 0 | } |
478 | 0 | } |
479 | | |
480 | | int checkout_entry_ca(struct cache_entry *ce, struct conv_attrs *ca, |
481 | | const struct checkout *state, char *topath, |
482 | | int *nr_checkouts) |
483 | 0 | { |
484 | 0 | static struct strbuf path = STRBUF_INIT; |
485 | 0 | struct stat st; |
486 | 0 | struct conv_attrs ca_buf; |
487 | |
|
488 | 0 | if (ce->ce_flags & CE_WT_REMOVE) { |
489 | 0 | if (topath) |
490 | | /* |
491 | | * No content and thus no path to create, so we have |
492 | | * no pathname to return. |
493 | | */ |
494 | 0 | BUG("Can't remove entry to a path"); |
495 | 0 | unlink_entry(ce, state->super_prefix); |
496 | 0 | return 0; |
497 | 0 | } |
498 | | |
499 | 0 | if (topath) { |
500 | 0 | if (S_ISREG(ce->ce_mode) && !ca) { |
501 | 0 | convert_attrs(state->istate, &ca_buf, ce->name); |
502 | 0 | ca = &ca_buf; |
503 | 0 | } |
504 | 0 | return write_entry(ce, topath, ca, state, 1, nr_checkouts); |
505 | 0 | } |
506 | | |
507 | 0 | strbuf_reset(&path); |
508 | 0 | strbuf_add(&path, state->base_dir, state->base_dir_len); |
509 | 0 | strbuf_add(&path, ce->name, ce_namelen(ce)); |
510 | |
|
511 | 0 | if (!check_path(path.buf, path.len, &st, state->base_dir_len)) { |
512 | 0 | const struct submodule *sub; |
513 | 0 | unsigned changed = ie_match_stat(state->istate, ce, &st, |
514 | 0 | CE_MATCH_IGNORE_VALID | CE_MATCH_IGNORE_SKIP_WORKTREE); |
515 | | /* |
516 | | * Needs to be checked before !changed returns early, |
517 | | * as the possibly empty directory was not changed |
518 | | */ |
519 | 0 | sub = submodule_from_ce(ce); |
520 | 0 | if (sub) { |
521 | 0 | int err; |
522 | 0 | if (!is_submodule_populated_gently(ce->name, &err)) { |
523 | 0 | struct stat sb; |
524 | 0 | if (lstat(ce->name, &sb)) |
525 | 0 | die(_("could not stat file '%s'"), ce->name); |
526 | 0 | if (!(st.st_mode & S_IFDIR)) |
527 | 0 | unlink_or_warn(ce->name); |
528 | |
|
529 | 0 | return submodule_move_head(ce->name, state->super_prefix, |
530 | 0 | NULL, oid_to_hex(&ce->oid), 0); |
531 | 0 | } else |
532 | 0 | return submodule_move_head(ce->name, state->super_prefix, |
533 | 0 | "HEAD", oid_to_hex(&ce->oid), |
534 | 0 | state->force ? SUBMODULE_MOVE_HEAD_FORCE : 0); |
535 | 0 | } |
536 | | |
537 | 0 | if (!changed) |
538 | 0 | return 0; |
539 | 0 | if (!state->force) { |
540 | 0 | if (!state->quiet) |
541 | 0 | fprintf(stderr, |
542 | 0 | "%s already exists, no checkout\n", |
543 | 0 | path.buf); |
544 | 0 | return -1; |
545 | 0 | } |
546 | | |
547 | 0 | if (state->clone) |
548 | 0 | mark_colliding_entries(state, ce, &st); |
549 | | |
550 | | /* |
551 | | * We unlink the old file, to get the new one with the |
552 | | * right permissions (including umask, which is nasty |
553 | | * to emulate by hand - much easier to let the system |
554 | | * just do the right thing) |
555 | | */ |
556 | 0 | if (S_ISDIR(st.st_mode)) { |
557 | | /* If it is a gitlink, leave it alone! */ |
558 | 0 | if (S_ISGITLINK(ce->ce_mode)) |
559 | 0 | return 0; |
560 | | /* |
561 | | * We must avoid replacing submodules' leading |
562 | | * directories with symbolic links, lest recursive |
563 | | * clones can write into arbitrary locations. |
564 | | * |
565 | | * Technically, this logic is not limited |
566 | | * to recursive clones, or for that matter to |
567 | | * submodules' paths colliding with symbolic links' |
568 | | * paths. Yet it strikes a balance in favor of |
569 | | * simplicity, and if paths are colliding, we might |
570 | | * just as well keep the directories during a clone. |
571 | | */ |
572 | 0 | if (state->clone && S_ISLNK(ce->ce_mode)) |
573 | 0 | return 0; |
574 | 0 | remove_subtree(&path); |
575 | 0 | } else if (unlink(path.buf)) |
576 | 0 | return error_errno("unable to unlink old '%s'", path.buf); |
577 | 0 | } else if (state->not_new) |
578 | 0 | return 0; |
579 | | |
580 | 0 | create_directories(path.buf, path.len, state); |
581 | |
|
582 | 0 | if (S_ISREG(ce->ce_mode) && !ca) { |
583 | 0 | convert_attrs(state->istate, &ca_buf, ce->name); |
584 | 0 | ca = &ca_buf; |
585 | 0 | } |
586 | |
|
587 | 0 | if (!enqueue_checkout(ce, ca, nr_checkouts)) |
588 | 0 | return 0; |
589 | | |
590 | 0 | return write_entry(ce, path.buf, ca, state, 0, nr_checkouts); |
591 | 0 | } |
592 | | |
593 | | void unlink_entry(const struct cache_entry *ce, const char *super_prefix) |
594 | 0 | { |
595 | 0 | const struct submodule *sub = submodule_from_ce(ce); |
596 | 0 | if (sub) { |
597 | | /* state.force is set at the caller. */ |
598 | 0 | submodule_move_head(ce->name, super_prefix, "HEAD", NULL, |
599 | 0 | SUBMODULE_MOVE_HEAD_FORCE); |
600 | 0 | } |
601 | 0 | if (check_leading_path(ce->name, ce_namelen(ce), 1) >= 0) |
602 | 0 | return; |
603 | 0 | if (remove_or_warn(ce->ce_mode, ce->name)) |
604 | 0 | return; |
605 | 0 | schedule_dir_for_removal(ce->name, ce_namelen(ce)); |
606 | 0 | } |
607 | | |
608 | | int remove_or_warn(unsigned int mode, const char *file) |
609 | 0 | { |
610 | 0 | return S_ISGITLINK(mode) ? rmdir_or_warn(file) : unlink_or_warn(file); |
611 | 0 | } |