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
|
#include <stdio.h>
#include <ctype.h>
#include <string.h>
static char used[0x110000];
static int cid_2_unicode[0x10000];
static char *nonuni_names[0x10000];
static int cid_2_rotunicode[0x10000];
#define MULT_MAX 6
static int cid_2_unicodemult[0x100000][MULT_MAX];
#define VERTMARK 0x1000000 /* Well outside all unicode planes */
static int ucs2_score(int val) { /* Supplied by KANOU Hiroki */
if ( val>=0x2e80 && val<=0x2fff )
return( 1 ); /* New CJK Radicals are least important */
else if ( val>=VERTMARK )
return( 2 ); /* Then vertical guys */
else if ( val>=0xf000 && val<=0xffff )
return( 3 );
/* else if (( val>=0x3400 && val<0x3dff ) || (val>=0x4000 && val<=0x4dff))*/
else if ( val>=0x3400 && val<=0x4dff )
return( 4 );
else
return( 5 );
}
static int allstars(char *buffer) {
while ( isdigit(*buffer))
++buffer;
while ( *buffer=='\t' || *buffer=='*' )
++buffer;
if ( *buffer=='\r' ) ++buffer;
if ( *buffer=='\n' ) ++buffer;
return( *buffer=='\0' );
}
static int getnth(char *buffer, int col,int *mults) {
int i,j, val=0, best;
char *end;
int vals[10];
if ( col==1 ) {
/* first column is decimal, others are hex */
if ( !isdigit(*buffer))
return( -1 );
while ( isdigit(*buffer))
val = 10*val + *buffer++-'0';
return( val );
}
for ( i=1; i<col; ++buffer ) {
if ( *buffer=='\t' )
++i;
else if ( *buffer=='\0' )
return( -1 );
}
val = strtol(buffer,&end,16);
if ( end==buffer )
return( -1 );
if ( *end=='v' ) {
val += VERTMARK;
++end;
}
if ( *end==',' ) {
/* Multiple guess... now we've got to pick one */
vals[0] = val;
i = 1;
while ( *end==',' && i<9 ) {
buffer = end+1;
vals[i] = strtol(buffer,&end,16);
if ( *end=='v' ) {
vals[i] += VERTMARK;
++end;
}
++i;
}
vals[i] = 0;
best = 0; val = -1;
for ( i=0; vals[i]!=0; ++i ) {
if ( ucs2_score(vals[i])>best ) {
val = vals[i];
best = ucs2_score(vals[i]);
}
}
if ( mults!=NULL ) for ( i=j=0; vals[i]!=0; ++i ) {
if ( vals[i]!=val && !(vals[i]&VERTMARK))
mults[j++] = vals[i];
}
if ( j>MULT_MAX ) {
fprintf( stderr, "Too many multiple values for %04x, need %d slots\n", val, j );
exit(1);
}
}
return( val );
}
int main(int argc, char **argv) {
char buffer[600];
int cid, uni, max=0, maxcid=0, i,j;
extern char *psunicodenames[];
nonuni_names[0] = ".notdef";
for ( cid=0; cid<0x10000; ++cid ) cid_2_unicode[cid] = -1;
while ( fgets(buffer,sizeof(buffer),stdin)!=NULL ) {
if ( *buffer=='#' /*|| allstars(buffer)*/)
continue;
cid = getnth(buffer,1,NULL);
if ( cid==-1 )
continue;
uni = getnth(buffer,14,cid_2_unicodemult[cid]);
maxcid = cid;
if ( ( (cid>=814 && cid<=907) || cid==7716 ) && uni!=-1 ) {
/* 814-907, 7716 are halfwidth */ /* This seems to have been corrected */
sprintf( buffer,"uni%04X.hw", uni );
nonuni_names[cid] = strdup(buffer);
} else if ( cid>=22226 && cid<=22319 && uni==-1 ) {
/* 22226-22352 are rotated halfwidth latin */
sprintf( buffer,"GB1.%d.vert", cid-22226+814 );
nonuni_names[cid] = strdup(buffer);
} else if ( cid>=22127 && cid<=22221 && uni==-1 ) {
/* 22127-22225 are rotated proportional latin */
sprintf( buffer,"GB1.%d.vert", cid-22127+1 );
nonuni_names[cid] = strdup(buffer);
} else if ( cid>=29059 && cid<=29063 && uni==-1 ) {
/* 29059-29063 rotated 22353-22357 */
sprintf( buffer,"GB1.%d.vert", cid-29059+22353 );
nonuni_names[cid] = strdup(buffer);
} else if ( uni==-1 ) {
continue;
sprintf( buffer,"GB1.%d", cid );
nonuni_names[cid] = strdup(buffer);
} else if ( uni>VERTMARK ) {
/* rotated */
cid_2_rotunicode[cid] = uni-VERTMARK;
} else if ( !used[uni] ) {
used[uni] = 1;
cid_2_unicode[cid] = uni;
} else {
sprintf( buffer, "uni%04X.dup%d", uni, ++used[uni] );
nonuni_names[cid] = strdup(buffer);
}
max = cid;
}
for ( i=0; i<maxcid; ++i ) if ( cid_2_rotunicode[i]!=0 ) {
for ( j=0; j<maxcid; ++j )
if ( cid_2_unicode[j] == cid_2_rotunicode[i] )
break;
if ( j==maxcid )
sprintf( buffer, "uni%04X.vert", cid_2_rotunicode[i]);
else
sprintf( buffer, "GB1.%d.vert", j);
nonuni_names[i] = strdup(buffer);
}
printf("%d %d\n",maxcid, max );
for ( cid=0; cid<=max; ++cid ) {
if ( cid_2_unicode[cid]!=-1 && cid_2_unicodemult[cid][0]==0 ) {
for ( i=1; cid+i<=max && cid_2_unicode[cid+i]==cid_2_unicode[cid]+i && cid_2_unicodemult[cid+i][0]==0; ++i );
--i;
if ( i!=0 ) {
printf( "%d..%d %04x\n", cid, cid+i, cid_2_unicode[cid] );
cid += i;
} else
printf( "%d %04x\n", cid, cid_2_unicode[cid] );
} else if ( cid_2_unicode[cid]!=-1 ) {
printf( "%d %04x", cid, cid_2_unicode[cid]);
for ( i=0; cid_2_unicodemult[cid][i]!=0; ++i )
printf( ",%04x", cid_2_unicodemult[cid][i]);
printf( "\n");
} else if ( nonuni_names[cid]!=NULL )
printf( "%d /%s\n", cid, nonuni_names[cid] );
}
return( 0 );
}
|
