-
Notifications
You must be signed in to change notification settings - Fork 119
/
Copy pathpattern.cpp
4903 lines (4848 loc) · 157 KB
/
pattern.cpp
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) 2016, Robert van Engelen, Genivia Inc. All rights reserved. *
* *
* Redistribution and use in source and binary forms, with or without *
* modification, are permitted provided that the following conditions are met: *
* *
* (1) Redistributions of source code must retain the above copyright notice, *
* this list of conditions and the following disclaimer. *
* *
* (2) Redistributions in binary form must reproduce the above copyright *
* notice, this list of conditions and the following disclaimer in the *
* documentation and/or other materials provided with the distribution. *
* *
* (3) The name of the author may not be used to endorse or promote products *
* derived from this software without specific prior written permission. *
* *
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED *
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF *
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO *
* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, *
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, *
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; *
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, *
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR *
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF *
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. *
\******************************************************************************/
/**
@file pattern.cpp
@brief RE/flex regular expression pattern compiler
@author Robert van Engelen - [email protected]
@copyright (c) 2016-2025, Robert van Engelen, Genivia Inc. All rights reserved.
@copyright (c) BSD-3 License - see LICENSE.txt
*/
#include <reflex/pattern.h>
#include <reflex/simd.h>
#include <reflex/timer.h>
#include <algorithm>
#include <cstdlib>
#include <cerrno>
#include <cmath>
/// DFA compaction: -1 == reverse order edge compression (best); 1 == edge compression; 0 == no edge compression.
/** Edge compression reorders edges to produce fewer tests when executed in the compacted order.
For example ([a-cg-ik]|d|[e-g]|j|y|[x-z]) after reverse edge compression has only 2 edges:
c = m.FSM_CHAR();
if ('x' <= c && c <= 'z') goto S3;
if ('a' <= c && c <= 'k') goto S3;
return m.FSM_HALT(c);
*/
#define WITH_COMPACT_DFA -1
/// optional: cut cycle detection versus simple loop detection to improve lbk accuracy
// #define WITH_CUT_CYCLE
#ifdef DEBUG
# define DBGLOGPOS(p) \
if ((p).accept()) \
{ \
DBGLOGA(" (%u)", (p).accepts()); \
if ((p).lazy()) \
DBGLOGA("?%u", (p).lazy()); \
} \
else \
{ \
DBGLOGA(" "); \
if ((p).iter()) \
DBGLOGA("%u.", (p).iter()); \
DBGLOGA("%u", (p).loc()); \
if ((p).lazy()) \
DBGLOGA("?%u", (p).lazy()); \
if ((p).anchor()) \
DBGLOGA("^"); \
if ((p).ticked()) \
DBGLOGA("'"); \
if ((p).negate()) \
DBGLOGA("-"); \
}
#endif
namespace reflex {
#if (defined(__WIN32__) || defined(_WIN32) || defined(WIN32) || defined(_WIN64) || defined(__BORLANDC__)) && !defined(__CYGWIN__) && !defined(__MINGW32__) && !defined(__MINGW64__)
inline int fopen_s(FILE **file, const char *name, const char *mode) { return ::fopen_s(file, name, mode); }
#else
inline int fopen_s(FILE **file, const char *name, const char *mode) { return (*file = ::fopen(name, mode)) ? 0 : errno; }
#endif
#ifndef WITH_NO_CODEGEN
static void print_char(FILE *file, int c, bool h = false)
{
if (c >= '\a' && c <= '\r')
::fprintf(file, "'\\%c'", "abtnvfr"[c - '\a']);
else if (c == '\\')
::fprintf(file, "'\\\\'");
else if (c == '\'')
::fprintf(file, "'\\''");
else if (std::isprint(c))
::fprintf(file, "'%c'", c);
else if (h)
::fprintf(file, "%02x", c);
else
::fprintf(file, "%u", c);
}
#endif
#ifndef WITH_NO_CODEGEN
static const char *meta_label[] = {
NULL,
"WBB",
"WBE",
"NWB",
"NWE",
"BWB",
"EWB",
"BWE",
"EWE",
"BOL",
"EOL",
"BOB",
"EOB",
"UND",
"IND",
"DED",
};
#endif
static const char *posix_class[] = {
"ASCII",
"Space",
"XDigit",
"Cntrl",
"Print",
"Alnum",
"Alpha",
"Blank",
"Digit",
"Graph",
"Lower",
"Punct",
"Upper",
"Word",
};
const std::string Pattern::operator[](Accept choice) const
{
if (choice == 0)
return rex_;
if (choice <= size())
{
Location loc = end_.at(choice - 1);
Location prev = 0;
if (choice >= 2)
prev = end_.at(choice - 2) + 1;
return rex_.substr(prev, loc - prev);
}
return "";
}
void Pattern::error(regex_error_type code, size_t pos) const
{
regex_error err(code, rex_, pos);
if (opt_.w)
std::cerr << err.what();
if (code == regex_error::exceeds_length || code == regex_error::exceeds_limits || opt_.r)
throw err;
}
void Pattern::init(const char *options, const uint8_t *pred)
{
init_options(options);
nop_ = 0;
len_ = 0;
min_ = 0;
pin_ = 0;
lcp_ = 0;
lcs_ = 0;
bmd_ = 0;
npy_ = 0;
one_ = false;
bol_ = false;
vno_ = 0;
eno_ = 0;
hno_ = 0;
pms_ = 0.0;
vms_ = 0.0;
ems_ = 0.0;
wms_ = 0.0;
ams_ = 0.0;
cut_ = 0;
lbk_ = 0;
lbm_ = 0;
cbk_.reset();
fst_.reset();
if (opc_ != NULL || fsm_ != NULL )
{
if (pred != NULL)
{
len_ = pred[0];
min_ = pred[1] & 0x0f;
one_ = pred[1] & 0x10;
bol_ = pred[1] & 0x40;
memcpy(chr_, pred + 2, len_);
size_t n = 2 + len_;
if (len_ == 0)
{
// load bit_[] parameters
for (int i = 0; i < 256; ++i)
bit_[i] = ~pred[i + n];
n += 256;
if ((pred[1] & 0x80) != 0)
{
// load tap_[] parameters
for (int i = 0; i < Const::BTAP; ++i)
tap_[i] = ~pred[i + n];
n += Const::BTAP;
}
else
{
// lossly (uncorrelated) populate tap_[] from bit_[] when missing, for backward compatibility
std::memset(tap_, 0xff, sizeof(tap_));
for (size_t k = 0; k < min_; ++k)
{
Bitap mask = 1 << k;
if (k + 1 < min_)
{
for (Char ch = 0; ch < 256; ++ch)
if ((bit_[ch] & mask) == 0)
for (Char next_ch = 0; next_ch < 256; ++next_ch)
tap_[bihash(ch, next_ch)] &= ~(~(bit_[next_ch] >> 1) & mask);
}
else
{
for (Char ch = 0; ch < 256; ++ch)
if ((bit_[ch] & mask) == 0)
for (Char next_ch = 0; next_ch < 256; ++next_ch)
tap_[bihash(ch, next_ch)] &= ~mask;
}
}
}
}
if (min_ < 4)
{
// load predict match PM4 pma_[] parameters
for (int i = 0; i < Const::HASH; ++i)
pma_[i] = ~pred[i + n];
}
else
{
// load predict match hash pmh_[] parameters
for (int i = 0; i < Const::HASH; ++i)
pmh_[i] = ~pred[i + n];
}
n += Const::HASH;
if ((pred[1] & 0x20) != 0)
{
// load lookback parameters lbk_ lbm_ and cbk_[] after s-t cut and first s-t cut pattern characters fst_[]
lbk_ = pred[n + 0] | (pred[n + 1] << 8);
lbm_ = pred[n + 2] | (pred[n + 3] << 8);
for (int i = 0; i < 256; ++i)
cbk_.set(i, pred[n + 4 + (i >> 3)] & (1 << (i & 7)));
for (int i = 0; i < 256; ++i)
fst_.set(i, pred[n + 4 + 32 + (i >> 3)] & (1 << (i & 7)));
n += 4 + 32 + 32;
}
else
{
// load first pattern characters fst_[] from bit_[]
for (size_t i = 0; i < 256; ++i)
fst_.set(i, (bit_[i] & 1) == 0);
}
}
}
else
{
Positions startpos;
Follow followpos;
Lazypos lazypos;
Mods modifiers;
Map lookahead;
// parse the regex pattern to construct the followpos NFA without epsilon transitions
parse(startpos, followpos, lazypos, modifiers, lookahead);
// start state = startpos = firstpost of the followpos NFA, also merge the tree DFA root when non-NULL
#ifdef WITH_TREE_DFA
DFA::State *start;
if (startpos.empty())
{
// all patterns are strings, do not construct a DFA with subset construction
start = tfa_.root();
if (opt_.i)
{
// convert edges to case-insensitive by adding upper case transitions for alphas normalized to lower case
timer_type et;
timer_start(et);
for (DFA::State *state = start; state != NULL; state = state->next)
{
for (DFA::State::Edges::iterator t = state->edges.begin(); t != state->edges.end(); ++t)
{
Char c = t->first;
if (islowercase(c))
{
state->edges[uppercase(c)] = DFA::State::Edge(uppercase(c), t->second.second);
++eno_;
}
}
}
ems_ += timer_elapsed(et);
}
}
else
{
// combine tree DFA (if any) with the DFA start state to construct a combined DFA with subset construction
start = dfa_.state(tfa_.root(), startpos);
// compile the NFA into a DFA
compile(start, followpos, lazypos, modifiers, lookahead);
}
#else
DFA::State *start = dfa_.state(tfa_.tree, startpos);
// compile the NFA into a DFA
compile(start, followpos, lazypos, modifiers, lookahead);
#endif
// assemble DFA opcode tables or direct code
assemble(start);
// delete the DFA
dfa_.clear();
// delete the tree DFA
tfa_.clear();
}
if (len_ == 0)
{
if (min_ > 0)
{
if (min_ < 8)
{
Bitap mask = ~((1 << min_) - 1);
for (Char i = 0; i < 256; ++i)
bit_[i] |= mask;
for (Hash i = 0; i < Const::BTAP; ++i)
tap_[i] |= mask;
}
// bitap entropy
npy_ = 0;
for (Char i = 0; i < 256; ++i)
{
bit_[i] |= ~((1 << min_) - 1);
npy_ += (bit_[i] & 0x01) == 0;
npy_ += (bit_[i] & 0x02) == 0;
npy_ += (bit_[i] & 0x04) == 0;
npy_ += (bit_[i] & 0x08) == 0;
npy_ += (bit_[i] & 0x10) == 0;
npy_ += (bit_[i] & 0x20) == 0;
npy_ += (bit_[i] & 0x40) == 0;
npy_ += (bit_[i] & 0x80) == 0;
}
// average entropy per pattern position, we don't use bitap when entropy is too high for short patterns
npy_ /= min_;
#ifdef WITH_BITAP_AVX2 // in case vectorized bitap (hashed) is faster than serial version (typically not!)
#if defined(HAVE_AVX512BW) || defined(HAVE_AVX2) || defined(HAVE_SSE2)
if (have_HW_AVX512BW() || have_HW_AVX2())
{
// vectorized bitap hashed pairs array for AVX2
uint32_t shift = 8 - (min_ - 1);
for (Hash j = 0; j < 4 * Const::BTAP; j += Const::BTAP, ++shift)
for (Hash i = 0; i < Const::BTAP; ++i)
vtp_[i + j] = tap_[i] << shift;
}
#endif
#endif
}
// needle count and frequency thresholds to enable needle-based search
uint16_t pinmax = 8;
const uint16_t freqmax1 = 20; // upper bound for one position when needle pins>5 or 1<min<=3
const uint16_t freqmax2 = 251; // upper bound
#if defined(HAVE_AVX512BW) || defined(HAVE_AVX2) || defined(HAVE_SSE2)
const uint16_t freqmax3 = 300; // upper bound for freqlcp+freqlcs when needle pins>8 and min>=4
if (have_HW_AVX512BW() || have_HW_AVX2())
pinmax = 16;
else if (have_HW_SSE2())
pinmax = 8;
else
pinmax = 1;
#elif defined(HAVE_NEON)
const uint16_t freqmax3 = 160; // upper bound for freqlcp+freqlcs when needle pins>6 and min>=4
pinmax = 8;
#else
const uint16_t freqmax3 = 160; // checked but unused
pinmax = 1;
#endif
// find needles
pin_ = 0;
lcp_ = 0;
lcs_ = 0;
uint16_t nlcp = 65535; // max and undefined
uint16_t nlcs = 65535; // max and undefined
uint16_t freqlcp = 255; // max and undefined
uint16_t freqlcs = 255; // max and undefined
size_t min = std::max<size_t>(1, min_);
uint8_t score[8][3]; // max freq, unique needle position k < min, number of pins n <= pinmax
size_t scores = 0;
for (uint8_t k = 0; k < min; ++k)
{
Bitap mask = 1 << k;
uint8_t n = 0;
uint16_t max = 0;
uint16_t sum = 0;
// at position k count the matching characters and find the usm and max character frequency
for (uint16_t i = 0; i < 256 && n <= pinmax; ++i)
{
if ((bit_[i] & mask) == 0)
{
++n;
uint8_t freq = frequency(static_cast<uint8_t>(i));
if (freq > max)
max = freq;
sum += freq;
}
}
if (n > 0 && n <= pinmax && max <= freqmax2)
{
// score needle max frequency adjusted, penalty for higher number of needle pins>8
uint8_t m = static_cast<uint8_t>(std::min((sum + n - 1) / n * ((n > 8) + 1), 255));
if (m <= freqmax2)
{
size_t i;
for (i = 0; i < scores; ++i)
{
// keep scores sorted by average (mean) frequency or secondary by number of pins required
if (score[i][0] > m || (score[i][0] == m && score[i][2] > n))
{
memmove(score[i+1], score[i], static_cast<uint8_t*>(score[scores]) - static_cast<uint8_t*>(score[i]));
break;
}
}
score[i][0] = m;
score[i][1] = k;
score[i][2] = n;
++scores;
}
}
}
if (scores == 1 && min_ <= 3)
{
freqlcp = freqlcs = score[0][0];
lcp_ = lcs_ = score[0][1];
nlcp = nlcs = score[0][2];
// no needle search for one needle position when pins>5 or when frequency is too high, use PM4 instead
uint16_t freqmax = min_ > 1 || nlcp > 5 ? freqmax1 : freqmax2;
if (freqlcp > freqmax)
freqlcp = freqlcs = 255;
}
else if (scores >= 2)
{
freqlcp = score[0][0];
lcp_ = score[0][1];
nlcp = score[0][2];
freqlcs = score[1][0];
lcs_ = score[1][1];
nlcs = score[1][2];
if (lcp_ + 1 == lcs_ || lcs_ + 1 == lcp_ || (nlcp <= 8 && nlcs > 8))
{
for (size_t i = 2; i < scores; ++i)
{
if (score[i][2] <= 8 && abs(lcp_ - score[i][1]) > 1)
{
freqlcs = score[i][0];
lcs_ = score[i][1];
nlcs = score[i][2];
break;
}
}
}
}
// number of needles required
uint16_t n = std::max(nlcp, nlcs);
// determine if a needle-based search is worthwhile heuristically, when freqlcp + freqlcs <= freqmax
uint16_t freqmax = 2 * freqmax2;
#if defined(HAVE_NEON)
if (n > 6 && min_ >= 4)
freqmax = freqmax3;
#else // only runtime AVX2 supports pins>8, which should be constrained, because it is noisy
if (n > 8 && min_ >= 3)
freqmax = freqmax3;
#endif
if (n > 0 && n <= pinmax && freqlcp + freqlcs <= freqmax)
{
// bridge the gap from 9 to 16 to handle 9 to 16 combined with AVX2
if (n > 8)
n = 16;
uint16_t j = 0, k = n;
Bitap masklcp = 1 << lcp_;
Bitap masklcs = 1 << lcs_;
for (uint16_t i = 0; i < 256; ++i)
{
if ((bit_[i] & masklcp) == 0)
chr_[j++] = static_cast<uint8_t>(i);
if ((bit_[i] & masklcs) == 0)
chr_[k++] = static_cast<uint8_t>(i);
}
// fill up the rest of the character tables with duplicates as necessary
for (; j < n; ++j)
chr_[j] = chr_[j - 1];
for (; k < 2*n; ++k)
chr_[k] = chr_[k - 1];
pin_ = n;
}
DBGLOG("min=%zu lcp=%hu(%hu) pin=%zu nlcp=%hu(%hu) freq=%hu(%hu) npy=%hu cut=%u lbk=%u lbm=%u", min, lcp_, lcs_, pin_, nlcp, nlcs, freqlcp, freqlcs, npy_, cut_, lbk_, lbm_);
}
else if (len_ > 1)
{
// produce 1st lcp and 2nd lcs needle positions and Boyer-Moore bms_[] shifts when bmd_ > 0
uint8_t n = static_cast<uint8_t>(len_); // okay to cast: actually never more than 255
uint16_t i;
for (i = 0; i < 256; ++i)
bms_[i] = n;
lcp_ = 0;
lcs_ = 1;
for (i = 0; i < n; ++i)
{
uint8_t pch = static_cast<uint8_t>(chr_[i]);
bms_[pch] = static_cast<uint8_t>(n - i - 1);
if (i > 0)
{
uint8_t freqpch = frequency(pch);
uint8_t lcpch = static_cast<uint8_t>(chr_[lcp_]);
uint8_t lcsch = static_cast<uint8_t>(chr_[lcs_]);
if (frequency(lcpch) > freqpch)
{
lcs_ = lcp_;
lcp_ = i;
}
else if (frequency(lcsch) > freqpch ||
(frequency(lcsch) == freqpch &&
abs(static_cast<int>(lcp_) - static_cast<int>(lcs_)) < abs(static_cast<int>(lcp_) - static_cast<int>(i))))
{
lcs_ = i;
}
}
}
uint16_t j;
for (i = n - 1, j = i; j > 0; --j)
if (chr_[j - 1] == chr_[i])
break;
bmd_ = i - j + 1;
#if defined(HAVE_AVX512BW) || defined(HAVE_AVX2) || defined(HAVE_SSE2) || defined(__SSE2__) || defined(__x86_64__) || _M_IX86_FP == 2 || !defined(HAVE_NEON)
size_t score = 0;
for (i = 0; i < n; ++i)
score += bms_[static_cast<uint8_t>(chr_[i])];
score /= n;
uint8_t fch = frequency(static_cast<uint8_t>(chr_[lcp_]));
#if defined(HAVE_AVX512BW) || defined(HAVE_AVX2) || defined(HAVE_SSE2)
if (!have_HW_SSE2() && !have_HW_AVX2() && !have_HW_AVX512BW())
{
// SSE2/AVX2 not available: if B-M scoring is high and freq is high, then use our improved Boyer-Moore
if (score > 1 && fch > 35 && (score > 4 || fch > 50) && fch + score > 52)
lcs_ = 0xffff; // use B-M
}
#elif defined(__SSE2__) || defined(__x86_64__) || _M_IX86_FP == 2
// SSE2 is available: only if B-M scoring is high and freq is high, then use our improved Boyer-Moore
if (score > 1 && fch > 35 && (score > 4 || fch > 50) && fch + score > 52)
lcs_ = 0xffff; // use B-M
#elif !defined(HAVE_NEON)
// no SIMD available: if B-M scoring is high and freq is high, then use our improved Boyer-Moore
if (score > 1 && fch > 35 && (score > 3 || fch > 50) && fch + score > 52)
lcs_ = 0xffff; // use B-M
#endif
#endif
if (lcs_ < 0xffff)
{
// do not use B-M
bmd_ = 0;
// spread lcp and lcs apart if lcp and lcs are adjacent (chars are possibly correlated)
if (len_ == 3 && (lcp_ == 1 || lcs_ == 1))
{
lcp_ = 0;
lcs_ = 2;
}
else if (len_ > 3 && (lcp_ + 1 == lcs_ || lcs_ + 1 == lcp_))
{
uint8_t freqlcs = 255;
for (i = 0; i < n; ++i)
{
if (i > lcp_ + 1 || i + 1 < lcp_)
{
uint8_t pch = static_cast<uint8_t>(chr_[i]);
uint8_t freqpch = frequency(pch);
if (freqlcs > freqpch)
{
lcs_ = i;
freqlcs = freqpch;
}
}
}
}
}
DBGLOG("len=%zu min=%zu bmd=%zu lcp=%hu(%hu)", len_, min_, bmd_, lcp_, lcs_);
}
}
void Pattern::init_options(const char *options)
{
opt_.b = false;
opt_.h = false;
opt_.g = 0;
opt_.i = false;
opt_.m = false;
opt_.o = false;
opt_.p = false;
opt_.q = false;
opt_.r = false;
opt_.s = false;
opt_.w = false;
opt_.x = false;
opt_.e = '\\';
if (options != NULL)
{
for (const char *s = options; *s != '\0'; ++s)
{
switch (*s)
{
case 'b':
opt_.b = true;
break;
case 'e':
opt_.e = (*(s += (s[1] == '=') + 1) == ';' || *s == '\0' ? 256 : *s++);
--s;
break;
case 'g':
++opt_.g;
break;
case 'h':
opt_.h = true;
break;
case 'i':
opt_.i = true;
break;
case 'm':
opt_.m = true;
break;
case 'o':
opt_.o = true;
break;
case 'p':
opt_.p = true;
break;
case 'q':
opt_.q = true;
break;
case 'r':
opt_.r = true;
break;
case 's':
opt_.s = true;
break;
case 'w':
opt_.w = true;
break;
case 'x':
opt_.x = true;
break;
case 'z':
for (const char *t = s += (s[1] == '='); *s != ';' && *s != '\0'; ++t)
{
if (std::isspace(static_cast<unsigned char>(*t)) || *t == ';' || *t == '\0')
{
if (t > s + 1)
opt_.z = std::string(s + 1, t - s - 1);
s = t;
}
}
--s;
break;
case 'f':
case 'n':
for (const char *t = s += (s[1] == '='); *s != ';' && *s != '\0'; ++t)
{
if (*t == ',' || *t == ';' || *t == '\0')
{
if (t > s + 1)
{
std::string name(s + 1, t - s - 1);
if (name.find('.') == std::string::npos)
opt_.n = name;
else
opt_.f.push_back(name);
}
s = t;
}
}
--s;
break;
}
}
}
}
void Pattern::parse(
Positions& startpos,
Follow& followpos,
Lazypos& lazypos,
Mods modifiers,
Map& lookahead)
{
DBGLOG("BEGIN parse()");
if (rex_.size() > Position::MAXLOC)
error(regex_error::exceeds_length, Position::MAXLOC);
Location len = static_cast<Location>(rex_.size());
Location loc = 0;
Accept choice = 1;
Lazy lazyidx = 0;
Positions firstpos;
Positions lastpos;
bool nullable;
Iter iter;
#ifdef WITH_TREE_DFA
DFA::State *last_state = NULL;
#endif
timer_type t;
timer_start(t);
// parse (?imsux) directives that apply to the pattern as a whole
while (at(loc) == '(' && at(loc + 1) == '?')
{
Location back = loc;
loc += 2;
while (at(loc) == '-' || std::isalnum(at(loc)))
++loc;
if (at(loc) == ')')
{
bool active = true;
loc = back + 2;
Char c;
while ((c = at(loc)) != ')')
{
c = at(loc);
if (c == '-')
active = false;
else if (c == 'i')
opt_.i = active;
else if (c == 'm')
opt_.m = active;
else if (c == 'q')
opt_.q = active;
else if (c == 's')
opt_.s = active;
else if (c == 'x')
opt_.x = active;
else
error(regex_error::invalid_modifier, loc);
++loc;
}
++loc;
}
else
{
loc = back;
break;
}
}
// assume bol unless pattern is empty, reset flag later when no ^ is used at the start of (sub)patterns
bol_ = at(loc) != '\0';
do
{
Location end = loc;
if (!opt_.q && !opt_.x)
{
while (true)
{
Char c = at(end);
if (c == '\0' || c == '|')
break;
if (c == '.' || c == '^' || c == '$' ||
c == '(' || c == '[' || c == '{' ||
c == '?' || c == '*' || c == '+' ||
c == ')')
{
end = loc;
break;
}
if (c == opt_.e)
{
c = at(++end);
if (c == '\0' || std::strchr("0123456789<>ABDHLNPSUWXbcdehijklpsuwxz", c) != NULL)
{
end = loc;
break;
}
if (c == 'Q')
{
while ((c = at(++end)) != '\0')
if (c == opt_.e && at(end + 1) == 'E')
break;
}
}
++end;
}
}
if (loc < end)
{
// string pattern found w/o regex metas: merge string into the tree DFA
bol_ = false;
bool quote = false;
#ifdef WITH_TREE_DFA
DFA::State *r = tfa_.start();
#else
Tree::Node *r = tfa_.root();
#endif
while (loc < end)
{
Char c = at(loc++);
if (c == opt_.e)
{
if (at(loc) == 'E')
{
quote = false;
++loc;
continue;
}
if (!quote)
{
if (at(loc) == 'Q')
{
quote = true;
++loc;
continue;
}
static const char abtnvfr[] = "abtnvfr";
c = at(loc++);
const char *s = std::strchr(abtnvfr, c);
if (s != NULL)
c = static_cast<Char>(s - abtnvfr + '\a');
}
}
else if (isuppercase(c) && opt_.i)
{
c = lowercase(c);
}
#ifdef WITH_TREE_DFA
DFA::State::Edges::iterator i = r->edges.find(c);
if (i == r->edges.end())
{
if (last_state == NULL)
last_state = r; // r points to the tree DFA root (start state)
DFA::State *target_state = last_state = last_state->next = tfa_.state();
r->edges[c] = DFA::State::Edge(c, target_state);
r = target_state;
++eno_;
++vno_;
if (vno_ > DFA::MAX_STATES)
error(regex_error::exceeds_limits, loc);
}
else
{
r = i->second.second;
}
#else
r = tfa_.edge(r, c);
#endif
}
if (r->accept == 0)
r->accept = choice;
#ifdef WITH_TREE_DFA
acc_.resize(choice, false);
acc_[choice - 1] = true;
#endif
}
else
{
parse2(
true,
loc,
firstpos,
lastpos,
nullable,
followpos,
lazyidx,
lazypos,
modifiers,
lookahead[choice],
iter);
pos_insert(startpos, firstpos);
if (nullable)
pos_add(startpos, Position(choice).accept(true));
if (lazypos.empty())
{
for (Positions::const_iterator p = lastpos.begin(); p != lastpos.end(); ++p)
pos_add(followpos[p->pos()], Position(choice).accept(true));
}
else
{
for (Positions::const_iterator p = lastpos.begin(); p != lastpos.end(); ++p)
for (Lazypos::const_iterator l = lazypos.begin(); l != lazypos.end(); ++l)
pos_add(followpos[p->pos()], Position(choice).accept(true).lazy(l->lazy()));
}
}
if (++choice == 0)
error(regex_error::exceeds_limits, loc); // overflow: too many top-level alternations (should never happen)
end_.push_back(loc);
} while (at(loc++) == '|');
--loc;
if (at(loc) == ')')
error(regex_error::mismatched_parens, loc);
else if (at(loc) != 0)
error(regex_error::invalid_syntax, loc);
if (opt_.i)
update_modified(ModConst::i, modifiers, 0, len);
if (opt_.m)
update_modified(ModConst::m, modifiers, 0, len);
if (opt_.s)
update_modified(ModConst::s, modifiers, 0, len);
pms_ = timer_elapsed(t);
#ifdef DEBUG
DBGLOGN("startpos = {");
for (Positions::const_iterator p = startpos.begin(); p != startpos.end(); ++p)
DBGLOGPOS(*p);
DBGLOGA(" }");
for (Follow::const_iterator fp = followpos.begin(); fp != followpos.end(); ++fp)
{
DBGLOGN("followpos(");
DBGLOGPOS(fp->first);
DBGLOGA(" ) = {");
for (Positions::const_iterator p = fp->second.begin(); p != fp->second.end(); ++p)
DBGLOGPOS(*p);
DBGLOGA(" }");
}
#endif
DBGLOG("END parse()");
}
void Pattern::parse1(
bool begin,
Location& loc,
Positions& firstpos,
Positions& lastpos,
bool& nullable,
Follow& followpos,
Lazy& lazyidx,
Lazypos& lazypos,
Mods modifiers,
Locations& lookahead,
Iter& iter)
{
DBGLOG("BEGIN parse1(%u)", loc);
parse2(
begin,
loc,
firstpos,
lastpos,
nullable,
followpos,
lazyidx,
lazypos,
modifiers,
lookahead,
iter);
Positions firstpos1;
Positions lastpos1;
bool nullable1;
Lazypos lazypos1;
Iter iter1;
while (at(loc) == '|')
{
++loc;
parse2(
begin,
loc,
firstpos1,
lastpos1,
nullable1,
followpos,
lazyidx,
lazypos1,
modifiers,
lookahead,
iter1);
pos_insert(firstpos, firstpos1);
pos_insert(lastpos, lastpos1);
lazy_insert(lazypos, lazypos1);
if (nullable1)
nullable = true;
if (iter1 > iter)
iter = iter1;
}
DBGLOG("END parse1()");
}
void Pattern::parse2(
bool begin,
Location& loc,
Positions& firstpos,
Positions& lastpos,
bool& nullable,
Follow& followpos,
Lazy& lazyidx,
Lazypos& lazypos,
Mods modifiers,
Locations& lookahead,
Iter& iter)
{
DBGLOG("BEGIN parse2(%u)", loc);