-
Notifications
You must be signed in to change notification settings - Fork 2k
/
ngx_http_lua_lex.c
8250 lines (7855 loc) · 179 KB
/
ngx_http_lua_lex.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) Yichun Zhang (agentzh)
*
* WARNING: DO NOT EVER EDIT THIS FILE!!
*
* This file was automatically generated by the OpenResty Regex compiler.
*/
#include "ngx_http_lua_lex.h"
#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
#include <ctype.h>
#include <errno.h>
#include <string.h>
#if __GNUC__ > 3
# define likely(x) __builtin_expect((x),1)
# define unlikely(x) __builtin_expect((x),0)
#else
# define likely(x) (x)
# define unlikely(x) (x)
#endif
#ifndef u_char
#define u_char unsigned char
#endif
enum {
NO_MATCH = -1,
};
/*
* ngx_http_lua_lex: the "ovec" array should be allocated by the caller with at
* least 2 elements.
*/
int
ngx_http_lua_lex(const u_char *const s, size_t len, int *const ovec)
{
unsigned i = 0;
int matched_0 = -1;
int matched_1 = -1;
int matched_id = NO_MATCH; /* (pending) matched regex ID */
int c;
int caps0_0 = -1;
int caps0_10 = -1;
int caps0_12 = -1;
int caps0_14 = -1;
int caps0_2 = -1;
int caps0_4 = -1;
int caps0_6 = -1;
int caps0_8 = -1;
int caps1_0 = -1;
int caps1_10 = -1;
int caps1_12 = -1;
int caps1_14 = -1;
int caps1_2 = -1;
int caps1_4 = -1;
int caps1_6 = -1;
int caps1_8 = -1;
int caps2_0 = -1;
int caps2_10 = -1;
int caps2_2 = -1;
int caps2_4 = -1;
int caps2_6 = -1;
int caps2_8 = -1;
int caps3_10 = -1;
{ /* DFA node {0} 0 */
if (unlikely(i >= len)) {
i++;
goto st0_error;
}
c = s[i];
i++;
switch (c) {
case 34: {
/* transfer caps from row 0 to row 1 */
/* capture stores */
caps0_12 = i - 1;
goto st2;
break;
}
case 39: {
/* transfer caps from row 0 to row 1 */
/* capture stores */
caps0_14 = i - 1;
goto st3;
break;
}
case 45: {
/* transfer caps from row 0 to row 1 */
/* transfer caps from row 0 to row 2 */
/* capture stores */
caps0_6 = i - 1;
caps1_10 = i - 1;
goto st4;
break;
}
case 91: {
/* transfer caps from row 0 to row 1 */
/* capture stores */
caps0_4 = i - 1;
goto st5;
break;
}
case 93: {
/* transfer caps from row 0 to row 1 */
/* capture stores */
caps0_8 = i - 1;
goto st6;
break;
}
case 123: {
/* transfer caps from row 0 to row 1 */
/* capture stores */
caps0_0 = i - 1;
goto st7;
break;
}
case 125: {
/* transfer caps from row 0 to row 1 */
/* capture stores */
caps0_2 = i - 1;
goto st8;
break;
}
default:
break;
}
/* (c >= 0 && c <= 33)
* || (c >= 35 && c <= 38)
* || (c >= 40 && c <= 44)
* || (c >= 46 && c <= 90)
* || (c == 92)
* || (c >= 94 && c <= 122)
* || (c == 124)
* || (c >= 126 && c <= 255)
*/
goto st1;
} /* end state */
goto st0_error;
st1: { /* DFA node {1} 1 */
if (unlikely(i >= len)) {
i++;
goto st1_error;
}
c = s[i];
i++;
switch (c) {
case 34: {
/* transfer caps from row 0 to row 1 */
/* capture stores */
caps0_12 = i - 1;
goto st2;
break;
}
case 39: {
/* transfer caps from row 0 to row 1 */
/* capture stores */
caps0_14 = i - 1;
goto st3;
break;
}
case 45: {
/* transfer caps from row 0 to row 1 */
/* transfer caps from row 0 to row 2 */
/* capture stores */
caps0_6 = i - 1;
caps1_10 = i - 1;
goto st4;
break;
}
case 91: {
/* transfer caps from row 0 to row 1 */
/* capture stores */
caps0_4 = i - 1;
goto st5;
break;
}
case 93: {
/* transfer caps from row 0 to row 1 */
/* capture stores */
caps0_8 = i - 1;
goto st6;
break;
}
case 123: {
/* transfer caps from row 0 to row 1 */
/* capture stores */
caps0_0 = i - 1;
goto st7;
break;
}
case 125: {
/* transfer caps from row 0 to row 1 */
/* capture stores */
caps0_2 = i - 1;
goto st8;
break;
}
default:
break;
}
/* (c >= 0 && c <= 33)
* || (c >= 35 && c <= 38)
* || (c >= 40 && c <= 44)
* || (c >= 46 && c <= 90)
* || (c == 92)
* || (c >= 94 && c <= 122)
* || (c == 124)
* || (c >= 126 && c <= 255)
*/
goto st1;
} /* end state */
goto st1_error;
st2: { /* DFA node {59,1} 2 */
if (unlikely(i >= len)) {
i++;
goto st2_error;
}
c = s[i];
i++;
switch (c) {
case 10: {
/* transfer caps from row 1 to row 0 */
goto st1;
break;
}
case 34: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_12 = i - 1;
goto st10;
break;
}
case 39: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_14 = i - 1;
goto st11;
break;
}
case 45: {
/* transfer caps from row 1 to row 2 */
/* transfer caps from row 1 to row 3 */
/* capture stores */
caps1_6 = i - 1;
caps2_10 = i - 1;
goto st12;
break;
}
case 91: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_4 = i - 1;
goto st13;
break;
}
case 92: {
goto st14;
break;
}
case 93: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_8 = i - 1;
goto st15;
break;
}
case 123: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_0 = i - 1;
goto st16;
break;
}
case 125: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_2 = i - 1;
goto st17;
break;
}
default:
break;
}
/* (c >= 0 && c <= 9)
* || (c >= 11 && c <= 33)
* || (c >= 35 && c <= 38)
* || (c >= 40 && c <= 44)
* || (c >= 46 && c <= 90)
* || (c >= 94 && c <= 122)
* || (c == 124)
* || (c >= 126 && c <= 255)
*/
goto st9;
} /* end state */
goto st2_error;
st3: { /* DFA node {72,1} 3 */
if (unlikely(i >= len)) {
i++;
goto st3_error;
}
c = s[i];
i++;
switch (c) {
case 10: {
/* transfer caps from row 1 to row 0 */
goto st1;
break;
}
case 34: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_12 = i - 1;
goto st19;
break;
}
case 39: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_14 = i - 1;
goto st20;
break;
}
case 45: {
/* transfer caps from row 1 to row 2 */
/* transfer caps from row 1 to row 3 */
/* capture stores */
caps1_6 = i - 1;
caps2_10 = i - 1;
goto st21;
break;
}
case 91: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_4 = i - 1;
goto st22;
break;
}
case 92: {
goto st23;
break;
}
case 93: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_8 = i - 1;
goto st24;
break;
}
case 123: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_0 = i - 1;
goto st25;
break;
}
case 125: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_2 = i - 1;
goto st26;
break;
}
default:
break;
}
/* (c >= 0 && c <= 9)
* || (c >= 11 && c <= 33)
* || (c >= 35 && c <= 38)
* || (c >= 40 && c <= 44)
* || (c >= 46 && c <= 90)
* || (c >= 94 && c <= 122)
* || (c == 124)
* || (c >= 126 && c <= 255)
*/
goto st18;
} /* end state */
goto st3_error;
st4: { /* DFA node {30,50,1} 4 */
if (unlikely(i >= len)) {
i++;
goto st4_error;
}
c = s[i];
i++;
switch (c) {
case 34: {
/* transfer caps from row 2 to row 0 */
/* transfer caps from row 2 to row 1 */
/* capture stores */
caps0_12 = i - 1;
goto st2;
break;
}
case 39: {
/* transfer caps from row 2 to row 0 */
/* transfer caps from row 2 to row 1 */
/* capture stores */
caps0_14 = i - 1;
goto st3;
break;
}
case 45: {
/* transfer caps from row 2 to row 3 */
/* transfer caps from row 2 to row 4 */
/* capture stores */
caps2_6 = i - 1;
caps3_10 = i - 1;
goto st27;
break;
}
case 91: {
/* transfer caps from row 2 to row 0 */
/* transfer caps from row 2 to row 1 */
/* capture stores */
caps0_4 = i - 1;
goto st5;
break;
}
case 93: {
/* transfer caps from row 2 to row 0 */
/* transfer caps from row 2 to row 1 */
/* capture stores */
caps0_8 = i - 1;
goto st6;
break;
}
case 123: {
/* transfer caps from row 2 to row 0 */
/* transfer caps from row 2 to row 1 */
/* capture stores */
caps0_0 = i - 1;
goto st7;
break;
}
case 125: {
/* transfer caps from row 2 to row 0 */
/* transfer caps from row 2 to row 1 */
/* capture stores */
caps0_2 = i - 1;
goto st8;
break;
}
default:
break;
}
/* (c >= 0 && c <= 33)
* || (c >= 35 && c <= 38)
* || (c >= 40 && c <= 44)
* || (c >= 46 && c <= 90)
* || (c == 92)
* || (c >= 94 && c <= 122)
* || (c == 124)
* || (c >= 126 && c <= 255)
*/
/* transfer caps from row 2 to row 0 */
goto st1;
} /* end state */
goto st4_error;
st5: { /* DFA node {21,1} 5 */
if (unlikely(i >= len)) {
i++;
goto st5_error;
}
c = s[i];
i++;
switch (c) {
case 34: {
/* transfer caps from row 1 to row 0 */
/* capture stores */
caps0_12 = i - 1;
goto st2;
break;
}
case 39: {
/* transfer caps from row 1 to row 0 */
/* capture stores */
caps0_14 = i - 1;
goto st3;
break;
}
case 45: {
/* transfer caps from row 1 to row 0 */
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps0_6 = i - 1;
caps1_10 = i - 1;
goto st4;
break;
}
case 61: {
goto st28;
break;
}
case 91: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_4 = i - 1;
goto st29;
break;
}
case 93: {
/* transfer caps from row 1 to row 0 */
/* capture stores */
caps0_8 = i - 1;
goto st6;
break;
}
case 123: {
/* transfer caps from row 1 to row 0 */
/* capture stores */
caps0_0 = i - 1;
goto st7;
break;
}
case 125: {
/* transfer caps from row 1 to row 0 */
/* capture stores */
caps0_2 = i - 1;
goto st8;
break;
}
default:
break;
}
/* (c >= 0 && c <= 33)
* || (c >= 35 && c <= 38)
* || (c >= 40 && c <= 44)
* || (c >= 46 && c <= 60)
* || (c >= 62 && c <= 90)
* || (c == 92)
* || (c >= 94 && c <= 122)
* || (c == 124)
* || (c >= 126 && c <= 255)
*/
/* transfer caps from row 1 to row 0 */
goto st1;
} /* end state */
goto st5_error;
st6: { /* DFA node {41,1} 6 */
if (unlikely(i >= len)) {
i++;
goto st6_error;
}
c = s[i];
i++;
switch (c) {
case 34: {
/* transfer caps from row 1 to row 0 */
/* capture stores */
caps0_12 = i - 1;
goto st2;
break;
}
case 39: {
/* transfer caps from row 1 to row 0 */
/* capture stores */
caps0_14 = i - 1;
goto st3;
break;
}
case 45: {
/* transfer caps from row 1 to row 0 */
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps0_6 = i - 1;
caps1_10 = i - 1;
goto st4;
break;
}
case 61: {
goto st30;
break;
}
case 91: {
/* transfer caps from row 1 to row 0 */
/* capture stores */
caps0_4 = i - 1;
goto st5;
break;
}
case 93: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_8 = i - 1;
goto st31;
break;
}
case 123: {
/* transfer caps from row 1 to row 0 */
/* capture stores */
caps0_0 = i - 1;
goto st7;
break;
}
case 125: {
/* transfer caps from row 1 to row 0 */
/* capture stores */
caps0_2 = i - 1;
goto st8;
break;
}
default:
break;
}
/* (c >= 0 && c <= 33)
* || (c >= 35 && c <= 38)
* || (c >= 40 && c <= 44)
* || (c >= 46 && c <= 60)
* || (c >= 62 && c <= 90)
* || (c == 92)
* || (c >= 94 && c <= 122)
* || (c == 124)
* || (c >= 126 && c <= 255)
*/
/* transfer caps from row 1 to row 0 */
goto st1;
} /* end state */
goto st6_error;
st7: { /* DFA node {11,1} 7 */
c = i < len ? s[i] : -1;
i++;
/* transfer caps from row 0 to matched */
matched_0 = caps0_0;
/* capture stores */
matched_1 = i - 1;
matched_id = 0;
} /* end state */
ovec[0] = matched_0;
ovec[1] = matched_1;
return matched_id; /* fallback */
st8: { /* DFA node {16,1} 8 */
c = i < len ? s[i] : -1;
i++;
/* transfer caps from row 0 to matched */
matched_0 = caps0_2;
/* capture stores */
matched_1 = i - 1;
matched_id = 1;
} /* end state */
ovec[0] = matched_0;
ovec[1] = matched_1;
return matched_id; /* fallback */
st9: { /* DFA node {65,1} 9 */
if (unlikely(i >= len)) {
i++;
goto st9_error;
}
c = s[i];
i++;
switch (c) {
case 10: {
/* transfer caps from row 1 to row 0 */
goto st1;
break;
}
case 34: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_12 = i - 1;
goto st10;
break;
}
case 39: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_14 = i - 1;
goto st11;
break;
}
case 45: {
/* transfer caps from row 1 to row 2 */
/* transfer caps from row 1 to row 3 */
/* capture stores */
caps1_6 = i - 1;
caps2_10 = i - 1;
goto st12;
break;
}
case 91: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_4 = i - 1;
goto st13;
break;
}
case 92: {
goto st14;
break;
}
case 93: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_8 = i - 1;
goto st15;
break;
}
case 123: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_0 = i - 1;
goto st16;
break;
}
case 125: {
/* transfer caps from row 1 to row 2 */
/* capture stores */
caps1_2 = i - 1;
goto st17;
break;
}
default:
break;
}
/* (c >= 0 && c <= 9)
* || (c >= 11 && c <= 33)
* || (c >= 35 && c <= 38)
* || (c >= 40 && c <= 44)
* || (c >= 46 && c <= 90)
* || (c >= 94 && c <= 122)
* || (c == 124)
* || (c >= 126 && c <= 255)
*/
goto st9;
} /* end state */
goto st9_error;
st10: { /* DFA node {67,59,1} 10 */
c = i < len ? s[i] : -1;
i++;
/* transfer caps from row 0 to matched */
matched_0 = caps0_12;
/* capture stores */
matched_1 = i - 1;
matched_id = 6;
} /* end state */
ovec[0] = matched_0;
ovec[1] = matched_1;
return matched_id; /* fallback */
st11: { /* DFA node {65,72,1} 11 */
if (unlikely(i >= len)) {
i++;
goto st11_error;
}
c = s[i];
i++;
switch (c) {
case 10: {
/* transfer caps from row 2 to row 0 */
goto st1;
break;
}
case 34: {
/* transfer caps from row 2 to row 3 */
/* capture stores */
goto st36;
break;
}
case 39: {
/* transfer caps from row 2 to row 3 */
/* capture stores */
goto st37;
break;
}
case 45: {
/* transfer caps from row 2 to row 3 */
/* transfer caps from row 2 to row 4 */
/* capture stores */
caps2_6 = i - 1;
caps3_10 = i - 1;
goto st38;
break;
}
case 91: {
/* transfer caps from row 2 to row 3 */
/* capture stores */
caps2_4 = i - 1;
goto st39;
break;
}
case 92: {
goto st40;
break;
}
case 93: {
/* transfer caps from row 2 to row 3 */
/* capture stores */
caps2_8 = i - 1;
goto st41;
break;
}
case 123: {
/* transfer caps from row 2 to row 3 */
/* capture stores */
caps2_0 = i - 1;
goto st42;
break;
}
case 125: {
/* transfer caps from row 2 to row 3 */
/* capture stores */
caps2_2 = i - 1;
goto st43;
break;
}
default:
break;
}
/* (c >= 0 && c <= 9)
* || (c >= 11 && c <= 33)
* || (c >= 35 && c <= 38)
* || (c >= 40 && c <= 44)
* || (c >= 46 && c <= 90)
* || (c >= 94 && c <= 122)
* || (c == 124)
* || (c >= 126 && c <= 255)
*/
goto st35;
} /* end state */
goto st11_error;
st12: { /* DFA node {65,30,50,1} 12 */
if (unlikely(i >= len)) {
i++;
goto st12_error;
}
c = s[i];
i++;
switch (c) {
case 10: {
/* transfer caps from row 3 to row 0 */
goto st1;
break;
}
case 34: {
/* transfer caps from row 3 to row 1 */
/* transfer caps from row 3 to row 2 */
/* capture stores */
caps1_12 = i - 1;
goto st10;
break;
}
case 39: {
/* transfer caps from row 3 to row 1 */
/* transfer caps from row 3 to row 2 */
/* capture stores */
caps1_14 = i - 1;
goto st11;
break;
}
case 45: {
/* transfer caps from row 3 to row 4 */
/* transfer caps from row 3 to row 5 */
/* capture stores */
goto st44;
break;
}
case 91: {
/* transfer caps from row 3 to row 1 */
/* transfer caps from row 3 to row 2 */
/* capture stores */
caps1_4 = i - 1;
goto st13;
break;
}
case 92: {
/* transfer caps from row 3 to row 1 */
goto st14;
break;
}
case 93: {
/* transfer caps from row 3 to row 1 */
/* transfer caps from row 3 to row 2 */
/* capture stores */
caps1_8 = i - 1;
goto st15;
break;
}
case 123: {
/* transfer caps from row 3 to row 1 */
/* transfer caps from row 3 to row 2 */
/* capture stores */
caps1_0 = i - 1;
goto st16;
break;
}
case 125: {
/* transfer caps from row 3 to row 1 */
/* transfer caps from row 3 to row 2 */
/* capture stores */
caps1_2 = i - 1;
goto st17;
break;
}
default:
break;
}
/* (c >= 0 && c <= 9)
* || (c >= 11 && c <= 33)
* || (c >= 35 && c <= 38)
* || (c >= 40 && c <= 44)
* || (c >= 46 && c <= 90)
* || (c >= 94 && c <= 122)
* || (c == 124)
* || (c >= 126 && c <= 255)
*/
/* transfer caps from row 3 to row 1 */
goto st9;
} /* end state */
goto st12_error;
st13: { /* DFA node {65,21,1} 13 */
if (unlikely(i >= len)) {
i++;
goto st13_error;
}
c = s[i];
i++;
switch (c) {
case 10: {
/* transfer caps from row 2 to row 0 */
goto st1;
break;
}
case 34: {
/* transfer caps from row 2 to row 1 */
/* capture stores */
caps1_12 = i - 1;
goto st10;
break;
}
case 39: {
/* transfer caps from row 2 to row 1 */
/* capture stores */
caps1_14 = i - 1;
goto st11;
break;
}
case 45: {
/* transfer caps from row 2 to row 1 */
/* transfer caps from row 2 to row 3 */
/* capture stores */
caps1_6 = i - 1;
caps2_10 = i - 1;
goto st12;
break;
}
case 61: {
goto st45;
break;
}
case 91: {
/* transfer caps from row 2 to row 3 */
/* capture stores */
caps2_4 = i - 1;
goto st46;
break;