1 /* $OpenBSD: diff3prog.c,v 1.11 2009/10/27 23:59:37 deraadt Exp $ */ 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 #if 0 68 #ifndef lint 69 static char sccsid[] = "@(#)diff3.c 8.1 (Berkeley) 6/6/93"; 70 #endif 71 #endif /* not lint */ 72 #include <sys/cdefs.h> 73 __FBSDID("$FreeBSD$"); 74 75 #include <sys/capsicum.h> 76 #include <sys/procdesc.h> 77 #include <sys/types.h> 78 #include <sys/event.h> 79 #include <sys/wait.h> 80 81 #include <capsicum_helpers.h> 82 #include <ctype.h> 83 #include <err.h> 84 #include <getopt.h> 85 #include <stdio.h> 86 #include <stdlib.h> 87 #include <limits.h> 88 #include <inttypes.h> 89 #include <string.h> 90 #include <unistd.h> 91 92 93 /* 94 * "from" is first in range of changed lines; "to" is last+1 95 * from=to=line after point of insertion for added lines. 96 */ 97 struct range { 98 int from; 99 int to; 100 }; 101 102 struct diff { 103 struct range old; 104 struct range new; 105 }; 106 107 static size_t szchanges; 108 109 static struct diff *d13; 110 static struct diff *d23; 111 /* 112 * "de" is used to gather editing scripts. These are later spewed out in 113 * reverse order. Its first element must be all zero, the "new" component 114 * of "de" contains line positions or byte positions depending on when you 115 * look (!?). Array overlap indicates which sections in "de" correspond to 116 * lines that are different in all three files. 117 */ 118 static struct diff *de; 119 static char *overlap; 120 static int overlapcnt; 121 static FILE *fp[3]; 122 static int cline[3]; /* # of the last-read line in each file (0-2) */ 123 /* 124 * The latest known correspondence between line numbers of the 3 files 125 * is stored in last[1-3]; 126 */ 127 static int last[4]; 128 static int Aflag, eflag, iflag, mflag, Tflag; 129 static int oflag; /* indicates whether to mark overlaps (-E or -X) */ 130 static int strip_cr; 131 static char *f1mark, *f2mark, *f3mark; 132 133 static bool duplicate(struct range *, struct range *); 134 static int edit(struct diff *, bool, int); 135 static char *getchange(FILE *); 136 static char *get_line(FILE *, size_t *); 137 static int readin(int fd, struct diff **); 138 static int skip(int, int, const char *); 139 static void change(int, struct range *, bool); 140 static void keep(int, struct range *); 141 static void merge(int, int); 142 static void prange(struct range *); 143 static void repos(int); 144 static void edscript(int) __dead2; 145 static void increase(void); 146 static void usage(void) __dead2; 147 148 enum { 149 DIFFPROG_OPT, 150 STRIPCR_OPT, 151 }; 152 153 #define DIFF_PATH "/usr/bin/diff" 154 155 #define OPTIONS "3aAeEiL:mTxX" 156 static struct option longopts[] = { 157 { "ed", no_argument, NULL, 'e' }, 158 { "show-overlap", no_argument, NULL, 'E' }, 159 { "overlap-only", no_argument, NULL, 'x' }, 160 { "initial-tab", no_argument, NULL, 'T' }, 161 { "text", no_argument, NULL, 'a' }, 162 { "strip-trailing-cr", no_argument, NULL, STRIPCR_OPT }, 163 { "show-all", no_argument, NULL, 'A' }, 164 { "easy-only", no_argument, NULL, '3' }, 165 { "merge", no_argument, NULL, 'm' }, 166 { "label", required_argument, NULL, 'L' }, 167 { "diff-program", required_argument, NULL, DIFFPROG_OPT }, 168 }; 169 170 static void 171 usage(void) 172 { 173 fprintf(stderr, "usage: diff3 [-3aAeEimTxX] [-L label1] [-L label2] " 174 "[-L label3] file1 file2 file3\n"); 175 exit(2); 176 } 177 178 static int 179 readin(int fd, struct diff **dd) 180 { 181 int a, b, c, d; 182 size_t i; 183 char kind, *p; 184 FILE *f; 185 186 f = fdopen(fd, "r"); 187 if (f == NULL) 188 err(2, "fdopen"); 189 for (i = 0; (p = getchange(f)); i++) { 190 if (i >= szchanges - 1) 191 increase(); 192 a = b = (int)strtoimax(p, &p, 10); 193 if (*p == ',') { 194 p++; 195 b = (int)strtoimax(p, &p, 10); 196 } 197 kind = *p++; 198 c = d = (int)strtoimax(p, &p, 10); 199 if (*p == ',') { 200 p++; 201 d = (int)strtoimax(p, &p, 10); 202 } 203 if (kind == 'a') 204 a++; 205 if (kind == 'd') 206 c++; 207 b++; 208 d++; 209 (*dd)[i].old.from = a; 210 (*dd)[i].old.to = b; 211 (*dd)[i].new.from = c; 212 (*dd)[i].new.to = d; 213 } 214 if (i) { 215 (*dd)[i].old.from = (*dd)[i - 1].old.to; 216 (*dd)[i].new.from = (*dd)[i - 1].new.to; 217 } 218 fclose(f); 219 return (i); 220 } 221 222 static int 223 diffexec(const char *diffprog, char **diffargv, int fd[]) 224 { 225 int pd; 226 227 switch (pdfork(&pd, PD_CLOEXEC)) { 228 case 0: 229 close(fd[0]); 230 if (dup2(fd[1], STDOUT_FILENO) == -1) 231 err(2, "child could not duplicate descriptor"); 232 close(fd[1]); 233 execvp(diffprog, diffargv); 234 err(2, "could not execute diff: %s", diffprog); 235 break; 236 case -1: 237 err(2, "could not fork"); 238 break; 239 } 240 close(fd[1]); 241 return (pd); 242 } 243 244 static char * 245 getchange(FILE *b) 246 { 247 char *line; 248 249 while ((line = get_line(b, NULL))) { 250 if (isdigit((unsigned char)line[0])) 251 return (line); 252 } 253 return (NULL); 254 } 255 256 257 static char * 258 get_line(FILE *b, size_t *n) 259 { 260 ssize_t len; 261 static char *buf = NULL; 262 static size_t bufsize = 0; 263 264 if ((len = getline(&buf, &bufsize, b)) < 0) 265 return (NULL); 266 267 if (strip_cr && len >= 2 && strcmp("\r\n", &(buf[len - 2])) == 0) { 268 buf[len - 2] = '\n'; 269 buf[len - 1] = '\0'; 270 len--; 271 } 272 273 if (n != NULL) 274 *n = len; 275 276 return (buf); 277 } 278 279 static void 280 merge(int m1, int m2) 281 { 282 struct diff *d1, *d2, *d3; 283 int j, t1, t2; 284 bool dup = false; 285 286 d1 = d13; 287 d2 = d23; 288 j = 0; 289 290 while ((t1 = d1 < d13 + m1) | (t2 = d2 < d23 + m2)) { 291 /* first file is different from the others */ 292 if (!t2 || (t1 && d1->new.to < d2->new.from)) { 293 /* stuff peculiar to 1st file */ 294 if (eflag == 0) { 295 printf("====1\n"); 296 change(1, &d1->old, false); 297 keep(2, &d1->new); 298 change(3, &d1->new, false); 299 } 300 d1++; 301 continue; 302 } 303 /* second file is different from others */ 304 if (!t1 || (t2 && d2->new.to < d1->new.from)) { 305 if (eflag == 0) { 306 printf("====2\n"); 307 keep(1, &d2->new); 308 change(3, &d2->new, false); 309 change(2, &d2->old, false); 310 } 311 d2++; 312 continue; 313 } 314 /* 315 * Merge overlapping changes in first file 316 * this happens after extension (see below). 317 */ 318 if (d1 + 1 < d13 + m1 && d1->new.to >= d1[1].new.from) { 319 d1[1].old.from = d1->old.from; 320 d1[1].new.from = d1->new.from; 321 d1++; 322 continue; 323 } 324 325 /* merge overlapping changes in second */ 326 if (d2 + 1 < d23 + m2 && d2->new.to >= d2[1].new.from) { 327 d2[1].old.from = d2->old.from; 328 d2[1].new.from = d2->new.from; 329 d2++; 330 continue; 331 } 332 /* stuff peculiar to third file or different in all */ 333 if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) { 334 dup = duplicate(&d1->old, &d2->old); 335 /* 336 * dup = 0 means all files differ 337 * dup = 1 means files 1 and 2 identical 338 */ 339 if (eflag == 0) { 340 printf("====%s\n", dup ? "3" : ""); 341 change(1, &d1->old, dup); 342 change(2, &d2->old, false); 343 d3 = d1->old.to > d1->old.from ? d1 : d2; 344 change(3, &d3->new, false); 345 } else 346 j = edit(d1, dup, j); 347 d1++; 348 d2++; 349 continue; 350 } 351 /* 352 * Overlapping changes from file 1 and 2; extend changes 353 * appropriately to make them coincide. 354 */ 355 if (d1->new.from < d2->new.from) { 356 d2->old.from -= d2->new.from - d1->new.from; 357 d2->new.from = d1->new.from; 358 } else if (d2->new.from < d1->new.from) { 359 d1->old.from -= d1->new.from - d2->new.from; 360 d1->new.from = d2->new.from; 361 } 362 if (d1->new.to > d2->new.to) { 363 d2->old.to += d1->new.to - d2->new.to; 364 d2->new.to = d1->new.to; 365 } else if (d2->new.to > d1->new.to) { 366 d1->old.to += d2->new.to - d1->new.to; 367 d1->new.to = d2->new.to; 368 } 369 } 370 if (eflag) 371 edscript(j); 372 } 373 374 /* 375 * The range of lines rold.from thru rold.to in file i is to be changed. 376 * It is to be printed only if it does not duplicate something to be 377 * printed later. 378 */ 379 static void 380 change(int i, struct range *rold, bool dup) 381 { 382 383 printf("%d:", i); 384 last[i] = rold->to; 385 prange(rold); 386 if (dup) 387 return; 388 i--; 389 skip(i, rold->from, NULL); 390 skip(i, rold->to, " "); 391 } 392 393 /* 394 * Print the range of line numbers, rold.from thru rold.to, as n1,n2 or 395 * n1. 396 */ 397 static void 398 prange(struct range *rold) 399 { 400 401 if (rold->to <= rold->from) 402 printf("%da\n", rold->from - 1); 403 else { 404 printf("%d", rold->from); 405 if (rold->to > rold->from + 1) 406 printf(",%d", rold->to - 1); 407 printf("c\n"); 408 } 409 } 410 411 /* 412 * No difference was reported by diff between file 1 (or 2) and file 3, 413 * and an artificial dummy difference (trange) must be ginned up to 414 * correspond to the change reported in the other file. 415 */ 416 static void 417 keep(int i, struct range *rnew) 418 { 419 int delta; 420 struct range trange; 421 422 delta = last[3] - last[i]; 423 trange.from = rnew->from - delta; 424 trange.to = rnew->to - delta; 425 change(i, &trange, true); 426 } 427 428 /* 429 * skip to just before line number from in file "i". If "pr" is non-NULL, 430 * print all skipped stuff with string pr as a prefix. 431 */ 432 static int 433 skip(int i, int from, const char *pr) 434 { 435 size_t j, n; 436 char *line; 437 438 for (n = 0; cline[i] < from - 1; n += j) { 439 if ((line = get_line(fp[i], &j)) == NULL) 440 errx(EXIT_FAILURE, "logic error"); 441 if (pr != NULL) 442 printf("%s%s", Tflag == 1 ? "\t" : pr, line); 443 cline[i]++; 444 } 445 return ((int) n); 446 } 447 448 /* 449 * Return 1 or 0 according as the old range (in file 1) contains exactly 450 * the same data as the new range (in file 2). 451 */ 452 static bool 453 duplicate(struct range *r1, struct range *r2) 454 { 455 int c, d; 456 int nchar; 457 int nline; 458 459 if (r1->to-r1->from != r2->to-r2->from) 460 return (0); 461 skip(0, r1->from, NULL); 462 skip(1, r2->from, NULL); 463 nchar = 0; 464 for (nline = 0; nline < r1->to - r1->from; nline++) { 465 do { 466 c = getc(fp[0]); 467 d = getc(fp[1]); 468 if (c == -1 && d == -1) 469 break; 470 if (c == -1 || d == -1) 471 errx(EXIT_FAILURE, "logic error"); 472 nchar++; 473 if (c != d) { 474 repos(nchar); 475 return (0); 476 } 477 } while (c != '\n'); 478 } 479 repos(nchar); 480 return (1); 481 } 482 483 static void 484 repos(int nchar) 485 { 486 int i; 487 488 for (i = 0; i < 2; i++) 489 (void)fseek(fp[i], (long)-nchar, SEEK_CUR); 490 } 491 492 /* 493 * collect an editing script for later regurgitation 494 */ 495 static int 496 edit(struct diff *diff, bool dup, int j) 497 { 498 499 if (((dup + 1) & eflag) == 0) 500 return (j); 501 j++; 502 overlap[j] = !dup; 503 if (!dup) 504 overlapcnt++; 505 de[j].old.from = diff->old.from; 506 de[j].old.to = diff->old.to; 507 de[j].new.from = de[j-1].new.to + skip(2, diff->new.from, NULL); 508 de[j].new.to = de[j].new.from + skip(2, diff->new.to, NULL); 509 return (j); 510 } 511 512 /* regurgitate */ 513 static void 514 edscript(int n) 515 { 516 int k; 517 size_t j; 518 char block[BUFSIZ]; 519 520 for (; n > 0; n--) { 521 if (!oflag || !overlap[n]) { 522 prange(&de[n].old); 523 } else { 524 printf("%da\n", de[n].old.to - 1); 525 if (Aflag) { 526 printf("%s\n", f2mark); 527 fseek(fp[1], de[n].old.from, SEEK_SET); 528 for (k = de[n].old.to - de[n].old.from; k > 0; k -= j) { 529 j = k > BUFSIZ ? BUFSIZ : k; 530 if (fread(block, 1, j, fp[1]) != j) 531 errx(2, "logic error"); 532 fwrite(block, 1, j, stdout); 533 } 534 printf("\n"); 535 } 536 printf("=======\n"); 537 } 538 fseek(fp[2], (long)de[n].new.from, SEEK_SET); 539 for (k = de[n].new.to - de[n].new.from; k > 0; k -= j) { 540 size_t r; 541 542 j = k > BUFSIZ ? BUFSIZ : k; 543 r = fread(block, 1, j, fp[2]); 544 if (r == 0) { 545 if (feof(fp[2])) 546 break; 547 errx(2, "logic error"); 548 } 549 if (r != j) 550 j = r; 551 (void)fwrite(block, 1, j, stdout); 552 } 553 if (!oflag || !overlap[n]) 554 printf(".\n"); 555 else { 556 printf("%s\n.\n", f3mark); 557 printf("%da\n%s\n.\n", de[n].old.from - 1, f1mark); 558 } 559 } 560 if (iflag) 561 printf("w\nq\n"); 562 563 exit(eflag == 0 ? overlapcnt : 0); 564 } 565 566 static void 567 increase(void) 568 { 569 struct diff *p; 570 char *q; 571 size_t newsz, incr; 572 573 /* are the memset(3) calls needed? */ 574 newsz = szchanges == 0 ? 64 : 2 * szchanges; 575 incr = newsz - szchanges; 576 577 p = reallocarray(d13, newsz, sizeof(struct diff)); 578 if (p == NULL) 579 err(1, NULL); 580 memset(p + szchanges, 0, incr * sizeof(struct diff)); 581 d13 = p; 582 p = reallocarray(d23, newsz, sizeof(struct diff)); 583 if (p == NULL) 584 err(1, NULL); 585 memset(p + szchanges, 0, incr * sizeof(struct diff)); 586 d23 = p; 587 p = reallocarray(de, newsz, sizeof(struct diff)); 588 if (p == NULL) 589 err(1, NULL); 590 memset(p + szchanges, 0, incr * sizeof(struct diff)); 591 de = p; 592 q = reallocarray(overlap, newsz, sizeof(char)); 593 if (q == NULL) 594 err(1, NULL); 595 memset(q + szchanges, 0, incr * sizeof(char)); 596 overlap = q; 597 szchanges = newsz; 598 } 599 600 601 int 602 main(int argc, char **argv) 603 { 604 int ch, nblabels, status, m, n, kq, nke, nleft, i; 605 char *labels[] = { NULL, NULL, NULL }; 606 const char *diffprog = DIFF_PATH; 607 char *file1, *file2, *file3; 608 char *diffargv[7]; 609 int diffargc = 0; 610 int fd13[2], fd23[2]; 611 int pd13, pd23; 612 cap_rights_t rights_ro; 613 struct kevent *e; 614 615 nblabels = 0; 616 eflag = 0; 617 oflag = 0; 618 diffargv[diffargc++] = __DECONST(char *, diffprog); 619 while ((ch = getopt_long(argc, argv, OPTIONS, longopts, NULL)) != -1) { 620 switch (ch) { 621 case '3': 622 eflag = 2; 623 break; 624 case 'a': 625 diffargv[diffargc++] = __DECONST(char *, "-a"); 626 break; 627 case 'A': 628 Aflag = 1; 629 break; 630 case 'e': 631 eflag = 3; 632 break; 633 case 'E': 634 eflag = 3; 635 oflag = 1; 636 break; 637 case 'i': 638 iflag = 1; 639 break; 640 case 'L': 641 oflag = 1; 642 if (nblabels >= 3) 643 errx(2, "too many file label options"); 644 labels[nblabels++] = optarg; 645 break; 646 case 'm': 647 Aflag = 1; 648 oflag = 1; 649 mflag = 1; 650 break; 651 case 'T': 652 Tflag = 1; 653 break; 654 case 'x': 655 eflag = 1; 656 break; 657 case 'X': 658 oflag = 1; 659 eflag = 1; 660 break; 661 case DIFFPROG_OPT: 662 diffprog = optarg; 663 break; 664 case STRIPCR_OPT: 665 strip_cr = 1; 666 diffargv[diffargc++] = __DECONST(char *, "--strip-trailing-cr"); 667 break; 668 } 669 } 670 argc -= optind; 671 argv += optind; 672 673 if (Aflag) { 674 eflag = 3; 675 oflag = 1; 676 } 677 678 if (argc != 3) 679 usage(); 680 681 if (caph_limit_stdio() == -1) 682 err(2, "unable to limit stdio"); 683 684 cap_rights_init(&rights_ro, CAP_READ, CAP_FSTAT, CAP_SEEK); 685 686 kq = kqueue(); 687 if (kq == -1) 688 err(2, "kqueue"); 689 690 e = malloc(2 * sizeof(struct kevent)); 691 if (e == NULL) 692 err(2, "malloc"); 693 694 /* TODO stdio */ 695 file1 = argv[0]; 696 file2 = argv[1]; 697 file3 = argv[2]; 698 699 if (oflag) { 700 asprintf(&f1mark, "<<<<<<< %s", 701 labels[0] != NULL ? labels[0] : file1); 702 if (f1mark == NULL) 703 err(2, "asprintf"); 704 asprintf(&f2mark, "||||||| %s", 705 labels[1] != NULL ? labels[1] : file2); 706 if (f2mark == NULL) 707 err(2, "asprintf"); 708 asprintf(&f3mark, ">>>>>>> %s", 709 labels[2] != NULL ? labels[2] : file3); 710 if (f3mark == NULL) 711 err(2, "asprintf"); 712 } 713 fp[0] = fopen(file1, "r"); 714 if (fp[0] == NULL) 715 err(2, "Can't open %s", file1); 716 if (caph_rights_limit(fileno(fp[0]), &rights_ro) < 0) 717 err(2, "unable to limit rights on: %s", file1); 718 719 fp[1] = fopen(file2, "r"); 720 if (fp[1] == NULL) 721 err(2, "Can't open %s", file2); 722 if (caph_rights_limit(fileno(fp[1]), &rights_ro) < 0) 723 err(2, "unable to limit rights on: %s", file2); 724 725 fp[2] = fopen(file3, "r"); 726 if (fp[2] == NULL) 727 err(2, "Can't open %s", file3); 728 if (caph_rights_limit(fileno(fp[2]), &rights_ro) < 0) 729 err(2, "unable to limit rights on: %s", file3); 730 731 if (pipe(fd13)) 732 err(2, "pipe"); 733 if (pipe(fd23)) 734 err(2, "pipe"); 735 736 diffargv[diffargc] = file1; 737 diffargv[diffargc + 1] = file3; 738 diffargv[diffargc + 2] = NULL; 739 740 nleft = 0; 741 pd13 = diffexec(diffprog, diffargv, fd13); 742 EV_SET(e + nleft , pd13, EVFILT_PROCDESC, EV_ADD, NOTE_EXIT, 0, NULL); 743 if (kevent(kq, e + nleft, 1, NULL, 0, NULL) == -1) 744 err(2, "kevent1"); 745 nleft++; 746 747 diffargv[diffargc] = file2; 748 pd23 = diffexec(diffprog, diffargv, fd23); 749 EV_SET(e + nleft , pd23, EVFILT_PROCDESC, EV_ADD, NOTE_EXIT, 0, NULL); 750 if (kevent(kq, e + nleft, 1, NULL, 0, NULL) == -1) 751 err(2, "kevent2"); 752 nleft++; 753 754 caph_cache_catpages(); 755 if (caph_enter() < 0) 756 err(2, "unable to enter capability mode"); 757 758 /* parse diffs */ 759 increase(); 760 m = readin(fd13[0], &d13); 761 n = readin(fd23[0], &d23); 762 763 /* waitpid cooked over pdforks */ 764 while (nleft > 0) { 765 nke = kevent(kq, NULL, 0, e, nleft, NULL); 766 if (nke == -1) 767 err(2, "kevent"); 768 for (i = 0; i < nke; i++) { 769 status = e[i].data; 770 if (WIFEXITED(status) && WEXITSTATUS(status) >= 2) 771 errx(2, "diff exited abnormally"); 772 else if (WIFSIGNALED(status)) 773 errx(2, "diff killed by signal %d", 774 WTERMSIG(status)); 775 } 776 nleft -= nke; 777 } 778 merge(m, n); 779 780 return (EXIT_SUCCESS); 781 } 782