-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathskt.c
12453 lines (12032 loc) · 287 KB
/
skt.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
#line 1 "buf.c"
#include <string.h>
#line 1 "buf.h"
#ifndef SKT_BUF_H
#define SKT_BUF_H
#include <stddef.h>
#include <stdarg.h>
#include <assert.h>
#line 1 "skt.h"
#ifndef SKT_H
#define SKT_H
#include <stddef.h>
/* General notes:
* - Strings provided as input to the transliteration functions and to
* skt_sort_key() must be valid UTF-8 and be normalized to NFC or NFKC,
* otherwise they won't be treated correctly.
* - All functions erase the contents of the buffer they are provided as
* argument.
*/
/******************************************************************************
* Metadata.
*****************************************************************************/
#define SKT_NUM_SCHEMES 5
/* All transliteration schemes, lexicographically sorted, NULL-terminated. */
const char *const skt_schemes[SKT_NUM_SCHEMES + 1];
/* Returns a string describing the set of substitutions performed when a given
* transliteration mapping is used.
*/
const char *skt_map_description(const char *input_scheme,
const char *output_scheme);
/******************************************************************************
* Dynamic buffer.
*****************************************************************************/
struct skt_buf {
char *data; /* Buffer contents, nul-terminated. */
size_t size; /* Buffer size, the terminating nul byte not included. */
size_t alloc;
};
/* Initializer. */
#define SKT_BUF_INIT {.data = ""}
/* Destructor. */
void skt_buf_fini(struct skt_buf *buf);
/******************************************************************************
* Main functions.
*****************************************************************************/
/* Creates a sort key for a IAST-encoded string.
* Equivalent to strxfrm(). If the provided string doesn't contain nul bytes,
* the created key won't, too.
*/
void skt_sort_key(struct skt_buf *buf, const char *str, size_t len);
/* A function that transliterates a string.
* Unknown characters are left unchanged. Sequences of characters known the
* transliteration function are replaced with NFC-normalized sequences, which
* are also valid NFKC sequences.
*/
typedef void (*skt_translit)(struct skt_buf *, const char *str, size_t len);
/* Returns a transliteration function for the provided input and output
* schemes. If the requested mapping is not available, 0 is returned.
*/
skt_translit skt_translit_func(const char *input_scheme,
const char *output_scheme);
#endif
#line 8 "buf.h"
void skt_buf_grow(struct skt_buf *buf, size_t incr);
void skt_buf_set(struct skt_buf *buf, const void *data, size_t size);
static inline void skt_buf_truncate(struct skt_buf *buf, size_t size)
{
assert(size < buf->alloc || size == 0);
if (buf->alloc)
buf->data[buf->size = size] = '\0';
}
#define skt_buf_clear(buf) skt_buf_truncate(buf, 0)
#endif
#line 3 "buf.c"
#line 1 "mem.h"
#ifndef SKT_MEM_H
#define SKT_MEM_H
#include <stddef.h>
#include <assert.h>
#include <stdint.h>
#include <stdlib.h>
#include <stdarg.h>
#include <stdnoreturn.h>
noreturn void skt_fatal(const char *msg, ...);
void *skt_malloc(size_t size)
#ifdef ___GNUC__
__attribute__((malloc))
#endif
;
void *skt_realloc(void *mem, size_t size);
/* For reallocating arrays.
* data: the array proper.
* size: current number of elements.
* alloc: current allocated memory (must be initialized to 0).
* more: number of elements to reserve.
* init: initial number of elements to allocate.
*/
#define SKT_GROW(data, size, alloc, more, init) do { \
size_t need = size + more; \
if (need < size) \
skt_fatal("integer overflow"); \
if (need > alloc) { \
if (alloc) { \
alloc += alloc >> 1; \
if (alloc < need) \
alloc = need; \
if (alloc > SIZE_MAX / sizeof *data) \
skt_fatal("integer overflow"); \
data = skt_realloc(data, alloc * sizeof *data); \
} else { \
alloc = need < init ? init : need; \
if (alloc > SIZE_MAX / sizeof *data) \
skt_fatal("integer overflow"); \
data = skt_malloc(alloc * sizeof *data); \
} \
} \
} while (0)
#endif
#line 4 "buf.c"
#define SKT_BUF_INIT_SIZE 16
void skt_buf_grow(struct skt_buf *buf, size_t size)
{
size_t need = buf->size + size + 1;
if (need <= buf->size)
skt_fatal("integer overflow");
if (need > buf->alloc) {
if (buf->alloc) {
buf->alloc += buf->alloc >> 1;
if (buf->alloc < need)
buf->alloc = need;
buf->data = skt_realloc(buf->data, buf->alloc);
} else {
buf->alloc = need < SKT_BUF_INIT_SIZE ? SKT_BUF_INIT_SIZE : need;
buf->data = skt_malloc(buf->alloc);
}
}
}
void skt_buf_fini(struct skt_buf *buf)
{
if (buf->alloc)
free(buf->data);
}
static void skt_buf_cat(struct skt_buf *buf, const void *data, size_t size)
{
skt_buf_grow(buf, size);
memcpy(&buf->data[buf->size], data, size);
buf->data[buf->size += size] = '\0';
}
void skt_buf_set(struct skt_buf *buf, const void *data, size_t size)
{
skt_buf_clear(buf);
skt_buf_cat(buf, data, size);
}
#line 1 "mem.c"
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
noreturn void skt_fatal(const char *msg, ...)
{
va_list ap;
fputs("skt: ", stderr);
va_start(ap, msg);
vfprintf(stderr, msg, ap);
va_end(ap);
putc('\n', stderr);
abort();
}
#define SKT_OOM() skt_fatal("out of memory")
void *skt_malloc(size_t size)
{
assert(size);
void *mem = malloc(size);
if (!mem)
SKT_OOM();
return mem;
}
void *skt_realloc(void *mem, size_t size)
{
assert(size);
void *new = realloc(mem, size);
if (!new)
SKT_OOM();
return new;
}
#line 1 "skt.c"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <stdint.h>
enum {
IAST,
IASTC,
NAGARI,
SLP1,
VELTHUIS,
NUM_SCHEMES,
};
const char *const skt_schemes[NUM_SCHEMES + 1] = {
[IAST] = "iast",
[IASTC] = "iastc",
[NAGARI] = "nagari",
[SLP1] = "slp1",
[VELTHUIS] = "velthuis",
};
static size_t skt_scheme_value(const char *name)
{
for (size_t i = 0; skt_schemes[i]; i++)
if (!strcmp(skt_schemes[i], name))
return i;
return SIZE_MAX;
}
/* When input_scheme = output_scheme. */
static void skt_translit_identity(struct skt_buf *buf, const char *str,
size_t len)
{
skt_buf_set(buf, str, len);
}
/* Ragel generates useless variables. */
#pragma GCC diagnostic ignored "-Wpragmas"
#pragma GCC diagnostic ignored "-Wunknown-pragmas"
#pragma GCC diagnostic ignored "-Wunused-variable"
#pragma GCC diagnostic ignored "-Wunused-const-variable"
#pragma GCC diagnostic ignored "-Wunused-but-set-variable"
#line 1 "skt_maps.ic"
#line 1 "skt_translit_slp1_iast.ic"
#line 1 "skt_translit_slp1_iast.rl"
#line 538 "skt_translit_slp1_iast.rl"
static void skt_translit_slp1_iast(struct skt_buf *buf,
const char *str, size_t len)
{
int cs, act;
const unsigned char *ts, *te;
const unsigned char *p = (const unsigned char *)str;
const unsigned char *pe = &p[len];
const unsigned char *const eof = pe;
buf->size = 0;
#line 19 "skt_translit_slp1_iast.ic"
static const char _skt_translit_slp1_iast_actions[] = {
0, 1, 0, 1, 1, 1, 2, 1,
3, 1, 4, 1, 5, 1, 6, 1,
7, 1, 8, 1, 9, 1, 10, 1,
11, 1, 12, 1, 13, 1, 14, 1,
15, 1, 16, 1, 17, 1, 18, 1,
19, 1, 20, 1, 21, 1, 22, 1,
23, 1, 24, 1, 25, 1, 26, 1,
27, 1, 28, 1, 29, 1, 30, 1,
31, 1, 32, 1, 33, 1, 34, 1,
35, 1, 36, 1, 37, 1, 38, 1,
39, 1, 40, 1, 41, 1, 42, 1,
43, 1, 44, 1, 45, 1, 46, 1,
47, 1, 48, 1, 49, 1, 50, 1,
51, 1, 52, 1, 53, 1, 54, 1,
55, 1, 56, 1, 57, 1, 58, 1,
59, 1, 60, 1, 61, 1, 62, 1,
63, 1, 64, 1, 65, 1, 66, 1,
67, 1, 68, 1, 69, 1, 70, 1,
71, 1, 72, 1, 73, 1, 74, 1,
75, 1, 76, 1, 77, 1, 78, 1,
79, 1, 80, 1, 81
};
static const char _skt_translit_slp1_iast_key_offsets[] = {
0, 37, 38, 53, 67, 81, 82
};
static const unsigned char _skt_translit_slp1_iast_trans_keys[] = {
46u, 47u, 65u, 66u, 67u, 68u, 69u, 70u,
71u, 72u, 73u, 74u, 75u, 76u, 77u, 78u,
79u, 80u, 81u, 82u, 83u, 84u, 85u, 87u,
88u, 89u, 94u, 96u, 102u, 106u, 107u, 113u,
119u, 120u, 122u, 124u, 126u, 46u, 65u, 69u,
70u, 73u, 76u, 79u, 85u, 88u, 97u, 101u,
102u, 105u, 111u, 117u, 120u, 65u, 69u, 70u,
73u, 79u, 85u, 88u, 97u, 101u, 102u, 105u,
111u, 117u, 120u, 65u, 69u, 70u, 73u, 79u,
85u, 88u, 97u, 101u, 102u, 105u, 111u, 117u,
120u, 89u, 122u, 0
};
static const char _skt_translit_slp1_iast_single_lengths[] = {
37, 1, 15, 14, 14, 1, 1
};
static const char _skt_translit_slp1_iast_range_lengths[] = {
0, 0, 0, 0, 0, 0, 0
};
static const char _skt_translit_slp1_iast_index_offsets[] = {
0, 38, 40, 56, 71, 86, 88
};
static const char _skt_translit_slp1_iast_trans_targs[] = {
1, 2, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 3, 4, 0, 5, 6, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0
};
static const unsigned char _skt_translit_slp1_iast_trans_actions[] = {
0, 0, 37, 39, 41, 43, 45, 47,
49, 51, 53, 55, 57, 59, 61, 63,
65, 67, 69, 71, 73, 75, 77, 79,
81, 83, 0, 0, 141, 0, 0, 147,
149, 151, 153, 155, 157, 159, 5, 161,
7, 9, 11, 13, 15, 17, 19, 21,
23, 25, 27, 29, 31, 33, 35, 163,
85, 87, 89, 91, 93, 95, 97, 99,
101, 103, 105, 107, 109, 111, 163, 113,
115, 117, 119, 121, 123, 125, 127, 129,
131, 133, 135, 137, 139, 163, 143, 163,
145, 163, 161, 163, 163, 163, 163, 163,
0
};
static const unsigned char _skt_translit_slp1_iast_to_state_actions[] = {
1, 0, 0, 0, 0, 0, 0
};
static const unsigned char _skt_translit_slp1_iast_from_state_actions[] = {
3, 0, 0, 0, 0, 0, 0
};
static const char _skt_translit_slp1_iast_eof_trans[] = {
0, 91, 96, 96, 96, 96, 96
};
static const int skt_translit_slp1_iast_start = 0;
static const int skt_translit_slp1_iast_first_final = 0;
static const int skt_translit_slp1_iast_error = -1;
static const int skt_translit_slp1_iast_en_main = 0;
#line 551 "skt_translit_slp1_iast.rl"
#line 127 "skt_translit_slp1_iast.ic"
{
cs = skt_translit_slp1_iast_start;
ts = 0;
te = 0;
act = 0;
}
#line 552 "skt_translit_slp1_iast.rl"
#line 137 "skt_translit_slp1_iast.ic"
{
int _klen;
unsigned int _trans;
const char *_acts;
unsigned int _nacts;
const unsigned char *_keys;
if ( p == pe )
goto _test_eof;
_resume:
_acts = _skt_translit_slp1_iast_actions + _skt_translit_slp1_iast_from_state_actions[cs];
_nacts = (unsigned int) *_acts++;
while ( _nacts-- > 0 ) {
switch ( *_acts++ ) {
case 1:
#line 1 "NONE"
{ts = p;}
break;
#line 156 "skt_translit_slp1_iast.ic"
}
}
_keys = _skt_translit_slp1_iast_trans_keys + _skt_translit_slp1_iast_key_offsets[cs];
_trans = _skt_translit_slp1_iast_index_offsets[cs];
_klen = _skt_translit_slp1_iast_single_lengths[cs];
if ( _klen > 0 ) {
const unsigned char *_lower = _keys;
const unsigned char *_mid;
const unsigned char *_upper = _keys + _klen - 1;
while (1) {
if ( _upper < _lower )
break;
_mid = _lower + ((_upper-_lower) >> 1);
if ( (*p) < *_mid )
_upper = _mid - 1;
else if ( (*p) > *_mid )
_lower = _mid + 1;
else {
_trans += (unsigned int)(_mid - _keys);
goto _match;
}
}
_keys += _klen;
_trans += _klen;
}
_klen = _skt_translit_slp1_iast_range_lengths[cs];
if ( _klen > 0 ) {
const unsigned char *_lower = _keys;
const unsigned char *_mid;
const unsigned char *_upper = _keys + (_klen<<1) - 2;
while (1) {
if ( _upper < _lower )
break;
_mid = _lower + (((_upper-_lower) >> 1) & ~1);
if ( (*p) < _mid[0] )
_upper = _mid - 2;
else if ( (*p) > _mid[1] )
_lower = _mid + 2;
else {
_trans += (unsigned int)((_mid - _keys)>>1);
goto _match;
}
}
_trans += _klen;
}
_match:
_eof_trans:
cs = _skt_translit_slp1_iast_trans_targs[_trans];
if ( _skt_translit_slp1_iast_trans_actions[_trans] == 0 )
goto _again;
_acts = _skt_translit_slp1_iast_actions + _skt_translit_slp1_iast_trans_actions[_trans];
_nacts = (unsigned int) *_acts++;
while ( _nacts-- > 0 )
{
switch ( *_acts++ )
{
case 2:
#line 38 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 124;
buf->data[buf->size++] = 124;
}}
break;
case 3:
#line 404 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 4);
buf->data[buf->size++] = 196;
buf->data[buf->size++] = 129;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 129;
}}
break;
case 4:
#line 438 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 3);
buf->data[buf->size++] = 97;
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 173;
}}
break;
case 5:
#line 84 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 5);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 185;
buf->data[buf->size++] = 157;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 129;
}}
break;
case 6:
#line 218 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 4);
buf->data[buf->size++] = 196;
buf->data[buf->size++] = 171;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 129;
}}
break;
case 7:
#line 254 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 1);
buf->data[buf->size++] = 76;
}}
break;
case 8:
#line 364 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 3);
buf->data[buf->size++] = 97;
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 186;
}}
break;
case 9:
#line 246 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 4);
buf->data[buf->size++] = 197;
buf->data[buf->size++] = 171;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 129;
}}
break;
case 10:
#line 62 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 5);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 184;
buf->data[buf->size++] = 185;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 129;
}}
break;
case 11:
#line 151 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 161;
}}
break;
case 12:
#line 184 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 169;
}}
break;
case 13:
#line 44 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 5);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 185;
buf->data[buf->size++] = 155;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 129;
}}
break;
case 14:
#line 358 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 173;
}}
break;
case 15:
#line 171 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 179;
}}
break;
case 16:
#line 8 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 186;
}}
break;
case 17:
#line 395 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 5);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 184;
buf->data[buf->size++] = 183;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 129;
}}
break;
case 18:
#line 117 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 196;
buf->data[buf->size++] = 129;
}}
break;
case 19:
#line 389 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 98;
buf->data[buf->size++] = 104;
}}
break;
case 20:
#line 279 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 99;
buf->data[buf->size++] = 104;
}}
break;
case 21:
#line 240 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 100;
buf->data[buf->size++] = 104;
}}
break;
case 22:
#line 383 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 97;
buf->data[buf->size++] = 105;
}}
break;
case 23:
#line 419 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 3);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 185;
buf->data[buf->size++] = 157;
}}
break;
case 24:
#line 332 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 103;
buf->data[buf->size++] = 104;
}}
break;
case 25:
#line 177 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 3);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 184;
buf->data[buf->size++] = 165;
}}
break;
case 26:
#line 445 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 196;
buf->data[buf->size++] = 171;
}}
break;
case 27:
#line 352 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 106;
buf->data[buf->size++] = 104;
}}
break;
case 28:
#line 285 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 107;
buf->data[buf->size++] = 104;
}}
break;
case 29:
#line 157 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 3);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 184;
buf->data[buf->size++] = 187;
}}
break;
case 30:
#line 137 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 3);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 185;
buf->data[buf->size++] = 131;
}}
break;
case 31:
#line 412 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 3);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 185;
buf->data[buf->size++] = 133;
}}
break;
case 32:
#line 318 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 97;
buf->data[buf->size++] = 117;
}}
break;
case 33:
#line 432 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 112;
buf->data[buf->size++] = 104;
}}
break;
case 34:
#line 324 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 4);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 184;
buf->data[buf->size++] = 141;
buf->data[buf->size++] = 104;
}}
break;
case 35:
#line 266 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 3);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 185;
buf->data[buf->size++] = 135;
}}
break;
case 36:
#line 298 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 197;
buf->data[buf->size++] = 155;
}}
break;
case 37:
#line 111 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 116;
buf->data[buf->size++] = 104;
}}
break;
case 38:
#line 196 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 197;
buf->data[buf->size++] = 171;
}}
break;
case 39:
#line 129 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 4);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 185;
buf->data[buf->size++] = 173;
buf->data[buf->size++] = 104;
}}
break;
case 40:
#line 71 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 3);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 184;
buf->data[buf->size++] = 185;
}}
break;
case 41:
#line 426 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 177;
}}
break;
case 42:
#line 30 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 4);
buf->data[buf->size++] = 196;
buf->data[buf->size++] = 129;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 128;
}}
break;
case 43:
#line 14 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 3);
buf->data[buf->size++] = 97;
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 172;
}}
break;
case 44:
#line 53 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 5);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 185;
buf->data[buf->size++] = 157;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 128;
}}
break;
case 45:
#line 304 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 4);
buf->data[buf->size++] = 196;
buf->data[buf->size++] = 171;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 128;
}}
break;
case 46:
#line 144 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 3);
buf->data[buf->size++] = 97;
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 185;
}}
break;
case 47:
#line 202 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 4);
buf->data[buf->size++] = 197;
buf->data[buf->size++] = 171;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 128;
}}
break;
case 48:
#line 21 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 5);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 184;
buf->data[buf->size++] = 185;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 128;
}}
break;
case 49:
#line 338 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 160;
}}
break;
case 50:
#line 273 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 168;
}}
break;
case 51:
#line 102 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 5);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 185;
buf->data[buf->size++] = 155;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 128;
}}
break;
case 52:
#line 312 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 172;
}}
break;
case 53:
#line 190 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 178;
}}
break;
case 54:
#line 123 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 2);
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 185;
}}
break;
case 55:
#line 93 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 5);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 184;
buf->data[buf->size++] = 183;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 128;
}}
break;
case 56:
#line 30 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 4);
buf->data[buf->size++] = 196;
buf->data[buf->size++] = 129;
buf->data[buf->size++] = 204;
buf->data[buf->size++] = 128;
}}
break;
case 57:
#line 14 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 3);
buf->data[buf->size++] = 97;
buf->data[buf->size++] = 195;
buf->data[buf->size++] = 172;
}}
break;
case 58:
#line 53 "skt_translit_slp1_iast.rl"
{te = p+1;{
skt_buf_grow(buf, 5);
buf->data[buf->size++] = 225;
buf->data[buf->size++] = 185;
buf->data[buf->size++] = 157;
buf->data[buf->size++] = 204;