Blob


1 /* $OpenBSD: diff3.c,v 1.41 2016/10/18 21:06:52 millert Exp $ */
3 /*
4 * Copyright (C) Caldera International Inc. 2001-2002.
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code and documentation must retain the above
11 * copyright notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed or owned by Caldera
18 * International, Inc.
19 * 4. Neither the name of Caldera International, Inc. nor the names of other
20 * contributors may be used to endorse or promote products derived from
21 * this software without specific prior written permission.
22 *
23 * USE OF THE SOFTWARE PROVIDED FOR UNDER THIS LICENSE BY CALDERA
24 * INTERNATIONAL, INC. AND CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR
25 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
26 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
27 * IN NO EVENT SHALL CALDERA INTERNATIONAL, INC. BE LIABLE FOR ANY DIRECT,
28 * INDIRECT INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
29 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
30 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
32 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
33 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36 /*-
37 * Copyright (c) 1991, 1993
38 * The Regents of the University of California. All rights reserved.
39 *
40 * Redistribution and use in source and binary forms, with or without
41 * modification, are permitted provided that the following conditions
42 * are met:
43 * 1. Redistributions of source code must retain the above copyright
44 * notice, this list of conditions and the following disclaimer.
45 * 2. Redistributions in binary form must reproduce the above copyright
46 * notice, this list of conditions and the following disclaimer in the
47 * documentation and/or other materials provided with the distribution.
48 * 3. Neither the name of the University nor the names of its contributors
49 * may be used to endorse or promote products derived from this software
50 * without specific prior written permission.
51 *
52 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
53 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
54 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
55 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
56 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
57 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
58 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
59 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
60 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
61 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
62 * SUCH DAMAGE.
63 *
64 * @(#)diff3.c 8.1 (Berkeley) 6/6/93
65 */
67 #include <sys/stat.h>
68 #include <sys/queue.h>
70 #include <ctype.h>
71 #include <limits.h>
72 #include <stdio.h>
73 #include <stdarg.h>
74 #include <stdlib.h>
75 #include <string.h>
76 #include <time.h>
77 #include <unistd.h>
79 #include "got_error.h"
80 #include "got_opentemp.h"
81 #include "got_object.h"
83 #include "buf.h"
84 #include "rcsutil.h"
85 #include "got_lib_diff.h"
86 #include "worklist.h"
88 #ifndef nitems
89 #define nitems(_a) (sizeof(_a) / sizeof((_a)[0]))
90 #endif
92 /* diff3 - 3-way differential file comparison */
94 /* diff3 [-ex3EX] d13 d23 f1 f2 f3 [m1 m3]
95 *
96 * d13 = diff report on f1 vs f3
97 * d23 = diff report on f2 vs f3
98 * f1, f2, f3 the 3 files
99 * if changes in f1 overlap with changes in f3, m1 and m3 are used
100 * to mark the overlaps; otherwise, the file names f1 and f3 are used
101 * (only for options E and X).
102 */
104 /*
105 * "from" is first in range of changed lines; "to" is last+1
106 * from=to=line after point of insertion for added lines.
107 */
108 struct range {
109 int from;
110 int to;
111 };
113 struct diff {
114 struct range old;
115 struct range new;
116 };
118 struct diff3_state {
119 size_t szchanges;
121 struct diff *d13;
122 struct diff *d23;
124 /*
125 * "de" is used to gather editing scripts. These are later spewed out
126 * in reverse order. Its first element must be all zero, the "new"
127 * component of "de" contains line positions or byte positions
128 * depending on when you look (!?). Array overlap indicates which
129 * sections in "de" correspond to lines that are different in all
130 * three files.
131 */
132 struct diff *de;
133 char *overlap;
134 int overlapcnt;
135 FILE *fp[3];
136 int cline[3]; /* # of the last-read line in each file (0-2) */
138 /*
139 * the latest known correspondence between line numbers of the 3 files
140 * is stored in last[1-3];
141 */
142 int last[4];
143 int eflag;
144 int oflag;
145 int debug;
146 char f1mark[PATH_MAX], f3mark[PATH_MAX]; /* markers for -E and -X */
148 char *buf;
149 size_t bufsize;
151 BUF *diffbuf;
152 };
155 static int duplicate(struct range *, struct range *, struct diff3_state *);
156 static int edit(struct diff *, int, int, struct diff3_state *);
157 static char *getchange(FILE *, struct diff3_state *);
158 static char *get_line(FILE *, size_t *, struct diff3_state *);
159 static int number(char **);
160 static const struct got_error *readin(size_t *, char *, struct diff **,
161 struct diff3_state *);
162 static int ed_patch_lines(struct rcs_lines *, struct rcs_lines *);
163 static int skip(int, int, char *, struct diff3_state *);
164 static int edscript(int, struct diff3_state *);
165 static int merge(size_t, size_t, struct diff3_state *);
166 static void change(int, struct range *, int, struct diff3_state *);
167 static void keep(int, struct range *, struct diff3_state *);
168 static void prange(struct range *, struct diff3_state *);
169 static void repos(int, struct diff3_state *);
170 static void separate(const char *, struct diff3_state *);
171 static const struct got_error *increase(struct diff3_state *);
172 static const struct got_error *diff3_internal(char *, char *, char *,
173 char *, char *, const char *, const char *, struct diff3_state *,
174 const char *, const char *);
176 static const struct got_error *
177 diff_output(BUF *diffbuf, const char *fmt, ...)
179 va_list vap;
180 int i;
181 char *str;
182 size_t newsize;
184 va_start(vap, fmt);
185 i = vasprintf(&str, fmt, vap);
186 va_end(vap);
187 if (i == -1)
188 return got_error_from_errno();
189 buf_append(&newsize, diffbuf, str, strlen(str));
190 free(str);
191 return NULL;
194 static const struct got_error*
195 diffreg(BUF **d, const char *path1, const char *path2)
197 const struct got_error *err = NULL;
198 FILE *f1 = NULL, *f2 = NULL, *outfile = NULL;
199 char *outpath = NULL;
200 struct got_diff_state ds;
201 struct got_diff_args args;
202 int res;
204 *d = NULL;
206 f1 = fopen(path1, "r");
207 if (f1 == NULL) {
208 err = got_error_from_errno();
209 goto done;
211 f2 = fopen(path2, "r");
212 if (f1 == NULL) {
213 err = got_error_from_errno();
214 goto done;
217 err = got_opentemp_named(&outpath, &outfile, "/tmp/got-diffreg");
218 if (err)
219 goto done;
221 memset(&ds, 0, sizeof(ds));
222 /* XXX should stat buffers be passed in args instead of ds? */
223 if (stat(path1, &ds.stb1) == -1) {
224 err = got_error_from_errno();
225 goto done;
227 if (stat(path2, &ds.stb2) == -1) {
228 err = got_error_from_errno();
229 goto done;
232 memset(&args, 0, sizeof(args));
233 args.diff_format = D_NORMAL;
234 args.label[0] = "";
235 args.label[1] = "";
236 args.diff_context = 0;
238 err = got_diffreg(&res, f1, f2, D_FORCEASCII, &args, &ds,
239 outfile, NULL);
240 if (err)
241 goto done;
243 if (fflush(outfile) != 0) {
244 err = got_error_from_errno();
245 goto done;
248 *d = buf_load(outpath);
249 if (*d == NULL)
250 err = got_error_from_errno();
251 done:
252 if (outpath) {
253 unlink(outpath);
254 free(outpath);
256 if (outfile && fclose(outfile) != 0 && err == NULL)
257 err = got_error_from_errno();
258 if (f1 && fclose(f1) != 0 && err == NULL)
259 err = got_error_from_errno();
260 if (f2 && fclose(f2) != 0 && err == NULL)
261 err = got_error_from_errno();
262 return err;
265 /*
266 * For merge(1).
267 */
268 const struct got_error *
269 got_merge_diff3(int *overlapcnt, int outfd, const char *p1, const char *p2,
270 const char *p3, const char *label1, const char *label3)
272 const struct got_error *err = NULL;
273 char *dp13, *dp23, *path1, *path2, *path3;
274 BUF *b1, *b2, *b3, *d1, *d2, *diffb;
275 u_char *data, *patch;
276 size_t dlen, plen;
277 struct wklhead temp_files;
278 struct diff3_state *d3s;
279 int i;
281 *overlapcnt = 0;
283 SLIST_INIT(&temp_files);
285 d3s = calloc(1, sizeof(*d3s));
286 if (d3s == NULL)
287 return got_error_from_errno();
288 d3s->eflag = 3; /* default -E for compatibility with former RCS */
289 d3s->oflag = 1; /* default -E for compatibility with former RCS */
291 b1 = b2 = b3 = d1 = d2 = diffb = NULL;
292 dp13 = dp23 = path1 = path2 = path3 = NULL;
293 data = patch = NULL;
295 if ((b1 = buf_load(p1)) == NULL)
296 goto out;
297 if ((b2 = buf_load(p2)) == NULL)
298 goto out;
299 if ((b3 = buf_load(p3)) == NULL)
300 goto out;
302 diffb = buf_alloc(128);
304 if (asprintf(&path1, "/tmp/got-diff1.XXXXXXXX") == -1) {
305 err = got_error_from_errno();
306 goto out;
308 if (asprintf(&path2, "/tmp/got-diff2.XXXXXXXX") == -1) {
309 err = got_error_from_errno();
310 goto out;
312 if (asprintf(&path3, "/tmp/got-diff3.XXXXXXXX") == -1) {
313 err = got_error_from_errno();
314 goto out;
317 err = buf_write_stmp(b1, path1, &temp_files);
318 if (err)
319 goto out;
320 err = buf_write_stmp(b2, path2, &temp_files);
321 if (err)
322 goto out;
323 err = buf_write_stmp(b3, path3, &temp_files);
324 if (err)
325 goto out;
327 buf_free(b2);
328 b2 = NULL;
330 err = diffreg(&d1, path1, path3);
331 if (err) {
332 buf_free(diffb);
333 diffb = NULL;
334 goto out;
337 err = diffreg(&d2, path2, path3);
338 if (err) {
339 buf_free(diffb);
340 diffb = NULL;
341 goto out;
344 if (asprintf(&dp13, "/tmp/got-d13.XXXXXXXXXX") == -1) {
345 err = got_error_from_errno();
346 goto out;
348 err = buf_write_stmp(d1, dp13, &temp_files);
349 if (err)
350 goto out;
352 buf_free(d1);
353 d1 = NULL;
355 if (asprintf(&dp23, "/tmp/got-d23.XXXXXXXXXX") == -1) {
356 err = got_error_from_errno();
357 goto out;
359 err = buf_write_stmp(d2, dp23, &temp_files);
360 if (err)
361 goto out;
363 buf_free(d2);
364 d2 = NULL;
366 d3s->diffbuf = diffb;
367 err = diff3_internal(dp13, dp23, path1, path2, path3,
368 label1, label3, d3s, label1, label3);
369 if (err) {
370 buf_free(diffb);
371 diffb = NULL;
372 goto out;
375 plen = buf_len(diffb);
376 patch = buf_release(diffb);
377 dlen = buf_len(b1);
378 data = buf_release(b1);
380 diffb = rcs_patchfile(data, dlen, patch, plen, ed_patch_lines);
381 out:
382 buf_free(b2);
383 buf_free(b3);
384 buf_free(d1);
385 buf_free(d2);
387 (void)unlink(path1);
388 (void)unlink(path2);
389 (void)unlink(path3);
390 (void)unlink(dp13);
391 (void)unlink(dp23);
393 free(path1);
394 free(path2);
395 free(path3);
396 free(dp13);
397 free(dp23);
398 free(data);
399 free(patch);
401 worklist_clean(&temp_files, worklist_unlink);
403 for (i = 0; i < nitems(d3s->fp); i++) {
404 if (d3s->fp[i] && fclose(d3s->fp[i]) != 0 && err == NULL)
405 err = got_error_from_errno();
407 if (err == NULL && diffb) {
408 if (buf_write_fd(diffb, outfd) < 0)
409 err = got_error_from_errno();
410 *overlapcnt = d3s->overlapcnt;
412 free(d3s);
413 buf_free(diffb);
414 return err;
417 static const struct got_error *
418 diff3_internal(char *dp13, char *dp23, char *path1, char *path2, char *path3,
419 const char *fmark, const char *rmark, struct diff3_state *d3s,
420 const char *label1, const char *label3)
422 const struct got_error *err = NULL;
423 ssize_t m, n;
424 int i;
426 i = snprintf(d3s->f1mark, sizeof(d3s->f1mark), "<<<<<<< %s", label1);
427 if (i < 0 || i >= (int)sizeof(d3s->f1mark))
428 return got_error(GOT_ERR_NO_SPACE);
430 i = snprintf(d3s->f3mark, sizeof(d3s->f3mark), ">>>>>>> %s", label3);
431 if (i < 0 || i >= (int)sizeof(d3s->f3mark))
432 return got_error(GOT_ERR_NO_SPACE);
434 err = increase(d3s);
435 if (err)
436 return err;
438 err = readin(&m, dp13, &d3s->d13, d3s);
439 if (err)
440 return err;
441 err = readin(&n, dp23, &d3s->d23, d3s);
442 if (err)
443 return err;
445 if ((d3s->fp[0] = fopen(path1, "r")) == NULL)
446 return got_error_from_errno();
447 if ((d3s->fp[1] = fopen(path2, "r")) == NULL)
448 return got_error_from_errno();
449 if ((d3s->fp[2] = fopen(path3, "r")) == NULL)
450 return got_error_from_errno();
452 if (merge(m, n, d3s) < 0)
453 return got_error_from_errno();
454 return NULL;
457 static int
458 ed_patch_lines(struct rcs_lines *dlines, struct rcs_lines *plines)
460 char op, *ep;
461 struct rcs_line *sort, *lp, *dlp, *ndlp, *insert_after;
462 int start, end, i, lineno;
463 u_char tmp;
465 dlp = TAILQ_FIRST(&(dlines->l_lines));
466 lp = TAILQ_FIRST(&(plines->l_lines));
468 end = 0;
469 for (lp = TAILQ_NEXT(lp, l_list); lp != NULL;
470 lp = TAILQ_NEXT(lp, l_list)) {
471 /* Skip blank lines */
472 if (lp->l_len < 2)
473 continue;
475 /* NUL-terminate line buffer for strtol() safety. */
476 tmp = lp->l_line[lp->l_len - 1];
477 lp->l_line[lp->l_len - 1] = '\0';
479 /* len - 1 is NUL terminator so we use len - 2 for 'op' */
480 op = lp->l_line[lp->l_len - 2];
481 start = (int)strtol(lp->l_line, &ep, 10);
483 /* Restore the last byte of the buffer */
484 lp->l_line[lp->l_len - 1] = tmp;
486 if (op == 'a') {
487 if (start > dlines->l_nblines ||
488 start < 0 || *ep != 'a')
489 return -1;
490 } else if (op == 'c') {
491 if (start > dlines->l_nblines ||
492 start < 0 || (*ep != ',' && *ep != 'c'))
493 return -1;
495 if (*ep == ',') {
496 ep++;
497 end = (int)strtol(ep, &ep, 10);
498 if (end < 0 || *ep != 'c')
499 return -1;
500 } else {
501 end = start;
506 for (;;) {
507 if (dlp == NULL)
508 break;
509 if (dlp->l_lineno == start)
510 break;
511 if (dlp->l_lineno > start) {
512 dlp = TAILQ_PREV(dlp, tqh, l_list);
513 } else if (dlp->l_lineno < start) {
514 ndlp = TAILQ_NEXT(dlp, l_list);
515 if (ndlp->l_lineno > start)
516 break;
517 dlp = ndlp;
521 if (dlp == NULL)
522 return -1;
525 if (op == 'c') {
526 insert_after = TAILQ_PREV(dlp, tqh, l_list);
527 for (i = 0; i <= (end - start); i++) {
528 ndlp = TAILQ_NEXT(dlp, l_list);
529 TAILQ_REMOVE(&(dlines->l_lines), dlp, l_list);
530 dlp = ndlp;
532 dlp = insert_after;
535 if (op == 'a' || op == 'c') {
536 for (;;) {
537 ndlp = lp;
538 lp = TAILQ_NEXT(lp, l_list);
539 if (lp == NULL)
540 return -1;
542 if (!memcmp(lp->l_line, ".", 1))
543 break;
545 TAILQ_REMOVE(&(plines->l_lines), lp, l_list);
546 TAILQ_INSERT_AFTER(&(dlines->l_lines), dlp,
547 lp, l_list);
548 dlp = lp;
550 lp->l_lineno = start;
551 lp = ndlp;
555 /*
556 * always resort lines as the markers might be put at the
557 * same line as we first started editing.
558 */
559 lineno = 0;
560 TAILQ_FOREACH(sort, &(dlines->l_lines), l_list)
561 sort->l_lineno = lineno++;
562 dlines->l_nblines = lineno - 1;
565 return (0);
568 /*
569 * Pick up the line numbers of all changes from one change file.
570 * (This puts the numbers in a vector, which is not strictly necessary,
571 * since the vector is processed in one sequential pass.
572 * The vector could be optimized out of existence)
573 */
574 static const struct got_error *
575 readin(size_t *n, char *name, struct diff **dd, struct diff3_state *d3s)
577 const struct got_error *err = NULL;
578 int a, b, c, d;
579 char kind, *p;
580 size_t i;
582 *n = 0;
584 d3s->fp[0] = fopen(name, "r");
585 if (d3s->fp[0] == NULL)
586 return got_error_from_errno();
587 for (i = 0; (p = getchange(d3s->fp[0], d3s)); i++) {
588 if (i >= d3s->szchanges - 1) {
589 err = increase(d3s);
590 if (err)
591 return err;
593 a = b = number(&p);
594 if (*p == ',') {
595 p++;
596 b = number(&p);
598 kind = *p++;
599 c = d = number(&p);
600 if (*p==',') {
601 p++;
602 d = number(&p);
604 if (kind == 'a')
605 a++;
606 if (kind == 'd')
607 c++;
608 b++;
609 d++;
610 (*dd)[i].old.from = a;
611 (*dd)[i].old.to = b;
612 (*dd)[i].new.from = c;
613 (*dd)[i].new.to = d;
616 if (i) {
617 (*dd)[i].old.from = (*dd)[i-1].old.to;
618 (*dd)[i].new.from = (*dd)[i-1].new.to;
621 if (fclose(d3s->fp[0]) != 0)
622 err = got_error_from_errno();
624 *n = i;
625 return err;
628 static int
629 number(char **lc)
631 int nn;
633 nn = 0;
634 while (isdigit((unsigned char)(**lc)))
635 nn = nn*10 + *(*lc)++ - '0';
637 return (nn);
640 static char *
641 getchange(FILE *b, struct diff3_state *d3s)
643 char *line;
645 while ((line = get_line(b, NULL, d3s))) {
646 if (isdigit((unsigned char)line[0]))
647 return (line);
650 return (NULL);
653 static char *
654 get_line(FILE *b, size_t *n, struct diff3_state *d3s)
656 char *cp;
657 size_t len;
658 char *new;
660 if ((cp = fgetln(b, &len)) == NULL)
661 return (NULL);
663 if (cp[len - 1] != '\n')
664 len++;
665 if (len + 1 > d3s->bufsize) {
666 do {
667 d3s->bufsize += 1024;
668 } while (len + 1 > d3s->bufsize);
669 new = reallocarray(d3s->buf, 1, d3s->bufsize);
670 if (new == NULL)
671 return NULL;
672 d3s->buf = new;
674 memcpy(d3s->buf, cp, len - 1);
675 d3s->buf[len - 1] = '\n';
676 d3s->buf[len] = '\0';
677 if (n != NULL)
678 *n = len;
680 return (d3s->buf);
683 static int
684 merge(size_t m1, size_t m2, struct diff3_state *d3s)
686 struct diff *d1, *d2, *d3;
687 int dpl, j, t1, t2;
689 d1 = d3s->d13;
690 d2 = d3s->d23;
691 j = 0;
692 for (;;) {
693 t1 = (d1 < d3s->d13 + m1);
694 t2 = (d2 < d3s->d23 + m2);
695 if (!t1 && !t2)
696 break;
698 if (d3s->debug) {
699 printf("%d,%d=%d,%d %d,%d=%d,%d\n",
700 d1->old.from, d1->old.to,
701 d1->new.from, d1->new.to,
702 d2->old.from, d2->old.to,
703 d2->new.from, d2->new.to);
706 /* first file is different from others */
707 if (!t2 || (t1 && d1->new.to < d2->new.from)) {
708 /* stuff peculiar to 1st file */
709 if (d3s->eflag == 0) {
710 separate("1", d3s);
711 change(1, &d1->old, 0, d3s);
712 keep(2, &d1->new, d3s);
713 change(3, &d1->new, 0, d3s);
715 d1++;
716 continue;
719 /* second file is different from others */
720 if (!t1 || (t2 && d2->new.to < d1->new.from)) {
721 if (d3s->eflag == 0) {
722 separate("2", d3s);
723 keep(1, &d2->new, d3s);
724 change(2, &d2->old, 0, d3s);
725 change(3, &d2->new, 0, d3s);
727 d2++;
728 continue;
731 /*
732 * Merge overlapping changes in first file
733 * this happens after extension (see below).
734 */
735 if (d1 + 1 < d3s->d13 + m1 && d1->new.to >= d1[1].new.from) {
736 d1[1].old.from = d1->old.from;
737 d1[1].new.from = d1->new.from;
738 d1++;
739 continue;
742 /* merge overlapping changes in second */
743 if (d2 + 1 < d3s->d23 + m2 && d2->new.to >= d2[1].new.from) {
744 d2[1].old.from = d2->old.from;
745 d2[1].new.from = d2->new.from;
746 d2++;
747 continue;
749 /* stuff peculiar to third file or different in all */
750 if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {
751 dpl = duplicate(&d1->old, &d2->old, d3s);
752 if (dpl == -1)
753 return (-1);
755 /*
756 * dpl = 0 means all files differ
757 * dpl = 1 means files 1 and 2 identical
758 */
759 if (d3s->eflag == 0) {
760 separate(dpl ? "3" : "", d3s);
761 change(1, &d1->old, dpl, d3s);
762 change(2, &d2->old, 0, d3s);
763 d3 = d1->old.to > d1->old.from ? d1 : d2;
764 change(3, &d3->new, 0, d3s);
765 } else
766 j = edit(d1, dpl, j, d3s);
767 d1++;
768 d2++;
769 continue;
772 /*
773 * Overlapping changes from file 1 and 2; extend changes
774 * appropriately to make them coincide.
775 */
776 if (d1->new.from < d2->new.from) {
777 d2->old.from -= d2->new.from-d1->new.from;
778 d2->new.from = d1->new.from;
779 } else if (d2->new.from < d1->new.from) {
780 d1->old.from -= d1->new.from-d2->new.from;
781 d1->new.from = d2->new.from;
783 if (d1->new.to > d2->new.to) {
784 d2->old.to += d1->new.to - d2->new.to;
785 d2->new.to = d1->new.to;
786 } else if (d2->new.to > d1->new.to) {
787 d1->old.to += d2->new.to - d1->new.to;
788 d1->new.to = d2->new.to;
792 return (edscript(j, d3s));
795 static void
796 separate(const char *s, struct diff3_state *d3s)
798 diff_output(d3s->diffbuf, "====%s\n", s);
801 /*
802 * The range of lines rold.from thru rold.to in file i is to be changed.
803 * It is to be printed only if it does not duplicate something to be
804 * printed later.
805 */
806 static void
807 change(int i, struct range *rold, int fdup, struct diff3_state *d3s)
809 diff_output(d3s->diffbuf, "%d:", i);
810 d3s->last[i] = rold->to;
811 prange(rold, d3s);
812 if (fdup || d3s->debug)
813 return;
814 i--;
815 (void)skip(i, rold->from, NULL, d3s);
816 (void)skip(i, rold->to, " ", d3s);
819 /*
820 * print the range of line numbers, rold.from thru rold.to, as n1,n2 or n1
821 */
822 static void
823 prange(struct range *rold, struct diff3_state *d3s)
825 if (rold->to <= rold->from)
826 diff_output(d3s->diffbuf, "%da\n", rold->from - 1);
827 else {
828 diff_output(d3s->diffbuf, "%d", rold->from);
829 if (rold->to > rold->from+1)
830 diff_output(d3s->diffbuf, ",%d", rold->to - 1);
831 diff_output(d3s->diffbuf, "c\n");
835 /*
836 * No difference was reported by diff between file 1 (or 2) and file 3,
837 * and an artificial dummy difference (trange) must be ginned up to
838 * correspond to the change reported in the other file.
839 */
840 static void
841 keep(int i, struct range *rnew, struct diff3_state *d3s)
843 int delta;
844 struct range trange;
846 delta = d3s->last[3] - d3s->last[i];
847 trange.from = rnew->from - delta;
848 trange.to = rnew->to - delta;
849 change(i, &trange, 1, d3s);
852 /*
853 * skip to just before line number from in file "i". If "pr" is non-NULL,
854 * print all skipped stuff with string pr as a prefix.
855 */
856 static int
857 skip(int i, int from, char *pr, struct diff3_state *d3s)
859 size_t j, n;
860 char *line;
862 for (n = 0; d3s->cline[i] < from - 1; n += j) {
863 if ((line = get_line(d3s->fp[i], &j, d3s)) == NULL)
864 return (-1);
865 if (pr != NULL)
866 diff_output(d3s->diffbuf, "%s%s", pr, line);
867 d3s->cline[i]++;
869 return ((int) n);
872 /*
873 * Return 1 or 0 according as the old range (in file 1) contains exactly
874 * the same data as the new range (in file 2).
875 */
876 static int
877 duplicate(struct range *r1, struct range *r2, struct diff3_state *d3s)
879 int c,d;
880 int nchar;
881 int nline;
883 if (r1->to-r1->from != r2->to-r2->from)
884 return (0);
885 (void)skip(0, r1->from, NULL, d3s);
886 (void)skip(1, r2->from, NULL, d3s);
887 nchar = 0;
888 for (nline=0; nline < r1->to - r1->from; nline++) {
889 do {
890 c = getc(d3s->fp[0]);
891 d = getc(d3s->fp[1]);
892 if (c == -1 || d== -1)
893 return (-1);
894 nchar++;
895 if (c != d) {
896 repos(nchar, d3s);
897 return (0);
899 } while (c != '\n');
901 repos(nchar, d3s);
902 return (1);
905 static void
906 repos(int nchar, struct diff3_state *d3s)
908 int i;
910 for (i = 0; i < 2; i++)
911 (void)fseek(d3s->fp[i], (long)-nchar, SEEK_CUR);
914 /*
915 * collect an editing script for later regurgitation
916 */
917 static int
918 edit(struct diff *diff, int fdup, int j, struct diff3_state *d3s)
920 if (((fdup + 1) & d3s->eflag) == 0)
921 return (j);
922 j++;
923 d3s->overlap[j] = !fdup;
924 if (!fdup)
925 d3s->overlapcnt++;
926 d3s->de[j].old.from = diff->old.from;
927 d3s->de[j].old.to = diff->old.to;
928 d3s->de[j].new.from =
929 d3s->de[j-1].new.to + skip(2, diff->new.from, NULL, d3s);
930 d3s->de[j].new.to =
931 d3s->de[j].new.from + skip(2, diff->new.to, NULL, d3s);
932 return (j);
935 /* regurgitate */
936 static int
937 edscript(int n, struct diff3_state *d3s)
939 int j, k;
940 char block[BUFSIZ+1];
942 for (; n > 0; n--) {
943 if (!d3s->oflag || !d3s->overlap[n])
944 prange(&d3s->de[n].old, d3s);
945 else
946 diff_output(d3s->diffbuf, "%da\n=======\n",
947 d3s->de[n].old.to -1);
948 (void)fseek(d3s->fp[2], (long)d3s->de[n].new.from, SEEK_SET);
949 k = d3s->de[n].new.to - d3s->de[n].new.from;
950 for (; k > 0; k-= j) {
951 j = k > BUFSIZ ? BUFSIZ : k;
952 if (fread(block, 1, j, d3s->fp[2]) != (size_t)j)
953 return (-1);
954 block[j] = '\0';
955 diff_output(d3s->diffbuf, "%s", block);
958 if (!d3s->oflag || !d3s->overlap[n])
959 diff_output(d3s->diffbuf, ".\n");
960 else {
961 diff_output(d3s->diffbuf, "%s\n.\n", d3s->f3mark);
962 diff_output(d3s->diffbuf, "%da\n%s\n.\n",
963 d3s->de[n].old.from - 1, d3s->f1mark);
967 return (d3s->overlapcnt);
970 static const struct got_error *
971 increase(struct diff3_state *d3s)
973 size_t newsz, incr;
974 struct diff *d;
975 char *s;
977 /* are the memset(3) calls needed? */
978 newsz = d3s->szchanges == 0 ? 64 : 2 * d3s->szchanges;
979 incr = newsz - d3s->szchanges;
981 d = reallocarray(d3s->d13, newsz, sizeof(*d3s->d13));
982 if (d == NULL)
983 return got_error_from_errno();
984 d3s->d13 = d;
985 memset(d3s->d13 + d3s->szchanges, 0, incr * sizeof(*d3s->d13));
987 d = reallocarray(d3s->d23, newsz, sizeof(*d3s->d23));
988 if (d == NULL)
989 return got_error_from_errno();
990 d3s->d23 = d;
991 memset(d3s->d23 + d3s->szchanges, 0, incr * sizeof(*d3s->d23));
993 d = reallocarray(d3s->de, newsz, sizeof(*d3s->de));
994 if (d == NULL)
995 return got_error_from_errno();
996 d3s->de = d;
997 memset(d3s->de + d3s->szchanges, 0, incr * sizeof(*d3s->de));
999 s = reallocarray(d3s->overlap, newsz, sizeof(*d3s->overlap));
1000 if (s == NULL)
1001 return got_error_from_errno();
1002 d3s->overlap = s;
1003 memset(d3s->overlap + d3s->szchanges, 0, incr * sizeof(*d3s->overlap));
1004 d3s->szchanges = newsz;
1006 return NULL;