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];
143 char f1mark[PATH_MAX], f3mark[PATH_MAX]; /* markers for -E and -X */
151 static const struct got_error *duplicate(int *, struct range *, struct range *,
152 struct diff3_state *);
153 static const struct got_error *edit(struct diff *, int, int *,
154 struct diff3_state *);
155 static const struct got_error *getchange(char **, FILE *, struct diff3_state *);
156 static const struct got_error *get_line(char **, FILE *, size_t *,
157 struct diff3_state *);
158 static int number(char **);
159 static const struct got_error *readin(size_t *, char *, struct diff **,
160 struct diff3_state *);
161 static int ed_patch_lines(struct rcs_lines *, struct rcs_lines *);
162 static const struct got_error *skip(int *, int, int, char *,
163 struct diff3_state *);
164 static const struct got_error *edscript(int, struct diff3_state *);
165 static const struct got_error *merge(size_t, size_t, struct diff3_state *);
166 static const struct got_error *prange(struct range *, struct diff3_state *);
167 static const struct got_error *repos(int, struct diff3_state *);
168 static const struct got_error *increase(struct diff3_state *);
169 static const struct got_error *diff3_internal(char *, char *, char *,
170 char *, char *, const char *, const char *, struct diff3_state *,
171 const char *, const char *);
173 static const struct got_error *
174 diff_output(BUF *diffbuf, const char *fmt, ...)
176 const struct got_error *err = NULL;
183 i = vasprintf(&str, fmt, vap);
186 return got_error_from_errno("vasprintf");
187 err = buf_append(&newsize, diffbuf, str, strlen(str));
192 static const struct got_error*
193 diffreg(BUF **d, const char *path1, const char *path2)
195 const struct got_error *err = NULL;
196 FILE *f1 = NULL, *f2 = NULL, *outfile = NULL;
197 char *outpath = NULL;
198 struct got_diff_state ds;
199 struct got_diff_args args;
204 f1 = fopen(path1, "r");
206 err = got_error_from_errno2("fopen", path1);
209 f2 = fopen(path2, "r");
211 err = got_error_from_errno2("fopen", path2);
215 err = got_opentemp_named(&outpath, &outfile, "/tmp/got-diffreg");
219 memset(&ds, 0, sizeof(ds));
220 /* XXX should stat buffers be passed in args instead of ds? */
221 if (stat(path1, &ds.stb1) == -1) {
222 err = got_error_from_errno2("stat", path1);
225 if (stat(path2, &ds.stb2) == -1) {
226 err = got_error_from_errno2("stat", path2);
230 memset(&args, 0, sizeof(args));
231 args.diff_format = D_NORMAL;
234 args.diff_context = 0;
236 err = got_diffreg(&res, f1, f2, D_FORCEASCII, &args, &ds,
241 if (fflush(outfile) != 0) {
242 err = got_error_from_errno2("fflush", outpath);
246 err = buf_load(d, outpath);
252 if (outfile && fclose(outfile) != 0 && err == NULL)
253 err = got_error_from_errno("fclose");
254 if (f1 && fclose(f1) != 0 && err == NULL)
255 err = got_error_from_errno("fclose");
256 if (f2 && fclose(f2) != 0 && err == NULL)
257 err = got_error_from_errno("fclose");
264 const struct got_error *
265 got_merge_diff3(int *overlapcnt, int outfd, const char *p1, const char *p2,
266 const char *p3, const char *label1, const char *label3)
268 const struct got_error *err = NULL;
269 char *dp13, *dp23, *path1, *path2, *path3;
270 BUF *b1, *b2, *b3, *d1, *d2, *diffb;
271 u_char *data, *patch;
273 struct wklhead temp_files;
274 struct diff3_state *d3s;
279 SLIST_INIT(&temp_files);
281 d3s = calloc(1, sizeof(*d3s));
283 return got_error_from_errno("calloc");
285 b1 = b2 = b3 = d1 = d2 = diffb = NULL;
286 dp13 = dp23 = path1 = path2 = path3 = NULL;
289 err = buf_load(&b1, p1);
292 err = buf_load(&b2, p2);
295 err = buf_load(&b3, p3);
299 err = buf_alloc(&diffb, 128);
303 if (asprintf(&path1, "/tmp/got-diff1.XXXXXXXX") == -1) {
304 err = got_error_from_errno("asprintf");
307 if (asprintf(&path2, "/tmp/got-diff2.XXXXXXXX") == -1) {
308 err = got_error_from_errno("asprintf");
311 if (asprintf(&path3, "/tmp/got-diff3.XXXXXXXX") == -1) {
312 err = got_error_from_errno("asprintf");
316 err = buf_write_stmp(b1, path1, &temp_files);
319 err = buf_write_stmp(b2, path2, &temp_files);
322 err = buf_write_stmp(b3, path3, &temp_files);
329 err = diffreg(&d1, path1, path3);
336 err = diffreg(&d2, path2, path3);
343 if (asprintf(&dp13, "/tmp/got-d13.XXXXXXXXXX") == -1) {
344 err = got_error_from_errno("asprintf");
347 err = buf_write_stmp(d1, dp13, &temp_files);
354 if (asprintf(&dp23, "/tmp/got-d23.XXXXXXXXXX") == -1) {
355 err = got_error_from_errno("asprintf");
358 err = buf_write_stmp(d2, dp23, &temp_files);
365 d3s->diffbuf = diffb;
366 err = diff3_internal(dp13, dp23, path1, path2, path3,
367 label1, label3, d3s, label1, label3);
374 plen = buf_len(diffb);
375 patch = buf_release(diffb);
377 data = buf_release(b1);
379 diffb = rcs_patchfile(data, dlen, patch, plen, ed_patch_lines);
400 worklist_clean(&temp_files, worklist_unlink);
402 for (i = 0; i < nitems(d3s->fp); i++) {
403 if (d3s->fp[i] && fclose(d3s->fp[i]) != 0 && err == NULL)
404 err = got_error_from_errno("fclose");
406 if (err == NULL && diffb) {
407 if (buf_write_fd(diffb, outfd) < 0)
408 err = got_error_from_errno("buf_write_fd");
409 *overlapcnt = d3s->overlapcnt;
416 static const struct got_error *
417 diff3_internal(char *dp13, char *dp23, char *path1, char *path2, char *path3,
418 const char *fmark, const char *rmark, struct diff3_state *d3s,
419 const char *label1, const char *label3)
421 const struct got_error *err = NULL;
425 i = snprintf(d3s->f1mark, sizeof(d3s->f1mark),
426 "%s %s", GOT_DIFF_CONFLICT_MARKER_BEGIN, 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),
431 "%s %s", GOT_DIFF_CONFLICT_MARKER_END, label3);
432 if (i < 0 || i >= (int)sizeof(d3s->f3mark))
433 return got_error(GOT_ERR_NO_SPACE);
439 err = readin(&m, dp13, &d3s->d13, d3s);
442 err = readin(&n, dp23, &d3s->d23, d3s);
446 if ((d3s->fp[0] = fopen(path1, "r")) == NULL)
447 return got_error_from_errno2("fopen", path1);
448 if ((d3s->fp[1] = fopen(path2, "r")) == NULL)
449 return got_error_from_errno2("fopen", path2);
450 if ((d3s->fp[2] = fopen(path3, "r")) == NULL)
451 return got_error_from_errno2("fopen", path3);
453 return merge(m, n, d3s);
457 ed_patch_lines(struct rcs_lines *dlines, struct rcs_lines *plines)
460 struct rcs_line *sort, *lp, *dlp, *ndlp, *insert_after;
461 int start, end, i, lineno;
464 dlp = TAILQ_FIRST(&(dlines->l_lines));
465 lp = TAILQ_FIRST(&(plines->l_lines));
468 for (lp = TAILQ_NEXT(lp, l_list); lp != NULL;
469 lp = TAILQ_NEXT(lp, l_list)) {
470 /* Skip blank lines */
474 /* NUL-terminate line buffer for strtol() safety. */
475 tmp = lp->l_line[lp->l_len - 1];
476 lp->l_line[lp->l_len - 1] = '\0';
478 /* len - 1 is NUL terminator so we use len - 2 for 'op' */
479 op = lp->l_line[lp->l_len - 2];
480 start = (int)strtol(lp->l_line, &ep, 10);
482 /* Restore the last byte of the buffer */
483 lp->l_line[lp->l_len - 1] = tmp;
486 if (start > dlines->l_nblines ||
487 start < 0 || *ep != 'a')
489 } else if (op == 'c') {
490 if (start > dlines->l_nblines ||
491 start < 0 || (*ep != ',' && *ep != 'c'))
496 end = (int)strtol(ep, &ep, 10);
497 if (end < 0 || *ep != 'c')
508 if (dlp->l_lineno == start)
510 if (dlp->l_lineno > start) {
511 dlp = TAILQ_PREV(dlp, tqh, l_list);
512 } else if (dlp->l_lineno < start) {
513 ndlp = TAILQ_NEXT(dlp, l_list);
514 if (ndlp->l_lineno > start)
525 insert_after = TAILQ_PREV(dlp, tqh, l_list);
526 for (i = 0; i <= (end - start); i++) {
527 ndlp = TAILQ_NEXT(dlp, l_list);
528 TAILQ_REMOVE(&(dlines->l_lines), dlp, l_list);
534 if (op == 'a' || op == 'c') {
537 lp = TAILQ_NEXT(lp, l_list);
541 if (lp->l_len == 2 &&
542 lp->l_line[0] == '.' &&
543 lp->l_line[1] == '\n')
546 TAILQ_REMOVE(&(plines->l_lines), lp, l_list);
547 TAILQ_INSERT_AFTER(&(dlines->l_lines), dlp,
551 lp->l_lineno = start;
557 * always resort lines as the markers might be put at the
558 * same line as we first started editing.
561 TAILQ_FOREACH(sort, &(dlines->l_lines), l_list)
562 sort->l_lineno = lineno++;
563 dlines->l_nblines = lineno - 1;
570 * Pick up the line numbers of all changes from one change file.
571 * (This puts the numbers in a vector, which is not strictly necessary,
572 * since the vector is processed in one sequential pass.
573 * The vector could be optimized out of existence)
575 static const struct got_error *
576 readin(size_t *n, char *name, struct diff **dd, struct diff3_state *d3s)
578 const struct got_error *err = NULL;
585 d3s->fp[0] = fopen(name, "r");
586 if (d3s->fp[0] == NULL)
587 return got_error_from_errno2("fopen", name);
588 err = getchange(&p, d3s->fp[0], d3s);
591 for (i = 0; p; i++) {
592 if (i >= d3s->szchanges - 1) {
614 (*dd)[i].old.from = a;
616 (*dd)[i].new.from = c;
619 err = getchange(&p, d3s->fp[0], d3s);
625 (*dd)[i].old.from = (*dd)[i - 1].old.to;
626 (*dd)[i].new.from = (*dd)[i - 1].new.to;
629 if (fclose(d3s->fp[0]) != 0)
630 err = got_error_from_errno("fclose");
642 while (isdigit((unsigned char)(**lc)))
643 nn = nn*10 + *(*lc)++ - '0';
648 static const struct got_error *
649 getchange(char **line, FILE *b, struct diff3_state *d3s)
651 const struct got_error *err = NULL;
655 if (*line && isdigit((unsigned char)(*line)[0]))
657 err = get_line(line, b, NULL, d3s);
665 static const struct got_error *
666 get_line(char **ret, FILE *b, size_t *n, struct diff3_state *d3s)
668 const struct got_error *err = NULL;
676 len = getline(&cp, &size, b);
679 err = got_error_from_errno("getline");
683 if (cp[len - 1] != '\n') {
685 if (len + 1 > size) {
686 new = realloc(cp, len + 1);
688 err = got_error_from_errno("realloc");
698 *ret = d3s->buf = cp;
707 static const struct got_error *
708 merge(size_t m1, size_t m2, struct diff3_state *d3s)
710 const struct got_error *err = NULL;
711 struct diff *d1, *d2;
718 t1 = (d1 < d3s->d13 + m1);
719 t2 = (d2 < d3s->d23 + m2);
723 /* first file is different from others */
724 if (!t2 || (t1 && d1->new.to < d2->new.from)) {
725 /* stuff peculiar to 1st file */
730 /* second file is different from others */
731 if (!t1 || (t2 && d2->new.to < d1->new.from)) {
737 * Merge overlapping changes in first file
738 * this happens after extension (see below).
740 if (d1 + 1 < d3s->d13 + m1 && d1->new.to >= d1[1].new.from) {
741 d1[1].old.from = d1->old.from;
742 d1[1].new.from = d1->new.from;
747 /* merge overlapping changes in second */
748 if (d2 + 1 < d3s->d23 + m2 && d2->new.to >= d2[1].new.from) {
749 d2[1].old.from = d2->old.from;
750 d2[1].new.from = d2->new.from;
754 /* stuff peculiar to third file or different in all */
755 if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {
756 err = duplicate(&dpl, &d1->old, &d2->old, d3s);
761 * dpl = 0 means all files differ
762 * dpl = 1 means files 1 and 2 identical
764 err = edit(d1, dpl, &j, d3s);
773 * Overlapping changes from file 1 and 2; extend changes
774 * appropriately to make them coincide.
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));
796 * print the range of line numbers, rold.from thru rold.to, as n1,n2 or n1
798 static const struct got_error *
799 prange(struct range *rold, struct diff3_state *d3s)
801 const struct got_error *err = NULL;
803 if (rold->to <= rold->from) {
804 err = diff_output(d3s->diffbuf, "%da\n", rold->from - 1);
808 err = diff_output(d3s->diffbuf, "%d", rold->from);
811 if (rold->to > rold->from + 1) {
812 err = diff_output(d3s->diffbuf, ",%d", rold->to - 1);
816 err = diff_output(d3s->diffbuf, "c\n");
825 * skip to just before line number from in file "i". If "pr" is non-NULL,
826 * print all skipped stuff with string pr as a prefix.
828 static const struct got_error *
829 skip(int *nskipped, int i, int from, char *pr, struct diff3_state *d3s)
831 const struct got_error *err = NULL;
836 for (n = 0; d3s->cline[i] < from - 1; n += j) {
837 err = get_line(&line, d3s->fp[i], &j, d3s);
841 err = diff_output(d3s->diffbuf, "%s%s", pr, line);
852 * Set *dpl to 1 or 0 according as the old range (in file 1) contains exactly
853 * the same data as the new range (in file 2).
855 static const struct got_error *
856 duplicate(int *dpl, struct range *r1, struct range *r2, struct diff3_state *d3s)
858 const struct got_error *err = NULL;
865 if (r1->to - r1->from != r2->to - r2->from)
868 err = skip(&nskipped, 0, r1->from, NULL, d3s);
871 err = skip(&nskipped, 1, r2->from, NULL, d3s);
875 for (nline = 0; nline < r1->to - r1->from; nline++) {
877 c = getc(d3s->fp[0]);
879 return got_ferror(d3s->fp[0], GOT_ERR_EOF);
880 d = getc(d3s->fp[1]);
882 return got_ferror(d3s->fp[1], GOT_ERR_EOF);
885 return repos(nchar, d3s);
888 err = repos(nchar, d3s);
895 static const struct got_error *
896 repos(int nchar, struct diff3_state *d3s)
900 for (i = 0; i < 2; i++) {
901 if (fseek(d3s->fp[i], (long)-nchar, SEEK_CUR) == -1)
902 return got_ferror(d3s->fp[i], GOT_ERR_IO);
909 * collect an editing script for later regurgitation
911 static const struct got_error *
912 edit(struct diff *diff, int fdup, int *j, struct diff3_state *d3s)
914 const struct got_error *err = NULL;
917 if (((fdup + 1) & 3) == 0)
920 d3s->overlap[*j] = !fdup;
923 d3s->de[*j].old.from = diff->old.from;
924 d3s->de[*j].old.to = diff->old.to;
925 err = skip(&nskipped, 2, diff->new.from, NULL, d3s);
928 d3s->de[*j].new.from = d3s->de[*j - 1].new.to + nskipped;
929 err = skip(&nskipped, 2, diff->new.to, NULL, d3s);
930 d3s->de[*j].new.to = d3s->de[*j].new.from + nskipped;
935 static const struct got_error *
936 edscript(int n, struct diff3_state *d3s)
938 const struct got_error *err = NULL;
940 char block[BUFSIZ+1];
943 if (!d3s->overlap[n]) {
944 err = prange(&d3s->de[n].old, d3s);
948 err = diff_output(d3s->diffbuf, "%da\n%s\n",
949 d3s->de[n].old.to -1, GOT_DIFF_CONFLICT_MARKER_SEP);
953 if (fseek(d3s->fp[2], (long)d3s->de[n].new.from, SEEK_SET)
955 return got_error_from_errno("fseek");
956 k = d3s->de[n].new.to - d3s->de[n].new.from;
957 for (; k > 0; k -= j) {
958 j = k > BUFSIZ ? BUFSIZ : k;
959 if (fread(block, 1, j, d3s->fp[2]) != (size_t)j)
960 return got_ferror(d3s->fp[2], GOT_ERR_IO);
962 err = diff_output(d3s->diffbuf, "%s", block);
967 if (!d3s->overlap[n]) {
968 err = diff_output(d3s->diffbuf, ".\n");
972 err = diff_output(d3s->diffbuf, "%s\n.\n", d3s->f3mark);
975 err = diff_output(d3s->diffbuf, "%da\n%s\n.\n",
976 d3s->de[n].old.from - 1, d3s->f1mark);
985 static const struct got_error *
986 increase(struct diff3_state *d3s)
992 /* are the memset(3) calls needed? */
993 newsz = d3s->szchanges == 0 ? 64 : 2 * d3s->szchanges;
994 incr = newsz - d3s->szchanges;
996 d = reallocarray(d3s->d13, newsz, sizeof(*d3s->d13));
998 return got_error_from_errno("reallocarray");
1000 memset(d3s->d13 + d3s->szchanges, 0, incr * sizeof(*d3s->d13));
1002 d = reallocarray(d3s->d23, newsz, sizeof(*d3s->d23));
1004 return got_error_from_errno("reallocarray");
1006 memset(d3s->d23 + d3s->szchanges, 0, incr * sizeof(*d3s->d23));
1008 d = reallocarray(d3s->de, newsz, sizeof(*d3s->de));
1010 return got_error_from_errno("reallocarray");
1012 memset(d3s->de + d3s->szchanges, 0, incr * sizeof(*d3s->de));
1014 s = reallocarray(d3s->overlap, newsz, sizeof(*d3s->overlap));
1016 return got_error_from_errno("reallocarray");
1018 memset(d3s->overlap + d3s->szchanges, 0, incr * sizeof(*d3s->overlap));
1019 d3s->szchanges = newsz;