-
-
Notifications
You must be signed in to change notification settings - Fork 7
/
peppa.c
4937 lines (4240 loc) · 174 KB
/
peppa.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
/*
* Peppa PEG - Ultra lightweight PEG Parser in ANSI C.
*
* MIT License
*
* Copyright (c) 2021 Ju
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
* @file peppa.c
* @brief Peppa PEG source file
* @author Ju Lin
* @copyright MIT
* @date 2021
* @see https://github.com/soasme/PeppaPEG
*/
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdarg.h>
#include <inttypes.h>
#include "peppa.h"
/** Start of unicode utility functions. */
# ifdef ENABLE_UNISTR
#include <unistr.h>
#include <unicase.h>
# else
/**
* @brief Get rune in lower case.
*
* Modified from https://github.com/sheredom/utf8.h
*/
ucs4_t uc_tolower(ucs4_t cp) {
if (((0x0041 <= cp) && (0x005a >= cp)) ||
((0x00c0 <= cp) && (0x00d6 >= cp)) ||
((0x00d8 <= cp) && (0x00de >= cp)) ||
((0x0391 <= cp) && (0x03a1 >= cp)) ||
((0x03a3 <= cp) && (0x03ab >= cp)) ||
((0x0410 <= cp) && (0x042f >= cp))) {
cp += 32;
} else if ((0x0400 <= cp) && (0x040f >= cp)) {
cp += 80;
} else if (((0x0100 <= cp) && (0x012f >= cp)) ||
((0x0132 <= cp) && (0x0137 >= cp)) ||
((0x014a <= cp) && (0x0177 >= cp)) ||
((0x0182 <= cp) && (0x0185 >= cp)) ||
((0x01a0 <= cp) && (0x01a5 >= cp)) ||
((0x01de <= cp) && (0x01ef >= cp)) ||
((0x01f8 <= cp) && (0x021f >= cp)) ||
((0x0222 <= cp) && (0x0233 >= cp)) ||
((0x0246 <= cp) && (0x024f >= cp)) ||
((0x03d8 <= cp) && (0x03ef >= cp)) ||
((0x0460 <= cp) && (0x0481 >= cp)) ||
((0x048a <= cp) && (0x04ff >= cp))) {
cp |= 0x1;
} else if (((0x0139 <= cp) && (0x0148 >= cp)) ||
((0x0179 <= cp) && (0x017e >= cp)) ||
((0x01af <= cp) && (0x01b0 >= cp)) ||
((0x01b3 <= cp) && (0x01b6 >= cp)) ||
((0x01cd <= cp) && (0x01dc >= cp))) {
cp += 1;
cp &= ~0x1;
} else {
switch (cp) {
case 0x0178: cp = 0x00ff; break;
case 0x0243: cp = 0x0180; break;
case 0x018e: cp = 0x01dd; break;
case 0x023d: cp = 0x019a; break;
case 0x0220: cp = 0x019e; break;
case 0x01b7: cp = 0x0292; break;
case 0x01c4: cp = 0x01c6; break;
case 0x01c7: cp = 0x01c9; break;
case 0x01ca: cp = 0x01cc; break;
case 0x01f1: cp = 0x01f3; break;
case 0x01f7: cp = 0x01bf; break;
case 0x0187: cp = 0x0188; break;
case 0x018b: cp = 0x018c; break;
case 0x0191: cp = 0x0192; break;
case 0x0198: cp = 0x0199; break;
case 0x01a7: cp = 0x01a8; break;
case 0x01ac: cp = 0x01ad; break;
case 0x01af: cp = 0x01b0; break;
case 0x01b8: cp = 0x01b9; break;
case 0x01bc: cp = 0x01bd; break;
case 0x01f4: cp = 0x01f5; break;
case 0x023b: cp = 0x023c; break;
case 0x0241: cp = 0x0242; break;
case 0x03fd: cp = 0x037b; break;
case 0x03fe: cp = 0x037c; break;
case 0x03ff: cp = 0x037d; break;
case 0x037f: cp = 0x03f3; break;
case 0x0386: cp = 0x03ac; break;
case 0x0388: cp = 0x03ad; break;
case 0x0389: cp = 0x03ae; break;
case 0x038a: cp = 0x03af; break;
case 0x038c: cp = 0x03cc; break;
case 0x038e: cp = 0x03cd; break;
case 0x038f: cp = 0x03ce; break;
case 0x0370: cp = 0x0371; break;
case 0x0372: cp = 0x0373; break;
case 0x0376: cp = 0x0377; break;
case 0x03f4: cp = 0x03b8; break;
case 0x03cf: cp = 0x03d7; break;
case 0x03f9: cp = 0x03f2; break;
case 0x03f7: cp = 0x03f8; break;
case 0x03fa: cp = 0x03fb; break;
default: break;
}
}
return cp;
}
/**
* @brief Get rune in upper case.
*
* Modified from https://github.com/sheredom/utf8.h
*/
ucs4_t uc_toupper(ucs4_t cp) {
if (((0x0061 <= cp) && (0x007a >= cp)) ||
((0x00e0 <= cp) && (0x00f6 >= cp)) ||
((0x00f8 <= cp) && (0x00fe >= cp)) ||
((0x03b1 <= cp) && (0x03c1 >= cp)) ||
((0x03c3 <= cp) && (0x03cb >= cp)) ||
((0x0430 <= cp) && (0x044f >= cp))) {
cp -= 32;
} else if ((0x0450 <= cp) && (0x045f >= cp)) {
cp -= 80;
} else if (((0x0100 <= cp) && (0x012f >= cp)) ||
((0x0132 <= cp) && (0x0137 >= cp)) ||
((0x014a <= cp) && (0x0177 >= cp)) ||
((0x0182 <= cp) && (0x0185 >= cp)) ||
((0x01a0 <= cp) && (0x01a5 >= cp)) ||
((0x01de <= cp) && (0x01ef >= cp)) ||
((0x01f8 <= cp) && (0x021f >= cp)) ||
((0x0222 <= cp) && (0x0233 >= cp)) ||
((0x0246 <= cp) && (0x024f >= cp)) ||
((0x03d8 <= cp) && (0x03ef >= cp)) ||
((0x0460 <= cp) && (0x0481 >= cp)) ||
((0x048a <= cp) && (0x04ff >= cp))) {
cp &= ~0x1;
} else if (((0x0139 <= cp) && (0x0148 >= cp)) ||
((0x0179 <= cp) && (0x017e >= cp)) ||
((0x01af <= cp) && (0x01b0 >= cp)) ||
((0x01b3 <= cp) && (0x01b6 >= cp)) ||
((0x01cd <= cp) && (0x01dc >= cp))) {
cp -= 1;
cp |= 0x1;
} else {
switch (cp) {
case 0x00ff: cp = 0x0178; break;
case 0x0180: cp = 0x0243; break;
case 0x01dd: cp = 0x018e; break;
case 0x019a: cp = 0x023d; break;
case 0x019e: cp = 0x0220; break;
case 0x0292: cp = 0x01b7; break;
case 0x01c6: cp = 0x01c4; break;
case 0x01c9: cp = 0x01c7; break;
case 0x01cc: cp = 0x01ca; break;
case 0x01f3: cp = 0x01f1; break;
case 0x01bf: cp = 0x01f7; break;
case 0x0188: cp = 0x0187; break;
case 0x018c: cp = 0x018b; break;
case 0x0192: cp = 0x0191; break;
case 0x0199: cp = 0x0198; break;
case 0x01a8: cp = 0x01a7; break;
case 0x01ad: cp = 0x01ac; break;
case 0x01b0: cp = 0x01af; break;
case 0x01b9: cp = 0x01b8; break;
case 0x01bd: cp = 0x01bc; break;
case 0x01f5: cp = 0x01f4; break;
case 0x023c: cp = 0x023b; break;
case 0x0242: cp = 0x0241; break;
case 0x037b: cp = 0x03fd; break;
case 0x037c: cp = 0x03fe; break;
case 0x037d: cp = 0x03ff; break;
case 0x03f3: cp = 0x037f; break;
case 0x03ac: cp = 0x0386; break;
case 0x03ad: cp = 0x0388; break;
case 0x03ae: cp = 0x0389; break;
case 0x03af: cp = 0x038a; break;
case 0x03cc: cp = 0x038c; break;
case 0x03cd: cp = 0x038e; break;
case 0x03ce: cp = 0x038f; break;
case 0x0371: cp = 0x0370; break;
case 0x0373: cp = 0x0372; break;
case 0x0377: cp = 0x0376; break;
case 0x03d1: cp = 0x0398; break;
case 0x03d7: cp = 0x03cf; break;
case 0x03f2: cp = 0x03f9; break;
case 0x03f8: cp = 0x03f7; break;
case 0x03fb: cp = 0x03fa; break;
default: break;
}
}
return cp;
}
# endif
/** End of unicode utility functions. */
/** Start of khash.h */
/* The MIT License
Copyright (c) 2008, 2009, 2011 by Attractive Chaos <[email protected]>
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
#ifndef __AC_KHASH_H
#define __AC_KHASH_H
#define AC_VERSION_KHASH_H "0.2.8"
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#if UINT_MAX == 0xffffffffu
typedef unsigned int khint32_t;
#elif ULONG_MAX == 0xffffffffu
typedef unsigned long khint32_t;
#endif
#if ULONG_MAX == ULLONG_MAX
typedef unsigned long khint64_t;
#else
typedef unsigned long long khint64_t;
#endif
#ifndef kh_inline
#ifdef _MSC_VER
#define kh_inline __inline
#else
/* #define kh_inline inline */ /* ANSI has no inline. */
#define kh_inline
#endif
#endif /* kh_inline */
#ifndef klib_unused
#if (defined __clang__ && __clang_major__ >= 3) || (defined __GNUC__ && __GNUC__ >= 3)
#define klib_unused __attribute__ ((__unused__))
#else
#define klib_unused
#endif
#endif /* klib_unused */
typedef khint32_t khint_t;
typedef khint_t khiter_t;
#define __ac_isempty(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&2)
#define __ac_isdel(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&1)
#define __ac_iseither(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&3)
#define __ac_set_isdel_false(flag, i) (flag[i>>4]&=~(1ul<<((i&0xfU)<<1)))
#define __ac_set_isempty_false(flag, i) (flag[i>>4]&=~(2ul<<((i&0xfU)<<1)))
#define __ac_set_isboth_false(flag, i) (flag[i>>4]&=~(3ul<<((i&0xfU)<<1)))
#define __ac_set_isdel_true(flag, i) (flag[i>>4]|=1ul<<((i&0xfU)<<1))
#define __ac_fsize(m) ((m) < 16? 1 : (m)>>4)
#ifndef kroundup32
#define kroundup32(x) (--(x), (x)|=(x)>>1, (x)|=(x)>>2, (x)|=(x)>>4, (x)|=(x)>>8, (x)|=(x)>>16, ++(x))
#endif
#ifndef kcalloc
#define kcalloc(N,Z) calloc(N,Z)
#endif
#ifndef kmalloc
#define kmalloc(Z) malloc(Z)
#endif
#ifndef krealloc
#define krealloc(P,Z) realloc(P,Z)
#endif
#ifndef kfree
#define kfree(P) free(P)
#endif
static const double __ac_HASH_UPPER = 0.77;
#define __KHASH_TYPE(name, khkey_t, khval_t) \
typedef struct kh_##name##_s { \
khint_t n_buckets, size, n_occupied, upper_bound; \
khint32_t *flags; \
khkey_t *keys; \
khval_t *vals; \
} kh_##name##_t;
#define __KHASH_PROTOTYPES(name, khkey_t, khval_t) \
extern kh_##name##_t *kh_init_##name(void); \
extern void kh_destroy_##name(kh_##name##_t *h); \
extern void kh_clear_##name(kh_##name##_t *h); \
extern khint_t kh_get_##name(const kh_##name##_t *h, khkey_t key); \
extern int kh_resize_##name(kh_##name##_t *h, khint_t new_n_buckets); \
extern khint_t kh_put_##name(kh_##name##_t *h, khkey_t key, int *ret); \
extern void kh_del_##name(kh_##name##_t *h, khint_t x);
#define __KHASH_IMPL(name, SCOPE, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
SCOPE kh_##name##_t *kh_init_##name(void) { \
return (kh_##name##_t*)kcalloc(1, sizeof(kh_##name##_t)); \
} \
SCOPE void kh_destroy_##name(kh_##name##_t *h) \
{ \
if (h) { \
kfree((void *)h->keys); kfree(h->flags); \
kfree((void *)h->vals); \
kfree(h); \
} \
} \
SCOPE void kh_clear_##name(kh_##name##_t *h) \
{ \
if (h && h->flags) { \
memset(h->flags, 0xaa, __ac_fsize(h->n_buckets) * sizeof(khint32_t)); \
h->size = h->n_occupied = 0; \
} \
} \
SCOPE khint_t kh_get_##name(const kh_##name##_t *h, khkey_t key) \
{ \
if (h->n_buckets) { \
khint_t k, i, last, mask, step = 0; \
mask = h->n_buckets - 1; \
k = __hash_func(key); i = k & mask; \
last = i; \
while (!__ac_isempty(h->flags, i) && (__ac_isdel(h->flags, i) || !__hash_equal(h->keys[i], key))) { \
i = (i + (++step)) & mask; \
if (i == last) return h->n_buckets; \
} \
return __ac_iseither(h->flags, i)? h->n_buckets : i; \
} else return 0; \
} \
SCOPE int kh_resize_##name(kh_##name##_t *h, khint_t new_n_buckets) \
{ /* This function uses 0.25*n_buckets bytes of working space instead of [sizeof(key_t+val_t)+.25]*n_buckets. */ \
khint32_t *new_flags = 0; \
khint_t j = 1; \
{ \
kroundup32(new_n_buckets); \
if (new_n_buckets < 4) new_n_buckets = 4; \
if (h->size >= (khint_t)(new_n_buckets * __ac_HASH_UPPER + 0.5)) j = 0; /* requested size is too small */ \
else { /* hash table size to be changed (shrink or expand); rehash */ \
new_flags = (khint32_t*)kmalloc(__ac_fsize(new_n_buckets) * sizeof(khint32_t)); \
if (!new_flags) return -1; \
memset(new_flags, 0xaa, __ac_fsize(new_n_buckets) * sizeof(khint32_t)); \
if (h->n_buckets < new_n_buckets) { /* expand */ \
khkey_t *new_keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
if (!new_keys) { kfree(new_flags); return -1; } \
h->keys = new_keys; \
if (kh_is_map) { \
khval_t *new_vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
if (!new_vals) { kfree(new_flags); return -1; } \
h->vals = new_vals; \
} \
} /* otherwise shrink */ \
} \
} \
if (j) { /* rehashing is needed */ \
for (j = 0; j != h->n_buckets; ++j) { \
if (__ac_iseither(h->flags, j) == 0) { \
khkey_t key = h->keys[j]; \
khval_t val; \
khint_t new_mask; \
new_mask = new_n_buckets - 1; \
if (kh_is_map) val = h->vals[j]; \
__ac_set_isdel_true(h->flags, j); \
while (1) { /* kick-out process; sort of like in Cuckoo hashing */ \
khint_t k, i, step = 0; \
k = __hash_func(key); \
i = k & new_mask; \
while (!__ac_isempty(new_flags, i)) i = (i + (++step)) & new_mask; \
__ac_set_isempty_false(new_flags, i); \
if (i < h->n_buckets && __ac_iseither(h->flags, i) == 0) { /* kick out the existing element */ \
{ khkey_t tmp = h->keys[i]; h->keys[i] = key; key = tmp; } \
if (kh_is_map) { khval_t tmp = h->vals[i]; h->vals[i] = val; val = tmp; } \
__ac_set_isdel_true(h->flags, i); /* mark it as deleted in the old hash table */ \
} else { /* write the element and jump out of the loop */ \
h->keys[i] = key; \
if (kh_is_map) h->vals[i] = val; \
break; \
} \
} \
} \
} \
if (h->n_buckets > new_n_buckets) { /* shrink the hash table */ \
h->keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
if (kh_is_map) h->vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
} \
kfree(h->flags); /* free the working space */ \
h->flags = new_flags; \
h->n_buckets = new_n_buckets; \
h->n_occupied = h->size; \
h->upper_bound = (khint_t)(h->n_buckets * __ac_HASH_UPPER + 0.5); \
} \
return 0; \
} \
SCOPE khint_t kh_put_##name(kh_##name##_t *h, khkey_t key, int *ret) \
{ \
khint_t x; \
if (h->n_occupied >= h->upper_bound) { /* update the hash table */ \
if (h->n_buckets > (h->size<<1)) { \
if (kh_resize_##name(h, h->n_buckets - 1) < 0) { /* clear "deleted" elements */ \
*ret = -1; return h->n_buckets; \
} \
} else if (kh_resize_##name(h, h->n_buckets + 1) < 0) { /* expand the hash table */ \
*ret = -1; return h->n_buckets; \
} \
} /* TODO: to implement automatically shrinking; resize() already support shrinking */ \
{ \
khint_t k, i, site, last, mask = h->n_buckets - 1, step = 0; \
x = site = h->n_buckets; k = __hash_func(key); i = k & mask; \
if (__ac_isempty(h->flags, i)) x = i; /* for speed up */ \
else { \
last = i; \
while (!__ac_isempty(h->flags, i) && (__ac_isdel(h->flags, i) || !__hash_equal(h->keys[i], key))) { \
if (__ac_isdel(h->flags, i)) site = i; \
i = (i + (++step)) & mask; \
if (i == last) { x = site; break; } \
} \
if (x == h->n_buckets) { \
if (__ac_isempty(h->flags, i) && site != h->n_buckets) x = site; \
else x = i; \
} \
} \
} \
if (__ac_isempty(h->flags, x)) { /* not present at all */ \
h->keys[x] = key; \
__ac_set_isboth_false(h->flags, x); \
++h->size; ++h->n_occupied; \
*ret = 1; \
} else if (__ac_isdel(h->flags, x)) { /* deleted */ \
h->keys[x] = key; \
__ac_set_isboth_false(h->flags, x); \
++h->size; \
*ret = 2; \
} else *ret = 0; /* Don't touch h->keys[x] if present and not deleted */ \
return x; \
} \
SCOPE void kh_del_##name(kh_##name##_t *h, khint_t x) \
{ \
if (x != h->n_buckets && !__ac_iseither(h->flags, x)) { \
__ac_set_isdel_true(h->flags, x); \
--h->size; \
} \
}
#define KHASH_DECLARE(name, khkey_t, khval_t) \
__KHASH_TYPE(name, khkey_t, khval_t) \
__KHASH_PROTOTYPES(name, khkey_t, khval_t)
#define KHASH_INIT2(name, SCOPE, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
__KHASH_TYPE(name, khkey_t, khval_t) \
__KHASH_IMPL(name, SCOPE, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal)
#define KHASH_INIT(name, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
KHASH_INIT2(name, static kh_inline klib_unused, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal)
#define kh_int_hash_func(key) (khint32_t)(key)
#define kh_int_hash_equal(a, b) ((a) == (b))
#define kh_int64_hash_func(key) (khint32_t)((key)>>33^(key)^(key)<<11)
#define kh_int64_hash_equal(a, b) ((a) == (b))
static kh_inline khint_t __ac_X31_hash_string(const char *s)
{
khint_t h = (khint_t)*s;
if (h) for (++s ; *s; ++s) h = (h << 5) - h + (khint_t)*s;
return h;
}
#define kh_str_hash_func(key) __ac_X31_hash_string(key)
#define kh_str_hash_equal(a, b) (strcmp(a, b) == 0)
#define khash_t(name) kh_##name##_t
#define kh_init(name) kh_init_##name()
#define kh_destroy(name, h) kh_destroy_##name(h)
#define kh_clear(name, h) kh_clear_##name(h)
#define kh_resize(name, h, s) kh_resize_##name(h, s)
#define kh_put(name, h, k, r) kh_put_##name(h, k, r)
#define kh_get(name, h, k) kh_get_##name(h, k)
#define kh_del(name, h, k) kh_del_##name(h, k)
#define kh_exist(h, x) (!__ac_iseither((h)->flags, (x)))
#define kh_key(h, x) ((h)->keys[x])
#define kh_val(h, x) ((h)->vals[x])
#define kh_value(h, x) ((h)->vals[x])
#define kh_begin(h) (khint_t)(0)
#define kh_end(h) ((h)->n_buckets)
#define kh_size(h) ((h)->size)
#define kh_n_buckets(h) ((h)->n_buckets)
#define kh_foreach(h, kvar, vvar, code) { khint_t __i; \
for (__i = kh_begin(h); __i != kh_end(h); ++__i) { \
if (!kh_exist(h,__i)) continue; \
(kvar) = kh_key(h,__i); \
(vvar) = kh_val(h,__i); \
code; \
} }
#define kh_foreach_value(h, vvar, code) { khint_t __i; \
for (__i = kh_begin(h); __i != kh_end(h); ++__i) { \
if (!kh_exist(h,__i)) continue; \
(vvar) = kh_val(h,__i); \
code; \
} }
#define KHASH_SET_INIT_INT(name) \
KHASH_INIT(name, khint32_t, char, 0, kh_int_hash_func, kh_int_hash_equal)
#define KHASH_MAP_INIT_INT(name, khval_t) \
KHASH_INIT(name, khint32_t, khval_t, 1, kh_int_hash_func, kh_int_hash_equal)
#define KHASH_SET_INIT_INT64(name) \
KHASH_INIT(name, khint64_t, char, 0, kh_int64_hash_func, kh_int64_hash_equal)
#define KHASH_MAP_INIT_INT64(name, khval_t) \
KHASH_INIT(name, khint64_t, khval_t, 1, kh_int64_hash_func, kh_int64_hash_equal)
typedef const char *kh_cstr_t;
#define KHASH_SET_INIT_STR(name) \
KHASH_INIT(name, kh_cstr_t, char, 0, kh_str_hash_func, kh_str_hash_equal)
#define KHASH_MAP_INIT_STR(name, khval_t) \
KHASH_INIT(name, kh_cstr_t, khval_t, 1, kh_str_hash_func, kh_str_hash_equal)
#endif /* __AC_KHASH_H */
/** End of khash.h */
KHASH_MAP_INIT_STR(rules, P4_Expression*)
struct P4_Grammar {
/** A map associating names with expressions. Type: Map<str, P4_Expression*>. */
khash_t(rules)* rules;
/** The total number of spaced rules. */
size_t spaced_count;
/** The repetition rule for spaced rules. */
P4_Expression* spaced_rules;
/** The recursion limit, or maximum allowed nested rules. */
size_t depth;
/** The callback after a match for an expression is successful. */
P4_MatchCallback on_match;
/** The callback after a match for an expression is failed. */
P4_ErrorCallback on_error;
/** The callback to free user data. */
P4_UserDataFreeFunc free_func;
};
struct P4_Expression {
/* The name of expression. */
P4_String name;
/** The kind of expression. */
P4_ExpressionKind kind;
/** The flag of expression. */
P4_ExpressionFlag flag;
union {
/** Used by P4_Numeric. */
size_t num;
/** Used by P4_Literal and P4_BackReference. */
struct {
P4_String literal;
size_t literal_len;
bool sensitive;
size_t backref_index;
};
/** Used by P4_Reference..P4_Negative. */
struct {
P4_String reference;
P4_Expression* ref_expr;
};
/** Used by P4_Range. */
struct {
size_t ranges_count;
struct P4_RuneRange* ranges;
};
# if ENABLE_UNISTR
/** Used by P4_UnicodeCategory. */
struct {
uc_property_t unicode_property;
uc_general_category_t unicode_category;
};
# endif
/** Used by P4_Sequence..P4_Choice. */
struct {
P4_Expression** members;
size_t count;
bool has_backref;
};
/** Used by P4_ZeroOrOnce..P4_RepeatExact.
* repeat the expr for n times, n >= min and n <= max. */
struct {
P4_Expression* repeat_expr; /* maybe we can merge it with ref_expr? */
size_t repeat_min;
size_t repeat_max;
};
/** Used by P4_LeftRecursion. */
struct {
P4_Expression* lhs;
P4_Expression* rhs;
P4_String recur_ref;
};
};
};
struct P4_Frame {
/** The current matching expression for the frame. */
P4_Expression* expr;
/** The current rule for the frame. */
P4_Expression* rule;
/** Whether spacing is applicable to frame & frame dependents. */
bool space;
/** Whether silencing is applicable to frame & frame dependents. */
bool silent;
/** Whether cut is enabled to frame. */
bool cut;
/** The slices for each backref member.
* This field is applicable where a sequence rule has
* at least one backref descendant. */
P4_Slice* backref_slices;
/** The next frame in the stack. */
P4_Frame* next;
};
struct P4_Source {
/** The grammar used to parse the source. */
P4_Grammar* grammar;
/** The entry rule name in the grammar used to parse the source. */
P4_String entry_name;
/** The content of the source. */
P4_String content;
/** The length of the source. */
P4_Slice slice;
/**
* The position of the consumed input. Min: 0, Max: strlen(content).
*
* It's possible the pos is less then length of content when the Source
* is successfully parsed. It's called a partial parse.
*
* To avoid that, the rule will need to be wrapped with an EOI and SOI.
* An SOI is Positive(Range(1, 0x10ffff))
* and An EOI is Negative(Range(1, 0x10ffff)). When the rule is wrapped,
* the input is guaranteed to be parsed until all bits are consumed.
* */
size_t pos;
/**
* The line number of the unconsumed input. Min: 1, Max: countlines(content).
*/
size_t lineno;
/**
* The bytes offset of the line in the unconsumed input.
*/
size_t offset;
/** The error code of the parse. */
P4_Error err;
/** The error message of the parse. */
char errmsg[120];
/** The error details. */
struct {
int errno;
size_t lineno;
size_t offset;
P4_Expression* rule;
P4_Expression* expr;
} error;
/** The root of abstract syntax tree. */
P4_Node* root;
/** Reserved: whether to enable DEBUG logs. */
bool verbose;
/** The flag for checking if the parse is matching SPACED rules.
*
* Since we're wrapping SPACED rules into a repetition rule internally,
* it's important to prevent matching SPACED rules in match_repeat.
*
* XXX: Maybe there are some better ways to prevent that?
*/
bool whitespacing;
/** The top frame in the stack. */
P4_Frame* frame_stack;
/** The size of frame stack. */
size_t frame_stack_size;
/** A pool of unused frame. This is for optimization. */
P4_Frame* unused_frame_stack;
};
/** It indicates the function or type is for public use. */
# define P4_PUBLIC
/** It indicates the function or type is not for public use. */
# define P4_PRIVATE(type) static type
# define unwrap_grammar(r) ((r)->errmsg[0] == 0 ? (r)->grammar : NULL)
# define unwrap_expr(r) ((r)->errmsg[0] == 0 ? (r)->expr : NULL)
static void panic(const char * str) __attribute__((noreturn));
static void panic(const char * str) { fputs(str, stderr); exit(1); }
static void panicf(const char * fmt, ...) __attribute__((noreturn));
static void panicf(const char * fmt, ...) { va_list args; va_start(args, fmt); vfprintf(stderr, fmt, args); exit(1); }
# if defined(DEBUG)
#define UNREACHABLE() panicf("[%s:%d] This code should not be reached in %s()\n", __FILE__, __LINE__, __func__);
# elif defined(_MSC_VER)
#define UNREACHABLE() __assume(0)
# elif (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 5))
#define UNREACHABLE() __builtin_unreachable()
# else
#define UNREACHABLE()
# endif
#define assert(c,m) \
if(!(c)) \
panicf("[%s:%d] Assert failed in %s(): %s\n", __FILE__, __LINE__, __func__, (m));
# define catch_oom(s) do { \
if ((s) == NULL) { \
panic("out of memory."); \
} \
} while (0);
# define catch_err(s, ...) do { \
if ((err = (s)) != P4_Ok) { \
__VA_ARGS__; \
goto finalize; \
} \
} while (0);
#define strdup(x) panic("Do not use strdup(). Use STRDUP() instead.")
static char *STRDUP(const char *src) { /* STRDUP is not ANSI. Copy source here. */
char *dst = P4_MALLOC(strlen (src) + 1);
if (dst == NULL) return NULL;
strcpy(dst, src);
return dst;
}
# define autofree __attribute__ ((cleanup (cleanup_freep)))
static void cleanup_freep (void *p) { /* clean a malloc-ed variable. */
void **pp = (void **) p;
if (*pp) P4_FREE(*pp);
}
P4_PRIVATE(int) P4_CaseCmpInsensitive(const void*, const void*, size_t n);
P4_PRIVATE(void) P4_DiffPosition(P4_String str, P4_Position* start, size_t offset, P4_Position* stop);
# define P4_AdoptNode(head, tail, list) \
do { \
if ((list) != NULL) {\
if ((head) == NULL) (head) = (list); \
if ((tail) == NULL) (tail) = (list); \
else (tail)->next = (list); \
if ((tail) != NULL) {\
while ((tail)->next != NULL) \
(tail) = (tail)->next; \
} \
} \
} while (0)
# define P4_AddSomeGrammarRule(g, name, rule) \
do { \
P4_Error err = P4_Ok; \
P4_Expression* expr = NULL; \
\
if (grammar == NULL || name == NULL) { \
err = P4_NullError; \
goto end; \
} \
if ((expr = (rule)) == NULL) \
panic("failed to create expression: out of memory"); \
\
if ((err=P4_AddGrammarRule(grammar, name, expr))!=P4_Ok) {\
goto end; \
} \
\
break; \
end: \
if (expr != NULL) { \
P4_DeleteExpression(expr); \
} \
return err; \
} while (0)
# define P4_MatchRaisef(s,e,eno) \
do { \
(s)->err = (e); \
(s)->error.errno = (eno); \
(s)->error.lineno = (s)->lineno; \
(s)->error.offset = (s)->offset; \
(s)->error.rule = (s)->frame_stack ? (s)->frame_stack->rule : NULL; \
(s)->error.expr = (s)->frame_stack ? (s)->frame_stack->expr : NULL; \
} while (0);
# define P4_EvalRaisef(r,m,...) \
do { \
memset((r)->errmsg, 0, sizeof((r)->errmsg)); \
sprintf((r)->errmsg, (m), __VA_ARGS__); \
} while (0);
# define is_end(s) ((s)->pos >= (s)->slice.stop.pos)
# define is_tight(e) (((e)->flag & P4_FLAG_TIGHT) != 0)
# define is_scoped(e) (((e)->flag & P4_FLAG_SCOPED) != 0)
# define is_spaced(e) (((e)->flag & P4_FLAG_SPACED) != 0)
# define is_squashed(e) (((e)->flag & P4_FLAG_SQUASHED) != 0)
# define is_lifted(e) (((e)->flag & P4_FLAG_LIFTED) != 0)
# define is_non_terminal(e) (((e)->flag & P4_FLAG_NON_TERMINAL) != 0)
# define is_rule(e) ((e)->name != NULL)
# define is_cut(s) ((s)->frame_stack->cut)
# define need_silent(s) ((s)->frame_stack ? (s)->frame_stack->silent : false)
# define need_whitespace(s) (!(s)->whitespacing && ((s)->frame_stack ? (s)->frame_stack->space : false))
# define need_lift(s,e) (!is_rule(e) || is_lifted(e) || need_silent(s))
# define no_backtrack(s) (no_match(s) && is_cut(s) && !(s)->whitespacing)
# define no_error(s) ((s)->err == P4_Ok)
# define no_match(s) ((s)->err == P4_MatchError)
# define set_position(s, d) \
do { \
(s)->pos = (d)->pos; \
(s)->lineno = (d)->lineno; \
(s)->offset = (d)->offset; \
} while (0);
# define mark_position(s, p) \
P4_Position* p = & (P4_Position) { \
.pos = (s)->pos, \
.lineno = (s)->lineno, \
.offset = (s)->offset \
};
# define get_slice_size(s) ((s)->stop.pos - (s)->start.pos)
# define set_slice(s, a, b) \
do { \
set_position(&((s)->start), (a)); \
set_position(&((s)->stop), (b)); \
} while (0)
# define foreach_child(node, child, code) \
for ((child) = (node)->head; \
(child) != NULL; \
(child) = (child)->next) { \
code; \
}
# define rescue_error(s) do { (s)->err = P4_Ok; (s)->errmsg[0] = '\0'; } while (0)
# define peek_frame(s) ((s)->frame_stack)
# define peek_rule_name(s) ((s)->frame_stack->rule->name)
# define peek_rule_frame(s, f) \
P4_Frame *tmp = (s)->frame_stack; \
while (tmp) { \
if (is_rule(tmp->expr)) { \
(f) = tmp; \
break; \
} \
tmp = tmp->next; \
}
# define remaining_text(s) ((s)->content + (s)->pos)
P4_PRIVATE(P4_Error) push_frame(P4_Source*, P4_Expression*);
P4_PRIVATE(P4_Error) pop_frame(P4_Source*);
P4_PRIVATE(P4_Node*) match_expression(P4_Source*, P4_Expression*);
P4_PRIVATE(P4_Node*) match_literal(P4_Source*, P4_Expression*);
P4_PRIVATE(P4_Node*) match_range(P4_Source*, P4_Expression*);
P4_PRIVATE(P4_Node*) match_unicode_category(P4_Source*
# ifdef ENABLE_UNISTR
, P4_Expression*
# endif
);
P4_PRIVATE(P4_Node*) match_reference(P4_Source*, P4_Expression*);
P4_PRIVATE(P4_Node*) match_positive(P4_Source*, P4_Expression*);
P4_PRIVATE(P4_Node*) match_negative(P4_Source*, P4_Expression*);
P4_PRIVATE(P4_Node*) match_cut(P4_Source*);
P4_PRIVATE(P4_Node*) match_sequence(P4_Source*, P4_Expression*);
P4_PRIVATE(P4_Node*) match_choice(P4_Source*, P4_Expression*);
P4_PRIVATE(P4_Node*) match_repeat(P4_Source*, P4_Expression*);
P4_PRIVATE(P4_Node*) match_left_recursion(P4_Source*, P4_Expression*);
P4_PRIVATE(P4_Node*) match_spaced_rules(P4_Source*);
P4_PRIVATE(P4_Node*) match_back_reference(P4_Source*, P4_Frame*, size_t, bool);
P4_PRIVATE(void) P4_DeleteNodeUserData(P4_Grammar* grammar, P4_Node* node);
P4_PRIVATE(P4_Expression*) P4_GetReference(P4_Source*, P4_Expression*);
P4_PRIVATE(P4_String) P4_CopySliceString(P4_String, P4_Slice*);
P4_PRIVATE(bool) P4_HasBackrefDescendant(P4_Expression*);
P4_PRIVATE(P4_Error) P4_SetWhitespaces(P4_Grammar*);
P4_PRIVATE(P4_Expression*) P4_GetWhitespaces(P4_Grammar*);
P4_PRIVATE(P4_Error) P4_RefreshReference(P4_Expression*, P4_String);
P4_PRIVATE(P4_Error) P4_PegEvalFlag(P4_Node* node, P4_ExpressionFlag *flag);
P4_PRIVATE(P4_Error) P4_PegEvalRuleFlags(P4_Node* node, P4_ExpressionFlag* flag);
P4_PRIVATE(P4_Error) P4_PegEvalNumber(P4_Node* node, size_t* num);
P4_PRIVATE(P4_Error) P4_PegEvalChar(P4_Node* node, ucs4_t* rune);
P4_PRIVATE(P4_Error) P4_PegEvalLiteral(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalInsensitive(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalRange(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalMembers(P4_Node* node, P4_Expression* expr, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalSequence(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalChoice(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalLeftRecursion(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalPositive(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalNegative(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalRepeat(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalDot(P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalReference(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalBackReference(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalExpression(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalGrammarRule(P4_Node* node, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalRuleName(P4_Node* node, P4_String* result);
P4_PRIVATE(P4_Error) P4_PegEvalGrammarReferences(P4_Grammar* grammar, P4_Expression* expr, P4_Result* result);
P4_PRIVATE(P4_Error) P4_PegEvalGrammar(P4_Node* node, P4_Result* result);
static P4_RuneRange _C[] = {
{0x0000, 0x001f, 1}, {0x007f, 0x009f, 1}, {0x00ad, 0x0600, 1363}, {0x0601, 0x0605, 1},
{0x061c, 0x06dd, 193}, {0x070f, 0x08e2, 467}, {0x180e, 0x200b, 2045}, {0x200c, 0x200f, 1},
{0x202a, 0x202e, 1}, {0x2060, 0x2064, 1}, {0x2066, 0x206f, 1}, {0xd800, 0xf8ff, 1},
{0xfeff, 0xfff9, 250}, {0xfffa, 0xfffb, 1},
{0x110bd, 0x110cd, 16}, {0x13430, 0x13438, 1}, {0x1bca0, 0x1bca3, 1}, {0x1d173, 0x1d17a, 1},
{0xe0001, 0xe0020, 31}, {0xe0021, 0xe007f, 1}, {0xf0000, 0xffffd, 1}, {0x100000, 0x10fffd, 1},
};
static P4_RuneRange _Cc[] = {
{0x0000, 0x001f, 1}, {0x007f, 0x009f, 1},
};
static P4_RuneRange _Cf[] = {
{0x00ad, 0x0600, 1363}, {0x0601, 0x0605, 1}, {0x061c, 0x06dd, 193}, {0x070f, 0x08e2, 467},
{0x180e, 0x200b, 2045}, {0x200c, 0x200f, 1}, {0x202a, 0x202e, 1}, {0x2060, 0x2064, 1},
{0x2066, 0x206f, 1}, {0xfeff, 0xfff9, 250}, {0xfffa, 0xfffb, 1},
{0x110bd, 0x110cd, 16}, {0x13430, 0x13438, 1}, {0x1bca0, 0x1bca3, 1}, {0x1d173, 0x1d17a, 1},
{0xe0001, 0xe0020, 31}, {0xe0021, 0xe007f, 1},
};
static P4_RuneRange _Co[] = {
{0xe000, 0xf8ff, 1},
{0xf0000, 0xffffd, 1}, {0x100000, 0x10fffd, 1},
};
static P4_RuneRange _Cs[] = {
{0xd800, 0xdfff, 1},
};
static P4_RuneRange _L[] = {
{0x0041, 0x005a, 1}, {0x0061, 0x007a, 1}, {0x00aa, 0x00b5, 11}, {0x00ba, 0x00c0, 6},
{0x00c1, 0x00d6, 1}, {0x00d8, 0x00f6, 1}, {0x00f8, 0x02c1, 1}, {0x02c6, 0x02d1, 1},
{0x02e0, 0x02e4, 1}, {0x02ec, 0x02ee, 2}, {0x0370, 0x0374, 1}, {0x0376, 0x0377, 1},
{0x037a, 0x037d, 1}, {0x037f, 0x0386, 7}, {0x0388, 0x038a, 1}, {0x038c, 0x038e, 2},
{0x038f, 0x03a1, 1}, {0x03a3, 0x03f5, 1}, {0x03f7, 0x0481, 1}, {0x048a, 0x052f, 1},
{0x0531, 0x0556, 1}, {0x0559, 0x0560, 7}, {0x0561, 0x0588, 1}, {0x05d0, 0x05ea, 1},
{0x05ef, 0x05f2, 1}, {0x0620, 0x064a, 1}, {0x066e, 0x066f, 1}, {0x0671, 0x06d3, 1},
{0x06d5, 0x06e5, 16}, {0x06e6, 0x06ee, 8}, {0x06ef, 0x06fa, 11}, {0x06fb, 0x06fc, 1},
{0x06ff, 0x0710, 17}, {0x0712, 0x072f, 1}, {0x074d, 0x07a5, 1}, {0x07b1, 0x07ca, 25},
{0x07cb, 0x07ea, 1}, {0x07f4, 0x07f5, 1}, {0x07fa, 0x0800, 6}, {0x0801, 0x0815, 1},
{0x081a, 0x0824, 10}, {0x0828, 0x0840, 24}, {0x0841, 0x0858, 1}, {0x0860, 0x086a, 1},
{0x08a0, 0x08b4, 1}, {0x08b6, 0x08c7, 1}, {0x0904, 0x0939, 1}, {0x093d, 0x0950, 19},
{0x0958, 0x0961, 1}, {0x0971, 0x0980, 1}, {0x0985, 0x098c, 1}, {0x098f, 0x0990, 1},
{0x0993, 0x09a8, 1}, {0x09aa, 0x09b0, 1}, {0x09b2, 0x09b6, 4}, {0x09b7, 0x09b9, 1},
{0x09bd, 0x09ce, 17}, {0x09dc, 0x09dd, 1}, {0x09df, 0x09e1, 1}, {0x09f0, 0x09f1, 1},
{0x09fc, 0x0a05, 9}, {0x0a06, 0x0a0a, 1}, {0x0a0f, 0x0a10, 1}, {0x0a13, 0x0a28, 1},
{0x0a2a, 0x0a30, 1}, {0x0a32, 0x0a33, 1}, {0x0a35, 0x0a36, 1}, {0x0a38, 0x0a39, 1},
{0x0a59, 0x0a5c, 1}, {0x0a5e, 0x0a72, 20}, {0x0a73, 0x0a74, 1}, {0x0a85, 0x0a8d, 1},
{0x0a8f, 0x0a91, 1}, {0x0a93, 0x0aa8, 1}, {0x0aaa, 0x0ab0, 1}, {0x0ab2, 0x0ab3, 1},
{0x0ab5, 0x0ab9, 1}, {0x0abd, 0x0ad0, 19}, {0x0ae0, 0x0ae1, 1}, {0x0af9, 0x0b05, 12},
{0x0b06, 0x0b0c, 1}, {0x0b0f, 0x0b10, 1}, {0x0b13, 0x0b28, 1}, {0x0b2a, 0x0b30, 1},
{0x0b32, 0x0b33, 1}, {0x0b35, 0x0b39, 1}, {0x0b3d, 0x0b5c, 31}, {0x0b5d, 0x0b5f, 2},
{0x0b60, 0x0b61, 1}, {0x0b71, 0x0b83, 18}, {0x0b85, 0x0b8a, 1}, {0x0b8e, 0x0b90, 1},
{0x0b92, 0x0b95, 1}, {0x0b99, 0x0b9a, 1}, {0x0b9c, 0x0b9e, 2}, {0x0b9f, 0x0ba3, 4},
{0x0ba4, 0x0ba8, 4}, {0x0ba9, 0x0baa, 1}, {0x0bae, 0x0bb9, 1}, {0x0bd0, 0x0c05, 53},
{0x0c06, 0x0c0c, 1}, {0x0c0e, 0x0c10, 1}, {0x0c12, 0x0c28, 1}, {0x0c2a, 0x0c39, 1},
{0x0c3d, 0x0c58, 27}, {0x0c59, 0x0c5a, 1}, {0x0c60, 0x0c61, 1}, {0x0c80, 0x0c85, 5},
{0x0c86, 0x0c8c, 1}, {0x0c8e, 0x0c90, 1}, {0x0c92, 0x0ca8, 1}, {0x0caa, 0x0cb3, 1},
{0x0cb5, 0x0cb9, 1}, {0x0cbd, 0x0cde, 33}, {0x0ce0, 0x0ce1, 1}, {0x0cf1, 0x0cf2, 1},
{0x0d04, 0x0d0c, 1}, {0x0d0e, 0x0d10, 1}, {0x0d12, 0x0d3a, 1}, {0x0d3d, 0x0d4e, 17},
{0x0d54, 0x0d56, 1}, {0x0d5f, 0x0d61, 1}, {0x0d7a, 0x0d7f, 1}, {0x0d85, 0x0d96, 1},
{0x0d9a, 0x0db1, 1}, {0x0db3, 0x0dbb, 1}, {0x0dbd, 0x0dc0, 3}, {0x0dc1, 0x0dc6, 1},
{0x0e01, 0x0e30, 1}, {0x0e32, 0x0e33, 1}, {0x0e40, 0x0e46, 1}, {0x0e81, 0x0e82, 1},
{0x0e84, 0x0e86, 2}, {0x0e87, 0x0e8a, 1}, {0x0e8c, 0x0ea3, 1}, {0x0ea5, 0x0ea7, 2},
{0x0ea8, 0x0eb0, 1}, {0x0eb2, 0x0eb3, 1}, {0x0ebd, 0x0ec0, 3}, {0x0ec1, 0x0ec4, 1},
{0x0ec6, 0x0edc, 22}, {0x0edd, 0x0edf, 1}, {0x0f00, 0x0f40, 64}, {0x0f41, 0x0f47, 1},
{0x0f49, 0x0f6c, 1}, {0x0f88, 0x0f8c, 1}, {0x1000, 0x102a, 1}, {0x103f, 0x1050, 17},
{0x1051, 0x1055, 1}, {0x105a, 0x105d, 1}, {0x1061, 0x1065, 4}, {0x1066, 0x106e, 8},
{0x106f, 0x1070, 1}, {0x1075, 0x1081, 1}, {0x108e, 0x10a0, 18}, {0x10a1, 0x10c5, 1},
{0x10c7, 0x10cd, 6}, {0x10d0, 0x10fa, 1}, {0x10fc, 0x1248, 1}, {0x124a, 0x124d, 1},
{0x1250, 0x1256, 1}, {0x1258, 0x125a, 2}, {0x125b, 0x125d, 1}, {0x1260, 0x1288, 1},
{0x128a, 0x128d, 1}, {0x1290, 0x12b0, 1}, {0x12b2, 0x12b5, 1}, {0x12b8, 0x12be, 1},
{0x12c0, 0x12c2, 2}, {0x12c3, 0x12c5, 1}, {0x12c8, 0x12d6, 1}, {0x12d8, 0x1310, 1},