4 * Copyright (c) 2006 Junio C Hamano
18 unsigned char sha1
[20];
23 static const char builtin_diff_usage
[] =
24 "git-diff <options> <rev>{0,2} -- <path>*";
26 static void stuff_change(struct diff_options
*opt
,
27 unsigned old_mode
, unsigned new_mode
,
28 const unsigned char *old_sha1
,
29 const unsigned char *new_sha1
,
33 struct diff_filespec
*one
, *two
;
35 if (!is_null_sha1(old_sha1
) && !is_null_sha1(new_sha1
) &&
36 !hashcmp(old_sha1
, new_sha1
) && (old_mode
== new_mode
))
39 if (DIFF_OPT_TST(opt
, REVERSE_DIFF
)) {
41 const unsigned char *tmp_u
;
43 tmp
= old_mode
; old_mode
= new_mode
; new_mode
= tmp
;
44 tmp_u
= old_sha1
; old_sha1
= new_sha1
; new_sha1
= tmp_u
;
45 tmp_c
= old_name
; old_name
= new_name
; new_name
= tmp_c
;
49 (strncmp(old_name
, opt
->prefix
, opt
->prefix_length
) ||
50 strncmp(new_name
, opt
->prefix
, opt
->prefix_length
)))
53 one
= alloc_filespec(old_name
);
54 two
= alloc_filespec(new_name
);
55 fill_filespec(one
, old_sha1
, old_mode
);
56 fill_filespec(two
, new_sha1
, new_mode
);
58 diff_queue(&diff_queued_diff
, one
, two
);
61 static int builtin_diff_b_f(struct rev_info
*revs
,
62 int argc
, const char **argv
,
63 struct blobinfo
*blob
,
66 /* Blob vs file in the working tree*/
70 usage(builtin_diff_usage
);
73 die("'%s': %s", path
, strerror(errno
));
74 if (!(S_ISREG(st
.st_mode
) || S_ISLNK(st
.st_mode
)))
75 die("'%s': not a regular file or symlink", path
);
77 if (blob
[0].mode
== S_IFINVALID
)
78 blob
[0].mode
= canon_mode(st
.st_mode
);
80 stuff_change(&revs
->diffopt
,
81 blob
[0].mode
, canon_mode(st
.st_mode
),
82 blob
[0].sha1
, null_sha1
,
84 diffcore_std(&revs
->diffopt
);
85 diff_flush(&revs
->diffopt
);
89 static int builtin_diff_blobs(struct rev_info
*revs
,
90 int argc
, const char **argv
,
91 struct blobinfo
*blob
)
93 unsigned mode
= canon_mode(S_IFREG
| 0644);
96 usage(builtin_diff_usage
);
98 if (blob
[0].mode
== S_IFINVALID
)
101 if (blob
[1].mode
== S_IFINVALID
)
104 stuff_change(&revs
->diffopt
,
105 blob
[0].mode
, blob
[1].mode
,
106 blob
[0].sha1
, blob
[1].sha1
,
107 blob
[0].name
, blob
[1].name
);
108 diffcore_std(&revs
->diffopt
);
109 diff_flush(&revs
->diffopt
);
113 static int builtin_diff_index(struct rev_info
*revs
,
114 int argc
, const char **argv
)
118 const char *arg
= argv
[1];
119 if (!strcmp(arg
, "--cached"))
122 usage(builtin_diff_usage
);
126 * Make sure there is one revision (i.e. pending object),
127 * and there is no revision filtering parameters.
129 if (revs
->pending
.nr
!= 1 ||
130 revs
->max_count
!= -1 || revs
->min_age
!= -1 ||
132 usage(builtin_diff_usage
);
133 if (read_cache() < 0) {
134 perror("read_cache");
137 return run_diff_index(revs
, cached
);
140 static int builtin_diff_tree(struct rev_info
*revs
,
141 int argc
, const char **argv
,
142 struct object_array_entry
*ent
)
144 const unsigned char *(sha1
[2]);
148 usage(builtin_diff_usage
);
150 /* We saw two trees, ent[0] and ent[1].
151 * if ent[1] is uninteresting, they are swapped
153 if (ent
[1].item
->flags
& UNINTERESTING
)
155 sha1
[swap
] = ent
[0].item
->sha1
;
156 sha1
[1-swap
] = ent
[1].item
->sha1
;
157 diff_tree_sha1(sha1
[0], sha1
[1], "", &revs
->diffopt
);
158 log_tree_diff_flush(revs
);
162 static int builtin_diff_combined(struct rev_info
*revs
,
163 int argc
, const char **argv
,
164 struct object_array_entry
*ent
,
167 const unsigned char (*parent
)[20];
171 usage(builtin_diff_usage
);
173 if (!revs
->dense_combined_merges
&& !revs
->combine_merges
)
174 revs
->dense_combined_merges
= revs
->combine_merges
= 1;
175 parent
= xmalloc(ents
* sizeof(*parent
));
176 /* Again, the revs are all reverse */
177 for (i
= 0; i
< ents
; i
++)
178 hashcpy((unsigned char *)(parent
+ i
),
179 ent
[ents
- 1 - i
].item
->sha1
);
180 diff_tree_combined(parent
[0], parent
+ 1, ents
- 1,
181 revs
->dense_combined_merges
, revs
);
185 static void refresh_index_quietly(void)
187 struct lock_file
*lock_file
;
190 lock_file
= xcalloc(1, sizeof(struct lock_file
));
191 fd
= hold_locked_index(lock_file
, 0);
196 refresh_cache(REFRESH_QUIET
|REFRESH_UNMERGED
);
198 if (active_cache_changed
&&
199 !write_cache(fd
, active_cache
, active_nr
))
200 commit_locked_index(lock_file
);
202 rollback_lock_file(lock_file
);
205 static int builtin_diff_files(struct rev_info
*revs
, int argc
, const char **argv
)
208 unsigned int options
= 0;
210 while (1 < argc
&& argv
[1][0] == '-') {
211 if (!strcmp(argv
[1], "--base"))
213 else if (!strcmp(argv
[1], "--ours"))
215 else if (!strcmp(argv
[1], "--theirs"))
217 else if (!strcmp(argv
[1], "-q"))
218 options
|= DIFF_SILENT_ON_REMOVED
;
220 return error("invalid option: %s", argv
[1]);
224 if (revs
->max_count
== -1 &&
225 (revs
->diffopt
.output_format
& DIFF_FORMAT_PATCH
))
226 revs
->combine_merges
= revs
->dense_combined_merges
= 1;
228 if (read_cache() < 0) {
229 perror("read_cache");
232 result
= run_diff_files(revs
, options
);
233 return diff_result_code(&revs
->diffopt
, result
);
236 int cmd_diff(int argc
, const char **argv
, const char *prefix
)
240 struct object_array_entry ent
[100];
241 int ents
= 0, blobs
= 0, paths
= 0;
242 const char *path
= NULL
;
243 struct blobinfo blob
[2];
248 * We could get N tree-ish in the rev.pending_objects list.
249 * Also there could be M blobs there, and P pathspecs.
252 * cache vs files (diff-files)
254 * compare two random blobs. P must be zero.
256 * compare a blob with a working tree file.
259 * tree vs cache (diff-index --cached)
262 * tree vs tree (diff-tree)
265 * compare two filesystem entities (aka --no-index).
267 * Other cases are errors.
270 prefix
= setup_git_directory_gently(&nongit
);
271 git_config(git_diff_ui_config
);
273 if (diff_use_color_default
== -1)
274 diff_use_color_default
= git_use_color_default
;
276 init_revisions(&rev
, prefix
);
278 /* If this is a no-index diff, just run it and exit there. */
279 diff_no_index(&rev
, argc
, argv
, nongit
, prefix
);
281 /* Otherwise, we are doing the usual "git" diff */
282 rev
.diffopt
.skip_stat_unmatch
= !!diff_auto_refresh_index
;
285 die("Not a git repository");
286 argc
= setup_revisions(argc
, argv
, &rev
, NULL
);
287 if (!rev
.diffopt
.output_format
) {
288 rev
.diffopt
.output_format
= DIFF_FORMAT_PATCH
;
289 if (diff_setup_done(&rev
.diffopt
) < 0)
290 die("diff_setup_done failed");
292 DIFF_OPT_SET(&rev
.diffopt
, ALLOW_EXTERNAL
);
293 DIFF_OPT_SET(&rev
.diffopt
, RECURSIVE
);
296 * If the user asked for our exit code then don't start a
297 * pager or we would end up reporting its exit code instead.
299 if (!DIFF_OPT_TST(&rev
.diffopt
, EXIT_WITH_STATUS
))
303 * Do we have --cached and not have a pending object, then
304 * default to HEAD by hand. Eek.
306 if (!rev
.pending
.nr
) {
308 for (i
= 1; i
< argc
; i
++) {
309 const char *arg
= argv
[i
];
310 if (!strcmp(arg
, "--"))
312 else if (!strcmp(arg
, "--cached")) {
313 add_head_to_pending(&rev
);
315 die("No HEAD commit to compare with (yet)");
321 for (i
= 0; i
< rev
.pending
.nr
; i
++) {
322 struct object_array_entry
*list
= rev
.pending
.objects
+i
;
323 struct object
*obj
= list
->item
;
324 const char *name
= list
->name
;
325 int flags
= (obj
->flags
& UNINTERESTING
);
327 obj
= parse_object(obj
->sha1
);
328 obj
= deref_tag(obj
, NULL
, 0);
330 die("invalid object '%s' given.", name
);
331 if (obj
->type
== OBJ_COMMIT
)
332 obj
= &((struct commit
*)obj
)->tree
->object
;
333 if (obj
->type
== OBJ_TREE
) {
334 if (ARRAY_SIZE(ent
) <= ents
)
335 die("more than %d trees given: '%s'",
336 (int) ARRAY_SIZE(ent
), name
);
338 ent
[ents
].item
= obj
;
339 ent
[ents
].name
= name
;
343 if (obj
->type
== OBJ_BLOB
) {
345 die("more than two blobs given: '%s'", name
);
346 hashcpy(blob
[blobs
].sha1
, obj
->sha1
);
347 blob
[blobs
].name
= name
;
348 blob
[blobs
].mode
= list
->mode
;
353 die("unhandled object '%s' given.", name
);
355 if (rev
.prune_data
) {
356 const char **pathspec
= rev
.prune_data
;
366 * Now, do the arguments look reasonable?
371 result
= builtin_diff_files(&rev
, argc
, argv
);
375 usage(builtin_diff_usage
);
376 result
= builtin_diff_b_f(&rev
, argc
, argv
, blob
, path
);
380 usage(builtin_diff_usage
);
381 result
= builtin_diff_blobs(&rev
, argc
, argv
, blob
);
384 usage(builtin_diff_usage
);
388 usage(builtin_diff_usage
);
390 result
= builtin_diff_index(&rev
, argc
, argv
);
392 result
= builtin_diff_tree(&rev
, argc
, argv
, ent
);
393 else if ((ents
== 3) && (ent
[0].item
->flags
& UNINTERESTING
)) {
394 /* diff A...B where there is one sane merge base between
395 * A and B. We have ent[0] == merge-base, ent[1] == A,
396 * and ent[2] == B. Show diff between the base and B.
399 result
= builtin_diff_tree(&rev
, argc
, argv
, ent
);
402 result
= builtin_diff_combined(&rev
, argc
, argv
,
404 result
= diff_result_code(&rev
.diffopt
, result
);
405 if (1 < rev
.diffopt
.skip_stat_unmatch
)
406 refresh_index_quietly();