Hash :
8f1ee629
Author :
Date :
2012-08-14T14:42:57
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 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046
/************************************************************
* Copyright (c) 1994 by Silicon Graphics Computer Systems, Inc.
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of Silicon Graphics not be
* used in advertising or publicity pertaining to distribution
* of the software without specific prior written permission.
* Silicon Graphics makes no representation about the suitability
* of this software for any purpose. It is provided "as is"
* without any express or implied warranty.
*
* SILICON GRAPHICS DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS
* SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT SHALL SILICON
* GRAPHICS BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
* DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
* OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH
* THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
********************************************************/
#include "xkbcomp-priv.h"
#include "text.h"
#include "expr.h"
#include "keycodes.h"
#include "include.h"
/*
* The xkb_keycodes section
* ========================
*
* This is the simplest section type, and is the first one to be
* compiled. The purpose of this is mostly to map between the
* hardware/evdev scancodes and xkb keycodes. Each key is given a name
* of up to 4 letters, by which it can be referred to later, e.g. in the
* symbols section.
*
* Minimum/Maximum keycode
* -----------------------
* Statements of the form:
* minimum = 8;
* maximum = 255;
*
* The file may explicitly declare the minimum and/or maximum keycode
* contained therein (traditionally 8-255, inherited from old xfree86
* keycodes). If these are stated explicitly, they are enforced. If
* they are not stated, they are computed automatically.
*
* Keycode statements
* ------------------
* Statements of the form:
* <TLDE> = 49;
* <AE01> = 10;
*
* The above would let 49 and 10 be valid keycodes in the keymap, and
* assign them the names TLDE and AE01 respectively. The format <WXYZ> is
* always used to refer to a key by name.
*
* [ The naming convention <AE01> just denoted the position of the key
* in the main alphanumric section of the keyboard, with the top left key
* (usually "~") acting as origin. <AE01> is the key in the first row
* second column (which is usually "1"). ]
*
* In the common case this just maps to the evdev scancodes from
* /usr/include/linux/input.h, e.g. the following definitions:
* #define KEY_GRAVE 41
* #define KEY_1 2
* Similar definitions appear in the xf86-input-keyboard driver. Note
* that in all current keymaps there's a constant offset of 8 (for
* historical reasons).
*
* If there's a conflict, like the same name given to different keycodes,
* or same keycode given different names, it is resolved according to the
* merge mode which applies to the definitions.
*
* The reason for the 4 characters limit is that the name is sometimes
* converted to an unsigned long (in a direct mapping), instead of a char
* array (see KeyNameToLong, LongToKeyName).
*
* Alias statements
* ----------------
* Statements of the form:
* alias <MENU> = <COMP>;
*
* Allows to refer to a previously defined key (here <COMP>) by another
* name (here <MENU>). Conflicts are handled similarly.
*
* Indicator name statements
* -------------------------
* Statements of the form:
* indicator 1 = "Caps Lock";
* indicator 2 = "Num Lock";
* indicator 3 = "Scroll Lock";
*
* Assigns a name the indicator (i.e. keyboard LED) with the given index.
* The amount of possible indicators is predetermined (XkbNumIndicators).
* The indicator may be referred by this name later in the compat section
* and by the user.
*
* Effect on the keymap
* --------------------
* After all of the xkb_keycodes sections have been compiled, the
* following members of struct xkb_keymap are finalized:
* xkb_keycode_t min_key_code;
* xkb_keycode_t max_key_code;
* darray(struct xkb_key_alias) key_aliases;
* const char *indicator_names[XkbNumIndicators];
* char *keycodes_section_name;
* Further, the array of keys:
* darray(struct xkb_key) keys;
* had been resized to its final size (i.e. all of the xkb_key objects are
* referable by their keycode). However the objects themselves do not
* contain any useful information besides the key name at this point.
*/
typedef struct _AliasInfo {
enum merge_mode merge;
unsigned file_id;
struct list entry;
unsigned long alias;
unsigned long real;
} AliasInfo;
typedef struct _IndicatorNameInfo {
enum merge_mode merge;
unsigned file_id;
struct list entry;
xkb_led_index_t ndx;
xkb_atom_t name;
bool virtual;
} IndicatorNameInfo;
typedef struct _KeyNamesInfo {
char *name; /* e.g. evdev+aliases(qwerty) */
int errorCount;
unsigned file_id;
enum merge_mode merge;
xkb_keycode_t computedMin; /* lowest keycode stored */
xkb_keycode_t computedMax; /* highest keycode stored */
xkb_keycode_t explicitMin;
xkb_keycode_t explicitMax;
darray(unsigned long) names;
darray(unsigned int) files;
struct list leds;
struct list aliases;
struct xkb_context *ctx;
} KeyNamesInfo;
static void
ResizeKeyNameArrays(KeyNamesInfo *info, int newMax)
{
if (newMax < darray_size(info->names))
return;
darray_resize0(info->names, newMax + 1);
darray_resize0(info->files, newMax + 1);
}
static void
InitAliasInfo(AliasInfo *info, enum merge_mode merge, unsigned file_id,
char alias[XkbKeyNameLength], char real[XkbKeyNameLength])
{
memset(info, 0, sizeof(*info));
info->merge = merge;
info->file_id = file_id;
info->alias = KeyNameToLong(alias);
info->real = KeyNameToLong(real);
}
static void
InitIndicatorNameInfo(IndicatorNameInfo * ii, KeyNamesInfo * info)
{
ii->merge = info->merge;
ii->file_id = info->file_id;
ii->ndx = 0;
ii->name = XKB_ATOM_NONE;
ii->virtual = false;
}
static IndicatorNameInfo *
NextIndicatorName(KeyNamesInfo * info)
{
IndicatorNameInfo *ii;
ii = malloc(sizeof(*ii));
if (!ii)
return NULL;
InitIndicatorNameInfo(ii, info);
list_append(&ii->entry, &info->leds);
return ii;
}
static IndicatorNameInfo *
FindIndicatorByIndex(KeyNamesInfo * info, xkb_led_index_t ndx)
{
IndicatorNameInfo *old;
list_foreach(old, &info->leds, entry)
if (old->ndx == ndx)
return old;
return NULL;
}
static IndicatorNameInfo *
FindIndicatorByName(KeyNamesInfo * info, xkb_atom_t name)
{
IndicatorNameInfo *old;
list_foreach(old, &info->leds, entry)
if (old->name == name)
return old;
return NULL;
}
static bool
AddIndicatorName(KeyNamesInfo *info, enum merge_mode merge,
IndicatorNameInfo *new)
{
IndicatorNameInfo *old;
bool replace;
int verbosity = xkb_get_log_verbosity(info->ctx);
replace = (merge == MERGE_REPLACE) || (merge == MERGE_OVERRIDE);
old = FindIndicatorByName(info, new->name);
if (old) {
if ((old->file_id == new->file_id && verbosity > 0) ||
verbosity > 9) {
if (old->ndx == new->ndx) {
if (old->virtual != new->virtual) {
if (replace)
old->virtual = new->virtual;
log_warn(info->ctx, "Multiple indicators named %s; "
"Using %s instead of %s\n",
xkb_atom_text(info->ctx, new->name),
(old->virtual ? "virtual" : "real"),
(old->virtual ? "real" : "virtual"));
}
else {
log_warn(info->ctx, "Multiple indicators named %s; "
"Identical definitions ignored\n",
xkb_atom_text(info->ctx, new->name));
}
return true;
}
else {
log_warn(info->ctx, "Multiple indicators named %s; "
"Using %d, ignoring %d\n",
xkb_atom_text(info->ctx, new->name),
(replace ? old->ndx : new->ndx),
(replace ? new->ndx : old->ndx));
}
if (replace) {
list_del(&old->entry);
free(old);
}
}
}
old = FindIndicatorByIndex(info, new->ndx);
if (old) {
if ((old->file_id == new->file_id && verbosity > 0) ||
verbosity > 9) {
if (old->name == new->name && old->virtual == new->virtual) {
log_warn(info->ctx, "Multiple names for indicator %d; "
"Identical definitions ignored\n", new->ndx);
} else {
const char *oldType, *newType;
xkb_atom_t using, ignoring;
if (old->virtual)
oldType = "virtual indicator";
else
oldType = "real indicator";
if (new->virtual)
newType = "virtual indicator";
else
newType = "real indicator";
if (replace) {
using = new->name;
ignoring = old->name;
}
else {
using = old->name;
ignoring = new->name;
}
log_warn(info->ctx, "Multiple names for indicator %d; "
"Using %s %s, ignoring %s %s\n",
new->ndx,
oldType, xkb_atom_text(info->ctx, using),
newType, xkb_atom_text(info->ctx, ignoring));
}
}
if (replace) {
old->name = new->name;
old->virtual = new->virtual;
}
return true;
}
old = new;
new = NextIndicatorName(info);
if (!new) {
log_wsgo(info->ctx,
"Couldn't allocate name for indicator %d; Ignored\n",
old->ndx);
return false;
}
new->name = old->name;
new->ndx = old->ndx;
new->virtual = old->virtual;
return true;
}
static void
ClearKeyNamesInfo(KeyNamesInfo * info)
{
AliasInfo *alias, *next_alias;
IndicatorNameInfo *ii, *next_ii;
free(info->name);
info->name = NULL;
info->merge = MERGE_DEFAULT;
info->computedMax = info->explicitMax = info->explicitMin = 0;
info->computedMin = XKB_KEYCODE_MAX;
darray_free(info->names);
darray_free(info->files);
list_foreach_safe(ii, next_ii, &info->leds, entry)
free(ii);
list_init(&info->leds);
list_foreach_safe(alias, next_alias, &info->aliases, entry)
free(alias);
list_init(&info->aliases);
}
static void
InitKeyNamesInfo(KeyNamesInfo *info, struct xkb_context *ctx,
unsigned file_id)
{
info->name = NULL;
info->merge = MERGE_DEFAULT;
list_init(&info->leds);
list_init(&info->aliases);
info->file_id = file_id;
darray_init(info->names);
darray_init(info->files);
ClearKeyNamesInfo(info);
info->errorCount = 0;
info->ctx = ctx;
}
static int
FindKeyByLong(KeyNamesInfo * info, unsigned long name)
{
xkb_keycode_t i;
for (i = info->computedMin; i <= info->computedMax; i++)
if (darray_item(info->names, i) == name)
return i;
return 0;
}
/**
* Store the name of the key as a long in the info struct under the given
* keycode. If the same keys is referred to twice, print a warning.
* Note that the key's name is stored as a long, the keycode is the index.
*/
static bool
AddKeyName(KeyNamesInfo *info, xkb_keycode_t kc, unsigned long name,
enum merge_mode merge, unsigned file_id, bool reportCollisions)
{
xkb_keycode_t old;
int verbosity = xkb_get_log_verbosity(info->ctx);
ResizeKeyNameArrays(info, kc);
if (kc < info->computedMin)
info->computedMin = kc;
if (kc > info->computedMax)
info->computedMax = kc;
if (reportCollisions)
reportCollisions = (verbosity > 7 ||
(verbosity > 0 &&
file_id == darray_item(info->files, kc)));
if (darray_item(info->names, kc) != 0) {
const char *lname = LongKeyNameText(darray_item(info->names, kc));
const char *kname = LongKeyNameText(name);
if (darray_item(info->names, kc) == name && reportCollisions) {
log_warn(info->ctx, "Multiple identical key name definitions; "
"Later occurences of \"%s = %d\" ignored\n", lname, kc);
return true;
}
if (merge == MERGE_AUGMENT) {
if (reportCollisions)
log_warn(info->ctx, "Multiple names for keycode %d; "
"Using %s, ignoring %s\n", kc, lname, kname);
return true;
}
else {
if (reportCollisions)
log_warn(info->ctx, "Multiple names for keycode %d; "
"Using %s, ignoring %s\n", kc, kname, lname);
darray_item(info->names, kc) = 0;
darray_item(info->files, kc) = 0;
}
}
old = FindKeyByLong(info, name);
if (old != 0 && old != kc) {
const char *kname = LongKeyNameText(name);
if (merge == MERGE_OVERRIDE) {
darray_item(info->names, old) = 0;
darray_item(info->files, old) = 0;
if (reportCollisions)
log_warn(info->ctx, "Key name %s assigned to multiple keys; "
"Using %d, ignoring %d\n", kname, kc, old);
}
else {
if (reportCollisions && verbosity > 3)
log_warn(info->ctx, "Key name %s assigned to multiple keys; "
"Using %d, ignoring %d\n", kname, old, kc);
return true;
}
}
darray_item(info->names, kc) = name;
darray_item(info->files, kc) = file_id;
return true;
}
/***====================================================================***/
static int
HandleAliasDef(KeyNamesInfo *info, KeyAliasDef *def, enum merge_mode merge,
unsigned file_id);
static bool
MergeAliases(KeyNamesInfo *into, KeyNamesInfo *from, enum merge_mode merge)
{
AliasInfo *alias, *next;
KeyAliasDef def;
if (list_empty(&from->aliases))
return true;
if (list_empty(&into->aliases)) {
list_replace(&from->aliases, &into->aliases);
list_init(&from->aliases);
return true;
}
memset(&def, 0, sizeof(def));
list_foreach_safe(alias, next, &from->aliases, entry) {
def.merge = (merge == MERGE_DEFAULT) ? alias->merge : merge;
LongToKeyName(alias->alias, def.alias);
LongToKeyName(alias->real, def.real);
if (!HandleAliasDef(into, &def, def.merge, alias->file_id))
return false;
}
return true;
}
static void
MergeIncludedKeycodes(KeyNamesInfo *into, KeyNamesInfo *from,
enum merge_mode merge)
{
xkb_keycode_t i;
IndicatorNameInfo *led;
if (from->errorCount > 0) {
into->errorCount += from->errorCount;
return;
}
if (into->name == NULL) {
into->name = from->name;
from->name = NULL;
}
ResizeKeyNameArrays(into, from->computedMax);
for (i = from->computedMin; i <= from->computedMax; i++) {
unsigned long name = darray_item(from->names, i);
if (name == 0)
continue;
if (!AddKeyName(into, i, name, merge, from->file_id, false))
into->errorCount++;
}
list_foreach(led, &from->leds, entry) {
led->merge = (merge == MERGE_DEFAULT ? led->merge : merge);
if (!AddIndicatorName(into, led->merge, led))
into->errorCount++;
}
if (!MergeAliases(into, from, merge))
into->errorCount++;
if (from->explicitMin != 0)
if (into->explicitMin == 0 || into->explicitMin > from->explicitMin)
into->explicitMin = from->explicitMin;
if (from->explicitMax > 0)
if (into->explicitMax == 0 || into->explicitMax < from->explicitMax)
into->explicitMax = from->explicitMax;
}
static void
HandleKeycodesFile(KeyNamesInfo *info, XkbFile *file, enum merge_mode merge);
/**
* Handle the given include statement (e.g. "include "evdev+aliases(qwerty)").
*
* @param info Struct to store the key info in.
* @param stmt The include statement from the keymap file.
*/
static bool
HandleIncludeKeycodes(KeyNamesInfo *info, IncludeStmt *stmt)
{
enum merge_mode merge = MERGE_DEFAULT;
XkbFile *rtrn;
KeyNamesInfo included, next_incl;
InitKeyNamesInfo(&included, info->ctx, info->file_id);
if (stmt->stmt) {
free(included.name);
included.name = stmt->stmt;
stmt->stmt = NULL;
}
for (; stmt; stmt = stmt->next_incl) {
if (!ProcessIncludeFile(info->ctx, stmt, FILE_TYPE_KEYCODES,
&rtrn, &merge)) {
info->errorCount += 10;
ClearKeyNamesInfo(&included);
return false;
}
InitKeyNamesInfo(&next_incl, info->ctx, rtrn->id);
HandleKeycodesFile(&next_incl, rtrn, MERGE_OVERRIDE);
MergeIncludedKeycodes(&included, &next_incl, merge);
ClearKeyNamesInfo(&next_incl);
FreeXkbFile(rtrn);
}
MergeIncludedKeycodes(info, &included, merge);
ClearKeyNamesInfo(&included);
return (info->errorCount == 0);
}
/**
* Parse the given statement and store the output in the info struct.
* e.g. <ESC> = 9
*/
static int
HandleKeycodeDef(KeyNamesInfo *info, KeycodeDef *stmt, enum merge_mode merge)
{
if ((info->explicitMin != 0 && stmt->value < info->explicitMin) ||
(info->explicitMax != 0 && stmt->value > info->explicitMax)) {
log_err(info->ctx, "Illegal keycode %lu for name %s; "
"Must be in the range %d-%d inclusive\n",
stmt->value, KeyNameText(stmt->name), info->explicitMin,
info->explicitMax ? info->explicitMax : XKB_KEYCODE_MAX);
return 0;
}
if (stmt->merge != MERGE_DEFAULT) {
if (stmt->merge == MERGE_REPLACE)
merge = MERGE_OVERRIDE;
else
merge = stmt->merge;
}
return AddKeyName(info, stmt->value, KeyNameToLong(stmt->name), merge,
info->file_id, true);
}
static void
HandleAliasCollision(KeyNamesInfo *info, AliasInfo *old, AliasInfo *new)
{
int verbosity = xkb_get_log_verbosity(info->ctx);
if (new->real == old->real) {
if ((new->file_id == old->file_id && verbosity > 0) || verbosity > 9)
log_warn(info->ctx, "Alias of %s for %s declared more than once; "
"First definition ignored\n",
LongKeyNameText(new->alias), LongKeyNameText(new->real));
}
else {
unsigned long use, ignore;
if (new->merge == MERGE_AUGMENT) {
use = old->real;
ignore = new->real;
}
else {
use = new->real;
ignore = old->real;
}
if ((old->file_id == new->file_id && verbosity > 0) || verbosity > 9)
log_warn(info->ctx, "Multiple definitions for alias %s; "
"Using %s, ignoring %s\n",
LongKeyNameText(old->alias), LongKeyNameText(use),
LongKeyNameText(ignore));
if (use != old->real)
old->real = use;
}
old->file_id = new->file_id;
old->merge = new->merge;
}
static int
HandleAliasDef(KeyNamesInfo *info, KeyAliasDef *def, enum merge_mode merge,
unsigned file_id)
{
AliasInfo *alias;
list_foreach(alias, &info->aliases, entry) {
if (alias->alias == KeyNameToLong(def->alias)) {
AliasInfo new;
InitAliasInfo(&new, merge, file_id, def->alias, def->real);
HandleAliasCollision(info, alias, &new);
return true;
}
}
alias = calloc(1, sizeof(*alias));
if (!alias) {
log_wsgo(info->ctx, "Allocation failure in HandleAliasDef\n");
return false;
}
alias->file_id = file_id;
alias->merge = merge;
alias->alias = KeyNameToLong(def->alias);
alias->real = KeyNameToLong(def->real);
list_append(&alias->entry, &info->aliases);
return true;
}
#define MIN_KEYCODE_DEF 0
#define MAX_KEYCODE_DEF 1
/**
* Handle the minimum/maximum statement of the xkb file.
* Sets explicitMin/Max of the info struct.
*
* @return 1 on success, 0 otherwise.
*/
static int
HandleKeyNameVar(KeyNamesInfo *info, VarDef *stmt)
{
const char *elem, *field;
xkb_keycode_t kc;
ExprDef *arrayNdx;
int which;
if (!ExprResolveLhs(info->ctx, stmt->name, &elem, &field,
&arrayNdx))
return false; /* internal error, already reported */
if (elem) {
log_err(info->ctx, "Unknown element %s encountered; "
"Default for field %s ignored\n", elem, field);
return false;
}
if (istreq(field, "minimum")) {
which = MIN_KEYCODE_DEF;
}
else if (istreq(field, "maximum")) {
which = MAX_KEYCODE_DEF;
}
else {
log_err(info->ctx, "Unknown field encountered; "
"Assigment to field %s ignored\n", field);
return false;
}
if (arrayNdx != NULL) {
log_err(info->ctx, "The %s setting is not an array; "
"Illegal array reference ignored\n", field);
return false;
}
if (!ExprResolveKeyCode(info->ctx, stmt->value, &kc)) {
log_err(info->ctx, "Illegal keycode encountered; "
"Assignment to field %s ignored\n", field);
return false;
}
if (kc > XKB_KEYCODE_MAX) {
log_err(info->ctx,
"Illegal keycode %d (must be in the range %d-%d inclusive); "
"Value of \"%s\" not changed\n",
kc, 0, XKB_KEYCODE_MAX, field);
return false;
}
if (which == MIN_KEYCODE_DEF) {
if (info->explicitMax > 0 && info->explicitMax < kc) {
log_err(info->ctx,
"Minimum key code (%d) must be <= maximum key code (%d); "
"Minimum key code value not changed\n",
kc, info->explicitMax);
return false;
}
if (info->computedMax > 0 && info->computedMin < kc) {
log_err(info->ctx,
"Minimum key code (%d) must be <= lowest defined key (%d); "
"Minimum key code value not changed\n",
kc, info->computedMin);
return false;
}
info->explicitMin = kc;
}
else if (which == MAX_KEYCODE_DEF) {
if (info->explicitMin > 0 && info->explicitMin > kc) {
log_err(info->ctx,
"Maximum code (%d) must be >= minimum key code (%d); "
"Maximum code value not changed\n",
kc, info->explicitMin);
return false;
}
if (info->computedMax > 0 && info->computedMax > kc) {
log_err(info->ctx,
"Maximum code (%d) must be >= highest defined key (%d); "
"Maximum code value not changed\n",
kc, info->computedMax);
return false;
}
info->explicitMax = kc;
}
return true;
}
static int
HandleIndicatorNameDef(KeyNamesInfo *info, IndicatorNameDef *def,
enum merge_mode merge)
{
IndicatorNameInfo ii;
const char *str;
if (def->ndx < 1 || def->ndx > XkbNumIndicators) {
info->errorCount++;
log_err(info->ctx,
"Name specified for illegal indicator index %d\n; Ignored\n",
def->ndx);
return false;
}
InitIndicatorNameInfo(&ii, info);
if (!ExprResolveString(info->ctx, def->name, &str)) {
char buf[20];
snprintf(buf, sizeof(buf), "%d", def->ndx);
info->errorCount++;
return ReportBadType(info->ctx, "indicator", "name", buf,
"string");
}
ii.ndx = (xkb_led_index_t) def->ndx;
ii.name = xkb_atom_intern(info->ctx, str);
ii.virtual = def->virtual;
return AddIndicatorName(info, merge, &ii);
}
/**
* Handle the xkb_keycodes section of a xkb file.
* All information about parsed keys is stored in the info struct.
*
* Such a section may have include statements, in which case this function is
* semi-recursive (it calls HandleIncludeKeycodes, which may call
* HandleKeycodesFile again).
*
* @param info Struct to contain the fully parsed key information.
* @param file The input file (parsed xkb_keycodes section)
* @param merge Merge strategy (MERGE_OVERRIDE, etc.)
*/
static void
HandleKeycodesFile(KeyNamesInfo *info, XkbFile *file, enum merge_mode merge)
{
ParseCommon *stmt;
bool ok;
free(info->name);
info->name = strdup_safe(file->name);
for (stmt = file->defs; stmt; stmt = stmt->next) {
switch (stmt->type) {
case STMT_INCLUDE: /* e.g. include "evdev+aliases(qwerty)" */
ok = HandleIncludeKeycodes(info, (IncludeStmt *) stmt);
break;
case STMT_KEYCODE: /* e.g. <ESC> = 9; */
ok = HandleKeycodeDef(info, (KeycodeDef *) stmt, merge);
break;
case STMT_ALIAS: /* e.g. alias <MENU> = <COMP>; */
ok = HandleAliasDef(info, (KeyAliasDef *) stmt, merge,
info->file_id);
break;
case STMT_VAR: /* e.g. minimum, maximum */
ok = HandleKeyNameVar(info, (VarDef *) stmt);
break;
case STMT_INDICATOR_NAME: /* e.g. indicator 1 = "Caps Lock"; */
ok = HandleIndicatorNameDef(info, (IndicatorNameDef *) stmt,
merge);
break;
default:
log_err(info->ctx,
"Keycode files may define key and indicator names only; "
"Ignoring %s\n", StmtTypeToString(stmt->type));
ok = false;
break;
}
if (!ok)
info->errorCount++;
if (info->errorCount > 10) {
log_err(info->ctx, "Abandoning keycodes file \"%s\"\n",
file->topName);
break;
}
}
}
static int
ApplyAliases(KeyNamesInfo *info, struct xkb_keymap *keymap)
{
int i;
struct xkb_key *key;
struct xkb_key_alias *old, *a;
AliasInfo *alias, *next;
int nNew = 0, nOld;
nOld = darray_size(keymap->key_aliases);
old = &darray_item(keymap->key_aliases, 0);
list_foreach(alias, &info->aliases, entry) {
key = FindNamedKey(keymap, alias->real, false, 0);
if (!key) {
log_lvl(info->ctx, 5,
"Attempt to alias %s to non-existent key %s; Ignored\n",
LongKeyNameText(alias->alias),
LongKeyNameText(alias->real));
alias->alias = 0;
continue;
}
key = FindNamedKey(keymap, alias->alias, false, 0);
if (key) {
log_lvl(info->ctx, 5,
"Attempt to create alias with the name of a real key; "
"Alias \"%s = %s\" ignored\n",
LongKeyNameText(alias->alias),
LongKeyNameText(alias->real));
alias->alias = 0;
continue;
}
nNew++;
if (!old)
continue;
for (i = 0, a = old; i < nOld; i++, a++) {
AliasInfo old_alias;
if (KeyNameToLong(a->alias) == alias->alias)
continue;
InitAliasInfo(&old_alias, MERGE_AUGMENT, 0, a->alias, a->real);
HandleAliasCollision(info, &old_alias, alias);
old_alias.real = KeyNameToLong(a->real);
alias->alias = 0;
nNew--;
break;
}
}
if (nNew == 0)
goto out;
darray_resize0(keymap->key_aliases, nOld + nNew);
a = &darray_item(keymap->key_aliases, nOld);
list_foreach(alias, &info->aliases, entry) {
if (alias->alias != 0) {
LongToKeyName(alias->alias, a->alias);
LongToKeyName(alias->real, a->real);
a++;
}
}
out:
list_foreach_safe(alias, next, &info->aliases, entry)
free(alias);
list_init(&info->aliases);
return true;
}
/**
* Compile the xkb_keycodes section, parse it's output, return the results.
*
* @param file The parsed XKB file (may have include statements requiring
* further parsing)
* @param result The effective keycodes, as gathered from the file.
* @param merge Merge strategy.
*
* @return true on success, false otherwise.
*/
bool
CompileKeycodes(XkbFile *file, struct xkb_keymap *keymap,
enum merge_mode merge)
{
xkb_keycode_t kc;
KeyNamesInfo info; /* contains all the info after parsing */
IndicatorNameInfo *ii;
InitKeyNamesInfo(&info, keymap->ctx, file->id);
HandleKeycodesFile(&info, file, merge);
/* all the keys are now stored in info */
if (info.errorCount != 0)
goto err_info;
if (info.explicitMin > 0) /* if "minimum" statement was present */
keymap->min_key_code = info.explicitMin;
else
keymap->min_key_code = info.computedMin;
if (info.explicitMax > 0) /* if "maximum" statement was present */
keymap->max_key_code = info.explicitMax;
else
keymap->max_key_code = info.computedMax;
darray_resize0(keymap->keys, keymap->max_key_code + 1);
for (kc = info.computedMin; kc <= info.computedMax; kc++)
LongToKeyName(darray_item(info.names, kc),
XkbKey(keymap, kc)->name);
keymap->keycodes_section_name = strdup_safe(info.name);
list_foreach(ii, &info.leds, entry)
keymap->indicator_names[ii->ndx - 1] =
xkb_atom_text(keymap->ctx, ii->name);
ApplyAliases(&info, keymap);
ClearKeyNamesInfo(&info);
return true;
err_info:
ClearKeyNamesInfo(&info);
return false;
}
/**
* Find the key with the given name.
*
* @param keymap The keymap to search in.
* @param name The 4-letter name of the key as a long.
* @param use_aliases true if the key aliases should be searched too.
* @param start_from Keycode to start searching from.
*
* @return the key if it is found, NULL otherwise.
*/
struct xkb_key *
FindNamedKey(struct xkb_keymap *keymap, unsigned long name,
bool use_aliases, xkb_keycode_t start_from)
{
struct xkb_key *key;
if (start_from < keymap->min_key_code)
start_from = keymap->min_key_code;
else if (start_from > keymap->max_key_code)
return NULL;
xkb_foreach_key_from(key, keymap, start_from)
if (KeyNameToLong(key->name) == name)
return key;
if (use_aliases) {
unsigned long new_name;
if (FindKeyNameForAlias(keymap, name, &new_name))
return FindNamedKey(keymap, new_name, false, 0);
}
return NULL;
}
bool
FindKeyNameForAlias(struct xkb_keymap *keymap, unsigned long lname,
unsigned long *real_name)
{
char name[XkbKeyNameLength];
struct xkb_key_alias *a;
LongToKeyName(lname, name);
darray_foreach(a, keymap->key_aliases) {
if (strncmp(name, a->alias, XkbKeyNameLength) == 0) {
*real_name = KeyNameToLong(a->real);
return true;
}
}
return false;
}