]>
git.proxmox.com Git - mirror_edk2.git/blob - MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/unicode_fold1_key.c
1 /* This file was converted by gperf_fold_key_conv.py
2 from gperf output file. */
3 /* ANSI-C code produced by gperf version 3.1 */
4 /* Command-line: /usr/bin/gperf -n -C -T -c -t -j1 -L ANSI-C -F,-1 -N onigenc_unicode_fold1_key unicode_fold1_key.gperf */
5 /* Computed positions: -k'1-3' */
9 /* This gperf source file was generated by make_unicode_fold_data.py */
12 * Copyright (c) 2017-2018 K.Kosako <sndgk393 AT ybb DOT ne DOT jp>
13 * All rights reserved.
15 * Redistribution and use in source and binary forms, with or without
16 * modification, are permitted provided that the following conditions
18 * 1. Redistributions of source code must retain the above copyright
19 * notice, this list of conditions and the following disclaimer.
20 * 2. Redistributions in binary form must reproduce the above copyright
21 * notice, this list of conditions and the following disclaimer in the
22 * documentation and/or other materials provided with the distribution.
24 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 #define TOTAL_KEYWORDS 1346
40 #define MIN_WORD_LENGTH 3
41 #define MAX_WORD_LENGTH 3
42 #define MIN_HASH_VALUE 3
43 #define MAX_HASH_VALUE 1765
44 /* maximum key range = 1763, duplicates = 0 */
55 hash(OnigCodePoint codes
[])
57 static const unsigned short asso_values
[] =
59 4, 2, 147, 16, 1, 13, 1233, 682, 1225, 643,
60 1208, 95, 9, 89, 1391, 82, 8, 80, 1383, 6,
61 1201, 638, 1191, 602, 151, 75, 1377, 68, 1374, 464,
62 0, 11, 1369, 3, 1352, 278, 23, 424, 660, 320,
63 640, 20, 635, 34, 5, 29, 860, 27, 630, 0,
64 854, 1352, 870, 1336, 470, 1322, 623, 1319, 610, 230,
65 1184, 1309, 1159, 779, 1042, 980, 836, 844, 456, 597,
66 285, 158, 590, 477, 583, 42, 576, 1442, 447, 1119,
67 440, 922, 426, 1434, 400, 1433, 327, 1428, 567, 1417,
68 386, 1443, 458, 856, 704, 1435, 1010, 66, 232, 413,
69 204, 1417, 226, 1412, 190, 1095, 379, 1253, 198, 1211,
70 175, 209, 561, 362, 528, 1296, 257, 1169, 240, 1291,
71 508, 1163, 484, 1228, 699, 735, 831, 488, 679, 513,
72 420, 639, 1148, 83, 683, 806, 1152, 77, 1170, 537,
73 1213, 3, 1285, 166, 1410, 1766, 1394, 1766, 1206, 460,
74 757, 1766, 367, 1766, 1339, 1766, 908, 57, 1321, 1766,
75 384, 345, 686, 52, 1145, 40, 218, 180, 1135, 33,
76 1292, 276, 1282, 14, 1408, 719, 1128, 701, 1275, 129,
77 1116, 610, 1255, 1343, 1109, 874, 1097, 448, 823, 346,
78 877, 181, 1089, 0, 1077, 786, 1080, 768, 1068, 1180,
79 1060, 1056, 1048, 798, 811, 177, 1045, 1022, 1030, 993,
80 1020, 789, 353, 990, 548, 982, 517, 970, 334, 765,
81 166, 753, 138, 743, 100, 963, 87, 720, 49, 957,
82 75, 951, 62, 411, 126, 945, 113, 1266, 317, 935,
83 304, 925, 293, 1244, 714, 912, 275, 490, 263, 469,
84 395, 1297, 896, 208, 887, 80, 542, 11, 246
86 return asso_values
[(unsigned char)onig_codes_byte_at(codes
, 2)+3] + asso_values
[(unsigned char)onig_codes_byte_at(codes
, 1)] + asso_values
[(unsigned char)onig_codes_byte_at(codes
, 0)];
90 onigenc_unicode_fold1_key(OnigCodePoint codes
[])
92 static const short int wordlist
[] =
2841 -1, -1, -1, -1, -1, -1,
2854 -1, -1, -1, -1, -1, -1,
2855 -1, -1, -1, -1, -1, -1,
2856 -1, -1, -1, -1, -1, -1,
2857 -1, -1, -1, -1, -1, -1,
2895 -1, -1, -1, -1, -1, -1,
2901 -1, -1, -1, -1, -1, -1,
2902 -1, -1, -1, -1, -1, -1,
2906 -1, -1, -1, -1, -1, -1,
2912 -1, -1, -1, -1, -1, -1,
2931 -1, -1, -1, -1, -1, -1,
2932 -1, -1, -1, -1, -1, -1,
2933 -1, -1, -1, -1, -1, -1,
2936 -1, -1, -1, -1, -1, -1,
2937 -1, -1, -1, -1, -1, -1,
2941 -1, -1, -1, -1, -1, -1,
2942 -1, -1, -1, -1, -1, -1,
2943 -1, -1, -1, -1, -1, -1,
2944 -1, -1, -1, -1, -1, -1,
2945 -1, -1, -1, -1, -1, -1,
2946 -1, -1, -1, -1, -1, -1,
2947 -1, -1, -1, -1, -1, -1,
2948 -1, -1, -1, -1, -1, -1,
2949 -1, -1, -1, -1, -1, -1,
2950 -1, -1, -1, -1, -1, -1,
2951 -1, -1, -1, -1, -1, -1,
2952 -1, -1, -1, -1, -1, -1,
2953 -1, -1, -1, -1, -1, -1,
2954 -1, -1, -1, -1, -1, -1,
2958 -1, -1, -1, -1, -1, -1,
2965 -1, -1, -1, -1, -1, -1,
2966 -1, -1, -1, -1, -1, -1,
2970 -1, -1, -1, -1, -1, -1,
2971 -1, -1, -1, -1, -1, -1,
2979 int key
= hash(codes
);
2981 if (key
<= MAX_HASH_VALUE
)
2983 int index
= wordlist
[key
];
2985 if (index
>= 0 && onig_codes_cmp(codes
, OnigUnicodeFolds1
+ index
, 1) == 0)
projects / mirror_edk2.git / blob