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"
22 * Has the work tree entity been removed?
24 * Return 1 if it was removed from the work tree, 0 if an entity to be
25 * compared with the cache entry ce still exists (the latter includes
26 * the case where a directory that is not a submodule repository
27 * exists for ce that is a submodule -- it is a submodule that is not
28 * checked out). Return negative for an error.
30 static int check_removed(const struct cache_entry *ce, struct stat *st)
32 if (lstat(ce->name, st) < 0) {
33 if (!is_missing_file_error(errno))
37 if (has_symlink_leading_path(ce->name, ce_namelen(ce)))
39 if (S_ISDIR(st->st_mode)) {
43 * If ce is already a gitlink, we can have a plain
44 * directory (i.e. the submodule is not checked out),
45 * or a checked out submodule. Either case this is not
46 * a case where something was removed from the work tree,
47 * so we will return 0.
49 * Otherwise, if the directory is not a submodule
50 * repository, that means ce which was a blob turned into
51 * a directory --- the blob was removed!
53 if (!S_ISGITLINK(ce->ce_mode) &&
54 resolve_gitlink_ref(ce->name, "HEAD", &sub))
61 * Has a file changed or has a submodule new commits or a dirty work tree?
63 * Return 1 when changes are detected, 0 otherwise. If the DIRTY_SUBMODULES
64 * option is set, the caller does not only want to know if a submodule is
65 * modified at all but wants to know all the conditions that are met (new
66 * commits, untracked content and/or modified content).
68 static int match_stat_with_submodule(struct diff_options *diffopt,
69 const struct cache_entry *ce,
70 struct stat *st, unsigned ce_option,
71 unsigned *dirty_submodule)
73 int changed = ce_match_stat(ce, st, ce_option);
74 if (S_ISGITLINK(ce->ce_mode)) {
75 struct diff_flags orig_flags = diffopt->flags;
76 if (!diffopt->flags.override_submodule_config)
77 set_diffopt_flags_from_submodule_config(diffopt, ce->name);
78 if (diffopt->flags.ignore_submodules)
80 else if (!diffopt->flags.ignore_dirty_submodules &&
81 (!changed || diffopt->flags.dirty_submodules))
82 *dirty_submodule = is_submodule_modified(ce->name,
83 diffopt->flags.ignore_untracked_in_submodules);
84 diffopt->flags = orig_flags;
89 int run_diff_files(struct rev_info *revs, unsigned int option)
92 int diff_unmerged_stage = revs->max_count;
93 unsigned ce_option = ((option & DIFF_RACY_IS_MODIFIED)
94 ? CE_MATCH_RACY_IS_DIRTY : 0);
95 uint64_t start = getnanotime();
97 diff_set_mnemonic_prefix(&revs->diffopt, "i/", "w/");
99 if (!(option & DIFF_SKIP_FSMONITOR))
100 refresh_fsmonitor(&the_index);
102 if (diff_unmerged_stage < 0)
103 diff_unmerged_stage = 2;
105 for (i = 0; i < entries; i++) {
106 unsigned int oldmode, newmode;
107 struct cache_entry *ce = active_cache[i];
109 unsigned dirty_submodule = 0;
110 const struct object_id *old_oid, *new_oid;
112 if (diff_can_quit_early(&revs->diffopt))
115 if (!ce_path_match(ce, &revs->prune_data, NULL))
119 struct combine_diff_path *dpath;
120 struct diff_filepair *pair;
121 unsigned int wt_mode = 0;
122 int num_compare_stages = 0;
126 path_len = ce_namelen(ce);
128 dpath = xmalloc(combine_diff_path_size(5, path_len));
129 dpath->path = (char *) &(dpath->parent[5]);
132 memcpy(dpath->path, ce->name, path_len);
133 dpath->path[path_len] = '\0';
135 memset(&(dpath->parent[0]), 0,
136 sizeof(struct combine_diff_parent)*5);
138 changed = check_removed(ce, &st);
140 wt_mode = ce_mode_from_stat(ce, st.st_mode);
148 dpath->mode = wt_mode;
150 while (i < entries) {
151 struct cache_entry *nce = active_cache[i];
154 if (strcmp(ce->name, nce->name))
157 /* Stage #2 (ours) is the first parent,
158 * stage #3 (theirs) is the second.
160 stage = ce_stage(nce);
162 int mode = nce->ce_mode;
163 num_compare_stages++;
164 oidcpy(&dpath->parent[stage - 2].oid,
166 dpath->parent[stage-2].mode = ce_mode_from_stat(nce, mode);
167 dpath->parent[stage-2].status =
168 DIFF_STATUS_MODIFIED;
171 /* diff against the proper unmerged stage */
172 if (stage == diff_unmerged_stage)
177 * Compensate for loop update
181 if (revs->combine_merges && num_compare_stages == 2) {
182 show_combined_diff(dpath, 2,
183 revs->dense_combined_merges,
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))
204 if (ce->ce_flags & CE_FSMONITOR_VALID && !(option & DIFF_SKIP_FSMONITOR))
207 /* If CE_VALID is set, don't look at workdir for file removal */
208 if (ce->ce_flags & CE_VALID) {
210 newmode = ce->ce_mode;
214 changed = check_removed(ce, &st);
220 diff_addremove(&revs->diffopt, '-', ce->ce_mode,
222 !is_null_oid(&ce->oid),
225 } else if (revs->diffopt.ita_invisible_in_index &&
226 ce_intent_to_add(ce)) {
227 diff_addremove(&revs->diffopt, '+', ce->ce_mode,
228 the_hash_algo->empty_tree, 0,
233 changed = match_stat_with_submodule(&revs->diffopt, ce, &st,
234 ce_option, &dirty_submodule);
235 newmode = ce_mode_from_stat(ce, st.st_mode);
238 if (!changed && !dirty_submodule) {
239 ce_mark_uptodate(ce);
240 mark_fsmonitor_valid(ce);
241 if (!revs->diffopt.flags.find_copies_harder)
244 oldmode = ce->ce_mode;
246 new_oid = changed ? &null_oid : &ce->oid;
247 diff_change(&revs->diffopt, oldmode, newmode,
249 !is_null_oid(old_oid),
250 !is_null_oid(new_oid),
251 ce->name, 0, dirty_submodule);
254 diffcore_std(&revs->diffopt);
255 diff_flush(&revs->diffopt);
256 trace_performance_since(start, "diff-files");
264 /* A file entry went away or appeared */
265 static void diff_index_show_file(struct rev_info *revs,
267 const struct cache_entry *ce,
268 const struct object_id *oid, int oid_valid,
270 unsigned dirty_submodule)
272 diff_addremove(&revs->diffopt, prefix[0], mode,
273 oid, oid_valid, ce->name, dirty_submodule);
276 static int get_stat_data(const struct cache_entry *ce,
277 const struct object_id **oidp,
279 int cached, int match_missing,
280 unsigned *dirty_submodule, struct diff_options *diffopt)
282 const struct object_id *oid = &ce->oid;
283 unsigned int mode = ce->ce_mode;
285 if (!cached && !ce_uptodate(ce)) {
288 changed = check_removed(ce, &st);
299 changed = match_stat_with_submodule(diffopt, ce, &st,
302 mode = ce_mode_from_stat(ce, st.st_mode);
312 static void show_new_file(struct rev_info *revs,
313 const struct cache_entry *new_file,
314 int cached, int match_missing)
316 const struct object_id *oid;
318 unsigned dirty_submodule = 0;
321 * New file in the index: it might actually be different in
324 if (get_stat_data(new_file, &oid, &mode, cached, match_missing,
325 &dirty_submodule, &revs->diffopt) < 0)
328 diff_index_show_file(revs, "+", new_file, oid, !is_null_oid(oid), mode, dirty_submodule);
331 static int show_modified(struct rev_info *revs,
332 const struct cache_entry *old_entry,
333 const struct cache_entry *new_entry,
335 int cached, int match_missing)
337 unsigned int mode, oldmode;
338 const struct object_id *oid;
339 unsigned dirty_submodule = 0;
341 if (get_stat_data(new_entry, &oid, &mode, cached, match_missing,
342 &dirty_submodule, &revs->diffopt) < 0) {
344 diff_index_show_file(revs, "-", old_entry,
345 &old_entry->oid, 1, old_entry->ce_mode,
350 if (revs->combine_merges && !cached &&
351 (oidcmp(oid, &old_entry->oid) || oidcmp(&old_entry->oid, &new_entry->oid))) {
352 struct combine_diff_path *p;
353 int pathlen = ce_namelen(new_entry);
355 p = xmalloc(combine_diff_path_size(2, pathlen));
356 p->path = (char *) &p->parent[2];
358 memcpy(p->path, new_entry->name, pathlen);
359 p->path[pathlen] = 0;
362 memset(p->parent, 0, 2 * sizeof(struct combine_diff_parent));
363 p->parent[0].status = DIFF_STATUS_MODIFIED;
364 p->parent[0].mode = new_entry->ce_mode;
365 oidcpy(&p->parent[0].oid, &new_entry->oid);
366 p->parent[1].status = DIFF_STATUS_MODIFIED;
367 p->parent[1].mode = old_entry->ce_mode;
368 oidcpy(&p->parent[1].oid, &old_entry->oid);
369 show_combined_diff(p, 2, revs->dense_combined_merges, revs);
374 oldmode = old_entry->ce_mode;
375 if (mode == oldmode && !oidcmp(oid, &old_entry->oid) && !dirty_submodule &&
376 !revs->diffopt.flags.find_copies_harder)
379 diff_change(&revs->diffopt, oldmode, mode,
380 &old_entry->oid, oid, 1, !is_null_oid(oid),
381 old_entry->name, 0, dirty_submodule);
386 * This gets a mix of an existing index and a tree, one pathname entry
387 * at a time. The index entry may be a single stage-0 one, but it could
388 * also be multiple unmerged entries (in which case idx_pos/idx_nr will
389 * give you the position and number of entries in the index).
391 static void do_oneway_diff(struct unpack_trees_options *o,
392 const struct cache_entry *idx,
393 const struct cache_entry *tree)
395 struct rev_info *revs = o->unpack_data;
396 int match_missing, cached;
398 /* i-t-a entries do not actually exist in the index */
399 if (revs->diffopt.ita_invisible_in_index &&
400 idx && ce_intent_to_add(idx)) {
403 return; /* nothing to diff.. */
406 /* if the entry is not checked out, don't examine work tree */
407 cached = o->index_only ||
408 (idx && ((idx->ce_flags & CE_VALID) || ce_skip_worktree(idx)));
410 * Backward compatibility wart - "diff-index -m" does
411 * not mean "do not ignore merges", but "match_missing".
413 * But with the revision flag parsing, that's found in
414 * "!revs->ignore_merges".
416 match_missing = !revs->ignore_merges;
418 if (cached && idx && ce_stage(idx)) {
419 struct diff_filepair *pair;
420 pair = diff_unmerge(&revs->diffopt, idx->name);
422 fill_filespec(pair->one, &tree->oid, 1,
428 * Something added to the tree?
431 show_new_file(revs, idx, cached, match_missing);
436 * Something removed from the tree?
439 diff_index_show_file(revs, "-", tree, &tree->oid, 1,
444 /* Show difference between old and new */
445 show_modified(revs, tree, idx, 1, cached, match_missing);
449 * The unpack_trees() interface is designed for merging, so
450 * the different source entries are designed primarily for
451 * the source trees, with the old index being really mainly
452 * used for being replaced by the result.
454 * For diffing, the index is more important, and we only have a
457 * We're supposed to advance o->pos to skip what we have already processed.
459 * This wrapper makes it all more readable, and takes care of all
460 * the fairly complex unpack_trees() semantic requirements, including
461 * the skipping, the path matching, the type conflict cases etc.
463 static int oneway_diff(const struct cache_entry * const *src,
464 struct unpack_trees_options *o)
466 const struct cache_entry *idx = src[0];
467 const struct cache_entry *tree = src[1];
468 struct rev_info *revs = o->unpack_data;
471 * Unpack-trees generates a DF/conflict entry if
472 * there was a directory in the index and a tree
473 * in the tree. From a diff standpoint, that's a
474 * delete of the tree and a create of the file.
476 if (tree == o->df_conflict_entry)
479 if (ce_path_match(idx ? idx : tree, &revs->prune_data, NULL)) {
480 do_oneway_diff(o, idx, tree);
481 if (diff_can_quit_early(&revs->diffopt)) {
482 o->exiting_early = 1;
490 static int diff_cache(struct rev_info *revs,
491 const struct object_id *tree_oid,
492 const char *tree_name,
497 struct unpack_trees_options opts;
499 tree = parse_tree_indirect(tree_oid);
501 return error("bad tree object %s",
502 tree_name ? tree_name : oid_to_hex(tree_oid));
503 memset(&opts, 0, sizeof(opts));
505 opts.index_only = cached;
506 opts.diff_index_cached = (cached &&
507 !revs->diffopt.flags.find_copies_harder);
509 opts.fn = oneway_diff;
510 opts.unpack_data = revs;
511 opts.src_index = &the_index;
512 opts.dst_index = NULL;
513 opts.pathspec = &revs->diffopt.pathspec;
514 opts.pathspec->recursive = 1;
516 init_tree_desc(&t, tree->buffer, tree->size);
517 return unpack_trees(1, &t, &opts);
520 int run_diff_index(struct rev_info *revs, int cached)
522 struct object_array_entry *ent;
523 uint64_t start = getnanotime();
525 ent = revs->pending.objects;
526 if (diff_cache(revs, &ent->item->oid, ent->name, cached))
529 diff_set_mnemonic_prefix(&revs->diffopt, "c/", cached ? "i/" : "w/");
530 diffcore_fix_diff_index(&revs->diffopt);
531 diffcore_std(&revs->diffopt);
532 diff_flush(&revs->diffopt);
533 trace_performance_since(start, "diff-index");
537 int do_diff_cache(const struct object_id *tree_oid, struct diff_options *opt)
539 struct rev_info revs;
541 init_revisions(&revs, NULL);
542 copy_pathspec(&revs.prune_data, &opt->pathspec);
545 if (diff_cache(&revs, tree_oid, NULL, 1))
550 int index_differs_from(const char *def, const struct diff_flags *flags,
551 int ita_invisible_in_index)
554 struct setup_revision_opt opt;
556 init_revisions(&rev, NULL);
557 memset(&opt, 0, sizeof(opt));
559 setup_revisions(0, NULL, &rev, &opt);
560 rev.diffopt.flags.quick = 1;
561 rev.diffopt.flags.exit_with_status = 1;
563 diff_flags_or(&rev.diffopt.flags, flags);
564 rev.diffopt.ita_invisible_in_index = ita_invisible_in_index;
565 run_diff_index(&rev, 1);
566 object_array_clear(&rev.pending);
567 return (rev.diffopt.flags.has_changes != 0);