wskbdutil.c revision 1.3 1 1.3 hannken /* $NetBSD: wskbdutil.c,v 1.3 1998/04/20 10:47:36 hannken Exp $ */
2 1.1 hannken
3 1.1 hannken /*-
4 1.1 hannken * Copyright (c) 1997 The NetBSD Foundation, Inc.
5 1.1 hannken * All rights reserved.
6 1.1 hannken *
7 1.1 hannken * This code is derived from software contributed to The NetBSD Foundation
8 1.1 hannken * by Juergen Hannken-Illjes.
9 1.1 hannken *
10 1.1 hannken * Redistribution and use in source and binary forms, with or without
11 1.1 hannken * modification, are permitted provided that the following conditions
12 1.1 hannken * are met:
13 1.1 hannken * 1. Redistributions of source code must retain the above copyright
14 1.1 hannken * notice, this list of conditions and the following disclaimer.
15 1.1 hannken * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 hannken * notice, this list of conditions and the following disclaimer in the
17 1.1 hannken * documentation and/or other materials provided with the distribution.
18 1.1 hannken * 3. All advertising materials mentioning features or use of this software
19 1.1 hannken * must display the following acknowledgement:
20 1.1 hannken * This product includes software developed by the NetBSD
21 1.1 hannken * Foundation, Inc. and its contributors.
22 1.1 hannken * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.1 hannken * contributors may be used to endorse or promote products derived
24 1.1 hannken * from this software without specific prior written permission.
25 1.1 hannken *
26 1.1 hannken * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.1 hannken * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.1 hannken * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.1 hannken * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.1 hannken * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.1 hannken * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.1 hannken * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.1 hannken * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.1 hannken * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.1 hannken * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.1 hannken * POSSIBILITY OF SUCH DAMAGE.
37 1.1 hannken */
38 1.1 hannken
39 1.1 hannken #include <sys/param.h>
40 1.1 hannken #include <sys/types.h>
41 1.1 hannken #include <sys/cdefs.h>
42 1.1 hannken #include <sys/errno.h>
43 1.1 hannken #include <sys/systm.h>
44 1.1 hannken #include <sys/malloc.h>
45 1.1 hannken #include <dev/wscons/wsksymdef.h>
46 1.1 hannken #include <dev/wscons/wsksymvar.h>
47 1.1 hannken
48 1.1 hannken static struct compose_tab_s {
49 1.1 hannken keysym_t elem[2];
50 1.1 hannken keysym_t result;
51 1.1 hannken } compose_tab[] = {
52 1.1 hannken { { KS_plus, KS_plus }, KS_numbersign },
53 1.1 hannken { { KS_a, KS_a }, KS_at },
54 1.1 hannken { { KS_parenleft, KS_parenleft }, KS_bracketleft },
55 1.1 hannken { { KS_slash, KS_slash }, KS_backslash },
56 1.1 hannken { { KS_parenright, KS_parenright }, KS_bracketright },
57 1.1 hannken { { KS_parenleft, KS_minus }, KS_braceleft },
58 1.1 hannken { { KS_slash, KS_minus }, KS_bar },
59 1.1 hannken { { KS_parenright, KS_minus }, KS_braceright },
60 1.1 hannken { { KS_exclam, KS_exclam }, KS_exclamdown },
61 1.1 hannken { { KS_c, KS_slash }, KS_cent },
62 1.1 hannken { { KS_l, KS_minus }, KS_sterling },
63 1.1 hannken { { KS_y, KS_minus }, KS_yen },
64 1.1 hannken { { KS_s, KS_o }, KS_section },
65 1.1 hannken { { KS_x, KS_o }, KS_currency },
66 1.1 hannken { { KS_c, KS_o }, KS_copyright },
67 1.1 hannken { { KS_less, KS_less }, KS_guillemotleft },
68 1.1 hannken { { KS_greater, KS_greater }, KS_guillemotright },
69 1.1 hannken { { KS_question, KS_question }, KS_questiondown },
70 1.1 hannken { { KS_dead_acute, KS_space }, KS_acute },
71 1.1 hannken { { KS_dead_grave, KS_space }, KS_grave },
72 1.1 hannken { { KS_dead_tilde, KS_space }, KS_asciitilde },
73 1.1 hannken { { KS_dead_circumflex, KS_space }, KS_asciicircum },
74 1.1 hannken { { KS_dead_circumflex, KS_A }, KS_Acircumflex },
75 1.1 hannken { { KS_dead_diaeresis, KS_A }, KS_Adiaeresis },
76 1.1 hannken { { KS_dead_grave, KS_A }, KS_Agrave },
77 1.1 hannken { { KS_dead_abovering, KS_A }, KS_Aring },
78 1.1 hannken { { KS_dead_tilde, KS_A }, KS_Atilde },
79 1.1 hannken { { KS_dead_cedilla, KS_C }, KS_Ccedilla },
80 1.1 hannken { { KS_dead_acute, KS_E }, KS_Eacute },
81 1.1 hannken { { KS_dead_circumflex, KS_E }, KS_Ecircumflex },
82 1.1 hannken { { KS_dead_diaeresis, KS_E }, KS_Ediaeresis },
83 1.1 hannken { { KS_dead_grave, KS_E }, KS_Egrave },
84 1.1 hannken { { KS_dead_acute, KS_I }, KS_Iacute },
85 1.1 hannken { { KS_dead_circumflex, KS_I }, KS_Icircumflex },
86 1.1 hannken { { KS_dead_diaeresis, KS_I }, KS_Idiaeresis },
87 1.1 hannken { { KS_dead_grave, KS_I }, KS_Igrave },
88 1.1 hannken { { KS_dead_tilde, KS_N }, KS_Ntilde },
89 1.1 hannken { { KS_dead_acute, KS_O }, KS_Oacute },
90 1.1 hannken { { KS_dead_circumflex, KS_O }, KS_Ocircumflex },
91 1.1 hannken { { KS_dead_diaeresis, KS_O }, KS_Odiaeresis },
92 1.1 hannken { { KS_dead_grave, KS_O }, KS_Ograve },
93 1.1 hannken { { KS_dead_tilde, KS_O }, KS_Otilde },
94 1.1 hannken { { KS_dead_acute, KS_U }, KS_Uacute },
95 1.1 hannken { { KS_dead_circumflex, KS_U }, KS_Ucircumflex },
96 1.1 hannken { { KS_dead_diaeresis, KS_U }, KS_Udiaeresis },
97 1.1 hannken { { KS_dead_grave, KS_U }, KS_Ugrave },
98 1.1 hannken { { KS_dead_acute, KS_Y }, KS_Yacute },
99 1.1 hannken { { KS_dead_acute, KS_a }, KS_aacute },
100 1.1 hannken { { KS_dead_circumflex, KS_a }, KS_acircumflex },
101 1.1 hannken { { KS_dead_diaeresis, KS_a }, KS_adiaeresis },
102 1.1 hannken { { KS_dead_grave, KS_a }, KS_agrave },
103 1.1 hannken { { KS_dead_abovering, KS_a }, KS_aring },
104 1.1 hannken { { KS_dead_tilde, KS_a }, KS_atilde },
105 1.1 hannken { { KS_dead_cedilla, KS_c }, KS_ccedilla },
106 1.1 hannken { { KS_dead_acute, KS_e }, KS_eacute },
107 1.1 hannken { { KS_dead_circumflex, KS_e }, KS_ecircumflex },
108 1.1 hannken { { KS_dead_diaeresis, KS_e }, KS_ediaeresis },
109 1.1 hannken { { KS_dead_grave, KS_e }, KS_egrave },
110 1.1 hannken { { KS_dead_acute, KS_i }, KS_iacute },
111 1.1 hannken { { KS_dead_circumflex, KS_i }, KS_icircumflex },
112 1.1 hannken { { KS_dead_diaeresis, KS_i }, KS_idiaeresis },
113 1.1 hannken { { KS_dead_grave, KS_i }, KS_igrave },
114 1.1 hannken { { KS_dead_tilde, KS_n }, KS_ntilde },
115 1.1 hannken { { KS_dead_acute, KS_o }, KS_oacute },
116 1.1 hannken { { KS_dead_circumflex, KS_o }, KS_ocircumflex },
117 1.1 hannken { { KS_dead_diaeresis, KS_o }, KS_odiaeresis },
118 1.1 hannken { { KS_dead_grave, KS_o }, KS_ograve },
119 1.1 hannken { { KS_dead_tilde, KS_o }, KS_otilde },
120 1.1 hannken { { KS_dead_acute, KS_u }, KS_uacute },
121 1.1 hannken { { KS_dead_circumflex, KS_u }, KS_ucircumflex },
122 1.1 hannken { { KS_dead_diaeresis, KS_u }, KS_udiaeresis },
123 1.1 hannken { { KS_dead_grave, KS_u }, KS_ugrave },
124 1.1 hannken { { KS_dead_acute, KS_y }, KS_yacute },
125 1.1 hannken { { KS_dead_diaeresis, KS_y }, KS_ydiaeresis },
126 1.1 hannken { { KS_quotedbl, KS_A }, KS_Adiaeresis },
127 1.1 hannken { { KS_quotedbl, KS_E }, KS_Ediaeresis },
128 1.1 hannken { { KS_quotedbl, KS_I }, KS_Idiaeresis },
129 1.1 hannken { { KS_quotedbl, KS_O }, KS_Odiaeresis },
130 1.1 hannken { { KS_quotedbl, KS_U }, KS_Udiaeresis },
131 1.1 hannken { { KS_quotedbl, KS_a }, KS_adiaeresis },
132 1.1 hannken { { KS_quotedbl, KS_e }, KS_ediaeresis },
133 1.1 hannken { { KS_quotedbl, KS_i }, KS_idiaeresis },
134 1.1 hannken { { KS_quotedbl, KS_o }, KS_odiaeresis },
135 1.1 hannken { { KS_quotedbl, KS_u }, KS_udiaeresis },
136 1.1 hannken { { KS_quotedbl, KS_y }, KS_ydiaeresis },
137 1.1 hannken { { KS_acute, KS_A }, KS_Aacute },
138 1.1 hannken { { KS_asciicircum, KS_A }, KS_Acircumflex },
139 1.1 hannken { { KS_grave, KS_A }, KS_Agrave },
140 1.1 hannken { { KS_asterisk, KS_A }, KS_Aring },
141 1.1 hannken { { KS_asciitilde, KS_A }, KS_Atilde },
142 1.1 hannken { { KS_cedilla, KS_C }, KS_Ccedilla },
143 1.1 hannken { { KS_acute, KS_E }, KS_Eacute },
144 1.1 hannken { { KS_asciicircum, KS_E }, KS_Ecircumflex },
145 1.1 hannken { { KS_grave, KS_E }, KS_Egrave },
146 1.1 hannken { { KS_acute, KS_I }, KS_Iacute },
147 1.1 hannken { { KS_asciicircum, KS_I }, KS_Icircumflex },
148 1.1 hannken { { KS_grave, KS_I }, KS_Igrave },
149 1.1 hannken { { KS_asciitilde, KS_N }, KS_Ntilde },
150 1.1 hannken { { KS_acute, KS_O }, KS_Oacute },
151 1.1 hannken { { KS_asciicircum, KS_O }, KS_Ocircumflex },
152 1.1 hannken { { KS_grave, KS_O }, KS_Ograve },
153 1.1 hannken { { KS_asciitilde, KS_O }, KS_Otilde },
154 1.1 hannken { { KS_acute, KS_U }, KS_Uacute },
155 1.1 hannken { { KS_asciicircum, KS_U }, KS_Ucircumflex },
156 1.1 hannken { { KS_grave, KS_U }, KS_Ugrave },
157 1.1 hannken { { KS_acute, KS_Y }, KS_Yacute },
158 1.1 hannken { { KS_acute, KS_a }, KS_aacute },
159 1.1 hannken { { KS_asciicircum, KS_a }, KS_acircumflex },
160 1.1 hannken { { KS_grave, KS_a }, KS_agrave },
161 1.1 hannken { { KS_asterisk, KS_a }, KS_aring },
162 1.1 hannken { { KS_asciitilde, KS_a }, KS_atilde },
163 1.1 hannken { { KS_cedilla, KS_c }, KS_ccedilla },
164 1.1 hannken { { KS_acute, KS_e }, KS_eacute },
165 1.1 hannken { { KS_asciicircum, KS_e }, KS_ecircumflex },
166 1.1 hannken { { KS_grave, KS_e }, KS_egrave },
167 1.1 hannken { { KS_acute, KS_i }, KS_iacute },
168 1.1 hannken { { KS_asciicircum, KS_i }, KS_icircumflex },
169 1.1 hannken { { KS_grave, KS_i }, KS_igrave },
170 1.1 hannken { { KS_asciitilde, KS_n }, KS_ntilde },
171 1.1 hannken { { KS_acute, KS_o }, KS_oacute },
172 1.1 hannken { { KS_asciicircum, KS_o }, KS_ocircumflex },
173 1.1 hannken { { KS_grave, KS_o }, KS_ograve },
174 1.1 hannken { { KS_asciitilde, KS_o }, KS_otilde },
175 1.1 hannken { { KS_acute, KS_u }, KS_uacute },
176 1.1 hannken { { KS_asciicircum, KS_u }, KS_ucircumflex },
177 1.1 hannken { { KS_grave, KS_u }, KS_ugrave },
178 1.1 hannken { { KS_acute, KS_y }, KS_yacute }
179 1.1 hannken };
180 1.1 hannken
181 1.1 hannken #define COMPOSE_SIZE sizeof(compose_tab)/sizeof(compose_tab[0])
182 1.1 hannken
183 1.1 hannken static struct string_tab_s {
184 1.1 hannken keysym_t ksym;
185 1.1 hannken char value[WSKBD_STRING_LEN];
186 1.1 hannken } string_tab[] = {
187 1.1 hannken { KS_f1, "\033[OP" },
188 1.1 hannken { KS_f2, "\033[OQ" },
189 1.1 hannken { KS_f3, "\033[OR" },
190 1.1 hannken { KS_f4, "\033[OS" },
191 1.1 hannken { KS_f5, "\033[15~" },
192 1.1 hannken { KS_f6, "\033[17~" },
193 1.1 hannken { KS_f7, "\033[18~" },
194 1.1 hannken { KS_f8, "\033[19~" },
195 1.1 hannken { KS_f9, "\033[20~" },
196 1.1 hannken { KS_f10, "\033[21~" },
197 1.1 hannken { KS_f11, "\033[23~" },
198 1.1 hannken { KS_f12, "\033[24~" },
199 1.1 hannken { KS_f13, "\033[25~" },
200 1.1 hannken { KS_f14, "\033[26~" },
201 1.1 hannken { KS_f15, "\033[28~" },
202 1.1 hannken { KS_f16, "\033[29~" },
203 1.1 hannken { KS_f17, "\033[31~" },
204 1.1 hannken { KS_f18, "\033[32~" },
205 1.1 hannken { KS_f19, "\033[33~" },
206 1.1 hannken { KS_f20, "\033[34~" },
207 1.1 hannken { KS_F1, "\033[OP" },
208 1.1 hannken { KS_F2, "\033[OQ" },
209 1.1 hannken { KS_F3, "\033[OR" },
210 1.1 hannken { KS_F4, "\033[OS" },
211 1.1 hannken { KS_F5, "\033[15~" },
212 1.1 hannken { KS_F6, "\033[17~" },
213 1.1 hannken { KS_F7, "\033[18~" },
214 1.1 hannken { KS_F8, "\033[19~" },
215 1.1 hannken { KS_F9, "\033[20~" },
216 1.1 hannken { KS_F10, "\033[21~" },
217 1.1 hannken { KS_F11, "\033[23~" },
218 1.1 hannken { KS_F12, "\033[24~" },
219 1.1 hannken { KS_F13, "\033[25~" },
220 1.1 hannken { KS_F14, "\033[26~" },
221 1.1 hannken { KS_F15, "\033[28~" },
222 1.1 hannken { KS_F16, "\033[29~" },
223 1.1 hannken { KS_F17, "\033[31~" },
224 1.1 hannken { KS_F18, "\033[32~" },
225 1.1 hannken { KS_F19, "\033[33~" },
226 1.1 hannken { KS_F20, "\033[34~" },
227 1.1 hannken { KS_KP_F1, "\033[OP" },
228 1.1 hannken { KS_KP_F2, "\033[OQ" },
229 1.1 hannken { KS_KP_F3, "\033[OR" },
230 1.1 hannken { KS_KP_F4, "\033[OS" },
231 1.1 hannken { KS_KP_Home, "\033[H" },
232 1.1 hannken { KS_Home, "\033[H" },
233 1.1 hannken { KS_KP_Left, "\033[D" },
234 1.1 hannken { KS_Left, "\033[D" },
235 1.1 hannken { KS_KP_Up, "\033[A" },
236 1.1 hannken { KS_Up, "\033[A" },
237 1.1 hannken { KS_KP_Right, "\033[C" },
238 1.1 hannken { KS_Right, "\033[C" },
239 1.1 hannken { KS_KP_Down, "\033[B" },
240 1.1 hannken { KS_Down, "\033[B" },
241 1.1 hannken { KS_KP_Prior, "\033[I" },
242 1.1 hannken { KS_Prior, "\033[I" },
243 1.1 hannken { KS_KP_Next, "\033[G" },
244 1.1 hannken { KS_Next, "\033[G" },
245 1.1 hannken { KS_KP_End, "\033[F" },
246 1.1 hannken { KS_End, "\033[F" },
247 1.1 hannken { KS_KP_Begin, "\033[H" },
248 1.1 hannken { KS_KP_Insert, "\033[L" },
249 1.1 hannken { KS_Insert, "\033[L" },
250 1.1 hannken { KS_KP_Delete, "\b" }
251 1.1 hannken };
252 1.1 hannken
253 1.1 hannken #define STRING_SIZE sizeof(string_tab)/sizeof(string_tab[0])
254 1.1 hannken
255 1.1 hannken static int compose_tab_inorder = 0;
256 1.1 hannken static int string_tab_inorder = 0;
257 1.1 hannken
258 1.1 hannken static inline int compose_tab_cmp __P((struct compose_tab_s *, struct compose_tab_s *));
259 1.1 hannken static keysym_t ksym_upcase __P((keysym_t));
260 1.2 hannken static void fillmapentry __P((const keysym_t *, int, struct wscons_keymap *));
261 1.1 hannken
262 1.1 hannken static inline int
263 1.1 hannken compose_tab_cmp(i, j)
264 1.1 hannken struct compose_tab_s *i, *j;
265 1.1 hannken {
266 1.1 hannken if (i->elem[0] == j->elem[0])
267 1.1 hannken return(i->elem[1] - j->elem[1]);
268 1.1 hannken else
269 1.1 hannken return(i->elem[0] - j->elem[0]);
270 1.1 hannken }
271 1.1 hannken
272 1.1 hannken keysym_t
273 1.1 hannken wskbd_compose_value(compose_buf)
274 1.1 hannken keysym_t *compose_buf;
275 1.1 hannken {
276 1.1 hannken int i, j, r;
277 1.1 hannken struct compose_tab_s v;
278 1.1 hannken
279 1.1 hannken if (! compose_tab_inorder) {
280 1.1 hannken /* Insertion sort. */
281 1.1 hannken for (i = 1; i < COMPOSE_SIZE; i++) {
282 1.1 hannken v = compose_tab[i];
283 1.1 hannken /* find correct slot, moving others up */
284 1.1 hannken for (j = i; --j >= 0 && compose_tab_cmp(& v, & compose_tab[j]) < 0; )
285 1.1 hannken compose_tab[j + 1] = compose_tab[j];
286 1.1 hannken compose_tab[j + 1] = v;
287 1.1 hannken }
288 1.1 hannken compose_tab_inorder = 1;
289 1.1 hannken }
290 1.1 hannken
291 1.1 hannken for (j = 0, i = COMPOSE_SIZE; i != 0; i /= 2) {
292 1.1 hannken if (compose_tab[j + i/2].elem[0] == compose_buf[0]) {
293 1.1 hannken if (compose_tab[j + i/2].elem[1] == compose_buf[1])
294 1.1 hannken return(compose_tab[j + i/2].result);
295 1.1 hannken r = compose_tab[j + i/2].elem[1] < compose_buf[1];
296 1.1 hannken } else
297 1.1 hannken r = compose_tab[j + i/2].elem[0] < compose_buf[0];
298 1.1 hannken if (r) {
299 1.1 hannken j += i/2 + 1;
300 1.1 hannken i--;
301 1.1 hannken }
302 1.1 hannken }
303 1.1 hannken
304 1.1 hannken return(KS_voidSymbol);
305 1.1 hannken }
306 1.1 hannken
307 1.1 hannken char *
308 1.1 hannken wskbd_get_string(sym)
309 1.1 hannken keysym_t sym;
310 1.1 hannken {
311 1.1 hannken int i, j;
312 1.1 hannken struct string_tab_s v;
313 1.1 hannken
314 1.1 hannken if (! string_tab_inorder) {
315 1.1 hannken /* Insertion sort. */
316 1.1 hannken for (i = 1; i < STRING_SIZE; i++) {
317 1.1 hannken v = string_tab[i];
318 1.1 hannken /* find correct slot, moving others up */
319 1.1 hannken for (j = i; --j >= 0 && v.ksym < string_tab[j].ksym; )
320 1.1 hannken string_tab[j + 1] = string_tab[j];
321 1.1 hannken string_tab[j + 1] = v;
322 1.1 hannken }
323 1.1 hannken string_tab_inorder = 1;
324 1.1 hannken }
325 1.1 hannken
326 1.1 hannken for (j = 0, i = STRING_SIZE; i != 0; i /= 2) {
327 1.1 hannken if (string_tab[j + i/2].ksym == sym)
328 1.1 hannken return(string_tab[j + i/2].value);
329 1.1 hannken else if (string_tab[j + i/2].ksym < sym) {
330 1.1 hannken j += i/2 + 1;
331 1.1 hannken i--;
332 1.1 hannken }
333 1.1 hannken }
334 1.1 hannken
335 1.1 hannken return(NULL);
336 1.1 hannken }
337 1.1 hannken
338 1.1 hannken int
339 1.1 hannken wskbd_set_string(sym, data)
340 1.1 hannken keysym_t sym;
341 1.1 hannken char *data;
342 1.1 hannken {
343 1.1 hannken int i, j;
344 1.1 hannken struct string_tab_s v;
345 1.1 hannken
346 1.1 hannken if (! string_tab_inorder) {
347 1.1 hannken /* Insertion sort. */
348 1.1 hannken for (i = 1; i < STRING_SIZE; i++) {
349 1.1 hannken v = string_tab[i];
350 1.1 hannken /* find correct slot, moving others up */
351 1.1 hannken for (j = i; --j >= 0 && v.ksym < string_tab[j].ksym; )
352 1.1 hannken string_tab[j + 1] = string_tab[j];
353 1.1 hannken string_tab[j + 1] = v;
354 1.1 hannken }
355 1.1 hannken string_tab_inorder = 1;
356 1.1 hannken }
357 1.1 hannken
358 1.1 hannken for (j = 0, i = STRING_SIZE; i != 0; i /= 2) {
359 1.1 hannken if (string_tab[j + i/2].ksym == sym) {
360 1.1 hannken bcopy(data, string_tab[j + i/2].value, WSKBD_STRING_LEN);
361 1.1 hannken return(0);
362 1.1 hannken } else if (string_tab[j + i/2].ksym < sym) {
363 1.1 hannken j += i/2 + 1;
364 1.1 hannken i--;
365 1.1 hannken }
366 1.1 hannken }
367 1.1 hannken
368 1.1 hannken return(EINVAL);
369 1.1 hannken }
370 1.1 hannken
371 1.1 hannken static const u_char latin1_to_upper[256] = {
372 1.1 hannken /* 0 8 1 9 2 a 3 b 4 c 5 d 6 e 7 f */
373 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0 */
374 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0 */
375 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 1 */
376 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 1 */
377 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 2 */
378 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 2 */
379 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 3 */
380 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 3 */
381 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 4 */
382 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 4 */
383 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 5 */
384 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 5 */
385 1.1 hannken 0x00, 'A', 'B', 'C', 'D', 'E', 'F', 'G', /* 6 */
386 1.1 hannken 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', /* 6 */
387 1.1 hannken 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', /* 7 */
388 1.1 hannken 'X', 'Y', 'Z', 0x00, 0x00, 0x00, 0x00, 0x00, /* 7 */
389 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 8 */
390 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 8 */
391 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 9 */
392 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 9 */
393 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* a */
394 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* a */
395 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* b */
396 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* b */
397 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* c */
398 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* c */
399 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* d */
400 1.1 hannken 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* d */
401 1.1 hannken 0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5, 0xc6, 0xc7, /* e */
402 1.1 hannken 0xc8, 0xc9, 0xca, 0xcb, 0xcc, 0xcd, 0xce, 0xcf, /* e */
403 1.1 hannken 0xd0, 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0x00, /* f */
404 1.1 hannken 0xd8, 0xd9, 0xda, 0xdb, 0xdc, 0xdd, 0xde, 0x00, /* f */
405 1.1 hannken };
406 1.1 hannken
407 1.1 hannken static keysym_t
408 1.1 hannken ksym_upcase(ksym)
409 1.1 hannken keysym_t ksym;
410 1.1 hannken {
411 1.1 hannken if (ksym >= KS_f1 && ksym <= KS_f20)
412 1.1 hannken return(KS_F1 - KS_f1 + ksym);
413 1.1 hannken
414 1.3 hannken if (KS_GROUP(ksym) == KS_GROUP_Ascii && ksym <= 0xff &&
415 1.3 hannken latin1_to_upper[ksym] != 0x00)
416 1.3 hannken return(latin1_to_upper[ksym]);
417 1.1 hannken
418 1.1 hannken return(ksym);
419 1.1 hannken }
420 1.1 hannken
421 1.2 hannken static void
422 1.2 hannken fillmapentry(kp, len, mapentry)
423 1.2 hannken const keysym_t *kp;
424 1.2 hannken int len;
425 1.2 hannken struct wscons_keymap *mapentry;
426 1.2 hannken {
427 1.2 hannken switch (len) {
428 1.2 hannken case 0:
429 1.2 hannken mapentry->group1[0] = KS_voidSymbol;
430 1.2 hannken mapentry->group1[1] = KS_voidSymbol;
431 1.2 hannken mapentry->group2[0] = KS_voidSymbol;
432 1.2 hannken mapentry->group2[1] = KS_voidSymbol;
433 1.2 hannken break;
434 1.2 hannken
435 1.2 hannken case 1:
436 1.2 hannken mapentry->group1[0] = kp[0];
437 1.2 hannken mapentry->group1[1] = ksym_upcase(kp[0]);
438 1.2 hannken mapentry->group2[0] = mapentry->group1[0];
439 1.2 hannken mapentry->group2[1] = mapentry->group1[1];
440 1.2 hannken break;
441 1.2 hannken
442 1.2 hannken case 2:
443 1.2 hannken mapentry->group1[0] = kp[0];
444 1.2 hannken mapentry->group1[1] = kp[1];
445 1.2 hannken mapentry->group2[0] = mapentry->group1[0];
446 1.2 hannken mapentry->group2[1] = mapentry->group1[1];
447 1.2 hannken break;
448 1.2 hannken
449 1.2 hannken case 3:
450 1.2 hannken mapentry->group1[0] = kp[0];
451 1.2 hannken mapentry->group1[1] = kp[1];
452 1.2 hannken mapentry->group2[0] = kp[2];
453 1.2 hannken mapentry->group2[1] = ksym_upcase(kp[2]);
454 1.2 hannken break;
455 1.2 hannken
456 1.2 hannken case 4:
457 1.2 hannken mapentry->group1[0] = kp[0];
458 1.2 hannken mapentry->group1[1] = kp[1];
459 1.2 hannken mapentry->group2[0] = kp[2];
460 1.2 hannken mapentry->group2[1] = kp[3];
461 1.2 hannken break;
462 1.2 hannken
463 1.2 hannken }
464 1.2 hannken }
465 1.2 hannken
466 1.2 hannken void
467 1.2 hannken wskbd_get_mapentry(name, kdesc, kdesclen, kc, mapentry)
468 1.2 hannken kbd_t name;
469 1.2 hannken const struct wscons_keydesc *kdesc;
470 1.2 hannken int kdesclen;
471 1.2 hannken int kc;
472 1.2 hannken struct wscons_keymap *mapentry;
473 1.2 hannken {
474 1.2 hannken kbd_t cur;
475 1.2 hannken const keysym_t *kp;
476 1.2 hannken const struct wscons_keydesc *mp;
477 1.2 hannken int i, l;
478 1.2 hannken
479 1.2 hannken mapentry->command = KS_voidSymbol;
480 1.2 hannken mapentry->group1[0] = KS_voidSymbol;
481 1.2 hannken mapentry->group1[1] = KS_voidSymbol;
482 1.2 hannken mapentry->group2[0] = KS_voidSymbol;
483 1.2 hannken mapentry->group2[1] = KS_voidSymbol;
484 1.2 hannken
485 1.2 hannken for (cur = name; cur != 0; ) {
486 1.2 hannken for (i = 0; i < kdesclen; i++)
487 1.2 hannken if (kdesc[i].name == cur)
488 1.2 hannken break;
489 1.2 hannken
490 1.2 hannken /* If map not found, return */
491 1.2 hannken if (i == kdesclen)
492 1.2 hannken return;
493 1.2 hannken
494 1.2 hannken mp = kdesc + i;
495 1.2 hannken for (kp = mp->map; kp < mp->map + mp->map_size; kp++)
496 1.2 hannken if (KS_GROUP(*kp) == KS_GROUP_Keycode &&
497 1.2 hannken KS_VALUE(*kp) == kc) {
498 1.2 hannken /* First skip keycode and possible command */
499 1.2 hannken kp++;
500 1.2 hannken if (KS_GROUP(*kp) == KS_GROUP_Command ||
501 1.2 hannken *kp == KS_Cmd || *kp == KS_Cmd1 || *kp == KS_Cmd2)
502 1.2 hannken mapentry->command = *kp++;
503 1.2 hannken
504 1.2 hannken for (l = 0; kp + l < mp->map + mp->map_size; l++)
505 1.2 hannken if (KS_GROUP(kp[l]) == KS_GROUP_Keycode)
506 1.2 hannken break;
507 1.2 hannken if (l > 4)
508 1.2 hannken panic("wskbd_get_mapentry: %d(%d): bad entry",
509 1.2 hannken mp->name, *kp);
510 1.2 hannken fillmapentry(kp, l, mapentry);
511 1.2 hannken return;
512 1.2 hannken }
513 1.2 hannken
514 1.2 hannken cur = kdesc[i].base;
515 1.2 hannken }
516 1.2 hannken }
517 1.2 hannken
518 1.1 hannken void
519 1.1 hannken wskbd_init_keymap(newlen, map, maplen)
520 1.1 hannken int newlen;
521 1.1 hannken struct wscons_keymap **map;
522 1.1 hannken int *maplen;
523 1.1 hannken {
524 1.1 hannken int i;
525 1.1 hannken
526 1.1 hannken if (newlen != *maplen) {
527 1.1 hannken if (*maplen > 0)
528 1.1 hannken free(*map, M_TEMP);
529 1.1 hannken *maplen = newlen;
530 1.1 hannken *map = malloc(newlen*sizeof(struct wscons_keymap),
531 1.1 hannken M_TEMP, M_WAITOK);
532 1.1 hannken }
533 1.1 hannken
534 1.1 hannken for (i = 0; i < *maplen; i++) {
535 1.1 hannken (*map)[i].command = KS_voidSymbol;
536 1.1 hannken (*map)[i].group1[0] = KS_voidSymbol;
537 1.1 hannken (*map)[i].group1[1] = KS_voidSymbol;
538 1.1 hannken (*map)[i].group2[0] = KS_voidSymbol;
539 1.1 hannken (*map)[i].group2[1] = KS_voidSymbol;
540 1.1 hannken }
541 1.1 hannken }
542 1.1 hannken
543 1.1 hannken int
544 1.1 hannken wskbd_load_keymap(name, kdesc, kdesclen, map, maplen)
545 1.1 hannken kbd_t name;
546 1.1 hannken const struct wscons_keydesc *kdesc;
547 1.1 hannken int kdesclen;
548 1.1 hannken struct wscons_keymap **map;
549 1.1 hannken int *maplen;
550 1.1 hannken {
551 1.1 hannken int i, s, kc, found, stack[10], stack_ptr;
552 1.1 hannken const keysym_t *kp;
553 1.1 hannken const struct wscons_keydesc *mp;
554 1.1 hannken kbd_t cur;
555 1.1 hannken
556 1.1 hannken for (cur = name, stack_ptr = 0; cur != 0; stack_ptr++) {
557 1.1 hannken for (i = found = 0; i < kdesclen; i++)
558 1.1 hannken if (cur == 0 || kdesc[i].name == cur) {
559 1.1 hannken found = 1;
560 1.1 hannken break;
561 1.1 hannken }
562 1.1 hannken
563 1.1 hannken if (stack_ptr == sizeof(stack)/sizeof(stack[0]))
564 1.1 hannken panic("wskbd_load_keymap: %d: recursion too deep", name);
565 1.1 hannken if (! found)
566 1.1 hannken return(EINVAL);
567 1.1 hannken
568 1.1 hannken stack[stack_ptr] = i;
569 1.1 hannken cur = kdesc[i].base;
570 1.1 hannken }
571 1.1 hannken
572 1.1 hannken for (i = 0, s = stack_ptr - 1; s >= 0; s--) {
573 1.1 hannken mp = kdesc + stack[s];
574 1.1 hannken for (kp = mp->map; kp < mp->map + mp->map_size; kp++)
575 1.1 hannken if (KS_GROUP(*kp) == KS_GROUP_Keycode && KS_VALUE(*kp) > i)
576 1.1 hannken i = KS_VALUE(*kp);
577 1.1 hannken }
578 1.1 hannken
579 1.1 hannken wskbd_init_keymap(i + 1, map, maplen);
580 1.1 hannken
581 1.1 hannken for (s = stack_ptr - 1; s >= 0; s--) {
582 1.1 hannken mp = kdesc + stack[s];
583 1.1 hannken for (kp = mp->map; kp < mp->map + mp->map_size; ) {
584 1.1 hannken if (KS_GROUP(*kp) != KS_GROUP_Keycode)
585 1.1 hannken panic("wskbd_load_keymap: %d(%d): bad entry",
586 1.1 hannken mp->name, *kp);
587 1.1 hannken
588 1.1 hannken kc = KS_VALUE(*kp);
589 1.1 hannken kp++;
590 1.1 hannken
591 1.1 hannken if (KS_GROUP(*kp) == KS_GROUP_Command ||
592 1.1 hannken *kp == KS_Cmd || *kp == KS_Cmd1 || *kp == KS_Cmd2) {
593 1.1 hannken (*map)[kc].command = *kp;
594 1.1 hannken kp++;
595 1.1 hannken }
596 1.1 hannken
597 1.1 hannken for (i = 0; kp + i < mp->map + mp->map_size; i++)
598 1.1 hannken if (KS_GROUP(kp[i]) == KS_GROUP_Keycode)
599 1.1 hannken break;
600 1.1 hannken
601 1.1 hannken if (i > 4)
602 1.1 hannken panic("wskbd_load_keymap: %d(%d): bad entry",
603 1.1 hannken mp->name, *kp);
604 1.1 hannken
605 1.2 hannken fillmapentry(kp, i, &(*map)[kc]);
606 1.1 hannken kp += i;
607 1.1 hannken }
608 1.1 hannken }
609 1.1 hannken
610 1.1 hannken return(0);
611 1.1 hannken }
612