4 * Copyright (c) 2006 Junio C Hamano
16 #include "submodule.h"
17 #include "sha1-array.h"
20 unsigned char sha1[20];
25 static const char builtin_diff_usage[] =
26 "git diff [<options>] [<commit> [<commit>]] [--] [<path>...]";
28 static void stuff_change(struct diff_options *opt,
29 unsigned old_mode, unsigned new_mode,
30 const unsigned char *old_sha1,
31 const unsigned char *new_sha1,
35 struct diff_filespec *one, *two;
37 if (!is_null_sha1(old_sha1) && !is_null_sha1(new_sha1) &&
38 !hashcmp(old_sha1, new_sha1) && (old_mode == new_mode))
41 if (DIFF_OPT_TST(opt, REVERSE_DIFF)) {
43 const unsigned char *tmp_u;
45 tmp = old_mode; old_mode = new_mode; new_mode = tmp;
46 tmp_u = old_sha1; old_sha1 = new_sha1; new_sha1 = tmp_u;
47 tmp_c = old_name; old_name = new_name; new_name = tmp_c;
51 (strncmp(old_name, opt->prefix, opt->prefix_length) ||
52 strncmp(new_name, opt->prefix, opt->prefix_length)))
55 one = alloc_filespec(old_name);
56 two = alloc_filespec(new_name);
57 fill_filespec(one, old_sha1, old_mode);
58 fill_filespec(two, new_sha1, new_mode);
60 diff_queue(&diff_queued_diff, one, two);
63 static int builtin_diff_b_f(struct rev_info *revs,
64 int argc, const char **argv,
65 struct blobinfo *blob,
68 /* Blob vs file in the working tree*/
72 usage(builtin_diff_usage);
75 die_errno(_("failed to stat '%s'"), path);
76 if (!(S_ISREG(st.st_mode) || S_ISLNK(st.st_mode)))
77 die(_("'%s': not a regular file or symlink"), path);
79 diff_set_mnemonic_prefix(&revs->diffopt, "o/", "w/");
81 if (blob[0].mode == S_IFINVALID)
82 blob[0].mode = canon_mode(st.st_mode);
84 stuff_change(&revs->diffopt,
85 blob[0].mode, canon_mode(st.st_mode),
86 blob[0].sha1, null_sha1,
88 diffcore_std(&revs->diffopt);
89 diff_flush(&revs->diffopt);
93 static int builtin_diff_blobs(struct rev_info *revs,
94 int argc, const char **argv,
95 struct blobinfo *blob)
97 unsigned mode = canon_mode(S_IFREG | 0644);
100 usage(builtin_diff_usage);
102 if (blob[0].mode == S_IFINVALID)
105 if (blob[1].mode == S_IFINVALID)
108 stuff_change(&revs->diffopt,
109 blob[0].mode, blob[1].mode,
110 blob[0].sha1, blob[1].sha1,
111 blob[0].name, blob[1].name);
112 diffcore_std(&revs->diffopt);
113 diff_flush(&revs->diffopt);
117 static int builtin_diff_index(struct rev_info *revs,
118 int argc, const char **argv)
122 const char *arg = argv[1];
123 if (!strcmp(arg, "--cached") || !strcmp(arg, "--staged"))
126 usage(builtin_diff_usage);
132 * Make sure there is one revision (i.e. pending object),
133 * and there is no revision filtering parameters.
135 if (revs->pending.nr != 1 ||
136 revs->max_count != -1 || revs->min_age != -1 ||
138 usage(builtin_diff_usage);
139 if (read_cache_preload(revs->diffopt.pathspec.raw) < 0) {
140 perror("read_cache_preload");
143 return run_diff_index(revs, cached);
146 static int builtin_diff_tree(struct rev_info *revs,
147 int argc, const char **argv,
148 struct object_array_entry *ent)
150 const unsigned char *(sha1[2]);
154 usage(builtin_diff_usage);
156 /* We saw two trees, ent[0] and ent[1].
157 * if ent[1] is uninteresting, they are swapped
159 if (ent[1].item->flags & UNINTERESTING)
161 sha1[swap] = ent[0].item->sha1;
162 sha1[1-swap] = ent[1].item->sha1;
163 diff_tree_sha1(sha1[0], sha1[1], "", &revs->diffopt);
164 log_tree_diff_flush(revs);
168 static int builtin_diff_combined(struct rev_info *revs,
169 int argc, const char **argv,
170 struct object_array_entry *ent,
173 struct sha1_array parents = SHA1_ARRAY_INIT;
177 usage(builtin_diff_usage);
179 if (!revs->dense_combined_merges && !revs->combine_merges)
180 revs->dense_combined_merges = revs->combine_merges = 1;
181 for (i = 1; i < ents; i++)
182 sha1_array_append(&parents, ent[i].item->sha1);
183 diff_tree_combined(ent[0].item->sha1, &parents,
184 revs->dense_combined_merges, revs);
185 sha1_array_clear(&parents);
189 static void refresh_index_quietly(void)
191 struct lock_file *lock_file;
194 lock_file = xcalloc(1, sizeof(struct lock_file));
195 fd = hold_locked_index(lock_file, 0);
200 refresh_cache(REFRESH_QUIET|REFRESH_UNMERGED);
201 update_index_if_able(&the_index, lock_file);
204 static int builtin_diff_files(struct rev_info *revs, int argc, const char **argv)
206 unsigned int options = 0;
208 while (1 < argc && argv[1][0] == '-') {
209 if (!strcmp(argv[1], "--base"))
211 else if (!strcmp(argv[1], "--ours"))
213 else if (!strcmp(argv[1], "--theirs"))
215 else if (!strcmp(argv[1], "-q"))
216 options |= DIFF_SILENT_ON_REMOVED;
217 else if (!strcmp(argv[1], "-h"))
218 usage(builtin_diff_usage);
220 return error(_("invalid option: %s"), argv[1]);
225 * "diff --base" should not combine merges because it was not
226 * asked to. "diff -c" should not densify (if the user wants
227 * dense one, --cc can be explicitly asked for, or just rely
230 if (revs->max_count == -1 && !revs->combine_merges &&
231 (revs->diffopt.output_format & DIFF_FORMAT_PATCH))
232 revs->combine_merges = revs->dense_combined_merges = 1;
235 if (read_cache_preload(revs->diffopt.pathspec.raw) < 0) {
236 perror("read_cache_preload");
239 return run_diff_files(revs, options);
242 int cmd_diff(int argc, const char **argv, const char *prefix)
246 struct object_array_entry ent[100];
247 int ents = 0, blobs = 0, paths = 0;
248 const char *path = NULL;
249 struct blobinfo blob[2];
254 * We could get N tree-ish in the rev.pending_objects list.
255 * Also there could be M blobs there, and P pathspecs.
258 * cache vs files (diff-files)
260 * compare two random blobs. P must be zero.
262 * compare a blob with a working tree file.
265 * tree vs cache (diff-index --cached)
268 * tree vs tree (diff-tree)
271 * compare two filesystem entities (aka --no-index).
273 * Other cases are errors.
276 prefix = setup_git_directory_gently(&nongit);
278 git_config(git_diff_ui_config, NULL);
280 init_revisions(&rev, prefix);
282 /* If this is a no-index diff, just run it and exit there. */
283 diff_no_index(&rev, argc, argv, nongit, prefix);
285 /* Otherwise, we are doing the usual "git" diff */
286 rev.diffopt.skip_stat_unmatch = !!diff_auto_refresh_index;
288 /* Scale to real terminal size and respect statGraphWidth config */
289 rev.diffopt.stat_width = -1;
290 rev.diffopt.stat_graph_width = -1;
292 /* Default to let external and textconv be used */
293 DIFF_OPT_SET(&rev.diffopt, ALLOW_EXTERNAL);
294 DIFF_OPT_SET(&rev.diffopt, ALLOW_TEXTCONV);
297 die(_("Not a git repository"));
298 argc = setup_revisions(argc, argv, &rev, NULL);
299 if (!rev.diffopt.output_format) {
300 rev.diffopt.output_format = DIFF_FORMAT_PATCH;
301 diff_setup_done(&rev.diffopt);
304 DIFF_OPT_SET(&rev.diffopt, RECURSIVE);
306 setup_diff_pager(&rev.diffopt);
309 * Do we have --cached and not have a pending object, then
310 * default to HEAD by hand. Eek.
312 if (!rev.pending.nr) {
314 for (i = 1; i < argc; i++) {
315 const char *arg = argv[i];
316 if (!strcmp(arg, "--"))
318 else if (!strcmp(arg, "--cached") ||
319 !strcmp(arg, "--staged")) {
320 add_head_to_pending(&rev);
321 if (!rev.pending.nr) {
323 tree = lookup_tree(EMPTY_TREE_SHA1_BIN);
324 add_pending_object(&rev, &tree->object, "HEAD");
331 for (i = 0; i < rev.pending.nr; i++) {
332 struct object_array_entry *list = rev.pending.objects+i;
333 struct object *obj = list->item;
334 const char *name = list->name;
335 int flags = (obj->flags & UNINTERESTING);
337 obj = parse_object(obj->sha1);
338 obj = deref_tag(obj, NULL, 0);
340 die(_("invalid object '%s' given."), name);
341 if (obj->type == OBJ_COMMIT)
342 obj = &((struct commit *)obj)->tree->object;
343 if (obj->type == OBJ_TREE) {
344 if (ARRAY_SIZE(ent) <= ents)
345 die(_("more than %d trees given: '%s'"),
346 (int) ARRAY_SIZE(ent), name);
348 ent[ents].item = obj;
349 ent[ents].name = name;
353 if (obj->type == OBJ_BLOB) {
355 die(_("more than two blobs given: '%s'"), name);
356 hashcpy(blob[blobs].sha1, obj->sha1);
357 blob[blobs].name = name;
358 blob[blobs].mode = list->mode;
363 die(_("unhandled object '%s' given."), name);
365 if (rev.prune_data.nr) {
367 path = rev.prune_data.items[0].match;
368 paths += rev.prune_data.nr;
372 * Now, do the arguments look reasonable?
377 result = builtin_diff_files(&rev, argc, argv);
381 usage(builtin_diff_usage);
382 result = builtin_diff_b_f(&rev, argc, argv, blob, path);
386 usage(builtin_diff_usage);
387 result = builtin_diff_blobs(&rev, argc, argv, blob);
390 usage(builtin_diff_usage);
394 usage(builtin_diff_usage);
396 result = builtin_diff_index(&rev, argc, argv);
398 result = builtin_diff_tree(&rev, argc, argv, ent);
399 else if (ent[0].item->flags & UNINTERESTING) {
401 * diff A...B where there is at least one merge base
402 * between A and B. We have ent[0] == merge-base,
403 * ent[ents-2] == A, and ent[ents-1] == B. Show diff
404 * between the base and B. Note that we pick one
405 * merge base at random if there are more than one.
407 ent[1] = ent[ents-1];
408 result = builtin_diff_tree(&rev, argc, argv, ent);
410 result = builtin_diff_combined(&rev, argc, argv,
412 result = diff_result_code(&rev.diffopt, result);
413 if (1 < rev.diffopt.skip_stat_unmatch)
414 refresh_index_quietly();
418 void setup_diff_pager(struct diff_options *opt)
421 * If the user asked for our exit code, then either they want --quiet
422 * or --exit-code. We should definitely not bother with a pager in the
423 * former case, as we will generate no output. Since we still properly
424 * report our exit code even when a pager is run, we _could_ run a
425 * pager with --exit-code. But since we have not done so historically,
426 * and because it is easy to find people oneline advising "git diff
427 * --exit-code" in hooks and other scripts, we do not do so.
429 if (!DIFF_OPT_TST(opt, EXIT_WITH_STATUS) &&
430 check_pager_config("diff") != 0)