Merge branch 'maint'
[git] / combine-diff.c
1 #include "cache.h"
2 #include "commit.h"
3 #include "blob.h"
4 #include "diff.h"
5 #include "diffcore.h"
6 #include "quote.h"
7 #include "xdiff-interface.h"
8 #include "log-tree.h"
9
10 static struct combine_diff_path *intersect_paths(struct combine_diff_path *curr, int n, int num_parent)
11 {
12         struct diff_queue_struct *q = &diff_queued_diff;
13         struct combine_diff_path *p;
14         int i;
15
16         if (!n) {
17                 struct combine_diff_path *list = NULL, **tail = &list;
18                 for (i = 0; i < q->nr; i++) {
19                         int len;
20                         const char *path;
21                         if (diff_unmodified_pair(q->queue[i]))
22                                 continue;
23                         path = q->queue[i]->two->path;
24                         len = strlen(path);
25                         p = xmalloc(combine_diff_path_size(num_parent, len));
26                         p->path = (char*) &(p->parent[num_parent]);
27                         memcpy(p->path, path, len);
28                         p->path[len] = 0;
29                         p->len = len;
30                         p->next = NULL;
31                         memset(p->parent, 0,
32                                sizeof(p->parent[0]) * num_parent);
33
34                         hashcpy(p->sha1, q->queue[i]->two->sha1);
35                         p->mode = q->queue[i]->two->mode;
36                         hashcpy(p->parent[n].sha1, q->queue[i]->one->sha1);
37                         p->parent[n].mode = q->queue[i]->one->mode;
38                         p->parent[n].status = q->queue[i]->status;
39                         *tail = p;
40                         tail = &p->next;
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
53                         if (diff_unmodified_pair(q->queue[i]))
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;
59                                 hashcpy(p->parent[n].sha1, q->queue[i]->one->sha1);
60                                 p->parent[n].mode = q->queue[i]->one->mode;
61                                 p->parent[n].status = q->queue[i]->status;
62                                 break;
63                         }
64                 }
65                 if (!found)
66                         p->len = 0;
67         }
68         return curr;
69 }
70
71 /* Lines lost from parent */
72 struct lline {
73         struct lline *next;
74         int len;
75         unsigned long parent_map;
76         char line[FLEX_ARRAY];
77 };
78
79 /* Lines surviving in the merge result */
80 struct sline {
81         struct lline *lost_head, **lost_tail;
82         char *bol;
83         int len;
84         /* bit 0 up to (N-1) are on if the parent has this line (i.e.
85          * we did not change it).
86          * bit N is used for "interesting" lines, including context.
87          */
88         unsigned long flag;
89         unsigned long *p_lno;
90 };
91
92 static char *grab_blob(const unsigned char *sha1, unsigned long *size)
93 {
94         char *blob;
95         char type[20];
96         if (is_null_sha1(sha1)) {
97                 /* deleted blob */
98                 *size = 0;
99                 return xcalloc(1, 1);
100         }
101         blob = read_sha1_file(sha1, type, size);
102         if (strcmp(type, blob_type))
103                 die("object '%s' is not a blob!", sha1_to_hex(sha1));
104         return blob;
105 }
106
107 static void append_lost(struct sline *sline, int n, const char *line, int len)
108 {
109         struct lline *lline;
110         unsigned long this_mask = (1UL<<n);
111         if (line[len-1] == '\n')
112                 len--;
113
114         /* Check to see if we can squash things */
115         if (sline->lost_head) {
116                 struct lline *last_one = NULL;
117                 /* We cannot squash it with earlier one */
118                 for (lline = sline->lost_head;
119                      lline;
120                      lline = lline->next)
121                         if (lline->parent_map & this_mask)
122                                 last_one = lline;
123                 lline = last_one ? last_one->next : sline->lost_head;
124                 while (lline) {
125                         if (lline->len == len &&
126                             !memcmp(lline->line, line, len)) {
127                                 lline->parent_map |= this_mask;
128                                 return;
129                         }
130                         lline = lline->next;
131                 }
132         }
133
134         lline = xmalloc(sizeof(*lline) + len + 1);
135         lline->len = len;
136         lline->next = NULL;
137         lline->parent_map = this_mask;
138         memcpy(lline->line, line, len);
139         lline->line[len] = 0;
140         *sline->lost_tail = lline;
141         sline->lost_tail = &lline->next;
142 }
143
144 struct combine_diff_state {
145         struct xdiff_emit_state xm;
146
147         unsigned int lno;
148         int ob, on, nb, nn;
149         unsigned long nmask;
150         int num_parent;
151         int n;
152         struct sline *sline;
153         struct sline *lost_bucket;
154 };
155
156 static void consume_line(void *state_, char *line, unsigned long len)
157 {
158         struct combine_diff_state *state = state_;
159         if (5 < len && !memcmp("@@ -", line, 4)) {
160                 if (parse_hunk_header(line, len,
161                                       &state->ob, &state->on,
162                                       &state->nb, &state->nn))
163                         return;
164                 state->lno = state->nb;
165                 if (!state->nb)
166                         /* @@ -1,2 +0,0 @@ to remove the
167                          * first two lines...
168                          */
169                         state->nb = 1;
170                 if (state->nn == 0)
171                         /* @@ -X,Y +N,0 @@ removed Y lines
172                          * that would have come *after* line N
173                          * in the result.  Our lost buckets hang
174                          * to the line after the removed lines,
175                          */
176                         state->lost_bucket = &state->sline[state->nb];
177                 else
178                         state->lost_bucket = &state->sline[state->nb-1];
179                 if (!state->sline[state->nb-1].p_lno)
180                         state->sline[state->nb-1].p_lno =
181                                 xcalloc(state->num_parent,
182                                         sizeof(unsigned long));
183                 state->sline[state->nb-1].p_lno[state->n] = state->ob;
184                 return;
185         }
186         if (!state->lost_bucket)
187                 return; /* not in any hunk yet */
188         switch (line[0]) {
189         case '-':
190                 append_lost(state->lost_bucket, state->n, line+1, len-1);
191                 break;
192         case '+':
193                 state->sline[state->lno-1].flag |= state->nmask;
194                 state->lno++;
195                 break;
196         }
197 }
198
199 static void combine_diff(const unsigned char *parent, mmfile_t *result_file,
200                          struct sline *sline, unsigned int cnt, int n,
201                          int num_parent)
202 {
203         unsigned int p_lno, lno;
204         unsigned long nmask = (1UL << n);
205         xpparam_t xpp;
206         xdemitconf_t xecfg;
207         mmfile_t parent_file;
208         xdemitcb_t ecb;
209         struct combine_diff_state state;
210         unsigned long sz;
211
212         if (!cnt)
213                 return; /* result deleted */
214
215         parent_file.ptr = grab_blob(parent, &sz);
216         parent_file.size = sz;
217         xpp.flags = XDF_NEED_MINIMAL;
218         xecfg.ctxlen = 0;
219         xecfg.flags = 0;
220         ecb.outf = xdiff_outf;
221         ecb.priv = &state;
222         memset(&state, 0, sizeof(state));
223         state.xm.consume = consume_line;
224         state.nmask = nmask;
225         state.sline = sline;
226         state.lno = 1;
227         state.num_parent = num_parent;
228         state.n = n;
229
230         xdl_diff(&parent_file, result_file, &xpp, &xecfg, &ecb);
231         free(parent_file.ptr);
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          */
240         for (lno = 0,  p_lno = 1; lno <= cnt; lno++) {
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                 }
251                 if (lno < cnt && !(sline[lno].flag & nmask))
252                         p_lno++; /* no '+' means parent had it */
253         }
254         sline[lno].p_lno[n] = p_lno; /* trailer */
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 {
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);
266 }
267
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 {
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.
279          */
280         if ((hunk_begin + 1 <= i) && !(sline[i-1].flag & all_mask))
281                 i--;
282         return i;
283 }
284
285 static unsigned long find_next(struct sline *sline,
286                                unsigned long mark,
287                                unsigned long i,
288                                unsigned long cnt,
289                                int look_for_uninteresting)
290 {
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          */
298         while (i <= cnt)
299                 if (look_for_uninteresting
300                     ? !(sline[i].flag & mark)
301                     : (sline[i].flag & mark))
302                         return i;
303                 else
304                         i++;
305         return i;
306 }
307
308 static int give_context(struct sline *sline, unsigned long cnt, int num_parent)
309 {
310         unsigned long all_mask = (1UL<<num_parent) - 1;
311         unsigned long mark = (1UL<<num_parent);
312         unsigned long i;
313
314         /* Two groups of interesting lines may have a short gap of
315          * uninteresting lines.  Connect such groups to give them a
316          * bit of context.
317          *
318          * We first start from what the interesting() function says,
319          * and mark them with "mark", and paint context lines with the
320          * mark.  So interesting() would still say false for such context
321          * lines but they are treated as "interesting" in the end.
322          */
323         i = find_next(sline, mark, 0, cnt, 0);
324         if (cnt < i)
325                 return 0;
326
327         while (i <= cnt) {
328                 unsigned long j = (context < i) ? (i - context) : 0;
329                 unsigned long k;
330
331                 /* Paint a few lines before the first interesting line. */
332                 while (j < i)
333                         sline[j++].flag |= mark;
334
335         again:
336                 /* we know up to i is to be included.  where does the
337                  * next uninteresting one start?
338                  */
339                 j = find_next(sline, mark, i, cnt, 1);
340                 if (cnt < j)
341                         break; /* the rest are all interesting */
342
343                 /* lookahead context lines */
344                 k = find_next(sline, mark, j, cnt, 0);
345                 j = adjust_hunk_tail(sline, all_mask, i, j);
346
347                 if (k < j + context) {
348                         /* k is interesting and [j,k) are not, but
349                          * paint them interesting because the gap is small.
350                          */
351                         while (j < k)
352                                 sline[j++].flag |= mark;
353                         i = k;
354                         goto again;
355                 }
356
357                 /* j is the first uninteresting line and there is
358                  * no overlap beyond it within context lines.  Paint
359                  * the trailing edge a bit.
360                  */
361                 i = k;
362                 k = (j + context < cnt+1) ? j + context : cnt+1;
363                 while (j < k)
364                         sline[j++].flag |= mark;
365         }
366         return 1;
367 }
368
369 static int make_hunks(struct sline *sline, unsigned long cnt,
370                        int num_parent, int dense)
371 {
372         unsigned long all_mask = (1UL<<num_parent) - 1;
373         unsigned long mark = (1UL<<num_parent);
374         unsigned long i;
375         int has_interesting = 0;
376
377         for (i = 0; i <= cnt; i++) {
378                 if (interesting(&sline[i], all_mask))
379                         sline[i].flag |= mark;
380                 else
381                         sline[i].flag &= ~mark;
382         }
383         if (!dense)
384                 return give_context(sline, cnt, num_parent);
385
386         /* Look at each hunk, and if we have changes from only one
387          * parent, or the changes are the same from all but one
388          * parent, mark that uninteresting.
389          */
390         i = 0;
391         while (i <= cnt) {
392                 unsigned long j, hunk_begin, hunk_end;
393                 unsigned long same_diff;
394                 while (i <= cnt && !(sline[i].flag & mark))
395                         i++;
396                 if (cnt < i)
397                         break; /* No more interesting hunks */
398                 hunk_begin = i;
399                 for (j = i + 1; j <= cnt; j++) {
400                         if (!(sline[j].flag & mark)) {
401                                 /* Look beyond the end to see if there
402                                  * is an interesting line after this
403                                  * hunk within context span.
404                                  */
405                                 unsigned long la; /* lookahead */
406                                 int contin = 0;
407                                 la = adjust_hunk_tail(sline, all_mask,
408                                                      hunk_begin, j);
409                                 la = (la + context < cnt + 1) ?
410                                         (la + context) : cnt + 1;
411                                 while (j <= --la) {
412                                         if (sline[la].flag & mark) {
413                                                 contin = 1;
414                                                 break;
415                                         }
416                                 }
417                                 if (!contin)
418                                         break;
419                                 j = la;
420                         }
421                 }
422                 hunk_end = j;
423
424                 /* [i..hunk_end) are interesting.  Now is it really
425                  * interesting?  We check if there are only two versions
426                  * and the result matches one of them.  That is, we look
427                  * at:
428                  *   (+) line, which records lines added to which parents;
429                  *       this line appears in the result.
430                  *   (-) line, which records from what parents the line
431                  *       was removed; this line does not appear in the result.
432                  * then check the set of parents the result has difference
433                  * from, from all lines.  If there are lines that has
434                  * different set of parents that the result has differences
435                  * from, that means we have more than two versions.
436                  *
437                  * Even when we have only two versions, if the result does
438                  * not match any of the parents, the it should be considered
439                  * interesting.  In such a case, we would have all '+' line.
440                  * After passing the above "two versions" test, that would
441                  * appear as "the same set of parents" to be "all parents".
442                  */
443                 same_diff = 0;
444                 has_interesting = 0;
445                 for (j = i; j < hunk_end && !has_interesting; j++) {
446                         unsigned long this_diff = sline[j].flag & all_mask;
447                         struct lline *ll = sline[j].lost_head;
448                         if (this_diff) {
449                                 /* This has some changes.  Is it the
450                                  * same as others?
451                                  */
452                                 if (!same_diff)
453                                         same_diff = this_diff;
454                                 else if (same_diff != this_diff) {
455                                         has_interesting = 1;
456                                         break;
457                                 }
458                         }
459                         while (ll && !has_interesting) {
460                                 /* Lost this line from these parents;
461                                  * who are they?  Are they the same?
462                                  */
463                                 this_diff = ll->parent_map;
464                                 if (!same_diff)
465                                         same_diff = this_diff;
466                                 else if (same_diff != this_diff) {
467                                         has_interesting = 1;
468                                 }
469                                 ll = ll->next;
470                         }
471                 }
472
473                 if (!has_interesting && same_diff != all_mask) {
474                         /* This hunk is not that interesting after all */
475                         for (j = hunk_begin; j < hunk_end; j++)
476                                 sline[j].flag &= ~mark;
477                 }
478                 i = hunk_end;
479         }
480
481         has_interesting = give_context(sline, cnt, num_parent);
482         return has_interesting;
483 }
484
485 static void show_parent_lno(struct sline *sline, unsigned long l0, unsigned long l1, int n)
486 {
487         l0 = sline[l0].p_lno[n];
488         l1 = sline[l1].p_lno[n];
489         printf(" -%lu,%lu", l0, l1-l0);
490 }
491
492 static void dump_sline(struct sline *sline, unsigned long cnt, int num_parent,
493                        int use_color)
494 {
495         unsigned long mark = (1UL<<num_parent);
496         int i;
497         unsigned long lno = 0;
498         const char *c_frag = diff_get_color(use_color, DIFF_FRAGINFO);
499         const char *c_new = diff_get_color(use_color, DIFF_FILE_NEW);
500         const char *c_old = diff_get_color(use_color, DIFF_FILE_OLD);
501         const char *c_plain = diff_get_color(use_color, DIFF_PLAIN);
502         const char *c_reset = diff_get_color(use_color, DIFF_RESET);
503
504         if (!cnt)
505                 return; /* result deleted */
506
507         while (1) {
508                 struct sline *sl = &sline[lno];
509                 unsigned long hunk_end;
510                 unsigned long rlines;
511                 while (lno <= cnt && !(sline[lno].flag & mark))
512                         lno++;
513                 if (cnt < lno)
514                         break;
515                 else {
516                         for (hunk_end = lno + 1; hunk_end <= cnt; hunk_end++)
517                                 if (!(sline[hunk_end].flag & mark))
518                                         break;
519                 }
520                 rlines = hunk_end - lno;
521                 if (cnt < hunk_end)
522                         rlines--; /* pointing at the last delete hunk */
523                 fputs(c_frag, stdout);
524                 for (i = 0; i <= num_parent; i++) putchar(combine_marker);
525                 for (i = 0; i < num_parent; i++)
526                         show_parent_lno(sline, lno, hunk_end, i);
527                 printf(" +%lu,%lu ", lno+1, rlines);
528                 for (i = 0; i <= num_parent; i++) putchar(combine_marker);
529                 printf("%s\n", c_reset);
530                 while (lno < hunk_end) {
531                         struct lline *ll;
532                         int j;
533                         unsigned long p_mask;
534                         sl = &sline[lno++];
535                         ll = sl->lost_head;
536                         while (ll) {
537                                 fputs(c_old, stdout);
538                                 for (j = 0; j < num_parent; j++) {
539                                         if (ll->parent_map & (1UL<<j))
540                                                 putchar('-');
541                                         else
542                                                 putchar(' ');
543                                 }
544                                 printf("%s%s\n", ll->line, c_reset);
545                                 ll = ll->next;
546                         }
547                         if (cnt < lno)
548                                 break;
549                         p_mask = 1;
550                         if (!(sl->flag & (mark-1)))
551                                 fputs(c_plain, stdout);
552                         else
553                                 fputs(c_new, stdout);
554                         for (j = 0; j < num_parent; j++) {
555                                 if (p_mask & sl->flag)
556                                         putchar('+');
557                                 else
558                                         putchar(' ');
559                                 p_mask <<= 1;
560                         }
561                         printf("%.*s%s\n", sl->len, sl->bol, c_reset);
562                 }
563         }
564 }
565
566 static void reuse_combine_diff(struct sline *sline, unsigned long cnt,
567                                int i, int j)
568 {
569         /* We have already examined parent j and we know parent i
570          * and parent j are the same, so reuse the combined result
571          * of parent j for parent i.
572          */
573         unsigned long lno, imask, jmask;
574         imask = (1UL<<i);
575         jmask = (1UL<<j);
576
577         for (lno = 0; lno <= cnt; lno++) {
578                 struct lline *ll = sline->lost_head;
579                 sline->p_lno[i] = sline->p_lno[j];
580                 while (ll) {
581                         if (ll->parent_map & jmask)
582                                 ll->parent_map |= imask;
583                         ll = ll->next;
584                 }
585                 if (sline->flag & jmask)
586                         sline->flag |= imask;
587                 sline++;
588         }
589         /* the overall size of the file (sline[cnt]) */
590         sline->p_lno[i] = sline->p_lno[j];
591 }
592
593 static void dump_quoted_path(const char *prefix, const char *path,
594                              const char *c_meta, const char *c_reset)
595 {
596         printf("%s%s", c_meta, prefix);
597         if (quote_c_style(path, NULL, NULL, 0))
598                 quote_c_style(path, NULL, stdout, 0);
599         else
600                 printf("%s", path);
601         printf("%s\n", c_reset);
602 }
603
604 static void show_patch_diff(struct combine_diff_path *elem, int num_parent,
605                             int dense, struct rev_info *rev)
606 {
607         struct diff_options *opt = &rev->diffopt;
608         unsigned long result_size, cnt, lno;
609         char *result, *cp;
610         struct sline *sline; /* survived lines */
611         int mode_differs = 0;
612         int i, show_hunks;
613         int working_tree_file = is_null_sha1(elem->sha1);
614         int abbrev = opt->full_index ? 40 : DEFAULT_ABBREV;
615         mmfile_t result_file;
616
617         context = opt->context;
618         /* Read the result of merge first */
619         if (!working_tree_file)
620                 result = grab_blob(elem->sha1, &result_size);
621         else {
622                 /* Used by diff-tree to read from the working tree */
623                 struct stat st;
624                 int fd;
625                 if (0 <= (fd = open(elem->path, O_RDONLY)) &&
626                     !fstat(fd, &st)) {
627                         int len = st.st_size;
628                         int sz = 0;
629
630                         elem->mode = canon_mode(st.st_mode);
631                         result_size = len;
632                         result = xmalloc(len + 1);
633                         while (sz < len) {
634                                 int done = xread(fd, result+sz, len-sz);
635                                 if (done == 0)
636                                         break;
637                                 if (done < 0)
638                                         die("read error '%s'", elem->path);
639                                 sz += done;
640                         }
641                         result[len] = 0;
642                 }
643                 else {
644                         /* deleted file */
645                         result_size = 0;
646                         elem->mode = 0;
647                         result = xcalloc(1, 1);
648                 }
649                 if (0 <= fd)
650                         close(fd);
651         }
652
653         for (cnt = 0, cp = result; cp < result + result_size; cp++) {
654                 if (*cp == '\n')
655                         cnt++;
656         }
657         if (result_size && result[result_size-1] != '\n')
658                 cnt++; /* incomplete line */
659
660         sline = xcalloc(cnt+2, sizeof(*sline));
661         sline[0].bol = result;
662         for (lno = 0; lno <= cnt + 1; lno++) {
663                 sline[lno].lost_tail = &sline[lno].lost_head;
664                 sline[lno].flag = 0;
665         }
666         for (lno = 0, cp = result; cp < result + result_size; cp++) {
667                 if (*cp == '\n') {
668                         sline[lno].len = cp - sline[lno].bol;
669                         lno++;
670                         if (lno < cnt)
671                                 sline[lno].bol = cp + 1;
672                 }
673         }
674         if (result_size && result[result_size-1] != '\n')
675                 sline[cnt-1].len = result_size - (sline[cnt-1].bol - result);
676
677         result_file.ptr = result;
678         result_file.size = result_size;
679
680         /* Even p_lno[cnt+1] is valid -- that is for the end line number
681          * for deletion hunk at the end.
682          */
683         sline[0].p_lno = xcalloc((cnt+2) * num_parent, sizeof(unsigned long));
684         for (lno = 0; lno <= cnt; lno++)
685                 sline[lno+1].p_lno = sline[lno].p_lno + num_parent;
686
687         for (i = 0; i < num_parent; i++) {
688                 int j;
689                 for (j = 0; j < i; j++) {
690                         if (!hashcmp(elem->parent[i].sha1,
691                                      elem->parent[j].sha1)) {
692                                 reuse_combine_diff(sline, cnt, i, j);
693                                 break;
694                         }
695                 }
696                 if (i <= j)
697                         combine_diff(elem->parent[i].sha1, &result_file, sline,
698                                      cnt, i, num_parent);
699                 if (elem->parent[i].mode != elem->mode)
700                         mode_differs = 1;
701         }
702
703         show_hunks = make_hunks(sline, cnt, num_parent, dense);
704
705         if (show_hunks || mode_differs || working_tree_file) {
706                 const char *abb;
707                 int use_color = opt->color_diff;
708                 const char *c_meta = diff_get_color(use_color, DIFF_METAINFO);
709                 const char *c_reset = diff_get_color(use_color, DIFF_RESET);
710
711                 if (rev->loginfo)
712                         show_log(rev, opt->msg_sep);
713                 dump_quoted_path(dense ? "diff --cc " : "diff --combined ",
714                                  elem->path, c_meta, c_reset);
715                 printf("%sindex ", c_meta);
716                 for (i = 0; i < num_parent; i++) {
717                         abb = find_unique_abbrev(elem->parent[i].sha1,
718                                                  abbrev);
719                         printf("%s%s", i ? "," : "", abb);
720                 }
721                 abb = find_unique_abbrev(elem->sha1, abbrev);
722                 printf("..%s%s\n", abb, c_reset);
723
724                 if (mode_differs) {
725                         int added = !!elem->mode;
726                         for (i = 0; added && i < num_parent; i++)
727                                 if (elem->parent[i].status !=
728                                     DIFF_STATUS_ADDED)
729                                         added = 0;
730                         if (added)
731                                 printf("%snew file mode %06o",
732                                        c_meta, elem->mode);
733                         else {
734                                 if (!elem->mode)
735                                         printf("%sdeleted file ", c_meta);
736                                 printf("mode ");
737                                 for (i = 0; i < num_parent; i++) {
738                                         printf("%s%06o", i ? "," : "",
739                                                elem->parent[i].mode);
740                                 }
741                                 if (elem->mode)
742                                         printf("..%06o", elem->mode);
743                         }
744                         printf("%s\n", c_reset);
745                 }
746                 dump_quoted_path("--- a/", elem->path, c_meta, c_reset);
747                 dump_quoted_path("+++ b/", elem->path, c_meta, c_reset);
748                 dump_sline(sline, cnt, num_parent, opt->color_diff);
749         }
750         free(result);
751
752         for (lno = 0; lno < cnt; lno++) {
753                 if (sline[lno].lost_head) {
754                         struct lline *ll = sline[lno].lost_head;
755                         while (ll) {
756                                 struct lline *tmp = ll;
757                                 ll = ll->next;
758                                 free(tmp);
759                         }
760                 }
761         }
762         free(sline[0].p_lno);
763         free(sline);
764 }
765
766 #define COLONS "::::::::::::::::::::::::::::::::"
767
768 static void show_raw_diff(struct combine_diff_path *p, int num_parent, struct rev_info *rev)
769 {
770         struct diff_options *opt = &rev->diffopt;
771         int i, offset;
772         const char *prefix;
773         int line_termination, inter_name_termination;
774
775         line_termination = opt->line_termination;
776         inter_name_termination = '\t';
777         if (!line_termination)
778                 inter_name_termination = 0;
779
780         if (rev->loginfo)
781                 show_log(rev, opt->msg_sep);
782
783         if (opt->output_format & DIFF_FORMAT_RAW) {
784                 offset = strlen(COLONS) - num_parent;
785                 if (offset < 0)
786                         offset = 0;
787                 prefix = COLONS + offset;
788
789                 /* Show the modes */
790                 for (i = 0; i < num_parent; i++) {
791                         printf("%s%06o", prefix, p->parent[i].mode);
792                         prefix = " ";
793                 }
794                 printf("%s%06o", prefix, p->mode);
795
796                 /* Show sha1's */
797                 for (i = 0; i < num_parent; i++)
798                         printf(" %s", diff_unique_abbrev(p->parent[i].sha1,
799                                                          opt->abbrev));
800                 printf(" %s ", diff_unique_abbrev(p->sha1, opt->abbrev));
801         }
802
803         if (opt->output_format & (DIFF_FORMAT_RAW | DIFF_FORMAT_NAME_STATUS)) {
804                 for (i = 0; i < num_parent; i++)
805                         putchar(p->parent[i].status);
806                 putchar(inter_name_termination);
807         }
808
809         if (line_termination) {
810                 if (quote_c_style(p->path, NULL, NULL, 0))
811                         quote_c_style(p->path, NULL, stdout, 0);
812                 else
813                         printf("%s", p->path);
814                 putchar(line_termination);
815         }
816         else {
817                 printf("%s%c", p->path, line_termination);
818         }
819 }
820
821 void show_combined_diff(struct combine_diff_path *p,
822                        int num_parent,
823                        int dense,
824                        struct rev_info *rev)
825 {
826         struct diff_options *opt = &rev->diffopt;
827         if (!p->len)
828                 return;
829         if (opt->output_format & (DIFF_FORMAT_RAW |
830                                   DIFF_FORMAT_NAME |
831                                   DIFF_FORMAT_NAME_STATUS))
832                 show_raw_diff(p, num_parent, rev);
833         else if (opt->output_format & DIFF_FORMAT_PATCH)
834                 show_patch_diff(p, num_parent, dense, rev);
835 }
836
837 void diff_tree_combined(const unsigned char *sha1,
838                         const unsigned char parent[][20],
839                         int num_parent,
840                         int dense,
841                         struct rev_info *rev)
842 {
843         struct diff_options *opt = &rev->diffopt;
844         struct diff_options diffopts;
845         struct combine_diff_path *p, *paths = NULL;
846         int i, num_paths, needsep, show_log_first;
847
848         diffopts = *opt;
849         diffopts.output_format = DIFF_FORMAT_NO_OUTPUT;
850         diffopts.recursive = 1;
851
852         show_log_first = !!rev->loginfo;
853         needsep = 0;
854         /* find set of paths that everybody touches */
855         for (i = 0; i < num_parent; i++) {
856                 /* show stat against the first parent even
857                  * when doing combined diff.
858                  */
859                 int stat_opt = (opt->output_format &
860                                 (DIFF_FORMAT_NUMSTAT|DIFF_FORMAT_DIFFSTAT));
861                 if (i == 0 && stat_opt)
862                         diffopts.output_format = stat_opt;
863                 else
864                         diffopts.output_format = DIFF_FORMAT_NO_OUTPUT;
865                 diff_tree_sha1(parent[i], sha1, "", &diffopts);
866                 diffcore_std(&diffopts);
867                 paths = intersect_paths(paths, i, num_parent);
868
869                 if (show_log_first && i == 0) {
870                         show_log(rev, opt->msg_sep);
871                         if (rev->verbose_header && opt->output_format)
872                                 putchar(opt->line_termination);
873                 }
874                 diff_flush(&diffopts);
875         }
876
877         /* find out surviving paths */
878         for (num_paths = 0, p = paths; p; p = p->next) {
879                 if (p->len)
880                         num_paths++;
881         }
882         if (num_paths) {
883                 if (opt->output_format & (DIFF_FORMAT_RAW |
884                                           DIFF_FORMAT_NAME |
885                                           DIFF_FORMAT_NAME_STATUS)) {
886                         for (p = paths; p; p = p->next) {
887                                 if (p->len)
888                                         show_raw_diff(p, num_parent, rev);
889                         }
890                         needsep = 1;
891                 }
892                 else if (opt->output_format &
893                          (DIFF_FORMAT_NUMSTAT|DIFF_FORMAT_DIFFSTAT))
894                         needsep = 1;
895                 if (opt->output_format & DIFF_FORMAT_PATCH) {
896                         if (needsep)
897                                 putchar(opt->line_termination);
898                         for (p = paths; p; p = p->next) {
899                                 if (p->len)
900                                         show_patch_diff(p, num_parent, dense,
901                                                         rev);
902                         }
903                 }
904         }
905
906         /* Clean things up */
907         while (paths) {
908                 struct combine_diff_path *tmp = paths;
909                 paths = paths->next;
910                 free(tmp);
911         }
912 }
913
914 void diff_tree_combined_merge(const unsigned char *sha1,
915                              int dense, struct rev_info *rev)
916 {
917         int num_parent;
918         const unsigned char (*parent)[20];
919         struct commit *commit = lookup_commit(sha1);
920         struct commit_list *parents;
921
922         /* count parents */
923         for (parents = commit->parents, num_parent = 0;
924              parents;
925              parents = parents->next, num_parent++)
926                 ; /* nothing */
927
928         parent = xmalloc(num_parent * sizeof(*parent));
929         for (parents = commit->parents, num_parent = 0;
930              parents;
931              parents = parents->next, num_parent++)
932                 hashcpy((unsigned char*)(parent + num_parent),
933                         parents->item->object.sha1);
934         diff_tree_combined(sha1, parent, num_parent, dense, rev);
935 }