1 /* $OpenBSD: diff3.c,v 1.41 2016/10/18 21:06:52 millert Exp $ */
4 * Copyright (C) Caldera International Inc. 2001-2002.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
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
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.
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.
37 * Copyright (c) 1991, 1993
38 * The Regents of the University of California. All rights reserved.
40 * Redistribution and use in source and binary forms, with or without
41 * modification, are permitted provided that the following conditions
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.
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
64 * @(#)diff3.c 8.1 (Berkeley) 6/6/93
68 #include <sys/queue.h>
79 #include "got_error.h"
80 #include "got_opentemp.h"
81 #include "got_object.h"
85 #include "got_lib_diff.h"
89 #define nitems(_a) (sizeof(_a) / sizeof((_a)[0]))
92 /* diff3 - 3-way differential file comparison */
94 /* diff3 [-ex3EX] d13 d23 f1 f2 f3 [m1 m3]
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).
105 * "from" is first in range of changed lines; "to" is last+1
106 * from=to=line after point of insertion for added lines.
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
136 int cline[3]; /* # of the last-read line in each file (0-2) */
139 * the latest known correspondence between line numbers of the 3 files
140 * is stored in last[1-3];
146 char f1mark[PATH_MAX], f3mark[PATH_MAX]; /* markers for -E and -X */
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 *);
175 static const struct got_error *
176 diff_output(BUF *diffbuf, const char *fmt, ...)
184 i = vasprintf(&str, fmt, vap);
187 return got_error_from_errno();
188 buf_append(&newsize, diffbuf, str, strlen(str));
193 static const struct got_error*
194 diffreg(BUF **d, const char *path1, const char *path2)
196 const struct got_error *err = NULL;
197 FILE *f1 = NULL, *f2 = NULL, *outfile = NULL;
198 char *outpath = NULL;
199 struct got_diff_state ds;
200 struct got_diff_args args;
205 f1 = fopen(path1, "r");
207 err = got_error_from_errno();
210 f2 = fopen(path2, "r");
212 err = got_error_from_errno();
216 err = got_opentemp_named(&outpath, &outfile, "/tmp/got-diff");
220 memset(&ds, 0, sizeof(ds));
221 /* XXX should stat buffers be passed in args instead of ds? */
222 if (stat(path1, &ds.stb1) == -1) {
223 err = got_error_from_errno();
226 if (stat(path2, &ds.stb2) == -1) {
227 err = got_error_from_errno();
231 memset(&args, 0, sizeof(args));
232 args.diff_format = D_NORMAL;
235 args.diff_context = 0;
237 err = got_diffreg(&res, f1, f2, D_FORCEASCII, &args, &ds,
242 *d = buf_load(outpath);
244 err = got_error_from_errno();
259 const struct got_error *
260 got_merge_diff3(int outfd, const char *p1, const char *p2, const char *p3)
262 const struct got_error *err = NULL;
263 char *dp13, *dp23, *path1, *path2, *path3;
264 BUF *b1, *b2, *b3, *d1, *d2, *diffb;
265 u_char *data, *patch;
267 struct wklhead temp_files;
268 struct diff3_state *d3s;
271 d3s = calloc(1, sizeof(*d3s));
273 return got_error_from_errno();
274 d3s->eflag = 3; /* default -E for compatibility with former RCS */
275 d3s->oflag = 1; /* default -E for compatibility with former RCS */
277 b1 = b2 = b3 = d1 = d2 = diffb = NULL;
278 dp13 = dp23 = path1 = path2 = path3 = NULL;
281 if ((b1 = buf_load(p1)) == NULL)
283 if ((b2 = buf_load(p2)) == NULL)
285 if ((b3 = buf_load(p3)) == NULL)
288 diffb = buf_alloc(128);
290 if (asprintf(&path1, "/tmp/got-diff1.XXXXXXXX") == -1) {
291 err = got_error_from_errno();
294 if (asprintf(&path2, "/tmp/got-diff2.XXXXXXXX") == -1) {
295 err = got_error_from_errno();
298 if (asprintf(&path3, "/tmp/got-diff3.XXXXXXXX") == -1) {
299 err = got_error_from_errno();
303 err = buf_write_stmp(b1, path1, &temp_files);
306 err = buf_write_stmp(b2, path2, &temp_files);
309 err = buf_write_stmp(b3, path3, &temp_files);
316 err = diffreg(&d1, path1, path3);
323 err = diffreg(&d2, path2, path3);
330 if (asprintf(&dp13, "/tmp/got-d13.XXXXXXXXXX") == -1) {
331 err = got_error_from_errno();
334 err = buf_write_stmp(d1, dp13, &temp_files);
341 if (asprintf(&dp23, "/tmp/got-d23.XXXXXXXXXX") == -1) {
342 err = got_error_from_errno();
345 err = buf_write_stmp(d2, dp23, &temp_files);
352 d3s->diffbuf = diffb;
353 err = diff3_internal(dp13, dp23, path1, path2, path3, p1, p3,
361 plen = buf_len(diffb);
362 patch = buf_release(diffb);
364 data = buf_release(b1);
366 diffb = rcs_patchfile(data, dlen, patch, plen, ed_patch_lines);
387 worklist_clean(&temp_files, worklist_unlink);
389 for (i = 0; i < nitems(d3s->fp); i++) {
394 if (err == NULL && diffb) {
395 if (buf_write_fd(diffb, outfd) < 0)
396 err = got_error_from_errno();
402 static const struct got_error *
403 diff3_internal(char *dp13, char *dp23, char *path1, char *path2, char *path3,
404 const char *fmark, const char *rmark, struct diff3_state *d3s)
406 const struct got_error *err = NULL;
410 i = snprintf(d3s->f1mark, sizeof(d3s->f1mark), "<<<<<<< %s", fmark);
411 if (i < 0 || i >= (int)sizeof(d3s->f1mark))
412 return got_error(GOT_ERR_NO_SPACE);
414 i = snprintf(d3s->f3mark, sizeof(d3s->f3mark), ">>>>>>> %s", rmark);
415 if (i < 0 || i >= (int)sizeof(d3s->f3mark))
416 return got_error(GOT_ERR_NO_SPACE);
422 err = readin(&m, dp13, &d3s->d13, d3s);
425 err = readin(&n, dp23, &d3s->d23, d3s);
429 if ((d3s->fp[0] = fopen(path1, "r")) == NULL)
430 return got_error_from_errno();
431 if ((d3s->fp[1] = fopen(path2, "r")) == NULL)
432 return got_error_from_errno();
433 if ((d3s->fp[2] = fopen(path3, "r")) == NULL)
434 return got_error_from_errno();
436 if (merge(m, n, d3s) < 0)
437 return got_error_from_errno();
442 ed_patch_lines(struct rcs_lines *dlines, struct rcs_lines *plines)
445 struct rcs_line *sort, *lp, *dlp, *ndlp, *insert_after;
446 int start, end, i, lineno;
449 dlp = TAILQ_FIRST(&(dlines->l_lines));
450 lp = TAILQ_FIRST(&(plines->l_lines));
453 for (lp = TAILQ_NEXT(lp, l_list); lp != NULL;
454 lp = TAILQ_NEXT(lp, l_list)) {
455 /* Skip blank lines */
459 /* NUL-terminate line buffer for strtol() safety. */
460 tmp = lp->l_line[lp->l_len - 1];
461 lp->l_line[lp->l_len - 1] = '\0';
463 /* len - 1 is NUL terminator so we use len - 2 for 'op' */
464 op = lp->l_line[lp->l_len - 2];
465 start = (int)strtol(lp->l_line, &ep, 10);
467 /* Restore the last byte of the buffer */
468 lp->l_line[lp->l_len - 1] = tmp;
471 if (start > dlines->l_nblines ||
472 start < 0 || *ep != 'a')
474 } else if (op == 'c') {
475 if (start > dlines->l_nblines ||
476 start < 0 || (*ep != ',' && *ep != 'c'))
481 end = (int)strtol(ep, &ep, 10);
482 if (end < 0 || *ep != 'c')
493 if (dlp->l_lineno == start)
495 if (dlp->l_lineno > start) {
496 dlp = TAILQ_PREV(dlp, tqh, l_list);
497 } else if (dlp->l_lineno < start) {
498 ndlp = TAILQ_NEXT(dlp, l_list);
499 if (ndlp->l_lineno > start)
510 insert_after = TAILQ_PREV(dlp, tqh, l_list);
511 for (i = 0; i <= (end - start); i++) {
512 ndlp = TAILQ_NEXT(dlp, l_list);
513 TAILQ_REMOVE(&(dlines->l_lines), dlp, l_list);
519 if (op == 'a' || op == 'c') {
522 lp = TAILQ_NEXT(lp, l_list);
526 if (!memcmp(lp->l_line, ".", 1))
529 TAILQ_REMOVE(&(plines->l_lines), lp, l_list);
530 TAILQ_INSERT_AFTER(&(dlines->l_lines), dlp,
534 lp->l_lineno = start;
540 * always resort lines as the markers might be put at the
541 * same line as we first started editing.
544 TAILQ_FOREACH(sort, &(dlines->l_lines), l_list)
545 sort->l_lineno = lineno++;
546 dlines->l_nblines = lineno - 1;
553 * Pick up the line numbers of all changes from one change file.
554 * (This puts the numbers in a vector, which is not strictly necessary,
555 * since the vector is processed in one sequential pass.
556 * The vector could be optimized out of existence)
558 static const struct got_error *
559 readin(size_t *n, char *name, struct diff **dd, struct diff3_state *d3s)
561 const struct got_error *err = NULL;
568 d3s->fp[0] = fopen(name, "r");
569 if (d3s->fp[0] == NULL)
570 return got_error_from_errno();
571 for (i = 0; (p = getchange(d3s->fp[0], d3s)); i++) {
572 if (i >= d3s->szchanges - 1) {
594 (*dd)[i].old.from = a;
596 (*dd)[i].new.from = c;
601 (*dd)[i].old.from = (*dd)[i-1].old.to;
602 (*dd)[i].new.from = (*dd)[i-1].new.to;
605 (void)fclose(d3s->fp[0]);
617 while (isdigit((unsigned char)(**lc)))
618 nn = nn*10 + *(*lc)++ - '0';
624 getchange(FILE *b, struct diff3_state *d3s)
628 while ((line = get_line(b, NULL, d3s))) {
629 if (isdigit((unsigned char)line[0]))
637 get_line(FILE *b, size_t *n, struct diff3_state *d3s)
643 if ((cp = fgetln(b, &len)) == NULL)
646 if (cp[len - 1] != '\n')
648 if (len + 1 > d3s->bufsize) {
650 d3s->bufsize += 1024;
651 } while (len + 1 > d3s->bufsize);
652 new = reallocarray(d3s->buf, 1, d3s->bufsize);
657 memcpy(d3s->buf, cp, len - 1);
658 d3s->buf[len - 1] = '\n';
659 d3s->buf[len] = '\0';
667 merge(size_t m1, size_t m2, struct diff3_state *d3s)
669 struct diff *d1, *d2, *d3;
676 t1 = (d1 < d3s->d13 + m1);
677 t2 = (d2 < d3s->d23 + m2);
682 printf("%d,%d=%d,%d %d,%d=%d,%d\n",
683 d1->old.from, d1->old.to,
684 d1->new.from, d1->new.to,
685 d2->old.from, d2->old.to,
686 d2->new.from, d2->new.to);
689 /* first file is different from others */
690 if (!t2 || (t1 && d1->new.to < d2->new.from)) {
691 /* stuff peculiar to 1st file */
692 if (d3s->eflag == 0) {
694 change(1, &d1->old, 0, d3s);
695 keep(2, &d1->new, d3s);
696 change(3, &d1->new, 0, d3s);
702 /* second file is different from others */
703 if (!t1 || (t2 && d2->new.to < d1->new.from)) {
704 if (d3s->eflag == 0) {
706 keep(1, &d2->new, d3s);
707 change(2, &d2->old, 0, d3s);
708 change(3, &d2->new, 0, d3s);
715 * Merge overlapping changes in first file
716 * this happens after extension (see below).
718 if (d1 + 1 < d3s->d13 + m1 && d1->new.to >= d1[1].new.from) {
719 d1[1].old.from = d1->old.from;
720 d1[1].new.from = d1->new.from;
725 /* merge overlapping changes in second */
726 if (d2 + 1 < d3s->d23 + m2 && d2->new.to >= d2[1].new.from) {
727 d2[1].old.from = d2->old.from;
728 d2[1].new.from = d2->new.from;
732 /* stuff peculiar to third file or different in all */
733 if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {
734 dpl = duplicate(&d1->old, &d2->old, d3s);
739 * dpl = 0 means all files differ
740 * dpl = 1 means files 1 and 2 identical
742 if (d3s->eflag == 0) {
743 separate(dpl ? "3" : "", d3s);
744 change(1, &d1->old, dpl, d3s);
745 change(2, &d2->old, 0, d3s);
746 d3 = d1->old.to > d1->old.from ? d1 : d2;
747 change(3, &d3->new, 0, d3s);
749 j = edit(d1, dpl, j, d3s);
756 * Overlapping changes from file 1 and 2; extend changes
757 * appropriately to make them coincide.
759 if (d1->new.from < d2->new.from) {
760 d2->old.from -= d2->new.from-d1->new.from;
761 d2->new.from = d1->new.from;
762 } else if (d2->new.from < d1->new.from) {
763 d1->old.from -= d1->new.from-d2->new.from;
764 d1->new.from = d2->new.from;
766 if (d1->new.to > d2->new.to) {
767 d2->old.to += d1->new.to - d2->new.to;
768 d2->new.to = d1->new.to;
769 } else if (d2->new.to > d1->new.to) {
770 d1->old.to += d2->new.to - d1->new.to;
771 d1->new.to = d2->new.to;
775 return (edscript(j, d3s));
779 separate(const char *s, struct diff3_state *d3s)
781 diff_output(d3s->diffbuf, "====%s\n", s);
785 * The range of lines rold.from thru rold.to in file i is to be changed.
786 * It is to be printed only if it does not duplicate something to be
790 change(int i, struct range *rold, int fdup, struct diff3_state *d3s)
792 diff_output(d3s->diffbuf, "%d:", i);
793 d3s->last[i] = rold->to;
795 if (fdup || d3s->debug)
798 (void)skip(i, rold->from, NULL, d3s);
799 (void)skip(i, rold->to, " ", d3s);
803 * print the range of line numbers, rold.from thru rold.to, as n1,n2 or n1
806 prange(struct range *rold, struct diff3_state *d3s)
808 if (rold->to <= rold->from)
809 diff_output(d3s->diffbuf, "%da\n", rold->from - 1);
811 diff_output(d3s->diffbuf, "%d", rold->from);
812 if (rold->to > rold->from+1)
813 diff_output(d3s->diffbuf, ",%d", rold->to - 1);
814 diff_output(d3s->diffbuf, "c\n");
819 * No difference was reported by diff between file 1 (or 2) and file 3,
820 * and an artificial dummy difference (trange) must be ginned up to
821 * correspond to the change reported in the other file.
824 keep(int i, struct range *rnew, struct diff3_state *d3s)
829 delta = d3s->last[3] - d3s->last[i];
830 trange.from = rnew->from - delta;
831 trange.to = rnew->to - delta;
832 change(i, &trange, 1, d3s);
836 * skip to just before line number from in file "i". If "pr" is non-NULL,
837 * print all skipped stuff with string pr as a prefix.
840 skip(int i, int from, char *pr, struct diff3_state *d3s)
845 for (n = 0; d3s->cline[i] < from - 1; n += j) {
846 if ((line = get_line(d3s->fp[i], &j, d3s)) == NULL)
849 diff_output(d3s->diffbuf, "%s%s", pr, line);
856 * Return 1 or 0 according as the old range (in file 1) contains exactly
857 * the same data as the new range (in file 2).
860 duplicate(struct range *r1, struct range *r2, struct diff3_state *d3s)
866 if (r1->to-r1->from != r2->to-r2->from)
868 (void)skip(0, r1->from, NULL, d3s);
869 (void)skip(1, r2->from, NULL, d3s);
871 for (nline=0; nline < r1->to - r1->from; nline++) {
873 c = getc(d3s->fp[0]);
874 d = getc(d3s->fp[1]);
875 if (c == -1 || d== -1)
889 repos(int nchar, struct diff3_state *d3s)
893 for (i = 0; i < 2; i++)
894 (void)fseek(d3s->fp[i], (long)-nchar, SEEK_CUR);
898 * collect an editing script for later regurgitation
901 edit(struct diff *diff, int fdup, int j, struct diff3_state *d3s)
903 if (((fdup + 1) & d3s->eflag) == 0)
906 d3s->overlap[j] = !fdup;
909 d3s->de[j].old.from = diff->old.from;
910 d3s->de[j].old.to = diff->old.to;
911 d3s->de[j].new.from =
912 d3s->de[j-1].new.to + skip(2, diff->new.from, NULL, d3s);
914 d3s->de[j].new.from + skip(2, diff->new.to, NULL, d3s);
920 edscript(int n, struct diff3_state *d3s)
923 char block[BUFSIZ+1];
926 if (!d3s->oflag || !d3s->overlap[n])
927 prange(&d3s->de[n].old, d3s);
929 diff_output(d3s->diffbuf, "%da\n=======\n",
930 d3s->de[n].old.to -1);
931 (void)fseek(d3s->fp[2], (long)d3s->de[n].new.from, SEEK_SET);
932 k = d3s->de[n].new.to - d3s->de[n].new.from;
933 for (; k > 0; k-= j) {
934 j = k > BUFSIZ ? BUFSIZ : k;
935 if (fread(block, 1, j, d3s->fp[2]) != (size_t)j)
938 diff_output(d3s->diffbuf, "%s", block);
941 if (!d3s->oflag || !d3s->overlap[n])
942 diff_output(d3s->diffbuf, ".\n");
944 diff_output(d3s->diffbuf, "%s\n.\n", d3s->f3mark);
945 diff_output(d3s->diffbuf, "%da\n%s\n.\n",
946 d3s->de[n].old.from - 1, d3s->f1mark);
950 return (d3s->overlapcnt);
953 static const struct got_error *
954 increase(struct diff3_state *d3s)
960 /* are the memset(3) calls needed? */
961 newsz = d3s->szchanges == 0 ? 64 : 2 * d3s->szchanges;
962 incr = newsz - d3s->szchanges;
964 d = reallocarray(d3s->d13, newsz, sizeof(*d3s->d13));
966 return got_error_from_errno();
968 memset(d3s->d13 + d3s->szchanges, 0, incr * sizeof(*d3s->d13));
970 d = reallocarray(d3s->d23, newsz, sizeof(*d3s->d23));
972 return got_error_from_errno();
974 memset(d3s->d23 + d3s->szchanges, 0, incr * sizeof(*d3s->d23));
976 d = reallocarray(d3s->de, newsz, sizeof(*d3s->de));
978 return got_error_from_errno();
980 memset(d3s->de + d3s->szchanges, 0, incr * sizeof(*d3s->de));
982 s = reallocarray(d3s->overlap, newsz, sizeof(*d3s->overlap));
984 return got_error_from_errno();
986 memset(d3s->overlap + d3s->szchanges, 0, incr * sizeof(*d3s->overlap));
987 d3s->szchanges = newsz;