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