1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434
|
#
#
# Nim Grep Utility
# (c) Copyright 2012 Andreas Rumpf
#
# See the file "copying.txt", included in this
# distribution, for details about the copyright.
#
import
os, strutils, parseopt, pegs, re, terminal, osproc, tables, algorithm, times
const
Version = "2.0.0"
Usage = "nimgrep - Nim Grep Searching and Replacement Utility Version " &
Version & """
(c) 2012-2020 Andreas Rumpf
""" & slurp "../doc/nimgrep_cmdline.txt"
# Limitations / ideas / TODO:
# * No unicode support with --cols
# * Consider making --onlyAscii default, since dumping binary data has
# stability and security repercussions
# * Mode - reads entire buffer by whole from stdin, which is bad for streaming.
# To implement line-by-line reading after adding option to turn off
# multiline matches
# * Add some form of file pre-processing, e.g. feed binary files to utility
# `strings` and then do the search inside these strings
# * Add --showCol option to also show column (of match), not just line; it
# makes it easier when jump to line+col in an editor or on terminal
# Search results for a file are modelled by these levels:
# FileResult -> Block -> Output/Chunk -> SubLine
#
# 1. SubLine is an entire line or its part.
#
# 2. Chunk, which is a sequence of SubLine, represents a match and its
# surrounding context.
# Output is a Chunk or one of auxiliary results like an openError.
#
# 3. Block, which is a sequence of Chunks, is not present as a separate type.
# It will just be separated from another Block by newline when there is
# more than 3 lines in it.
# Here is an example of a Block where only 1 match is found and
# 1 line before and 1 line after of context are required:
#
# ...a_line_before...................................... <<<SubLine(Chunk 1)
#
# .......pre....... ....new_match.... .......post......
# ^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^
# SubLine (Chunk 1) SubLine (Chunk 1) SubLine (Chunk 2)
#
# ...a_line_after....................................... <<<SubLine(Chunk 2)
#
# 4. FileResult is printed as a sequence of Blocks.
# However FileResult is represented as seq[Output] in the program.
type
TOption = enum
optFind, optReplace, optPeg, optRegex, optRecursive, optConfirm, optStdin,
optWord, optIgnoreCase, optIgnoreStyle, optVerbose, optFilenames,
optRex, optFollow, optCount, optLimitChars, optPipe
TOptions = set[TOption]
TConfirmEnum = enum
ceAbort, ceYes, ceAll, ceNo, ceNone
Bin = enum
biOn, biOnly, biOff
Pattern = Regex | Peg
MatchInfo = tuple[first: int, last: int;
lineBeg: int, lineEnd: int, match: string]
outputKind = enum
openError, rejected, justCount,
blockFirstMatch, blockNextMatch, blockEnd, fileContents, outputFileName
Output = object
case kind: outputKind
of openError: msg: string # file/directory not found
of rejected: reason: string # when the file contents do not pass
of justCount: matches: int # the only output for option --count
of blockFirstMatch, blockNextMatch: # the normal case: match itself
pre: string
match: MatchInfo
of blockEnd: # block ending right after prev. match
blockEnding: string
firstLine: int
# == last lineN of last match
of fileContents: # yielded for --replace only
buffer: string
of outputFileName: # yielded for --filenames when no
name: string # PATTERN was provided
Trequest = (int, string)
FileResult = seq[Output]
Tresult = tuple[finished: bool, fileNo: int,
filename: string, fileResult: FileResult]
WalkOpt = tuple # used for walking directories/producing paths
extensions: seq[string]
notExtensions: seq[string]
filename: seq[string]
notFilename: seq[string]
dirPath: seq[string]
notDirPath: seq[string]
dirname : seq[string]
notDirname : seq[string]
WalkOptComp[Pat] = tuple # a compiled version of the previous
filename: seq[Pat]
notFilename: seq[Pat]
dirname : seq[Pat]
notDirname : seq[Pat]
dirPath: seq[Pat]
notDirPath: seq[Pat]
SearchOpt = tuple # used for searching inside a file
patternSet: bool # To distinguish uninitialized/empty 'pattern'
pattern: string # Main PATTERN
inFile: seq[string] # --inFile, --inf
notInFile: seq[string] # --notinFile, --ninf
inContext: seq[string] # --inContext, --inc
notInContext: seq[string] # --notinContext, --ninc
checkBin: Bin # --bin, --text
SearchOptComp[Pat] = tuple # a compiled version of the previous
pattern: Pat
inFile: seq[Pat]
notInFile: seq[Pat]
inContext: seq[Pat]
notInContext: seq[Pat]
SinglePattern[PAT] = tuple # compile single pattern for replacef
pattern: PAT
Column = tuple # current column info for the cropping (--limit) feature
terminal: int # column in terminal emulator
file: int # column in file (for correct Tab processing)
overflowMatches: int
var
paths: seq[string] = @[]
replacement = ""
replacementSet = false
# to distinguish between uninitialized 'replacement' and empty one
options: TOptions = {optRegex}
walkOpt {.threadvar.}: WalkOpt
searchOpt {.threadvar.}: SearchOpt
sortTime = false
sortTimeOrder = SortOrder.Ascending
useWriteStyled = true
oneline = true # turned off by --group
expandTabs = true # Tabs are expanded in oneline mode
linesBefore = 0
linesAfter = 0
linesContext = 0
newLine = false
gVar = (matches: 0, errors: 0, reallyReplace: true)
# gVar - variables that can change during search/replace
nWorkers = 0 # run in single thread by default
searchRequestsChan: Channel[Trequest]
resultsChan: Channel[Tresult]
colorTheme: string = "simple"
limitCharUsr = high(int) # don't limit line width by default
termWidth = 80
optOnlyAscii = false
searchOpt.checkBin = biOn
proc ask(msg: string): string =
stdout.write(msg)
stdout.flushFile()
result = stdin.readLine()
proc confirm: TConfirmEnum =
while true:
case normalize(ask(" [a]bort; [y]es, a[l]l, [n]o, non[e]: "))
of "a", "abort": return ceAbort
of "y", "yes": return ceYes
of "l", "all": return ceAll
of "n", "no": return ceNo
of "e", "none": return ceNone
else: discard
func countLineBreaks(s: string, first, last: int): int =
# count line breaks (unlike strutils.countLines starts count from 0)
var i = first
while i <= last:
if s[i] == '\c':
inc result
if i < last and s[i+1] == '\l': inc(i)
elif s[i] == '\l':
inc result
inc i
func beforePattern(s: string, pos: int, nLines = 1): int =
var linesLeft = nLines
result = min(pos, s.len-1)
while true:
while result >= 0 and s[result] notin {'\c', '\l'}: dec(result)
if result == -1: break
if s[result] == '\l':
dec(linesLeft)
if linesLeft == 0: break
dec(result)
if result >= 0 and s[result] == '\c': dec(result)
else: # '\c'
dec(linesLeft)
if linesLeft == 0: break
dec(result)
inc(result)
proc afterPattern(s: string, pos: int, nLines = 1): int =
result = max(0, pos)
var linesScanned = 0
while true:
while result < s.len and s[result] notin {'\c', '\l'}: inc(result)
inc(linesScanned)
if linesScanned == nLines: break
if result < s.len:
if s[result] == '\l':
inc(result)
elif s[result] == '\c':
inc(result)
if result < s.len and s[result] == '\l': inc(result)
else: break
dec(result)
template whenColors(body: untyped) =
if useWriteStyled:
body
else:
stdout.write(s)
proc printFile(s: string) =
whenColors:
case colorTheme
of "simple": stdout.write(s)
of "bnw": stdout.styledWrite(styleUnderscore, s)
of "ack": stdout.styledWrite(fgGreen, s)
of "gnu": stdout.styledWrite(fgMagenta, s)
proc printBlockFile(s: string) =
whenColors:
case colorTheme
of "simple": stdout.styledWrite(styleBright, s)
of "bnw": stdout.styledWrite(styleUnderscore, s)
of "ack": stdout.styledWrite(styleUnderscore, fgGreen, s)
of "gnu": stdout.styledWrite(styleUnderscore, fgMagenta, s)
proc printBold(s: string) =
whenColors:
stdout.styledWrite(styleBright, s)
proc printSpecial(s: string) =
whenColors:
case colorTheme
of "simple", "bnw":
stdout.styledWrite(if s == " ": styleReverse else: styleBright, s)
of "ack", "gnu": stdout.styledWrite(styleReverse, fgBlue, bgDefault, s)
proc printError(s: string) =
whenColors:
case colorTheme
of "simple", "bnw": stdout.styledWriteLine(styleBright, s)
of "ack", "gnu": stdout.styledWriteLine(styleReverse, fgRed, bgDefault, s)
stdout.flushFile()
proc printLineN(s: string, isMatch: bool) =
whenColors:
case colorTheme
of "simple": stdout.write(s)
of "bnw":
if isMatch: stdout.styledWrite(styleBright, s)
else: stdout.styledWrite(s)
of "ack":
if isMatch: stdout.styledWrite(fgYellow, s)
else: stdout.styledWrite(fgGreen, s)
of "gnu":
if isMatch: stdout.styledWrite(fgGreen, s)
else: stdout.styledWrite(fgCyan, s)
proc printBlockLineN(s: string) =
whenColors:
case colorTheme
of "simple": stdout.styledWrite(styleBright, s)
of "bnw": stdout.styledWrite(styleUnderscore, styleBright, s)
of "ack": stdout.styledWrite(styleUnderscore, fgYellow, s)
of "gnu": stdout.styledWrite(styleUnderscore, fgGreen, s)
proc writeColored(s: string) =
whenColors:
case colorTheme
of "simple": terminal.writeStyled(s, {styleUnderscore, styleBright})
of "bnw": stdout.styledWrite(styleReverse, s)
# Try styleReverse & bgDefault as a work-around against nasty feature
# "Background color erase" (sticky background after line wraps):
of "ack": stdout.styledWrite(styleReverse, fgYellow, bgDefault, s)
of "gnu": stdout.styledWrite(fgRed, s)
proc printContents(s: string, isMatch: bool) =
if isMatch:
writeColored(s)
else:
stdout.write(s)
proc writeArrow(s: string) =
whenColors:
stdout.styledWrite(styleReverse, s)
const alignment = 6 # selected so that file contents start at 8, i.e.
# Tabs expand correctly without additional care
proc blockHeader(filename: string, line: int|string, replMode=false) =
if replMode:
writeArrow(" ->\n")
elif newLine and optFilenames notin options and optPipe notin options:
if oneline:
printBlockFile(filename)
printBlockLineN(":" & $line & ":")
else:
printBlockLineN($line.`$`.align(alignment) & ":")
stdout.write("\n")
proc newLn(curCol: var Column) =
stdout.write("\n")
curCol.file = 0
curCol.terminal = 0
# We reserve 10+3 chars on the right in --cols mode (optLimitChars).
# If the current match touches this right margin, subLine before it will
# be cropped (even if space is enough for subLine after the match — we
# currently don't have a way to know it since we get it afterwards).
const matchPaddingFromRight = 10
const ellipsis = "..."
proc lineHeader(filename: string, line: int|string, isMatch: bool,
curCol: var Column) =
let lineSym =
if isMatch: $line & ":"
else: $line & " "
if not newLine and optFilenames notin options and optPipe notin options:
if oneline:
printFile(filename)
printLineN(":" & lineSym, isMatch)
curcol.terminal += filename.len + 1 + lineSym.len
else:
printLineN(lineSym.align(alignment+1), isMatch)
curcol.terminal += lineSym.align(alignment+1).len
stdout.write(" "); curCol.terminal += 1
curCol.terminal = curCol.terminal mod termWidth
if optLimitChars in options and
curCol.terminal > limitCharUsr - matchPaddingFromRight - ellipsis.len:
newLn(curCol)
proc reserveChars(mi: MatchInfo): int =
if optLimitChars in options:
let patternChars = afterPattern(mi.match, 0) + 1
result = patternChars + ellipsis.len + matchPaddingFromRight
else:
result = 0
# Our substitutions of non-printable symbol to ASCII character are similar to
# those of programm 'less'.
const lowestAscii = 0x20 # lowest ASCII Latin printable symbol (@)
const largestAscii = 0x7e
const by2ascii = 2 # number of ASCII chars to represent chars < lowestAscii
const by3ascii = 3 # number of ASCII chars to represent chars > largestAscii
proc printExpanded(s: string, curCol: var Column, isMatch: bool,
limitChar: int) =
# Print taking into account tabs and optOnlyAscii (and also optLimitChar:
# the proc called from printCropped but we need to check column < limitChar
# also here, since exact cut points are known only after tab expansion).
# With optOnlyAscii non-ascii chars are highlighted even in matches.
#
# use buffer because:
# 1) we need to print non-ascii character inside matches while keeping the
# amount of color escape sequences minimal.
# 2) there is a report that fwrite buffering is slow on MacOS
# https://github.com/nim-lang/Nim/pull/15612#discussion_r510538326
const bufSize = 8192 # typical for fwrite too
var buffer: string
const normal = 0
const special = 1
var lastAdded = normal
template dumpBuf() =
if lastAdded == normal:
printContents(buffer, isMatch)
else:
printSpecial(buffer)
template addBuf(i: int, s: char|string, size: int) =
if lastAdded != i or buffer.len + size > bufSize:
dumpBuf()
buffer.setlen(0)
buffer.add s
lastAdded = i
for c in s:
let charsAllowed = limitChar - curCol.terminal
if charsAllowed <= 0:
break
if lowestAscii <= int(c) and int(c) <= largestAscii: # ASCII latin
addBuf(normal, c, 1)
curCol.file += 1; curCol.terminal += 1
elif (not optOnlyAscii) and c != '\t': # the same, print raw
addBuf(normal, c, 1)
curCol.file += 1; curCol.terminal += 1
elif c == '\t':
let spaces = 8 - (curCol.file mod 8)
let spacesAllowed = min(spaces, charsAllowed)
curCol.file += spaces
curCol.terminal += spacesAllowed
if expandTabs:
if optOnlyAscii: # print a nice box for tab
addBuf(special, " ", 1)
addBuf(normal, " ".repeat(spacesAllowed-1), spacesAllowed-1)
else:
addBuf(normal, " ".repeat(spacesAllowed), spacesAllowed)
else:
addBuf(normal, '\t', 1)
else: # substitute characters that are not ACSII Latin
if int(c) < lowestAscii:
let substitute = char(int(c) + 0x40) # use common "control codes"
addBuf(special, "^" & substitute, by2ascii)
curCol.terminal += by2ascii
else: # int(c) > largestAscii
curCol.terminal += by3ascii
let substitute = '\'' & c.BiggestUInt.toHex(2)
addBuf(special, substitute, by3ascii)
curCol.file += 1
if buffer.len > 0:
dumpBuf()
template nextCharacter(c: char, file: var int, term: var int) =
if lowestAscii <= int(c) and int(c) <= largestAscii: # ASCII latin
file += 1
term += 1
elif (not optOnlyAscii) and c != '\t': # the same, print raw
file += 1
term += 1
elif c == '\t':
term += 8 - (file mod 8)
file += 8 - (file mod 8)
elif int(c) < lowestAscii:
file += 1
term += by2ascii
else: # int(c) > largestAscii:
file += 1
term += by3ascii
proc calcTermLen(s: string, firstCol: int, chars: int, fromLeft: bool): int =
# calculate additional length added by Tabs expansion and substitutions
var col = firstCol
var first, last: int
if fromLeft:
first = max(0, s.len - chars)
last = s.len - 1
else:
first = 0
last = min(s.len - 1, chars - 1)
for c in s[first .. last]:
nextCharacter(c, col, result)
proc printCropped(s: string, curCol: var Column, fromLeft: bool,
limitChar: int, isMatch = false) =
# print line `s`, may be cropped if option --cols was set
const eL = ellipsis.len
if optLimitChars notin options:
if not expandTabs and not optOnlyAscii: # for speed mostly
printContents(s, isMatch)
else:
printExpanded(s, curCol, isMatch, limitChar)
else: # limit columns, expand Tabs is also forced
var charsAllowed = limitChar - curCol.terminal
if fromLeft and charsAllowed < eL:
charsAllowed = eL
if (not fromLeft) and charsAllowed <= 0:
# already overflown and ellipsis shold be in place
return
let fullLenWithin = calcTermLen(s, curCol.file, charsAllowed, fromLeft)
# additional length from Tabs and special symbols
let addLen = fullLenWithin - min(s.len, charsAllowed)
# determine that the string is guaranteed to fit within `charsAllowed`
let fits =
if s.len > charsAllowed:
false
else:
if isMatch: fullLenWithin <= charsAllowed - eL
else: fullLenWithin <= charsAllowed
if fits:
printExpanded(s, curCol, isMatch, limitChar = high(int))
else:
if fromLeft:
printBold ellipsis
curCol.terminal += eL
# find position `pos` where the right side of line will fit charsAllowed
var col = 0
var term = 0
var pos = min(s.len, max(0, s.len - (charsAllowed - eL)))
while pos <= s.len - 1:
let c = s[pos]
nextCharacter(c, col, term)
if term >= addLen:
break
inc pos
curCol.file = pos
# TODO don't expand tabs when cropped from the left - difficult, meaningless
printExpanded(s[pos .. s.len - 1], curCol, isMatch,
limitChar = high(int))
else:
let last = max(-1, min(s.len - 1, charsAllowed - eL - 1))
printExpanded(s[0 .. last], curCol, isMatch, limitChar-eL)
let numDots = limitChar - curCol.terminal
printBold ".".repeat(numDots)
curCol.terminal = limitChar
proc printMatch(fileName: string, mi: MatchInfo, curCol: var Column) =
let sLines = mi.match.splitLines()
for i, l in sLines:
if i > 0:
lineHeader(filename, mi.lineBeg + i, isMatch = true, curCol)
let charsAllowed = limitCharUsr - curCol.terminal
if charsAllowed > 0:
printCropped(l, curCol, fromLeft = false, limitCharUsr, isMatch = true)
else:
curCol.overflowMatches += 1
if i < sLines.len - 1:
newLn(curCol)
proc getSubLinesBefore(buf: string, curMi: MatchInfo): string =
let first = beforePattern(buf, curMi.first-1, linesBefore+1)
result = substr(buf, first, curMi.first-1)
proc printSubLinesBefore(filename: string, beforeMatch: string, lineBeg: int,
curCol: var Column, reserveChars: int,
replMode=false) =
# start block: print 'linesBefore' lines before current match `curMi`
let sLines = splitLines(beforeMatch)
let startLine = lineBeg - sLines.len + 1
blockHeader(filename, lineBeg, replMode=replMode)
for i, l in sLines:
let isLastLine = i == sLines.len - 1
lineHeader(filename, startLine + i, isMatch = isLastLine, curCol)
let limit = if isLastLine: limitCharUsr - reserveChars else: limitCharUsr
l.printCropped(curCol, fromLeft = isLastLine, limitChar = limit)
if not isLastLine:
newLn(curCol)
proc getSubLinesAfter(buf: string, mi: MatchInfo): string =
let last = afterPattern(buf, mi.last+1, 1+linesAfter)
let skipByte = # workaround posix: suppress extra line at the end of file
if (last == buf.len-1 and buf.len >= 2 and
buf[^1] == '\l' and buf[^2] != '\c'): 1
else: 0
result = substr(buf, mi.last+1, last - skipByte)
proc printOverflow(filename: string, line: int, curCol: var Column) =
if curCol.overflowMatches > 0:
lineHeader(filename, line, isMatch = true, curCol)
printBold("(" & $curCol.overflowMatches & " matches skipped)")
newLn(curCol)
curCol.overflowMatches = 0
proc printSubLinesAfter(filename: string, afterMatch: string, matchLineEnd: int,
curCol: var Column) =
# finish block: print 'linesAfter' lines after match `mi`
let sLines = splitLines(afterMatch)
if sLines.len == 0: # EOF
newLn(curCol)
else:
sLines[0].printCropped(curCol, fromLeft = false, limitCharUsr)
# complete the line after the match itself
newLn(curCol)
printOverflow(filename, matchLineEnd, curCol)
for i in 1 ..< sLines.len:
lineHeader(filename, matchLineEnd + i, isMatch = false, curCol)
sLines[i].printCropped(curCol, fromLeft = false, limitCharUsr)
newLn(curCol)
proc getSubLinesBetween(buf: string, prevMi: MatchInfo,
curMi: MatchInfo): string =
buf.substr(prevMi.last+1, curMi.first-1)
proc printBetweenMatches(filename: string, betweenMatches: string,
lastLineBeg: int,
curCol: var Column, reserveChars: int) =
# continue block: print between `prevMi` and `curMi`
let sLines = betweenMatches.splitLines()
sLines[0].printCropped(curCol, fromLeft = false, limitCharUsr)
# finish the line of previous Match
if sLines.len > 1:
newLn(curCol)
printOverflow(filename, lastLineBeg - sLines.len + 1, curCol)
for i in 1 ..< sLines.len:
let isLastLine = i == sLines.len - 1
lineHeader(filename, lastLineBeg - sLines.len + i + 1,
isMatch = isLastLine, curCol)
let limit = if isLastLine: limitCharUsr - reserveChars else: limitCharUsr
sLines[i].printCropped(curCol, fromLeft = isLastLine, limitChar = limit)
if not isLastLine:
newLn(curCol)
proc printReplacement(fileName: string, buf: string, mi: MatchInfo,
repl: string, showRepl: bool, curPos: int,
newBuf: string, curLine: int) =
var curCol: Column
printSubLinesBefore(fileName, getSubLinesBefore(buf, mi), mi.lineBeg,
curCol, reserveChars(mi))
printMatch(fileName, mi, curCol)
printSubLinesAfter(fileName, getSubLinesAfter(buf, mi), mi.lineEnd, curCol)
stdout.flushFile()
if showRepl:
let miForNewBuf: MatchInfo =
(first: newBuf.len, last: newBuf.len,
lineBeg: curLine, lineEnd: curLine, match: "")
printSubLinesBefore(fileName, getSubLinesBefore(newBuf, miForNewBuf),
miForNewBuf.lineBeg, curCol, reserveChars(miForNewBuf),
replMode=true)
let replLines = countLineBreaks(repl, 0, repl.len-1)
let miFixLines: MatchInfo =
(first: mi.first, last: mi.last,
lineBeg: curLine, lineEnd: curLine + replLines, match: repl)
printMatch(fileName, miFixLines, curCol)
printSubLinesAfter(fileName, getSubLinesAfter(buf, miFixLines),
miFixLines.lineEnd, curCol)
if linesAfter + linesBefore >= 2 and not newLine: stdout.write("\n")
stdout.flushFile()
proc replace1match(filename: string, buf: string, mi: MatchInfo, i: int,
r: string; newBuf: var string, curLine: var int): bool =
newBuf.add(buf.substr(i, mi.first-1))
inc(curLine, countLineBreaks(buf, i, mi.first-1))
if optConfirm in options:
printReplacement(filename, buf, mi, r, showRepl=true, i, newBuf, curLine)
case confirm()
of ceAbort: quit(0)
of ceYes: gVar.reallyReplace = true
of ceAll:
gVar.reallyReplace = true
options.excl(optConfirm)
of ceNo:
gVar.reallyReplace = false
of ceNone:
gVar.reallyReplace = false
options.excl(optConfirm)
elif optPipe notin options:
printReplacement(filename, buf, mi, r, showRepl=gVar.reallyReplace, i,
newBuf, curLine)
if gVar.reallyReplace:
result = true
newBuf.add(r)
inc(curLine, countLineBreaks(r, 0, r.len-1))
else:
newBuf.add(mi.match)
inc(curLine, countLineBreaks(mi.match, 0, mi.match.len-1))
template updateCounters(output: Output) =
case output.kind
of blockFirstMatch, blockNextMatch: inc(gVar.matches)
of justCount: inc(gVar.matches, output.matches)
of openError: inc(gVar.errors)
of rejected, blockEnd, fileContents, outputFileName: discard
proc printInfo(filename:string, output: Output) =
case output.kind
of openError:
printError("cannot open path '" & filename & "': " & output.msg)
of rejected:
if optVerbose in options:
echo "(rejected: ", output.reason, ")"
of justCount:
echo " (" & $output.matches & " matches)"
of blockFirstMatch, blockNextMatch, blockEnd, fileContents, outputFileName:
discard
proc printOutput(filename: string, output: Output, curCol: var Column) =
case output.kind
of openError, rejected, justCount: printInfo(filename, output)
of fileContents: discard # impossible
of outputFileName:
printCropped(output.name, curCol, fromLeft=false, limitCharUsr)
newLn(curCol)
of blockFirstMatch:
printSubLinesBefore(filename, output.pre, output.match.lineBeg,
curCol, reserveChars(output.match))
printMatch(filename, output.match, curCol)
of blockNextMatch:
printBetweenMatches(filename, output.pre, output.match.lineBeg,
curCol, reserveChars(output.match))
printMatch(filename, output.match, curCol)
of blockEnd:
printSubLinesAfter(filename, output.blockEnding, output.firstLine, curCol)
if linesAfter + linesBefore >= 2 and not newLine and
optFilenames notin options: stdout.write("\n")
iterator searchFile(pattern: Pattern; buffer: string): Output =
var prevMi, curMi: MatchInfo
prevMi.lineEnd = 1
var i = 0
var matches: array[0..re.MaxSubpatterns-1, string]
for j in 0..high(matches): matches[j] = ""
while true:
let t = findBounds(buffer, pattern, matches, i)
if t.first < 0 or t.last < t.first:
if prevMi.lineBeg != 0: # finalize last match
yield Output(kind: blockEnd,
blockEnding: getSubLinesAfter(buffer, prevMi),
firstLine: prevMi.lineEnd)
break
let lineBeg = prevMi.lineEnd + countLineBreaks(buffer, i, t.first-1)
curMi = (first: t.first,
last: t.last,
lineBeg: lineBeg,
lineEnd: lineBeg + countLineBreaks(buffer, t.first, t.last),
match: buffer.substr(t.first, t.last))
if prevMi.lineBeg == 0: # no prev. match, so no prev. block to finalize
let pre = getSubLinesBefore(buffer, curMi)
prevMi = curMi
yield Output(kind: blockFirstMatch, pre: pre, match: move(curMi))
else:
let nLinesBetween = curMi.lineBeg - prevMi.lineEnd
if nLinesBetween <= linesAfter + linesBefore + 1: # print as 1 block
let pre = getSubLinesBetween(buffer, prevMi, curMi)
prevMi = curMi
yield Output(kind: blockNextMatch, pre: pre, match: move(curMi))
else: # finalize previous block and then print next block
let after = getSubLinesAfter(buffer, prevMi)
yield Output(kind: blockEnd, blockEnding: after,
firstLine: prevMi.lineEnd)
let pre = getSubLinesBefore(buffer, curMi)
prevMi = curMi
yield Output(kind: blockFirstMatch,
pre: pre,
match: move(curMi))
i = t.last+1
when typeof(pattern) is Regex:
if buffer.len > MaxReBufSize:
yield Output(kind: openError, msg: "PCRE size limit is " & $MaxReBufSize)
func detectBin(buffer: string): bool =
for i in 0 ..< min(1024, buffer.len):
if buffer[i] == '\0':
return true
proc compilePeg(initPattern: string): Peg =
var pattern = initPattern
if optWord in options:
pattern = r"(^ / !\letter)(" & pattern & r") !\letter"
if optIgnoreStyle in options:
pattern = "\\y " & pattern
elif optIgnoreCase in options:
pattern = "\\i " & pattern
result = peg(pattern)
proc styleInsensitive(s: string): string =
template addx =
result.add(s[i])
inc(i)
result = ""
var i = 0
var brackets = 0
while i < s.len:
case s[i]
of 'A'..'Z', 'a'..'z', '0'..'9':
addx()
if brackets == 0: result.add("_?")
of '_':
addx()
result.add('?')
of '[':
addx()
inc(brackets)
of ']':
addx()
if brackets > 0: dec(brackets)
of '?':
addx()
if s[i] == '<':
addx()
while s[i] != '>' and s[i] != '\0': addx()
of '\\':
addx()
if s[i] in strutils.Digits:
while s[i] in strutils.Digits: addx()
else:
addx()
else: addx()
proc compileRegex(initPattern: string): Regex =
var pattern = initPattern
var reflags = {reStudy}
if optIgnoreStyle in options:
pattern = styleInsensitive(pattern)
if optWord in options:
# see https://github.com/nim-lang/Nim/issues/13528#issuecomment-592786443
pattern = r"(^|\W)(:?" & pattern & r")($|\W)"
if {optIgnoreCase, optIgnoreStyle} * options != {}:
reflags.incl reIgnoreCase
result = if optRex in options: rex(pattern, reflags)
else: re(pattern, reflags)
template declareCompiledPatterns(compiledStruct: untyped,
StructType: untyped,
body: untyped) =
{.hint[XDeclaredButNotUsed]: off.}
if optRegex notin options:
var compiledStruct: StructType[Peg]
template compile1Pattern(p: string, pat: Peg) =
if p!="": pat = p.compilePeg()
proc compileArray(initPattern: seq[string]): seq[Peg] =
for pat in initPattern:
result.add pat.compilePeg()
body
else:
var compiledStruct: StructType[Regex]
template compile1Pattern(p: string, pat: Regex) =
if p!="": pat = p.compileRegex()
proc compileArray(initPattern: seq[string]): seq[Regex] =
for pat in initPattern:
result.add pat.compileRegex()
body
{.hint[XDeclaredButNotUsed]: on.}
template ensureIncluded(includePat: seq[Pattern], str: string,
body: untyped) =
if includePat.len != 0:
var matched = false
for pat in includePat:
if str.contains(pat):
matched = true
break
if not matched:
body
template ensureExcluded(excludePat: seq[Pattern], str: string,
body: untyped) =
{.warning[UnreachableCode]: off.}
for pat in excludePat:
if str.contains(pat, 0):
body
break
{.warning[UnreachableCode]: on.}
func checkContext(context: string, searchOptC: SearchOptComp[Pattern]): bool =
ensureIncluded searchOptC.inContext, context:
return false
ensureExcluded searchOptC.notInContext, context:
return false
result = true
iterator processFile(searchOptC: SearchOptComp[Pattern], filename: string,
yieldContents=false): Output =
var buffer: string
var error = false
if optFilenames in options:
buffer = filename
elif optPipe in options:
buffer = stdin.readAll()
else:
try:
buffer = system.readFile(filename)
except IOError as e:
yield Output(kind: openError, msg: "readFile failed")
error = true
if not error:
var reject = false
var reason: string
if searchOpt.checkBin in {biOff, biOnly}:
let isBin = detectBin(buffer)
if isBin and searchOpt.checkBin == biOff:
reject = true
reason = "binary file"
if (not isBin) and searchOpt.checkBin == biOnly:
reject = true
reason = "text file"
if not reject:
ensureIncluded searchOptC.inFile, buffer:
reject = true
reason = "doesn't contain a requested match"
if not reject:
ensureExcluded searchOptC.notInFile, buffer:
reject = true
reason = "contains a forbidden match"
if reject:
yield Output(kind: rejected, reason: move(reason))
elif optFilenames in options and searchOpt.pattern == "":
yield Output(kind: outputFileName, name: move(buffer))
else:
var found = false
var cnt = 0
let skipCheckContext = (searchOpt.notInContext.len == 0 and
searchOpt.inContext.len == 0)
if skipCheckContext:
for output in searchFile(searchOptC.pattern, buffer):
found = true
if optCount notin options:
yield output
else:
if output.kind in {blockFirstMatch, blockNextMatch}:
inc(cnt)
else:
var context: string
var outputAccumulator: seq[Output]
for outp in searchFile(searchOptC.pattern, buffer):
if outp.kind in {blockFirstMatch, blockNextMatch}:
outputAccumulator.add outp
context.add outp.pre
context.add outp.match.match
elif outp.kind == blockEnd:
outputAccumulator.add outp
context.add outp.blockEnding
# context has been formed, now check it:
if checkContext(context, searchOptC):
found = true
for output in outputAccumulator:
if optCount notin options:
yield output
else:
if output.kind in {blockFirstMatch, blockNextMatch}:
inc(cnt)
context = ""
outputAccumulator.setLen 0
# end `if skipCheckContext`.
if optCount in options and cnt > 0:
yield Output(kind: justCount, matches: cnt)
if yieldContents and found and optCount notin options:
yield Output(kind: fileContents, buffer: move(buffer))
proc hasRightPath(path: string, walkOptC: WalkOptComp[Pattern]): bool =
if not (
walkOpt.extensions.len > 0 or walkOpt.notExtensions.len > 0 or
walkOpt.filename.len > 0 or walkOpt.notFilename.len > 0 or
walkOpt.notDirPath.len > 0 or walkOpt.dirPath.len > 0):
return true
let filename = path.lastPathPart
let ex = filename.splitFile.ext.substr(1) # skip leading '.'
if walkOpt.extensions.len != 0:
var matched = false
for x in walkOpt.extensions:
if os.cmpPaths(x, ex) == 0:
matched = true
break
if not matched: return false
for x in walkOpt.notExtensions:
if os.cmpPaths(x, ex) == 0: return false
ensureIncluded walkOptC.filename, filename:
return false
ensureExcluded walkOptC.notFilename, filename:
return false
let parent = path.parentDir
ensureExcluded walkOptC.notDirPath, parent:
return false
ensureIncluded walkOptC.dirPath, parent:
return false
result = true
proc isRightDirectory(path: string, walkOptC: WalkOptComp[Pattern]): bool =
## --dirname can be only checked when the final path is known
## so this proc is suitable for files only.
if walkOptC.dirname.len > 0:
var badDirname = false
var (nextParent, dirname) = splitPath(path)
# check that --dirname matches for one of directories in parent path:
while dirname != "":
badDirname = false
ensureIncluded walkOptC.dirname, dirname:
badDirname = true
if not badDirname:
break
(nextParent, dirname) = splitPath(nextParent)
if badDirname: # badDirname was set to true for all the dirs
return false
result = true
proc descendToDirectory(path: string, walkOptC: WalkOptComp[Pattern]): bool =
## --notdirname can be checked for directories immediately for optimization to
## prevent descending into undesired directories.
if walkOptC.notDirname.len > 0:
let dirname = path.lastPathPart
ensureExcluded walkOptC.notDirname, dirname:
return false
result = true
iterator walkDirBasic(dir: string, walkOptC: WalkOptComp[Pattern]): string
{.closure.} =
var dirStack = @[dir] # stack of directories
var timeFiles = newSeq[(times.Time, string)]()
while dirStack.len > 0:
let d = dirStack.pop()
let rightDirForFiles = d.isRightDirectory(walkOptC)
var files = newSeq[string]()
var dirs = newSeq[string]()
for kind, path in walkDir(d, skipSpecial = true):
case kind
of pcFile:
if path.hasRightPath(walkOptC) and rightDirForFiles:
files.add(path)
of pcLinkToFile:
if optFollow in options and path.hasRightPath(walkOptC) and
rightDirForFiles:
files.add(path)
of pcDir:
if optRecursive in options and path.descendToDirectory(walkOptC):
dirs.add path
of pcLinkToDir:
if optFollow in options and optRecursive in options and
path.descendToDirectory(walkOptC):
dirs.add path
if sortTime: # sort by time - collect files before yielding
for file in files:
var time: Time
try:
time = getLastModificationTime(file) # can fail for broken symlink
except:
discard
timeFiles.add((time, file))
else: # alphanumeric sort, yield immediately after sorting
files.sort()
for file in files:
yield file
dirs.sort(order = SortOrder.Descending)
for dir in dirs:
dirStack.add(dir)
if sortTime:
timeFiles.sort(sortTimeOrder)
for (_, file) in timeFiles:
yield file
iterator walkRec(paths: seq[string]): tuple[error: string, filename: string]
{.closure.} =
declareCompiledPatterns(walkOptC, WalkOptComp):
walkOptC.notFilename.add walkOpt.notFilename.compileArray()
walkOptC.filename.add walkOpt.filename.compileArray()
walkOptC.dirname.add walkOpt.dirname.compileArray()
walkOptC.notDirname.add walkOpt.notDirname.compileArray()
walkOptC.dirPath.add walkOpt.dirPath.compileArray()
walkOptC.notDirPath.add walkOpt.notDirPath.compileArray()
for path in paths:
if dirExists(path):
for p in walkDirBasic(path, walkOptC):
yield ("", p)
else:
yield (
if fileExists(path): ("", path)
else: ("Error: no such file or directory: ", path))
proc replaceMatches(pattern: Pattern; filename: string, buffer: string,
fileResult: FileResult) =
var newBuf = newStringOfCap(buffer.len)
var changed = false
var lineRepl = 1
var i = 0
for output in fileResult:
if output.kind in {blockFirstMatch, blockNextMatch}:
let curMi = output.match
let r = replacef(curMi.match, pattern, replacement)
if replace1match(filename, buffer, curMi, i, r, newBuf, lineRepl):
changed = true
i = curMi.last + 1
if changed and optPipe notin options:
newBuf.add(substr(buffer, i)) # finalize new buffer after last match
var f: File
if open(f, filename, fmWrite):
f.write(newBuf)
f.close()
else:
printError "cannot open file for overwriting: " & filename
inc(gVar.errors)
elif optPipe in options: # always print new buffer to stdout in pipe mode
newBuf.add(substr(buffer, i)) # finalize new buffer after last match
stdout.write(newBuf)
template processFileResult(pattern: Pattern; filename: string,
fileResult: untyped) =
var filenameShown = false
template showFilename =
if not filenameShown:
printBlockFile(filename)
stdout.write("\n")
stdout.flushFile()
filenameShown = true
if optVerbose in options:
showFilename
if optReplace notin options:
var curCol: Column
var toFlush: bool
for output in fileResult:
updateCounters(output)
toFlush = true
if output.kind notin {rejected, openError, justCount} and not oneline:
showFilename
if output.kind == justCount and oneline:
printFile(filename & ":")
printOutput(filename, output, curCol)
if nWorkers == 0 and output.kind in {blockFirstMatch, blockNextMatch}:
stdout.flushFile() # flush immediately in single thread mode
if toFlush: stdout.flushFile()
else:
var buffer = ""
var matches: FileResult
for output in fileResult:
updateCounters(output)
case output.kind
of rejected, openError, justCount, outputFileName:
printInfo(filename, output)
of blockFirstMatch, blockNextMatch, blockEnd:
matches.add(output)
of fileContents: buffer = output.buffer
if matches.len > 0:
replaceMatches(pattern, filename, buffer, matches)
proc run1Thread() =
declareCompiledPatterns(searchOptC, SearchOptComp):
compile1Pattern(searchOpt.pattern, searchOptC.pattern)
searchOptC.inFile.add searchOpt.inFile.compileArray()
searchOptC.notInFile.add searchOpt.notInFile.compileArray()
searchOptC.inContext.add searchOpt.inContext.compileArray()
searchOptC.notInContext.add searchOpt.notInContext.compileArray()
if optPipe in options:
processFileResult(searchOptC.pattern, "-",
processFile(searchOptC, "-",
yieldContents=optReplace in options))
for entry in walkRec(paths):
if entry.error != "":
inc(gVar.errors)
printError (entry.error & entry.filename)
continue
processFileResult(searchOptC.pattern, entry.filename,
processFile(searchOptC, entry.filename,
yieldContents=optReplace in options))
# Multi-threaded version: all printing is being done in the Main thread.
# Totally nWorkers+1 additional threads are created (workers + pathProducer).
# An example of case nWorkers=2:
#
# ------------------ initial paths -------------------
# | Main thread |----------------->| pathProducer |
# ------------------ -------------------
# ^ | |
# resultsChan | walking errors, | | searchRequestsChan
# | number of files | -----+-----
# ----+--------------------------- | |
# | | (when walking finished) |a path |a path to file
# | | | |
# | | V V
# | | ------------ ------------
# | | | worker 1 | | worker 2 |
# | | ------------ ------------
# | | matches in the file | |
# | -------------------------------- |
# | matches in the file |
# ----------------------------------------------
#
# The matches from each file are passed at once as FileResult type.
proc worker(initSearchOpt: SearchOpt) {.thread.} =
searchOpt = initSearchOpt # init thread-local var
declareCompiledPatterns(searchOptC, SearchOptComp):
compile1Pattern(searchOpt.pattern, searchOptC.pattern)
searchOptC.inFile.add searchOpt.inFile.compileArray()
searchOptC.notInFile.add searchOpt.notInFile.compileArray()
searchOptC.inContext.add searchOpt.inContext.compileArray()
searchOptC.notInContext.add searchOpt.notInContext.compileArray()
while true:
let (fileNo, filename) = searchRequestsChan.recv()
var fileResult: FileResult
for output in processFile(searchOptC, filename,
yieldContents=(optReplace in options)):
fileResult.add(output)
resultsChan.send((false, fileNo, filename, move(fileResult)))
proc pathProducer(arg: (seq[string], WalkOpt)) {.thread.} =
let paths = arg[0]
walkOpt = arg[1] # init thread-local copy of opt
var
nextFileN = 0
for entry in walkRec(paths):
if entry.error == "":
searchRequestsChan.send((nextFileN, entry.filename))
else:
resultsChan.send((false, nextFileN, entry.filename,
@[Output(kind: openError, msg: entry.error)]))
nextFileN += 1
resultsChan.send((true, nextFileN, "", @[])) # pass total number of files
proc runMultiThread() =
var
workers = newSeq[Thread[SearchOpt]](nWorkers)
storage = newTable[int, (string, FileResult) ]()
# file number -> tuple[filename, fileResult - accumulated data structure]
firstUnprocessedFile = 0 # for always processing files in the same order
open(searchRequestsChan)
open(resultsChan)
for n in 0 ..< nWorkers:
createThread(workers[n], worker, searchOpt)
var producerThread: Thread[(seq[string], WalkOpt)]
createThread(producerThread, pathProducer, (paths, walkOpt))
declareCompiledPatterns(pat, SinglePattern):
compile1Pattern(searchOpt.pattern, pat.pattern)
template add1fileResult(fileNo: int, fname: string, fResult: FileResult) =
storage[fileNo] = (fname, fResult)
while storage.haskey(firstUnprocessedFile):
let fileResult = storage[firstUnprocessedFile][1]
let filename = storage[firstUnprocessedFile][0]
processFileResult(pat.pattern, filename, fileResult)
storage.del(firstUnprocessedFile)
firstUnprocessedFile += 1
var totalFiles = -1 # will be known when pathProducer finishes
while totalFiles == -1 or firstUnprocessedFile < totalFiles:
let msg = resultsChan.recv()
if msg.finished:
totalFiles = msg.fileNo
else:
add1fileResult(msg.fileNo, msg.filename, msg.fileResult)
proc reportError(msg: string) =
printError "Error: " & msg
quit "Run nimgrep --help for the list of options"
proc writeHelp() =
stdout.write(Usage)
stdout.flushFile()
quit(0)
proc writeVersion() =
stdout.write(Version & "\n")
stdout.flushFile()
quit(0)
proc checkOptions(subset: TOptions, a, b: string) =
if subset <= options:
quit("cannot specify both '$#' and '$#'" % [a, b])
proc parseNonNegative(str: string, key: string): int =
try:
result = parseInt(str)
except ValueError:
reportError("Option " & key & " requires an integer but '" &
str & "' was given")
if result < 0:
reportError("A positive integer is expected for option " & key)
when defined(posix):
useWriteStyled = terminal.isatty(stdout)
# that should be before option processing to allow override of useWriteStyled
for kind, key, val in getopt():
case kind
of cmdArgument:
if options.contains(optStdin):
paths.add(key)
elif not searchOpt.patternSet:
searchOpt.pattern = key
searchOpt.patternSet = true
elif options.contains(optReplace) and not replacementSet:
replacement = key
replacementSet = true
else:
paths.add(key)
of cmdLongOption, cmdShortOption:
proc addNotEmpty(s: var seq[string], name: string) =
if name == "":
reportError("empty string given for option --" & key &
" (did you forget `:`?)")
s.add name
case normalize(key)
of "find", "f": incl(options, optFind)
of "replace", "!": incl(options, optReplace)
of "peg":
excl(options, optRegex)
incl(options, optPeg)
of "re":
incl(options, optRegex)
excl(options, optPeg)
of "rex", "x":
incl(options, optRex)
incl(options, optRegex)
excl(options, optPeg)
of "recursive", "r": incl(options, optRecursive)
of "follow": incl(options, optFollow)
of "confirm": incl(options, optConfirm)
of "stdin": incl(options, optStdin)
of "word", "w": incl(options, optWord)
of "ignorecase", "ignore-case", "i": incl(options, optIgnoreCase)
of "ignorestyle", "ignore-style", "y": incl(options, optIgnoreStyle)
of "threads", "j":
if val == "":
nWorkers = countProcessors()
else:
nWorkers = parseNonNegative(val, key)
of "extensions", "ex", "ext": walkOpt.extensions.add val.split('|')
of "nextensions", "notextensions", "nex", "notex",
"noext", "no-ext": # 2 deprecated options
walkOpt.notExtensions.add val.split('|')
of "dirname", "di":
walkOpt.dirname.addNotEmpty val
of "ndirname", "notdirname", "ndi", "notdi",
"excludedir", "exclude-dir", "ed": # 3 deprecated options
walkOpt.notDirname.addNotEmpty val
of "dirpath", "dirp",
"includedir", "include-dir", "id": # 3 deprecated options
walkOpt.dirPath.addNotEmpty val
of "ndirpath", "notdirpath", "ndirp", "notdirp":
walkOpt.notDirPath.addNotEmpty val
of "filename", "fi",
"includefile", "include-file", "if": # 3 deprecated options
walkOpt.filename.addNotEmpty val
of "nfilename", "nfi", "notfilename", "notfi",
"excludefile", "exclude-file", "ef": # 3 deprecated options
walkOpt.notFilename.addNotEmpty val
of "infile", "inf",
"matchfile", "match", "mf": # 3 deprecated options
searchOpt.inFile.addNotEmpty val
of "ninfile", "notinfile", "ninf", "notinf",
"nomatchfile", "nomatch", "nf": # 3 options are deprecated
searchOpt.notInFile.addNotEmpty val
of "incontext", "inc":
searchOpt.inContext.addNotEmpty val
of "nincontext", "notincontext", "ninc", "notinc":
searchOpt.notInContext.addNotEmpty val
of "bin":
case val
of "on": searchOpt.checkBin = biOn
of "off": searchOpt.checkBin = biOff
of "only": searchOpt.checkBin = biOnly
else: reportError("unknown value for --bin")
of "text", "t": searchOpt.checkBin = biOff
of "count": incl(options, optCount)
of "sorttime", "sort-time", "s":
case normalize(val)
of "off": sortTime = false
of "", "on", "asc", "ascending":
sortTime = true
sortTimeOrder = SortOrder.Ascending
of "desc", "descending":
sortTime = true
sortTimeOrder = SortOrder.Descending
else: reportError("invalid value '" & val & "' for --sortTime")
of "nocolor", "no-color": useWriteStyled = false
of "color":
case val
of "auto": discard
of "off", "never", "false": useWriteStyled = false
of "", "on", "always", "true": useWriteStyled = true
else: reportError("invalid value '" & val & "' for --color")
of "colortheme", "color-theme":
colortheme = normalize(val)
if colortheme notin ["simple", "bnw", "ack", "gnu"]:
reportError("unknown colortheme '" & val & "'")
of "beforecontext", "before-context", "b":
linesBefore = parseNonNegative(val, key)
of "aftercontext", "after-context", "a":
linesAfter = parseNonNegative(val, key)
of "context", "c":
linesContext = parseNonNegative(val, key)
of "newline", "l":
newLine = true
# Tabs are aligned automatically for --group, --newLine, --filenames
expandTabs = false
of "group", "g":
oneline = false
expandTabs = false
of "cols", "%":
incl(options, optLimitChars)
termWidth = terminalWidth()
if val == "auto" or key == "%":
limitCharUsr = termWidth
when defined(windows): # Windows cmd & powershell add an empty line
limitCharUsr -= 1 # when printing '\n' right after the last column
elif val == "":
limitCharUsr = 80
else:
limitCharUsr = parseNonNegative(val, key)
of "onlyascii", "only-ascii", "@":
if val == "" or val == "on" or key == "@":
optOnlyAscii = true
elif val == "off":
optOnlyAscii = false
else:
printError("unknown value for --onlyAscii option")
of "verbose": incl(options, optVerbose)
of "filenames":
incl(options, optFilenames)
expandTabs = false
of "help", "h": writeHelp()
of "version", "v": writeVersion()
of "": incl(options, optPipe)
else: reportError("unrecognized option '" & key & "'")
of cmdEnd: assert(false) # cannot happen
checkOptions({optFind, optReplace}, "find", "replace")
checkOptions({optCount, optReplace}, "count", "replace")
checkOptions({optPeg, optRegex}, "peg", "re")
checkOptions({optIgnoreCase, optIgnoreStyle}, "ignore_case", "ignore_style")
checkOptions({optFilenames, optReplace}, "filenames", "replace")
checkOptions({optPipe, optStdin}, "-", "stdin")
checkOptions({optPipe, optFilenames}, "-", "filenames")
checkOptions({optPipe, optConfirm}, "-", "confirm")
checkOptions({optPipe, optRecursive}, "-", "recursive")
linesBefore = max(linesBefore, linesContext)
linesAfter = max(linesAfter, linesContext)
if optPipe in options and paths.len != 0:
reportError("both - and paths are specified")
if optStdin in options:
searchOpt.pattern = ask("pattern [ENTER to exit]: ")
if searchOpt.pattern.len == 0: quit(0)
if optReplace in options:
replacement = ask("replacement [supports $1, $# notations]: ")
if optReplace in options and not replacementSet:
reportError("provide REPLACEMENT as second argument (use \"\" for empty one)")
if optReplace in options and paths.len == 0 and optPipe notin options:
reportError("provide paths for replacement explicitly (use . for current directory)")
if searchOpt.pattern == "" and optFilenames notin options:
reportError("empty pattern was given")
else:
if paths.len == 0 and optPipe notin options:
paths.add(".")
if optPipe in options or nWorkers == 0:
run1Thread()
else:
runMultiThread()
if gVar.errors != 0:
printError $gVar.errors & " errors"
if searchOpt.pattern != "":
# PATTERN allowed to be empty if --filenames is given
printBold($gVar.matches & " matches")
stdout.write("\n")
if gVar.errors != 0:
quit(1)
|