tree-diff.c 6.5 KB
Newer Older
1 2 3 4 5
/*
 * Helper functions for tree diff generation
 */
#include "cache.h"
#include "diff.h"
6
#include "tree.h"
7

8
static char *malloc_base(const char *base, int baselen, const char *path, int pathlen)
9 10 11 12 13 14 15 16
{
	char *newbase = xmalloc(baselen + pathlen + 2);
	memcpy(newbase, base, baselen);
	memcpy(newbase + baselen, path, pathlen);
	memcpy(newbase + baselen + pathlen, "/", 2);
	return newbase;
}

D
David Rientjes 已提交
17
static void show_entry(struct diff_options *opt, const char *prefix, struct tree_desc *desc,
18
		       const char *base, int baselen);
19

20
static int compare_tree_entry(struct tree_desc *t1, struct tree_desc *t2, const char *base, int baselen, struct diff_options *opt)
21 22 23 24 25 26
{
	unsigned mode1, mode2;
	const char *path1, *path2;
	const unsigned char *sha1, *sha2;
	int cmp, pathlen1, pathlen2;

27 28
	sha1 = tree_entry_extract(t1, &path1, &mode1);
	sha2 = tree_entry_extract(t2, &path2, &mode2);
29

30 31
	pathlen1 = tree_entry_len(path1, sha1);
	pathlen2 = tree_entry_len(path2, sha2);
32 33
	cmp = base_name_compare(path1, pathlen1, mode1, path2, pathlen2, mode2);
	if (cmp < 0) {
34
		show_entry(opt, "-", t1, base, baselen);
35 36 37
		return -1;
	}
	if (cmp > 0) {
38
		show_entry(opt, "+", t2, base, baselen);
39 40
		return 1;
	}
41
	if (!opt->find_copies_harder && !hashcmp(sha1, sha2) && mode1 == mode2)
42 43 44 45 46 47 48
		return 0;

	/*
	 * If the filemode has changed to/from a directory from/to a regular
	 * file, we need to consider it a remove and an add.
	 */
	if (S_ISDIR(mode1) != S_ISDIR(mode2)) {
49 50
		show_entry(opt, "-", t1, base, baselen);
		show_entry(opt, "+", t2, base, baselen);
51 52 53 54 55
		return 0;
	}

	if (opt->recursive && S_ISDIR(mode1)) {
		int retval;
56
		char *newbase = malloc_base(base, baselen, path1, pathlen1);
57 58 59 60 61 62 63 64 65 66 67 68
		if (opt->tree_in_recursive)
			opt->change(opt, mode1, mode2,
				    sha1, sha2, base, path1);
		retval = diff_tree_sha1(sha1, sha2, newbase, opt);
		free(newbase);
		return retval;
	}

	opt->change(opt, mode1, mode2, sha1, sha2, base, path1);
	return 0;
}

69
static int interesting(struct tree_desc *desc, const char *base, int baselen, struct diff_options *opt)
70 71
{
	const char *path;
72
	const unsigned char *sha1;
73 74
	unsigned mode;
	int i;
75
	int pathlen;
76

77
	if (!opt->nr_paths)
78 79
		return 1;

80
	sha1 = tree_entry_extract(desc, &path, &mode);
81

82
	pathlen = tree_entry_len(path, sha1);
83

84 85 86
	for (i=0; i < opt->nr_paths; i++) {
		const char *match = opt->paths[i];
		int matchlen = opt->pathlens[i];
87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122

		if (baselen >= matchlen) {
			/* If it doesn't match, move along... */
			if (strncmp(base, match, matchlen))
				continue;

			/* The base is a subdirectory of a path which was specified. */
			return 1;
		}

		/* Does the base match? */
		if (strncmp(base, match, baselen))
			continue;

		match += baselen;
		matchlen -= baselen;

		if (pathlen > matchlen)
			continue;

		if (matchlen > pathlen) {
			if (match[pathlen] != '/')
				continue;
			if (!S_ISDIR(mode))
				continue;
		}

		if (strncmp(path, match, pathlen))
			continue;

		return 1;
	}
	return 0; /* No matches */
}

/* A whole sub-tree went away or appeared */
123
static void show_tree(struct diff_options *opt, const char *prefix, struct tree_desc *desc, const char *base, int baselen)
124 125
{
	while (desc->size) {
126 127
		if (interesting(desc, base, baselen, opt))
			show_entry(opt, prefix, desc, base, baselen);
128 129 130 131 132
		update_tree_entry(desc);
	}
}

/* A file entry went away or appeared */
D
David Rientjes 已提交
133
static void show_entry(struct diff_options *opt, const char *prefix, struct tree_desc *desc,
134
		       const char *base, int baselen)
135 136 137
{
	unsigned mode;
	const char *path;
138
	const unsigned char *sha1 = tree_entry_extract(desc, &path, &mode);
139 140

	if (opt->recursive && S_ISDIR(mode)) {
141
		enum object_type type;
142 143
		int pathlen = tree_entry_len(path, sha1);
		char *newbase = malloc_base(base, baselen, path, pathlen);
144 145 146
		struct tree_desc inner;
		void *tree;

147 148
		tree = read_sha1_file(sha1, &type, &inner.size);
		if (!tree || type != OBJ_TREE)
149 150 151
			die("corrupt tree sha %s", sha1_to_hex(sha1));

		inner.buf = tree;
152
		show_tree(opt, prefix, &inner, newbase, baselen + 1 + pathlen);
153 154 155

		free(tree);
		free(newbase);
D
David Rientjes 已提交
156 157
	} else {
		opt->add_remove(opt, prefix[0], mode, sha1, base, path);
158 159 160 161 162
	}
}

int diff_tree(struct tree_desc *t1, struct tree_desc *t2, const char *base, struct diff_options *opt)
{
163 164
	int baselen = strlen(base);

165
	while (t1->size | t2->size) {
J
Junio C Hamano 已提交
166 167
		if (opt->quiet && opt->has_changes)
			break;
168
		if (opt->nr_paths && t1->size && !interesting(t1, base, baselen, opt)) {
169 170 171
			update_tree_entry(t1);
			continue;
		}
172
		if (opt->nr_paths && t2->size && !interesting(t2, base, baselen, opt)) {
173 174 175 176
			update_tree_entry(t2);
			continue;
		}
		if (!t1->size) {
177
			show_entry(opt, "+", t2, base, baselen);
178 179 180 181
			update_tree_entry(t2);
			continue;
		}
		if (!t2->size) {
182
			show_entry(opt, "-", t1, base, baselen);
183 184 185
			update_tree_entry(t1);
			continue;
		}
186
		switch (compare_tree_entry(t1, t2, base, baselen, opt)) {
187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207
		case -1:
			update_tree_entry(t1);
			continue;
		case 0:
			update_tree_entry(t1);
			/* Fallthrough */
		case 1:
			update_tree_entry(t2);
			continue;
		}
		die("git-diff-tree: internal error");
	}
	return 0;
}

int diff_tree_sha1(const unsigned char *old, const unsigned char *new, const char *base, struct diff_options *opt)
{
	void *tree1, *tree2;
	struct tree_desc t1, t2;
	int retval;

208
	tree1 = read_object_with_reference(old, tree_type, &t1.size, NULL);
209 210
	if (!tree1)
		die("unable to read source tree (%s)", sha1_to_hex(old));
211
	tree2 = read_object_with_reference(new, tree_type, &t2.size, NULL);
212 213 214 215 216 217 218 219 220 221
	if (!tree2)
		die("unable to read destination tree (%s)", sha1_to_hex(new));
	t1.buf = tree1;
	t2.buf = tree2;
	retval = diff_tree(&t1, &t2, base, opt);
	free(tree1);
	free(tree2);
	return retval;
}

R
Rene Scharfe 已提交
222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239
int diff_root_tree_sha1(const unsigned char *new, const char *base, struct diff_options *opt)
{
	int retval;
	void *tree;
	struct tree_desc empty, real;

	tree = read_object_with_reference(new, tree_type, &real.size, NULL);
	if (!tree)
		die("unable to read root tree (%s)", sha1_to_hex(new));
	real.buf = tree;

	empty.size = 0;
	empty.buf = "";
	retval = diff_tree(&empty, &real, base, opt);
	free(tree);
	return retval;
}

240 241 242 243 244 245 246 247
static int count_paths(const char **paths)
{
	int i = 0;
	while (*paths++)
		i++;
	return i;
}

248
void diff_tree_release_paths(struct diff_options *opt)
249
{
250 251 252 253 254 255 256 257 258
	free(opt->pathlens);
}

void diff_tree_setup_paths(const char **p, struct diff_options *opt)
{
	opt->nr_paths = 0;
	opt->pathlens = NULL;
	opt->paths = NULL;

259 260 261
	if (p) {
		int i;

262 263 264 265
		opt->paths = p;
		opt->nr_paths = count_paths(p);
		if (opt->nr_paths == 0) {
			opt->pathlens = NULL;
266 267
			return;
		}
268 269 270
		opt->pathlens = xmalloc(opt->nr_paths * sizeof(int));
		for (i=0; i < opt->nr_paths; i++)
			opt->pathlens[i] = strlen(p[i]);
271 272
	}
}