1 /* $NetBSD: util.c,v 1.9 2011/02/27 17:33:37 joerg Exp $ */ 2 /* $FreeBSD$ */ 3 /* $OpenBSD: util.c,v 1.39 2010/07/02 22:18:03 tedu Exp $ */ 4 5 /*- 6 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD 7 * 8 * Copyright (c) 1999 James Howard and Dag-Erling Coïdan Smørgrav 9 * Copyright (C) 2008-2010 Gabor Kovesdan <gabor@FreeBSD.org> 10 * Copyright (C) 2017 Kyle Evans <kevans@FreeBSD.org> 11 * All rights reserved. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 */ 34 35 #include <sys/cdefs.h> 36 __FBSDID("$FreeBSD$"); 37 38 #include <sys/stat.h> 39 #include <sys/types.h> 40 41 #include <ctype.h> 42 #include <err.h> 43 #include <errno.h> 44 #include <fnmatch.h> 45 #include <fts.h> 46 #include <libgen.h> 47 #include <stdbool.h> 48 #include <stdio.h> 49 #include <stdlib.h> 50 #include <string.h> 51 #include <unistd.h> 52 #include <wchar.h> 53 #include <wctype.h> 54 55 #include "grep.h" 56 57 static bool first_match = true; 58 59 /* 60 * Match printing context 61 */ 62 struct mprintc { 63 long long tail; /* Number of trailing lines to record */ 64 int last_outed; /* Number of lines since last output */ 65 bool doctx; /* Printing context? */ 66 bool printmatch; /* Printing matches? */ 67 bool same_file; /* Same file as previously printed? */ 68 }; 69 70 static void procmatch_match(struct mprintc *mc, struct parsec *pc); 71 static void procmatch_nomatch(struct mprintc *mc, struct parsec *pc); 72 static bool procmatches(struct mprintc *mc, struct parsec *pc, bool matched); 73 #ifdef WITH_INTERNAL_NOSPEC 74 static int litexec(const struct pat *pat, const char *string, 75 size_t nmatch, regmatch_t pmatch[]); 76 #endif 77 static bool procline(struct parsec *pc); 78 static void printline(struct parsec *pc, int sep); 79 static void printline_metadata(struct str *line, int sep); 80 81 bool 82 file_matching(const char *fname) 83 { 84 char *fname_base, *fname_buf; 85 bool ret; 86 87 ret = finclude ? false : true; 88 fname_buf = strdup(fname); 89 if (fname_buf == NULL) 90 err(2, "strdup"); 91 fname_base = basename(fname_buf); 92 93 for (unsigned int i = 0; i < fpatterns; ++i) { 94 if (fnmatch(fpattern[i].pat, fname, 0) == 0 || 95 fnmatch(fpattern[i].pat, fname_base, 0) == 0) 96 /* 97 * The last pattern matched wins exclusion/inclusion 98 * rights, so we can't reasonably bail out early here. 99 */ 100 ret = (fpattern[i].mode != EXCL_PAT); 101 } 102 free(fname_buf); 103 return (ret); 104 } 105 106 static inline bool 107 dir_matching(const char *dname) 108 { 109 bool ret; 110 111 ret = dinclude ? false : true; 112 113 for (unsigned int i = 0; i < dpatterns; ++i) { 114 if (dname != NULL && fnmatch(dpattern[i].pat, dname, 0) == 0) 115 /* 116 * The last pattern matched wins exclusion/inclusion 117 * rights, so we can't reasonably bail out early here. 118 */ 119 ret = (dpattern[i].mode != EXCL_PAT); 120 } 121 return (ret); 122 } 123 124 /* 125 * Processes a directory when a recursive search is performed with 126 * the -R option. Each appropriate file is passed to procfile(). 127 */ 128 bool 129 grep_tree(char **argv) 130 { 131 FTS *fts; 132 FTSENT *p; 133 int fts_flags; 134 bool matched, ok; 135 const char *wd[] = { ".", NULL }; 136 137 matched = false; 138 139 /* This switch effectively initializes 'fts_flags' */ 140 switch(linkbehave) { 141 case LINK_EXPLICIT: 142 fts_flags = FTS_COMFOLLOW; 143 break; 144 case LINK_SKIP: 145 fts_flags = FTS_PHYSICAL; 146 break; 147 default: 148 fts_flags = FTS_LOGICAL; 149 } 150 151 fts_flags |= FTS_NOSTAT | FTS_NOCHDIR; 152 153 fts = fts_open((argv[0] == NULL) ? 154 __DECONST(char * const *, wd) : argv, fts_flags, NULL); 155 if (fts == NULL) 156 err(2, "fts_open"); 157 while ((p = fts_read(fts)) != NULL) { 158 switch (p->fts_info) { 159 case FTS_DNR: 160 /* FALLTHROUGH */ 161 case FTS_ERR: 162 file_err = true; 163 if(!sflag) 164 warnx("%s: %s", p->fts_path, strerror(p->fts_errno)); 165 break; 166 case FTS_D: 167 /* FALLTHROUGH */ 168 case FTS_DP: 169 if (dexclude || dinclude) 170 if (!dir_matching(p->fts_name) || 171 !dir_matching(p->fts_path)) 172 fts_set(fts, p, FTS_SKIP); 173 break; 174 case FTS_DC: 175 /* Print a warning for recursive directory loop */ 176 warnx("warning: %s: recursive directory loop", 177 p->fts_path); 178 break; 179 default: 180 /* Check for file exclusion/inclusion */ 181 ok = true; 182 if (fexclude || finclude) 183 ok &= file_matching(p->fts_path); 184 185 if (ok && procfile(p->fts_path)) 186 matched = true; 187 break; 188 } 189 } 190 191 fts_close(fts); 192 return (matched); 193 } 194 195 static void 196 procmatch_match(struct mprintc *mc, struct parsec *pc) 197 { 198 199 if (mc->doctx) { 200 if (!first_match && (!mc->same_file || mc->last_outed > 0)) 201 printf("--\n"); 202 if (Bflag > 0) 203 printqueue(); 204 mc->tail = Aflag; 205 } 206 207 /* Print the matching line, but only if not quiet/binary */ 208 if (mc->printmatch) { 209 printline(pc, ':'); 210 while (pc->matchidx >= MAX_MATCHES) { 211 /* Reset matchidx and try again */ 212 pc->matchidx = 0; 213 if (procline(pc)) 214 printline(pc, ':'); 215 else 216 break; 217 } 218 first_match = false; 219 mc->same_file = true; 220 mc->last_outed = 0; 221 } 222 } 223 224 static void 225 procmatch_nomatch(struct mprintc *mc, struct parsec *pc) 226 { 227 228 /* Deal with any -A context as needed */ 229 if (mc->tail > 0) { 230 grep_printline(&pc->ln, '-'); 231 mc->tail--; 232 if (Bflag > 0) 233 clearqueue(); 234 } else if (Bflag == 0 || (Bflag > 0 && enqueue(&pc->ln))) 235 /* 236 * Enqueue non-matching lines for -B context. If we're not 237 * actually doing -B context or if the enqueue resulted in a 238 * line being rotated out, then go ahead and increment 239 * last_outed to signify a gap between context/match. 240 */ 241 ++mc->last_outed; 242 } 243 244 /* 245 * Process any matches in the current parsing context, return a boolean 246 * indicating whether we should halt any further processing or not. 'true' to 247 * continue processing, 'false' to halt. 248 */ 249 static bool 250 procmatches(struct mprintc *mc, struct parsec *pc, bool matched) 251 { 252 253 /* 254 * XXX TODO: This should loop over pc->matches and handle things on a 255 * line-by-line basis, setting up a `struct str` as needed. 256 */ 257 /* Deal with any -B context or context separators */ 258 if (matched) { 259 procmatch_match(mc, pc); 260 261 /* Count the matches if we have a match limit */ 262 if (mflag) { 263 /* XXX TODO: Decrement by number of matched lines */ 264 mcount -= 1; 265 if (mcount <= 0) 266 return (false); 267 } 268 } else if (mc->doctx) 269 procmatch_nomatch(mc, pc); 270 271 return (true); 272 } 273 274 /* 275 * Opens a file and processes it. Each file is processed line-by-line 276 * passing the lines to procline(). 277 */ 278 bool 279 procfile(const char *fn) 280 { 281 struct parsec pc; 282 struct mprintc mc; 283 struct file *f; 284 struct stat sb; 285 mode_t s; 286 int lines; 287 bool line_matched; 288 289 if (strcmp(fn, "-") == 0) { 290 fn = label != NULL ? label : errstr[1]; 291 f = grep_open(NULL); 292 } else { 293 if (stat(fn, &sb) == 0) { 294 /* Check if we need to process the file */ 295 s = sb.st_mode & S_IFMT; 296 if (dirbehave == DIR_SKIP && s == S_IFDIR) 297 return (false); 298 if (devbehave == DEV_SKIP && (s == S_IFIFO || 299 s == S_IFCHR || s == S_IFBLK || s == S_IFSOCK)) 300 return (false); 301 } 302 f = grep_open(fn); 303 } 304 if (f == NULL) { 305 file_err = true; 306 if (!sflag) 307 warn("%s", fn); 308 return (false); 309 } 310 311 pc.ln.file = grep_strdup(fn); 312 pc.ln.line_no = 0; 313 pc.ln.len = 0; 314 pc.ln.boff = 0; 315 pc.ln.off = -1; 316 pc.binary = f->binary; 317 pc.cntlines = false; 318 memset(&mc, 0, sizeof(mc)); 319 mc.printmatch = true; 320 line_matched = false; 321 if ((pc.binary && binbehave == BINFILE_BIN) || cflag || qflag || 322 lflag || Lflag) 323 mc.printmatch = false; 324 if (mc.printmatch && (Aflag != 0 || Bflag != 0)) 325 mc.doctx = true; 326 if (mc.printmatch && (Aflag != 0 || Bflag != 0 || mflag || nflag)) 327 pc.cntlines = true; 328 mcount = mlimit; 329 330 for (lines = 0; lines == 0 || !(lflag || qflag); ) { 331 /* 332 * XXX TODO: We need to revisit this in a chunking world. We're 333 * not going to be doing per-line statistics because of the 334 * overhead involved. procmatches can figure that stuff out as 335 * needed. */ 336 /* Reset per-line statistics */ 337 pc.printed = 0; 338 pc.matchidx = 0; 339 pc.lnstart = 0; 340 pc.ln.boff = 0; 341 pc.ln.off += pc.ln.len + 1; 342 /* XXX TODO: Grab a chunk */ 343 if ((pc.ln.dat = grep_fgetln(f, &pc)) == NULL || 344 pc.ln.len == 0) 345 break; 346 347 if (pc.ln.len > 0 && pc.ln.dat[pc.ln.len - 1] == fileeol) 348 --pc.ln.len; 349 pc.ln.line_no++; 350 351 /* Return if we need to skip a binary file */ 352 if (pc.binary && binbehave == BINFILE_SKIP) { 353 grep_close(f); 354 free(pc.ln.file); 355 free(f); 356 return (0); 357 } 358 359 line_matched = procline(&pc); 360 if (line_matched) 361 ++lines; 362 363 /* Halt processing if we hit our match limit */ 364 if (!procmatches(&mc, &pc, line_matched)) 365 break; 366 } 367 if (Bflag > 0) 368 clearqueue(); 369 grep_close(f); 370 371 if (cflag) { 372 if (!hflag) 373 printf("%s:", pc.ln.file); 374 printf("%u\n", lines); 375 } 376 if (lflag && !qflag && lines != 0) 377 printf("%s%c", fn, nullflag ? 0 : '\n'); 378 if (Lflag && !qflag && lines == 0) 379 printf("%s%c", fn, nullflag ? 0 : '\n'); 380 if (lines != 0 && !cflag && !lflag && !Lflag && 381 binbehave == BINFILE_BIN && f->binary && !qflag) 382 printf(errstr[7], fn); 383 384 free(pc.ln.file); 385 free(f); 386 return (lines != 0); 387 } 388 389 #ifdef WITH_INTERNAL_NOSPEC 390 /* 391 * Internal implementation of literal string search within a string, modeled 392 * after regexec(3), for use when the regex(3) implementation doesn't offer 393 * either REG_NOSPEC or REG_LITERAL. This does not apply in the default FreeBSD 394 * config, but in other scenarios such as building against libgnuregex or on 395 * some non-FreeBSD OSes. 396 */ 397 static int 398 litexec(const struct pat *pat, const char *string, size_t nmatch, 399 regmatch_t pmatch[]) 400 { 401 char *(*strstr_fn)(const char *, const char *); 402 char *sub, *subject; 403 const char *search; 404 size_t idx, n, ofs, stringlen; 405 406 if (cflags & REG_ICASE) 407 strstr_fn = strcasestr; 408 else 409 strstr_fn = strstr; 410 idx = 0; 411 ofs = pmatch[0].rm_so; 412 stringlen = pmatch[0].rm_eo; 413 if (ofs >= stringlen) 414 return (REG_NOMATCH); 415 subject = strndup(string, stringlen); 416 if (subject == NULL) 417 return (REG_ESPACE); 418 for (n = 0; ofs < stringlen;) { 419 search = (subject + ofs); 420 if ((unsigned long)pat->len > strlen(search)) 421 break; 422 sub = strstr_fn(search, pat->pat); 423 /* 424 * Ignoring the empty string possibility due to context: grep optimizes 425 * for empty patterns and will never reach this point. 426 */ 427 if (sub == NULL) 428 break; 429 ++n; 430 /* Fill in pmatch if necessary */ 431 if (nmatch > 0) { 432 pmatch[idx].rm_so = ofs + (sub - search); 433 pmatch[idx].rm_eo = pmatch[idx].rm_so + pat->len; 434 if (++idx == nmatch) 435 break; 436 ofs = pmatch[idx].rm_so + 1; 437 } else 438 /* We only needed to know if we match or not */ 439 break; 440 } 441 free(subject); 442 if (n > 0 && nmatch > 0) 443 for (n = idx; n < nmatch; ++n) 444 pmatch[n].rm_so = pmatch[n].rm_eo = -1; 445 446 return (n > 0 ? 0 : REG_NOMATCH); 447 } 448 #endif /* WITH_INTERNAL_NOSPEC */ 449 450 #define iswword(x) (iswalnum((x)) || (x) == L'_') 451 452 /* 453 * Processes a line comparing it with the specified patterns. Each pattern 454 * is looped to be compared along with the full string, saving each and every 455 * match, which is necessary to colorize the output and to count the 456 * matches. The matching lines are passed to printline() to display the 457 * appropriate output. 458 */ 459 static bool 460 procline(struct parsec *pc) 461 { 462 regmatch_t pmatch, lastmatch, chkmatch; 463 wchar_t wbegin, wend; 464 size_t st, nst; 465 unsigned int i; 466 int r = 0, leflags = eflags; 467 size_t startm = 0, matchidx; 468 unsigned int retry; 469 bool lastmatched, matched; 470 471 matchidx = pc->matchidx; 472 473 /* Special case: empty pattern with -w flag, check first character */ 474 if (matchall && wflag) { 475 if (pc->ln.len == 0) 476 return (true); 477 wend = L' '; 478 if (sscanf(&pc->ln.dat[0], "%lc", &wend) != 1 || iswword(wend)) 479 return (false); 480 else 481 return (true); 482 } else if (matchall) 483 return (true); 484 485 matched = false; 486 st = pc->lnstart; 487 nst = 0; 488 /* Initialize to avoid a false positive warning from GCC. */ 489 lastmatch.rm_so = lastmatch.rm_eo = 0; 490 491 /* Loop to process the whole line */ 492 while (st <= pc->ln.len) { 493 lastmatched = false; 494 startm = matchidx; 495 retry = 0; 496 if (st > 0 && pc->ln.dat[st - 1] != fileeol) 497 leflags |= REG_NOTBOL; 498 /* Loop to compare with all the patterns */ 499 for (i = 0; i < patterns; i++) { 500 pmatch.rm_so = st; 501 pmatch.rm_eo = pc->ln.len; 502 #ifdef WITH_INTERNAL_NOSPEC 503 if (grepbehave == GREP_FIXED) 504 r = litexec(&pattern[i], pc->ln.dat, 1, &pmatch); 505 else 506 #endif 507 r = regexec(&r_pattern[i], pc->ln.dat, 1, &pmatch, 508 leflags); 509 if (r != 0) 510 continue; 511 /* Check for full match */ 512 if (xflag && (pmatch.rm_so != 0 || 513 (size_t)pmatch.rm_eo != pc->ln.len)) 514 continue; 515 /* Check for whole word match */ 516 if (wflag) { 517 wbegin = wend = L' '; 518 if (pmatch.rm_so != 0 && 519 sscanf(&pc->ln.dat[pmatch.rm_so - 1], 520 "%lc", &wbegin) != 1) 521 r = REG_NOMATCH; 522 else if ((size_t)pmatch.rm_eo != 523 pc->ln.len && 524 sscanf(&pc->ln.dat[pmatch.rm_eo], 525 "%lc", &wend) != 1) 526 r = REG_NOMATCH; 527 else if (iswword(wbegin) || 528 iswword(wend)) 529 r = REG_NOMATCH; 530 /* 531 * If we're doing whole word matching and we 532 * matched once, then we should try the pattern 533 * again after advancing just past the start of 534 * the earliest match. This allows the pattern 535 * to match later on in the line and possibly 536 * still match a whole word. 537 */ 538 if (r == REG_NOMATCH && 539 (retry == pc->lnstart || 540 (unsigned int)pmatch.rm_so + 1 < retry)) 541 retry = pmatch.rm_so + 1; 542 if (r == REG_NOMATCH) 543 continue; 544 } 545 lastmatched = true; 546 lastmatch = pmatch; 547 548 if (matchidx == 0) 549 matched = true; 550 551 /* 552 * Replace previous match if the new one is earlier 553 * and/or longer. This will lead to some amount of 554 * extra work if -o/--color are specified, but it's 555 * worth it from a correctness point of view. 556 */ 557 if (matchidx > startm) { 558 chkmatch = pc->matches[matchidx - 1]; 559 if (pmatch.rm_so < chkmatch.rm_so || 560 (pmatch.rm_so == chkmatch.rm_so && 561 (pmatch.rm_eo - pmatch.rm_so) > 562 (chkmatch.rm_eo - chkmatch.rm_so))) { 563 pc->matches[matchidx - 1] = pmatch; 564 nst = pmatch.rm_eo; 565 } 566 } else { 567 /* Advance as normal if not */ 568 pc->matches[matchidx++] = pmatch; 569 nst = pmatch.rm_eo; 570 } 571 /* avoid excessive matching - skip further patterns */ 572 if ((color == NULL && !oflag) || qflag || lflag || 573 matchidx >= MAX_MATCHES) { 574 pc->lnstart = nst; 575 lastmatched = false; 576 break; 577 } 578 } 579 580 /* 581 * Advance to just past the start of the earliest match, try 582 * again just in case we still have a chance to match later in 583 * the string. 584 */ 585 if (!lastmatched && retry > pc->lnstart) { 586 st = retry; 587 continue; 588 } 589 590 /* XXX TODO: We will need to keep going, since we're chunky */ 591 /* One pass if we are not recording matches */ 592 if (!wflag && ((color == NULL && !oflag) || qflag || lflag || Lflag)) 593 break; 594 595 /* If we didn't have any matches or REG_NOSUB set */ 596 if (!lastmatched || (cflags & REG_NOSUB)) 597 nst = pc->ln.len; 598 599 if (!lastmatched) 600 /* No matches */ 601 break; 602 else if (st == nst && lastmatch.rm_so == lastmatch.rm_eo) 603 /* Zero-length match -- advance one more so we don't get stuck */ 604 nst++; 605 606 /* Advance st based on previous matches */ 607 st = nst; 608 pc->lnstart = st; 609 } 610 611 /* Reflect the new matchidx in the context */ 612 pc->matchidx = matchidx; 613 if (vflag) 614 matched = !matched; 615 return matched; 616 } 617 618 /* 619 * Safe malloc() for internal use. 620 */ 621 void * 622 grep_malloc(size_t size) 623 { 624 void *ptr; 625 626 if ((ptr = malloc(size)) == NULL) 627 err(2, "malloc"); 628 return (ptr); 629 } 630 631 /* 632 * Safe calloc() for internal use. 633 */ 634 void * 635 grep_calloc(size_t nmemb, size_t size) 636 { 637 void *ptr; 638 639 if ((ptr = calloc(nmemb, size)) == NULL) 640 err(2, "calloc"); 641 return (ptr); 642 } 643 644 /* 645 * Safe realloc() for internal use. 646 */ 647 void * 648 grep_realloc(void *ptr, size_t size) 649 { 650 651 if ((ptr = realloc(ptr, size)) == NULL) 652 err(2, "realloc"); 653 return (ptr); 654 } 655 656 /* 657 * Safe strdup() for internal use. 658 */ 659 char * 660 grep_strdup(const char *str) 661 { 662 char *ret; 663 664 if ((ret = strdup(str)) == NULL) 665 err(2, "strdup"); 666 return (ret); 667 } 668 669 /* 670 * Print an entire line as-is, there are no inline matches to consider. This is 671 * used for printing context. 672 */ 673 void grep_printline(struct str *line, int sep) { 674 printline_metadata(line, sep); 675 fwrite(line->dat, line->len, 1, stdout); 676 putchar(fileeol); 677 } 678 679 static void 680 printline_metadata(struct str *line, int sep) 681 { 682 bool printsep; 683 684 printsep = false; 685 if (!hflag) { 686 if (!nullflag) { 687 fputs(line->file, stdout); 688 printsep = true; 689 } else { 690 printf("%s", line->file); 691 putchar(0); 692 } 693 } 694 if (nflag) { 695 if (printsep) 696 putchar(sep); 697 printf("%d", line->line_no); 698 printsep = true; 699 } 700 if (bflag) { 701 if (printsep) 702 putchar(sep); 703 printf("%lld", (long long)(line->off + line->boff)); 704 printsep = true; 705 } 706 if (printsep) 707 putchar(sep); 708 } 709 710 /* 711 * Prints a matching line according to the command line options. 712 */ 713 static void 714 printline(struct parsec *pc, int sep) 715 { 716 size_t a = 0; 717 size_t i, matchidx; 718 regmatch_t match; 719 720 /* If matchall, everything matches but don't actually print for -o */ 721 if (oflag && matchall) 722 return; 723 724 matchidx = pc->matchidx; 725 726 /* --color and -o */ 727 if ((oflag || color) && matchidx > 0) { 728 /* Only print metadata once per line if --color */ 729 if (!oflag && pc->printed == 0) 730 printline_metadata(&pc->ln, sep); 731 for (i = 0; i < matchidx; i++) { 732 match = pc->matches[i]; 733 /* Don't output zero length matches */ 734 if (match.rm_so == match.rm_eo) 735 continue; 736 /* 737 * Metadata is printed on a per-line basis, so every 738 * match gets file metadata with the -o flag. 739 */ 740 if (oflag) { 741 pc->ln.boff = match.rm_so; 742 printline_metadata(&pc->ln, sep); 743 } else 744 fwrite(pc->ln.dat + a, match.rm_so - a, 1, 745 stdout); 746 if (color) 747 fprintf(stdout, "\33[%sm\33[K", color); 748 fwrite(pc->ln.dat + match.rm_so, 749 match.rm_eo - match.rm_so, 1, stdout); 750 if (color) 751 fprintf(stdout, "\33[m\33[K"); 752 a = match.rm_eo; 753 if (oflag) 754 putchar('\n'); 755 } 756 if (!oflag) { 757 if (pc->ln.len - a > 0) 758 fwrite(pc->ln.dat + a, pc->ln.len - a, 1, 759 stdout); 760 putchar('\n'); 761 } 762 } else 763 grep_printline(&pc->ln, sep); 764 pc->printed++; 765 } 766