Switch over tree descriptors to contain a pre-parsed entry
[git/git.git] / tree-diff.c
CommitLineData
ac1b3d12
LT
1/*
2 * Helper functions for tree diff generation
3 */
4#include "cache.h"
5#include "diff.h"
8e440259 6#include "tree.h"
ac1b3d12 7
304de2d2 8static char *malloc_base(const char *base, int baselen, const char *path, int pathlen)
ac1b3d12 9{
ac1b3d12
LT
10 char *newbase = xmalloc(baselen + pathlen + 2);
11 memcpy(newbase, base, baselen);
12 memcpy(newbase + baselen, path, pathlen);
13 memcpy(newbase + baselen + pathlen, "/", 2);
14 return newbase;
15}
16
cf995ede 17static void show_entry(struct diff_options *opt, const char *prefix, struct tree_desc *desc,
304de2d2 18 const char *base, int baselen);
ac1b3d12 19
304de2d2 20static int compare_tree_entry(struct tree_desc *t1, struct tree_desc *t2, const char *base, int baselen, struct diff_options *opt)
ac1b3d12
LT
21{
22 unsigned mode1, mode2;
23 const char *path1, *path2;
24 const unsigned char *sha1, *sha2;
25 int cmp, pathlen1, pathlen2;
26
50f9a858
LT
27 sha1 = tree_entry_extract(t1, &path1, &mode1);
28 sha2 = tree_entry_extract(t2, &path2, &mode2);
ac1b3d12 29
304de2d2
LT
30 pathlen1 = tree_entry_len(path1, sha1);
31 pathlen2 = tree_entry_len(path2, sha2);
ac1b3d12
LT
32 cmp = base_name_compare(path1, pathlen1, mode1, path2, pathlen2, mode2);
33 if (cmp < 0) {
304de2d2 34 show_entry(opt, "-", t1, base, baselen);
ac1b3d12
LT
35 return -1;
36 }
37 if (cmp > 0) {
304de2d2 38 show_entry(opt, "+", t2, base, baselen);
ac1b3d12
LT
39 return 1;
40 }
a89fccd2 41 if (!opt->find_copies_harder && !hashcmp(sha1, sha2) && mode1 == mode2)
ac1b3d12
LT
42 return 0;
43
44 /*
45 * If the filemode has changed to/from a directory from/to a regular
46 * file, we need to consider it a remove and an add.
47 */
48 if (S_ISDIR(mode1) != S_ISDIR(mode2)) {
304de2d2
LT
49 show_entry(opt, "-", t1, base, baselen);
50 show_entry(opt, "+", t2, base, baselen);
ac1b3d12
LT
51 return 0;
52 }
53
54 if (opt->recursive && S_ISDIR(mode1)) {
55 int retval;
304de2d2 56 char *newbase = malloc_base(base, baselen, path1, pathlen1);
ac1b3d12
LT
57 if (opt->tree_in_recursive)
58 opt->change(opt, mode1, mode2,
59 sha1, sha2, base, path1);
60 retval = diff_tree_sha1(sha1, sha2, newbase, opt);
61 free(newbase);
62 return retval;
63 }
64
65 opt->change(opt, mode1, mode2, sha1, sha2, base, path1);
66 return 0;
67}
68
5d865017
LT
69/*
70 * Is a tree entry interesting given the pathspec we have?
71 *
72 * Return:
73 * - positive for yes
74 * - zero for no
75 * - negative for "no, and no subsequent entries will be either"
76 */
77static int tree_entry_interesting(struct tree_desc *desc, const char *base, int baselen, struct diff_options *opt)
ac1b3d12
LT
78{
79 const char *path;
304de2d2 80 const unsigned char *sha1;
ac1b3d12
LT
81 unsigned mode;
82 int i;
304de2d2 83 int pathlen;
ac1b3d12 84
a8baa7b9 85 if (!opt->nr_paths)
ac1b3d12
LT
86 return 1;
87
304de2d2 88 sha1 = tree_entry_extract(desc, &path, &mode);
ac1b3d12 89
304de2d2 90 pathlen = tree_entry_len(path, sha1);
ac1b3d12 91
a8baa7b9
JH
92 for (i=0; i < opt->nr_paths; i++) {
93 const char *match = opt->paths[i];
94 int matchlen = opt->pathlens[i];
ac1b3d12
LT
95
96 if (baselen >= matchlen) {
97 /* If it doesn't match, move along... */
98 if (strncmp(base, match, matchlen))
99 continue;
100
101 /* The base is a subdirectory of a path which was specified. */
102 return 1;
103 }
104
105 /* Does the base match? */
106 if (strncmp(base, match, baselen))
107 continue;
108
109 match += baselen;
110 matchlen -= baselen;
111
112 if (pathlen > matchlen)
113 continue;
114
115 if (matchlen > pathlen) {
116 if (match[pathlen] != '/')
117 continue;
118 if (!S_ISDIR(mode))
119 continue;
120 }
121
122 if (strncmp(path, match, pathlen))
123 continue;
124
125 return 1;
126 }
127 return 0; /* No matches */
128}
129
130/* A whole sub-tree went away or appeared */
304de2d2 131static void show_tree(struct diff_options *opt, const char *prefix, struct tree_desc *desc, const char *base, int baselen)
ac1b3d12
LT
132{
133 while (desc->size) {
5d865017
LT
134 int show = tree_entry_interesting(desc, base, baselen, opt);
135 if (show < 0)
136 break;
137 if (show)
304de2d2 138 show_entry(opt, prefix, desc, base, baselen);
ac1b3d12
LT
139 update_tree_entry(desc);
140 }
141}
142
143/* A file entry went away or appeared */
cf995ede 144static void show_entry(struct diff_options *opt, const char *prefix, struct tree_desc *desc,
304de2d2 145 const char *base, int baselen)
ac1b3d12
LT
146{
147 unsigned mode;
148 const char *path;
50f9a858 149 const unsigned char *sha1 = tree_entry_extract(desc, &path, &mode);
ac1b3d12
LT
150
151 if (opt->recursive && S_ISDIR(mode)) {
21666f1a 152 enum object_type type;
304de2d2
LT
153 int pathlen = tree_entry_len(path, sha1);
154 char *newbase = malloc_base(base, baselen, path, pathlen);
ac1b3d12
LT
155 struct tree_desc inner;
156 void *tree;
6fda5e51 157 unsigned long size;
ac1b3d12 158
6fda5e51 159 tree = read_sha1_file(sha1, &type, &size);
21666f1a 160 if (!tree || type != OBJ_TREE)
ac1b3d12
LT
161 die("corrupt tree sha %s", sha1_to_hex(sha1));
162
6fda5e51 163 init_tree_desc(&inner, tree, size);
304de2d2 164 show_tree(opt, prefix, &inner, newbase, baselen + 1 + pathlen);
ac1b3d12
LT
165
166 free(tree);
167 free(newbase);
cf995ede
DR
168 } else {
169 opt->add_remove(opt, prefix[0], mode, sha1, base, path);
ac1b3d12 170 }
ac1b3d12
LT
171}
172
5d865017
LT
173static void skip_uninteresting(struct tree_desc *t, const char *base, int baselen, struct diff_options *opt)
174{
175 while (t->size) {
176 int show = tree_entry_interesting(t, base, baselen, opt);
177 if (!show) {
178 update_tree_entry(t);
179 continue;
180 }
181 /* Skip it all? */
182 if (show < 0)
183 t->size = 0;
184 return;
185 }
186}
187
ac1b3d12
LT
188int diff_tree(struct tree_desc *t1, struct tree_desc *t2, const char *base, struct diff_options *opt)
189{
304de2d2
LT
190 int baselen = strlen(base);
191
5d865017 192 for (;;) {
822cac01
JH
193 if (opt->quiet && opt->has_changes)
194 break;
5d865017
LT
195 if (opt->nr_paths) {
196 skip_uninteresting(t1, base, baselen, opt);
197 skip_uninteresting(t2, base, baselen, opt);
ac1b3d12
LT
198 }
199 if (!t1->size) {
5d865017
LT
200 if (!t2->size)
201 break;
304de2d2 202 show_entry(opt, "+", t2, base, baselen);
ac1b3d12
LT
203 update_tree_entry(t2);
204 continue;
205 }
206 if (!t2->size) {
304de2d2 207 show_entry(opt, "-", t1, base, baselen);
ac1b3d12
LT
208 update_tree_entry(t1);
209 continue;
210 }
304de2d2 211 switch (compare_tree_entry(t1, t2, base, baselen, opt)) {
ac1b3d12
LT
212 case -1:
213 update_tree_entry(t1);
214 continue;
215 case 0:
216 update_tree_entry(t1);
217 /* Fallthrough */
218 case 1:
219 update_tree_entry(t2);
220 continue;
221 }
222 die("git-diff-tree: internal error");
223 }
224 return 0;
225}
226
227int diff_tree_sha1(const unsigned char *old, const unsigned char *new, const char *base, struct diff_options *opt)
228{
229 void *tree1, *tree2;
230 struct tree_desc t1, t2;
6fda5e51 231 unsigned long size1, size2;
ac1b3d12
LT
232 int retval;
233
6fda5e51 234 tree1 = read_object_with_reference(old, tree_type, &size1, NULL);
ac1b3d12
LT
235 if (!tree1)
236 die("unable to read source tree (%s)", sha1_to_hex(old));
6fda5e51 237 tree2 = read_object_with_reference(new, tree_type, &size2, NULL);
ac1b3d12
LT
238 if (!tree2)
239 die("unable to read destination tree (%s)", sha1_to_hex(new));
6fda5e51
LT
240 init_tree_desc(&t1, tree1, size1);
241 init_tree_desc(&t2, tree2, size2);
ac1b3d12
LT
242 retval = diff_tree(&t1, &t2, base, opt);
243 free(tree1);
244 free(tree2);
245 return retval;
246}
247
2b60356d
RS
248int diff_root_tree_sha1(const unsigned char *new, const char *base, struct diff_options *opt)
249{
250 int retval;
251 void *tree;
6fda5e51 252 unsigned long size;
2b60356d
RS
253 struct tree_desc empty, real;
254
6fda5e51 255 tree = read_object_with_reference(new, tree_type, &size, NULL);
2b60356d
RS
256 if (!tree)
257 die("unable to read root tree (%s)", sha1_to_hex(new));
6fda5e51 258 init_tree_desc(&real, tree, size);
2b60356d 259
6fda5e51 260 init_tree_desc(&empty, "", 0);
2b60356d
RS
261 retval = diff_tree(&empty, &real, base, opt);
262 free(tree);
263 return retval;
264}
265
ac1b3d12
LT
266static int count_paths(const char **paths)
267{
268 int i = 0;
269 while (*paths++)
270 i++;
271 return i;
272}
273
a8baa7b9 274void diff_tree_release_paths(struct diff_options *opt)
ac1b3d12 275{
a8baa7b9
JH
276 free(opt->pathlens);
277}
278
279void diff_tree_setup_paths(const char **p, struct diff_options *opt)
280{
281 opt->nr_paths = 0;
282 opt->pathlens = NULL;
283 opt->paths = NULL;
284
ac1b3d12
LT
285 if (p) {
286 int i;
287
a8baa7b9
JH
288 opt->paths = p;
289 opt->nr_paths = count_paths(p);
290 if (opt->nr_paths == 0) {
291 opt->pathlens = NULL;
7e4a2a84
JH
292 return;
293 }
a8baa7b9
JH
294 opt->pathlens = xmalloc(opt->nr_paths * sizeof(int));
295 for (i=0; i < opt->nr_paths; i++)
296 opt->pathlens[i] = strlen(p[i]);
ac1b3d12
LT
297 }
298}