Hash :
b610b2b9
Author :
Date :
2012-05-08T14:52:23
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
/************************************************************
Copyright (c) 1993 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.
********************************************************/
/*
* Copyright © 2012 Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) 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 AUTHORS OR COPYRIGHT HOLDERS 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.
*
* Author: Daniel Stone <daniel@fooishbar.org>
*/
/*
* This is a bastardised version of xkbActions.c from the X server which
* does not support, for the moment:
* - AccessX sticky/debounce/etc (will come later)
* - pointer keys (may come later)
* - key redirects (unlikely)
* - messages (very unlikely)
*/
#include <assert.h>
#include "xkb-priv.h"
struct xkb_filter {
struct xkb_state *state;
union xkb_action action;
xkb_keycode_t keycode;
uint32_t priv;
int (*func)(struct xkb_filter *filter, xkb_keycode_t key,
enum xkb_key_direction direction);
int refcnt;
struct xkb_filter *next;
};
static union xkb_action *
xkb_key_get_action(struct xkb_state *state, xkb_keycode_t key)
{
int group, level;
if (!XkbKeyHasActions(state->xkb, key) ||
!XkbKeycodeInRange(state->xkb, key)) {
static union xkb_action fake;
memset(&fake, 0, sizeof(fake));
fake.type = XkbSA_NoAction;
return &fake;
}
group = xkb_key_get_group(state, key);
level = xkb_key_get_level(state, key, group);
return XkbKeyActionEntry(state->xkb, key, level, group);
}
static struct xkb_filter *
xkb_filter_new(struct xkb_state *state)
{
int i;
int old_size = state->num_filters;
struct xkb_filter *filters = state->filters;
for (i = 0; i < state->num_filters; i++) {
if (filters[i].func)
continue;
filters[i].state = state;
filters[i].refcnt = 1;
return &filters[i];
}
if (state->num_filters > 0)
state->num_filters *= 2;
else
state->num_filters = 4;
filters = realloc(filters, state->num_filters * sizeof(*filters));
if (!filters) { /* WSGO */
state->num_filters = old_size;
return NULL;
}
state->filters = filters;
memset(&filters[old_size], 0,
(state->num_filters - old_size) * sizeof(*filters));
filters[old_size].state = state;
filters[old_size].refcnt = 1;
return &filters[old_size];
}
/***====================================================================***/
static int
xkb_filter_group_set_func(struct xkb_filter *filter, xkb_keycode_t keycode,
enum xkb_key_direction direction)
{
if (keycode != filter->keycode) {
filter->action.group.flags &= ~XkbSA_ClearLocks;
return 1;
}
if (direction == XKB_KEY_DOWN) {
filter->refcnt++;
return 0;
}
else if (--filter->refcnt > 0) {
return 0;
}
if (filter->action.group.flags & XkbSA_GroupAbsolute)
filter->state->base_group = filter->action.group.group;
else
filter->state->base_group = -filter->action.group.group;
if (filter->action.group.flags & XkbSA_ClearLocks)
filter->state->locked_group = 0;
filter->func = NULL;
return 1;
}
static int
xkb_filter_group_set_new(struct xkb_state *state, xkb_keycode_t keycode,
union xkb_action *action)
{
struct xkb_filter *filter = xkb_filter_new(state);
if (!filter) /* WSGO */
return -1;
filter->keycode = keycode;
filter->func = xkb_filter_group_set_func;
filter->action = *action;
if (action->group.flags & XkbSA_GroupAbsolute) {
filter->action.group.group = filter->state->base_group;
filter->state->base_group = action->group.group;
}
else {
filter->state->base_group += action->group.group;
}
return 1;
}
static int
xkb_filter_group_lock_func(struct xkb_filter *filter, xkb_keycode_t keycode,
enum xkb_key_direction direction)
{
if (keycode != filter->keycode)
return 1;
if (direction == XKB_KEY_DOWN) {
filter->refcnt++;
return 0;
}
if (--filter->refcnt > 0)
return 0;
filter->func = NULL;
return 1;
}
static int
xkb_filter_group_lock_new(struct xkb_state *state, xkb_keycode_t keycode,
union xkb_action *action)
{
struct xkb_filter *filter = xkb_filter_new(state);
if (!filter)
return 0;
filter->keycode = keycode;
filter->func = xkb_filter_group_lock_func;
filter->action = *action;
if (action->group.flags & XkbSA_GroupAbsolute)
filter->state->locked_group = action->group.group;
else
filter->state->locked_group += action->group.group;
return 1;
}
static int
xkb_filter_mod_set_func(struct xkb_filter *filter, xkb_keycode_t keycode,
enum xkb_key_direction direction)
{
if (keycode != filter->keycode) {
filter->action.mods.flags &= ~XkbSA_ClearLocks;
return 1;
}
if (direction == XKB_KEY_DOWN) {
filter->refcnt++;
return 0;
}
else if (--filter->refcnt > 0) {
return 0;
}
filter->state->base_mods &= ~(filter->action.mods.mask);
if (filter->action.mods.flags & XkbSA_ClearLocks)
filter->state->locked_mods &= ~filter->action.mods.mask;
filter->func = NULL;
return 1;
}
static int
xkb_filter_mod_set_new(struct xkb_state *state, xkb_keycode_t keycode,
union xkb_action *action)
{
struct xkb_filter *filter = xkb_filter_new(state);
if (!filter) /* WSGO */
return -1;
filter->keycode = keycode;
filter->func = xkb_filter_mod_set_func;
filter->action = *action;
filter->state->base_mods |= action->mods.mask;
return 1;
}
static int
xkb_filter_mod_lock_func(struct xkb_filter *filter, xkb_keycode_t keycode,
enum xkb_key_direction direction)
{
if (keycode != filter->keycode)
return 1;
if (direction == XKB_KEY_DOWN) {
filter->refcnt++;
return 0;
}
if (--filter->refcnt > 0)
return 0;
filter->state->locked_mods &= ~filter->priv;
filter->func = NULL;
return 1;
}
static int
xkb_filter_mod_lock_new(struct xkb_state *state, xkb_keycode_t keycode,
union xkb_action *action)
{
struct xkb_filter *filter = xkb_filter_new(state);
if (!filter) /* WSGO */
return 0;
filter->keycode = keycode;
filter->func = xkb_filter_mod_lock_func;
filter->action = *action;
filter->priv = state->locked_mods & action->mods.mask;
state->locked_mods |= action->mods.mask;
return 1;
}
enum xkb_key_latch_state {
NO_LATCH,
LATCH_KEY_DOWN,
LATCH_PENDING,
};
static int
xkb_filter_mod_latch_func(struct xkb_filter *filter, xkb_keycode_t keycode,
enum xkb_key_direction direction)
{
enum xkb_key_latch_state latch = filter->priv;
if (direction == XKB_KEY_DOWN && latch == LATCH_PENDING) {
/* If this is a new keypress and we're awaiting our single latched
* keypress, then either break the latch if any random key is pressed,
* or promote it to a lock or plain base set if it's the same
* modifier. */
union xkb_action *action = xkb_key_get_action(filter->state, keycode);
if (action->type == XkbSA_LatchMods &&
action->mods.flags == filter->action.mods.flags &&
action->mods.mask == filter->action.mods.mask) {
filter->action = *action;
if (filter->action.mods.flags & XkbSA_LatchToLock) {
filter->action.type = XkbSA_LockMods;
filter->func = xkb_filter_mod_lock_func;
filter->state->locked_mods |= filter->action.mods.mask;
}
else {
filter->action.type = XkbSA_SetMods;
filter->func = xkb_filter_mod_set_func;
filter->state->base_mods |= filter->action.mods.mask;
}
filter->keycode = keycode;
filter->state->latched_mods &= ~filter->action.mods.mask;
/* XXX beep beep! */
return 0;
}
else if (((1 << action->type) & XkbSA_BreakLatch)) {
/* XXX: This may be totally broken, we might need to break the
* latch in the next run after this press? */
filter->state->latched_mods &= ~filter->action.mods.mask;
filter->func = NULL;
return 1;
}
}
else if (direction == XKB_KEY_UP && keycode == filter->keycode) {
/* Our key got released. If we've set it to clear locks, and we
* currently have the same modifiers locked, then release them and
* don't actually latch. Else we've actually hit the latching
* stage, so set PENDING and move our modifier from base to
* latched. */
if (latch == NO_LATCH ||
((filter->action.mods.flags & XkbSA_ClearLocks) &&
(filter->state->locked_mods & filter->action.mods.mask) ==
filter->action.mods.mask)) {
/* XXX: We might be a bit overenthusiastic about clearing
* mods other filters have set here? */
if (latch == LATCH_PENDING)
filter->state->latched_mods &= ~filter->action.mods.mask;
else
filter->state->base_mods &= ~filter->action.mods.mask;
filter->state->locked_mods &= ~filter->action.mods.mask;
filter->func = NULL;
}
else {
latch = LATCH_PENDING;
filter->state->base_mods &= ~filter->action.mods.mask;
filter->state->latched_mods |= filter->action.mods.mask;
/* XXX beep beep! */
}
}
else if (direction == XKB_KEY_DOWN && latch == LATCH_KEY_DOWN) {
/* Someone's pressed another key while we've still got the latching
* key held down, so keep the base modifier state active (from
* xkb_filter_mod_latch_new), but don't trip the latch, just clear
* it as soon as the modifier gets released. */
latch = NO_LATCH;
}
filter->priv = latch;
return 1;
}
static int
xkb_filter_mod_latch_new(struct xkb_state *state, xkb_keycode_t keycode,
union xkb_action *action)
{
struct xkb_filter *filter = xkb_filter_new(state);
enum xkb_key_latch_state latch = LATCH_KEY_DOWN;
if (!filter) /* WSGO */
return -1;
filter->keycode = keycode;
filter->priv = latch;
filter->func = xkb_filter_mod_latch_func;
filter->action = *action;
filter->state->base_mods |= action->mods.mask;
return 1;
}
/**
* Applies any relevant filters to the key, first from the list of filters
* that are currently active, then if no filter has claimed the key, possibly
* apply a new filter from the key action.
*/
static void
xkb_filter_apply_all(struct xkb_state *state, xkb_keycode_t key,
enum xkb_key_direction direction)
{
struct xkb_filter *filters = state->filters;
union xkb_action *act = NULL;
int send = 1;
int i;
/* First run through all the currently active filters and see if any of
* them have claimed this event. */
for (i = 0; i < state->num_filters; i++) {
if (!filters[i].func)
continue;
send &= (*filters[i].func)(&filters[i], key, direction);
}
if (!send || direction == XKB_KEY_UP)
return;
act = xkb_key_get_action(state, key);
switch (act->type) {
case XkbSA_SetMods:
send = xkb_filter_mod_set_new(state, key, act);
break;
case XkbSA_LatchMods:
send = xkb_filter_mod_latch_new(state, key, act);
break;
case XkbSA_LockMods:
send = xkb_filter_mod_lock_new(state, key, act);
break;
case XkbSA_SetGroup:
send = xkb_filter_group_set_new(state, key, act);
break;
#if 0
case XkbSA_LatchGroup:
send = xkb_filter_mod_latch_new(state, key, act);
break;
#endif
case XkbSA_LockGroup:
send = xkb_filter_group_lock_new(state, key, act);
break;
}
return;
}
_X_EXPORT struct xkb_state *
xkb_state_new(struct xkb_keymap *xkb)
{
struct xkb_state *ret;
if (!xkb)
return NULL;
ret = calloc(sizeof(*ret), 1);
if (!ret)
return NULL;
ret->refcnt = 1;
ret->xkb = xkb_map_ref(xkb);
return ret;
}
_X_EXPORT struct xkb_state *
xkb_state_ref(struct xkb_state *state)
{
state->refcnt++;
return state;
}
_X_EXPORT void
xkb_state_unref(struct xkb_state *state)
{
state->refcnt--;
assert(state->refcnt >= 0);
if (state->refcnt > 0)
return;
xkb_map_unref(state->xkb);
free(state->filters);
free(state);
}
_X_EXPORT struct xkb_keymap *
xkb_state_get_map(struct xkb_state *state)
{
return state->xkb;
}
/**
* Update the LED state to match the rest of the xkb_state.
*/
static void
xkb_state_led_update_all(struct xkb_state *state)
{
xkb_led_index_t led;
state->leds = 0;
for (led = 0; led < XkbNumIndicators; led++) {
struct xkb_indicator_map *map = &state->xkb->indicators->maps[led];
uint32_t mod_mask = 0;
uint32_t group_mask = 0;
if (!map->which_mods && !map->which_groups && !map->ctrls)
continue;
if (map->which_mods) {
if (map->which_mods & XkbIM_UseBase)
mod_mask |= state->base_mods;
if (map->which_mods & XkbIM_UseLatched)
mod_mask |= state->latched_mods;
if (map->which_mods & XkbIM_UseLocked)
mod_mask |= state->locked_mods;
if (map->which_mods & XkbIM_UseEffective)
mod_mask |= state->mods;
if ((map->mods.mask & mod_mask))
state->leds |= (1 << led);
}
else if (map->which_groups) {
if (map->which_mods & XkbIM_UseBase)
group_mask |= (1 << state->base_group);
if (map->which_mods & XkbIM_UseLatched)
group_mask |= (1 << state->latched_group);
if (map->which_mods & XkbIM_UseLocked)
group_mask |= (1 << state->locked_group);
if (map->which_mods & XkbIM_UseEffective)
group_mask |= (1 << state->group);
if ((map->groups & group_mask))
state->leds |= (1 << led);
}
else if (map->ctrls) {
if ((map->ctrls & state->xkb->ctrls->enabled_ctrls))
state->leds |= (1 << led);
}
}
}
/**
* Calculates the derived state (effective mods/group and LEDs) from an
* up-to-date xkb_state.
*/
static void
xkb_state_update_derived(struct xkb_state *state)
{
state->mods = (state->base_mods | state->latched_mods | state->locked_mods);
/* FIXME: Clamp/wrap locked_group */
state->group = state->locked_group + state->base_group +
state->latched_group;
/* FIXME: Clamp/wrap effective group */
xkb_state_led_update_all(state);
}
/**
* Given a particular key event, updates the state structure to reflect the
* new modifiers.
*/
_X_EXPORT void
xkb_state_update_key(struct xkb_state *state, xkb_keycode_t key,
enum xkb_key_direction direction)
{
xkb_filter_apply_all(state, key, direction);
xkb_state_update_derived(state);
}
/**
* Updates the state from a set of explicit masks as gained from
* xkb_state_serialise_mods and xkb_state_serialise_groups. As noted in the
* documentation for these functions in xkbcommon.h, this round-trip is
* lossy, and should only be used to update a slave state mirroring the
* master, e.g. in a client/server window system.
*/
_X_EXPORT void
xkb_state_update_mask(struct xkb_state *state,
xkb_mod_mask_t base_mods,
xkb_mod_mask_t latched_mods,
xkb_mod_mask_t locked_mods,
xkb_group_index_t base_group,
xkb_group_index_t latched_group,
xkb_group_index_t locked_group)
{
xkb_mod_mask_t mod;
state->base_mods = 0;
state->latched_mods = 0;
state->locked_mods = 0;
for (mod = 0; mod < xkb_map_num_mods(state->xkb); mod++) {
xkb_mod_mask_t idx = (1 << mod);
if (base_mods & idx)
state->base_mods |= idx;
if (latched_mods & idx)
state->latched_mods |= idx;
if (locked_mods & idx)
state->locked_mods |= idx;
}
state->base_group = base_group;
state->latched_group = latched_group;
state->locked_group = locked_group;
xkb_state_update_derived(state);
}
/**
* Serialises the requested modifier state into an xkb_mod_mask_t, with all
* the same disclaimers as in xkb_state_update_mask.
*/
_X_EXPORT xkb_mod_mask_t
xkb_state_serialise_mods(struct xkb_state *state,
enum xkb_state_component type)
{
xkb_mod_mask_t ret = 0;
if (type == XKB_STATE_EFFECTIVE)
return state->mods;
if (type & XKB_STATE_DEPRESSED)
ret |= state->base_mods;
if (type & XKB_STATE_LATCHED)
ret |= state->latched_mods;
if (type & XKB_STATE_LOCKED)
ret |= state->locked_mods;
return ret;
}
/**
* Serialises the requested group state, with all the same disclaimers as
* in xkb_state_update_mask.
*/
_X_EXPORT xkb_group_index_t
xkb_state_serialise_group(struct xkb_state *state,
enum xkb_state_component type)
{
xkb_group_index_t ret = 0;
if (type == XKB_STATE_EFFECTIVE)
return state->group;
if (type & XKB_STATE_DEPRESSED)
ret += state->base_group;
if (type & XKB_STATE_LATCHED)
ret += state->latched_group;
if (type & XKB_STATE_LOCKED)
ret += state->locked_group;
return ret;
}
/**
* Returns 1 if the given modifier is active with the specified type(s), 0 if
* not, or -1 if the modifier is invalid.
*/
_X_EXPORT int
xkb_state_mod_index_is_active(struct xkb_state *state,
xkb_mod_index_t idx,
enum xkb_state_component type)
{
int ret = 0;
if (idx >= xkb_map_num_mods(state->xkb))
return -1;
if (type & XKB_STATE_DEPRESSED)
ret |= (state->base_mods & (1 << idx));
if (type & XKB_STATE_LATCHED)
ret |= (state->latched_mods & (1 << idx));
if (type & XKB_STATE_LOCKED)
ret |= (state->locked_mods & (1 << idx));
return ret;
}
/**
* Returns 1 if the given modifier is active with the specified type(s), 0 if
* not, or -1 if the modifier is invalid.
*/
_X_EXPORT int
xkb_state_mod_name_is_active(struct xkb_state *state, const char *name,
enum xkb_state_component type)
{
xkb_mod_index_t idx = xkb_map_mod_get_index(state->xkb, name);
if (idx == XKB_MOD_INVALID)
return -1;
return xkb_state_mod_index_is_active(state, idx, type);
}
/**
* Returns 1 if the given group is active with the specified type(s), 0 if
* not, or -1 if the group is invalid.
*/
_X_EXPORT int
xkb_state_group_index_is_active(struct xkb_state *state,
xkb_group_index_t idx,
enum xkb_state_component type)
{
int ret = 0;
if (idx >= xkb_map_num_groups(state->xkb))
return -1;
if (type & XKB_STATE_DEPRESSED)
ret |= (state->base_group == idx);
if (type & XKB_STATE_LATCHED)
ret |= (state->latched_group == idx);
if (type & XKB_STATE_LOCKED)
ret |= (state->locked_group == idx);
return ret;
}
/**
* Returns 1 if the given modifier is active with the specified type(s), 0 if
* not, or -1 if the modifier is invalid.
*/
_X_EXPORT int
xkb_state_group_name_is_active(struct xkb_state *state, const char *name,
enum xkb_state_component type)
{
xkb_group_index_t idx = xkb_map_group_get_index(state->xkb, name);
if (idx == XKB_GROUP_INVALID)
return -1;
return xkb_state_group_index_is_active(state, idx, type);
}
/**
* Returns 1 if the given LED is active, 0 if not, or -1 if the LED is invalid.
*/
_X_EXPORT int
xkb_state_led_index_is_active(struct xkb_state *state, xkb_led_index_t idx)
{
if (idx >= xkb_map_num_leds(state->xkb))
return -1;
return !!(state->leds & (1 << idx));
}
/**
* Returns 1 if the given LED is active, 0 if not, or -1 if the LED is invalid.
*/
_X_EXPORT int
xkb_state_led_name_is_active(struct xkb_state *state, const char *name)
{
xkb_led_index_t idx = xkb_map_led_get_index(state->xkb, name);
if (idx == XKB_LED_INVALID)
return -1;
return xkb_state_led_index_is_active(state, idx);
}