diff.c 10.7 KB
Newer Older
J
Junio C Hamano 已提交
1 2 3 4 5 6
/*
 * Builtin "git diff"
 *
 * Copyright (c) 2006 Junio C Hamano
 */
#include "cache.h"
7
#include "color.h"
J
Junio C Hamano 已提交
8 9 10 11 12 13 14 15
#include "commit.h"
#include "blob.h"
#include "tag.h"
#include "diff.h"
#include "diffcore.h"
#include "revision.h"
#include "log-tree.h"
#include "builtin.h"
16
#include "submodule.h"
J
Junio C Hamano 已提交
17 18 19 20

struct blobinfo {
	unsigned char sha1[20];
	const char *name;
21
	unsigned mode;
J
Junio C Hamano 已提交
22 23 24
};

static const char builtin_diff_usage[] =
S
Stephan Beyer 已提交
25
"git diff <options> <rev>{0,2} -- <path>*";
J
Junio C Hamano 已提交
26 27 28 29 30 31 32 33 34 35

static void stuff_change(struct diff_options *opt,
			 unsigned old_mode, unsigned new_mode,
			 const unsigned char *old_sha1,
			 const unsigned char *new_sha1,
			 const char *old_name,
			 const char *new_name)
{
	struct diff_filespec *one, *two;

D
David Rientjes 已提交
36
	if (!is_null_sha1(old_sha1) && !is_null_sha1(new_sha1) &&
37
	    !hashcmp(old_sha1, new_sha1) && (old_mode == new_mode))
J
Junio C Hamano 已提交
38 39
		return;

40
	if (DIFF_OPT_TST(opt, REVERSE_DIFF)) {
J
Junio C Hamano 已提交
41
		unsigned tmp;
P
Peter Hagervall 已提交
42
		const unsigned char *tmp_u;
J
Junio C Hamano 已提交
43 44 45 46 47
		const char *tmp_c;
		tmp = old_mode; old_mode = new_mode; new_mode = tmp;
		tmp_u = old_sha1; old_sha1 = new_sha1; new_sha1 = tmp_u;
		tmp_c = old_name; old_name = new_name; new_name = tmp_c;
	}
48 49 50 51 52 53

	if (opt->prefix &&
	    (strncmp(old_name, opt->prefix, opt->prefix_length) ||
	     strncmp(new_name, opt->prefix, opt->prefix_length)))
		return;

J
Junio C Hamano 已提交
54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69
	one = alloc_filespec(old_name);
	two = alloc_filespec(new_name);
	fill_filespec(one, old_sha1, old_mode);
	fill_filespec(two, new_sha1, new_mode);

	diff_queue(&diff_queued_diff, one, two);
}

static int builtin_diff_b_f(struct rev_info *revs,
			    int argc, const char **argv,
			    struct blobinfo *blob,
			    const char *path)
{
	/* Blob vs file in the working tree*/
	struct stat st;

70 71 72
	if (argc > 1)
		usage(builtin_diff_usage);

J
Junio C Hamano 已提交
73
	if (lstat(path, &st))
74
		die_errno("failed to stat '%s'", path);
J
Junio C Hamano 已提交
75 76
	if (!(S_ISREG(st.st_mode) || S_ISLNK(st.st_mode)))
		die("'%s': not a regular file or symlink", path);
77

78 79
	diff_set_mnemonic_prefix(&revs->diffopt, "o/", "w/");

80 81 82
	if (blob[0].mode == S_IFINVALID)
		blob[0].mode = canon_mode(st.st_mode);

J
Junio C Hamano 已提交
83
	stuff_change(&revs->diffopt,
84
		     blob[0].mode, canon_mode(st.st_mode),
J
Junio C Hamano 已提交
85
		     blob[0].sha1, null_sha1,
86
		     path, path);
J
Junio C Hamano 已提交
87 88 89 90 91 92 93 94 95 96 97
	diffcore_std(&revs->diffopt);
	diff_flush(&revs->diffopt);
	return 0;
}

static int builtin_diff_blobs(struct rev_info *revs,
			      int argc, const char **argv,
			      struct blobinfo *blob)
{
	unsigned mode = canon_mode(S_IFREG | 0644);

98 99 100
	if (argc > 1)
		usage(builtin_diff_usage);

101 102 103 104 105 106
	if (blob[0].mode == S_IFINVALID)
		blob[0].mode = mode;

	if (blob[1].mode == S_IFINVALID)
		blob[1].mode = mode;

J
Junio C Hamano 已提交
107
	stuff_change(&revs->diffopt,
108
		     blob[0].mode, blob[1].mode,
109
		     blob[0].sha1, blob[1].sha1,
110
		     blob[0].name, blob[1].name);
J
Junio C Hamano 已提交
111 112 113 114 115 116 117 118 119 120 121
	diffcore_std(&revs->diffopt);
	diff_flush(&revs->diffopt);
	return 0;
}

static int builtin_diff_index(struct rev_info *revs,
			      int argc, const char **argv)
{
	int cached = 0;
	while (1 < argc) {
		const char *arg = argv[1];
122
		if (!strcmp(arg, "--cached") || !strcmp(arg, "--staged"))
J
Junio C Hamano 已提交
123 124 125 126 127
			cached = 1;
		else
			usage(builtin_diff_usage);
		argv++; argc--;
	}
128 129
	if (!cached)
		setup_work_tree();
J
Junio C Hamano 已提交
130 131 132 133
	/*
	 * Make sure there is one revision (i.e. pending object),
	 * and there is no revision filtering parameters.
	 */
134
	if (revs->pending.nr != 1 ||
J
Junio C Hamano 已提交
135 136 137
	    revs->max_count != -1 || revs->min_age != -1 ||
	    revs->max_age != -1)
		usage(builtin_diff_usage);
L
Linus Torvalds 已提交
138 139
	if (read_cache_preload(revs->diffopt.paths) < 0) {
		perror("read_cache_preload");
140 141
		return -1;
	}
J
Junio C Hamano 已提交
142 143 144 145 146
	return run_diff_index(revs, cached);
}

static int builtin_diff_tree(struct rev_info *revs,
			     int argc, const char **argv,
147
			     struct object_array_entry *ent)
J
Junio C Hamano 已提交
148 149
{
	const unsigned char *(sha1[2]);
150
	int swap = 0;
151 152 153

	if (argc > 1)
		usage(builtin_diff_usage);
154 155

	/* We saw two trees, ent[0] and ent[1].
156
	 * if ent[1] is uninteresting, they are swapped
157
	 */
158 159
	if (ent[1].item->flags & UNINTERESTING)
		swap = 1;
J
Junio C Hamano 已提交
160 161 162 163 164 165 166
	sha1[swap] = ent[0].item->sha1;
	sha1[1-swap] = ent[1].item->sha1;
	diff_tree_sha1(sha1[0], sha1[1], "", &revs->diffopt);
	log_tree_diff_flush(revs);
	return 0;
}

167 168
static int builtin_diff_combined(struct rev_info *revs,
				 int argc, const char **argv,
169
				 struct object_array_entry *ent,
170 171 172 173 174
				 int ents)
{
	const unsigned char (*parent)[20];
	int i;

175 176 177
	if (argc > 1)
		usage(builtin_diff_usage);

178 179 180 181
	if (!revs->dense_combined_merges && !revs->combine_merges)
		revs->dense_combined_merges = revs->combine_merges = 1;
	parent = xmalloc(ents * sizeof(*parent));
	for (i = 0; i < ents; i++)
182
		hashcpy((unsigned char *)(parent + i), ent[i].item->sha1);
183 184 185 186 187
	diff_tree_combined(parent[0], parent + 1, ents - 1,
			   revs->dense_combined_merges, revs);
	return 0;
}

188 189 190 191 192 193 194 195 196 197 198 199
static void refresh_index_quietly(void)
{
	struct lock_file *lock_file;
	int fd;

	lock_file = xcalloc(1, sizeof(struct lock_file));
	fd = hold_locked_index(lock_file, 0);
	if (fd < 0)
		return;
	discard_cache();
	read_cache();
	refresh_cache(REFRESH_QUIET|REFRESH_UNMERGED);
200 201

	if (active_cache_changed &&
B
Brandon Casey 已提交
202
	    !write_cache(fd, active_cache, active_nr))
203 204
		commit_locked_index(lock_file);

205 206 207
	rollback_lock_file(lock_file);
}

208 209 210 211 212 213 214 215 216 217 218 219 220 221
static int builtin_diff_files(struct rev_info *revs, int argc, const char **argv)
{
	int result;
	unsigned int options = 0;

	while (1 < argc && argv[1][0] == '-') {
		if (!strcmp(argv[1], "--base"))
			revs->max_count = 1;
		else if (!strcmp(argv[1], "--ours"))
			revs->max_count = 2;
		else if (!strcmp(argv[1], "--theirs"))
			revs->max_count = 3;
		else if (!strcmp(argv[1], "-q"))
			options |= DIFF_SILENT_ON_REMOVED;
222 223
		else if (!strcmp(argv[1], "-h"))
			usage(builtin_diff_usage);
224 225 226 227 228
		else
			return error("invalid option: %s", argv[1]);
		argv++; argc--;
	}

229 230 231 232 233 234 235
	/*
	 * "diff --base" should not combine merges because it was not
	 * asked to.  "diff -c" should not densify (if the user wants
	 * dense one, --cc can be explicitly asked for, or just rely
	 * on the default).
	 */
	if (revs->max_count == -1 && !revs->combine_merges &&
236 237 238
	    (revs->diffopt.output_format & DIFF_FORMAT_PATCH))
		revs->combine_merges = revs->dense_combined_merges = 1;

239
	setup_work_tree();
L
Linus Torvalds 已提交
240 241
	if (read_cache_preload(revs->diffopt.paths) < 0) {
		perror("read_cache_preload");
242 243 244 245 246 247
		return -1;
	}
	result = run_diff_files(revs, options);
	return diff_result_code(&revs->diffopt, result);
}

248
int cmd_diff(int argc, const char **argv, const char *prefix)
J
Junio C Hamano 已提交
249
{
250
	int i;
J
Junio C Hamano 已提交
251
	struct rev_info rev;
252
	struct object_array_entry ent[100];
J
Junio C Hamano 已提交
253
	int ents = 0, blobs = 0, paths = 0;
254
	const char *path = NULL;
J
Junio C Hamano 已提交
255
	struct blobinfo blob[2];
256
	int nongit;
257
	int result = 0;
J
Junio C Hamano 已提交
258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275

	/*
	 * We could get N tree-ish in the rev.pending_objects list.
	 * Also there could be M blobs there, and P pathspecs.
	 *
	 * N=0, M=0:
	 *	cache vs files (diff-files)
	 * N=0, M=2:
	 *      compare two random blobs.  P must be zero.
	 * N=0, M=1, P=1:
	 *	compare a blob with a working tree file.
	 *
	 * N=1, M=0:
	 *      tree vs cache (diff-index --cached)
	 *
	 * N=2, M=0:
	 *      tree vs tree (diff-tree)
	 *
276 277 278
	 * N=0, M=0, P=2:
	 *      compare two filesystem entities (aka --no-index).
	 *
J
Junio C Hamano 已提交
279 280
	 * Other cases are errors.
	 */
J
Junio C Hamano 已提交
281

282
	prefix = setup_git_directory_gently(&nongit);
283
	gitmodules_config();
284
	git_config(git_diff_ui_config, NULL);
285 286 287 288

	if (diff_use_color_default == -1)
		diff_use_color_default = git_use_color_default;

289
	init_revisions(&rev, prefix);
290 291 292 293 294

	/* If this is a no-index diff, just run it and exit there. */
	diff_no_index(&rev, argc, argv, nongit, prefix);

	/* Otherwise, we are doing the usual "git" diff */
295
	rev.diffopt.skip_stat_unmatch = !!diff_auto_refresh_index;
J
Junio C Hamano 已提交
296

J
Jeff King 已提交
297
	/* Default to let external and textconv be used */
298
	DIFF_OPT_SET(&rev.diffopt, ALLOW_EXTERNAL);
J
Jeff King 已提交
299
	DIFF_OPT_SET(&rev.diffopt, ALLOW_TEXTCONV);
300

301 302 303
	if (nongit)
		die("Not a git repository");
	argc = setup_revisions(argc, argv, &rev, NULL);
304
	if (!rev.diffopt.output_format) {
305
		rev.diffopt.output_format = DIFF_FORMAT_PATCH;
306 307
		if (diff_setup_done(&rev.diffopt) < 0)
			die("diff_setup_done failed");
308
	}
309

310
	DIFF_OPT_SET(&rev.diffopt, RECURSIVE);
311

J
Junio C Hamano 已提交
312 313
	/*
	 * If the user asked for our exit code then don't start a
314 315
	 * pager or we would end up reporting its exit code instead.
	 */
316 317
	if (!DIFF_OPT_TST(&rev.diffopt, EXIT_WITH_STATUS) &&
	    check_pager_config("diff") != 0)
318 319
		setup_pager();

320 321
	/*
	 * Do we have --cached and not have a pending object, then
J
Junio C Hamano 已提交
322 323
	 * default to HEAD by hand.  Eek.
	 */
324
	if (!rev.pending.nr) {
J
Junio C Hamano 已提交
325 326 327 328 329
		int i;
		for (i = 1; i < argc; i++) {
			const char *arg = argv[i];
			if (!strcmp(arg, "--"))
				break;
330 331
			else if (!strcmp(arg, "--cached") ||
				 !strcmp(arg, "--staged")) {
332
				add_head_to_pending(&rev);
333 334
				if (!rev.pending.nr)
					die("No HEAD commit to compare with (yet)");
J
Junio C Hamano 已提交
335 336 337 338 339
				break;
			}
		}
	}

340 341
	for (i = 0; i < rev.pending.nr; i++) {
		struct object_array_entry *list = rev.pending.objects+i;
J
Junio C Hamano 已提交
342 343 344 345 346 347 348 349
		struct object *obj = list->item;
		const char *name = list->name;
		int flags = (obj->flags & UNINTERESTING);
		if (!obj->parsed)
			obj = parse_object(obj->sha1);
		obj = deref_tag(obj, NULL, 0);
		if (!obj)
			die("invalid object '%s' given.", name);
350
		if (obj->type == OBJ_COMMIT)
J
Junio C Hamano 已提交
351
			obj = &((struct commit *)obj)->tree->object;
352
		if (obj->type == OBJ_TREE) {
353 354
			if (ARRAY_SIZE(ent) <= ents)
				die("more than %d trees given: '%s'",
355
				    (int) ARRAY_SIZE(ent), name);
J
Junio C Hamano 已提交
356 357 358 359 360 361
			obj->flags |= flags;
			ent[ents].item = obj;
			ent[ents].name = name;
			ents++;
			continue;
		}
362
		if (obj->type == OBJ_BLOB) {
J
Junio C Hamano 已提交
363 364
			if (2 <= blobs)
				die("more than two blobs given: '%s'", name);
365
			hashcpy(blob[blobs].sha1, obj->sha1);
J
Junio C Hamano 已提交
366
			blob[blobs].name = name;
367
			blob[blobs].mode = list->mode;
J
Junio C Hamano 已提交
368 369
			blobs++;
			continue;
J
Junio C Hamano 已提交
370

J
Junio C Hamano 已提交
371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389
		}
		die("unhandled object '%s' given.", name);
	}
	if (rev.prune_data) {
		const char **pathspec = rev.prune_data;
		while (*pathspec) {
			if (!path)
				path = *pathspec;
			paths++;
			pathspec++;
		}
	}

	/*
	 * Now, do the arguments look reasonable?
	 */
	if (!ents) {
		switch (blobs) {
		case 0:
390
			result = builtin_diff_files(&rev, argc, argv);
J
Junio C Hamano 已提交
391 392 393 394
			break;
		case 1:
			if (paths != 1)
				usage(builtin_diff_usage);
395
			result = builtin_diff_b_f(&rev, argc, argv, blob, path);
J
Junio C Hamano 已提交
396 397
			break;
		case 2:
398 399
			if (paths)
				usage(builtin_diff_usage);
400
			result = builtin_diff_blobs(&rev, argc, argv, blob);
J
Junio C Hamano 已提交
401 402 403 404 405 406 407 408
			break;
		default:
			usage(builtin_diff_usage);
		}
	}
	else if (blobs)
		usage(builtin_diff_usage);
	else if (ents == 1)
409
		result = builtin_diff_index(&rev, argc, argv);
J
Junio C Hamano 已提交
410
	else if (ents == 2)
411
		result = builtin_diff_tree(&rev, argc, argv, ent);
412 413 414 415 416 417 418 419 420
	else if (ent[0].item->flags & UNINTERESTING) {
		/*
		 * diff A...B where there is at least one merge base
		 * between A and B.  We have ent[0] == merge-base,
		 * ent[ents-2] == A, and ent[ents-1] == B.  Show diff
		 * between the base and B.  Note that we pick one
		 * merge base at random if there are more than one.
		 */
		ent[1] = ent[ents-1];
421
		result = builtin_diff_tree(&rev, argc, argv, ent);
422
	} else
423
		result = builtin_diff_combined(&rev, argc, argv,
424
					       ent, ents);
J
Junio C Hamano 已提交
425
	result = diff_result_code(&rev.diffopt, result);
426 427
	if (1 < rev.diffopt.skip_stat_unmatch)
		refresh_index_quietly();
428
	return result;
J
Junio C Hamano 已提交
429
}