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
24 unsigned char sha1[20];
29 static const char builtin_diff_usage[] =
30 "git diff [<options>] [<commit> [<commit>]] [--] [<path>...]";
32 static void stuff_change(struct diff_options *opt,
33 unsigned old_mode, unsigned new_mode,
34 const unsigned char *old_sha1,
35 const unsigned char *new_sha1,
41 struct diff_filespec *one, *two;
43 if (!is_null_sha1(old_sha1) && !is_null_sha1(new_sha1) &&
44 !hashcmp(old_sha1, new_sha1) && (old_mode == new_mode))
47 if (DIFF_OPT_TST(opt, REVERSE_DIFF)) {
49 const unsigned char *tmp_u;
51 tmp = old_mode; old_mode = new_mode; new_mode = tmp;
52 tmp_u = old_sha1; old_sha1 = new_sha1; new_sha1 = tmp_u;
53 tmp_c = old_name; old_name = new_name; new_name = tmp_c;
57 (strncmp(old_name, opt->prefix, opt->prefix_length) ||
58 strncmp(new_name, opt->prefix, opt->prefix_length)))
61 one = alloc_filespec(old_name);
62 two = alloc_filespec(new_name);
63 fill_filespec(one, old_sha1, old_sha1_valid, old_mode);
64 fill_filespec(two, new_sha1, new_sha1_valid, new_mode);
66 diff_queue(&diff_queued_diff, one, two);
69 static int builtin_diff_b_f(struct rev_info *revs,
70 int argc, const char **argv,
71 struct blobinfo *blob)
73 /* Blob vs file in the working tree*/
78 usage(builtin_diff_usage);
80 GUARD_PATHSPEC(&revs->prune_data, PATHSPEC_FROMTOP | PATHSPEC_LITERAL);
81 path = revs->prune_data.items[0].match;
84 die_errno(_("failed to stat '%s'"), path);
85 if (!(S_ISREG(st.st_mode) || S_ISLNK(st.st_mode)))
86 die(_("'%s': not a regular file or symlink"), path);
88 diff_set_mnemonic_prefix(&revs->diffopt, "o/", "w/");
90 if (blob[0].mode == S_IFINVALID)
91 blob[0].mode = canon_mode(st.st_mode);
93 stuff_change(&revs->diffopt,
94 blob[0].mode, canon_mode(st.st_mode),
95 blob[0].sha1, null_sha1,
98 diffcore_std(&revs->diffopt);
99 diff_flush(&revs->diffopt);
103 static int builtin_diff_blobs(struct rev_info *revs,
104 int argc, const char **argv,
105 struct blobinfo *blob)
107 unsigned mode = canon_mode(S_IFREG | 0644);
110 usage(builtin_diff_usage);
112 if (blob[0].mode == S_IFINVALID)
115 if (blob[1].mode == S_IFINVALID)
118 stuff_change(&revs->diffopt,
119 blob[0].mode, blob[1].mode,
120 blob[0].sha1, blob[1].sha1,
122 blob[0].name, blob[1].name);
123 diffcore_std(&revs->diffopt);
124 diff_flush(&revs->diffopt);
128 static int builtin_diff_index(struct rev_info *revs,
129 int argc, const char **argv)
133 const char *arg = argv[1];
134 if (!strcmp(arg, "--cached") || !strcmp(arg, "--staged"))
137 usage(builtin_diff_usage);
141 * Make sure there is one revision (i.e. pending object),
142 * and there is no revision filtering parameters.
144 if (revs->pending.nr != 1 ||
145 revs->max_count != -1 || revs->min_age != -1 ||
147 usage(builtin_diff_usage);
150 if (read_cache_preload(&revs->diffopt.pathspec) < 0) {
151 perror("read_cache_preload");
154 } else if (read_cache() < 0) {
155 perror("read_cache");
158 return run_diff_index(revs, cached);
161 static int builtin_diff_tree(struct rev_info *revs,
162 int argc, const char **argv,
163 struct object_array_entry *ent0,
164 struct object_array_entry *ent1)
166 const unsigned char *(sha1[2]);
170 usage(builtin_diff_usage);
173 * We saw two trees, ent0 and ent1. If ent1 is uninteresting,
176 if (ent1->item->flags & UNINTERESTING)
178 sha1[swap] = ent0->item->oid.hash;
179 sha1[1 - swap] = ent1->item->oid.hash;
180 diff_tree_sha1(sha1[0], sha1[1], "", &revs->diffopt);
181 log_tree_diff_flush(revs);
185 static int builtin_diff_combined(struct rev_info *revs,
186 int argc, const char **argv,
187 struct object_array_entry *ent,
190 struct sha1_array parents = SHA1_ARRAY_INIT;
194 usage(builtin_diff_usage);
196 if (!revs->dense_combined_merges && !revs->combine_merges)
197 revs->dense_combined_merges = revs->combine_merges = 1;
198 for (i = 1; i < ents; i++)
199 sha1_array_append(&parents, ent[i].item->oid.hash);
200 diff_tree_combined(ent[0].item->oid.hash, &parents,
201 revs->dense_combined_merges, revs);
202 sha1_array_clear(&parents);
206 static void refresh_index_quietly(void)
208 struct lock_file *lock_file;
211 lock_file = xcalloc(1, sizeof(struct lock_file));
212 fd = hold_locked_index(lock_file, 0);
217 refresh_cache(REFRESH_QUIET|REFRESH_UNMERGED);
218 update_index_if_able(&the_index, lock_file);
221 static int builtin_diff_files(struct rev_info *revs, int argc, const char **argv)
223 unsigned int options = 0;
225 while (1 < argc && argv[1][0] == '-') {
226 if (!strcmp(argv[1], "--base"))
228 else if (!strcmp(argv[1], "--ours"))
230 else if (!strcmp(argv[1], "--theirs"))
232 else if (!strcmp(argv[1], "-q"))
233 options |= DIFF_SILENT_ON_REMOVED;
234 else if (!strcmp(argv[1], "-h"))
235 usage(builtin_diff_usage);
237 return error(_("invalid option: %s"), argv[1]);
242 * "diff --base" should not combine merges because it was not
243 * asked to. "diff -c" should not densify (if the user wants
244 * dense one, --cc can be explicitly asked for, or just rely
247 if (revs->max_count == -1 && !revs->combine_merges &&
248 (revs->diffopt.output_format & DIFF_FORMAT_PATCH))
249 revs->combine_merges = revs->dense_combined_merges = 1;
252 if (read_cache_preload(&revs->diffopt.pathspec) < 0) {
253 perror("read_cache_preload");
256 return run_diff_files(revs, options);
259 int cmd_diff(int argc, const char **argv, const char *prefix)
263 struct object_array ent = OBJECT_ARRAY_INIT;
264 int blobs = 0, paths = 0;
265 struct blobinfo blob[2];
266 int nongit = 0, no_index = 0;
270 * We could get N tree-ish in the rev.pending_objects list.
271 * Also there could be M blobs there, and P pathspecs.
274 * cache vs files (diff-files)
276 * compare two random blobs. P must be zero.
278 * compare a blob with a working tree file.
281 * tree vs cache (diff-index --cached)
284 * tree vs tree (diff-tree)
287 * compare two filesystem entities (aka --no-index).
289 * Other cases are errors.
292 /* Were we asked to do --no-index explicitly? */
293 for (i = 1; i < argc; i++) {
294 if (!strcmp(argv[i], "--")) {
298 if (!strcmp(argv[i], "--no-index"))
299 no_index = DIFF_NO_INDEX_EXPLICIT;
300 if (argv[i][0] != '-')
304 prefix = setup_git_directory_gently(&nongit);
308 * Treat git diff with at least one path outside of the
309 * repo the same as if the command would have been executed
310 * outside of a git repository. In this case it behaves
311 * the same way as "git diff --no-index <a> <b>", which acts
312 * as a colourful "diff" replacement.
314 if (nongit || ((argc == i + 2) &&
315 (!path_inside_repo(prefix, argv[i]) ||
316 !path_inside_repo(prefix, argv[i + 1]))))
317 no_index = DIFF_NO_INDEX_IMPLICIT;
322 init_diff_ui_defaults();
323 git_config(git_diff_ui_config, NULL);
324 precompose_argv(argc, argv);
326 init_revisions(&rev, prefix);
328 if (no_index && argc != i + 2) {
329 if (no_index == DIFF_NO_INDEX_IMPLICIT) {
331 * There was no --no-index and there were not two
332 * paths. It is possible that the user intended
333 * to do an inside-repository operation.
335 fprintf(stderr, "Not a git repository\n");
337 "To compare two paths outside a working tree:\n");
339 /* Give the usage message for non-repository usage and exit. */
340 usagef("git diff %s <path> <path>",
341 no_index == DIFF_NO_INDEX_EXPLICIT ?
342 "--no-index" : "[--no-index]");
346 /* If this is a no-index diff, just run it and exit there. */
347 diff_no_index(&rev, argc, argv);
349 /* Otherwise, we are doing the usual "git" diff */
350 rev.diffopt.skip_stat_unmatch = !!diff_auto_refresh_index;
352 /* Scale to real terminal size and respect statGraphWidth config */
353 rev.diffopt.stat_width = -1;
354 rev.diffopt.stat_graph_width = -1;
356 /* Default to let external and textconv be used */
357 DIFF_OPT_SET(&rev.diffopt, ALLOW_EXTERNAL);
358 DIFF_OPT_SET(&rev.diffopt, ALLOW_TEXTCONV);
361 die(_("Not a git repository"));
362 argc = setup_revisions(argc, argv, &rev, NULL);
363 if (!rev.diffopt.output_format) {
364 rev.diffopt.output_format = DIFF_FORMAT_PATCH;
365 diff_setup_done(&rev.diffopt);
368 DIFF_OPT_SET(&rev.diffopt, RECURSIVE);
370 setup_diff_pager(&rev.diffopt);
373 * Do we have --cached and not have a pending object, then
374 * default to HEAD by hand. Eek.
376 if (!rev.pending.nr) {
378 for (i = 1; i < argc; i++) {
379 const char *arg = argv[i];
380 if (!strcmp(arg, "--"))
382 else if (!strcmp(arg, "--cached") ||
383 !strcmp(arg, "--staged")) {
384 add_head_to_pending(&rev);
385 if (!rev.pending.nr) {
387 tree = lookup_tree(EMPTY_TREE_SHA1_BIN);
388 add_pending_object(&rev, &tree->object, "HEAD");
395 for (i = 0; i < rev.pending.nr; i++) {
396 struct object_array_entry *entry = &rev.pending.objects[i];
397 struct object *obj = entry->item;
398 const char *name = entry->name;
399 int flags = (obj->flags & UNINTERESTING);
401 obj = parse_object(obj->oid.hash);
402 obj = deref_tag(obj, NULL, 0);
404 die(_("invalid object '%s' given."), name);
405 if (obj->type == OBJ_COMMIT)
406 obj = &((struct commit *)obj)->tree->object;
408 if (obj->type == OBJ_TREE) {
410 add_object_array(obj, name, &ent);
411 } else if (obj->type == OBJ_BLOB) {
413 die(_("more than two blobs given: '%s'"), name);
414 hashcpy(blob[blobs].sha1, obj->oid.hash);
415 blob[blobs].name = name;
416 blob[blobs].mode = entry->mode;
420 die(_("unhandled object '%s' given."), name);
423 if (rev.prune_data.nr)
424 paths += rev.prune_data.nr;
427 * Now, do the arguments look reasonable?
432 result = builtin_diff_files(&rev, argc, argv);
436 usage(builtin_diff_usage);
437 result = builtin_diff_b_f(&rev, argc, argv, blob);
441 usage(builtin_diff_usage);
442 result = builtin_diff_blobs(&rev, argc, argv, blob);
445 usage(builtin_diff_usage);
449 usage(builtin_diff_usage);
450 else if (ent.nr == 1)
451 result = builtin_diff_index(&rev, argc, argv);
452 else if (ent.nr == 2)
453 result = builtin_diff_tree(&rev, argc, argv,
454 &ent.objects[0], &ent.objects[1]);
455 else if (ent.objects[0].item->flags & UNINTERESTING) {
457 * diff A...B where there is at least one merge base
458 * between A and B. We have ent.objects[0] ==
459 * merge-base, ent.objects[ents-2] == A, and
460 * ent.objects[ents-1] == B. Show diff between the
461 * base and B. Note that we pick one merge base at
462 * random if there are more than one.
464 result = builtin_diff_tree(&rev, argc, argv,
466 &ent.objects[ent.nr-1]);
468 result = builtin_diff_combined(&rev, argc, argv,
469 ent.objects, ent.nr);
470 result = diff_result_code(&rev.diffopt, result);
471 if (1 < rev.diffopt.skip_stat_unmatch)
472 refresh_index_quietly();