2 * Copyright (C) 2005 Junio C Hamano
10 #include "cache-tree.h"
11 #include "unpack-trees.h"
13 #include "submodule.h"
15 #include "fsmonitor.h"
16 #include "commit-reach.h"
23 * Has the work tree entity been removed?
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.
31 static int check_removed(const struct index_state
*istate
, const struct cache_entry
*ce
, struct stat
*st
)
33 assert(is_fsmonitor_refreshed(istate
));
34 if (!(ce
->ce_flags
& CE_FSMONITOR_VALID
) && lstat(ce
->name
, st
) < 0) {
35 if (!is_missing_file_error(errno
))
39 if (has_symlink_leading_path(ce
->name
, ce_namelen(ce
)))
41 if (S_ISDIR(st
->st_mode
)) {
45 * If ce is already a gitlink, we can have a plain
46 * directory (i.e. the submodule is not checked out),
47 * or a checked out submodule. Either case this is not
48 * a case where something was removed from the work tree,
49 * so we will return 0.
51 * Otherwise, if the directory is not a submodule
52 * repository, that means ce which was a blob turned into
53 * a directory --- the blob was removed!
55 if (!S_ISGITLINK(ce
->ce_mode
) &&
56 resolve_gitlink_ref(ce
->name
, "HEAD", &sub
))
63 * Has a file changed or has a submodule new commits or a dirty work tree?
65 * Return 1 when changes are detected, 0 otherwise. If the DIRTY_SUBMODULES
66 * option is set, the caller does not only want to know if a submodule is
67 * modified at all but wants to know all the conditions that are met (new
68 * commits, untracked content and/or modified content).
70 static int match_stat_with_submodule(struct diff_options
*diffopt
,
71 const struct cache_entry
*ce
,
72 struct stat
*st
, unsigned ce_option
,
73 unsigned *dirty_submodule
)
75 int changed
= ie_match_stat(diffopt
->repo
->index
, ce
, st
, ce_option
);
76 if (S_ISGITLINK(ce
->ce_mode
)) {
77 struct diff_flags orig_flags
= diffopt
->flags
;
78 if (!diffopt
->flags
.override_submodule_config
)
79 set_diffopt_flags_from_submodule_config(diffopt
, ce
->name
);
80 if (diffopt
->flags
.ignore_submodules
)
82 else if (!diffopt
->flags
.ignore_dirty_submodules
&&
83 (!changed
|| diffopt
->flags
.dirty_submodules
))
84 *dirty_submodule
= is_submodule_modified(ce
->name
,
85 diffopt
->flags
.ignore_untracked_in_submodules
);
86 diffopt
->flags
= orig_flags
;
91 int run_diff_files(struct rev_info
*revs
, unsigned int option
)
94 int diff_unmerged_stage
= revs
->max_count
;
95 unsigned ce_option
= ((option
& DIFF_RACY_IS_MODIFIED
)
96 ? CE_MATCH_RACY_IS_DIRTY
: 0);
97 uint64_t start
= getnanotime();
98 struct index_state
*istate
= revs
->diffopt
.repo
->index
;
100 diff_set_mnemonic_prefix(&revs
->diffopt
, "i/", "w/");
102 refresh_fsmonitor(istate
);
104 if (diff_unmerged_stage
< 0)
105 diff_unmerged_stage
= 2;
106 entries
= istate
->cache_nr
;
107 for (i
= 0; i
< entries
; i
++) {
108 unsigned int oldmode
, newmode
;
109 struct cache_entry
*ce
= istate
->cache
[i
];
111 unsigned dirty_submodule
= 0;
112 const struct object_id
*old_oid
, *new_oid
;
114 if (diff_can_quit_early(&revs
->diffopt
))
117 if (!ce_path_match(istate
, ce
, &revs
->prune_data
, NULL
))
121 struct combine_diff_path
*dpath
;
122 struct diff_filepair
*pair
;
123 unsigned int wt_mode
= 0;
124 int num_compare_stages
= 0;
128 path_len
= ce_namelen(ce
);
130 dpath
= xmalloc(combine_diff_path_size(5, path_len
));
131 dpath
->path
= (char *) &(dpath
->parent
[5]);
134 memcpy(dpath
->path
, ce
->name
, path_len
);
135 dpath
->path
[path_len
] = '\0';
137 memset(&(dpath
->parent
[0]), 0,
138 sizeof(struct combine_diff_parent
)*5);
140 changed
= check_removed(istate
, ce
, &st
);
142 wt_mode
= ce_mode_from_stat(ce
, st
.st_mode
);
150 dpath
->mode
= wt_mode
;
152 while (i
< entries
) {
153 struct cache_entry
*nce
= istate
->cache
[i
];
156 if (strcmp(ce
->name
, nce
->name
))
159 /* Stage #2 (ours) is the first parent,
160 * stage #3 (theirs) is the second.
162 stage
= ce_stage(nce
);
164 int mode
= nce
->ce_mode
;
165 num_compare_stages
++;
166 oidcpy(&dpath
->parent
[stage
- 2].oid
,
168 dpath
->parent
[stage
-2].mode
= ce_mode_from_stat(nce
, mode
);
169 dpath
->parent
[stage
-2].status
=
170 DIFF_STATUS_MODIFIED
;
173 /* diff against the proper unmerged stage */
174 if (stage
== diff_unmerged_stage
)
179 * Compensate for loop update
183 if (revs
->combine_merges
&& num_compare_stages
== 2) {
184 show_combined_diff(dpath
, 2, revs
);
188 FREE_AND_NULL(dpath
);
191 * Show the diff for the 'ce' if we found the one
192 * from the desired stage.
194 pair
= diff_unmerge(&revs
->diffopt
, ce
->name
);
196 pair
->two
->mode
= wt_mode
;
197 if (ce_stage(ce
) != diff_unmerged_stage
)
201 if (ce_uptodate(ce
) || ce_skip_worktree(ce
))
205 * When CE_VALID is set (via "update-index --assume-unchanged"
206 * or via adding paths while core.ignorestat is set to true),
207 * the user has promised that the working tree file for that
208 * path will not be modified. When CE_FSMONITOR_VALID is true,
209 * the fsmonitor knows that the path hasn't been modified since
210 * we refreshed the cached stat information. In either case,
211 * we do not have to stat to see if the path has been removed
214 if (ce
->ce_flags
& (CE_VALID
| CE_FSMONITOR_VALID
)) {
216 newmode
= ce
->ce_mode
;
220 changed
= check_removed(istate
, ce
, &st
);
226 diff_addremove(&revs
->diffopt
, '-', ce
->ce_mode
,
228 !is_null_oid(&ce
->oid
),
231 } else if (revs
->diffopt
.ita_invisible_in_index
&&
232 ce_intent_to_add(ce
)) {
233 newmode
= ce_mode_from_stat(ce
, st
.st_mode
);
234 diff_addremove(&revs
->diffopt
, '+', newmode
,
235 null_oid(), 0, ce
->name
, 0);
239 changed
= match_stat_with_submodule(&revs
->diffopt
, ce
, &st
,
240 ce_option
, &dirty_submodule
);
241 newmode
= ce_mode_from_stat(ce
, st
.st_mode
);
244 if (!changed
&& !dirty_submodule
) {
245 ce_mark_uptodate(ce
);
246 mark_fsmonitor_valid(istate
, ce
);
247 if (!revs
->diffopt
.flags
.find_copies_harder
)
250 oldmode
= ce
->ce_mode
;
252 new_oid
= changed
? null_oid() : &ce
->oid
;
253 diff_change(&revs
->diffopt
, oldmode
, newmode
,
255 !is_null_oid(old_oid
),
256 !is_null_oid(new_oid
),
257 ce
->name
, 0, dirty_submodule
);
260 diffcore_std(&revs
->diffopt
);
261 diff_flush(&revs
->diffopt
);
262 trace_performance_since(start
, "diff-files");
270 /* A file entry went away or appeared */
271 static void diff_index_show_file(struct rev_info
*revs
,
273 const struct cache_entry
*ce
,
274 const struct object_id
*oid
, int oid_valid
,
276 unsigned dirty_submodule
)
278 diff_addremove(&revs
->diffopt
, prefix
[0], mode
,
279 oid
, oid_valid
, ce
->name
, dirty_submodule
);
282 static int get_stat_data(const struct index_state
*istate
,
283 const struct cache_entry
*ce
,
284 const struct object_id
**oidp
,
286 int cached
, int match_missing
,
287 unsigned *dirty_submodule
, struct diff_options
*diffopt
)
289 const struct object_id
*oid
= &ce
->oid
;
290 unsigned int mode
= ce
->ce_mode
;
292 if (!cached
&& !ce_uptodate(ce
)) {
295 changed
= check_removed(istate
, ce
, &st
);
306 changed
= match_stat_with_submodule(diffopt
, ce
, &st
,
309 mode
= ce_mode_from_stat(ce
, st
.st_mode
);
319 static void show_new_file(struct rev_info
*revs
,
320 const struct cache_entry
*new_file
,
321 int cached
, int match_missing
)
323 const struct object_id
*oid
;
325 unsigned dirty_submodule
= 0;
326 struct index_state
*istate
= revs
->diffopt
.repo
->index
;
328 if (new_file
&& S_ISSPARSEDIR(new_file
->ce_mode
)) {
329 diff_tree_oid(NULL
, &new_file
->oid
, new_file
->name
, &revs
->diffopt
);
334 * New file in the index: it might actually be different in
337 if (get_stat_data(istate
, new_file
, &oid
, &mode
, cached
, match_missing
,
338 &dirty_submodule
, &revs
->diffopt
) < 0)
341 diff_index_show_file(revs
, "+", new_file
, oid
, !is_null_oid(oid
), mode
, dirty_submodule
);
344 static int show_modified(struct rev_info
*revs
,
345 const struct cache_entry
*old_entry
,
346 const struct cache_entry
*new_entry
,
348 int cached
, int match_missing
)
350 unsigned int mode
, oldmode
;
351 const struct object_id
*oid
;
352 unsigned dirty_submodule
= 0;
353 struct index_state
*istate
= revs
->diffopt
.repo
->index
;
355 assert(S_ISSPARSEDIR(old_entry
->ce_mode
) ==
356 S_ISSPARSEDIR(new_entry
->ce_mode
));
359 * If both are sparse directory entries, then expand the
360 * modifications to the file level. If only one was a sparse
361 * directory, then they appear as an add and delete instead of
364 if (S_ISSPARSEDIR(new_entry
->ce_mode
)) {
365 diff_tree_oid(&old_entry
->oid
, &new_entry
->oid
, new_entry
->name
, &revs
->diffopt
);
369 if (get_stat_data(istate
, new_entry
, &oid
, &mode
, cached
, match_missing
,
370 &dirty_submodule
, &revs
->diffopt
) < 0) {
372 diff_index_show_file(revs
, "-", old_entry
,
373 &old_entry
->oid
, 1, old_entry
->ce_mode
,
378 if (revs
->combine_merges
&& !cached
&&
379 (!oideq(oid
, &old_entry
->oid
) || !oideq(&old_entry
->oid
, &new_entry
->oid
))) {
380 struct combine_diff_path
*p
;
381 int pathlen
= ce_namelen(new_entry
);
383 p
= xmalloc(combine_diff_path_size(2, pathlen
));
384 p
->path
= (char *) &p
->parent
[2];
386 memcpy(p
->path
, new_entry
->name
, pathlen
);
387 p
->path
[pathlen
] = 0;
390 memset(p
->parent
, 0, 2 * sizeof(struct combine_diff_parent
));
391 p
->parent
[0].status
= DIFF_STATUS_MODIFIED
;
392 p
->parent
[0].mode
= new_entry
->ce_mode
;
393 oidcpy(&p
->parent
[0].oid
, &new_entry
->oid
);
394 p
->parent
[1].status
= DIFF_STATUS_MODIFIED
;
395 p
->parent
[1].mode
= old_entry
->ce_mode
;
396 oidcpy(&p
->parent
[1].oid
, &old_entry
->oid
);
397 show_combined_diff(p
, 2, revs
);
402 oldmode
= old_entry
->ce_mode
;
403 if (mode
== oldmode
&& oideq(oid
, &old_entry
->oid
) && !dirty_submodule
&&
404 !revs
->diffopt
.flags
.find_copies_harder
)
407 diff_change(&revs
->diffopt
, oldmode
, mode
,
408 &old_entry
->oid
, oid
, 1, !is_null_oid(oid
),
409 old_entry
->name
, 0, dirty_submodule
);
414 * This gets a mix of an existing index and a tree, one pathname entry
415 * at a time. The index entry may be a single stage-0 one, but it could
416 * also be multiple unmerged entries (in which case idx_pos/idx_nr will
417 * give you the position and number of entries in the index).
419 static void do_oneway_diff(struct unpack_trees_options
*o
,
420 const struct cache_entry
*idx
,
421 const struct cache_entry
*tree
)
423 struct rev_info
*revs
= o
->unpack_data
;
424 int match_missing
, cached
;
427 * i-t-a entries do not actually exist in the index (if we're
428 * looking at its content)
431 revs
->diffopt
.ita_invisible_in_index
&&
432 idx
&& ce_intent_to_add(idx
)) {
435 return; /* nothing to diff.. */
438 /* if the entry is not checked out, don't examine work tree */
439 cached
= o
->index_only
||
440 (idx
&& ((idx
->ce_flags
& CE_VALID
) || ce_skip_worktree(idx
)));
442 match_missing
= revs
->match_missing
;
444 if (cached
&& idx
&& ce_stage(idx
)) {
445 struct diff_filepair
*pair
;
446 pair
= diff_unmerge(&revs
->diffopt
, idx
->name
);
448 fill_filespec(pair
->one
, &tree
->oid
, 1,
454 * Something added to the tree?
457 show_new_file(revs
, idx
, cached
, match_missing
);
462 * Something removed from the tree?
465 diff_index_show_file(revs
, "-", tree
, &tree
->oid
, 1,
470 /* Show difference between old and new */
471 show_modified(revs
, tree
, idx
, 1, cached
, match_missing
);
475 * The unpack_trees() interface is designed for merging, so
476 * the different source entries are designed primarily for
477 * the source trees, with the old index being really mainly
478 * used for being replaced by the result.
480 * For diffing, the index is more important, and we only have a
483 * We're supposed to advance o->pos to skip what we have already processed.
485 * This wrapper makes it all more readable, and takes care of all
486 * the fairly complex unpack_trees() semantic requirements, including
487 * the skipping, the path matching, the type conflict cases etc.
489 static int oneway_diff(const struct cache_entry
* const *src
,
490 struct unpack_trees_options
*o
)
492 const struct cache_entry
*idx
= src
[0];
493 const struct cache_entry
*tree
= src
[1];
494 struct rev_info
*revs
= o
->unpack_data
;
497 * Unpack-trees generates a DF/conflict entry if
498 * there was a directory in the index and a tree
499 * in the tree. From a diff standpoint, that's a
500 * delete of the tree and a create of the file.
502 if (tree
== o
->df_conflict_entry
)
505 if (ce_path_match(revs
->diffopt
.repo
->index
,
507 &revs
->prune_data
, NULL
)) {
508 do_oneway_diff(o
, idx
, tree
);
509 if (diff_can_quit_early(&revs
->diffopt
)) {
510 o
->exiting_early
= 1;
518 static int diff_cache(struct rev_info
*revs
,
519 const struct object_id
*tree_oid
,
520 const char *tree_name
,
525 struct unpack_trees_options opts
;
527 tree
= parse_tree_indirect(tree_oid
);
529 return error("bad tree object %s",
530 tree_name
? tree_name
: oid_to_hex(tree_oid
));
531 memset(&opts
, 0, sizeof(opts
));
533 opts
.index_only
= cached
;
534 opts
.diff_index_cached
= (cached
&&
535 !revs
->diffopt
.flags
.find_copies_harder
);
537 opts
.fn
= oneway_diff
;
538 opts
.unpack_data
= revs
;
539 opts
.src_index
= revs
->diffopt
.repo
->index
;
540 opts
.dst_index
= NULL
;
541 opts
.pathspec
= &revs
->diffopt
.pathspec
;
542 opts
.pathspec
->recursive
= 1;
544 init_tree_desc(&t
, tree
->buffer
, tree
->size
);
545 return unpack_trees(1, &t
, &opts
);
548 void diff_get_merge_base(const struct rev_info
*revs
, struct object_id
*mb
)
551 struct commit
*mb_child
[2] = {0};
552 struct commit_list
*merge_bases
;
554 for (i
= 0; i
< revs
->pending
.nr
; i
++) {
555 struct object
*obj
= revs
->pending
.objects
[i
].item
;
557 die(_("--merge-base does not work with ranges"));
558 if (obj
->type
!= OBJ_COMMIT
)
559 die(_("--merge-base only works with commits"));
563 * This check must go after the for loop above because A...B
564 * ranges produce three pending commits, resulting in a
565 * misleading error message.
567 if (revs
->pending
.nr
< 1 || revs
->pending
.nr
> 2)
568 BUG("unexpected revs->pending.nr: %d", revs
->pending
.nr
);
570 for (i
= 0; i
< revs
->pending
.nr
; i
++)
571 mb_child
[i
] = lookup_commit_reference(the_repository
, &revs
->pending
.objects
[i
].item
->oid
);
572 if (revs
->pending
.nr
== 1) {
573 struct object_id oid
;
575 if (get_oid("HEAD", &oid
))
576 die(_("unable to get HEAD"));
578 mb_child
[1] = lookup_commit_reference(the_repository
, &oid
);
581 merge_bases
= repo_get_merge_bases(the_repository
, mb_child
[0], mb_child
[1]);
583 die(_("no merge base found"));
584 if (merge_bases
->next
)
585 die(_("multiple merge bases found"));
587 oidcpy(mb
, &merge_bases
->item
->object
.oid
);
589 free_commit_list(merge_bases
);
592 int run_diff_index(struct rev_info
*revs
, unsigned int option
)
594 struct object_array_entry
*ent
;
595 int cached
= !!(option
& DIFF_INDEX_CACHED
);
596 int merge_base
= !!(option
& DIFF_INDEX_MERGE_BASE
);
597 struct object_id oid
;
599 char merge_base_hex
[GIT_MAX_HEXSZ
+ 1];
600 struct index_state
*istate
= revs
->diffopt
.repo
->index
;
602 if (revs
->pending
.nr
!= 1)
603 BUG("run_diff_index must be passed exactly one tree");
605 trace_performance_enter();
606 ent
= revs
->pending
.objects
;
608 refresh_fsmonitor(istate
);
611 diff_get_merge_base(revs
, &oid
);
612 name
= oid_to_hex_r(merge_base_hex
, &oid
);
614 oidcpy(&oid
, &ent
->item
->oid
);
618 if (diff_cache(revs
, &oid
, name
, cached
))
621 diff_set_mnemonic_prefix(&revs
->diffopt
, "c/", cached
? "i/" : "w/");
622 diffcore_fix_diff_index();
623 diffcore_std(&revs
->diffopt
);
624 diff_flush(&revs
->diffopt
);
625 trace_performance_leave("diff-index");
629 int do_diff_cache(const struct object_id
*tree_oid
, struct diff_options
*opt
)
631 struct rev_info revs
;
633 repo_init_revisions(opt
->repo
, &revs
, NULL
);
634 copy_pathspec(&revs
.prune_data
, &opt
->pathspec
);
635 diff_setup_done(&revs
.diffopt
);
638 if (diff_cache(&revs
, tree_oid
, NULL
, 1))
640 clear_pathspec(&revs
.prune_data
);
644 int index_differs_from(struct repository
*r
,
645 const char *def
, const struct diff_flags
*flags
,
646 int ita_invisible_in_index
)
649 struct setup_revision_opt opt
;
651 repo_init_revisions(r
, &rev
, NULL
);
652 memset(&opt
, 0, sizeof(opt
));
654 setup_revisions(0, NULL
, &rev
, &opt
);
655 rev
.diffopt
.flags
.quick
= 1;
656 rev
.diffopt
.flags
.exit_with_status
= 1;
658 diff_flags_or(&rev
.diffopt
.flags
, flags
);
659 rev
.diffopt
.ita_invisible_in_index
= ita_invisible_in_index
;
660 run_diff_index(&rev
, 1);
661 object_array_clear(&rev
.pending
);
662 return (rev
.diffopt
.flags
.has_changes
!= 0);
665 static struct strbuf
*idiff_prefix_cb(struct diff_options
*opt
, void *data
)
670 void show_interdiff(const struct object_id
*oid1
, const struct object_id
*oid2
,
671 int indent
, struct diff_options
*diffopt
)
673 struct diff_options opts
;
674 struct strbuf prefix
= STRBUF_INIT
;
676 memcpy(&opts
, diffopt
, sizeof(opts
));
677 opts
.output_format
= DIFF_FORMAT_PATCH
;
678 opts
.output_prefix
= idiff_prefix_cb
;
679 strbuf_addchars(&prefix
, ' ', indent
);
680 opts
.output_prefix_data
= &prefix
;
681 diff_setup_done(&opts
);
683 diff_tree_oid(oid1
, oid2
, "", &opts
);
687 strbuf_release(&prefix
);