Annotation of src/usr.bin/cvs/diff3.c, Revision 1.40
1.40 ! tobias 1: /* $OpenBSD: diff3.c,v 1.39 2007/09/17 10:07:21 tobias Exp $ */
1.1 joris 2:
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: */
66:
67: #ifndef lint
68: static const char copyright[] =
69: "@(#) Copyright (c) 1991, 1993\n\
70: The Regents of the University of California. All rights reserved.\n";
71: #endif /* not lint */
72:
73: #ifndef lint
1.11 reyk 74: static const char rcsid[] =
1.40 ! tobias 75: "$OpenBSD: diff3.c,v 1.39 2007/09/17 10:07:21 tobias Exp $";
1.1 joris 76: #endif /* not lint */
77:
1.35 otto 78: #include <ctype.h>
79: #include <errno.h>
80: #include <fcntl.h>
1.38 tobias 81: #include <stdio.h>
1.35 otto 82: #include <stdlib.h>
83: #include <string.h>
84: #include <unistd.h>
1.1 joris 85:
1.39 tobias 86: #include "atomicio.h"
1.1 joris 87: #include "cvs.h"
88: #include "diff.h"
89:
90: /* diff3 - 3-way differential file comparison */
91:
92: /* diff3 [-ex3EX] d13 d23 f1 f2 f3 [m1 m3]
93: *
94: * d13 = diff report on f1 vs f3
95: * d23 = diff report on f2 vs f3
96: * f1, f2, f3 the 3 files
97: * if changes in f1 overlap with changes in f3, m1 and m3 are used
98: * to mark the overlaps; otherwise, the file names f1 and f3 are used
99: * (only for options E and X).
100: */
101:
102: /*
103: * "from" is first in range of changed lines; "to" is last+1
104: * from=to=line after point of insertion for added lines.
105: */
106: struct range {
107: int from;
108: int to;
109: };
110:
111: struct diff {
112: struct range old;
113: struct range new;
114: };
115:
116: static size_t szchanges;
117:
118: static struct diff *d13;
119: static struct diff *d23;
120:
121: /*
122: * "de" is used to gather editing scripts. These are later spewed out in
123: * reverse order. Its first element must be all zero, the "new" component
124: * of "de" contains line positions or byte positions depending on when you
125: * look (!?). Array overlap indicates which sections in "de" correspond to
126: * lines that are different in all three files.
127: */
128: static struct diff *de;
129: static char *overlap;
1.2 joris 130: static int overlapcnt = 0;
1.1 joris 131: static FILE *fp[3];
132: static int cline[3]; /* # of the last-read line in each file (0-2) */
133:
134: /*
135: * the latest known correspondence between line numbers of the 3 files
136: * is stored in last[1-3];
137: */
138: static int last[4];
139: static int eflag;
140: static int oflag; /* indicates whether to mark overlaps (-E or -X)*/
141: static int debug = 0;
1.33 joris 142: static char f1mark[MAXPATHLEN], f3mark[MAXPATHLEN]; /* markers for -E and -X */
1.1 joris 143:
144: static int duplicate(struct range *, struct range *);
145: static int edit(struct diff *, int, int);
146: static char *getchange(FILE *);
147: static char *getline(FILE *, size_t *);
148: static int number(char **);
1.20 ray 149: static size_t readin(char *, struct diff **);
1.1 joris 150: static int skip(int, int, char *);
151: static int edscript(int);
1.20 ray 152: static int merge(size_t, size_t);
1.1 joris 153: static void change(int, struct range *, int);
154: static void keep(int, struct range *);
155: static void prange(struct range *);
156: static void repos(int);
157: static void separate(const char *);
158: static void increase(void);
159: static int diff3_internal(int, char **, const char *, const char *);
160:
1.5 xsa 161: int diff3_conflicts = 0;
1.4 joris 162:
1.33 joris 163: void
164: cvs_merge_file(struct cvs_file *cf, int verbose)
1.1 joris 165: {
1.19 xsa 166: int argc;
1.1 joris 167: char *data, *patch;
1.37 xsa 168: char *argv[5], r1[CVS_REV_BUFSZ], r2[CVS_REV_BUFSZ];
1.28 xsa 169: char *dp13, *dp23, *path1, *path2, *path3;
1.1 joris 170: BUF *b1, *b2, *b3, *d1, *d2, *diffb;
1.30 niallo 171: size_t dlen, plen;
1.33 joris 172: struct cvs_line *lp;
173: struct cvs_lines *dlines, *plines;
1.1 joris 174:
175: b1 = b2 = b3 = d1 = d2 = diffb = NULL;
1.33 joris 176: rcsnum_tostr(cf->file_ent->ce_rev, r1, sizeof(r1));
177: rcsnum_tostr(cf->file_rcsrev, r2, sizeof(r2));
1.1 joris 178:
1.40 ! tobias 179: b1 = cvs_buf_load_fd(cf->fd);
! 180: d1 = cvs_buf_alloc(128);
! 181: d2 = cvs_buf_alloc(128);
! 182: diffb = cvs_buf_alloc(128);
1.1 joris 183:
1.33 joris 184: (void)close(cf->fd);
185: cf->fd = open(cf->file_path, O_WRONLY | O_TRUNC);
186: if (cf->fd == -1) {
187: fatal("cvs_merge_file: failed to reopen fd for writing: %s",
188: strerror(errno));
189: }
190:
1.28 xsa 191: (void)xasprintf(&path1, "%s/diff1.XXXXXXXXXX", cvs_tmpdir);
192: (void)xasprintf(&path2, "%s/diff2.XXXXXXXXXX", cvs_tmpdir);
193: (void)xasprintf(&path3, "%s/diff3.XXXXXXXXXX", cvs_tmpdir);
194:
1.26 ray 195: cvs_buf_write_stmp(b1, path1, NULL);
1.32 niallo 196: if (verbose == 1)
197: cvs_printf("Retrieving revision %s\n", r1);
1.33 joris 198: rcs_rev_write_stmp(cf->file_rcs, cf->file_ent->ce_rev, path2, 0);
1.32 niallo 199: if (verbose == 1)
200: cvs_printf("Retrieving revision %s\n", r2);
1.33 joris 201: rcs_rev_write_stmp(cf->file_rcs, cf->file_rcsrev, path3, 0);
1.1 joris 202:
203: cvs_diffreg(path1, path3, d1);
204: cvs_diffreg(path2, path3, d2);
205:
1.28 xsa 206: (void)xasprintf(&dp13, "%s/d13.XXXXXXXXXX", cvs_tmpdir);
1.26 ray 207: cvs_buf_write_stmp(d1, dp13, NULL);
1.1 joris 208: cvs_buf_free(d1);
209:
1.28 xsa 210: (void)xasprintf(&dp23, "%s/d23.XXXXXXXXXX", cvs_tmpdir);
1.26 ray 211: cvs_buf_write_stmp(d2, dp23, NULL);
1.1 joris 212: cvs_buf_free(d2);
213:
214: argc = 0;
215: diffbuf = diffb;
216: argv[argc++] = dp13;
217: argv[argc++] = dp23;
218: argv[argc++] = path1;
219: argv[argc++] = path2;
220: argv[argc++] = path3;
1.7 joris 221:
1.33 joris 222: diff3_conflicts = diff3_internal(argc, argv, cf->file_path, r2);
223: if (diff3_conflicts < 0)
224: fatal("cvs_merge_file: merging failed for an unknown reason");
1.1 joris 225:
1.30 niallo 226: plen = cvs_buf_len(diffb);
1.1 joris 227: patch = cvs_buf_release(diffb);
1.30 niallo 228: dlen = cvs_buf_len(b1);
1.1 joris 229: data = cvs_buf_release(b1);
230:
1.33 joris 231: cvs_printf("Merging differences between %s and %s into `%s'\n",
232: r1, r2, cf->file_path);
233:
234: dlines = cvs_splitlines(data, dlen);
235: plines = cvs_splitlines(patch, plen);
236: ed_patch_lines(dlines, plines);
237: cvs_freelines(plines);
1.7 joris 238:
1.23 deraadt 239: if (verbose == 1 && diff3_conflicts != 0) {
1.24 joris 240: cvs_log(LP_ERR, "%d conflict%s found during merge, "
1.16 xsa 241: "please correct.", diff3_conflicts,
1.11 reyk 242: (diff3_conflicts > 1) ? "s" : "");
1.7 joris 243: }
1.1 joris 244:
1.33 joris 245: TAILQ_FOREACH(lp, &(dlines->l_lines), l_list) {
246: if (lp->l_line == NULL)
247: continue;
248:
1.39 tobias 249: if (atomicio(vwrite, cf->fd, lp->l_line, lp->l_len) !=
250: lp->l_len)
1.33 joris 251: fatal("cvs_merge_file: %s", strerror(errno));
252: }
253:
254: cvs_freelines(dlines);
255:
256: if (data != NULL)
257: xfree(data);
1.8 joris 258: xfree(patch);
1.1 joris 259:
260: (void)unlink(path1);
261: (void)unlink(path2);
262: (void)unlink(path3);
263: (void)unlink(dp13);
264: (void)unlink(dp23);
1.28 xsa 265:
1.33 joris 266: xfree(path1);
267: xfree(path2);
268: xfree(path3);
269: xfree(dp13);
270: xfree(dp23);
1.1 joris 271: }
272:
273: static int
274: diff3_internal(int argc, char **argv, const char *fmark, const char *rmark)
275: {
1.20 ray 276: size_t m, n;
277: int i;
1.1 joris 278:
279: /* XXX */
280: eflag = 3;
281: oflag = 1;
282:
283: if (argc < 5)
284: return (-1);
285:
1.34 xsa 286: (void)xsnprintf(f1mark, sizeof(f1mark), "<<<<<<< %s", fmark);
287: (void)xsnprintf(f3mark, sizeof(f3mark), ">>>>>>> %s", rmark);
1.1 joris 288:
289: increase();
290: m = readin(argv[0], &d13);
291: n = readin(argv[1], &d23);
292:
293: for (i = 0; i <= 2; i++) {
294: if ((fp[i] = fopen(argv[i + 2], "r")) == NULL) {
1.24 joris 295: cvs_log(LP_ERR, "%s", argv[i + 2]);
1.1 joris 296: return (-1);
297: }
298: }
299:
300: return (merge(m, n));
301: }
302:
303: int
304: ed_patch_lines(struct cvs_lines *dlines, struct cvs_lines *plines)
305: {
306: char op, *ep;
1.29 xsa 307: struct cvs_line *sort, *lp, *dlp, *ndlp, *insert_after;
1.19 xsa 308: int start, end, i, lineno;
1.30 niallo 309: u_char tmp;
1.1 joris 310:
311: dlp = TAILQ_FIRST(&(dlines->l_lines));
312: lp = TAILQ_FIRST(&(plines->l_lines));
313:
1.19 xsa 314: end = 0;
1.1 joris 315: for (lp = TAILQ_NEXT(lp, l_list); lp != NULL;
316: lp = TAILQ_NEXT(lp, l_list)) {
1.30 niallo 317: /* Skip blank lines */
318: if (lp->l_len < 2)
319: continue;
320: /* NUL-terminate line buffer for strtol() safety. */
321: tmp = lp->l_line[lp->l_len - 1];
322: lp->l_line[lp->l_len - 1] = '\0';
323: /* len - 1 is NUL terminator so we use len - 2 for 'op' */
1.1 joris 324: op = lp->l_line[strlen(lp->l_line) - 1];
325: start = (int)strtol(lp->l_line, &ep, 10);
1.30 niallo 326: /* Restore the last byte of the buffer */
327: lp->l_line[lp->l_len - 1] = tmp;
1.1 joris 328: if (op == 'a') {
1.23 deraadt 329: if (start > dlines->l_nblines ||
330: start < 0 || *ep != 'a')
1.15 niallo 331: fatal("ed_patch_lines");
1.1 joris 332: } else if (op == 'c') {
1.23 deraadt 333: if (start > dlines->l_nblines ||
334: start < 0 || (*ep != ',' && *ep != 'c'))
1.15 niallo 335: fatal("ed_patch_lines");
1.1 joris 336:
1.2 joris 337: if (*ep == ',') {
338: ep++;
339: end = (int)strtol(ep, &ep, 10);
1.23 deraadt 340: if (end < 0 || *ep != 'c')
1.15 niallo 341: fatal("ed_patch_lines");
1.2 joris 342: } else {
343: end = start;
344: }
1.1 joris 345: }
346:
1.2 joris 347:
1.1 joris 348: for (;;) {
349: if (dlp == NULL)
350: break;
351: if (dlp->l_lineno == start)
352: break;
353: if (dlp->l_lineno > start) {
354: dlp = TAILQ_PREV(dlp, cvs_tqh, l_list);
355: } else if (dlp->l_lineno < start) {
356: ndlp = TAILQ_NEXT(dlp, l_list);
357: if (ndlp->l_lineno > start)
358: break;
359: dlp = ndlp;
360: }
361: }
362:
363: if (dlp == NULL)
1.15 niallo 364: fatal("ed_patch_lines");
1.1 joris 365:
1.2 joris 366:
1.1 joris 367: if (op == 'c') {
1.29 xsa 368: insert_after = TAILQ_PREV(dlp, cvs_tqh, l_list);
1.2 joris 369: for (i = 0; i <= (end - start); i++) {
1.1 joris 370: ndlp = TAILQ_NEXT(dlp, l_list);
371: TAILQ_REMOVE(&(dlines->l_lines), dlp, l_list);
372: dlp = ndlp;
373: }
1.29 xsa 374: dlp = insert_after;
1.1 joris 375: }
376:
377: if (op == 'a' || op == 'c') {
378: for (;;) {
379: ndlp = lp;
380: lp = TAILQ_NEXT(lp, l_list);
381: if (lp == NULL)
1.15 niallo 382: fatal("ed_patch_lines");
1.1 joris 383:
1.30 niallo 384: if (!memcmp(lp->l_line, ".", 1))
1.1 joris 385: break;
386:
387: TAILQ_REMOVE(&(plines->l_lines), lp, l_list);
388: TAILQ_INSERT_AFTER(&(dlines->l_lines), dlp,
389: lp, l_list);
390: dlp = lp;
391:
392: lp->l_lineno = start;
393: lp = ndlp;
394: }
395: }
396:
397: /*
398: * always resort lines as the markers might be put at the
399: * same line as we first started editing.
400: */
401: lineno = 0;
402: TAILQ_FOREACH(sort, &(dlines->l_lines), l_list)
403: sort->l_lineno = lineno++;
404: dlines->l_nblines = lineno - 1;
405: }
406:
407: return (0);
408: }
409:
410: /*
411: * Pick up the line numbers of all changes from one change file.
412: * (This puts the numbers in a vector, which is not strictly necessary,
413: * since the vector is processed in one sequential pass.
414: * The vector could be optimized out of existence)
415: */
1.20 ray 416: static size_t
1.1 joris 417: readin(char *name, struct diff **dd)
418: {
419: int a, b, c, d;
420: char kind, *p;
421: size_t i;
422:
423: fp[0] = fopen(name, "r");
424: for (i = 0; (p = getchange(fp[0])); i++) {
425: if (i >= szchanges - 1)
426: increase();
427: a = b = number(&p);
428: if (*p == ',') {
429: p++;
430: b = number(&p);
431: }
432: kind = *p++;
433: c = d = number(&p);
434: if (*p==',') {
435: p++;
436: d = number(&p);
437: }
438: if (kind == 'a')
439: a++;
440: if (kind == 'd')
441: c++;
442: b++;
443: d++;
444: (*dd)[i].old.from = a;
445: (*dd)[i].old.to = b;
446: (*dd)[i].new.from = c;
447: (*dd)[i].new.to = d;
448: }
449:
1.14 xsa 450: if (i) {
451: (*dd)[i].old.from = (*dd)[i-1].old.to;
452: (*dd)[i].new.from = (*dd)[i-1].new.to;
453: }
1.1 joris 454: (void)fclose(fp[0]);
455:
456: return (i);
457: }
458:
459: static int
460: number(char **lc)
461: {
462: int nn;
463:
464: nn = 0;
465: while (isdigit((unsigned char)(**lc)))
466: nn = nn*10 + *(*lc)++ - '0';
467:
468: return (nn);
469: }
470:
471: static char *
472: getchange(FILE *b)
473: {
474: char *line;
475:
476: while ((line = getline(b, NULL))) {
477: if (isdigit((unsigned char)line[0]))
478: return (line);
479: }
480:
481: return (NULL);
482: }
483:
484: static char *
485: getline(FILE *b, size_t *n)
486: {
487: char *cp;
488: size_t len;
489: static char *buf;
490: static size_t bufsize;
491:
492: if ((cp = fgetln(b, &len)) == NULL)
493: return (NULL);
494:
495: if (cp[len - 1] != '\n')
496: len++;
497: if (len + 1 > bufsize) {
498: do {
499: bufsize += 1024;
500: } while (len + 1 > bufsize);
1.36 ray 501: buf = xrealloc(buf, 1, bufsize);
1.1 joris 502: }
503: memcpy(buf, cp, len - 1);
504: buf[len - 1] = '\n';
505: buf[len] = '\0';
506: if (n != NULL)
507: *n = len;
508:
509: return (buf);
510: }
511:
512: static int
1.20 ray 513: merge(size_t m1, size_t m2)
1.1 joris 514: {
515: struct diff *d1, *d2, *d3;
516: int dpl, j, t1, t2;
517:
518: d1 = d13;
519: d2 = d23;
520: j = 0;
521: while ((t1 = d1 < d13 + m1) | (t2 = d2 < d23 + m2)) {
522: if (debug) {
523: printf("%d,%d=%d,%d %d,%d=%d,%d\n",
1.20 ray 524: d1->old.from, d1->old.to,
525: d1->new.from, d1->new.to,
526: d2->old.from, d2->old.to,
527: d2->new.from, d2->new.to);
1.1 joris 528: }
529:
530: /* first file is different from others */
531: if (!t2 || (t1 && d1->new.to < d2->new.from)) {
532: /* stuff peculiar to 1st file */
533: if (eflag==0) {
534: separate("1");
535: change(1, &d1->old, 0);
536: keep(2, &d1->new);
537: change(3, &d1->new, 0);
538: }
539: d1++;
540: continue;
541: }
542:
543: /* second file is different from others */
544: if (!t1 || (t2 && d2->new.to < d1->new.from)) {
545: if (eflag==0) {
546: separate("2");
547: keep(1, &d2->new);
548: change(2, &d2->old, 0);
549: change(3, &d2->new, 0);
550: }
551: d2++;
552: continue;
553: }
554:
555: /*
556: * Merge overlapping changes in first file
557: * this happens after extension (see below).
558: */
559: if (d1 + 1 < d13 + m1 && d1->new.to >= d1[1].new.from) {
560: d1[1].old.from = d1->old.from;
561: d1[1].new.from = d1->new.from;
562: d1++;
563: continue;
564: }
565:
566: /* merge overlapping changes in second */
567: if (d2 + 1 < d23 + m2 && d2->new.to >= d2[1].new.from) {
568: d2[1].old.from = d2->old.from;
569: d2[1].new.from = d2->new.from;
570: d2++;
571: continue;
572: }
573: /* stuff peculiar to third file or different in all */
574: if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {
575: dpl = duplicate(&d1->old,&d2->old);
576: if (dpl == -1)
577: return (-1);
578:
579: /*
580: * dpl = 0 means all files differ
581: * dpl = 1 means files 1 and 2 identical
582: */
583: if (eflag==0) {
584: separate(dpl ? "3" : "");
585: change(1, &d1->old, dpl);
586: change(2, &d2->old, 0);
587: d3 = d1->old.to > d1->old.from ? d1 : d2;
588: change(3, &d3->new, 0);
589: } else
590: j = edit(d1, dpl, j);
591: d1++;
592: d2++;
593: continue;
594: }
595:
596: /*
597: * Overlapping changes from file 1 and 2; extend changes
598: * appropriately to make them coincide.
599: */
600: if (d1->new.from < d2->new.from) {
601: d2->old.from -= d2->new.from-d1->new.from;
602: d2->new.from = d1->new.from;
603: } else if (d2->new.from < d1->new.from) {
604: d1->old.from -= d1->new.from-d2->new.from;
605: d1->new.from = d2->new.from;
606: }
607: if (d1->new.to > d2->new.to) {
608: d2->old.to += d1->new.to - d2->new.to;
609: d2->new.to = d1->new.to;
610: } else if (d2->new.to > d1->new.to) {
611: d1->old.to += d2->new.to - d1->new.to;
612: d1->new.to = d2->new.to;
613: }
614: }
615:
616: return (edscript(j));
617: }
618:
619: static void
620: separate(const char *s)
621: {
622: diff_output("====%s\n", s);
623: }
624:
625: /*
626: * The range of lines rold.from thru rold.to in file i is to be changed.
627: * It is to be printed only if it does not duplicate something to be
628: * printed later.
629: */
630: static void
631: change(int i, struct range *rold, int fdup)
632: {
633: diff_output("%d:", i);
634: last[i] = rold->to;
635: prange(rold);
636: if (fdup || debug)
637: return;
638: i--;
639: (void)skip(i, rold->from, NULL);
640: (void)skip(i, rold->to, " ");
641: }
642:
643: /*
644: * print the range of line numbers, rold.from thru rold.to, as n1,n2 or n1
645: */
646: static void
647: prange(struct range *rold)
648: {
649: if (rold->to <= rold->from)
650: diff_output("%da\n", rold->from - 1);
651: else {
652: diff_output("%d", rold->from);
653: if (rold->to > rold->from+1)
654: diff_output(",%d", rold->to - 1);
655: diff_output("c\n");
656: }
657: }
658:
659: /*
660: * No difference was reported by diff between file 1 (or 2) and file 3,
661: * and an artificial dummy difference (trange) must be ginned up to
662: * correspond to the change reported in the other file.
663: */
664: static void
665: keep(int i, struct range *rnew)
666: {
667: int delta;
668: struct range trange;
669:
670: delta = last[3] - last[i];
671: trange.from = rnew->from - delta;
672: trange.to = rnew->to - delta;
673: change(i, &trange, 1);
674: }
675:
676: /*
677: * skip to just before line number from in file "i". If "pr" is non-NULL,
678: * print all skipped stuff with string pr as a prefix.
679: */
680: static int
681: skip(int i, int from, char *pr)
682: {
683: size_t j, n;
684: char *line;
685:
686: for (n = 0; cline[i] < from - 1; n += j) {
687: if ((line = getline(fp[i], &j)) == NULL)
688: return (-1);
689: if (pr != NULL)
690: diff_output("%s%s", pr, line);
691: cline[i]++;
692: }
693: return ((int) n);
694: }
695:
696: /*
697: * Return 1 or 0 according as the old range (in file 1) contains exactly
698: * the same data as the new range (in file 2).
699: */
700: static int
701: duplicate(struct range *r1, struct range *r2)
702: {
703: int c,d;
704: int nchar;
705: int nline;
706:
707: if (r1->to-r1->from != r2->to-r2->from)
708: return (0);
709: (void)skip(0, r1->from, NULL);
710: (void)skip(1, r2->from, NULL);
711: nchar = 0;
712: for (nline=0; nline < r1->to - r1->from; nline++) {
713: do {
714: c = getc(fp[0]);
715: d = getc(fp[1]);
716: if (c == -1 || d== -1)
717: return (-1);
718: nchar++;
719: if (c != d) {
720: repos(nchar);
721: return (0);
722: }
723: } while (c != '\n');
724: }
725: repos(nchar);
726: return (1);
727: }
728:
729: static void
730: repos(int nchar)
731: {
732: int i;
733:
734: for (i = 0; i < 2; i++)
1.38 tobias 735: (void)fseek(fp[i], (long)-nchar, SEEK_CUR);
1.1 joris 736: }
737:
738: /*
739: * collect an editing script for later regurgitation
740: */
741: static int
742: edit(struct diff *diff, int fdup, int j)
743: {
744: if (((fdup + 1) & eflag) == 0)
745: return (j);
746: j++;
747: overlap[j] = !fdup;
748: if (!fdup)
749: overlapcnt++;
750: de[j].old.from = diff->old.from;
751: de[j].old.to = diff->old.to;
752: de[j].new.from = de[j-1].new.to + skip(2, diff->new.from, NULL);
753: de[j].new.to = de[j].new.from + skip(2, diff->new.to, NULL);
754: return (j);
755: }
756:
757: /* regurgitate */
758: static int
759: edscript(int n)
760: {
761: int j, k;
1.2 joris 762: char block[BUFSIZ+1];
1.1 joris 763:
764: for (n = n; n > 0; n--) {
765: if (!oflag || !overlap[n])
766: prange(&de[n].old);
767: else
768: diff_output("%da\n=======\n", de[n].old.to -1);
1.38 tobias 769: (void)fseek(fp[2], (long)de[n].new.from, SEEK_SET);
1.1 joris 770: for (k = de[n].new.to-de[n].new.from; k > 0; k-= j) {
771: j = k > BUFSIZ ? BUFSIZ : k;
1.11 reyk 772: if (fread(block, (size_t)1, (size_t)j,
773: fp[2]) != (size_t)j)
1.1 joris 774: return (-1);
775: block[j] = '\0';
776: diff_output("%s", block);
777: }
1.2 joris 778:
1.1 joris 779: if (!oflag || !overlap[n])
780: diff_output(".\n");
781: else {
782: diff_output("%s\n.\n", f3mark);
783: diff_output("%da\n%s\n.\n", de[n].old.from - 1, f1mark);
784: }
785: }
786:
787: return (overlapcnt);
788: }
789:
790: static void
791: increase(void)
792: {
793: size_t newsz, incr;
794:
795: /* are the memset(3) calls needed? */
796: newsz = szchanges == 0 ? 64 : 2 * szchanges;
797: incr = newsz - szchanges;
798:
1.36 ray 799: d13 = xrealloc(d13, newsz, sizeof(*d13));
800: memset(d13 + szchanges, 0, incr * sizeof(*d13));
801: d23 = xrealloc(d23, newsz, sizeof(*d23));
802: memset(d23 + szchanges, 0, incr * sizeof(*d23));
803: de = xrealloc(de, newsz, sizeof(*de));
804: memset(de + szchanges, 0, incr * sizeof(*de));
805: overlap = xrealloc(overlap, newsz, sizeof(*overlap));
806: memset(overlap + szchanges, 0, incr * sizeof(*overlap));
1.1 joris 807: szchanges = newsz;
808: }
![[BACK]](/icons/back.gif){kind=icon}
Return to diff3.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / cvs