]>
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/local/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 1353
40 #define MIN_WORD_LENGTH 3
41 #define MAX_WORD_LENGTH 3
42 #define MIN_HASH_VALUE 3
43 #define MAX_HASH_VALUE 1791
44 /* maximum key range = 1789, duplicates = 0 */
55 hash(OnigCodePoint codes
[])
57 static const unsigned short asso_values
[] =
59 4, 2, 147, 16, 1, 13, 1228, 725, 1224, 638,
60 1204, 95, 9, 82, 1403, 80, 8, 68, 1391, 6,
61 1203, 602, 1200, 320, 151, 67, 1385, 61, 1384, 158,
62 0, 11, 1252, 3, 733, 278, 23, 425, 660, 424,
63 640, 20, 635, 105, 5, 29, 916, 34, 630, 0,
64 906, 1378, 899, 1377, 470, 1363, 623, 902, 610, 230,
65 1193, 1358, 1190, 779, 986, 1336, 890, 883, 456, 597,
66 285, 158, 590, 477, 583, 42, 576, 1447, 447, 1440,
67 440, 1353, 426, 1429, 400, 1417, 327, 1407, 567, 1389,
68 386, 1207, 458, 724, 854, 979, 1016, 66, 232, 413,
69 204, 1431, 226, 1317, 190, 1167, 379, 1319, 198, 1270,
70 175, 209, 561, 362, 528, 1323, 257, 1099, 240, 1309,
71 508, 1172, 484, 1306, 699, 865, 850, 488, 679, 755,
72 420, 639, 1149, 105, 691, 789, 1125, 46, 809, 652,
73 1293, 3, 1262, 166, 1426, 0, 1424, 1792, 1220, 460,
74 706, 1, 367, 1792, 1341, 1792, 1151, 56, 1235, 1792,
75 384, 345, 965, 40, 1168, 33, 218, 180, 1159, 20,
76 1296, 276, 1243, 14, 1401, 777, 1142, 682, 1284, 129,
77 1135, 610, 1181, 871, 1123, 858, 1042, 510, 842, 499,
78 999, 346, 830, 0, 823, 1288, 1115, 768, 732, 1272,
79 1101, 1098, 1082, 1270, 811, 177, 1078, 1074, 1061, 1058,
80 1050, 789, 353, 1018, 548, 1006, 517, 988, 334, 765,
81 166, 753, 138, 743, 100, 969, 87, 720, 49, 975,
82 75, 965, 62, 411, 126, 955, 113, 1262, 317, 943,
83 304, 679, 293, 1252, 714, 937, 275, 490, 263, 469,
84 395, 1345, 931, 208, 921, 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
[] =
2849 -1, -1, -1, -1, -1, -1,
2850 -1, -1, -1, -1, -1, -1,
2856 -1, -1, -1, -1, -1, -1,
2881 -1, -1, -1, -1, -1, -1,
2888 -1, -1, -1, -1, -1, -1,
2908 -1, -1, -1, -1, -1, -1,
2921 -1, -1, -1, -1, -1, -1,
2925 -1, -1, -1, -1, -1, -1,
2926 -1, -1, -1, -1, -1, -1,
2927 -1, -1, -1, -1, -1, -1,
2937 -1, -1, -1, -1, -1, -1,
2938 -1, -1, -1, -1, -1, -1,
2939 -1, -1, -1, -1, -1, -1,
2940 -1, -1, -1, -1, -1, -1,
2941 -1, -1, -1, -1, -1, -1,
2942 -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,
2955 -1, -1, -1, -1, -1, -1,
2956 -1, -1, -1, -1, -1, -1,
2957 -1, -1, -1, -1, -1, -1,
2958 -1, -1, -1, -1, -1, -1,
2959 -1, -1, -1, -1, -1, -1,
2960 -1, -1, -1, -1, -1, -1,
2961 -1, -1, -1, -1, -1, -1,
2962 -1, -1, -1, -1, -1, -1,
2963 -1, -1, -1, -1, -1, -1,
2964 -1, -1, -1, -1, -1, -1,
2968 -1, -1, -1, -1, -1, -1,
2969 -1, -1, -1, -1, -1, -1,
2970 -1, -1, -1, -1, -1, -1,
2977 -1, -1, -1, -1, -1, -1,
2978 -1, -1, -1, -1, -1, -1,
2988 int key
= hash(codes
);
2990 if (key
<= MAX_HASH_VALUE
)
2992 int index
= wordlist
[key
];
2994 if (index
>= 0 && onig_codes_cmp(codes
, OnigUnicodeFolds1
+ index
, 1) == 0)
projects / mirror_edk2.git / blob