]>
Commit | Line | Data |
---|---|---|
be3cfa85 JH |
1 | /* |
2 | * Copyright (C) 2005 Junio C Hamano | |
3 | */ | |
bc5c5ec0 | 4 | #include "git-compat-util.h" |
6973dcae | 5 | #include "commit.h" |
86436c28 | 6 | #include "diff.h" |
427dcb4b | 7 | #include "diffcore.h" |
f394e093 | 8 | #include "gettext.h" |
df6e8744 | 9 | #include "hash.h" |
41771fa4 | 10 | #include "hex.h" |
dabab1d6 | 11 | #include "object-name.h" |
08c46a49 | 12 | #include "read-cache.h" |
6973dcae | 13 | #include "revision.h" |
1cfe7733 | 14 | #include "cache-tree.h" |
d1f2d7e8 | 15 | #include "unpack-trees.h" |
948dd346 | 16 | #include "refs.h" |
df6e8744 | 17 | #include "repository.h" |
ee6fc514 | 18 | #include "submodule.h" |
cb2a5135 | 19 | #include "symlinks.h" |
74ea5c95 | 20 | #include "trace.h" |
429bb40a | 21 | #include "dir.h" |
883e248b | 22 | #include "fsmonitor.h" |
177a8302 | 23 | #include "commit-reach.h" |
427dcb4b | 24 | |
b46f0b6d | 25 | /* |
6973dcae | 26 | * diff-files |
b46f0b6d | 27 | */ |
f0c6b2a2 | 28 | |
948dd346 | 29 | /* |
1392a377 JH |
30 | * Has the work tree entity been removed? |
31 | * | |
32 | * Return 1 if it was removed from the work tree, 0 if an entity to be | |
33 | * compared with the cache entry ce still exists (the latter includes | |
34 | * the case where a directory that is not a submodule repository | |
35 | * exists for ce that is a submodule -- it is a submodule that is not | |
36 | * checked out). Return negative for an error. | |
948dd346 | 37 | */ |
6a044a20 | 38 | static int check_removed(const struct cache_entry *ce, struct stat *st) |
948dd346 | 39 | { |
811c9c21 JH |
40 | int stat_err; |
41 | ||
42 | if (!(ce->ce_flags & CE_FSMONITOR_VALID)) | |
43 | stat_err = lstat(ce->name, st); | |
44 | else | |
45 | stat_err = fake_lstat(ce, st); | |
46 | if (stat_err < 0) { | |
c7054209 | 47 | if (!is_missing_file_error(errno)) |
948dd346 JH |
48 | return -1; |
49 | return 1; | |
50 | } | |
6a044a20 | 51 | |
57199892 | 52 | if (has_symlink_leading_path(ce->name, ce_namelen(ce))) |
948dd346 JH |
53 | return 1; |
54 | if (S_ISDIR(st->st_mode)) { | |
1053fe82 | 55 | struct object_id sub; |
1392a377 JH |
56 | |
57 | /* | |
58 | * If ce is already a gitlink, we can have a plain | |
59 | * directory (i.e. the submodule is not checked out), | |
60 | * or a checked out submodule. Either case this is not | |
61 | * a case where something was removed from the work tree, | |
62 | * so we will return 0. | |
63 | * | |
64 | * Otherwise, if the directory is not a submodule | |
65 | * repository, that means ce which was a blob turned into | |
66 | * a directory --- the blob was removed! | |
67 | */ | |
68 | if (!S_ISGITLINK(ce->ce_mode) && | |
a98e6101 | 69 | resolve_gitlink_ref(ce->name, "HEAD", &sub)) |
948dd346 JH |
70 | return 1; |
71 | } | |
72 | return 0; | |
73 | } | |
d516c2d1 | 74 | |
ae6d5c1b JL |
75 | /* |
76 | * Has a file changed or has a submodule new commits or a dirty work tree? | |
77 | * | |
78 | * Return 1 when changes are detected, 0 otherwise. If the DIRTY_SUBMODULES | |
79 | * option is set, the caller does not only want to know if a submodule is | |
80 | * modified at all but wants to know all the conditions that are met (new | |
81 | * commits, untracked content and/or modified content). | |
82 | */ | |
83 | static int match_stat_with_submodule(struct diff_options *diffopt, | |
eb9ae4b5 RS |
84 | const struct cache_entry *ce, |
85 | struct stat *st, unsigned ce_option, | |
86 | unsigned *dirty_submodule) | |
ae6d5c1b | 87 | { |
5adbb403 | 88 | int changed = ie_match_stat(diffopt->repo->index, ce, st, ce_option); |
aee9c7d6 | 89 | if (S_ISGITLINK(ce->ce_mode)) { |
02f2f56b | 90 | struct diff_flags orig_flags = diffopt->flags; |
0d1e0e78 | 91 | if (!diffopt->flags.override_submodule_config) |
aee9c7d6 | 92 | set_diffopt_flags_from_submodule_config(diffopt, ce->name); |
0d1e0e78 | 93 | if (diffopt->flags.ignore_submodules) |
aee9c7d6 | 94 | changed = 0; |
0d1e0e78 BW |
95 | else if (!diffopt->flags.ignore_dirty_submodules && |
96 | (!changed || diffopt->flags.dirty_submodules)) | |
3b69daed | 97 | *dirty_submodule = is_submodule_modified(ce->name, |
0d1e0e78 | 98 | diffopt->flags.ignore_untracked_in_submodules); |
aee9c7d6 | 99 | diffopt->flags = orig_flags; |
ae6d5c1b JL |
100 | } |
101 | return changed; | |
102 | } | |
103 | ||
25bd3acd | 104 | void run_diff_files(struct rev_info *revs, unsigned int option) |
f0c6b2a2 | 105 | { |
6973dcae JH |
106 | int entries, i; |
107 | int diff_unmerged_stage = revs->max_count; | |
fb63d7f8 JH |
108 | unsigned ce_option = ((option & DIFF_RACY_IS_MODIFIED) |
109 | ? CE_MATCH_RACY_IS_DIRTY : 0); | |
ca54d9ba | 110 | uint64_t start = getnanotime(); |
5adbb403 | 111 | struct index_state *istate = revs->diffopt.repo->index; |
f0c6b2a2 | 112 | |
a5a818ee JH |
113 | diff_set_mnemonic_prefix(&revs->diffopt, "i/", "w/"); |
114 | ||
c9052a83 AV |
115 | refresh_fsmonitor(istate); |
116 | ||
6973dcae JH |
117 | if (diff_unmerged_stage < 0) |
118 | diff_unmerged_stage = 2; | |
5adbb403 | 119 | entries = istate->cache_nr; |
6973dcae | 120 | for (i = 0; i < entries; i++) { |
6973dcae | 121 | unsigned int oldmode, newmode; |
5adbb403 | 122 | struct cache_entry *ce = istate->cache[i]; |
6973dcae | 123 | int changed; |
e3d42c47 | 124 | unsigned dirty_submodule = 0; |
55497b8c | 125 | const struct object_id *old_oid, *new_oid; |
8676eb43 | 126 | |
28b9264d | 127 | if (diff_can_quit_early(&revs->diffopt)) |
822cac01 JH |
128 | break; |
129 | ||
5adbb403 | 130 | if (!ce_path_match(istate, ce, &revs->prune_data, NULL)) |
8676eb43 | 131 | continue; |
be3cfa85 | 132 | |
8174627b ĐTCD |
133 | if (revs->diffopt.prefix && |
134 | strncmp(ce->name, revs->diffopt.prefix, revs->diffopt.prefix_length)) | |
135 | continue; | |
136 | ||
6973dcae | 137 | if (ce_stage(ce)) { |
b4b15503 | 138 | struct combine_diff_path *dpath; |
095ce953 JH |
139 | struct diff_filepair *pair; |
140 | unsigned int wt_mode = 0; | |
6973dcae | 141 | int num_compare_stages = 0; |
b4b15503 | 142 | size_t path_len; |
53048100 | 143 | struct stat st; |
6973dcae | 144 | |
b4b15503 FF |
145 | path_len = ce_namelen(ce); |
146 | ||
4fc970c4 | 147 | dpath = xmalloc(combine_diff_path_size(5, path_len)); |
b4b15503 FF |
148 | dpath->path = (char *) &(dpath->parent[5]); |
149 | ||
150 | dpath->next = NULL; | |
b4b15503 FF |
151 | memcpy(dpath->path, ce->name, path_len); |
152 | dpath->path[path_len] = '\0'; | |
1ff57c13 | 153 | oidclr(&dpath->oid); |
b4b15503 | 154 | memset(&(dpath->parent[0]), 0, |
4fc970c4 JH |
155 | sizeof(struct combine_diff_parent)*5); |
156 | ||
6a044a20 | 157 | changed = check_removed(ce, &st); |
f58dbf23 | 158 | if (!changed) |
095ce953 | 159 | wt_mode = ce_mode_from_stat(ce, st.st_mode); |
f58dbf23 JH |
160 | else { |
161 | if (changed < 0) { | |
4fc970c4 JH |
162 | perror(ce->name); |
163 | continue; | |
164 | } | |
095ce953 | 165 | wt_mode = 0; |
4fc970c4 | 166 | } |
095ce953 | 167 | dpath->mode = wt_mode; |
6973dcae JH |
168 | |
169 | while (i < entries) { | |
5adbb403 | 170 | struct cache_entry *nce = istate->cache[i]; |
6973dcae JH |
171 | int stage; |
172 | ||
173 | if (strcmp(ce->name, nce->name)) | |
174 | break; | |
175 | ||
176 | /* Stage #2 (ours) is the first parent, | |
177 | * stage #3 (theirs) is the second. | |
178 | */ | |
179 | stage = ce_stage(nce); | |
180 | if (2 <= stage) { | |
7a51ed66 | 181 | int mode = nce->ce_mode; |
6973dcae | 182 | num_compare_stages++; |
99d1a986 | 183 | oidcpy(&dpath->parent[stage - 2].oid, |
184 | &nce->oid); | |
7a51ed66 | 185 | dpath->parent[stage-2].mode = ce_mode_from_stat(nce, mode); |
b4b15503 | 186 | dpath->parent[stage-2].status = |
6973dcae JH |
187 | DIFF_STATUS_MODIFIED; |
188 | } | |
189 | ||
190 | /* diff against the proper unmerged stage */ | |
191 | if (stage == diff_unmerged_stage) | |
192 | ce = nce; | |
193 | i++; | |
194 | } | |
195 | /* | |
196 | * Compensate for loop update | |
f0c6b2a2 | 197 | */ |
6973dcae | 198 | i--; |
6b5ee137 | 199 | |
6973dcae | 200 | if (revs->combine_merges && num_compare_stages == 2) { |
d01141de | 201 | show_combined_diff(dpath, 2, revs); |
b4b15503 | 202 | free(dpath); |
6973dcae | 203 | continue; |
1b1480ff | 204 | } |
6a83d902 | 205 | FREE_AND_NULL(dpath); |
0e3994fa | 206 | |
6973dcae JH |
207 | /* |
208 | * Show the diff for the 'ce' if we found the one | |
209 | * from the desired stage. | |
210 | */ | |
095ce953 JH |
211 | pair = diff_unmerge(&revs->diffopt, ce->name); |
212 | if (wt_mode) | |
213 | pair->two->mode = wt_mode; | |
6973dcae JH |
214 | if (ce_stage(ce) != diff_unmerged_stage) |
215 | continue; | |
eeaa4603 | 216 | } |
6b14d7fa | 217 | |
125fd984 | 218 | if (ce_uptodate(ce) || ce_skip_worktree(ce)) |
d1f2d7e8 | 219 | continue; |
f58dbf23 | 220 | |
c9052a83 AV |
221 | /* |
222 | * When CE_VALID is set (via "update-index --assume-unchanged" | |
223 | * or via adding paths while core.ignorestat is set to true), | |
224 | * the user has promised that the working tree file for that | |
225 | * path will not be modified. When CE_FSMONITOR_VALID is true, | |
226 | * the fsmonitor knows that the path hasn't been modified since | |
227 | * we refreshed the cached stat information. In either case, | |
228 | * we do not have to stat to see if the path has been removed | |
229 | * or modified. | |
230 | */ | |
231 | if (ce->ce_flags & (CE_VALID | CE_FSMONITOR_VALID)) { | |
53048100 JK |
232 | changed = 0; |
233 | newmode = ce->ce_mode; | |
234 | } else { | |
235 | struct stat st; | |
236 | ||
6a044a20 | 237 | changed = check_removed(ce, &st); |
53048100 JK |
238 | if (changed) { |
239 | if (changed < 0) { | |
240 | perror(ce->name); | |
241 | continue; | |
242 | } | |
243 | diff_addremove(&revs->diffopt, '-', ce->ce_mode, | |
c26022ea | 244 | &ce->oid, |
99d1a986 | 245 | !is_null_oid(&ce->oid), |
53048100 | 246 | ce->name, 0); |
15d061b4 | 247 | continue; |
425a28e0 NTND |
248 | } else if (revs->diffopt.ita_invisible_in_index && |
249 | ce_intent_to_add(ce)) { | |
cb0dd22b RP |
250 | newmode = ce_mode_from_stat(ce, st.st_mode); |
251 | diff_addremove(&revs->diffopt, '+', newmode, | |
14228447 | 252 | null_oid(), 0, ce->name, 0); |
425a28e0 | 253 | continue; |
15d061b4 | 254 | } |
53048100 JK |
255 | |
256 | changed = match_stat_with_submodule(&revs->diffopt, ce, &st, | |
257 | ce_option, &dirty_submodule); | |
258 | newmode = ce_mode_from_stat(ce, st.st_mode); | |
f2ce9fde | 259 | } |
53048100 | 260 | |
85adbf2f | 261 | if (!changed && !dirty_submodule) { |
8fa29602 | 262 | ce_mark_uptodate(ce); |
b5a81697 | 263 | mark_fsmonitor_valid(istate, ce); |
0d1e0e78 | 264 | if (!revs->diffopt.flags.find_copies_harder) |
8fa29602 JH |
265 | continue; |
266 | } | |
7a51ed66 | 267 | oldmode = ce->ce_mode; |
55497b8c | 268 | old_oid = &ce->oid; |
14228447 | 269 | new_oid = changed ? null_oid() : &ce->oid; |
6973dcae | 270 | diff_change(&revs->diffopt, oldmode, newmode, |
94a0097a | 271 | old_oid, new_oid, |
55497b8c BW |
272 | !is_null_oid(old_oid), |
273 | !is_null_oid(new_oid), | |
e3d42c47 | 274 | ce->name, 0, dirty_submodule); |
77eb2720 | 275 | |
7ca45252 | 276 | } |
6973dcae JH |
277 | diffcore_std(&revs->diffopt); |
278 | diff_flush(&revs->diffopt); | |
ca54d9ba | 279 | trace_performance_since(start, "diff-files"); |
77eb2720 | 280 | } |
be3cfa85 | 281 | |
e09ad6e1 JH |
282 | /* |
283 | * diff-index | |
284 | */ | |
285 | ||
286 | /* A file entry went away or appeared */ | |
287 | static void diff_index_show_file(struct rev_info *revs, | |
288 | const char *prefix, | |
eb9ae4b5 | 289 | const struct cache_entry *ce, |
fcf2cfb5 | 290 | const struct object_id *oid, int oid_valid, |
e5450100 | 291 | unsigned int mode, |
e3d42c47 | 292 | unsigned dirty_submodule) |
e09ad6e1 | 293 | { |
7a51ed66 | 294 | diff_addremove(&revs->diffopt, prefix[0], mode, |
c26022ea | 295 | oid, oid_valid, ce->name, dirty_submodule); |
e09ad6e1 JH |
296 | } |
297 | ||
0ec9949f NK |
298 | static int get_stat_data(const struct index_state *istate, |
299 | const struct cache_entry *ce, | |
362d7659 | 300 | const struct object_id **oidp, |
e09ad6e1 | 301 | unsigned int *modep, |
e3d42c47 | 302 | int cached, int match_missing, |
4d34477f | 303 | unsigned *dirty_submodule, struct diff_options *diffopt) |
e09ad6e1 | 304 | { |
362d7659 | 305 | const struct object_id *oid = &ce->oid; |
e09ad6e1 JH |
306 | unsigned int mode = ce->ce_mode; |
307 | ||
658dd48c | 308 | if (!cached && !ce_uptodate(ce)) { |
e09ad6e1 JH |
309 | int changed; |
310 | struct stat st; | |
6a044a20 | 311 | changed = check_removed(ce, &st); |
948dd346 JH |
312 | if (changed < 0) |
313 | return -1; | |
314 | else if (changed) { | |
315 | if (match_missing) { | |
362d7659 | 316 | *oidp = oid; |
e09ad6e1 JH |
317 | *modep = mode; |
318 | return 0; | |
319 | } | |
320 | return -1; | |
321 | } | |
ae6d5c1b JL |
322 | changed = match_stat_with_submodule(diffopt, ce, &st, |
323 | 0, dirty_submodule); | |
e09ad6e1 | 324 | if (changed) { |
185c975f | 325 | mode = ce_mode_from_stat(ce, st.st_mode); |
14228447 | 326 | oid = null_oid(); |
e09ad6e1 JH |
327 | } |
328 | } | |
329 | ||
362d7659 | 330 | *oidp = oid; |
e09ad6e1 JH |
331 | *modep = mode; |
332 | return 0; | |
333 | } | |
334 | ||
ff7e6aad | 335 | static void show_new_file(struct rev_info *revs, |
e36ede2e | 336 | const struct cache_entry *new_file, |
e09ad6e1 JH |
337 | int cached, int match_missing) |
338 | { | |
362d7659 | 339 | const struct object_id *oid; |
e09ad6e1 | 340 | unsigned int mode; |
e3d42c47 | 341 | unsigned dirty_submodule = 0; |
0ec9949f | 342 | struct index_state *istate = revs->diffopt.repo->index; |
e09ad6e1 | 343 | |
9eb00af5 DS |
344 | if (new_file && S_ISSPARSEDIR(new_file->ce_mode)) { |
345 | diff_tree_oid(NULL, &new_file->oid, new_file->name, &revs->diffopt); | |
346 | return; | |
347 | } | |
348 | ||
948dd346 JH |
349 | /* |
350 | * New file in the index: it might actually be different in | |
f7d650c0 | 351 | * the working tree. |
e09ad6e1 | 352 | */ |
0ec9949f | 353 | if (get_stat_data(istate, new_file, &oid, &mode, cached, match_missing, |
4d34477f | 354 | &dirty_submodule, &revs->diffopt) < 0) |
e09ad6e1 JH |
355 | return; |
356 | ||
e36ede2e | 357 | diff_index_show_file(revs, "+", new_file, oid, !is_null_oid(oid), mode, dirty_submodule); |
e09ad6e1 JH |
358 | } |
359 | ||
ff7e6aad | 360 | static int show_modified(struct rev_info *revs, |
e36ede2e BW |
361 | const struct cache_entry *old_entry, |
362 | const struct cache_entry *new_entry, | |
e09ad6e1 JH |
363 | int report_missing, |
364 | int cached, int match_missing) | |
365 | { | |
366 | unsigned int mode, oldmode; | |
362d7659 | 367 | const struct object_id *oid; |
e3d42c47 | 368 | unsigned dirty_submodule = 0; |
0ec9949f | 369 | struct index_state *istate = revs->diffopt.repo->index; |
e09ad6e1 | 370 | |
9eb00af5 DS |
371 | assert(S_ISSPARSEDIR(old_entry->ce_mode) == |
372 | S_ISSPARSEDIR(new_entry->ce_mode)); | |
373 | ||
374 | /* | |
375 | * If both are sparse directory entries, then expand the | |
376 | * modifications to the file level. If only one was a sparse | |
377 | * directory, then they appear as an add and delete instead of | |
378 | * a modification. | |
379 | */ | |
380 | if (S_ISSPARSEDIR(new_entry->ce_mode)) { | |
381 | diff_tree_oid(&old_entry->oid, &new_entry->oid, new_entry->name, &revs->diffopt); | |
382 | return 0; | |
383 | } | |
384 | ||
0ec9949f | 385 | if (get_stat_data(istate, new_entry, &oid, &mode, cached, match_missing, |
4d34477f | 386 | &dirty_submodule, &revs->diffopt) < 0) { |
e09ad6e1 | 387 | if (report_missing) |
e36ede2e BW |
388 | diff_index_show_file(revs, "-", old_entry, |
389 | &old_entry->oid, 1, old_entry->ce_mode, | |
99d1a986 | 390 | 0); |
e09ad6e1 JH |
391 | return -1; |
392 | } | |
393 | ||
cb2b9f5e | 394 | if (revs->combine_merges && !cached && |
9001dc2a | 395 | (!oideq(oid, &old_entry->oid) || !oideq(&old_entry->oid, &new_entry->oid))) { |
cb2b9f5e | 396 | struct combine_diff_path *p; |
e36ede2e | 397 | int pathlen = ce_namelen(new_entry); |
cb2b9f5e PM |
398 | |
399 | p = xmalloc(combine_diff_path_size(2, pathlen)); | |
400 | p->path = (char *) &p->parent[2]; | |
401 | p->next = NULL; | |
e36ede2e | 402 | memcpy(p->path, new_entry->name, pathlen); |
cb2b9f5e | 403 | p->path[pathlen] = 0; |
7a51ed66 | 404 | p->mode = mode; |
1ff57c13 | 405 | oidclr(&p->oid); |
cb2b9f5e PM |
406 | memset(p->parent, 0, 2 * sizeof(struct combine_diff_parent)); |
407 | p->parent[0].status = DIFF_STATUS_MODIFIED; | |
e36ede2e BW |
408 | p->parent[0].mode = new_entry->ce_mode; |
409 | oidcpy(&p->parent[0].oid, &new_entry->oid); | |
cb2b9f5e | 410 | p->parent[1].status = DIFF_STATUS_MODIFIED; |
e36ede2e BW |
411 | p->parent[1].mode = old_entry->ce_mode; |
412 | oidcpy(&p->parent[1].oid, &old_entry->oid); | |
d01141de | 413 | show_combined_diff(p, 2, revs); |
cb2b9f5e PM |
414 | free(p); |
415 | return 0; | |
416 | } | |
417 | ||
e36ede2e | 418 | oldmode = old_entry->ce_mode; |
4a7e27e9 | 419 | if (mode == oldmode && oideq(oid, &old_entry->oid) && !dirty_submodule && |
0d1e0e78 | 420 | !revs->diffopt.flags.find_copies_harder) |
e09ad6e1 JH |
421 | return 0; |
422 | ||
e09ad6e1 | 423 | diff_change(&revs->diffopt, oldmode, mode, |
e36ede2e BW |
424 | &old_entry->oid, oid, 1, !is_null_oid(oid), |
425 | old_entry->name, 0, dirty_submodule); | |
e09ad6e1 JH |
426 | return 0; |
427 | } | |
428 | ||
d1f2d7e8 LT |
429 | /* |
430 | * This gets a mix of an existing index and a tree, one pathname entry | |
431 | * at a time. The index entry may be a single stage-0 one, but it could | |
432 | * also be multiple unmerged entries (in which case idx_pos/idx_nr will | |
433 | * give you the position and number of entries in the index). | |
434 | */ | |
435 | static void do_oneway_diff(struct unpack_trees_options *o, | |
eb9ae4b5 RS |
436 | const struct cache_entry *idx, |
437 | const struct cache_entry *tree) | |
e09ad6e1 | 438 | { |
ff7e6aad | 439 | struct rev_info *revs = o->unpack_data; |
d1f2d7e8 | 440 | int match_missing, cached; |
5c21ac0e | 441 | |
ba4e3561 NTND |
442 | /* |
443 | * i-t-a entries do not actually exist in the index (if we're | |
444 | * looking at its content) | |
445 | */ | |
446 | if (o->index_only && | |
447 | revs->diffopt.ita_invisible_in_index && | |
425a28e0 NTND |
448 | idx && ce_intent_to_add(idx)) { |
449 | idx = NULL; | |
450 | if (!tree) | |
451 | return; /* nothing to diff.. */ | |
452 | } | |
453 | ||
540e694b | 454 | /* if the entry is not checked out, don't examine work tree */ |
b4d1690d NTND |
455 | cached = o->index_only || |
456 | (idx && ((idx->ce_flags & CE_VALID) || ce_skip_worktree(idx))); | |
572fc9aa SO |
457 | |
458 | match_missing = revs->match_missing; | |
d1f2d7e8 LT |
459 | |
460 | if (cached && idx && ce_stage(idx)) { | |
fa7b2908 JH |
461 | struct diff_filepair *pair; |
462 | pair = diff_unmerge(&revs->diffopt, idx->name); | |
ff00b682 | 463 | if (tree) |
f9704c2d | 464 | fill_filespec(pair->one, &tree->oid, 1, |
99d1a986 | 465 | tree->ce_mode); |
d1f2d7e8 LT |
466 | return; |
467 | } | |
468 | ||
469 | /* | |
470 | * Something added to the tree? | |
471 | */ | |
472 | if (!tree) { | |
ff7e6aad | 473 | show_new_file(revs, idx, cached, match_missing); |
d1f2d7e8 LT |
474 | return; |
475 | } | |
476 | ||
477 | /* | |
478 | * Something removed from the tree? | |
5c21ac0e | 479 | */ |
d1f2d7e8 | 480 | if (!idx) { |
56d8a271 VD |
481 | if (S_ISSPARSEDIR(tree->ce_mode)) { |
482 | diff_tree_oid(&tree->oid, NULL, tree->name, &revs->diffopt); | |
483 | return; | |
484 | } | |
485 | ||
fcf2cfb5 | 486 | diff_index_show_file(revs, "-", tree, &tree->oid, 1, |
99d1a986 | 487 | tree->ce_mode, 0); |
d1f2d7e8 LT |
488 | return; |
489 | } | |
490 | ||
491 | /* Show difference between old and new */ | |
ff7e6aad | 492 | show_modified(revs, tree, idx, 1, cached, match_missing); |
d1f2d7e8 LT |
493 | } |
494 | ||
d1f2d7e8 LT |
495 | /* |
496 | * The unpack_trees() interface is designed for merging, so | |
497 | * the different source entries are designed primarily for | |
498 | * the source trees, with the old index being really mainly | |
499 | * used for being replaced by the result. | |
500 | * | |
501 | * For diffing, the index is more important, and we only have a | |
502 | * single tree. | |
503 | * | |
da8ba5e7 | 504 | * We're supposed to advance o->pos to skip what we have already processed. |
d1f2d7e8 LT |
505 | * |
506 | * This wrapper makes it all more readable, and takes care of all | |
507 | * the fairly complex unpack_trees() semantic requirements, including | |
508 | * the skipping, the path matching, the type conflict cases etc. | |
509 | */ | |
5828e835 RS |
510 | static int oneway_diff(const struct cache_entry * const *src, |
511 | struct unpack_trees_options *o) | |
d1f2d7e8 | 512 | { |
eb9ae4b5 RS |
513 | const struct cache_entry *idx = src[0]; |
514 | const struct cache_entry *tree = src[1]; | |
ff7e6aad | 515 | struct rev_info *revs = o->unpack_data; |
d1f2d7e8 | 516 | |
d1f2d7e8 LT |
517 | /* |
518 | * Unpack-trees generates a DF/conflict entry if | |
519 | * there was a directory in the index and a tree | |
520 | * in the tree. From a diff standpoint, that's a | |
521 | * delete of the tree and a create of the file. | |
522 | */ | |
523 | if (tree == o->df_conflict_entry) | |
524 | tree = NULL; | |
525 | ||
5adbb403 NTND |
526 | if (ce_path_match(revs->diffopt.repo->index, |
527 | idx ? idx : tree, | |
528 | &revs->prune_data, NULL)) { | |
34110cd4 | 529 | do_oneway_diff(o, idx, tree); |
b4194828 JH |
530 | if (diff_can_quit_early(&revs->diffopt)) { |
531 | o->exiting_early = 1; | |
532 | return -1; | |
533 | } | |
534 | } | |
d1f2d7e8 | 535 | |
34110cd4 | 536 | return 0; |
d1f2d7e8 LT |
537 | } |
538 | ||
bf979c07 | 539 | static int diff_cache(struct rev_info *revs, |
944cffbd | 540 | const struct object_id *tree_oid, |
bf979c07 JH |
541 | const char *tree_name, |
542 | int cached) | |
d1f2d7e8 | 543 | { |
d1f2d7e8 | 544 | struct tree *tree; |
d1f2d7e8 | 545 | struct tree_desc t; |
bf979c07 | 546 | struct unpack_trees_options opts; |
e09ad6e1 | 547 | |
a9dbc179 | 548 | tree = parse_tree_indirect(tree_oid); |
e09ad6e1 | 549 | if (!tree) |
bf979c07 | 550 | return error("bad tree object %s", |
944cffbd | 551 | tree_name ? tree_name : oid_to_hex(tree_oid)); |
d1f2d7e8 LT |
552 | memset(&opts, 0, sizeof(opts)); |
553 | opts.head_idx = 1; | |
554 | opts.index_only = cached; | |
a0919ced | 555 | opts.diff_index_cached = (cached && |
0d1e0e78 | 556 | !revs->diffopt.flags.find_copies_harder); |
d1f2d7e8 LT |
557 | opts.merge = 1; |
558 | opts.fn = oneway_diff; | |
ff7e6aad | 559 | opts.unpack_data = revs; |
5adbb403 | 560 | opts.src_index = revs->diffopt.repo->index; |
34110cd4 | 561 | opts.dst_index = NULL; |
2f88c197 | 562 | opts.pathspec = &revs->diffopt.pathspec; |
4838237c | 563 | opts.pathspec->recursive = 1; |
d1f2d7e8 LT |
564 | |
565 | init_tree_desc(&t, tree->buffer, tree->size); | |
bf979c07 JH |
566 | return unpack_trees(1, &t, &opts); |
567 | } | |
568 | ||
177a8302 DL |
569 | void diff_get_merge_base(const struct rev_info *revs, struct object_id *mb) |
570 | { | |
571 | int i; | |
572 | struct commit *mb_child[2] = {0}; | |
573 | struct commit_list *merge_bases; | |
574 | ||
575 | for (i = 0; i < revs->pending.nr; i++) { | |
576 | struct object *obj = revs->pending.objects[i].item; | |
577 | if (obj->flags) | |
578 | die(_("--merge-base does not work with ranges")); | |
177a8302 DL |
579 | } |
580 | ||
581 | /* | |
582 | * This check must go after the for loop above because A...B | |
583 | * ranges produce three pending commits, resulting in a | |
584 | * misleading error message. | |
585 | */ | |
586 | if (revs->pending.nr < 1 || revs->pending.nr > 2) | |
587 | BUG("unexpected revs->pending.nr: %d", revs->pending.nr); | |
588 | ||
589 | for (i = 0; i < revs->pending.nr; i++) | |
590 | mb_child[i] = lookup_commit_reference(the_repository, &revs->pending.objects[i].item->oid); | |
591 | if (revs->pending.nr == 1) { | |
592 | struct object_id oid; | |
593 | ||
d850b7a5 | 594 | if (repo_get_oid(the_repository, "HEAD", &oid)) |
177a8302 DL |
595 | die(_("unable to get HEAD")); |
596 | ||
597 | mb_child[1] = lookup_commit_reference(the_repository, &oid); | |
598 | } | |
599 | ||
600 | merge_bases = repo_get_merge_bases(the_repository, mb_child[0], mb_child[1]); | |
601 | if (!merge_bases) | |
602 | die(_("no merge base found")); | |
603 | if (merge_bases->next) | |
604 | die(_("multiple merge bases found")); | |
605 | ||
606 | oidcpy(mb, &merge_bases->item->object.oid); | |
607 | ||
608 | free_commit_list(merge_bases); | |
609 | } | |
610 | ||
25bd3acd | 611 | void run_diff_index(struct rev_info *revs, unsigned int option) |
bf979c07 JH |
612 | { |
613 | struct object_array_entry *ent; | |
4c3fe82e | 614 | int cached = !!(option & DIFF_INDEX_CACHED); |
0f5a1d44 DL |
615 | int merge_base = !!(option & DIFF_INDEX_MERGE_BASE); |
616 | struct object_id oid; | |
617 | const char *name; | |
618 | char merge_base_hex[GIT_MAX_HEXSZ + 1]; | |
4f3d6d02 | 619 | struct index_state *istate = revs->diffopt.repo->index; |
bf979c07 | 620 | |
3506dc94 JK |
621 | if (revs->pending.nr != 1) |
622 | BUG("run_diff_index must be passed exactly one tree"); | |
623 | ||
c46c406a | 624 | trace_performance_enter(); |
bf979c07 | 625 | ent = revs->pending.objects; |
0f5a1d44 | 626 | |
4f3d6d02 NK |
627 | refresh_fsmonitor(istate); |
628 | ||
0f5a1d44 DL |
629 | if (merge_base) { |
630 | diff_get_merge_base(revs, &oid); | |
631 | name = oid_to_hex_r(merge_base_hex, &oid); | |
632 | } else { | |
633 | oidcpy(&oid, &ent->item->oid); | |
634 | name = ent->name; | |
635 | } | |
636 | ||
637 | if (diff_cache(revs, &oid, name, cached)) | |
203a2fe1 | 638 | exit(128); |
d1f2d7e8 | 639 | |
a5a818ee | 640 | diff_set_mnemonic_prefix(&revs->diffopt, "c/", cached ? "i/" : "w/"); |
784c0dae | 641 | diffcore_fix_diff_index(); |
e09ad6e1 JH |
642 | diffcore_std(&revs->diffopt); |
643 | diff_flush(&revs->diffopt); | |
c46c406a | 644 | trace_performance_leave("diff-index"); |
e09ad6e1 | 645 | } |
1cfe7733 | 646 | |
944cffbd | 647 | int do_diff_cache(const struct object_id *tree_oid, struct diff_options *opt) |
1cfe7733 | 648 | { |
1cfe7733 | 649 | struct rev_info revs; |
1cfe7733 | 650 | |
ffc00a48 | 651 | repo_init_revisions(opt->repo, &revs, NULL); |
9a087274 | 652 | copy_pathspec(&revs.prune_data, &opt->pathspec); |
d44e5267 | 653 | diff_setup_done(&revs.diffopt); |
bf979c07 | 654 | revs.diffopt = *opt; |
204ce979 | 655 | |
944cffbd | 656 | if (diff_cache(&revs, tree_oid, NULL, 1)) |
203a2fe1 | 657 | exit(128); |
f0cb6b80 | 658 | release_revisions(&revs); |
204ce979 | 659 | return 0; |
1cfe7733 | 660 | } |
75f3ff2e | 661 | |
ffc00a48 NTND |
662 | int index_differs_from(struct repository *r, |
663 | const char *def, const struct diff_flags *flags, | |
018ec3c8 | 664 | int ita_invisible_in_index) |
75f3ff2e SB |
665 | { |
666 | struct rev_info rev; | |
32962c9b | 667 | struct setup_revision_opt opt; |
54c8a7c3 | 668 | unsigned has_changes; |
75f3ff2e | 669 | |
ffc00a48 | 670 | repo_init_revisions(r, &rev, NULL); |
32962c9b JH |
671 | memset(&opt, 0, sizeof(opt)); |
672 | opt.def = def; | |
673 | setup_revisions(0, NULL, &rev, &opt); | |
0d1e0e78 BW |
674 | rev.diffopt.flags.quick = 1; |
675 | rev.diffopt.flags.exit_with_status = 1; | |
5768478e | 676 | if (flags) { |
02f2f56b | 677 | diff_flags_or(&rev.diffopt.flags, flags); |
5768478e JS |
678 | /* |
679 | * Now that flags are merged, honor override_submodule_config | |
680 | * and ignore_submodules from passed flags. | |
681 | */ | |
682 | if (flags->override_submodule_config) | |
683 | rev.diffopt.flags.ignore_submodules = flags->ignore_submodules; | |
684 | } | |
018ec3c8 | 685 | rev.diffopt.ita_invisible_in_index = ita_invisible_in_index; |
976b97e3 | 686 | run_diff_index(&rev, DIFF_INDEX_CACHED); |
54c8a7c3 | 687 | has_changes = rev.diffopt.flags.has_changes; |
1878b5ed | 688 | release_revisions(&rev); |
54c8a7c3 | 689 | return (has_changes != 0); |
75f3ff2e | 690 | } |
cdffbdc2 | 691 | |
61bdc7c5 | 692 | static struct strbuf *idiff_prefix_cb(struct diff_options *opt UNUSED, void *data) |
cdffbdc2 ES |
693 | { |
694 | return data; | |
695 | } | |
696 | ||
72a72390 ES |
697 | void show_interdiff(const struct object_id *oid1, const struct object_id *oid2, |
698 | int indent, struct diff_options *diffopt) | |
cdffbdc2 ES |
699 | { |
700 | struct diff_options opts; | |
701 | struct strbuf prefix = STRBUF_INIT; | |
702 | ||
72a72390 | 703 | memcpy(&opts, diffopt, sizeof(opts)); |
cdffbdc2 ES |
704 | opts.output_format = DIFF_FORMAT_PATCH; |
705 | opts.output_prefix = idiff_prefix_cb; | |
706 | strbuf_addchars(&prefix, ' ', indent); | |
707 | opts.output_prefix_data = &prefix; | |
708 | diff_setup_done(&opts); | |
709 | ||
72a72390 | 710 | diff_tree_oid(oid1, oid2, "", &opts); |
cdffbdc2 ES |
711 | diffcore_std(&opts); |
712 | diff_flush(&opts); | |
713 | ||
714 | strbuf_release(&prefix); | |
715 | } |