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
|
/* Copyright (C) 1999-2001 Free Software Foundation, Inc.
This file is part of the GNU LIBICONV Tools.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
/*
* Generates Unicode variants table from Koichi Yasuoka's UniVariants file.
*/
#include <stdio.h>
#include <stdlib.h>
#define ENTRIES 8176 /* number of lines in UniVariants file */
#define MAX_PER_ENTRY 10 /* max number of entries per line in file */
int main (int argc, char *argv[])
{
int variants[MAX_PER_ENTRY*ENTRIES];
int uni2index[0x10000];
int index;
if (argc != 1)
exit(1);
printf("/*\n");
printf(" * Copyright (C) 1999-2001 Free Software Foundation, Inc.\n");
printf(" * This file is part of the GNU LIBICONV Library.\n");
printf(" *\n");
printf(" * The GNU LIBICONV Library is free software; you can redistribute it\n");
printf(" * and/or modify it under the terms of the GNU Library General Public\n");
printf(" * License as published by the Free Software Foundation; either version 2\n");
printf(" * of the License, or (at your option) any later version.\n");
printf(" *\n");
printf(" * The GNU LIBICONV Library is distributed in the hope that it will be\n");
printf(" * useful, but WITHOUT ANY WARRANTY; without even the implied warranty of\n");
printf(" * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n");
printf(" * Library General Public License for more details.\n");
printf(" *\n");
printf(" * You should have received a copy of the GNU Library General Public\n");
printf(" * License along with the GNU LIBICONV Library; see the file COPYING.LIB.\n");
printf(" * If not, write to the Free Software Foundation, Inc., 59 Temple Place -\n");
printf(" * Suite 330, Boston, MA 02111-1307, USA.\n");
printf(" */\n");
printf("\n");
printf("/*\n");
printf(" * CJK variants table\n");
printf(" */\n");
printf("\n");
{
int c;
int j;
for (j = 0; j < 0x10000; j++)
uni2index[j] = -1;
index = 0;
for (;;) {
c = getc(stdin);
if (c == EOF)
break;
if (c == '#') {
do { c = getc(stdin); } while (!(c == EOF || c == '\n'));
continue;
}
ungetc(c,stdin);
if (scanf("%x",&j) != 1)
exit(1);
c = getc(stdin);
if (c != '\t')
exit(1);
uni2index[j] = index;
for (;;) {
int i;
if (scanf("%x",&i) != 1)
exit(1);
if (!(i >= 0x3000 && i < 0x3000+0x8000))
exit(1);
variants[index++] = i-0x3000;
c = getc(stdin);
if (c != ' ')
break;
}
variants[index-1] |= 0x8000; /* end of list marker */
if (c != '\n')
exit(1);
}
}
printf("static const unsigned short cjk_variants[%d] = {",index);
{
int i;
for (i = 0; i < index; i++) {
if ((i % 8) == 0)
printf("\n ");
printf(" 0x%04x,",variants[i]);
}
printf("\n};\n");
}
printf("\n");
printf("static const short cjk_variants_indx[0x5200] = {\n");
{
int j;
for (j = 0x4e00; j < 0xa000; j++) {
if ((j % 0x100) == 0)
printf(" /* 0x%04x */\n", j);
if ((j % 8) == 0)
printf(" ");
printf(" %5d,",uni2index[j]);
if ((j % 8) == 7)
printf("\n");
}
printf("};\n");
}
printf("\n");
return 0;
}
|
