]>
Commit | Line | Data |
---|---|---|
af3feefa JH |
1 | #include "cache.h" |
2 | #include "commit.h" | |
8e440259 | 3 | #include "blob.h" |
af3feefa JH |
4 | #include "diff.h" |
5 | #include "diffcore.h" | |
6 | #include "quote.h" | |
d9ea73e0 | 7 | #include "xdiff-interface.h" |
91539833 | 8 | #include "log-tree.h" |
af3feefa | 9 | |
ea726d02 | 10 | static struct combine_diff_path *intersect_paths(struct combine_diff_path *curr, int n, int num_parent) |
af3feefa JH |
11 | { |
12 | struct diff_queue_struct *q = &diff_queued_diff; | |
ea726d02 | 13 | struct combine_diff_path *p; |
af3feefa JH |
14 | int i; |
15 | ||
16 | if (!n) { | |
ea726d02 | 17 | struct combine_diff_path *list = NULL, **tail = &list; |
af3feefa JH |
18 | for (i = 0; i < q->nr; i++) { |
19 | int len; | |
20 | const char *path; | |
a976b0a5 | 21 | if (diff_unmodified_pair(q->queue[i])) |
af3feefa JH |
22 | continue; |
23 | path = q->queue[i]->two->path; | |
24 | len = strlen(path); | |
2454c962 JH |
25 | p = xmalloc(combine_diff_path_size(num_parent, len)); |
26 | p->path = (char*) &(p->parent[num_parent]); | |
af3feefa JH |
27 | memcpy(p->path, path, len); |
28 | p->path[len] = 0; | |
29 | p->len = len; | |
30 | p->next = NULL; | |
2454c962 JH |
31 | memset(p->parent, 0, |
32 | sizeof(p->parent[0]) * num_parent); | |
33 | ||
e702496e | 34 | hashcpy(p->sha1, q->queue[i]->two->sha1); |
2454c962 | 35 | p->mode = q->queue[i]->two->mode; |
e702496e | 36 | hashcpy(p->parent[n].sha1, q->queue[i]->one->sha1); |
2454c962 | 37 | p->parent[n].mode = q->queue[i]->one->mode; |
d416df88 | 38 | p->parent[n].status = q->queue[i]->status; |
5290a0f8 JH |
39 | *tail = p; |
40 | tail = &p->next; | |
af3feefa JH |
41 | } |
42 | return list; | |
43 | } | |
44 | ||
45 | for (p = curr; p; p = p->next) { | |
46 | int found = 0; | |
47 | if (!p->len) | |
48 | continue; | |
49 | for (i = 0; i < q->nr; i++) { | |
50 | const char *path; | |
51 | int len; | |
52 | ||
a976b0a5 | 53 | if (diff_unmodified_pair(q->queue[i])) |
af3feefa JH |
54 | continue; |
55 | path = q->queue[i]->two->path; | |
56 | len = strlen(path); | |
57 | if (len == p->len && !memcmp(path, p->path, len)) { | |
58 | found = 1; | |
e702496e | 59 | hashcpy(p->parent[n].sha1, q->queue[i]->one->sha1); |
2454c962 | 60 | p->parent[n].mode = q->queue[i]->one->mode; |
d416df88 | 61 | p->parent[n].status = q->queue[i]->status; |
af3feefa JH |
62 | break; |
63 | } | |
64 | } | |
65 | if (!found) | |
66 | p->len = 0; | |
67 | } | |
68 | return curr; | |
69 | } | |
70 | ||
b469d8b6 | 71 | /* Lines lost from parent */ |
af3feefa JH |
72 | struct lline { |
73 | struct lline *next; | |
74 | int len; | |
75 | unsigned long parent_map; | |
76 | char line[FLEX_ARRAY]; | |
77 | }; | |
78 | ||
b469d8b6 | 79 | /* Lines surviving in the merge result */ |
af3feefa JH |
80 | struct sline { |
81 | struct lline *lost_head, **lost_tail; | |
82 | char *bol; | |
83 | int len; | |
46dc9412 JH |
84 | /* bit 0 up to (N-1) are on if the parent has this line (i.e. |
85 | * we did not change it). | |
b469d8b6 | 86 | * bit N is used for "interesting" lines, including context. |
c86fbe53 | 87 | * bit (N+1) is used for "do not show deletion before this". |
b469d8b6 | 88 | */ |
af3feefa | 89 | unsigned long flag; |
f16706cc | 90 | unsigned long *p_lno; |
af3feefa JH |
91 | }; |
92 | ||
93 | static char *grab_blob(const unsigned char *sha1, unsigned long *size) | |
94 | { | |
95 | char *blob; | |
21666f1a | 96 | enum object_type type; |
0bef57ee | 97 | if (is_null_sha1(sha1)) { |
af3feefa JH |
98 | /* deleted blob */ |
99 | *size = 0; | |
100 | return xcalloc(1, 1); | |
101 | } | |
21666f1a NP |
102 | blob = read_sha1_file(sha1, &type, size); |
103 | if (type != OBJ_BLOB) | |
af3feefa JH |
104 | die("object '%s' is not a blob!", sha1_to_hex(sha1)); |
105 | return blob; | |
106 | } | |
107 | ||
f23fc773 | 108 | static void append_lost(struct sline *sline, int n, const char *line, int len) |
af3feefa JH |
109 | { |
110 | struct lline *lline; | |
af3feefa JH |
111 | unsigned long this_mask = (1UL<<n); |
112 | if (line[len-1] == '\n') | |
113 | len--; | |
114 | ||
115 | /* Check to see if we can squash things */ | |
116 | if (sline->lost_head) { | |
117 | struct lline *last_one = NULL; | |
118 | /* We cannot squash it with earlier one */ | |
119 | for (lline = sline->lost_head; | |
120 | lline; | |
121 | lline = lline->next) | |
122 | if (lline->parent_map & this_mask) | |
123 | last_one = lline; | |
124 | lline = last_one ? last_one->next : sline->lost_head; | |
125 | while (lline) { | |
126 | if (lline->len == len && | |
127 | !memcmp(lline->line, line, len)) { | |
128 | lline->parent_map |= this_mask; | |
129 | return; | |
130 | } | |
131 | lline = lline->next; | |
132 | } | |
133 | } | |
134 | ||
135 | lline = xmalloc(sizeof(*lline) + len + 1); | |
136 | lline->len = len; | |
137 | lline->next = NULL; | |
138 | lline->parent_map = this_mask; | |
139 | memcpy(lline->line, line, len); | |
140 | lline->line[len] = 0; | |
5290a0f8 | 141 | *sline->lost_tail = lline; |
af3feefa JH |
142 | sline->lost_tail = &lline->next; |
143 | } | |
144 | ||
f23fc773 | 145 | struct combine_diff_state { |
d9ea73e0 JH |
146 | struct xdiff_emit_state xm; |
147 | ||
a0fd3146 JH |
148 | unsigned int lno; |
149 | int ob, on, nb, nn; | |
f23fc773 JH |
150 | unsigned long nmask; |
151 | int num_parent; | |
152 | int n; | |
153 | struct sline *sline; | |
154 | struct sline *lost_bucket; | |
155 | }; | |
156 | ||
d9ea73e0 | 157 | static void consume_line(void *state_, char *line, unsigned long len) |
f23fc773 | 158 | { |
d9ea73e0 | 159 | struct combine_diff_state *state = state_; |
f23fc773 JH |
160 | if (5 < len && !memcmp("@@ -", line, 4)) { |
161 | if (parse_hunk_header(line, len, | |
162 | &state->ob, &state->on, | |
163 | &state->nb, &state->nn)) | |
164 | return; | |
165 | state->lno = state->nb; | |
166 | if (!state->nb) | |
167 | /* @@ -1,2 +0,0 @@ to remove the | |
168 | * first two lines... | |
169 | */ | |
170 | state->nb = 1; | |
171 | if (state->nn == 0) | |
172 | /* @@ -X,Y +N,0 @@ removed Y lines | |
173 | * that would have come *after* line N | |
174 | * in the result. Our lost buckets hang | |
175 | * to the line after the removed lines, | |
176 | */ | |
177 | state->lost_bucket = &state->sline[state->nb]; | |
178 | else | |
179 | state->lost_bucket = &state->sline[state->nb-1]; | |
180 | if (!state->sline[state->nb-1].p_lno) | |
181 | state->sline[state->nb-1].p_lno = | |
182 | xcalloc(state->num_parent, | |
183 | sizeof(unsigned long)); | |
184 | state->sline[state->nb-1].p_lno[state->n] = state->ob; | |
185 | return; | |
186 | } | |
187 | if (!state->lost_bucket) | |
188 | return; /* not in any hunk yet */ | |
189 | switch (line[0]) { | |
190 | case '-': | |
191 | append_lost(state->lost_bucket, state->n, line+1, len-1); | |
192 | break; | |
193 | case '+': | |
194 | state->sline[state->lno-1].flag |= state->nmask; | |
195 | state->lno++; | |
196 | break; | |
197 | } | |
198 | } | |
199 | ||
f23fc773 | 200 | static void combine_diff(const unsigned char *parent, mmfile_t *result_file, |
2386c297 JH |
201 | struct sline *sline, unsigned int cnt, int n, |
202 | int num_parent) | |
af3feefa | 203 | { |
f23fc773 | 204 | unsigned int p_lno, lno; |
f16706cc | 205 | unsigned long nmask = (1UL << n); |
f23fc773 JH |
206 | xpparam_t xpp; |
207 | xdemitconf_t xecfg; | |
208 | mmfile_t parent_file; | |
209 | xdemitcb_t ecb; | |
210 | struct combine_diff_state state; | |
211 | unsigned long sz; | |
af3feefa | 212 | |
4462731e JH |
213 | if (!cnt) |
214 | return; /* result deleted */ | |
215 | ||
f23fc773 JH |
216 | parent_file.ptr = grab_blob(parent, &sz); |
217 | parent_file.size = sz; | |
218 | xpp.flags = XDF_NEED_MINIMAL; | |
30b25010 | 219 | memset(&xecfg, 0, sizeof(xecfg)); |
d9ea73e0 | 220 | ecb.outf = xdiff_outf; |
f23fc773 JH |
221 | ecb.priv = &state; |
222 | memset(&state, 0, sizeof(state)); | |
d9ea73e0 | 223 | state.xm.consume = consume_line; |
f23fc773 JH |
224 | state.nmask = nmask; |
225 | state.sline = sline; | |
226 | state.lno = 1; | |
227 | state.num_parent = num_parent; | |
228 | state.n = n; | |
229 | ||
c279d7e9 | 230 | xdi_diff(&parent_file, result_file, &xpp, &xecfg, &ecb); |
f23fc773 | 231 | free(parent_file.ptr); |
f16706cc JH |
232 | |
233 | /* Assign line numbers for this parent. | |
234 | * | |
235 | * sline[lno].p_lno[n] records the first line number | |
236 | * (counting from 1) for parent N if the final hunk display | |
237 | * started by showing sline[lno] (possibly showing the lost | |
238 | * lines attached to it first). | |
239 | */ | |
8a470ebf | 240 | for (lno = 0, p_lno = 1; lno <= cnt; lno++) { |
f16706cc JH |
241 | struct lline *ll; |
242 | sline[lno].p_lno[n] = p_lno; | |
243 | ||
244 | /* How many lines would this sline advance the p_lno? */ | |
245 | ll = sline[lno].lost_head; | |
246 | while (ll) { | |
247 | if (ll->parent_map & nmask) | |
248 | p_lno++; /* '-' means parent had it */ | |
249 | ll = ll->next; | |
250 | } | |
8a470ebf | 251 | if (lno < cnt && !(sline[lno].flag & nmask)) |
f16706cc JH |
252 | p_lno++; /* no '+' means parent had it */ |
253 | } | |
254 | sline[lno].p_lno[n] = p_lno; /* trailer */ | |
af3feefa JH |
255 | } |
256 | ||
257 | static unsigned long context = 3; | |
258 | static char combine_marker = '@'; | |
259 | ||
260 | static int interesting(struct sline *sline, unsigned long all_mask) | |
261 | { | |
46dc9412 JH |
262 | /* If some parents lost lines here, or if we have added to |
263 | * some parent, it is interesting. | |
264 | */ | |
265 | return ((sline->flag & all_mask) || sline->lost_head); | |
af3feefa JH |
266 | } |
267 | ||
3ec1909f JH |
268 | static unsigned long adjust_hunk_tail(struct sline *sline, |
269 | unsigned long all_mask, | |
270 | unsigned long hunk_begin, | |
271 | unsigned long i) | |
272 | { | |
46dc9412 JH |
273 | /* i points at the first uninteresting line. If the last line |
274 | * of the hunk was interesting only because it has some | |
275 | * deletion, then it is not all that interesting for the | |
276 | * purpose of giving trailing context lines. This is because | |
277 | * we output '-' line and then unmodified sline[i-1] itself in | |
278 | * that case which gives us one extra context line. | |
3ec1909f | 279 | */ |
46dc9412 | 280 | if ((hunk_begin + 1 <= i) && !(sline[i-1].flag & all_mask)) |
3ec1909f JH |
281 | i--; |
282 | return i; | |
283 | } | |
284 | ||
46dc9412 JH |
285 | static unsigned long find_next(struct sline *sline, |
286 | unsigned long mark, | |
287 | unsigned long i, | |
288 | unsigned long cnt, | |
2386c297 | 289 | int look_for_uninteresting) |
3ec1909f | 290 | { |
46dc9412 JH |
291 | /* We have examined up to i-1 and are about to look at i. |
292 | * Find next interesting or uninteresting line. Here, | |
293 | * "interesting" does not mean interesting(), but marked by | |
294 | * the give_context() function below (i.e. it includes context | |
295 | * lines that are not interesting to interesting() function | |
296 | * that are surrounded by interesting() ones. | |
297 | */ | |
74065951 | 298 | while (i <= cnt) |
2386c297 | 299 | if (look_for_uninteresting |
46dc9412 JH |
300 | ? !(sline[i].flag & mark) |
301 | : (sline[i].flag & mark)) | |
3ec1909f JH |
302 | return i; |
303 | else | |
304 | i++; | |
74065951 | 305 | return i; |
3ec1909f JH |
306 | } |
307 | ||
308 | static int give_context(struct sline *sline, unsigned long cnt, int num_parent) | |
af3feefa JH |
309 | { |
310 | unsigned long all_mask = (1UL<<num_parent) - 1; | |
311 | unsigned long mark = (1UL<<num_parent); | |
c86fbe53 | 312 | unsigned long no_pre_delete = (2UL<<num_parent); |
af3feefa JH |
313 | unsigned long i; |
314 | ||
46dc9412 | 315 | /* Two groups of interesting lines may have a short gap of |
82e5a82f | 316 | * uninteresting lines. Connect such groups to give them a |
46dc9412 JH |
317 | * bit of context. |
318 | * | |
319 | * We first start from what the interesting() function says, | |
320 | * and mark them with "mark", and paint context lines with the | |
321 | * mark. So interesting() would still say false for such context | |
322 | * lines but they are treated as "interesting" in the end. | |
323 | */ | |
324 | i = find_next(sline, mark, 0, cnt, 0); | |
74065951 | 325 | if (cnt < i) |
3ec1909f JH |
326 | return 0; |
327 | ||
74065951 | 328 | while (i <= cnt) { |
3ec1909f JH |
329 | unsigned long j = (context < i) ? (i - context) : 0; |
330 | unsigned long k; | |
46dc9412 JH |
331 | |
332 | /* Paint a few lines before the first interesting line. */ | |
3ec1909f | 333 | while (j < i) |
c86fbe53 | 334 | sline[j++].flag |= mark | no_pre_delete; |
3ec1909f JH |
335 | |
336 | again: | |
46dc9412 JH |
337 | /* we know up to i is to be included. where does the |
338 | * next uninteresting one start? | |
339 | */ | |
340 | j = find_next(sline, mark, i, cnt, 1); | |
74065951 | 341 | if (cnt < j) |
3ec1909f JH |
342 | break; /* the rest are all interesting */ |
343 | ||
344 | /* lookahead context lines */ | |
46dc9412 | 345 | k = find_next(sline, mark, j, cnt, 0); |
3ec1909f JH |
346 | j = adjust_hunk_tail(sline, all_mask, i, j); |
347 | ||
348 | if (k < j + context) { | |
349 | /* k is interesting and [j,k) are not, but | |
350 | * paint them interesting because the gap is small. | |
351 | */ | |
352 | while (j < k) | |
af3feefa | 353 | sline[j++].flag |= mark; |
3ec1909f JH |
354 | i = k; |
355 | goto again; | |
af3feefa | 356 | } |
3ec1909f JH |
357 | |
358 | /* j is the first uninteresting line and there is | |
46dc9412 JH |
359 | * no overlap beyond it within context lines. Paint |
360 | * the trailing edge a bit. | |
3ec1909f JH |
361 | */ |
362 | i = k; | |
74065951 | 363 | k = (j + context < cnt+1) ? j + context : cnt+1; |
3ec1909f JH |
364 | while (j < k) |
365 | sline[j++].flag |= mark; | |
366 | } | |
367 | return 1; | |
368 | } | |
369 | ||
370 | static int make_hunks(struct sline *sline, unsigned long cnt, | |
371 | int num_parent, int dense) | |
372 | { | |
373 | unsigned long all_mask = (1UL<<num_parent) - 1; | |
374 | unsigned long mark = (1UL<<num_parent); | |
375 | unsigned long i; | |
376 | int has_interesting = 0; | |
377 | ||
74065951 | 378 | for (i = 0; i <= cnt; i++) { |
3ec1909f JH |
379 | if (interesting(&sline[i], all_mask)) |
380 | sline[i].flag |= mark; | |
381 | else | |
382 | sline[i].flag &= ~mark; | |
af3feefa | 383 | } |
d8f4790e | 384 | if (!dense) |
3ec1909f | 385 | return give_context(sline, cnt, num_parent); |
d8f4790e | 386 | |
263eee29 JH |
387 | /* Look at each hunk, and if we have changes from only one |
388 | * parent, or the changes are the same from all but one | |
389 | * parent, mark that uninteresting. | |
d8f4790e JH |
390 | */ |
391 | i = 0; | |
74065951 | 392 | while (i <= cnt) { |
3ec1909f | 393 | unsigned long j, hunk_begin, hunk_end; |
bf1c32bd | 394 | unsigned long same_diff; |
74065951 | 395 | while (i <= cnt && !(sline[i].flag & mark)) |
d8f4790e | 396 | i++; |
74065951 | 397 | if (cnt < i) |
d8f4790e | 398 | break; /* No more interesting hunks */ |
3ec1909f | 399 | hunk_begin = i; |
74065951 | 400 | for (j = i + 1; j <= cnt; j++) { |
3ec1909f JH |
401 | if (!(sline[j].flag & mark)) { |
402 | /* Look beyond the end to see if there | |
403 | * is an interesting line after this | |
404 | * hunk within context span. | |
405 | */ | |
406 | unsigned long la; /* lookahead */ | |
407 | int contin = 0; | |
408 | la = adjust_hunk_tail(sline, all_mask, | |
409 | hunk_begin, j); | |
74065951 JH |
410 | la = (la + context < cnt + 1) ? |
411 | (la + context) : cnt + 1; | |
3ec1909f JH |
412 | while (j <= --la) { |
413 | if (sline[la].flag & mark) { | |
414 | contin = 1; | |
415 | break; | |
416 | } | |
417 | } | |
418 | if (!contin) | |
419 | break; | |
420 | j = la; | |
421 | } | |
422 | } | |
423 | hunk_end = j; | |
424 | ||
bf1c32bd | 425 | /* [i..hunk_end) are interesting. Now is it really |
fd4b1d21 JH |
426 | * interesting? We check if there are only two versions |
427 | * and the result matches one of them. That is, we look | |
428 | * at: | |
429 | * (+) line, which records lines added to which parents; | |
430 | * this line appears in the result. | |
431 | * (-) line, which records from what parents the line | |
432 | * was removed; this line does not appear in the result. | |
433 | * then check the set of parents the result has difference | |
434 | * from, from all lines. If there are lines that has | |
435 | * different set of parents that the result has differences | |
436 | * from, that means we have more than two versions. | |
437 | * | |
438 | * Even when we have only two versions, if the result does | |
439 | * not match any of the parents, the it should be considered | |
440 | * interesting. In such a case, we would have all '+' line. | |
441 | * After passing the above "two versions" test, that would | |
442 | * appear as "the same set of parents" to be "all parents". | |
d8f4790e | 443 | */ |
bf1c32bd JH |
444 | same_diff = 0; |
445 | has_interesting = 0; | |
446 | for (j = i; j < hunk_end && !has_interesting; j++) { | |
46dc9412 | 447 | unsigned long this_diff = sline[j].flag & all_mask; |
bf1c32bd JH |
448 | struct lline *ll = sline[j].lost_head; |
449 | if (this_diff) { | |
450 | /* This has some changes. Is it the | |
451 | * same as others? | |
452 | */ | |
453 | if (!same_diff) | |
454 | same_diff = this_diff; | |
455 | else if (same_diff != this_diff) { | |
456 | has_interesting = 1; | |
457 | break; | |
458 | } | |
459 | } | |
460 | while (ll && !has_interesting) { | |
461 | /* Lost this line from these parents; | |
462 | * who are they? Are they the same? | |
463 | */ | |
464 | this_diff = ll->parent_map; | |
465 | if (!same_diff) | |
466 | same_diff = this_diff; | |
467 | else if (same_diff != this_diff) { | |
468 | has_interesting = 1; | |
469 | } | |
470 | ll = ll->next; | |
471 | } | |
d8f4790e | 472 | } |
bf1c32bd | 473 | |
fd4b1d21 | 474 | if (!has_interesting && same_diff != all_mask) { |
d8f4790e | 475 | /* This hunk is not that interesting after all */ |
3ec1909f | 476 | for (j = hunk_begin; j < hunk_end; j++) |
d8f4790e JH |
477 | sline[j].flag &= ~mark; |
478 | } | |
479 | i = hunk_end; | |
480 | } | |
3ec1909f JH |
481 | |
482 | has_interesting = give_context(sline, cnt, num_parent); | |
8828cdcb | 483 | return has_interesting; |
af3feefa JH |
484 | } |
485 | ||
3b0f5e88 | 486 | static void show_parent_lno(struct sline *sline, unsigned long l0, unsigned long l1, int n, unsigned long null_context) |
f16706cc JH |
487 | { |
488 | l0 = sline[l0].p_lno[n]; | |
489 | l1 = sline[l1].p_lno[n]; | |
3b0f5e88 | 490 | printf(" -%lu,%lu", l0, l1-l0-null_context); |
f16706cc JH |
491 | } |
492 | ||
d5f6a01a JH |
493 | static int hunk_comment_line(const char *bol) |
494 | { | |
7a8ac59f JH |
495 | int ch; |
496 | ||
497 | if (!bol) | |
498 | return 0; | |
499 | ch = *bol & 0xff; | |
d5f6a01a JH |
500 | return (isalpha(ch) || ch == '_' || ch == '$'); |
501 | } | |
502 | ||
39280970 JH |
503 | static void show_line_to_eol(const char *line, int len, const char *reset) |
504 | { | |
505 | int saw_cr_at_eol = 0; | |
506 | if (len < 0) | |
507 | len = strlen(line); | |
508 | saw_cr_at_eol = (len && line[len-1] == '\r'); | |
509 | ||
510 | printf("%.*s%s%s\n", len - saw_cr_at_eol, line, | |
511 | reset, | |
512 | saw_cr_at_eol ? "\r" : ""); | |
513 | } | |
514 | ||
567a03d1 JH |
515 | static void dump_sline(struct sline *sline, unsigned long cnt, int num_parent, |
516 | int use_color) | |
af3feefa JH |
517 | { |
518 | unsigned long mark = (1UL<<num_parent); | |
c86fbe53 | 519 | unsigned long no_pre_delete = (2UL<<num_parent); |
af3feefa | 520 | int i; |
f16706cc | 521 | unsigned long lno = 0; |
567a03d1 JH |
522 | const char *c_frag = diff_get_color(use_color, DIFF_FRAGINFO); |
523 | const char *c_new = diff_get_color(use_color, DIFF_FILE_NEW); | |
524 | const char *c_old = diff_get_color(use_color, DIFF_FILE_OLD); | |
525 | const char *c_plain = diff_get_color(use_color, DIFF_PLAIN); | |
526 | const char *c_reset = diff_get_color(use_color, DIFF_RESET); | |
af3feefa | 527 | |
4462731e JH |
528 | if (!cnt) |
529 | return; /* result deleted */ | |
530 | ||
af3feefa JH |
531 | while (1) { |
532 | struct sline *sl = &sline[lno]; | |
8bc7574b JH |
533 | unsigned long hunk_end; |
534 | unsigned long rlines; | |
d5f6a01a | 535 | const char *hunk_comment = NULL; |
3b0f5e88 | 536 | unsigned long null_context = 0; |
d5f6a01a JH |
537 | |
538 | while (lno <= cnt && !(sline[lno].flag & mark)) { | |
539 | if (hunk_comment_line(sline[lno].bol)) | |
540 | hunk_comment = sline[lno].bol; | |
af3feefa | 541 | lno++; |
d5f6a01a | 542 | } |
8a470ebf | 543 | if (cnt < lno) |
af3feefa | 544 | break; |
8a470ebf | 545 | else { |
74065951 | 546 | for (hunk_end = lno + 1; hunk_end <= cnt; hunk_end++) |
8a470ebf JH |
547 | if (!(sline[hunk_end].flag & mark)) |
548 | break; | |
549 | } | |
74065951 JH |
550 | rlines = hunk_end - lno; |
551 | if (cnt < hunk_end) | |
552 | rlines--; /* pointing at the last delete hunk */ | |
3b0f5e88 JH |
553 | |
554 | if (!context) { | |
555 | /* | |
556 | * Even when running with --unified=0, all | |
557 | * lines in the hunk needs to be processed in | |
558 | * the loop below in order to show the | |
559 | * deletion recorded in lost_head. However, | |
560 | * we do not want to show the resulting line | |
561 | * with all blank context markers in such a | |
562 | * case. Compensate. | |
563 | */ | |
564 | unsigned long j; | |
565 | for (j = lno; j < hunk_end; j++) | |
566 | if (!(sline[j].flag & (mark-1))) | |
567 | null_context++; | |
568 | rlines -= null_context; | |
569 | } | |
570 | ||
567a03d1 | 571 | fputs(c_frag, stdout); |
af3feefa | 572 | for (i = 0; i <= num_parent; i++) putchar(combine_marker); |
f16706cc | 573 | for (i = 0; i < num_parent; i++) |
3b0f5e88 | 574 | show_parent_lno(sline, lno, hunk_end, i, null_context); |
74065951 | 575 | printf(" +%lu,%lu ", lno+1, rlines); |
af3feefa | 576 | for (i = 0; i <= num_parent; i++) putchar(combine_marker); |
d5f6a01a JH |
577 | |
578 | if (hunk_comment) { | |
579 | int comment_end = 0; | |
580 | for (i = 0; i < 40; i++) { | |
581 | int ch = hunk_comment[i] & 0xff; | |
582 | if (!ch || ch == '\n') | |
583 | break; | |
584 | if (!isspace(ch)) | |
585 | comment_end = i; | |
586 | } | |
587 | if (comment_end) | |
588 | putchar(' '); | |
589 | for (i = 0; i < comment_end; i++) | |
590 | putchar(hunk_comment[i]); | |
591 | } | |
592 | ||
567a03d1 | 593 | printf("%s\n", c_reset); |
af3feefa JH |
594 | while (lno < hunk_end) { |
595 | struct lline *ll; | |
596 | int j; | |
46dc9412 | 597 | unsigned long p_mask; |
af3feefa | 598 | sl = &sline[lno++]; |
c86fbe53 | 599 | ll = (sl->flag & no_pre_delete) ? NULL : sl->lost_head; |
af3feefa | 600 | while (ll) { |
567a03d1 | 601 | fputs(c_old, stdout); |
af3feefa JH |
602 | for (j = 0; j < num_parent; j++) { |
603 | if (ll->parent_map & (1UL<<j)) | |
604 | putchar('-'); | |
605 | else | |
606 | putchar(' '); | |
607 | } | |
39280970 | 608 | show_line_to_eol(ll->line, -1, c_reset); |
af3feefa JH |
609 | ll = ll->next; |
610 | } | |
74065951 | 611 | if (cnt < lno) |
8a470ebf | 612 | break; |
46dc9412 | 613 | p_mask = 1; |
3b0f5e88 JH |
614 | if (!(sl->flag & (mark-1))) { |
615 | /* | |
616 | * This sline was here to hang the | |
617 | * lost lines in front of it. | |
618 | */ | |
619 | if (!context) | |
620 | continue; | |
567a03d1 | 621 | fputs(c_plain, stdout); |
3b0f5e88 | 622 | } |
567a03d1 JH |
623 | else |
624 | fputs(c_new, stdout); | |
af3feefa | 625 | for (j = 0; j < num_parent; j++) { |
46dc9412 | 626 | if (p_mask & sl->flag) |
af3feefa | 627 | putchar('+'); |
46dc9412 JH |
628 | else |
629 | putchar(' '); | |
630 | p_mask <<= 1; | |
af3feefa | 631 | } |
39280970 | 632 | show_line_to_eol(sl->bol, sl->len, c_reset); |
af3feefa JH |
633 | } |
634 | } | |
635 | } | |
636 | ||
3c39e9bd JH |
637 | static void reuse_combine_diff(struct sline *sline, unsigned long cnt, |
638 | int i, int j) | |
639 | { | |
640 | /* We have already examined parent j and we know parent i | |
641 | * and parent j are the same, so reuse the combined result | |
642 | * of parent j for parent i. | |
643 | */ | |
644 | unsigned long lno, imask, jmask; | |
645 | imask = (1UL<<i); | |
646 | jmask = (1UL<<j); | |
647 | ||
8a470ebf | 648 | for (lno = 0; lno <= cnt; lno++) { |
3c39e9bd | 649 | struct lline *ll = sline->lost_head; |
f16706cc | 650 | sline->p_lno[i] = sline->p_lno[j]; |
3c39e9bd JH |
651 | while (ll) { |
652 | if (ll->parent_map & jmask) | |
653 | ll->parent_map |= imask; | |
654 | ll = ll->next; | |
655 | } | |
46dc9412 JH |
656 | if (sline->flag & jmask) |
657 | sline->flag |= imask; | |
3c39e9bd JH |
658 | sline++; |
659 | } | |
4462731e JH |
660 | /* the overall size of the file (sline[cnt]) */ |
661 | sline->p_lno[i] = sline->p_lno[j]; | |
3c39e9bd JH |
662 | } |
663 | ||
462a15bc JH |
664 | static void dump_quoted_path(const char *head, |
665 | const char *prefix, | |
666 | const char *path, | |
567a03d1 | 667 | const char *c_meta, const char *c_reset) |
eab144ac | 668 | { |
462a15bc JH |
669 | static struct strbuf buf = STRBUF_INIT; |
670 | ||
671 | strbuf_reset(&buf); | |
672 | strbuf_addstr(&buf, c_meta); | |
673 | strbuf_addstr(&buf, head); | |
d5625091 | 674 | quote_two_c_style(&buf, prefix, path, 0); |
462a15bc JH |
675 | strbuf_addstr(&buf, c_reset); |
676 | puts(buf.buf); | |
eab144ac LT |
677 | } |
678 | ||
89b0c4b5 JH |
679 | static void show_patch_diff(struct combine_diff_path *elem, int num_parent, |
680 | int dense, struct rev_info *rev) | |
af3feefa | 681 | { |
91539833 | 682 | struct diff_options *opt = &rev->diffopt; |
f23fc773 | 683 | unsigned long result_size, cnt, lno; |
310f8b5b | 684 | char *result, *cp; |
af3feefa | 685 | struct sline *sline; /* survived lines */ |
2454c962 | 686 | int mode_differs = 0; |
89b0c4b5 | 687 | int i, show_hunks; |
0bef57ee | 688 | int working_tree_file = is_null_sha1(elem->sha1); |
8f67f8ae | 689 | int abbrev = DIFF_OPT_TST(opt, FULL_INDEX) ? 40 : DEFAULT_ABBREV; |
f23fc773 | 690 | mmfile_t result_file; |
af3feefa | 691 | |
ee1e5412 | 692 | context = opt->context; |
af3feefa | 693 | /* Read the result of merge first */ |
f23fc773 JH |
694 | if (!working_tree_file) |
695 | result = grab_blob(elem->sha1, &result_size); | |
ea726d02 | 696 | else { |
9843a1f6 | 697 | /* Used by diff-tree to read from the working tree */ |
ea726d02 | 698 | struct stat st; |
4fc970c4 JH |
699 | int fd = -1; |
700 | ||
701 | if (lstat(elem->path, &st) < 0) | |
702 | goto deleted_file; | |
703 | ||
704 | if (S_ISLNK(st.st_mode)) { | |
dc49cd76 | 705 | size_t len = xsize_t(st.st_size); |
4fc970c4 JH |
706 | result_size = len; |
707 | result = xmalloc(len + 1); | |
708 | if (result_size != readlink(elem->path, result, len)) { | |
709 | error("readlink(%s): %s", elem->path, | |
710 | strerror(errno)); | |
711 | return; | |
712 | } | |
713 | result[len] = 0; | |
714 | elem->mode = canon_mode(st.st_mode); | |
715 | } | |
716 | else if (0 <= (fd = open(elem->path, O_RDONLY)) && | |
717 | !fstat(fd, &st)) { | |
dc49cd76 | 718 | size_t len = xsize_t(st.st_size); |
c697ad14 | 719 | ssize_t done; |
a249a9b5 | 720 | int is_file, i; |
ea726d02 | 721 | |
1b0c7174 | 722 | elem->mode = canon_mode(st.st_mode); |
a249a9b5 JS |
723 | /* if symlinks don't work, assume symlink if all parents |
724 | * are symlinks | |
725 | */ | |
726 | is_file = has_symlinks; | |
727 | for (i = 0; !is_file && i < num_parent; i++) | |
728 | is_file = !S_ISLNK(elem->parent[i].mode); | |
729 | if (!is_file) | |
730 | elem->mode = canon_mode(S_IFLNK); | |
731 | ||
f23fc773 | 732 | result_size = len; |
ea726d02 | 733 | result = xmalloc(len + 1); |
c697ad14 HO |
734 | |
735 | done = read_in_full(fd, result, len); | |
736 | if (done < 0) | |
737 | die("read error '%s'", elem->path); | |
738 | else if (done < len) | |
739 | die("early EOF '%s'", elem->path); | |
740 | ||
ea726d02 | 741 | result[len] = 0; |
5e568f9e AG |
742 | |
743 | /* If not a fake symlink, apply filters, e.g. autocrlf */ | |
744 | if (is_file) { | |
745 | struct strbuf buf; | |
746 | ||
747 | strbuf_init(&buf, 0); | |
748 | if (convert_to_git(elem->path, result, len, &buf, safe_crlf)) { | |
749 | free(result); | |
750 | result = strbuf_detach(&buf, &len); | |
751 | result_size = len; | |
752 | } | |
753 | } | |
ea726d02 JH |
754 | } |
755 | else { | |
4fc970c4 | 756 | deleted_file: |
f23fc773 | 757 | result_size = 0; |
713a11fc | 758 | elem->mode = 0; |
28f75818 | 759 | result = xcalloc(1, 1); |
ea726d02 | 760 | } |
4fc970c4 | 761 | |
ea726d02 JH |
762 | if (0 <= fd) |
763 | close(fd); | |
764 | } | |
af3feefa | 765 | |
2386c297 | 766 | for (cnt = 0, cp = result; cp < result + result_size; cp++) { |
af3feefa JH |
767 | if (*cp == '\n') |
768 | cnt++; | |
769 | } | |
f23fc773 | 770 | if (result_size && result[result_size-1] != '\n') |
af3feefa JH |
771 | cnt++; /* incomplete line */ |
772 | ||
8a470ebf | 773 | sline = xcalloc(cnt+2, sizeof(*sline)); |
af3feefa | 774 | sline[0].bol = result; |
8a470ebf | 775 | for (lno = 0; lno <= cnt + 1; lno++) { |
4462731e JH |
776 | sline[lno].lost_tail = &sline[lno].lost_head; |
777 | sline[lno].flag = 0; | |
778 | } | |
2386c297 | 779 | for (lno = 0, cp = result; cp < result + result_size; cp++) { |
af3feefa JH |
780 | if (*cp == '\n') { |
781 | sline[lno].len = cp - sline[lno].bol; | |
af3feefa JH |
782 | lno++; |
783 | if (lno < cnt) | |
784 | sline[lno].bol = cp + 1; | |
785 | } | |
786 | } | |
f23fc773 JH |
787 | if (result_size && result[result_size-1] != '\n') |
788 | sline[cnt-1].len = result_size - (sline[cnt-1].bol - result); | |
789 | ||
790 | result_file.ptr = result; | |
791 | result_file.size = result_size; | |
af3feefa | 792 | |
8a470ebf JH |
793 | /* Even p_lno[cnt+1] is valid -- that is for the end line number |
794 | * for deletion hunk at the end. | |
795 | */ | |
796 | sline[0].p_lno = xcalloc((cnt+2) * num_parent, sizeof(unsigned long)); | |
797 | for (lno = 0; lno <= cnt; lno++) | |
f16706cc JH |
798 | sline[lno+1].p_lno = sline[lno].p_lno + num_parent; |
799 | ||
3c39e9bd JH |
800 | for (i = 0; i < num_parent; i++) { |
801 | int j; | |
802 | for (j = 0; j < i; j++) { | |
a89fccd2 DR |
803 | if (!hashcmp(elem->parent[i].sha1, |
804 | elem->parent[j].sha1)) { | |
3c39e9bd JH |
805 | reuse_combine_diff(sline, cnt, i, j); |
806 | break; | |
807 | } | |
808 | } | |
809 | if (i <= j) | |
f23fc773 | 810 | combine_diff(elem->parent[i].sha1, &result_file, sline, |
f16706cc | 811 | cnt, i, num_parent); |
2454c962 JH |
812 | if (elem->parent[i].mode != elem->mode) |
813 | mode_differs = 1; | |
3c39e9bd | 814 | } |
af3feefa | 815 | |
8828cdcb | 816 | show_hunks = make_hunks(sline, cnt, num_parent, dense); |
af3feefa | 817 | |
713a11fc | 818 | if (show_hunks || mode_differs || working_tree_file) { |
9843a1f6 | 819 | const char *abb; |
8f67f8ae | 820 | int use_color = DIFF_OPT_TST(opt, COLOR_DIFF); |
567a03d1 JH |
821 | const char *c_meta = diff_get_color(use_color, DIFF_METAINFO); |
822 | const char *c_reset = diff_get_color(use_color, DIFF_RESET); | |
d5f6a01a JH |
823 | int added = 0; |
824 | int deleted = 0; | |
9843a1f6 | 825 | |
44152787 | 826 | if (rev->loginfo && !rev->no_commit_id) |
02865655 | 827 | show_log(rev); |
567a03d1 | 828 | dump_quoted_path(dense ? "diff --cc " : "diff --combined ", |
462a15bc | 829 | "", elem->path, c_meta, c_reset); |
567a03d1 | 830 | printf("%sindex ", c_meta); |
823bcd6e | 831 | for (i = 0; i < num_parent; i++) { |
297a1aad | 832 | abb = find_unique_abbrev(elem->parent[i].sha1, |
e70c6b35 | 833 | abbrev); |
9843a1f6 | 834 | printf("%s%s", i ? "," : "", abb); |
823bcd6e | 835 | } |
e70c6b35 | 836 | abb = find_unique_abbrev(elem->sha1, abbrev); |
567a03d1 | 837 | printf("..%s%s\n", abb, c_reset); |
2454c962 JH |
838 | |
839 | if (mode_differs) { | |
d5f6a01a JH |
840 | deleted = !elem->mode; |
841 | ||
842 | /* We say it was added if nobody had it */ | |
843 | added = !deleted; | |
d416df88 JH |
844 | for (i = 0; added && i < num_parent; i++) |
845 | if (elem->parent[i].status != | |
846 | DIFF_STATUS_ADDED) | |
847 | added = 0; | |
848 | if (added) | |
567a03d1 JH |
849 | printf("%snew file mode %06o", |
850 | c_meta, elem->mode); | |
d416df88 | 851 | else { |
d5f6a01a | 852 | if (deleted) |
567a03d1 | 853 | printf("%sdeleted file ", c_meta); |
d416df88 JH |
854 | printf("mode "); |
855 | for (i = 0; i < num_parent; i++) { | |
856 | printf("%s%06o", i ? "," : "", | |
857 | elem->parent[i].mode); | |
858 | } | |
859 | if (elem->mode) | |
860 | printf("..%06o", elem->mode); | |
2454c962 | 861 | } |
567a03d1 | 862 | printf("%s\n", c_reset); |
2454c962 | 863 | } |
d5f6a01a | 864 | if (added) |
462a15bc JH |
865 | dump_quoted_path("--- ", "", "/dev/null", |
866 | c_meta, c_reset); | |
d5f6a01a | 867 | else |
462a15bc JH |
868 | dump_quoted_path("--- ", opt->a_prefix, elem->path, |
869 | c_meta, c_reset); | |
d5f6a01a | 870 | if (deleted) |
462a15bc JH |
871 | dump_quoted_path("+++ ", "", "/dev/null", |
872 | c_meta, c_reset); | |
d5f6a01a | 873 | else |
462a15bc JH |
874 | dump_quoted_path("+++ ", opt->b_prefix, elem->path, |
875 | c_meta, c_reset); | |
876 | dump_sline(sline, cnt, num_parent, | |
877 | DIFF_OPT_TST(opt, COLOR_DIFF)); | |
8828cdcb | 878 | } |
af3feefa JH |
879 | free(result); |
880 | ||
2386c297 JH |
881 | for (lno = 0; lno < cnt; lno++) { |
882 | if (sline[lno].lost_head) { | |
883 | struct lline *ll = sline[lno].lost_head; | |
af3feefa JH |
884 | while (ll) { |
885 | struct lline *tmp = ll; | |
886 | ll = ll->next; | |
887 | free(tmp); | |
888 | } | |
889 | } | |
890 | } | |
46dc9412 | 891 | free(sline[0].p_lno); |
af3feefa JH |
892 | free(sline); |
893 | } | |
894 | ||
ee638024 LT |
895 | #define COLONS "::::::::::::::::::::::::::::::::" |
896 | ||
91539833 | 897 | static void show_raw_diff(struct combine_diff_path *p, int num_parent, struct rev_info *rev) |
ee638024 | 898 | { |
91539833 | 899 | struct diff_options *opt = &rev->diffopt; |
310f8b5b | 900 | int i, offset; |
ee638024 LT |
901 | const char *prefix; |
902 | int line_termination, inter_name_termination; | |
903 | ||
904 | line_termination = opt->line_termination; | |
905 | inter_name_termination = '\t'; | |
906 | if (!line_termination) | |
907 | inter_name_termination = 0; | |
908 | ||
44152787 | 909 | if (rev->loginfo && !rev->no_commit_id) |
02865655 | 910 | show_log(rev); |
ee638024 | 911 | |
c6744349 | 912 | if (opt->output_format & DIFF_FORMAT_RAW) { |
0a798076 JH |
913 | offset = strlen(COLONS) - num_parent; |
914 | if (offset < 0) | |
915 | offset = 0; | |
916 | prefix = COLONS + offset; | |
917 | ||
918 | /* Show the modes */ | |
919 | for (i = 0; i < num_parent; i++) { | |
920 | printf("%s%06o", prefix, p->parent[i].mode); | |
921 | prefix = " "; | |
922 | } | |
923 | printf("%s%06o", prefix, p->mode); | |
924 | ||
925 | /* Show sha1's */ | |
926 | for (i = 0; i < num_parent; i++) | |
927 | printf(" %s", diff_unique_abbrev(p->parent[i].sha1, | |
928 | opt->abbrev)); | |
929 | printf(" %s ", diff_unique_abbrev(p->sha1, opt->abbrev)); | |
930 | } | |
931 | ||
c6744349 | 932 | if (opt->output_format & (DIFF_FORMAT_RAW | DIFF_FORMAT_NAME_STATUS)) { |
d416df88 JH |
933 | for (i = 0; i < num_parent; i++) |
934 | putchar(p->parent[i].status); | |
935 | putchar(inter_name_termination); | |
936 | } | |
0a798076 | 937 | |
663af342 | 938 | write_name_quoted(p->path, stdout, line_termination); |
0a798076 JH |
939 | } |
940 | ||
91539833 | 941 | void show_combined_diff(struct combine_diff_path *p, |
0a798076 JH |
942 | int num_parent, |
943 | int dense, | |
91539833 | 944 | struct rev_info *rev) |
0a798076 | 945 | { |
91539833 | 946 | struct diff_options *opt = &rev->diffopt; |
0a798076 | 947 | if (!p->len) |
91539833 | 948 | return; |
c6744349 TH |
949 | if (opt->output_format & (DIFF_FORMAT_RAW | |
950 | DIFF_FORMAT_NAME | | |
89b0c4b5 | 951 | DIFF_FORMAT_NAME_STATUS)) |
91539833 | 952 | show_raw_diff(p, num_parent, rev); |
89b0c4b5 | 953 | else if (opt->output_format & DIFF_FORMAT_PATCH) |
91539833 | 954 | show_patch_diff(p, num_parent, dense, rev); |
ee638024 LT |
955 | } |
956 | ||
0fe7c1de JH |
957 | void diff_tree_combined(const unsigned char *sha1, |
958 | const unsigned char parent[][20], | |
959 | int num_parent, | |
960 | int dense, | |
961 | struct rev_info *rev) | |
af3feefa | 962 | { |
91539833 | 963 | struct diff_options *opt = &rev->diffopt; |
af3feefa | 964 | struct diff_options diffopts; |
ea726d02 | 965 | struct combine_diff_path *p, *paths = NULL; |
3969cf7d | 966 | int i, num_paths, needsep, show_log_first; |
af3feefa | 967 | |
5b236832 | 968 | diffopts = *opt; |
3969cf7d | 969 | diffopts.output_format = DIFF_FORMAT_NO_OUTPUT; |
8f67f8ae PH |
970 | DIFF_OPT_SET(&diffopts, RECURSIVE); |
971 | DIFF_OPT_CLR(&diffopts, ALLOW_EXTERNAL); | |
af3feefa | 972 | |
44152787 | 973 | show_log_first = !!rev->loginfo && !rev->no_commit_id; |
3969cf7d | 974 | needsep = 0; |
af3feefa | 975 | /* find set of paths that everybody touches */ |
0fe7c1de | 976 | for (i = 0; i < num_parent; i++) { |
965f803c JH |
977 | /* show stat against the first parent even |
978 | * when doing combined diff. | |
979 | */ | |
74e2abe5 JH |
980 | int stat_opt = (opt->output_format & |
981 | (DIFF_FORMAT_NUMSTAT|DIFF_FORMAT_DIFFSTAT)); | |
982 | if (i == 0 && stat_opt) | |
983 | diffopts.output_format = stat_opt; | |
965f803c JH |
984 | else |
985 | diffopts.output_format = DIFF_FORMAT_NO_OUTPUT; | |
0fe7c1de | 986 | diff_tree_sha1(parent[i], sha1, "", &diffopts); |
5b236832 | 987 | diffcore_std(&diffopts); |
af3feefa | 988 | paths = intersect_paths(paths, i, num_parent); |
eab144ac | 989 | |
3969cf7d | 990 | if (show_log_first && i == 0) { |
02865655 | 991 | show_log(rev); |
3969cf7d JH |
992 | if (rev->verbose_header && opt->output_format) |
993 | putchar(opt->line_termination); | |
994 | } | |
af3feefa JH |
995 | diff_flush(&diffopts); |
996 | } | |
997 | ||
998 | /* find out surviving paths */ | |
999 | for (num_paths = 0, p = paths; p; p = p->next) { | |
1000 | if (p->len) | |
1001 | num_paths++; | |
1002 | } | |
e3c3a550 | 1003 | if (num_paths) { |
c6744349 TH |
1004 | if (opt->output_format & (DIFF_FORMAT_RAW | |
1005 | DIFF_FORMAT_NAME | | |
1006 | DIFF_FORMAT_NAME_STATUS)) { | |
86ff1d20 | 1007 | for (p = paths; p; p = p->next) { |
c6744349 TH |
1008 | if (p->len) |
1009 | show_raw_diff(p, num_parent, rev); | |
86ff1d20 | 1010 | } |
3969cf7d | 1011 | needsep = 1; |
86ff1d20 | 1012 | } |
74e2abe5 JH |
1013 | else if (opt->output_format & |
1014 | (DIFF_FORMAT_NUMSTAT|DIFF_FORMAT_DIFFSTAT)) | |
3969cf7d | 1015 | needsep = 1; |
c6744349 | 1016 | if (opt->output_format & DIFF_FORMAT_PATCH) { |
3969cf7d JH |
1017 | if (needsep) |
1018 | putchar(opt->line_termination); | |
c6744349 TH |
1019 | for (p = paths; p; p = p->next) { |
1020 | if (p->len) | |
1021 | show_patch_diff(p, num_parent, dense, | |
1022 | rev); | |
1023 | } | |
af3feefa JH |
1024 | } |
1025 | } | |
1026 | ||
1027 | /* Clean things up */ | |
1028 | while (paths) { | |
ea726d02 | 1029 | struct combine_diff_path *tmp = paths; |
af3feefa JH |
1030 | paths = paths->next; |
1031 | free(tmp); | |
1032 | } | |
af3feefa | 1033 | } |
0fe7c1de JH |
1034 | |
1035 | void diff_tree_combined_merge(const unsigned char *sha1, | |
1036 | int dense, struct rev_info *rev) | |
1037 | { | |
1038 | int num_parent; | |
1039 | const unsigned char (*parent)[20]; | |
1040 | struct commit *commit = lookup_commit(sha1); | |
1041 | struct commit_list *parents; | |
1042 | ||
1043 | /* count parents */ | |
1044 | for (parents = commit->parents, num_parent = 0; | |
1045 | parents; | |
1046 | parents = parents->next, num_parent++) | |
1047 | ; /* nothing */ | |
1048 | ||
1049 | parent = xmalloc(num_parent * sizeof(*parent)); | |
1050 | for (parents = commit->parents, num_parent = 0; | |
1051 | parents; | |
1052 | parents = parents->next, num_parent++) | |
e702496e SP |
1053 | hashcpy((unsigned char*)(parent + num_parent), |
1054 | parents->item->object.sha1); | |
0fe7c1de JH |
1055 | diff_tree_combined(sha1, parent, num_parent, dense, rev); |
1056 | } |