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 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703
|
/* Keymap routines for SLang. The role of these keymap routines is simple:
* Just read keys from the tty and return a pointer to a keymap structure.
* That is, a keymap is simple a mapping of strings (keys from tty) to
* structures. Also included are routines for managing the keymaps.
*/
/*
Copyright (C) 2004-2016 John E. Davis
This file is part of the S-Lang Library.
The S-Lang Library 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 of the
License, or (at your option) any later version.
The S-Lang Library 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 library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
USA.
*/
#include "slinclud.h"
#include "slang.h"
#include "_slang.h"
/* FIXME: I need to add a copy-method so that copy-keymap will work with
* any object bound to the keysequence.
*/
/* We need a define a rule for upper and lower case chars that user cannot
change! This could be a problem for international chars! */
#define UPPER_CASE_KEY(x) (((x) >= 'a') && ((x) <= 'z') ? (x) - 32 : (x))
#define LOWER_CASE_KEY(x) (((x) >= 'A') && ((x) <= 'Z') ? (x) + 32 : (x))
int SLang_Key_TimeOut_Flag = 0; /* true if more than 1 sec has elapsed
without key in multikey sequence */
int SLang_Last_Key_Char = 0;
SLkeymap_Type *SLKeyMap_List_Root = NULL;
typedef struct _Key_Methods_Type
{
int type;
void (*free_method) (int, VOID_STAR);
}
Key_Methods_Type;
static unsigned int Num_Key_Methods;
static void free_interpret_key (int type, VOID_STAR addr)
{
(void) type;
SLang_free_slstring (*(char **) addr);
}
#define SLKEYMAP_MAX_TYPES 16
static Key_Methods_Type Key_Methods_Table[SLKEYMAP_MAX_TYPES] =
{
{SLKEY_F_INTERPRET, free_interpret_key}
};
static Key_Methods_Type *find_key_methods (int type)
{
Key_Methods_Type *k, *kmax;
k = Key_Methods_Table;
kmax = k + Num_Key_Methods;
while (k < kmax)
{
if (k->type == type)
return k;
k++;
}
return NULL;
}
static Key_Methods_Type *alloc_key_methods (int type)
{
Key_Methods_Type *k;
if (Num_Key_Methods >= SLKEYMAP_MAX_TYPES)
{
_pSLang_verror (SL_LimitExceeded_Error, "Maximum number of keymap types exceeded");
return NULL;
}
k = Key_Methods_Table + Num_Key_Methods;
k->type = type;
Num_Key_Methods++;
return k;
}
int SLkm_set_free_method (int type, void (*f)(int, VOID_STAR))
{
Key_Methods_Type *k;
if ((NULL == (k = find_key_methods (type)))
&& (NULL == (k = alloc_key_methods (type))))
return -1;
k->free_method = f;
return 0;
}
/* This frees the function associated with the key, but does not does not
* do anything with the keysequence (str) field.
*/
static void free_key_function (SLang_Key_Type *key)
{
Key_Methods_Type *k;
k = find_key_methods (key->type);
if ((k != NULL) && (k->free_method != NULL))
(*k->free_method) (key->type, &key->f);
key->f.f = NULL;
key->type = 0;
/* *key->str = 0; Let caller do this */
}
static SLang_Key_Type *malloc_key(unsigned char *str)
{
SLang_Key_Type *neew;
if (NULL == (neew = (SLang_Key_Type *) SLmalloc(sizeof(SLang_Key_Type))))
return NULL;
SLMEMSET ((char *) neew, 0, sizeof (SLang_Key_Type));
SLMEMCPY((char *) neew->str, (char *) str, (unsigned int) *str);
return(neew);
}
static SLkeymap_Type *add_keymap (SLFUTURE_CONST char *name, SLang_Key_Type *map)
{
SLkeymap_Type *km;
if (NULL == (km = (SLkeymap_Type *)SLcalloc (1, sizeof(SLkeymap_Type))))
return NULL;
if (NULL == (km->name = SLang_create_slstring (name)))
{
SLfree ((char *)km);
return NULL;
}
km->keymap = map;
km->next = SLKeyMap_List_Root;
SLKeyMap_List_Root = km;
return km;
}
FVOID_STAR SLang_find_key_function (SLFUTURE_CONST char *name, SLkeymap_Type *keymap)
{
SLKeymap_Function_Type *fp = keymap -> functions;
char ch = *name;
while ((fp != NULL) && (fp->name != NULL))
{
if ((ch == *fp->name)
&& (0 == strcmp(fp->name, name)))
return (FVOID_STAR) fp->f;
fp++;
}
return NULL;
}
#ifdef REAL_UNIX_SYSTEM
/* Expand termcap string specified by s. s as passed will have the format:
* "XY)..." where XY represents a termcap keyname.
*/
static SLFUTURE_CONST char *process_termcap_string (SLFUTURE_CONST char *s, char *str, int *ip, int imax)
{
char c[3], *val;
int i;
if ((0 == (c[0] = s[0]))
|| (0 == (c[1] = s[1]))
|| (s[2] != ')'))
{
_pSLang_verror (SL_SYNTAX_ERROR, "setkey: ^(%s is badly formed", s);
return NULL;
}
s += 3;
c[2] = 0;
if ((NULL == (val = SLtt_tgetstr (c)))
|| (*val == 0))
return NULL;
i = *ip;
while ((i < imax) && (*val != 0))
{
str[i++] = *val++;
}
*ip = i;
return s;
}
#endif
/* convert things like "^A" to 1 etc... The 0th char is the strlen INCLUDING
* the length character itself.
*/
char *SLang_process_keystring(SLFUTURE_CONST char *s)
{
/* FIXME: v2.0, make this thread safe */
static char str[32];
int i;
i = 1;
while (*s != 0)
{
unsigned char ch = (unsigned char) *s++;
if (ch == '^')
{
ch = *s++;
if (ch == 0)
{
if (i < 32)
str[i++] = '^';
break;
}
#ifdef REAL_UNIX_SYSTEM
if (ch == '(')
{
s = process_termcap_string (s, str, &i, 32);
if (s == NULL)
{
str[0] = 1;
return str;
}
continue;
}
#endif
ch = UPPER_CASE_KEY(ch);
if (ch == '?') ch = 127; else ch = ch - 'A' + 1;
}
if (i >= 32) break;
str[i++] = ch;
}
if (i > SLANG_MAX_KEYMAP_KEY_SEQ)
{
_pSLang_verror (SL_INVALID_PARM, "Key sequence is too long");
return NULL;
}
str[0] = i;
return(str);
}
static int key_string_compare (unsigned char *a, unsigned char *b, unsigned int len)
{
unsigned char *amax = a + len;
int cha_up, chb_up;
while (a < amax)
{
int cha, chb;
cha = *a++;
chb = *b++;
if (cha == chb) continue;
cha_up = UPPER_CASE_KEY(cha);
chb_up = UPPER_CASE_KEY(chb);
if (cha_up == chb_up)
{
/* Use case-sensitive result. */
return cha - chb;
}
/* Use case-insensitive result. */
return cha_up - chb_up;
}
return 0;
}
#define KEY_DEFINITION_ERROR_MSG "Inconsistent key-definition"
/* This function also performs an insertion in an ordered way. */
static int find_the_key (SLFUTURE_CONST char *s, SLkeymap_Type *kml, SLang_Key_Type **keyp)
{
unsigned char ch;
unsigned int str_len;
SLang_Key_Type *key, *last, *neew;
unsigned char *str;
*keyp = NULL;
if (NULL == (str = (unsigned char *) SLang_process_keystring(s)))
return -2;
if (1 == (str_len = str[0]))
return 0;
ch = str[1];
key = kml->keymap + ch;
if (str_len == 2)
{
if (key->next != NULL)
{
_pSLang_verror (SL_INVALID_PARM, KEY_DEFINITION_ERROR_MSG);
return -2;
}
free_key_function (key);
key->str[0] = str_len;
key->str[1] = ch;
*keyp = key;
return 0;
}
/* insert the key definition */
while (1)
{
int cmp;
unsigned int key_len, len;
last = key;
key = key->next;
if ((key != NULL) && (key->str != NULL))
{
len = key_len = key->str[0];
if (len > str_len) len = str_len;
cmp = key_string_compare (str + 1, key->str + 1, len - 1);
if (cmp > 0)
continue;
if (cmp == 0)
{
if (key_len != str_len)
{
_pSLang_verror (SL_INVALID_PARM, KEY_DEFINITION_ERROR_MSG);
return -2;
}
free_key_function (key);
*keyp = key;
return 0;
}
/* Drop to cmp < 0 case */
}
if (NULL == (neew = malloc_key(str))) return -1;
neew -> next = key;
last -> next = neew;
*keyp = neew;
return 0;
}
}
/* returns -2 if inconsistent, -1 if malloc error, 0 upon success */
int SLkm_define_key (SLFUTURE_CONST char *s, FVOID_STAR f, SLkeymap_Type *kml)
{
SLang_Key_Type *key;
unsigned int type = SLKEY_F_INTRINSIC;
int ret;
ret = find_the_key (s, kml, &key);
if ((ret != 0) || (key == NULL))
return ret;
key->type = type;
key->f.f = f;
return 0;
}
int SLang_define_key (SLFUTURE_CONST char *s, SLFUTURE_CONST char *funct, SLkeymap_Type *kml)
{
SLang_Key_Type *key;
FVOID_STAR f;
int ret;
ret = find_the_key (s, kml, &key);
if ((ret != 0) || (key == NULL))
return ret;
f = SLang_find_key_function(funct, kml);
if (f == NULL) /* assume interpreted */
{
char *str = SLang_create_slstring (funct);
if (str == NULL) return -1;
key->type = SLKEY_F_INTERPRET;
key->f.s = str;
}
else
{
key->type = SLKEY_F_INTRINSIC;
key->f.f = f;
}
return 0;
}
int SLkm_define_keysym (SLFUTURE_CONST char *s, unsigned int keysym, SLkeymap_Type *kml)
{
SLang_Key_Type *key;
int ret;
ret = find_the_key (s, kml, &key);
if ((ret != 0) || (key == NULL))
return ret;
key->type = SLKEY_F_KEYSYM;
key->f.keysym = keysym;
return 0;
}
int SLkm_define_slkey (SLFUTURE_CONST char *s, SLang_Name_Type *nt, SLkeymap_Type *kml)
{
SLang_Key_Type *key;
int ret;
ret = find_the_key (s, kml, &key);
if ((ret != 0) || (key == NULL))
return ret;
key->type = SLKEY_F_SLANG;
key->f.slang_fun = nt;
return 0;
}
SLang_Key_Type *SLang_do_key(SLkeymap_Type *kml, int (*getkey)(void))
{
register SLang_Key_Type *key, *next, *kmax;
unsigned int len;
unsigned char input_ch;
register unsigned char chup;
unsigned char key_ch = 0;
SLang_Last_Key_Char = (*getkey)();
SLang_Key_TimeOut_Flag = 0;
if (SLANG_GETKEY_ERROR == (unsigned int) SLang_Last_Key_Char)
return NULL;
input_ch = (unsigned char) SLang_Last_Key_Char;
key = (SLang_Key_Type *) &((kml->keymap)[input_ch]);
/* if the next one is null, then we know this MAY be it. */
while (key->next == NULL)
{
if (key->type != 0)
return key;
/* Try its opposite case counterpart */
if (input_ch == LOWER_CASE_KEY(input_ch))
input_ch = UPPER_CASE_KEY(input_ch);
key = kml->keymap + input_ch;
if (key->type == 0)
return NULL;
}
/* It appears to be a prefix character in a key sequence. */
len = 1; /* already read one character */
key = key->next; /* Now we are in the key list */
kmax = NULL; /* set to end of list */
while (1)
{
SLang_Key_TimeOut_Flag = 1;
SLang_Last_Key_Char = (*getkey)();
SLang_Key_TimeOut_Flag = 0;
len++;
if ((SLANG_GETKEY_ERROR == (unsigned int) SLang_Last_Key_Char)
|| SLKeyBoard_Quit)
break;
input_ch = (unsigned char) SLang_Last_Key_Char;
chup = UPPER_CASE_KEY(input_ch);
while (key != kmax)
{
if (key->str[0] > len)
{
key_ch = key->str[len];
if (chup == UPPER_CASE_KEY(key_ch))
break;
}
key = key->next;
}
if (key == kmax) break;
/* If the input character is lowercase, check to see if there is
* a lowercase match. If so, set key to it. Note: the
* algorithm assumes the sorting performed by key_string_compare.
*/
if (input_ch != key_ch)
{
next = key->next;
while (next != kmax)
{
if (next->str[0] > len)
{
unsigned char next_ch = next->str[len];
if (next_ch == input_ch)
{
key = next;
break;
}
if (next_ch != chup)
break;
}
next = next->next;
}
}
/* Ok, we found the first position of a possible match. If it
* is exact, we are done.
*/
if ((unsigned int) key->str[0] == len + 1)
return key;
/* Apparantly, there are some ambiguities. Read next key to resolve
* the ambiguity. Adjust kmax to encompass ambiguities.
*/
next = key->next;
while (next != kmax)
{
if ((unsigned int) next->str[0] > len)
{
key_ch = next->str[len];
if (chup != UPPER_CASE_KEY(key_ch))
break;
}
next = next->next;
}
kmax = next;
}
return NULL;
}
void SLang_undefine_key(SLFUTURE_CONST char *s, SLkeymap_Type *kml)
{
int n, i;
SLang_Key_Type *key, *next, *last, *key_root, *keymap;
unsigned char *str;
keymap = kml -> keymap;
if (NULL == (str = (unsigned char *) SLang_process_keystring(s)))
return;
if (0 == (n = *str++ - 1)) return;
i = *str;
last = key_root = (SLang_Key_Type *) &(keymap[i]);
key = key_root->next;
while (key != NULL)
{
next = key->next;
if (0 == SLMEMCMP ((char *)(key->str + 1), (char *) str, n))
{
free_key_function (key);
SLfree((char *) key);
last->next = next;
}
else last = key;
key = next;
}
if (n == 1)
{
free_key_function (key_root);
key_root->str[0] = 0;
}
}
char *SLang_make_keystring(unsigned char *s)
{
static char buf [3 * SLANG_MAX_KEYMAP_KEY_SEQ + 1];
char *b;
int n;
n = *s++ - 1;
if (n > SLANG_MAX_KEYMAP_KEY_SEQ)
{
_pSLang_verror (SL_BUILTIN_LIMIT_EXCEEDED, "Key sequence is too long");
return NULL;
}
b = buf;
while (n--)
{
if (*s < 32)
{
*b++ = '^';
*b++ = *s + 'A' - 1;
}
else *b++ = *s;
s++;
}
*b = 0;
return(buf);
}
static SLang_Key_Type *copy_keymap(SLkeymap_Type *kml)
{
int i;
SLang_Key_Type *neew, *old, *new_root, *km;
if (NULL == (new_root = (SLang_Key_Type *) SLcalloc(256, sizeof(SLang_Key_Type))))
return NULL;
if (kml == NULL) return new_root;
km = kml->keymap;
for (i = 0; i < 256; i++)
{
old = &(km[i]);
neew = &(new_root[i]);
/* FIXME: A copy-method needs to be defined here and below */
if (old->type == SLKEY_F_INTERPRET)
neew->f.s = SLang_create_slstring (old->f.s);
else
neew->f.f = old->f.f;
neew->type = old->type;
SLMEMCPY((char *) neew->str, (char *) old->str, (unsigned int) *old->str);
old = old->next;
while (old != NULL)
{
neew->next = malloc_key((unsigned char *) old->str);
neew = neew->next;
if (old->type == SLKEY_F_INTERPRET)
neew->f.s = SLang_create_slstring (old->f.s);
else
neew->f.f = old->f.f;
neew->type = old->type;
old = old->next;
}
neew->next = NULL;
}
return(new_root);
}
SLkeymap_Type *SLang_create_keymap(SLFUTURE_CONST char *name, SLkeymap_Type *map)
{
SLang_Key_Type *neew;
SLkeymap_Type *new_map;
if ((NULL == (neew = copy_keymap(map)))
|| (NULL == (new_map = add_keymap(name, neew)))) return NULL;
if (map != NULL) new_map -> functions = map -> functions;
return new_map;
}
SLkeymap_Type *SLang_find_keymap(SLFUTURE_CONST char *name)
{
SLkeymap_Type *kmap;
kmap = SLKeyMap_List_Root;
while (kmap != NULL)
{
if ((kmap->name != NULL)
&& (0 == strcmp (kmap->name, name)))
return kmap;
kmap = kmap->next;
}
return NULL;
}
|