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
|
/*
* BRLTTY - A background process providing access to the console screen (when in
* text mode) for a blind person using a refreshable braille display.
*
* Copyright (C) 1995-2024 by The BRLTTY Developers.
*
* BRLTTY comes with ABSOLUTELY NO WARRANTY.
*
* This is free software, placed under the terms of the
* GNU Lesser General Public License, as published by the Free Software
* Foundation; either version 2.1 of the License, or (at your option) any
* later version. Please see the file LICENSE-LGPL for details.
*
* Web Page: http://brltty.app/
*
* This software is maintained by Dave Mielke <dave@mielke.cc>.
*/
#include "prologue.h"
/* Source file for range list management module */
/* For a description of what each function does, see rangelist.h */
#include <stdio.h>
#include "brlapi_keyranges.h"
#include "log.h"
static int inKeyrange(KeyrangeList *l, KeyrangeElem e)
{
uint32_t flags = KeyrangeFlags(e);
uint32_t val = KeyrangeVal(e);
return (l->minVal <= val && val <= l->maxVal && (flags | l->minFlags) == flags && ((flags & ~l->maxFlags) == 0));
}
/* Function : createKeyrange */
static KeyrangeList **createKeyrange(KeyrangeList **p, uint32_t minFlags, uint32_t minVal, uint32_t maxFlags, uint32_t maxVal, KeyrangeList *n)
{
KeyrangeList *c = malloc(sizeof(KeyrangeList));
if (c==NULL) return NULL;
c->minFlags = minFlags; c->minVal = minVal;
c->maxFlags = maxFlags; c->maxVal = maxVal;
c->next = n;
*p = c;
return &c->next;
}
/* Function : freeKeyrange */
static void freeKeyrange(KeyrangeList **p, KeyrangeList *c)
{
if (c==NULL) return;
*p = c->next;
free(c);
}
/* Function : freeKeyrangeList */
void freeKeyrangeList(KeyrangeList **l)
{
KeyrangeList *p1, *p2;
if (l==NULL) return;
p2 = *l;
while (p2!=NULL) {
p1 = p2;
p2 = p1->next;
free(p1);
}
*l = NULL;
}
/* Function : inKeyrangeList */
KeyrangeList *inKeyrangeList(KeyrangeList *l, KeyrangeElem n)
{
KeyrangeList *c = l;
while (c!=NULL) {
if (inKeyrange(c, n)) return c;
c = c->next;
}
return NULL;
}
/* Function : DisplayKeyrangeList */
void DisplayKeyrangeList(KeyrangeList *l)
{
if (l==NULL) printf("emptyset");
else {
KeyrangeList *c = l;
while (1) {
printf("[%lx(%lx)..%lx(%lx)]",(unsigned long)c->minVal,(unsigned long)c->minFlags,(unsigned long)c->maxVal,(unsigned long)c->maxFlags);
if (c->next==NULL) break;
printf(",");
c = c->next;
}
}
printf("\n");
}
/* Function : addKeyrange */
int addKeyrange(KeyrangeElem x0, KeyrangeElem y0, KeyrangeList **l)
{
KeyrangeList *c;
uint32_t minFlags = KeyrangeFlags(x0) & KeyrangeFlags(y0);
uint32_t maxFlags = KeyrangeFlags(x0) | KeyrangeFlags(y0);
uint32_t minVal = MIN(KeyrangeVal(x0), KeyrangeVal(y0));
uint32_t maxVal = MAX(KeyrangeVal(x0), KeyrangeVal(y0));
KeyrangeElem min = KeyrangeElem(minFlags, minVal);
KeyrangeElem max = KeyrangeElem(maxFlags, maxVal);
logMessage(LOG_CATEGORY(SERVER_EVENTS) | LOG_DEBUG,
"adding range [%"PRIx32"(%"PRIx32")..%"PRIx32"(%"PRIx32")]",
minVal, minFlags, maxVal, maxFlags
);
c = *l;
while (c) {
if (inKeyrange(c, min) && inKeyrange(c, max))
/* Falls completely within an existing range */
return 0;
if (c->minVal <= maxVal && maxVal <= c->maxVal && minFlags == c->minFlags && maxFlags == c->maxFlags) {
/* May just change lower bound */
/* Note that minVal can't be >= c->minVal */
c->minVal = minVal;
return 0;
}
if (c->minVal <= minVal && minVal <= c->maxVal && minFlags == c->minFlags && maxFlags == c->maxFlags) {
/* May just change upper bound */
/* Note that maxVal can't be <= c->maxVal */
c->maxVal = maxVal;
return 0;
}
c = c->next;
}
/* Else things are not easy, just add */
if ((createKeyrange(l,minFlags,minVal,maxFlags,maxVal,*l)) == NULL) return -1;
return 0;
}
int removeKeyrange(KeyrangeElem x0, KeyrangeElem y0, KeyrangeList **l)
{
uint32_t minFlags = KeyrangeFlags(x0) & KeyrangeFlags(y0);
uint32_t maxFlags = KeyrangeFlags(x0) | KeyrangeFlags(y0);
uint32_t minVal = MIN(KeyrangeVal(x0), KeyrangeVal(y0));
uint32_t maxVal = MAX(KeyrangeVal(x0), KeyrangeVal(y0));
KeyrangeList *c, **p, *tmp;
int i;
if ((l==NULL) || (*l==NULL)) return 0;
logMessage(LOG_CATEGORY(SERVER_EVENTS) | LOG_DEBUG,
"removing range [%"PRIx32"(%"PRIx32")..%"PRIx32"(%"PRIx32")]",
minVal, minFlags, maxVal, maxFlags
);
/* Need to intersect with every range */
p = l; c = *p;
while (c) {
if (c->minVal > maxVal || c->maxVal < minVal ||
!(c->maxFlags | ~minFlags) || !(~c->minFlags | maxFlags)) {
/* don't intersect */
p = &c->next;
c = *p;
continue;
}
if (minVal <= c->minVal && maxVal >= c->maxVal &&
(c->minFlags | minFlags) == c->minFlags &&
(c->maxFlags & ~maxFlags) == 0) {
/* range falls completely in deletion range, just drop it */
tmp = c; c = c->next;
freeKeyrange(p,tmp);
continue;
}
/* Partly intersect */
if (c->minVal < minVal) {
/* lower part should be kept intact, save it. */
p = createKeyrange(p, c->minFlags, c->minVal, c->maxFlags, minVal - 1, c);
if (p == NULL) return -1;
c->minVal = minVal;
}
if (c->maxVal > maxVal) {
/* upper part should be kept intact, save it. */
p = createKeyrange(p, c->minFlags, maxVal + 1, c->maxFlags, c->maxVal, c);
if (p == NULL) return -1;
c->maxVal = maxVal;
}
/* Now values are the same, tinker with flags */
for (i=0; i<32; i++) {
uint32_t mask = 1U<<i;
if ((!(c->maxFlags & mask) && (minFlags & mask)) ||
( (c->minFlags & mask) && !(maxFlags & mask)))
/* don't intersect on this flag */
continue;
if (!(c->minFlags & mask) && (minFlags & mask)) {
/* && (c->maxFlags & mask) */
/* part without flag i should be kept intact, save it */
p = createKeyrange(p, c->minFlags, c->minVal, c->maxFlags & ~mask, c->maxVal, c);
if (p == NULL) return -1;
/* now handling part with flag i */
c->minFlags |= mask;
}
if ( (c->maxFlags & mask) && !(maxFlags & mask)) {
/* && !(c->minFlags & mask) */
/* part with flag i should be kept intact, save it */
p = createKeyrange(p, c->minFlags | mask, c->minVal, c->maxFlags, c->maxVal, c);
if (p == NULL) return -1;
/* now handling part without flag i */
c->maxFlags &= ~mask;
}
if (!(c->maxFlags | ~minFlags) || !(~c->minFlags | maxFlags))
/* don't intersect any more*/
break;
}
if (i<32) {
/* don't intersect any more, keep it */
break;
} else {
/* remaining intersection, drop it */
tmp = c; c = c->next;
freeKeyrange(p,tmp);
}
}
return 0;
}
|