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 *d = buf_load(outpath);
248 err = got_error_from_errno("buf_load");
254 if (outfile && fclose(outfile) != 0 && err == NULL)
255 err = got_error_from_errno("fclose");
256 if (f1 && fclose(f1) != 0 && err == NULL)
257 err = got_error_from_errno("fclose");
258 if (f2 && fclose(f2) != 0 && err == NULL)
259 err = got_error_from_errno("fclose");
266 const struct got_error *
267 got_merge_diff3(int *overlapcnt, int outfd, const char *p1, const char *p2,
268 const char *p3, const char *label1, const char *label3)
270 const struct got_error *err = NULL;
271 char *dp13, *dp23, *path1, *path2, *path3;
272 BUF *b1, *b2, *b3, *d1, *d2, *diffb;
273 u_char *data, *patch;
275 struct wklhead temp_files;
276 struct diff3_state *d3s;
281 SLIST_INIT(&temp_files);
283 d3s = calloc(1, sizeof(*d3s));
285 return got_error_from_errno("calloc");
287 b1 = b2 = b3 = d1 = d2 = diffb = NULL;
288 dp13 = dp23 = path1 = path2 = path3 = NULL;
291 if ((b1 = buf_load(p1)) == NULL)
293 if ((b2 = buf_load(p2)) == NULL)
295 if ((b3 = buf_load(p3)) == NULL)
298 diffb = buf_alloc(128);
300 if (asprintf(&path1, "/tmp/got-diff1.XXXXXXXX") == -1) {
301 err = got_error_from_errno("asprintf");
304 if (asprintf(&path2, "/tmp/got-diff2.XXXXXXXX") == -1) {
305 err = got_error_from_errno("asprintf");
308 if (asprintf(&path3, "/tmp/got-diff3.XXXXXXXX") == -1) {
309 err = got_error_from_errno("asprintf");
313 err = buf_write_stmp(b1, path1, &temp_files);
316 err = buf_write_stmp(b2, path2, &temp_files);
319 err = buf_write_stmp(b3, path3, &temp_files);
326 err = diffreg(&d1, path1, path3);
333 err = diffreg(&d2, path2, path3);
340 if (asprintf(&dp13, "/tmp/got-d13.XXXXXXXXXX") == -1) {
341 err = got_error_from_errno("asprintf");
344 err = buf_write_stmp(d1, dp13, &temp_files);
351 if (asprintf(&dp23, "/tmp/got-d23.XXXXXXXXXX") == -1) {
352 err = got_error_from_errno("asprintf");
355 err = buf_write_stmp(d2, dp23, &temp_files);
362 d3s->diffbuf = diffb;
363 err = diff3_internal(dp13, dp23, path1, path2, path3,
364 label1, label3, d3s, label1, label3);
371 plen = buf_len(diffb);
372 patch = buf_release(diffb);
374 data = buf_release(b1);
376 diffb = rcs_patchfile(data, dlen, patch, plen, ed_patch_lines);
397 worklist_clean(&temp_files, worklist_unlink);
399 for (i = 0; i < nitems(d3s->fp); i++) {
400 if (d3s->fp[i] && fclose(d3s->fp[i]) != 0 && err == NULL)
401 err = got_error_from_errno("fclose");
403 if (err == NULL && diffb) {
404 if (buf_write_fd(diffb, outfd) < 0)
405 err = got_error_from_errno("buf_write_fd");
406 *overlapcnt = d3s->overlapcnt;
413 static const struct got_error *
414 diff3_internal(char *dp13, char *dp23, char *path1, char *path2, char *path3,
415 const char *fmark, const char *rmark, struct diff3_state *d3s,
416 const char *label1, const char *label3)
418 const struct got_error *err = NULL;
422 i = snprintf(d3s->f1mark, sizeof(d3s->f1mark),
423 "%s %s", GOT_DIFF_CONFLICT_MARKER_BEGIN, label1);
424 if (i < 0 || i >= (int)sizeof(d3s->f1mark))
425 return got_error(GOT_ERR_NO_SPACE);
427 i = snprintf(d3s->f3mark, sizeof(d3s->f3mark),
428 "%s %s", GOT_DIFF_CONFLICT_MARKER_END, label3);
429 if (i < 0 || i >= (int)sizeof(d3s->f3mark))
430 return got_error(GOT_ERR_NO_SPACE);
436 err = readin(&m, dp13, &d3s->d13, d3s);
439 err = readin(&n, dp23, &d3s->d23, d3s);
443 if ((d3s->fp[0] = fopen(path1, "r")) == NULL)
444 return got_error_from_errno2("fopen", path1);
445 if ((d3s->fp[1] = fopen(path2, "r")) == NULL)
446 return got_error_from_errno2("fopen", path2);
447 if ((d3s->fp[2] = fopen(path3, "r")) == NULL)
448 return got_error_from_errno2("fopen", path3);
450 return merge(m, n, d3s);
454 ed_patch_lines(struct rcs_lines *dlines, struct rcs_lines *plines)
457 struct rcs_line *sort, *lp, *dlp, *ndlp, *insert_after;
458 int start, end, i, lineno;
461 dlp = TAILQ_FIRST(&(dlines->l_lines));
462 lp = TAILQ_FIRST(&(plines->l_lines));
465 for (lp = TAILQ_NEXT(lp, l_list); lp != NULL;
466 lp = TAILQ_NEXT(lp, l_list)) {
467 /* Skip blank lines */
471 /* NUL-terminate line buffer for strtol() safety. */
472 tmp = lp->l_line[lp->l_len - 1];
473 lp->l_line[lp->l_len - 1] = '\0';
475 /* len - 1 is NUL terminator so we use len - 2 for 'op' */
476 op = lp->l_line[lp->l_len - 2];
477 start = (int)strtol(lp->l_line, &ep, 10);
479 /* Restore the last byte of the buffer */
480 lp->l_line[lp->l_len - 1] = tmp;
483 if (start > dlines->l_nblines ||
484 start < 0 || *ep != 'a')
486 } else if (op == 'c') {
487 if (start > dlines->l_nblines ||
488 start < 0 || (*ep != ',' && *ep != 'c'))
493 end = (int)strtol(ep, &ep, 10);
494 if (end < 0 || *ep != 'c')
505 if (dlp->l_lineno == start)
507 if (dlp->l_lineno > start) {
508 dlp = TAILQ_PREV(dlp, tqh, l_list);
509 } else if (dlp->l_lineno < start) {
510 ndlp = TAILQ_NEXT(dlp, l_list);
511 if (ndlp->l_lineno > start)
522 insert_after = TAILQ_PREV(dlp, tqh, l_list);
523 for (i = 0; i <= (end - start); i++) {
524 ndlp = TAILQ_NEXT(dlp, l_list);
525 TAILQ_REMOVE(&(dlines->l_lines), dlp, l_list);
531 if (op == 'a' || op == 'c') {
534 lp = TAILQ_NEXT(lp, l_list);
538 if (lp->l_len == 2 &&
539 lp->l_line[0] == '.' &&
540 lp->l_line[1] == '\n')
543 TAILQ_REMOVE(&(plines->l_lines), lp, l_list);
544 TAILQ_INSERT_AFTER(&(dlines->l_lines), dlp,
548 lp->l_lineno = start;
554 * always resort lines as the markers might be put at the
555 * same line as we first started editing.
558 TAILQ_FOREACH(sort, &(dlines->l_lines), l_list)
559 sort->l_lineno = lineno++;
560 dlines->l_nblines = lineno - 1;
567 * Pick up the line numbers of all changes from one change file.
568 * (This puts the numbers in a vector, which is not strictly necessary,
569 * since the vector is processed in one sequential pass.
570 * The vector could be optimized out of existence)
572 static const struct got_error *
573 readin(size_t *n, char *name, struct diff **dd, struct diff3_state *d3s)
575 const struct got_error *err = NULL;
582 d3s->fp[0] = fopen(name, "r");
583 if (d3s->fp[0] == NULL)
584 return got_error_from_errno2("fopen", name);
585 err = getchange(&p, d3s->fp[0], d3s);
588 for (i = 0; p; i++) {
589 if (i >= d3s->szchanges - 1) {
611 (*dd)[i].old.from = a;
613 (*dd)[i].new.from = c;
616 err = getchange(&p, d3s->fp[0], d3s);
622 (*dd)[i].old.from = (*dd)[i-1].old.to;
623 (*dd)[i].new.from = (*dd)[i-1].new.to;
626 if (fclose(d3s->fp[0]) != 0)
627 err = got_error_from_errno("fclose");
639 while (isdigit((unsigned char)(**lc)))
640 nn = nn*10 + *(*lc)++ - '0';
645 static const struct got_error *
646 getchange(char **line, FILE *b, struct diff3_state *d3s)
648 const struct got_error *err = NULL;
652 if (*line && isdigit((unsigned char)(*line)[0]))
654 err = get_line(line, b, NULL, d3s);
662 static const struct got_error *
663 get_line(char **ret, FILE *b, size_t *n, struct diff3_state *d3s)
665 const struct got_error *err = NULL;
673 len = getline(&cp, &size, b);
676 err = got_error_from_errno("getline");
680 if (cp[len - 1] != '\n') {
682 if (len + 1 > size) {
683 new = realloc(cp, len + 1);
685 err = got_error_from_errno("realloc");
695 *ret = d3s->buf = cp;
704 static const struct got_error *
705 merge(size_t m1, size_t m2, struct diff3_state *d3s)
707 const struct got_error *err = NULL;
708 struct diff *d1, *d2;
715 t1 = (d1 < d3s->d13 + m1);
716 t2 = (d2 < d3s->d23 + m2);
720 /* first file is different from others */
721 if (!t2 || (t1 && d1->new.to < d2->new.from)) {
722 /* stuff peculiar to 1st file */
727 /* second file is different from others */
728 if (!t1 || (t2 && d2->new.to < d1->new.from)) {
734 * Merge overlapping changes in first file
735 * this happens after extension (see below).
737 if (d1 + 1 < d3s->d13 + m1 && d1->new.to >= d1[1].new.from) {
738 d1[1].old.from = d1->old.from;
739 d1[1].new.from = d1->new.from;
744 /* merge overlapping changes in second */
745 if (d2 + 1 < d3s->d23 + m2 && d2->new.to >= d2[1].new.from) {
746 d2[1].old.from = d2->old.from;
747 d2[1].new.from = d2->new.from;
751 /* stuff peculiar to third file or different in all */
752 if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {
753 err = duplicate(&dpl, &d1->old, &d2->old, d3s);
758 * dpl = 0 means all files differ
759 * dpl = 1 means files 1 and 2 identical
761 err = edit(d1, dpl, &j, d3s);
770 * Overlapping changes from file 1 and 2; extend changes
771 * appropriately to make them coincide.
773 if (d1->new.from < d2->new.from) {
774 d2->old.from -= d2->new.from-d1->new.from;
775 d2->new.from = d1->new.from;
776 } else if (d2->new.from < d1->new.from) {
777 d1->old.from -= d1->new.from-d2->new.from;
778 d1->new.from = d2->new.from;
780 if (d1->new.to > d2->new.to) {
781 d2->old.to += d1->new.to - d2->new.to;
782 d2->new.to = d1->new.to;
783 } else if (d2->new.to > d1->new.to) {
784 d1->old.to += d2->new.to - d1->new.to;
785 d1->new.to = d2->new.to;
789 return (edscript(j, d3s));
793 * print the range of line numbers, rold.from thru rold.to, as n1,n2 or n1
795 static const struct got_error *
796 prange(struct range *rold, struct diff3_state *d3s)
798 const struct got_error *err = NULL;
800 if (rold->to <= rold->from) {
801 err = diff_output(d3s->diffbuf, "%da\n", rold->from - 1);
805 err = diff_output(d3s->diffbuf, "%d", rold->from);
808 if (rold->to > rold->from + 1) {
809 err = diff_output(d3s->diffbuf, ",%d", rold->to - 1);
813 err = diff_output(d3s->diffbuf, "c\n");
822 * skip to just before line number from in file "i". If "pr" is non-NULL,
823 * print all skipped stuff with string pr as a prefix.
825 static const struct got_error *
826 skip(int *nskipped, int i, int from, char *pr, struct diff3_state *d3s)
828 const struct got_error *err = NULL;
833 for (n = 0; d3s->cline[i] < from - 1; n += j) {
834 err = get_line(&line, d3s->fp[i], &j, d3s);
838 err = diff_output(d3s->diffbuf, "%s%s", pr, line);
849 * Set *dpl to 1 or 0 according as the old range (in file 1) contains exactly
850 * the same data as the new range (in file 2).
852 static const struct got_error *
853 duplicate(int *dpl, struct range *r1, struct range *r2, struct diff3_state *d3s)
855 const struct got_error *err = NULL;
862 if (r1->to-r1->from != r2->to-r2->from)
865 err = skip(&nskipped, 0, r1->from, NULL, d3s);
868 err = skip(&nskipped, 1, r2->from, NULL, d3s);
872 for (nline=0; nline < r1->to - r1->from; nline++) {
874 c = getc(d3s->fp[0]);
876 return got_ferror(d3s->fp[0], GOT_ERR_EOF);
877 d = getc(d3s->fp[1]);
879 return got_ferror(d3s->fp[1], GOT_ERR_EOF);
882 return repos(nchar, d3s);
885 err = repos(nchar, d3s);
892 static const struct got_error *
893 repos(int nchar, struct diff3_state *d3s)
897 for (i = 0; i < 2; i++) {
898 if (fseek(d3s->fp[i], (long)-nchar, SEEK_CUR) == -1)
899 return got_ferror(d3s->fp[i], GOT_ERR_IO);
906 * collect an editing script for later regurgitation
908 static const struct got_error *
909 edit(struct diff *diff, int fdup, int *j, struct diff3_state *d3s)
911 const struct got_error *err = NULL;
914 if (((fdup + 1) & 3) == 0)
917 d3s->overlap[*j] = !fdup;
920 d3s->de[*j].old.from = diff->old.from;
921 d3s->de[*j].old.to = diff->old.to;
922 err = skip(&nskipped, 2, diff->new.from, NULL, d3s);
925 d3s->de[*j].new.from = d3s->de[*j - 1].new.to + nskipped;
926 err = skip(&nskipped, 2, diff->new.to, NULL, d3s);
927 d3s->de[*j].new.to = d3s->de[*j].new.from + nskipped;
932 static const struct got_error *
933 edscript(int n, struct diff3_state *d3s)
935 const struct got_error *err = NULL;
937 char block[BUFSIZ+1];
940 if (!d3s->overlap[n]) {
941 err = prange(&d3s->de[n].old, d3s);
945 err = diff_output(d3s->diffbuf, "%da\n%s\n",
946 d3s->de[n].old.to -1, GOT_DIFF_CONFLICT_MARKER_SEP);
950 if (fseek(d3s->fp[2], (long)d3s->de[n].new.from, SEEK_SET)
952 return got_error_from_errno("fseek");
953 k = d3s->de[n].new.to - d3s->de[n].new.from;
954 for (; k > 0; k-= j) {
955 j = k > BUFSIZ ? BUFSIZ : k;
956 if (fread(block, 1, j, d3s->fp[2]) != (size_t)j)
957 return got_ferror(d3s->fp[2], GOT_ERR_IO);
959 err = diff_output(d3s->diffbuf, "%s", block);
964 if (!d3s->overlap[n]) {
965 err = diff_output(d3s->diffbuf, ".\n");
969 err = diff_output(d3s->diffbuf, "%s\n.\n", d3s->f3mark);
972 err = diff_output(d3s->diffbuf, "%da\n%s\n.\n",
973 d3s->de[n].old.from - 1, d3s->f1mark);
982 static const struct got_error *
983 increase(struct diff3_state *d3s)
989 /* are the memset(3) calls needed? */
990 newsz = d3s->szchanges == 0 ? 64 : 2 * d3s->szchanges;
991 incr = newsz - d3s->szchanges;
993 d = reallocarray(d3s->d13, newsz, sizeof(*d3s->d13));
995 return got_error_from_errno("reallocarray");
997 memset(d3s->d13 + d3s->szchanges, 0, incr * sizeof(*d3s->d13));
999 d = reallocarray(d3s->d23, newsz, sizeof(*d3s->d23));
1001 return got_error_from_errno("reallocarray");
1003 memset(d3s->d23 + d3s->szchanges, 0, incr * sizeof(*d3s->d23));
1005 d = reallocarray(d3s->de, newsz, sizeof(*d3s->de));
1007 return got_error_from_errno("reallocarray");
1009 memset(d3s->de + d3s->szchanges, 0, incr * sizeof(*d3s->de));
1011 s = reallocarray(d3s->overlap, newsz, sizeof(*d3s->overlap));
1013 return got_error_from_errno("reallocarray");
1015 memset(d3s->overlap + d3s->szchanges, 0, incr * sizeof(*d3s->overlap));
1016 d3s->szchanges = newsz;