forked from Wikinaut/agrep
-
Notifications
You must be signed in to change notification settings - Fork 0
/
newmgrep.c
1880 lines (1748 loc) · 62.3 KB
/
newmgrep.c
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
/* Copyright (c) 1994 Sun Wu, Udi Manber, Burra Gopal. All Rights Reserved. */
/*
[fix] TG 22.10.97 3.34 in mgrep(): check bounds before memcpy-ing
[chg] TG 21.08.96 now uses ISO_CHAR.H
*/
/* multipattern matcher */
#include <stdio.h>
#include <ctype.h>
#ifdef __EMX__
#include <sys/types.h>
#endif
#ifdef _WIN32
#include <sys/stat.h>
#endif
#include "agrep.h"
#include "codepage.h"
#include <sys/time.h>
#ifndef _WIN32
#include <sys/time.h>
#else
#include <sys/timeb.h>
#endif
#include "config.h"
/* TG 29.04.04 */
#include <errno.h>
extern unsigned char LUT[256];
#define ddebug
#define uchar unsigned char
#undef MAXPAT
#define MAXPAT 256
#undef MAXLINE
#define MAXLINE 1024
#undef MAXSYM
#define MAXSYM 256
#define MAXMEMBER1 32768
/* #define MAXMEMBER1 262144 */ /*2^18 */
#define MAXPATFILE 600000
#define BLOCKSIZE 16384
#define MAXHASH 32768
/* #define MAXHASH 262144 */
#define mask5 32767
#define max_num 40000
#if ISO_CHAR_SET
#define W_DELIM 256
#else
#define W_DELIM 128
#endif
#define L_DELIM 10
#define Hbits 5 /* how much to shift to perform the hash */
extern int LIMITOUTPUT, LIMITPERFILE;
extern int BYTECOUNT, PRINTOFFSET, PRINTRECORD, CurrentByteOffset;
extern int MULTI_OUTPUT; /* used by glimpse only if OR, never for AND */
extern int DELIMITER;
extern CHAR D_pattern[MaxDelimit*2];
extern int D_length;
extern CHAR tc_D_pattern[MaxDelimit*2];
extern int tc_D_length;
extern COUNT, FNAME, SILENT, FILENAMEONLY, prev_num_of_matched, num_of_matched;
extern INVERSE, OUTTAIL;
extern WORDBOUND, WHOLELINE, NOUPPER;
extern ParseTree *AParse;
extern int AComplexPattern;
extern unsigned char CurrentFileName[], Progname[];
extern total_line;
extern agrep_initialfd;
extern int EXITONERROR;
extern int PRINTPATTERN;
extern int agrep_inlen;
extern CHAR *agrep_inbuffer;
extern FILE *agrep_finalfp;
extern int agrep_outpointer;
extern int agrep_outlen;
extern CHAR * agrep_outbuffer;
extern int errno;
extern int NEW_FILE, POST_FILTER;
extern int tuncompressible();
extern int quick_tcompress();
extern int quick_tuncompress();
extern int TCOMPRESSED;
extern int EASYSEARCH;
extern char FREQ_FILE[MAX_LINE_LEN], HASH_FILE[MAX_LINE_LEN], STRING_FILE[MAX_LINE_LEN];
extern char PAT_FILE_NAME[MAX_LINE_LEN];
uchar SHIFT1[MAXMEMBER1];
int LONG = 0;
int SHORT = 0;
int p_size= 0;
uchar tr[MAXSYM];
uchar tr1[MAXSYM];
int HASH[MAXHASH];
int Hash2[max_num];
uchar *PatPtr[max_num];
uchar *pat_spool = NULL; /* [MAXPATFILE+2*max_num+MAXPAT]; */
uchar *patt[max_num];
int pat_len[max_num];
int pat_indices[max_num]; /* pat_indices[p] gives the actual index in matched_teriminals: used only with AParse != 0 */
int num_pat;
extern char amatched_terminals[MAXNUM_PAT]; /* which patterns have been matched in the current line? Used only with AParse != 0, so max_num is not needed */
extern int anum_terminals;
extern int AComplexBoolean;
static void countline(unsigned char *text, int len);
#ifdef _WIN32
int eval_tree(); /* asplit.c */
int fill_buf(); /* bitap.c */
int monkey1(); /* newmgrep.c */
int m_short(); /* newmgrep.c */
#endif
#if DOTCOMPRESSED
/* Equivalent variables for compression search */
uchar tc_SHIFT1[MAXMEMBER1];
int tc_LONG = 0;
int tc_SHORT = 0;
int tc_p_size= 0;
uchar tc_tr[MAXSYM];
uchar tc_tr1[MAXSYM];
int tc_HASH[MAXHASH];
int tc_Hash2[max_num];
uchar *tc_PatPtr[max_num];
uchar *tc_pat_spool = NULL; /* [MAXPATFILE+2*max_num+MAXPAT]; */
uchar *tc_patt[max_num];
int tc_pat_len[max_num];
int tc_pat_indices[max_num]; /* pat_indices[p] gives the actual index in matched_teriminals: used only with AParse != 0 */
int tc_num_pat; /* must be the same as num_pat */
#endif /*DOTCOMPRESSED*/
static void f_prep();
static void f_prep1();
static void accumulate();
#if DOTCOMPRESSED
static void tc_f_prep();
static void tc_f_prep1();
static void tc_accumulate();
#endif
#ifdef perf_check
int cshift=0, cshift0=0, chash=0;
#endif
/*
* General idea behind output processing with delimiters, inverse, compression, etc.
* CAUTION: In compressed files, we can search ONLY for simple patterns or their ;,.
* Attempts to search for complex patterns / with errors might lead to spurious matches.
* 1. Once we find the match, go back and forward to get the delimiters that surround
* the matched region.
* 2. If it is a compressed file, verify that the match is "real" (compressed files
* can have pseudo matches hence this filtering step is required).
* 3. Increment num_of_matched.
* 4. Process some output options which print stuff before the matched region is
* printed.
* 5. If there is compression, decomress and output the matched region. Otherwise
* just output it as is. Remember, from step (1) we know the matched region.
* 6. If inverse is set, then we must keep track of the end of the last matched region
* in the variable lastout. When there is a match, we must print everything from
* lastout to the beginning of the current matched region (curtextbegin) and then
* update lastout to point to the end of the current matched region (curtextend).
* ALSO: if we exit from the main loops, we must output everything from the end
* of the last matched region to the end of the input buffer.
* 7. Delimiter handling in complex patterns is different: there the search is done
* for a boolean and of the delimiter pattern and the actual pattern.
* 8. For convenience and speed, the multipattern matching routines to handle
* compressed files have been separated from their (normal) counterparts.
* 9. One special note on handling complicated boolean patterns: the parse
* tree will be the same for both compressed and uncomrpessed patterns and the
* same amatched_terminals array will be used in both. BUT, the pat_spool and
* pat_index, etc., will be different as they refer to the individual terminals.
*/
int
prepf(mfp, mbuf, mlen)
int mfp, mlen;
unsigned char *mbuf;
{
int length=0, i, p=1;
uchar *pat_ptr;
unsigned Mask = 31;
int num_read;
unsigned char *buf;
struct stat stbuf;
int j, k; /* to implement \\ */
if ((mfp == -1) && ((mbuf == NULL) || (mlen <= 0))) return -1;
if (mfp != -1) {
if (fstat(mfp, &stbuf) == -1) {
fprintf(stderr, "%s: cannot stat file: %s\n", Progname, PAT_FILE_NAME);
return -1;
}
if (!S_ISREG(stbuf.st_mode)) {
fprintf(stderr, "%s: pattern file not regular file: %s\n", Progname, PAT_FILE_NAME);
return -1;
}
if (stbuf.st_size*2 > MAXPATFILE + 2*max_num) {
fprintf(stderr, "%s: pattern file too large (> %d B): %s\n", Progname, (MAXPATFILE+2*max_num)/2, PAT_FILE_NAME);
return -1;
}
if (pat_spool != NULL) free(pat_spool);
pat_ptr = pat_spool = (unsigned char *)malloc(stbuf.st_size*2 + MAXPAT);
alloc_buf(mfp, &buf, MAXPATFILE+2*BLOCKSIZE);
while((num_read = fill_buf(mfp, buf+length, 2*BLOCKSIZE)) > 0) {
length = length + num_read;
if(length > MAXPATFILE) {
fprintf(stderr, "%s: maximum pattern file size is %d\n", Progname, MAXPATFILE);
if (!EXITONERROR) {
errno = AGREP_ERROR;
free_buf(mfp, buf);
return -1;
}
else exit(2);
}
}
}
else {
buf = mbuf;
length = mlen;
if (mlen*2 > MAXPATFILE + 2*max_num) {
fprintf(stderr, "%s: pattern buffer too large (> %d B)\n", Progname, (MAXPATFILE+2*max_num)/2);
return -1;
}
if (pat_spool != NULL) free(pat_spool);
pat_ptr = pat_spool = (unsigned char *)malloc(mlen*2 + MAXPAT);
}
/* Now all the patterns are in buf */
buf[length] = '\n';
i=0; p=1;
/* removed by Udi 11/8/94 - we now do WORDBOUND "by hand"
*
* if(WORDBOUND) {
* while(i<length) {
* patt[p] = pat_ptr;
* *pat_ptr++ = W_DELIM;
* while((i<length) && ((*pat_ptr = buf[i++]) != '\n')) pat_ptr++;
* *pat_ptr++ = W_DELIM;
* *pat_ptr++ = 0;
* p++;
* }
* }
* else
*/
if(WHOLELINE) {
while(i<length) {
patt[p] = pat_ptr;
*pat_ptr++ = L_DELIM;
while((i<length) && ((*pat_ptr = buf[i++]) != '\n')) pat_ptr++;
*pat_ptr++ = L_DELIM;
*pat_ptr++ = 0;
p++;
}
}
else {
while(i < length) {
patt[p] = pat_ptr;
while((i<length) && ((*pat_ptr = buf[i++]) != '\n')) pat_ptr++;
*pat_ptr++ = 0;
p++;
}
}
/* Now, the patterns have been copied into patt[] */
if(p>max_num) {
fprintf(stderr, "%s: maximum number of patterns is %d\n", Progname, max_num);
if (!EXITONERROR) {
errno = AGREP_ERROR;
free_buf(mfp, buf);
return -1;
}
else exit(2);
}
for(i=1; i<20; i++) *pat_ptr = i; /* boundary safety zone */
/* I might have to keep changing tr s.t. mgrep won't get confused with W_DELIM */
for(i=0; i< MAXSYM; i++) tr[i] = i;
if(NOUPPER) {
for (i=0; i<MAXSYM; i++)
#if (defined(__EMX__) && defined(ISO_CHAR_SET))
tr[i] = tr[LUT[i]];
#else
if (isupper(i)) tr[i] = tr[tolower(i)];
#endif
}
/* if(WORDBOUND) {
for(i=1; i<MAXSYM; i++) if(!isalnum(i)) tr[i] = W_DELIM;
}
removed by Udi 11/8/94 - the trick of using W-delim was too buggy.
we now do it "by hand" after we find a match
*/
for(i=0; i< MAXSYM; i++) tr1[i] = tr[i]&Mask;
num_pat = p-1;
p_size = MAXPAT;
for(i=1; i<=num_pat; i++) {
p = strlen(patt[i]);
if ((patt[i][0] == '^') || (patt[i][0] == '$')) patt[i][0] = '\n';
if ((p > 1) && ((patt[i][p-1] == '^') || (patt[i][p-1] == '$')) && (patt[i][p-2] != '\\')) patt[i][p-1] = '\n';
/* Added by bg, Dec 2nd 1994 */
for (k=0; k<p; k++) {
if (patt[i][k] == '\\') {
for (j=k; j<p; j++)
patt[i][j] = patt[i][j+1]; /* including '\0' */
p--;
}
}
pat_len[i] = p;
/*
pat_len[i] = (WORDBOUND?(p-2>0?p-2:1):p); changed by Udi 11/8/94
*/
#ifdef debug
printf("prepf(): patt[%d]=%s, pat_len[%d]=%d\n", i, patt[i], i, pat_len[i]);
#endif
if(p!=0 && p < p_size) p_size = p; /* MIN */
}
if(p_size == 0) {
fprintf(stderr, "%s: the pattern file is empty\n", Progname);
if (!EXITONERROR) {
errno = AGREP_ERROR;
free_buf(mfp, buf);
return -1;
}
else exit(2);
}
if(length > 400 && p_size > 2) LONG = 1;
if(p_size == 1) SHORT = 1;
for(i=0; i<MAXMEMBER1; i++) SHIFT1[i] = p_size - 1 - LONG;
for(i=0; i<MAXHASH; i++) {
HASH[i] = 0;
}
for(i=1; i<=num_pat; i++) f_prep(i, patt[i]);
accumulate();
memset(pat_indices, '\0', sizeof(int) * (num_pat + 1));
for(i=1; i<=num_pat; i++) f_prep1(i, patt[i]);
#if DOTCOMPRESSED
/* prepf for compression */
if (-1 == tc_prepf(buf, length)) {
free_buf(mfp, buf);
return -1;
}
#endif /*DOTCOMPRESSED*/
free_buf(mfp, buf);
return 0;
}
#if DOTCOMPRESSED
/*
* Compression equivalent of prepf: called right after prepf.
* 1. Read patt and SHIFT1
* 2. Call tcompress on the patterns in patt and put in tc_patt.
* 3. Use these patterns to compute tc_SHIFT (ignore WDELIM, LDELIM, case sensitivity, etc.)
* 4. Process other variables/functions (pat_spool, tr, tr1, pat_len, accumulate, SHIFT1, f_prep, f_prep1, pat_indices) appropriately.
*/
int
tc_prepf(buf, length)
unsigned char *buf;
int length;
{
int i, p=1;
uchar *pat_ptr;
unsigned Mask = 31;
int tc_length;
unsigned char tc_buf[MAXPAT * 2]; /* maximum length of the compressed pattern */
static struct timeval initt, finalt;
if (length*2 > MAXPATFILE + 2*max_num) {
fprintf(stderr, "%s: pattern buffer too large (> %d B)\n", Progname, (MAXPATFILE+2*max_num)/2);
return -1;
}
if (tc_pat_spool != NULL) free(tc_pat_spool);
pat_ptr = tc_pat_spool = (unsigned char *)malloc(length*2 + MAXPAT);
#if MEASURE_TIMES
gettimeofday(&initt, NULL);
#endif /*MEASURE_TIMES*/
i=0; p=1;
while(i < length) {
tc_patt[p] = pat_ptr;
while((*pat_ptr = buf[i++]) != '\n') pat_ptr++;
*pat_ptr++ = 0;
if ((tc_length = quick_tcompress(FREQ_FILE, HASH_FILE, tc_patt[p], strlen(tc_patt[p]), tc_buf, MAXPAT * 2 - 8, TC_EASYSEARCH)) > 0) {
memcpy(tc_patt[p], tc_buf, tc_length);
tc_patt[p][tc_length] = '\0';
pat_ptr = tc_patt[p] + tc_length + 1; /* character after '\0' */
}
p++;
}
for(i=1; i<20; i++) *pat_ptr = i; /* boundary safety zone */
/* Ignore all other options: it is automatically W_DELIM */
for(i=0; i< MAXSYM; i++) tc_tr[i] = i;
for(i=0; i< MAXSYM; i++) tc_tr1[i] = tc_tr[i]&Mask;
tc_num_pat = p-1;
tc_p_size = MAXPAT;
for(i=1; i<=num_pat; i++) {
p = strlen(tc_patt[i]);
tc_pat_len[i] = p;
#ifdef debug
printf("prepf(): tc_patt[%d]=%s, tc_pat_len[%d]=%d\n", i, tc_patt[i], i, tc_pat_len[i]);
#endif
if(p!=0 && p < tc_p_size) tc_p_size = p; /* MIN */
}
if(tc_p_size == 0) { /* cannot happen NOW */
fprintf(stderr, "%s: the pattern file is empty\n", Progname);
if (!EXITONERROR) {
errno = AGREP_ERROR;
return -1;
}
else exit(2);
}
if(length > 400 && tc_p_size > 2) tc_LONG = 1;
if(tc_p_size == 1) tc_SHORT = 1;
for(i=0; i<MAXMEMBER1; i++) tc_SHIFT1[i] = tc_p_size - 1 - LONG;
for(i=0; i<MAXHASH; i++) {
tc_HASH[i] = 0;
}
for(i=1; i<=tc_num_pat; i++) tc_f_prep(i, tc_patt[i]);
tc_accumulate();
memset(tc_pat_indices, '\0', sizeof(int) * (tc_num_pat + 1));
for(i=1; i<=tc_num_pat; i++) tc_f_prep1(i, tc_patt[i]);
#if MEASURE_TIMES
gettimeofday(&finalt, NULL);
INFILTER_ms += (finalt.tv_sec*1000 + finalt.tv_usec/1000) - (initt.tv_sec*1000 + initt.tv_usec/1000);
#endif /*MEASURE_TIMES*/
return 0;
}
#endif /*DOTCOMPRESSED*/
int
mgrep(fd)
int fd;
{
register char r_newline = '\n';
unsigned char *text;
register int buf_end, num_read, start, end, residue = 0;
int oldCurrentByteOffset;
int first_time = 1;
#if AGREP_POINTER
if (fd != -1) {
#endif /*AGREP_POINTER*/
alloc_buf(fd, &text, 2*BLOCKSIZE+MAXLINE);
text[MAXLINE-1] = '\n'; /* initial case */
start = MAXLINE;
while( (num_read = fill_buf(fd, text+MAXLINE, 2*BLOCKSIZE)) > 0)
{
buf_end = end = MAXLINE + num_read -1 ;
oldCurrentByteOffset = CurrentByteOffset;
if (first_time) {
if ((TCOMPRESSED == ON) && tuncompressible(text+MAXLINE, num_read)) {
EASYSEARCH = text[MAXLINE+SIGNATURE_LEN-1];
start += SIGNATURE_LEN;
CurrentByteOffset += SIGNATURE_LEN;
if (!EASYSEARCH) {
fprintf(stderr, "not compressed for easy-search: can miss some matches in: %s\n", CurrentFileName);
}
}
else TCOMPRESSED = OFF;
first_time = 0;
}
if (!DELIMITER) {
while(text[end] != r_newline && end > MAXLINE) end--;
text[start-1] = r_newline;
}
else {
unsigned char *newbuf = text + end + 1;
newbuf = backward_delimiter(newbuf, text+MAXLINE, D_pattern, D_length, OUTTAIL); /* see agrep.c/'d' */
if (newbuf < text+MAXLINE+D_length) newbuf = text + end + 1;
end = newbuf - text - 1;
/* TG 22.10.97 Check bounds before memcpy-ing */
/* printf("text %x start %i D_length %i D_pattern %i residue %i\n",text,start,D_length,D_pattern,residue); */
if (start > D_length) memcpy(text+start-D_length, D_pattern, D_length);
memcpy(text+start+residue, D_pattern, D_length);
/* original code was: memcpy(text+start-D_length, D_pattern, D_length); */
}
residue = buf_end - end + 1 ;
if(INVERSE && COUNT) countline(text+MAXLINE, num_read);
/* MGREP_PROCESS */
if (TCOMPRESSED) { /* separate functions since separate globals => too many if-statements within a single function makes it slow */
#if DOTCOMPRESSED
if(tc_SHORT) { if (-1 == tc_m_short(text, start, end)) {free_buf(fd, text); return -1;}}
else { if (-1 == tc_monkey1(text, start, end)) {free_buf(fd, text); return -1;}}
#endif /*DOTCOMPRESSED*/
}
else {
if(SHORT) { if (-1 == m_short(text, start, end)) {free_buf(fd, text); return -1;}}
else { if (-1 == monkey1(text, start, end)) {free_buf(fd, text); return -1;}}
}
if(FILENAMEONLY && (num_of_matched - prev_num_of_matched) && (NEW_FILE || !POST_FILTER)) {
if (agrep_finalfp != NULL)
fprintf(agrep_finalfp, "%s\n", CurrentFileName);
else {
int outindex;
for(outindex=0; (outindex+agrep_outpointer<agrep_outlen) &&
(CurrentFileName[outindex] != '\0'); outindex++) {
agrep_outbuffer[agrep_outpointer+outindex] = CurrentFileName[outindex];
}
if ((CurrentFileName[outindex] != '\0') || (outindex+agrep_outpointer+1>=agrep_outlen)) {
OUTPUT_OVERFLOW;
free_buf(fd, text);
return -1;
}
else {
agrep_outbuffer[agrep_outpointer+outindex++] = '\n';
}
agrep_outpointer += outindex;
}
free_buf(fd, text);
NEW_FILE = OFF;
return 0;
}
CurrentByteOffset = oldCurrentByteOffset + end - start + 1;
start = MAXLINE - residue;
if(start < 0) {
start = 1;
}
strncpy(text+start, text+end, residue);
if (((LIMITOUTPUT > 0) && (LIMITOUTPUT <= num_of_matched)) ||
((LIMITPERFILE > 0) && (LIMITPERFILE <= num_of_matched - prev_num_of_matched))) {
free_buf(fd, text);
return 0; /* done */
}
} /* end of while(num_read = ... */
if (!DELIMITER) {
text[start-1] = '\n';
text[start+residue] = '\n';
}
else {
if (start > D_length) memcpy(text+start-D_length, D_pattern, D_length);
memcpy(text+start+residue, D_pattern, D_length);
}
end = start + residue;
if(residue > 1) {
if (TCOMPRESSED) {
#if DOTCOMPRESSED
if(tc_SHORT) tc_m_short(text, start, end);
else tc_monkey1(text, start, end);
#endif /*DOTCOMPRESSED*/
}
else {
if(SHORT) m_short(text, start, end);
else monkey1(text, start, end);
}
if(FILENAMEONLY && (num_of_matched - prev_num_of_matched) && (NEW_FILE || !POST_FILTER)) {
if (agrep_finalfp != NULL)
fprintf(agrep_finalfp, "%s\n", CurrentFileName);
else {
int outindex;
for(outindex=0; (outindex+agrep_outpointer<agrep_outlen) &&
(CurrentFileName[outindex] != '\0'); outindex++) {
agrep_outbuffer[agrep_outpointer+outindex] = CurrentFileName[outindex];
}
if ((CurrentFileName[outindex] != '\0') || (outindex+agrep_outpointer+1>=agrep_outlen)) {
OUTPUT_OVERFLOW;
free_buf(fd, text);
return -1;
}
else {
agrep_outbuffer[agrep_outpointer+outindex++] = '\n';
}
agrep_outpointer += outindex;
}
free_buf(fd, text);
NEW_FILE = OFF;
return 0;
}
}
free_buf(fd, text);
return (0);
#if AGREP_POINTER
}
else {
text = (unsigned char *)agrep_inbuffer;
num_read = agrep_inlen;
start = 0;
buf_end = end = num_read - 1;
oldCurrentByteOffset = CurrentByteOffset;
if (first_time) {
if ((TCOMPRESSED == ON) && tuncompressible(text+MAXLINE, num_read)) {
EASYSEARCH = text[MAXLINE+SIGNATURE_LEN-1];
start += SIGNATURE_LEN;
CurrentByteOffset += SIGNATURE_LEN;
if (!EASYSEARCH) {
fprintf(stderr, "not compressed for easy-search: can miss some matches in: %s\n", CurrentFileName);
}
}
else TCOMPRESSED = OFF;
first_time = 0;
}
if (!DELIMITER)
while(text[end] != r_newline && end > 1) end--;
else {
unsigned char *newbuf = text + end + 1;
newbuf = backward_delimiter(newbuf, text, D_pattern, D_length, OUTTAIL); /* see agrep.c/'d' */
if (newbuf < text+D_length) newbuf = text + end + 1;
end = newbuf - text - 1;
}
/* text[0] = text[end] = r_newline; : the user must ensure that the delimiter is there at text[0] and occurs somewhere before text[end] */
if (INVERSE && COUNT) countline(text, num_read);
/* An exact copy of the above MGREP_PROCESS */
if (TCOMPRESSED) { /* separate functions since separate globals => too many if-statements within a single function makes it slow */
#if DOTCOMPRESSED
if(tc_SHORT) { if (-1 == tc_m_short(text, start, end)) {free_buf(fd, text); return -1;}}
else { if (-1 == tc_monkey1(text, start, end)) {free_buf(fd, text); return -1;}}
#endif /*DOTCOMPRESSED*/
}
else {
if(SHORT) { if (-1 == m_short(text, start, end)) {free_buf(fd, text); return -1;}}
else { if (-1 == monkey1(text, start, end)) {free_buf(fd, text); return -1;}}
}
if(FILENAMEONLY && (num_of_matched - prev_num_of_matched) && (NEW_FILE || !POST_FILTER)) {
if (agrep_finalfp != NULL)
fprintf(agrep_finalfp, "%s\n", CurrentFileName);
else {
int outindex;
for(outindex=0; (outindex+agrep_outpointer<agrep_outlen) &&
(CurrentFileName[outindex] != '\0'); outindex++) {
agrep_outbuffer[agrep_outpointer+outindex] = CurrentFileName[outindex];
}
if ((CurrentFileName[outindex] != '\0') || (outindex+agrep_outpointer+1>=agrep_outlen)) {
OUTPUT_OVERFLOW;
free_buf(fd, text);
return -1;
}
else {
agrep_outbuffer[agrep_outpointer+outindex++] = '\n';
}
agrep_outpointer += outindex;
}
free_buf(fd, text);
NEW_FILE = OFF;
return 0;
}
return 0;
}
#endif /*AGREP_POINTER*/
#ifdef perf_check
fprintf(stderr,"Shifted %d times; shift=0 %d times; hash was = %d times\n",cshift, cshift0, chash);
return 0;
#endif
} /* end mgrep */
static void
countline(text, len)
unsigned char *text; int len;
{
int i;
for (i=0; i<len; i++) if(text[i] == '\n') total_line++;
}
/* Stuff that always needs to be printed whenever there is a match in all functions in this file */
int
print_options(pat_index, text, curtextbegin, curtextend)
int pat_index;
unsigned char *text, *curtextbegin, *curtextend;
{
int PRINTED = 0;
if(FNAME && (NEW_FILE || !POST_FILTER)) {
char nextchar = (POST_FILTER == ON)?'\n':' ';
char *prevstring = (POST_FILTER == ON)?"\n":"";
if (agrep_finalfp != NULL)
fprintf(agrep_finalfp, "%s%s:%c", prevstring, CurrentFileName, nextchar);
else {
int outindex;
if (prevstring[0] != '\0') {
if(agrep_outpointer + 1 >= agrep_outlen) {
OUTPUT_OVERFLOW;
return -1;
}
else agrep_outbuffer[agrep_outpointer ++] = prevstring[0];
}
for(outindex=0; (outindex+agrep_outpointer<agrep_outlen) &&
(CurrentFileName[outindex] != '\0'); outindex++) {
agrep_outbuffer[agrep_outpointer+outindex] = CurrentFileName[outindex];
}
if ((CurrentFileName[outindex] != '\0') || (outindex+agrep_outpointer+2>=agrep_outlen)) {
OUTPUT_OVERFLOW;
return -1;
}
else {
agrep_outbuffer[agrep_outpointer+outindex++] = ':';
agrep_outbuffer[agrep_outpointer+outindex++] = nextchar;
}
agrep_outpointer += outindex;
}
NEW_FILE = OFF;
PRINTED = 1;
}
if (PRINTPATTERN) {
if (agrep_finalfp != NULL)
fprintf(agrep_finalfp, "%d- ", pat_index);
else {
char s[32];
int outindex;
sprintf(s, "%d- ", pat_index);
for(outindex=0; (outindex+agrep_outpointer<agrep_outlen) &&
(s[outindex] != '\0'); outindex++) {
agrep_outbuffer[agrep_outpointer+outindex] = s[outindex];
}
if (s[outindex] != '\0') {
OUTPUT_OVERFLOW;
return -1;
}
agrep_outpointer += outindex;
}
PRINTED = 1;
}
if (BYTECOUNT) {
if (agrep_finalfp != NULL)
fprintf(agrep_finalfp, "%d= ", CurrentByteOffset);
else {
char s[32];
int outindex;
sprintf(s, "%d= ", CurrentByteOffset);
for(outindex=0; (outindex+agrep_outpointer<agrep_outlen) &&
(s[outindex] != '\0'); outindex++) {
agrep_outbuffer[agrep_outpointer+outindex] = s[outindex];
}
if (s[outindex] != '\0') {
OUTPUT_OVERFLOW;
return -1;
}
agrep_outpointer += outindex;
}
PRINTED = 1;
}
if (PRINTOFFSET) {
if (agrep_finalfp != NULL)
fprintf(agrep_finalfp, "@%d{%d} ", CurrentByteOffset - (text -curtextbegin), curtextend-curtextbegin);
else {
char s[32];
int outindex;
sprintf(s, "@%d{%d} ", CurrentByteOffset - (text -curtextbegin), curtextend-curtextbegin);
for (outindex=0; (outindex+agrep_outpointer<agrep_outlen) &&
(s[outindex] != '\0'); outindex ++) {
agrep_outbuffer[agrep_outpointer+outindex] = s[outindex];
}
if (s[outindex] != '\0') {
OUTPUT_OVERFLOW;
return -1;
}
agrep_outpointer += outindex;
}
PRINTED = 1;
}
return PRINTED;
}
int
monkey1( text, start, end )
int start, end; register unsigned char *text;
{
int PRINTED = 0;
unsigned char *oldtext;
int pat_index;
register uchar *textend;
unsigned char *textbegin;
unsigned char *curtextend;
unsigned char *curtextbegin;
register unsigned hash;
register uchar shift;
register int m1, Long=LONG;
int MATCHED=0;
register uchar *qx;
register uchar *px;
register int p, p_end;
uchar *lastout;
/* int OUT=0; */
int hash2;
int j;
int DOWITHMASK;
DOWITHMASK = 0;
if (AParse != 0) memset(amatched_terminals, '\0', anum_terminals);
textbegin = text + start;
textend = text + end;
m1 = p_size-1;
lastout = text+start;
text = text + start + m1 -1 ;
/* -1 to allow match to the first \n in case the pattern has ^ in front of it */
/*
if (WORDBOUND || WHOLELINE) text = text-1;
if (WHOLELINE) text = text-1;
*/
/* to accomodate the extra 2 W_delim */
while (text <= textend) {
hash=tr1[*text];
hash=(hash<<Hbits)+(tr1[*(text-1)]);
if(Long) hash=(hash<<Hbits)+(tr1[*(text-2)]);
shift = SHIFT1[hash];
#ifdef perf_check
cshift++;
#endif
if(shift == 0) {
hash=hash&mask5;
hash2 = (tr[*(text-m1)]<<8) + tr[*(text-m1+1)];
p = HASH[hash];
#ifdef perf_check
cshift0++;
#endif
p_end = HASH[hash+1];
#ifdef debug
printf("hash=%d, p=%d, p_end=%d\n", hash, p, p_end);
#endif
while(p++ < p_end) {
if(hash2 != Hash2[p]) continue;
#ifdef perf_check
chash++;
#endif
if (((pat_index = pat_indices[p]) <= 0) || (pat_len[pat_index] <= 0)) continue;
px = PatPtr[p];
qx = text-m1;
while((*px!=0)&&(tr[*px] == tr[*qx])) {
px++;
qx++;
}
if (*px == 0) {
if(text > textend) return 0;
if (WORDBOUND) {
if (isalnum(*qx)) goto skip_output;
if (isalnum(*(text-m1-1))) goto skip_output;
}
if (!DOWITHMASK) {
/* Don't update CurrentByteOffset here: only before outputting properly */
if (!DELIMITER) {
curtextbegin = text; while((curtextbegin > textbegin) && (*(--curtextbegin) != '\n'));
if (*curtextbegin == '\n') curtextbegin ++;
curtextend = text+1; while((curtextend < textend) && (*curtextend != '\n')) curtextend ++;
if (*curtextend == '\n') curtextend ++;
}
else {
curtextbegin = backward_delimiter(text, textbegin, D_pattern, D_length, OUTTAIL);
curtextend = forward_delimiter(text+1, textend, D_pattern, D_length, OUTTAIL);
}
if (!OUTTAIL || INVERSE) textbegin = curtextend;
else if (DELIMITER) textbegin = curtextend - D_length;
else textbegin = curtextend - 1;
}
DOWITHMASK = 1;
amatched_terminals[pat_index - 1] = 1;
if (AComplexBoolean) {
/* Can output only after all the matches in the current record have been identified: just like filter_output */
oldtext = text;
CurrentByteOffset += (oldtext + pat_len[pat_index] - 1 - text);
text = oldtext + pat_len[pat_index] - 1;
MATCHED = 0;
goto skip_output;
}
else if ((long)AParse & AND_EXP) {
for (j=0; j<anum_terminals; j++) if (!amatched_terminals[j]) break;
if (j<anum_terminals) goto skip_output;
}
MATCHED=1;
oldtext = text; /* only for MULTI_OUTPUT */
#undef DO_OUTPUT
#define DO_OUTPUT(change_text)\
num_of_matched++;\
if(FILENAMEONLY || SILENT) return 0;\
if (!COUNT) {\
PRINTED = print_options(pat_index, text, curtextbegin, curtextend);\
if(!INVERSE) {\
if (PRINTRECORD) {\
if (agrep_finalfp != NULL) {\
fwrite(curtextbegin, 1, curtextend - curtextbegin, agrep_finalfp);\
}\
else {\
if (agrep_outpointer + curtextend - curtextbegin>= agrep_outlen) {\
OUTPUT_OVERFLOW;\
return -1;\
}\
else {\
memcpy(agrep_outbuffer + agrep_outpointer, curtextbegin, curtextend-curtextbegin);\
agrep_outpointer += curtextend - curtextbegin;\
}\
}\
}\
else if (PRINTED) {\
if (agrep_finalfp != NULL) fputc('\n', agrep_finalfp);\
else agrep_outbuffer[agrep_outpointer ++] = '\n';\
PRINTED = 0;\
}\
if ((change_text) && MULTI_OUTPUT) { /* next match starting from end of current */\
CurrentByteOffset += (oldtext + pat_len[pat_index] - 1 - text);\
text = oldtext + pat_len[pat_index] - 1;\
MATCHED = 0;\
}\
else if (change_text) {\
CurrentByteOffset += textbegin - text;\
text = textbegin;\
}\
}\
else { /* INVERSE */\
/* if(lastout < curtextbegin) OUT=1; */\
if (agrep_finalfp != NULL)\
fwrite(lastout, 1, curtextbegin-lastout, agrep_finalfp);\
else {\
if (curtextbegin - lastout + agrep_outpointer >= agrep_outlen) {\
OUTPUT_OVERFLOW;\
return -1;\
}\
memcpy(agrep_outbuffer+agrep_outpointer, lastout, curtextbegin-lastout);\
agrep_outpointer += (curtextbegin-lastout);\
}\
lastout=textbegin;\
if (change_text) {\
CurrentByteOffset += textbegin - text;\
text = textbegin;\
}\
}\
}\
else if (change_text) { /* COUNT */\
CurrentByteOffset += textbegin - text;\
text = textbegin;\
}\
if (((LIMITOUTPUT > 0) && (LIMITOUTPUT <= num_of_matched)) ||\
((LIMITPERFILE > 0) && (LIMITPERFILE <= num_of_matched - prev_num_of_matched))) return 0; /* done */\
DO_OUTPUT(1)
}
skip_output:
if (MATCHED && !MULTI_OUTPUT && !AComplexBoolean) break; /* else look for more possible matches since we never know how many will match */
if (DOWITHMASK && (text >= curtextend - 1)) {
DOWITHMASK = 0;
if (AComplexBoolean && dd(curtextbegin, curtextend) && eval_tree(AParse, amatched_terminals)) {
DO_OUTPUT(0)
}
if (AParse != 0) memset(amatched_terminals, '\0', anum_terminals);
}
}
/* If I found some match and I am about to cross over a delimiter, then set DOWITHMASK to 0 and zero out the amatched_terminals */
if (DOWITHMASK && (text >= curtextend - 1)) {
DOWITHMASK = 0;
if (AComplexBoolean && dd(curtextbegin, curtextend) && eval_tree(AParse, amatched_terminals)) {
DO_OUTPUT(0)
}
if (AParse != 0) memset(amatched_terminals, '\0', anum_terminals);
}
if(!MATCHED) shift = 1; /* || MULTI_OUTPUT is implicit */
else {
MATCHED = 0;
shift = m1 - 1 > 0 ? m1 - 1 : 1;
}
}