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
|
/*
Copyright 1990, 1998 The Open Group
Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation.
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of The Open Group shall
not be used in advertising or otherwise to promote the sale, use or
other dealings in this Software without prior written authorization
from The Open Group.
*/
/* Constructs hash tables for XStringToKeysym and XKeysymToString. */
#include <nx-X11/X.h>
#include <nx-X11/Xos.h>
#include <nx-X11/keysymdef.h>
#include <stdio.h>
#include <stdlib.h>
typedef unsigned long Signature;
#define KTNUM 3000
static struct info {
char *name;
KeySym val;
} info[KTNUM];
#define MIN_REHASH 15
#define MATCHES 10
static char tab[KTNUM];
static unsigned short offsets[KTNUM];
static unsigned short indexes[KTNUM];
static KeySym values[KTNUM];
static char buf[1024];
int
main(int argc, char *argv[])
{
int ksnum = 0;
int max_rehash;
Signature sig;
register int i, j, k, z;
register char *name;
register char c;
int first;
int best_max_rehash;
int best_z = 0;
int num_found;
KeySym val;
char key[128];
char alias[128];
while (fgets(buf, sizeof(buf), stdin)) {
i = sscanf(buf, "#define XK_%127s 0x%lx", key, &info[ksnum].val);
if (i != 2) {
i = sscanf(buf, "#define XK_%127s XK_%127s", key, alias);
if (i != 2)
continue;
for (i = ksnum - 1; i >= 0; i--) {
if (strcmp(info[i].name, alias) == 0) {
info[ksnum].val = info[i].val;
break;
}
}
if (i < 0) { /* Didn't find a match */
fprintf(stderr,
"can't find matching definition %s for keysym %s\n",
alias, key);
continue;
}
}
if (info[ksnum].val == XK_VoidSymbol)
info[ksnum].val = 0;
if (info[ksnum].val > 0x1fffffff) {
fprintf(stderr,
"ignoring illegal keysym (%s), remove it from .h file!\n",
key);
continue;
}
name = strdup(key);
if (!name) {
fprintf(stderr, "makekeys: out of memory!\n");
exit(1);
}
info[ksnum].name = name;
ksnum++;
if (ksnum == KTNUM) {
fprintf(stderr, "makekeys: too many keysyms!\n");
exit(1);
}
}
printf("/* This file is generated from keysymdef.h. */\n");
printf("/* Do not edit. */\n");
printf("\n");
best_max_rehash = ksnum;
num_found = 0;
for (z = ksnum; z < KTNUM; z++) {
max_rehash = 0;
for (name = tab, i = z; --i >= 0;)
*name++ = 0;
for (i = 0; i < ksnum; i++) {
name = info[i].name;
sig = 0;
while ((c = *name++))
sig = (sig << 1) + c;
first = j = sig % z;
for (k = 0; tab[j]; k++) {
j += first + 1;
if (j >= z)
j -= z;
if (j == first)
goto next1;
}
tab[j] = 1;
if (k > max_rehash)
max_rehash = k;
}
if (max_rehash < MIN_REHASH) {
if (max_rehash < best_max_rehash) {
best_max_rehash = max_rehash;
best_z = z;
}
num_found++;
if (num_found >= MATCHES)
break;
}
next1: ;
}
z = best_z;
printf("#ifdef NEEDKTABLE\n");
printf("const unsigned char _XkeyTable[] = {\n");
printf("0,\n");
k = 1;
for (i = 0; i < ksnum; i++) {
name = info[i].name;
sig = 0;
while ((c = *name++))
sig = (sig << 1) + c;
first = j = sig % z;
while (offsets[j]) {
j += first + 1;
if (j >= z)
j -= z;
}
offsets[j] = k;
indexes[i] = k;
val = info[i].val;
printf("0x%.2lx, 0x%.2lx, 0x%.2lx, 0x%.2lx, 0x%.2lx, 0x%.2lx, ",
(sig >> 8) & 0xff, sig & 0xff,
(val >> 24) & 0xff, (val >> 16) & 0xff,
(val >> 8) & 0xff, val & 0xff);
for (name = info[i].name, k += 7; (c = *name++); k++)
printf("'%c',", c);
printf((i == (ksnum-1)) ? "0\n" : "0,\n");
}
printf("};\n");
printf("\n");
printf("#define KTABLESIZE %d\n", z);
printf("#define KMAXHASH %d\n", best_max_rehash + 1);
printf("\n");
printf("static const unsigned short hashString[KTABLESIZE] = {\n");
for (i = 0; i < z;) {
printf("0x%.4x", offsets[i]);
i++;
if (i == z)
break;
printf((i & 7) ? ", " : ",\n");
}
printf("\n");
printf("};\n");
printf("#endif /* NEEDKTABLE */\n");
best_max_rehash = ksnum;
num_found = 0;
for (z = ksnum; z < KTNUM; z++) {
max_rehash = 0;
for (name = tab, i = z; --i >= 0;)
*name++ = 0;
for (i = 0; i < ksnum; i++) {
val = info[i].val;
first = j = val % z;
for (k = 0; tab[j]; k++) {
if (values[j] == val)
goto skip1;
j += first + 1;
if (j >= z)
j -= z;
if (j == first)
goto next2;
}
tab[j] = 1;
values[j] = val;
if (k > max_rehash)
max_rehash = k;
skip1: ;
}
if (max_rehash < MIN_REHASH) {
if (max_rehash < best_max_rehash) {
best_max_rehash = max_rehash;
best_z = z;
}
num_found++;
if (num_found >= MATCHES)
break;
}
next2: ;
}
z = best_z;
for (i = z; --i >= 0;)
offsets[i] = 0;
for (i = 0; i < ksnum; i++) {
val = info[i].val;
first = j = val % z;
while (offsets[j]) {
if (values[j] == val)
goto skip2;
j += first + 1;
if (j >= z)
j -= z;
}
offsets[j] = indexes[i] + 2;
values[j] = val;
skip2: ;
}
printf("\n");
printf("#ifdef NEEDVTABLE\n");
printf("#define VTABLESIZE %d\n", z);
printf("#define VMAXHASH %d\n", best_max_rehash + 1);
printf("\n");
printf("static const unsigned short hashKeysym[VTABLESIZE] = {\n");
for (i = 0; i < z;) {
printf("0x%.4x", offsets[i]);
i++;
if (i == z)
break;
printf((i & 7) ? ", " : ",\n");
}
printf("\n");
printf("};\n");
printf("#endif /* NEEDVTABLE */\n");
exit(0);
}
|
