]>
Commit | Line | Data |
---|---|---|
65056021 JH |
1 | /* |
2 | * Builtin "git diff" | |
3 | * | |
4 | * Copyright (c) 2006 Junio C Hamano | |
5 | */ | |
f8adbec9 | 6 | #define USE_THE_INDEX_COMPATIBILITY_MACROS |
65056021 | 7 | #include "cache.h" |
b2141fc1 | 8 | #include "config.h" |
8bfcb3a6 | 9 | #include "ewah/ewok.h" |
697cc8ef | 10 | #include "lockfile.h" |
6b2f2d98 | 11 | #include "color.h" |
65056021 JH |
12 | #include "commit.h" |
13 | #include "blob.h" | |
14 | #include "tag.h" | |
15 | #include "diff.h" | |
16 | #include "diffcore.h" | |
17 | #include "revision.h" | |
18 | #include "log-tree.h" | |
19 | #include "builtin.h" | |
302ad7a9 | 20 | #include "submodule.h" |
fe299ec5 | 21 | #include "oid-array.h" |
65056021 | 22 | |
470faf96 TG |
23 | #define DIFF_NO_INDEX_EXPLICIT 1 |
24 | #define DIFF_NO_INDEX_IMPLICIT 2 | |
25 | ||
65056021 | 26 | static const char builtin_diff_usage[] = |
b7e10b2c CT |
27 | "git diff [<options>] [<commit>] [--] [<path>...]\n" |
28 | " or: git diff [<options>] --cached [<commit>] [--] [<path>...]\n" | |
29 | " or: git diff [<options>] <commit> [<commit>...] <commit> [--] [<path>...]\n" | |
30 | " or: git diff [<options>] <commit>...<commit>] [--] [<path>...]\n" | |
31 | " or: git diff [<options>] <blob> <blob>]\n" | |
32 | " or: git diff [<options>] --no-index [--] <path> <path>]\n" | |
33 | COMMON_DIFF_OPTIONS_HELP; | |
65056021 | 34 | |
158b06ca JK |
35 | static const char *blob_path(struct object_array_entry *entry) |
36 | { | |
37 | return entry->path ? entry->path : entry->name; | |
38 | } | |
39 | ||
65056021 JH |
40 | static void stuff_change(struct diff_options *opt, |
41 | unsigned old_mode, unsigned new_mode, | |
9c4b0f66 | 42 | const struct object_id *old_oid, |
43 | const struct object_id *new_oid, | |
44 | int old_oid_valid, | |
45 | int new_oid_valid, | |
d04ec74b JK |
46 | const char *old_path, |
47 | const char *new_path) | |
65056021 JH |
48 | { |
49 | struct diff_filespec *one, *two; | |
50 | ||
9c4b0f66 | 51 | if (!is_null_oid(old_oid) && !is_null_oid(new_oid) && |
4a7e27e9 | 52 | oideq(old_oid, new_oid) && (old_mode == new_mode)) |
65056021 JH |
53 | return; |
54 | ||
0d1e0e78 | 55 | if (opt->flags.reverse_diff) { |
35d803bc | 56 | SWAP(old_mode, new_mode); |
9c4b0f66 | 57 | SWAP(old_oid, new_oid); |
d04ec74b | 58 | SWAP(old_path, new_path); |
65056021 | 59 | } |
cd676a51 JH |
60 | |
61 | if (opt->prefix && | |
d04ec74b JK |
62 | (strncmp(old_path, opt->prefix, opt->prefix_length) || |
63 | strncmp(new_path, opt->prefix, opt->prefix_length))) | |
cd676a51 JH |
64 | return; |
65 | ||
d04ec74b JK |
66 | one = alloc_filespec(old_path); |
67 | two = alloc_filespec(new_path); | |
f9704c2d BW |
68 | fill_filespec(one, old_oid, old_oid_valid, old_mode); |
69 | fill_filespec(two, new_oid, new_oid_valid, new_mode); | |
65056021 | 70 | |
65056021 JH |
71 | diff_queue(&diff_queued_diff, one, two); |
72 | } | |
73 | ||
74 | static int builtin_diff_b_f(struct rev_info *revs, | |
75 | int argc, const char **argv, | |
42f5ba5b | 76 | struct object_array_entry **blob) |
65056021 JH |
77 | { |
78 | /* Blob vs file in the working tree*/ | |
79 | struct stat st; | |
887c6c18 | 80 | const char *path; |
65056021 | 81 | |
a610786f TH |
82 | if (argc > 1) |
83 | usage(builtin_diff_usage); | |
84 | ||
887c6c18 NTND |
85 | GUARD_PATHSPEC(&revs->prune_data, PATHSPEC_FROMTOP | PATHSPEC_LITERAL); |
86 | path = revs->prune_data.items[0].match; | |
87 | ||
65056021 | 88 | if (lstat(path, &st)) |
54214529 | 89 | die_errno(_("failed to stat '%s'"), path); |
65056021 | 90 | if (!(S_ISREG(st.st_mode) || S_ISLNK(st.st_mode))) |
54214529 | 91 | die(_("'%s': not a regular file or symlink"), path); |
01618a3a | 92 | |
a5a818ee JH |
93 | diff_set_mnemonic_prefix(&revs->diffopt, "o/", "w/"); |
94 | ||
42f5ba5b JK |
95 | if (blob[0]->mode == S_IFINVALID) |
96 | blob[0]->mode = canon_mode(st.st_mode); | |
01618a3a | 97 | |
65056021 | 98 | stuff_change(&revs->diffopt, |
42f5ba5b JK |
99 | blob[0]->mode, canon_mode(st.st_mode), |
100 | &blob[0]->item->oid, &null_oid, | |
e5450100 | 101 | 1, 0, |
30d005c0 JK |
102 | blob[0]->path ? blob[0]->path : path, |
103 | path); | |
65056021 JH |
104 | diffcore_std(&revs->diffopt); |
105 | diff_flush(&revs->diffopt); | |
106 | return 0; | |
107 | } | |
108 | ||
109 | static int builtin_diff_blobs(struct rev_info *revs, | |
110 | int argc, const char **argv, | |
42f5ba5b | 111 | struct object_array_entry **blob) |
65056021 | 112 | { |
33de80b1 | 113 | const unsigned mode = canon_mode(S_IFREG | 0644); |
65056021 | 114 | |
a610786f TH |
115 | if (argc > 1) |
116 | usage(builtin_diff_usage); | |
117 | ||
42f5ba5b JK |
118 | if (blob[0]->mode == S_IFINVALID) |
119 | blob[0]->mode = mode; | |
01618a3a | 120 | |
42f5ba5b JK |
121 | if (blob[1]->mode == S_IFINVALID) |
122 | blob[1]->mode = mode; | |
01618a3a | 123 | |
65056021 | 124 | stuff_change(&revs->diffopt, |
42f5ba5b JK |
125 | blob[0]->mode, blob[1]->mode, |
126 | &blob[0]->item->oid, &blob[1]->item->oid, | |
e5450100 | 127 | 1, 1, |
158b06ca | 128 | blob_path(blob[0]), blob_path(blob[1])); |
65056021 JH |
129 | diffcore_std(&revs->diffopt); |
130 | diff_flush(&revs->diffopt); | |
131 | return 0; | |
132 | } | |
133 | ||
134 | static int builtin_diff_index(struct rev_info *revs, | |
135 | int argc, const char **argv) | |
136 | { | |
137 | int cached = 0; | |
138 | while (1 < argc) { | |
139 | const char *arg = argv[1]; | |
2baf1850 | 140 | if (!strcmp(arg, "--cached") || !strcmp(arg, "--staged")) |
65056021 | 141 | cached = 1; |
65056021 JH |
142 | else |
143 | usage(builtin_diff_usage); | |
144 | argv++; argc--; | |
145 | } | |
146 | /* | |
147 | * Make sure there is one revision (i.e. pending object), | |
148 | * and there is no revision filtering parameters. | |
149 | */ | |
1f1e895f | 150 | if (revs->pending.nr != 1 || |
65056021 JH |
151 | revs->max_count != -1 || revs->min_age != -1 || |
152 | revs->max_age != -1) | |
153 | usage(builtin_diff_usage); | |
7349afd2 KB |
154 | if (!cached) { |
155 | setup_work_tree(); | |
5ab2a2da | 156 | if (read_cache_preload(&revs->diffopt.pathspec) < 0) { |
7349afd2 KB |
157 | perror("read_cache_preload"); |
158 | return -1; | |
159 | } | |
160 | } else if (read_cache() < 0) { | |
161 | perror("read_cache"); | |
b4e1e4a7 JH |
162 | return -1; |
163 | } | |
65056021 JH |
164 | return run_diff_index(revs, cached); |
165 | } | |
166 | ||
167 | static int builtin_diff_tree(struct rev_info *revs, | |
168 | int argc, const char **argv, | |
91de344d MH |
169 | struct object_array_entry *ent0, |
170 | struct object_array_entry *ent1) | |
65056021 | 171 | { |
9c4b0f66 | 172 | const struct object_id *(oid[2]); |
1f1e895f | 173 | int swap = 0; |
a610786f TH |
174 | |
175 | if (argc > 1) | |
176 | usage(builtin_diff_usage); | |
0fe7c1de | 177 | |
91de344d MH |
178 | /* |
179 | * We saw two trees, ent0 and ent1. If ent1 is uninteresting, | |
180 | * swap them. | |
0fe7c1de | 181 | */ |
91de344d | 182 | if (ent1->item->flags & UNINTERESTING) |
1f1e895f | 183 | swap = 1; |
9c4b0f66 | 184 | oid[swap] = &ent0->item->oid; |
185 | oid[1 - swap] = &ent1->item->oid; | |
66f414f8 | 186 | diff_tree_oid(oid[0], oid[1], "", &revs->diffopt); |
65056021 JH |
187 | log_tree_diff_flush(revs); |
188 | return 0; | |
189 | } | |
190 | ||
0fe7c1de JH |
191 | static int builtin_diff_combined(struct rev_info *revs, |
192 | int argc, const char **argv, | |
1f1e895f | 193 | struct object_array_entry *ent, |
0fe7c1de JH |
194 | int ents) |
195 | { | |
910650d2 | 196 | struct oid_array parents = OID_ARRAY_INIT; |
0fe7c1de JH |
197 | int i; |
198 | ||
a610786f TH |
199 | if (argc > 1) |
200 | usage(builtin_diff_usage); | |
201 | ||
0fe7c1de JH |
202 | if (!revs->dense_combined_merges && !revs->combine_merges) |
203 | revs->dense_combined_merges = revs->combine_merges = 1; | |
0041f09d | 204 | for (i = 1; i < ents; i++) |
910650d2 | 205 | oid_array_append(&parents, &ent[i].item->oid); |
d01141de | 206 | diff_tree_combined(&ent[0].item->oid, &parents, revs); |
910650d2 | 207 | oid_array_clear(&parents); |
0fe7c1de JH |
208 | return 0; |
209 | } | |
210 | ||
aecbf914 JH |
211 | static void refresh_index_quietly(void) |
212 | { | |
837e34eb | 213 | struct lock_file lock_file = LOCK_INIT; |
aecbf914 JH |
214 | int fd; |
215 | ||
837e34eb | 216 | fd = hold_locked_index(&lock_file, 0); |
aecbf914 JH |
217 | if (fd < 0) |
218 | return; | |
219 | discard_cache(); | |
220 | read_cache(); | |
221 | refresh_cache(REFRESH_QUIET|REFRESH_UNMERGED); | |
1b0d968b | 222 | repo_update_index_if_able(the_repository, &lock_file); |
aecbf914 JH |
223 | } |
224 | ||
0569e9b8 JH |
225 | static int builtin_diff_files(struct rev_info *revs, int argc, const char **argv) |
226 | { | |
0569e9b8 JH |
227 | unsigned int options = 0; |
228 | ||
229 | while (1 < argc && argv[1][0] == '-') { | |
230 | if (!strcmp(argv[1], "--base")) | |
231 | revs->max_count = 1; | |
232 | else if (!strcmp(argv[1], "--ours")) | |
233 | revs->max_count = 2; | |
234 | else if (!strcmp(argv[1], "--theirs")) | |
235 | revs->max_count = 3; | |
236 | else if (!strcmp(argv[1], "-q")) | |
237 | options |= DIFF_SILENT_ON_REMOVED; | |
1c370ea4 MM |
238 | else if (!strcmp(argv[1], "-h")) |
239 | usage(builtin_diff_usage); | |
0569e9b8 | 240 | else |
54214529 | 241 | return error(_("invalid option: %s"), argv[1]); |
0569e9b8 JH |
242 | argv++; argc--; |
243 | } | |
244 | ||
903e09a3 JH |
245 | /* |
246 | * "diff --base" should not combine merges because it was not | |
247 | * asked to. "diff -c" should not densify (if the user wants | |
248 | * dense one, --cc can be explicitly asked for, or just rely | |
249 | * on the default). | |
250 | */ | |
251 | if (revs->max_count == -1 && !revs->combine_merges && | |
0569e9b8 JH |
252 | (revs->diffopt.output_format & DIFF_FORMAT_PATCH)) |
253 | revs->combine_merges = revs->dense_combined_merges = 1; | |
254 | ||
4f38f6b5 | 255 | setup_work_tree(); |
5ab2a2da | 256 | if (read_cache_preload(&revs->diffopt.pathspec) < 0) { |
671c9b7e | 257 | perror("read_cache_preload"); |
0569e9b8 JH |
258 | return -1; |
259 | } | |
e7c3a59c | 260 | return run_diff_files(revs, options); |
0569e9b8 JH |
261 | } |
262 | ||
8bfcb3a6 CT |
263 | struct symdiff { |
264 | struct bitmap *skip; | |
265 | int warn; | |
266 | const char *base, *left, *right; | |
267 | }; | |
268 | ||
269 | /* | |
270 | * Check for symmetric-difference arguments, and if present, arrange | |
271 | * everything we need to know to handle them correctly. As a bonus, | |
272 | * weed out all bogus range-based revision specifications, e.g., | |
273 | * "git diff A..B C..D" or "git diff A..B C" get rejected. | |
274 | * | |
275 | * For an actual symmetric diff, *symdiff is set this way: | |
276 | * | |
277 | * - its skip is non-NULL and marks *all* rev->pending.objects[i] | |
278 | * indices that the caller should ignore (extra merge bases, of | |
279 | * which there might be many, and A in A...B). Note that the | |
280 | * chosen merge base and right side are NOT marked. | |
281 | * - warn is set if there are multiple merge bases. | |
282 | * - base, left, and right point to the names to use in a | |
283 | * warning about multiple merge bases. | |
284 | * | |
285 | * If there is no symmetric diff argument, sym->skip is NULL and | |
286 | * sym->warn is cleared. The remaining fields are not set. | |
287 | */ | |
288 | static void symdiff_prepare(struct rev_info *rev, struct symdiff *sym) | |
289 | { | |
290 | int i, is_symdiff = 0, basecount = 0, othercount = 0; | |
291 | int lpos = -1, rpos = -1, basepos = -1; | |
292 | struct bitmap *map = NULL; | |
293 | ||
294 | /* | |
295 | * Use the whence fields to find merge bases and left and | |
296 | * right parts of symmetric difference, so that we do not | |
297 | * depend on the order that revisions are parsed. If there | |
298 | * are any revs that aren't from these sources, we have a | |
299 | * "git diff C A...B" or "git diff A...B C" case. Or we | |
300 | * could even get "git diff A...B C...E", for instance. | |
301 | * | |
302 | * If we don't have just one merge base, we pick one | |
303 | * at random. | |
304 | * | |
305 | * NB: REV_CMD_LEFT, REV_CMD_RIGHT are also used for A..B, | |
306 | * so we must check for SYMMETRIC_LEFT too. The two arrays | |
307 | * rev->pending.objects and rev->cmdline.rev are parallel. | |
308 | */ | |
309 | for (i = 0; i < rev->cmdline.nr; i++) { | |
310 | struct object *obj = rev->pending.objects[i].item; | |
311 | switch (rev->cmdline.rev[i].whence) { | |
312 | case REV_CMD_MERGE_BASE: | |
313 | if (basepos < 0) | |
314 | basepos = i; | |
315 | basecount++; | |
316 | break; /* do mark all bases */ | |
317 | case REV_CMD_LEFT: | |
318 | if (lpos >= 0) | |
319 | usage(builtin_diff_usage); | |
320 | lpos = i; | |
321 | if (obj->flags & SYMMETRIC_LEFT) { | |
322 | is_symdiff = 1; | |
323 | break; /* do mark A */ | |
324 | } | |
325 | continue; | |
326 | case REV_CMD_RIGHT: | |
327 | if (rpos >= 0) | |
328 | usage(builtin_diff_usage); | |
329 | rpos = i; | |
330 | continue; /* don't mark B */ | |
331 | case REV_CMD_PARENTS_ONLY: | |
332 | case REV_CMD_REF: | |
333 | case REV_CMD_REV: | |
334 | othercount++; | |
335 | continue; | |
336 | } | |
337 | if (map == NULL) | |
338 | map = bitmap_new(); | |
339 | bitmap_set(map, i); | |
340 | } | |
341 | ||
342 | /* | |
343 | * Forbid any additional revs for both A...B and A..B. | |
344 | */ | |
345 | if (lpos >= 0 && othercount > 0) | |
346 | usage(builtin_diff_usage); | |
347 | ||
348 | if (!is_symdiff) { | |
349 | bitmap_free(map); | |
350 | sym->warn = 0; | |
351 | sym->skip = NULL; | |
352 | return; | |
353 | } | |
354 | ||
355 | sym->left = rev->pending.objects[lpos].name; | |
356 | sym->right = rev->pending.objects[rpos].name; | |
8bfcb3a6 CT |
357 | if (basecount == 0) |
358 | die(_("%s...%s: no merge base"), sym->left, sym->right); | |
5f46e610 | 359 | sym->base = rev->pending.objects[basepos].name; |
8bfcb3a6 CT |
360 | bitmap_unset(map, basepos); /* unmark the base we want */ |
361 | sym->warn = basecount > 1; | |
362 | sym->skip = map; | |
363 | } | |
364 | ||
a633fca0 | 365 | int cmd_diff(int argc, const char **argv, const char *prefix) |
65056021 | 366 | { |
1f1e895f | 367 | int i; |
65056021 | 368 | struct rev_info rev; |
33055fa8 MH |
369 | struct object_array ent = OBJECT_ARRAY_INIT; |
370 | int blobs = 0, paths = 0; | |
42f5ba5b | 371 | struct object_array_entry *blob[2]; |
470faf96 | 372 | int nongit = 0, no_index = 0; |
41bbf9d5 | 373 | int result = 0; |
8bfcb3a6 | 374 | struct symdiff sdiff; |
65056021 JH |
375 | |
376 | /* | |
377 | * We could get N tree-ish in the rev.pending_objects list. | |
a9d7689c DL |
378 | * Also there could be M blobs there, and P pathspecs. --cached may |
379 | * also be present. | |
65056021 JH |
380 | * |
381 | * N=0, M=0: | |
a9d7689c DL |
382 | * cache vs files (diff-files) |
383 | * | |
384 | * N=0, M=0, --cached: | |
385 | * HEAD vs cache (diff-index --cached) | |
386 | * | |
65056021 JH |
387 | * N=0, M=2: |
388 | * compare two random blobs. P must be zero. | |
a9d7689c | 389 | * |
65056021 | 390 | * N=0, M=1, P=1: |
a9d7689c | 391 | * compare a blob with a working tree file. |
65056021 JH |
392 | * |
393 | * N=1, M=0: | |
a9d7689c | 394 | * tree vs files (diff-index) |
65056021 | 395 | * |
a9d7689c | 396 | * N=1, M=0, --cached: |
65056021 JH |
397 | * tree vs cache (diff-index --cached) |
398 | * | |
399 | * N=2, M=0: | |
400 | * tree vs tree (diff-tree) | |
401 | * | |
0569e9b8 JH |
402 | * N=0, M=0, P=2: |
403 | * compare two filesystem entities (aka --no-index). | |
404 | * | |
65056021 JH |
405 | * Other cases are errors. |
406 | */ | |
230f544e | 407 | |
470faf96 TG |
408 | /* Were we asked to do --no-index explicitly? */ |
409 | for (i = 1; i < argc; i++) { | |
410 | if (!strcmp(argv[i], "--")) { | |
411 | i++; | |
412 | break; | |
413 | } | |
414 | if (!strcmp(argv[i], "--no-index")) | |
415 | no_index = DIFF_NO_INDEX_EXPLICIT; | |
416 | if (argv[i][0] != '-') | |
417 | break; | |
418 | } | |
419 | ||
28a4e580 | 420 | prefix = setup_git_directory_gently(&nongit); |
6df5762d | 421 | |
28a4e580 | 422 | if (!no_index) { |
475b362c JK |
423 | /* |
424 | * Treat git diff with at least one path outside of the | |
425 | * repo the same as if the command would have been executed | |
426 | * outside of a git repository. In this case it behaves | |
427 | * the same way as "git diff --no-index <a> <b>", which acts | |
428 | * as a colourful "diff" replacement. | |
429 | */ | |
430 | if (nongit || ((argc == i + 2) && | |
431 | (!path_inside_repo(prefix, argv[i]) || | |
432 | !path_inside_repo(prefix, argv[i + 1])))) | |
433 | no_index = DIFF_NO_INDEX_IMPLICIT; | |
434 | } | |
470faf96 | 435 | |
5404c116 | 436 | init_diff_ui_defaults(); |
ef90d6d4 | 437 | git_config(git_diff_ui_config, NULL); |
90a78b83 | 438 | precompose_argv(argc, argv); |
6b2f2d98 | 439 | |
2abf3503 | 440 | repo_init_revisions(the_repository, &rev, prefix); |
0569e9b8 | 441 | |
287ab28b | 442 | /* Set up defaults that will apply to both no-index and regular diffs. */ |
af9fedc1 | 443 | rev.diffopt.stat_width = -1; |
df44483a | 444 | rev.diffopt.stat_graph_width = -1; |
0d1e0e78 BW |
445 | rev.diffopt.flags.allow_external = 1; |
446 | rev.diffopt.flags.allow_textconv = 1; | |
61af494c | 447 | |
287ab28b JK |
448 | /* If this is a no-index diff, just run it and exit there. */ |
449 | if (no_index) | |
dcd6a8c0 JH |
450 | exit(diff_no_index(&rev, no_index == DIFF_NO_INDEX_IMPLICIT, |
451 | argc, argv)); | |
452 | ||
287ab28b JK |
453 | |
454 | /* | |
455 | * Otherwise, we are doing the usual "git" diff; set up any | |
456 | * further defaults that apply to regular diffs. | |
457 | */ | |
458 | rev.diffopt.skip_stat_unmatch = !!diff_auto_refresh_index; | |
459 | ||
0231ae71 NTND |
460 | /* |
461 | * Default to intent-to-add entries invisible in the | |
462 | * index. This makes them show up as new files in diff-files | |
463 | * and not at all in diff-cached. | |
464 | */ | |
465 | rev.diffopt.ita_invisible_in_index = 1; | |
466 | ||
0569e9b8 | 467 | if (nongit) |
54214529 | 468 | die(_("Not a git repository")); |
0569e9b8 | 469 | argc = setup_revisions(argc, argv, &rev, NULL); |
047fbe90 | 470 | if (!rev.diffopt.output_format) { |
c9b5ef99 | 471 | rev.diffopt.output_format = DIFF_FORMAT_PATCH; |
28452655 | 472 | diff_setup_done(&rev.diffopt); |
047fbe90 | 473 | } |
61af494c | 474 | |
0d1e0e78 | 475 | rev.diffopt.flags.recursive = 1; |
c9b5ef99 | 476 | |
1af3d977 | 477 | setup_diff_pager(&rev.diffopt); |
89d07f75 | 478 | |
0569e9b8 JH |
479 | /* |
480 | * Do we have --cached and not have a pending object, then | |
65056021 JH |
481 | * default to HEAD by hand. Eek. |
482 | */ | |
1f1e895f | 483 | if (!rev.pending.nr) { |
65056021 JH |
484 | int i; |
485 | for (i = 1; i < argc; i++) { | |
486 | const char *arg = argv[i]; | |
487 | if (!strcmp(arg, "--")) | |
488 | break; | |
2baf1850 DS |
489 | else if (!strcmp(arg, "--cached") || |
490 | !strcmp(arg, "--staged")) { | |
3384a2df | 491 | add_head_to_pending(&rev); |
a2b7a3b3 NTND |
492 | if (!rev.pending.nr) { |
493 | struct tree *tree; | |
f86bcc7b SB |
494 | tree = lookup_tree(the_repository, |
495 | the_repository->hash_algo->empty_tree); | |
a2b7a3b3 NTND |
496 | add_pending_object(&rev, &tree->object, "HEAD"); |
497 | } | |
65056021 JH |
498 | break; |
499 | } | |
500 | } | |
501 | } | |
502 | ||
8bfcb3a6 | 503 | symdiff_prepare(&rev, &sdiff); |
1f1e895f | 504 | for (i = 0; i < rev.pending.nr; i++) { |
026f09e7 MH |
505 | struct object_array_entry *entry = &rev.pending.objects[i]; |
506 | struct object *obj = entry->item; | |
507 | const char *name = entry->name; | |
65056021 JH |
508 | int flags = (obj->flags & UNINTERESTING); |
509 | if (!obj->parsed) | |
109cd76d | 510 | obj = parse_object(the_repository, &obj->oid); |
a74093da | 511 | obj = deref_tag(the_repository, obj, NULL, 0); |
65056021 | 512 | if (!obj) |
54214529 | 513 | die(_("invalid object '%s' given."), name); |
1974632c | 514 | if (obj->type == OBJ_COMMIT) |
2e27bd77 | 515 | obj = &get_commit_tree(((struct commit *)obj))->object; |
5b1e14ea | 516 | |
1974632c | 517 | if (obj->type == OBJ_TREE) { |
8bfcb3a6 CT |
518 | if (sdiff.skip && bitmap_get(sdiff.skip, i)) |
519 | continue; | |
65056021 | 520 | obj->flags |= flags; |
33055fa8 | 521 | add_object_array(obj, name, &ent); |
5b1e14ea | 522 | } else if (obj->type == OBJ_BLOB) { |
65056021 | 523 | if (2 <= blobs) |
54214529 | 524 | die(_("more than two blobs given: '%s'"), name); |
42f5ba5b | 525 | blob[blobs] = entry; |
65056021 | 526 | blobs++; |
230f544e | 527 | |
5b1e14ea MH |
528 | } else { |
529 | die(_("unhandled object '%s' given."), name); | |
65056021 | 530 | } |
65056021 | 531 | } |
887c6c18 | 532 | if (rev.prune_data.nr) |
afe069d1 | 533 | paths += rev.prune_data.nr; |
65056021 JH |
534 | |
535 | /* | |
536 | * Now, do the arguments look reasonable? | |
537 | */ | |
33055fa8 | 538 | if (!ent.nr) { |
65056021 JH |
539 | switch (blobs) { |
540 | case 0: | |
0569e9b8 | 541 | result = builtin_diff_files(&rev, argc, argv); |
65056021 JH |
542 | break; |
543 | case 1: | |
544 | if (paths != 1) | |
545 | usage(builtin_diff_usage); | |
887c6c18 | 546 | result = builtin_diff_b_f(&rev, argc, argv, blob); |
65056021 JH |
547 | break; |
548 | case 2: | |
0fe7c1de JH |
549 | if (paths) |
550 | usage(builtin_diff_usage); | |
41bbf9d5 | 551 | result = builtin_diff_blobs(&rev, argc, argv, blob); |
65056021 JH |
552 | break; |
553 | default: | |
554 | usage(builtin_diff_usage); | |
555 | } | |
556 | } | |
557 | else if (blobs) | |
558 | usage(builtin_diff_usage); | |
33055fa8 | 559 | else if (ent.nr == 1) |
41bbf9d5 | 560 | result = builtin_diff_index(&rev, argc, argv); |
8bfcb3a6 CT |
561 | else if (ent.nr == 2) { |
562 | if (sdiff.warn) | |
563 | warning(_("%s...%s: multiple merge bases, using %s"), | |
564 | sdiff.left, sdiff.right, sdiff.base); | |
33055fa8 MH |
565 | result = builtin_diff_tree(&rev, argc, argv, |
566 | &ent.objects[0], &ent.objects[1]); | |
c008c0ff | 567 | } else |
41bbf9d5 | 568 | result = builtin_diff_combined(&rev, argc, argv, |
33055fa8 | 569 | ent.objects, ent.nr); |
da31b358 | 570 | result = diff_result_code(&rev.diffopt, result); |
aecbf914 JH |
571 | if (1 < rev.diffopt.skip_stat_unmatch) |
572 | refresh_index_quietly(); | |
886e1084 MÅ |
573 | UNLEAK(rev); |
574 | UNLEAK(ent); | |
575 | UNLEAK(blob); | |
41bbf9d5 | 576 | return result; |
65056021 | 577 | } |