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
/************************************************************
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.
********************************************************/
#include "xkb-priv.h"
static char *
XkbcCanonicaliseComponent(char *name, const char *old)
{
char *tmp;
int i;
if (!name)
return NULL;
/* Treachery. */
if (old && strchr(old, '%'))
return NULL;
if (name[0] == '+' || name[0] == '|') {
if (old) {
tmp = malloc(strlen(name) + strlen(old) + 1);
if (!tmp)
return NULL;
sprintf(tmp, "%s%s", old, name);
free(name);
name = tmp;
}
else {
memmove(name, &name[1], strlen(&name[1]) + 1);
}
}
for (i = 0; name[i]; i++) {
if (name[i] == '%') {
if (old) {
tmp = malloc(strlen(name) + strlen(old));
if (!tmp)
return NULL;
strncpy(tmp, name, i);
strcat(tmp + i, old);
strcat(tmp + i + strlen(old), &name[i + 1]);
free(name);
name = tmp;
i--;
}
else {
memmove(&name[i - 1], &name[i + 1], strlen(&name[i + 1]) + 1);
i -= 2;
}
}
}
return name;
}
_X_EXPORT void
xkb_canonicalise_components(struct xkb_component_names * names,
const struct xkb_component_names * old)
{
names->keycodes = XkbcCanonicaliseComponent(names->keycodes,
old ? old->keycodes : NULL);
names->compat = XkbcCanonicaliseComponent(names->compat,
old ? old->compat : NULL);
names->symbols = XkbcCanonicaliseComponent(names->symbols,
old ? old->symbols : NULL);
names->types = XkbcCanonicaliseComponent(names->types,
old ? old->types : NULL);
}
static bool
VirtualModsToReal(struct xkb_keymap *xkb, unsigned virtual_mask,
unsigned *mask_rtrn)
{
int i, bit;
unsigned mask;
if (!xkb)
return false;
if (virtual_mask == 0) {
*mask_rtrn = 0;
return true;
}
if (!xkb->server)
return false;
for (i = mask = 0, bit = 1; i < XkbNumVirtualMods; i++, bit <<= 1) {
if (virtual_mask & bit)
mask |= xkb->server->vmods[i];
}
*mask_rtrn = mask;
return true;
}
bool
XkbcComputeEffectiveMap(struct xkb_keymap * xkb, struct xkb_key_type * type,
unsigned char *map_rtrn)
{
int i;
unsigned tmp;
struct xkb_kt_map_entry * entry = NULL;
if (!xkb || !type || !xkb->server)
return false;
if (type->mods.vmods != 0) {
if (!VirtualModsToReal(xkb, type->mods.vmods, &tmp))
return false;
type->mods.mask = tmp | type->mods.real_mods;
entry = type->map;
for (i = 0; i < type->map_count; i++, entry++) {
tmp = 0;
if (entry->mods.vmods != 0) {
if (!VirtualModsToReal(xkb, entry->mods.vmods, &tmp))
return false;
if (tmp == 0) {
entry->active = false;
continue;
}
}
entry->active = true;
entry->mods.mask = (entry->mods.real_mods | tmp) & type->mods.mask;
}
}
else
type->mods.mask = type->mods.real_mods;
if (map_rtrn) {
memset(map_rtrn, 0, type->mods.mask + 1);
if (entry && entry->active)
for (i = 0; i < type->map_count; i++)
map_rtrn[type->map[i].mods.mask] = type->map[i].level;
}
return true;
}