4 * Copyright (c) 2006 Junio C Hamano
17 #include "submodule.h"
18 #include "sha1-array.h"
20 #define DIFF_NO_INDEX_EXPLICIT 1
21 #define DIFF_NO_INDEX_IMPLICIT 2
23 static const char builtin_diff_usage[] =
24 "git diff [<options>] [<commit> [<commit>]] [--] [<path>...]";
26 static const char *blob_path(struct object_array_entry *entry)
28 return entry->path ? entry->path : entry->name;
31 static void stuff_change(struct diff_options *opt,
32 unsigned old_mode, unsigned new_mode,
33 const struct object_id *old_oid,
34 const struct object_id *new_oid,
40 struct diff_filespec *one, *two;
42 if (!is_null_oid(old_oid) && !is_null_oid(new_oid) &&
43 !oidcmp(old_oid, new_oid) && (old_mode == new_mode))
46 if (DIFF_OPT_TST(opt, REVERSE_DIFF)) {
47 SWAP(old_mode, new_mode);
48 SWAP(old_oid, new_oid);
49 SWAP(old_path, new_path);
53 (strncmp(old_path, opt->prefix, opt->prefix_length) ||
54 strncmp(new_path, opt->prefix, opt->prefix_length)))
57 one = alloc_filespec(old_path);
58 two = alloc_filespec(new_path);
59 fill_filespec(one, old_oid, old_oid_valid, old_mode);
60 fill_filespec(two, new_oid, new_oid_valid, new_mode);
62 diff_queue(&diff_queued_diff, one, two);
65 static int builtin_diff_b_f(struct rev_info *revs,
66 int argc, const char **argv,
67 struct object_array_entry **blob)
69 /* Blob vs file in the working tree*/
74 usage(builtin_diff_usage);
76 GUARD_PATHSPEC(&revs->prune_data, PATHSPEC_FROMTOP | PATHSPEC_LITERAL);
77 path = revs->prune_data.items[0].match;
80 die_errno(_("failed to stat '%s'"), path);
81 if (!(S_ISREG(st.st_mode) || S_ISLNK(st.st_mode)))
82 die(_("'%s': not a regular file or symlink"), path);
84 diff_set_mnemonic_prefix(&revs->diffopt, "o/", "w/");
86 if (blob[0]->mode == S_IFINVALID)
87 blob[0]->mode = canon_mode(st.st_mode);
89 stuff_change(&revs->diffopt,
90 blob[0]->mode, canon_mode(st.st_mode),
91 &blob[0]->item->oid, &null_oid,
93 blob[0]->path ? blob[0]->path : path,
95 diffcore_std(&revs->diffopt);
96 diff_flush(&revs->diffopt);
100 static int builtin_diff_blobs(struct rev_info *revs,
101 int argc, const char **argv,
102 struct object_array_entry **blob)
104 unsigned mode = canon_mode(S_IFREG | 0644);
107 usage(builtin_diff_usage);
109 if (blob[0]->mode == S_IFINVALID)
110 blob[0]->mode = mode;
112 if (blob[1]->mode == S_IFINVALID)
113 blob[1]->mode = mode;
115 stuff_change(&revs->diffopt,
116 blob[0]->mode, blob[1]->mode,
117 &blob[0]->item->oid, &blob[1]->item->oid,
119 blob_path(blob[0]), blob_path(blob[1]));
120 diffcore_std(&revs->diffopt);
121 diff_flush(&revs->diffopt);
125 static int builtin_diff_index(struct rev_info *revs,
126 int argc, const char **argv)
130 const char *arg = argv[1];
131 if (!strcmp(arg, "--cached") || !strcmp(arg, "--staged"))
134 usage(builtin_diff_usage);
138 * Make sure there is one revision (i.e. pending object),
139 * and there is no revision filtering parameters.
141 if (revs->pending.nr != 1 ||
142 revs->max_count != -1 || revs->min_age != -1 ||
144 usage(builtin_diff_usage);
147 if (read_cache_preload(&revs->diffopt.pathspec) < 0) {
148 perror("read_cache_preload");
151 } else if (read_cache() < 0) {
152 perror("read_cache");
155 return run_diff_index(revs, cached);
158 static int builtin_diff_tree(struct rev_info *revs,
159 int argc, const char **argv,
160 struct object_array_entry *ent0,
161 struct object_array_entry *ent1)
163 const struct object_id *(oid[2]);
167 usage(builtin_diff_usage);
170 * We saw two trees, ent0 and ent1. If ent1 is uninteresting,
173 if (ent1->item->flags & UNINTERESTING)
175 oid[swap] = &ent0->item->oid;
176 oid[1 - swap] = &ent1->item->oid;
177 diff_tree_oid(oid[0], oid[1], "", &revs->diffopt);
178 log_tree_diff_flush(revs);
182 static int builtin_diff_combined(struct rev_info *revs,
183 int argc, const char **argv,
184 struct object_array_entry *ent,
187 struct oid_array parents = OID_ARRAY_INIT;
191 usage(builtin_diff_usage);
193 if (!revs->dense_combined_merges && !revs->combine_merges)
194 revs->dense_combined_merges = revs->combine_merges = 1;
195 for (i = 1; i < ents; i++)
196 oid_array_append(&parents, &ent[i].item->oid);
197 diff_tree_combined(&ent[0].item->oid, &parents,
198 revs->dense_combined_merges, revs);
199 oid_array_clear(&parents);
203 static void refresh_index_quietly(void)
205 struct lock_file *lock_file;
208 lock_file = xcalloc(1, sizeof(struct lock_file));
209 fd = hold_locked_index(lock_file, 0);
214 refresh_cache(REFRESH_QUIET|REFRESH_UNMERGED);
215 update_index_if_able(&the_index, lock_file);
218 static int builtin_diff_files(struct rev_info *revs, int argc, const char **argv)
220 unsigned int options = 0;
222 while (1 < argc && argv[1][0] == '-') {
223 if (!strcmp(argv[1], "--base"))
225 else if (!strcmp(argv[1], "--ours"))
227 else if (!strcmp(argv[1], "--theirs"))
229 else if (!strcmp(argv[1], "-q"))
230 options |= DIFF_SILENT_ON_REMOVED;
231 else if (!strcmp(argv[1], "-h"))
232 usage(builtin_diff_usage);
234 return error(_("invalid option: %s"), argv[1]);
239 * "diff --base" should not combine merges because it was not
240 * asked to. "diff -c" should not densify (if the user wants
241 * dense one, --cc can be explicitly asked for, or just rely
244 if (revs->max_count == -1 && !revs->combine_merges &&
245 (revs->diffopt.output_format & DIFF_FORMAT_PATCH))
246 revs->combine_merges = revs->dense_combined_merges = 1;
249 if (read_cache_preload(&revs->diffopt.pathspec) < 0) {
250 perror("read_cache_preload");
253 return run_diff_files(revs, options);
256 int cmd_diff(int argc, const char **argv, const char *prefix)
260 struct object_array ent = OBJECT_ARRAY_INIT;
261 int blobs = 0, paths = 0;
262 struct object_array_entry *blob[2];
263 int nongit = 0, no_index = 0;
267 * We could get N tree-ish in the rev.pending_objects list.
268 * Also there could be M blobs there, and P pathspecs.
271 * cache vs files (diff-files)
273 * compare two random blobs. P must be zero.
275 * compare a blob with a working tree file.
278 * tree vs cache (diff-index --cached)
281 * tree vs tree (diff-tree)
284 * compare two filesystem entities (aka --no-index).
286 * Other cases are errors.
289 /* Were we asked to do --no-index explicitly? */
290 for (i = 1; i < argc; i++) {
291 if (!strcmp(argv[i], "--")) {
295 if (!strcmp(argv[i], "--no-index"))
296 no_index = DIFF_NO_INDEX_EXPLICIT;
297 if (argv[i][0] != '-')
301 prefix = setup_git_directory_gently(&nongit);
305 * Treat git diff with at least one path outside of the
306 * repo the same as if the command would have been executed
307 * outside of a git repository. In this case it behaves
308 * the same way as "git diff --no-index <a> <b>", which acts
309 * as a colourful "diff" replacement.
311 if (nongit || ((argc == i + 2) &&
312 (!path_inside_repo(prefix, argv[i]) ||
313 !path_inside_repo(prefix, argv[i + 1]))))
314 no_index = DIFF_NO_INDEX_IMPLICIT;
319 init_diff_ui_defaults();
320 git_config(git_diff_ui_config, NULL);
321 precompose_argv(argc, argv);
323 init_revisions(&rev, prefix);
325 if (no_index && argc != i + 2) {
326 if (no_index == DIFF_NO_INDEX_IMPLICIT) {
328 * There was no --no-index and there were not two
329 * paths. It is possible that the user intended
330 * to do an inside-repository operation.
332 fprintf(stderr, "Not a git repository\n");
334 "To compare two paths outside a working tree:\n");
336 /* Give the usage message for non-repository usage and exit. */
337 usagef("git diff %s <path> <path>",
338 no_index == DIFF_NO_INDEX_EXPLICIT ?
339 "--no-index" : "[--no-index]");
343 /* If this is a no-index diff, just run it and exit there. */
344 diff_no_index(&rev, argc, argv);
346 /* Otherwise, we are doing the usual "git" diff */
347 rev.diffopt.skip_stat_unmatch = !!diff_auto_refresh_index;
349 /* Scale to real terminal size and respect statGraphWidth config */
350 rev.diffopt.stat_width = -1;
351 rev.diffopt.stat_graph_width = -1;
353 /* Default to let external and textconv be used */
354 DIFF_OPT_SET(&rev.diffopt, ALLOW_EXTERNAL);
355 DIFF_OPT_SET(&rev.diffopt, ALLOW_TEXTCONV);
358 die(_("Not a git repository"));
359 argc = setup_revisions(argc, argv, &rev, NULL);
360 if (!rev.diffopt.output_format) {
361 rev.diffopt.output_format = DIFF_FORMAT_PATCH;
362 diff_setup_done(&rev.diffopt);
365 DIFF_OPT_SET(&rev.diffopt, RECURSIVE);
367 setup_diff_pager(&rev.diffopt);
370 * Do we have --cached and not have a pending object, then
371 * default to HEAD by hand. Eek.
373 if (!rev.pending.nr) {
375 for (i = 1; i < argc; i++) {
376 const char *arg = argv[i];
377 if (!strcmp(arg, "--"))
379 else if (!strcmp(arg, "--cached") ||
380 !strcmp(arg, "--staged")) {
381 add_head_to_pending(&rev);
382 if (!rev.pending.nr) {
384 tree = lookup_tree(&empty_tree_oid);
385 add_pending_object(&rev, &tree->object, "HEAD");
392 for (i = 0; i < rev.pending.nr; i++) {
393 struct object_array_entry *entry = &rev.pending.objects[i];
394 struct object *obj = entry->item;
395 const char *name = entry->name;
396 int flags = (obj->flags & UNINTERESTING);
398 obj = parse_object(&obj->oid);
399 obj = deref_tag(obj, NULL, 0);
401 die(_("invalid object '%s' given."), name);
402 if (obj->type == OBJ_COMMIT)
403 obj = &((struct commit *)obj)->tree->object;
405 if (obj->type == OBJ_TREE) {
407 add_object_array(obj, name, &ent);
408 } else if (obj->type == OBJ_BLOB) {
410 die(_("more than two blobs given: '%s'"), name);
415 die(_("unhandled object '%s' given."), name);
418 if (rev.prune_data.nr)
419 paths += rev.prune_data.nr;
422 * Now, do the arguments look reasonable?
427 result = builtin_diff_files(&rev, argc, argv);
431 usage(builtin_diff_usage);
432 result = builtin_diff_b_f(&rev, argc, argv, blob);
436 usage(builtin_diff_usage);
437 result = builtin_diff_blobs(&rev, argc, argv, blob);
440 usage(builtin_diff_usage);
444 usage(builtin_diff_usage);
445 else if (ent.nr == 1)
446 result = builtin_diff_index(&rev, argc, argv);
447 else if (ent.nr == 2)
448 result = builtin_diff_tree(&rev, argc, argv,
449 &ent.objects[0], &ent.objects[1]);
450 else if (ent.objects[0].item->flags & UNINTERESTING) {
452 * diff A...B where there is at least one merge base
453 * between A and B. We have ent.objects[0] ==
454 * merge-base, ent.objects[ents-2] == A, and
455 * ent.objects[ents-1] == B. Show diff between the
456 * base and B. Note that we pick one merge base at
457 * random if there are more than one.
459 result = builtin_diff_tree(&rev, argc, argv,
461 &ent.objects[ent.nr-1]);
463 result = builtin_diff_combined(&rev, argc, argv,
464 ent.objects, ent.nr);
465 result = diff_result_code(&rev.diffopt, result);
466 if (1 < rev.diffopt.skip_stat_unmatch)
467 refresh_index_quietly();