wskbdutil.c revision 1.7
1 /* $NetBSD: wskbdutil.c,v 1.7 1999/12/21 11:59:13 drochner Exp $ */ 2 3 /*- 4 * Copyright (c) 1997 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Juergen Hannken-Illjes. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 39 #include <sys/param.h> 40 #include <sys/types.h> 41 #include <sys/cdefs.h> 42 #include <sys/errno.h> 43 #include <sys/systm.h> 44 #include <sys/malloc.h> 45 #include <dev/wscons/wsksymdef.h> 46 #include <dev/wscons/wsksymvar.h> 47 48 static struct compose_tab_s { 49 keysym_t elem[2]; 50 keysym_t result; 51 } compose_tab[] = { 52 { { KS_plus, KS_plus }, KS_numbersign }, 53 { { KS_a, KS_a }, KS_at }, 54 { { KS_parenleft, KS_parenleft }, KS_bracketleft }, 55 { { KS_slash, KS_slash }, KS_backslash }, 56 { { KS_parenright, KS_parenright }, KS_bracketright }, 57 { { KS_parenleft, KS_minus }, KS_braceleft }, 58 { { KS_slash, KS_minus }, KS_bar }, 59 { { KS_parenright, KS_minus }, KS_braceright }, 60 { { KS_exclam, KS_exclam }, KS_exclamdown }, 61 { { KS_c, KS_slash }, KS_cent }, 62 { { KS_l, KS_minus }, KS_sterling }, 63 { { KS_y, KS_minus }, KS_yen }, 64 { { KS_s, KS_o }, KS_section }, 65 { { KS_x, KS_o }, KS_currency }, 66 { { KS_c, KS_o }, KS_copyright }, 67 { { KS_less, KS_less }, KS_guillemotleft }, 68 { { KS_greater, KS_greater }, KS_guillemotright }, 69 { { KS_question, KS_question }, KS_questiondown }, 70 { { KS_dead_acute, KS_space }, KS_acute }, 71 { { KS_dead_grave, KS_space }, KS_grave }, 72 { { KS_dead_tilde, KS_space }, KS_asciitilde }, 73 { { KS_dead_circumflex, KS_space }, KS_asciicircum }, 74 { { KS_dead_circumflex, KS_A }, KS_Acircumflex }, 75 { { KS_dead_diaeresis, KS_A }, KS_Adiaeresis }, 76 { { KS_dead_grave, KS_A }, KS_Agrave }, 77 { { KS_dead_abovering, KS_A }, KS_Aring }, 78 { { KS_dead_tilde, KS_A }, KS_Atilde }, 79 { { KS_dead_cedilla, KS_C }, KS_Ccedilla }, 80 { { KS_dead_acute, KS_E }, KS_Eacute }, 81 { { KS_dead_circumflex, KS_E }, KS_Ecircumflex }, 82 { { KS_dead_diaeresis, KS_E }, KS_Ediaeresis }, 83 { { KS_dead_grave, KS_E }, KS_Egrave }, 84 { { KS_dead_acute, KS_I }, KS_Iacute }, 85 { { KS_dead_circumflex, KS_I }, KS_Icircumflex }, 86 { { KS_dead_diaeresis, KS_I }, KS_Idiaeresis }, 87 { { KS_dead_grave, KS_I }, KS_Igrave }, 88 { { KS_dead_tilde, KS_N }, KS_Ntilde }, 89 { { KS_dead_acute, KS_O }, KS_Oacute }, 90 { { KS_dead_circumflex, KS_O }, KS_Ocircumflex }, 91 { { KS_dead_diaeresis, KS_O }, KS_Odiaeresis }, 92 { { KS_dead_grave, KS_O }, KS_Ograve }, 93 { { KS_dead_tilde, KS_O }, KS_Otilde }, 94 { { KS_dead_acute, KS_U }, KS_Uacute }, 95 { { KS_dead_circumflex, KS_U }, KS_Ucircumflex }, 96 { { KS_dead_diaeresis, KS_U }, KS_Udiaeresis }, 97 { { KS_dead_grave, KS_U }, KS_Ugrave }, 98 { { KS_dead_acute, KS_Y }, KS_Yacute }, 99 { { KS_dead_acute, KS_a }, KS_aacute }, 100 { { KS_dead_circumflex, KS_a }, KS_acircumflex }, 101 { { KS_dead_diaeresis, KS_a }, KS_adiaeresis }, 102 { { KS_dead_grave, KS_a }, KS_agrave }, 103 { { KS_dead_abovering, KS_a }, KS_aring }, 104 { { KS_dead_tilde, KS_a }, KS_atilde }, 105 { { KS_dead_cedilla, KS_c }, KS_ccedilla }, 106 { { KS_dead_acute, KS_e }, KS_eacute }, 107 { { KS_dead_circumflex, KS_e }, KS_ecircumflex }, 108 { { KS_dead_diaeresis, KS_e }, KS_ediaeresis }, 109 { { KS_dead_grave, KS_e }, KS_egrave }, 110 { { KS_dead_acute, KS_i }, KS_iacute }, 111 { { KS_dead_circumflex, KS_i }, KS_icircumflex }, 112 { { KS_dead_diaeresis, KS_i }, KS_idiaeresis }, 113 { { KS_dead_grave, KS_i }, KS_igrave }, 114 { { KS_dead_tilde, KS_n }, KS_ntilde }, 115 { { KS_dead_acute, KS_o }, KS_oacute }, 116 { { KS_dead_circumflex, KS_o }, KS_ocircumflex }, 117 { { KS_dead_diaeresis, KS_o }, KS_odiaeresis }, 118 { { KS_dead_grave, KS_o }, KS_ograve }, 119 { { KS_dead_tilde, KS_o }, KS_otilde }, 120 { { KS_dead_acute, KS_u }, KS_uacute }, 121 { { KS_dead_circumflex, KS_u }, KS_ucircumflex }, 122 { { KS_dead_diaeresis, KS_u }, KS_udiaeresis }, 123 { { KS_dead_grave, KS_u }, KS_ugrave }, 124 { { KS_dead_acute, KS_y }, KS_yacute }, 125 { { KS_dead_diaeresis, KS_y }, KS_ydiaeresis }, 126 { { KS_quotedbl, KS_A }, KS_Adiaeresis }, 127 { { KS_quotedbl, KS_E }, KS_Ediaeresis }, 128 { { KS_quotedbl, KS_I }, KS_Idiaeresis }, 129 { { KS_quotedbl, KS_O }, KS_Odiaeresis }, 130 { { KS_quotedbl, KS_U }, KS_Udiaeresis }, 131 { { KS_quotedbl, KS_a }, KS_adiaeresis }, 132 { { KS_quotedbl, KS_e }, KS_ediaeresis }, 133 { { KS_quotedbl, KS_i }, KS_idiaeresis }, 134 { { KS_quotedbl, KS_o }, KS_odiaeresis }, 135 { { KS_quotedbl, KS_u }, KS_udiaeresis }, 136 { { KS_quotedbl, KS_y }, KS_ydiaeresis }, 137 { { KS_acute, KS_A }, KS_Aacute }, 138 { { KS_asciicircum, KS_A }, KS_Acircumflex }, 139 { { KS_grave, KS_A }, KS_Agrave }, 140 { { KS_asterisk, KS_A }, KS_Aring }, 141 { { KS_asciitilde, KS_A }, KS_Atilde }, 142 { { KS_cedilla, KS_C }, KS_Ccedilla }, 143 { { KS_acute, KS_E }, KS_Eacute }, 144 { { KS_asciicircum, KS_E }, KS_Ecircumflex }, 145 { { KS_grave, KS_E }, KS_Egrave }, 146 { { KS_acute, KS_I }, KS_Iacute }, 147 { { KS_asciicircum, KS_I }, KS_Icircumflex }, 148 { { KS_grave, KS_I }, KS_Igrave }, 149 { { KS_asciitilde, KS_N }, KS_Ntilde }, 150 { { KS_acute, KS_O }, KS_Oacute }, 151 { { KS_asciicircum, KS_O }, KS_Ocircumflex }, 152 { { KS_grave, KS_O }, KS_Ograve }, 153 { { KS_asciitilde, KS_O }, KS_Otilde }, 154 { { KS_acute, KS_U }, KS_Uacute }, 155 { { KS_asciicircum, KS_U }, KS_Ucircumflex }, 156 { { KS_grave, KS_U }, KS_Ugrave }, 157 { { KS_acute, KS_Y }, KS_Yacute }, 158 { { KS_acute, KS_a }, KS_aacute }, 159 { { KS_asciicircum, KS_a }, KS_acircumflex }, 160 { { KS_grave, KS_a }, KS_agrave }, 161 { { KS_asterisk, KS_a }, KS_aring }, 162 { { KS_asciitilde, KS_a }, KS_atilde }, 163 { { KS_cedilla, KS_c }, KS_ccedilla }, 164 { { KS_acute, KS_e }, KS_eacute }, 165 { { KS_asciicircum, KS_e }, KS_ecircumflex }, 166 { { KS_grave, KS_e }, KS_egrave }, 167 { { KS_acute, KS_i }, KS_iacute }, 168 { { KS_asciicircum, KS_i }, KS_icircumflex }, 169 { { KS_grave, KS_i }, KS_igrave }, 170 { { KS_asciitilde, KS_n }, KS_ntilde }, 171 { { KS_acute, KS_o }, KS_oacute }, 172 { { KS_asciicircum, KS_o }, KS_ocircumflex }, 173 { { KS_grave, KS_o }, KS_ograve }, 174 { { KS_asciitilde, KS_o }, KS_otilde }, 175 { { KS_acute, KS_u }, KS_uacute }, 176 { { KS_asciicircum, KS_u }, KS_ucircumflex }, 177 { { KS_grave, KS_u }, KS_ugrave }, 178 { { KS_acute, KS_y }, KS_yacute } 179 }; 180 181 #define COMPOSE_SIZE sizeof(compose_tab)/sizeof(compose_tab[0]) 182 183 static int compose_tab_inorder = 0; 184 185 static inline int compose_tab_cmp __P((struct compose_tab_s *, struct compose_tab_s *)); 186 static keysym_t ksym_upcase __P((keysym_t)); 187 static void fillmapentry __P((const keysym_t *, int, struct wscons_keymap *)); 188 189 static inline int 190 compose_tab_cmp(i, j) 191 struct compose_tab_s *i, *j; 192 { 193 if (i->elem[0] == j->elem[0]) 194 return(i->elem[1] - j->elem[1]); 195 else 196 return(i->elem[0] - j->elem[0]); 197 } 198 199 keysym_t 200 wskbd_compose_value(compose_buf) 201 keysym_t *compose_buf; 202 { 203 int i, j, r; 204 struct compose_tab_s v; 205 206 if (! compose_tab_inorder) { 207 /* Insertion sort. */ 208 for (i = 1; i < COMPOSE_SIZE; i++) { 209 v = compose_tab[i]; 210 /* find correct slot, moving others up */ 211 for (j = i; --j >= 0 && compose_tab_cmp(& v, & compose_tab[j]) < 0; ) 212 compose_tab[j + 1] = compose_tab[j]; 213 compose_tab[j + 1] = v; 214 } 215 compose_tab_inorder = 1; 216 } 217 218 for (j = 0, i = COMPOSE_SIZE; i != 0; i /= 2) { 219 if (compose_tab[j + i/2].elem[0] == compose_buf[0]) { 220 if (compose_tab[j + i/2].elem[1] == compose_buf[1]) 221 return(compose_tab[j + i/2].result); 222 r = compose_tab[j + i/2].elem[1] < compose_buf[1]; 223 } else 224 r = compose_tab[j + i/2].elem[0] < compose_buf[0]; 225 if (r) { 226 j += i/2 + 1; 227 i--; 228 } 229 } 230 231 return(KS_voidSymbol); 232 } 233 234 static const u_char latin1_to_upper[256] = { 235 /* 0 8 1 9 2 a 3 b 4 c 5 d 6 e 7 f */ 236 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0 */ 237 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0 */ 238 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 1 */ 239 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 1 */ 240 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 2 */ 241 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 2 */ 242 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 3 */ 243 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 3 */ 244 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 4 */ 245 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 4 */ 246 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 5 */ 247 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 5 */ 248 0x00, 'A', 'B', 'C', 'D', 'E', 'F', 'G', /* 6 */ 249 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', /* 6 */ 250 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', /* 7 */ 251 'X', 'Y', 'Z', 0x00, 0x00, 0x00, 0x00, 0x00, /* 7 */ 252 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 8 */ 253 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 8 */ 254 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 9 */ 255 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 9 */ 256 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* a */ 257 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* a */ 258 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* b */ 259 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* b */ 260 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* c */ 261 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* c */ 262 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* d */ 263 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* d */ 264 0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5, 0xc6, 0xc7, /* e */ 265 0xc8, 0xc9, 0xca, 0xcb, 0xcc, 0xcd, 0xce, 0xcf, /* e */ 266 0xd0, 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0x00, /* f */ 267 0xd8, 0xd9, 0xda, 0xdb, 0xdc, 0xdd, 0xde, 0x00, /* f */ 268 }; 269 270 static keysym_t 271 ksym_upcase(ksym) 272 keysym_t ksym; 273 { 274 if (ksym >= KS_f1 && ksym <= KS_f20) 275 return(KS_F1 - KS_f1 + ksym); 276 277 if (KS_GROUP(ksym) == KS_GROUP_Ascii && ksym <= 0xff && 278 latin1_to_upper[ksym] != 0x00) 279 return(latin1_to_upper[ksym]); 280 281 return(ksym); 282 } 283 284 static void 285 fillmapentry(kp, len, mapentry) 286 const keysym_t *kp; 287 int len; 288 struct wscons_keymap *mapentry; 289 { 290 switch (len) { 291 case 0: 292 mapentry->group1[0] = KS_voidSymbol; 293 mapentry->group1[1] = KS_voidSymbol; 294 mapentry->group2[0] = KS_voidSymbol; 295 mapentry->group2[1] = KS_voidSymbol; 296 break; 297 298 case 1: 299 mapentry->group1[0] = kp[0]; 300 mapentry->group1[1] = ksym_upcase(kp[0]); 301 mapentry->group2[0] = mapentry->group1[0]; 302 mapentry->group2[1] = mapentry->group1[1]; 303 break; 304 305 case 2: 306 mapentry->group1[0] = kp[0]; 307 mapentry->group1[1] = kp[1]; 308 mapentry->group2[0] = mapentry->group1[0]; 309 mapentry->group2[1] = mapentry->group1[1]; 310 break; 311 312 case 3: 313 mapentry->group1[0] = kp[0]; 314 mapentry->group1[1] = kp[1]; 315 mapentry->group2[0] = kp[2]; 316 mapentry->group2[1] = ksym_upcase(kp[2]); 317 break; 318 319 case 4: 320 mapentry->group1[0] = kp[0]; 321 mapentry->group1[1] = kp[1]; 322 mapentry->group2[0] = kp[2]; 323 mapentry->group2[1] = kp[3]; 324 break; 325 326 } 327 } 328 329 void 330 wskbd_get_mapentry(mapdata, kc, mapentry) 331 const struct wskbd_mapdata *mapdata; 332 int kc; 333 struct wscons_keymap *mapentry; 334 { 335 kbd_t cur; 336 const keysym_t *kp; 337 const struct wscons_keydesc *mp; 338 int l; 339 340 mapentry->command = KS_voidSymbol; 341 mapentry->group1[0] = KS_voidSymbol; 342 mapentry->group1[1] = KS_voidSymbol; 343 mapentry->group2[0] = KS_voidSymbol; 344 mapentry->group2[1] = KS_voidSymbol; 345 346 for (cur = mapdata->layout & ~KB_HANDLEDBYWSKBD; cur != 0; ) { 347 mp = mapdata->keydesc; 348 while (mp->map_size > 0) { 349 if (mp->name == cur) 350 break; 351 mp++; 352 } 353 354 /* If map not found, return */ 355 if (mp->map_size <= 0) 356 return; 357 358 for (kp = mp->map; kp < mp->map + mp->map_size; kp++) 359 if (KS_GROUP(*kp) == KS_GROUP_Keycode && 360 KS_VALUE(*kp) == kc) { 361 /* First skip keycode and possible command */ 362 kp++; 363 if (KS_GROUP(*kp) == KS_GROUP_Command || 364 *kp == KS_Cmd || *kp == KS_Cmd1 || *kp == KS_Cmd2) 365 mapentry->command = *kp++; 366 367 for (l = 0; kp + l < mp->map + mp->map_size; l++) 368 if (KS_GROUP(kp[l]) == KS_GROUP_Keycode) 369 break; 370 if (l > 4) 371 panic("wskbd_get_mapentry: %d(%d): bad entry", 372 mp->name, *kp); 373 fillmapentry(kp, l, mapentry); 374 return; 375 } 376 377 cur = mp->base; 378 } 379 } 380 381 void 382 wskbd_init_keymap(newlen, map, maplen) 383 int newlen; 384 struct wscons_keymap **map; 385 int *maplen; 386 { 387 int i; 388 389 if (newlen != *maplen) { 390 if (*maplen > 0) 391 free(*map, M_TEMP); 392 *maplen = newlen; 393 *map = malloc(newlen*sizeof(struct wscons_keymap), 394 M_TEMP, M_WAITOK); 395 } 396 397 for (i = 0; i < *maplen; i++) { 398 (*map)[i].command = KS_voidSymbol; 399 (*map)[i].group1[0] = KS_voidSymbol; 400 (*map)[i].group1[1] = KS_voidSymbol; 401 (*map)[i].group2[0] = KS_voidSymbol; 402 (*map)[i].group2[1] = KS_voidSymbol; 403 } 404 } 405 406 int 407 wskbd_load_keymap(mapdata, map, maplen) 408 const struct wskbd_mapdata *mapdata; 409 struct wscons_keymap **map; 410 int *maplen; 411 { 412 int i, s, kc, stack_ptr; 413 const keysym_t *kp; 414 const struct wscons_keydesc *mp, *stack[10]; 415 kbd_t cur; 416 417 for (cur = mapdata->layout & ~KB_HANDLEDBYWSKBD, stack_ptr = 0; 418 cur != 0; stack_ptr++) { 419 mp = mapdata->keydesc; 420 while (mp->map_size > 0) { 421 if (cur == 0 || mp->name == cur) { 422 break; 423 } 424 mp++; 425 } 426 427 if (stack_ptr == sizeof(stack)/sizeof(stack[0])) 428 panic("wskbd_load_keymap: %d: recursion too deep", 429 mapdata->layout); 430 if (mp->map_size <= 0) 431 return(EINVAL); 432 433 stack[stack_ptr] = mp; 434 cur = mp->base; 435 } 436 437 for (i = 0, s = stack_ptr - 1; s >= 0; s--) { 438 mp = stack[s]; 439 for (kp = mp->map; kp < mp->map + mp->map_size; kp++) 440 if (KS_GROUP(*kp) == KS_GROUP_Keycode && KS_VALUE(*kp) > i) 441 i = KS_VALUE(*kp); 442 } 443 444 wskbd_init_keymap(i + 1, map, maplen); 445 446 for (s = stack_ptr - 1; s >= 0; s--) { 447 mp = stack[s]; 448 for (kp = mp->map; kp < mp->map + mp->map_size; ) { 449 if (KS_GROUP(*kp) != KS_GROUP_Keycode) 450 panic("wskbd_load_keymap: %d(%d): bad entry", 451 mp->name, *kp); 452 453 kc = KS_VALUE(*kp); 454 kp++; 455 456 if (KS_GROUP(*kp) == KS_GROUP_Command || 457 *kp == KS_Cmd || *kp == KS_Cmd1 || *kp == KS_Cmd2) { 458 (*map)[kc].command = *kp; 459 kp++; 460 } 461 462 for (i = 0; kp + i < mp->map + mp->map_size; i++) 463 if (KS_GROUP(kp[i]) == KS_GROUP_Keycode) 464 break; 465 466 if (i > 4) 467 panic("wskbd_load_keymap: %d(%d): bad entry", 468 mp->name, *kp); 469 470 fillmapentry(kp, i, &(*map)[kc]); 471 kp += i; 472 } 473 } 474 475 return(0); 476 } 477
Indexes created Sat Sep 20 22:09:52 GMT 2025