4 * Copyright (c) 2006 Junio C Hamano
6 #define USE_THE_INDEX_COMPATIBILITY_MACROS
19 #include "submodule.h"
20 #include "oid-array.h"
22 #define DIFF_NO_INDEX_EXPLICIT 1
23 #define DIFF_NO_INDEX_IMPLICIT 2
25 static const char builtin_diff_usage
[] =
26 "git diff [<options>] [<commit> [<commit>]] [--] [<path>...]";
28 static const char *blob_path(struct object_array_entry
*entry
)
30 return entry
->path
? entry
->path
: entry
->name
;
33 static void stuff_change(struct diff_options
*opt
,
34 unsigned old_mode
, unsigned new_mode
,
35 const struct object_id
*old_oid
,
36 const struct object_id
*new_oid
,
42 struct diff_filespec
*one
, *two
;
44 if (!is_null_oid(old_oid
) && !is_null_oid(new_oid
) &&
45 oideq(old_oid
, new_oid
) && (old_mode
== new_mode
))
48 if (opt
->flags
.reverse_diff
) {
49 SWAP(old_mode
, new_mode
);
50 SWAP(old_oid
, new_oid
);
51 SWAP(old_path
, new_path
);
55 (strncmp(old_path
, opt
->prefix
, opt
->prefix_length
) ||
56 strncmp(new_path
, opt
->prefix
, opt
->prefix_length
)))
59 one
= alloc_filespec(old_path
);
60 two
= alloc_filespec(new_path
);
61 fill_filespec(one
, old_oid
, old_oid_valid
, old_mode
);
62 fill_filespec(two
, new_oid
, new_oid_valid
, new_mode
);
64 diff_queue(&diff_queued_diff
, one
, two
);
67 static int builtin_diff_b_f(struct rev_info
*revs
,
68 int argc
, const char **argv
,
69 struct object_array_entry
**blob
)
71 /* Blob vs file in the working tree*/
76 usage(builtin_diff_usage
);
78 GUARD_PATHSPEC(&revs
->prune_data
, PATHSPEC_FROMTOP
| PATHSPEC_LITERAL
);
79 path
= revs
->prune_data
.items
[0].match
;
82 die_errno(_("failed to stat '%s'"), path
);
83 if (!(S_ISREG(st
.st_mode
) || S_ISLNK(st
.st_mode
)))
84 die(_("'%s': not a regular file or symlink"), path
);
86 diff_set_mnemonic_prefix(&revs
->diffopt
, "o/", "w/");
88 if (blob
[0]->mode
== S_IFINVALID
)
89 blob
[0]->mode
= canon_mode(st
.st_mode
);
91 stuff_change(&revs
->diffopt
,
92 blob
[0]->mode
, canon_mode(st
.st_mode
),
93 &blob
[0]->item
->oid
, &null_oid
,
95 blob
[0]->path
? blob
[0]->path
: path
,
97 diffcore_std(&revs
->diffopt
);
98 diff_flush(&revs
->diffopt
);
102 static int builtin_diff_blobs(struct rev_info
*revs
,
103 int argc
, const char **argv
,
104 struct object_array_entry
**blob
)
106 const unsigned mode
= canon_mode(S_IFREG
| 0644);
109 usage(builtin_diff_usage
);
111 if (blob
[0]->mode
== S_IFINVALID
)
112 blob
[0]->mode
= mode
;
114 if (blob
[1]->mode
== S_IFINVALID
)
115 blob
[1]->mode
= mode
;
117 stuff_change(&revs
->diffopt
,
118 blob
[0]->mode
, blob
[1]->mode
,
119 &blob
[0]->item
->oid
, &blob
[1]->item
->oid
,
121 blob_path(blob
[0]), blob_path(blob
[1]));
122 diffcore_std(&revs
->diffopt
);
123 diff_flush(&revs
->diffopt
);
127 static int builtin_diff_index(struct rev_info
*revs
,
128 int argc
, const char **argv
)
132 const char *arg
= argv
[1];
133 if (!strcmp(arg
, "--cached") || !strcmp(arg
, "--staged"))
136 usage(builtin_diff_usage
);
140 * Make sure there is one revision (i.e. pending object),
141 * and there is no revision filtering parameters.
143 if (revs
->pending
.nr
!= 1 ||
144 revs
->max_count
!= -1 || revs
->min_age
!= -1 ||
146 usage(builtin_diff_usage
);
149 if (read_cache_preload(&revs
->diffopt
.pathspec
) < 0) {
150 perror("read_cache_preload");
153 } else if (read_cache() < 0) {
154 perror("read_cache");
157 return run_diff_index(revs
, cached
);
160 static int builtin_diff_tree(struct rev_info
*revs
,
161 int argc
, const char **argv
,
162 struct object_array_entry
*ent0
,
163 struct object_array_entry
*ent1
)
165 const struct object_id
*(oid
[2]);
169 usage(builtin_diff_usage
);
172 * We saw two trees, ent0 and ent1. If ent1 is uninteresting,
175 if (ent1
->item
->flags
& UNINTERESTING
)
177 oid
[swap
] = &ent0
->item
->oid
;
178 oid
[1 - swap
] = &ent1
->item
->oid
;
179 diff_tree_oid(oid
[0], oid
[1], "", &revs
->diffopt
);
180 log_tree_diff_flush(revs
);
184 static int builtin_diff_combined(struct rev_info
*revs
,
185 int argc
, const char **argv
,
186 struct object_array_entry
*ent
,
189 struct oid_array parents
= OID_ARRAY_INIT
;
193 usage(builtin_diff_usage
);
195 if (!revs
->dense_combined_merges
&& !revs
->combine_merges
)
196 revs
->dense_combined_merges
= revs
->combine_merges
= 1;
197 for (i
= 1; i
< ents
; i
++)
198 oid_array_append(&parents
, &ent
[i
].item
->oid
);
199 diff_tree_combined(&ent
[0].item
->oid
, &parents
,
200 revs
->dense_combined_merges
, revs
);
201 oid_array_clear(&parents
);
205 static void refresh_index_quietly(void)
207 struct lock_file lock_file
= LOCK_INIT
;
210 fd
= hold_locked_index(&lock_file
, 0);
215 refresh_cache(REFRESH_QUIET
|REFRESH_UNMERGED
);
216 repo_update_index_if_able(the_repository
, &lock_file
);
219 static int builtin_diff_files(struct rev_info
*revs
, int argc
, const char **argv
)
221 unsigned int options
= 0;
223 while (1 < argc
&& argv
[1][0] == '-') {
224 if (!strcmp(argv
[1], "--base"))
226 else if (!strcmp(argv
[1], "--ours"))
228 else if (!strcmp(argv
[1], "--theirs"))
230 else if (!strcmp(argv
[1], "-q"))
231 options
|= DIFF_SILENT_ON_REMOVED
;
232 else if (!strcmp(argv
[1], "-h"))
233 usage(builtin_diff_usage
);
235 return error(_("invalid option: %s"), argv
[1]);
240 * "diff --base" should not combine merges because it was not
241 * asked to. "diff -c" should not densify (if the user wants
242 * dense one, --cc can be explicitly asked for, or just rely
245 if (revs
->max_count
== -1 && !revs
->combine_merges
&&
246 (revs
->diffopt
.output_format
& DIFF_FORMAT_PATCH
))
247 revs
->combine_merges
= revs
->dense_combined_merges
= 1;
250 if (read_cache_preload(&revs
->diffopt
.pathspec
) < 0) {
251 perror("read_cache_preload");
254 return run_diff_files(revs
, options
);
257 int cmd_diff(int argc
, const char **argv
, const char *prefix
)
261 struct object_array ent
= OBJECT_ARRAY_INIT
;
262 int blobs
= 0, paths
= 0;
263 struct object_array_entry
*blob
[2];
264 int nongit
= 0, no_index
= 0;
268 * We could get N tree-ish in the rev.pending_objects list.
269 * Also there could be M blobs there, and P pathspecs.
272 * cache vs files (diff-files)
274 * compare two random blobs. P must be zero.
276 * compare a blob with a working tree file.
279 * tree vs cache (diff-index --cached)
282 * tree vs tree (diff-tree)
285 * compare two filesystem entities (aka --no-index).
287 * Other cases are errors.
290 /* Were we asked to do --no-index explicitly? */
291 for (i
= 1; i
< argc
; i
++) {
292 if (!strcmp(argv
[i
], "--")) {
296 if (!strcmp(argv
[i
], "--no-index"))
297 no_index
= DIFF_NO_INDEX_EXPLICIT
;
298 if (argv
[i
][0] != '-')
302 prefix
= setup_git_directory_gently(&nongit
);
306 * Treat git diff with at least one path outside of the
307 * repo the same as if the command would have been executed
308 * outside of a git repository. In this case it behaves
309 * the same way as "git diff --no-index <a> <b>", which acts
310 * as a colourful "diff" replacement.
312 if (nongit
|| ((argc
== i
+ 2) &&
313 (!path_inside_repo(prefix
, argv
[i
]) ||
314 !path_inside_repo(prefix
, argv
[i
+ 1]))))
315 no_index
= DIFF_NO_INDEX_IMPLICIT
;
318 init_diff_ui_defaults();
319 git_config(git_diff_ui_config
, NULL
);
320 precompose_argv(argc
, argv
);
322 repo_init_revisions(the_repository
, &rev
, prefix
);
324 /* Set up defaults that will apply to both no-index and regular diffs. */
325 rev
.diffopt
.stat_width
= -1;
326 rev
.diffopt
.stat_graph_width
= -1;
327 rev
.diffopt
.flags
.allow_external
= 1;
328 rev
.diffopt
.flags
.allow_textconv
= 1;
330 /* If this is a no-index diff, just run it and exit there. */
332 exit(diff_no_index(&rev
, no_index
== DIFF_NO_INDEX_IMPLICIT
,
337 * Otherwise, we are doing the usual "git" diff; set up any
338 * further defaults that apply to regular diffs.
340 rev
.diffopt
.skip_stat_unmatch
= !!diff_auto_refresh_index
;
343 * Default to intent-to-add entries invisible in the
344 * index. This makes them show up as new files in diff-files
345 * and not at all in diff-cached.
347 rev
.diffopt
.ita_invisible_in_index
= 1;
350 die(_("Not a git repository"));
351 argc
= setup_revisions(argc
, argv
, &rev
, NULL
);
352 if (!rev
.diffopt
.output_format
) {
353 rev
.diffopt
.output_format
= DIFF_FORMAT_PATCH
;
354 diff_setup_done(&rev
.diffopt
);
357 rev
.diffopt
.flags
.recursive
= 1;
359 setup_diff_pager(&rev
.diffopt
);
362 * Do we have --cached and not have a pending object, then
363 * default to HEAD by hand. Eek.
365 if (!rev
.pending
.nr
) {
367 for (i
= 1; i
< argc
; i
++) {
368 const char *arg
= argv
[i
];
369 if (!strcmp(arg
, "--"))
371 else if (!strcmp(arg
, "--cached") ||
372 !strcmp(arg
, "--staged")) {
373 add_head_to_pending(&rev
);
374 if (!rev
.pending
.nr
) {
376 tree
= lookup_tree(the_repository
,
377 the_repository
->hash_algo
->empty_tree
);
378 add_pending_object(&rev
, &tree
->object
, "HEAD");
385 for (i
= 0; i
< rev
.pending
.nr
; i
++) {
386 struct object_array_entry
*entry
= &rev
.pending
.objects
[i
];
387 struct object
*obj
= entry
->item
;
388 const char *name
= entry
->name
;
389 int flags
= (obj
->flags
& UNINTERESTING
);
391 obj
= parse_object(the_repository
, &obj
->oid
);
392 obj
= deref_tag(the_repository
, obj
, NULL
, 0);
394 die(_("invalid object '%s' given."), name
);
395 if (obj
->type
== OBJ_COMMIT
)
396 obj
= &get_commit_tree(((struct commit
*)obj
))->object
;
398 if (obj
->type
== OBJ_TREE
) {
400 add_object_array(obj
, name
, &ent
);
401 } else if (obj
->type
== OBJ_BLOB
) {
403 die(_("more than two blobs given: '%s'"), name
);
408 die(_("unhandled object '%s' given."), name
);
411 if (rev
.prune_data
.nr
)
412 paths
+= rev
.prune_data
.nr
;
415 * Now, do the arguments look reasonable?
420 result
= builtin_diff_files(&rev
, argc
, argv
);
424 usage(builtin_diff_usage
);
425 result
= builtin_diff_b_f(&rev
, argc
, argv
, blob
);
429 usage(builtin_diff_usage
);
430 result
= builtin_diff_blobs(&rev
, argc
, argv
, blob
);
433 usage(builtin_diff_usage
);
437 usage(builtin_diff_usage
);
438 else if (ent
.nr
== 1)
439 result
= builtin_diff_index(&rev
, argc
, argv
);
440 else if (ent
.nr
== 2)
441 result
= builtin_diff_tree(&rev
, argc
, argv
,
442 &ent
.objects
[0], &ent
.objects
[1]);
443 else if (ent
.objects
[0].item
->flags
& UNINTERESTING
) {
445 * diff A...B where there is at least one merge base
446 * between A and B. We have ent.objects[0] ==
447 * merge-base, ent.objects[ents-2] == A, and
448 * ent.objects[ents-1] == B. Show diff between the
449 * base and B. Note that we pick one merge base at
450 * random if there are more than one.
452 result
= builtin_diff_tree(&rev
, argc
, argv
,
454 &ent
.objects
[ent
.nr
-1]);
456 result
= builtin_diff_combined(&rev
, argc
, argv
,
457 ent
.objects
, ent
.nr
);
458 result
= diff_result_code(&rev
.diffopt
, result
);
459 if (1 < rev
.diffopt
.skip_stat_unmatch
)
460 refresh_index_quietly();