Lev Walkin | 4efbfb7 | 2005-02-25 14:20:30 +0000 | [diff] [blame] | 1 | #include "asn1fix_internal.h" |
| 2 | #include "asn1fix_constraint.h" |
| 3 | #include "asn1fix_crange.h" |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 4 | |
| 5 | #undef FATAL |
| 6 | #define FATAL(fmt, args...) do { \ |
| 7 | fprintf(stderr, "FATAL: "); \ |
| 8 | fprintf(stderr, fmt, ##args); \ |
| 9 | fprintf(stderr, "\n"); \ |
| 10 | } while(0) |
| 11 | |
| 12 | void |
| 13 | asn1constraint_range_free(asn1cnst_range_t *cr) { |
| 14 | if(cr) { |
| 15 | int i; |
| 16 | if(cr->elements) { |
| 17 | for(i = 0; i < cr->el_count; i++) |
| 18 | asn1constraint_range_free(cr->elements[i]); |
| 19 | free(cr->elements); |
| 20 | } |
| 21 | free(cr); |
| 22 | } |
| 23 | } |
| 24 | #define _range_free(foo) asn1constraint_range_free(foo) |
| 25 | |
| 26 | static asn1cnst_range_t *_range_new() { |
| 27 | asn1cnst_range_t *r; |
| 28 | r = calloc(1, sizeof(*r)); |
| 29 | if(r) { |
| 30 | r->left.type = ARE_MIN; |
| 31 | r->right.type = ARE_MAX; |
| 32 | } |
| 33 | return r; |
| 34 | } |
| 35 | |
| 36 | static void _range_remove_element(asn1cnst_range_t *range, int idx) { |
| 37 | assert(idx >= 0 && idx < range->el_count); |
| 38 | |
| 39 | assert(!range->elements[idx]->elements); |
| 40 | |
| 41 | _range_free(range->elements[idx]); |
| 42 | |
| 43 | memmove(&range->elements[idx], |
| 44 | &range->elements[idx + 1], |
| 45 | (range->el_count - idx - 1) |
| 46 | * sizeof(range->elements[0]) |
| 47 | ); |
| 48 | range->el_count--; |
| 49 | range->elements[range->el_count] = 0; /* JIC */ |
| 50 | |
| 51 | if(range->el_count == 0) { |
| 52 | range->el_size = 0; |
| 53 | free(range->elements); |
| 54 | range->elements = 0; |
| 55 | } |
| 56 | } |
| 57 | |
| 58 | static int _range_insert(asn1cnst_range_t *into, asn1cnst_range_t *cr) { |
| 59 | |
| 60 | assert(!cr->elements); |
| 61 | |
| 62 | if(into->el_count == into->el_size) { |
| 63 | void *p; |
| 64 | int n = into->el_size?(into->el_size << 1):4; |
| 65 | p = realloc(into->elements, n * sizeof(into->elements[0])); |
| 66 | if(p) { |
| 67 | into->el_size = n; |
| 68 | into->elements = p; |
| 69 | } else { |
| 70 | assert(p); |
| 71 | return -1; |
| 72 | } |
| 73 | } |
| 74 | |
| 75 | into->elements[into->el_count++] = cr; |
| 76 | return 0; |
| 77 | } |
| 78 | |
| 79 | static asn1cnst_range_t *_range_clone(const asn1cnst_range_t *range) { |
| 80 | asn1cnst_range_t *clone; |
| 81 | int i; |
| 82 | |
| 83 | clone = _range_new(); |
| 84 | if(!clone) return NULL; |
| 85 | |
| 86 | *clone = *range; |
| 87 | clone->elements = 0; |
| 88 | clone->el_count = 0; |
| 89 | clone->el_size = 0; |
| 90 | |
| 91 | for(i = 0; i < range->el_count; i++) { |
| 92 | asn1cnst_range_t *r = _range_clone(range->elements[i]); |
| 93 | if(!r || _range_insert(clone, r)) { |
| 94 | _range_free(clone); |
| 95 | _range_free(r); |
| 96 | return NULL; |
| 97 | } |
| 98 | } |
| 99 | |
| 100 | return clone; |
| 101 | } |
| 102 | |
| 103 | static int |
| 104 | _edge_compare(const asn1cnst_edge_t *el, const asn1cnst_edge_t *er) { |
| 105 | |
| 106 | switch(el->type) { |
| 107 | case ARE_MIN: |
| 108 | switch(er->type) { |
| 109 | case ARE_MIN: return 0; |
| 110 | case ARE_MAX: return -1; |
| 111 | case ARE_VALUE: return -1; |
| 112 | } |
| 113 | break; |
| 114 | case ARE_MAX: |
| 115 | switch(er->type) { |
| 116 | case ARE_MIN: return 1; |
| 117 | case ARE_MAX: return 0; |
| 118 | case ARE_VALUE: return 1; |
| 119 | } |
| 120 | break; |
| 121 | case ARE_VALUE: |
| 122 | switch(er->type) { |
| 123 | case ARE_MIN: return 1; |
| 124 | case ARE_MAX: return -1; |
| 125 | case ARE_VALUE: |
| 126 | if(el->value < er->value) |
| 127 | return -1; |
| 128 | if(el->value > er->value) |
| 129 | return 1; |
| 130 | return 0; |
| 131 | } |
| 132 | break; |
| 133 | } |
| 134 | |
| 135 | return 0; |
| 136 | } |
| 137 | |
| 138 | static int |
| 139 | _range_compare(const void *a, const void *b) { |
| 140 | const asn1cnst_range_t *ra = *(const asn1cnst_range_t * const *)a; |
| 141 | const asn1cnst_range_t *rb = *(const asn1cnst_range_t * const *)b; |
| 142 | int ret; |
| 143 | |
| 144 | ret = _edge_compare(&ra->left, &rb->left); |
| 145 | if(!ret) { |
| 146 | ret = _edge_compare(&ra->right, &rb->right); |
| 147 | } |
| 148 | |
| 149 | return ret; |
| 150 | } |
| 151 | |
| 152 | static char * |
| 153 | _edge_value(const asn1cnst_edge_t *edge) { |
| 154 | static char buf[128]; |
| 155 | *buf = '\0'; |
| 156 | switch(edge->type) { |
| 157 | case ARE_MIN: strcpy(buf, "MIN"); break; |
| 158 | case ARE_MAX: strcpy(buf, "MAX"); break; |
| 159 | case ARE_VALUE: |
Lev Walkin | 33c16ba | 2004-09-24 21:01:43 +0000 | [diff] [blame] | 160 | snprintf(buf, sizeof(buf), "%" PRIdASN, edge->value); |
Lev Walkin | 3b2278a | 2016-01-24 16:43:50 -0800 | [diff] [blame] | 161 | break; |
| 162 | default: |
| 163 | assert(!"edge->type"); |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 164 | } |
| 165 | return buf; |
| 166 | } |
| 167 | |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 168 | static int |
| 169 | _edge_is_within(const asn1cnst_range_t *range, const asn1cnst_edge_t *edge) { |
| 170 | int i; |
| 171 | |
| 172 | for(i = -1; i < range->el_count; i++) { |
| 173 | const asn1cnst_range_t *r; |
| 174 | if(i == -1) { |
| 175 | if(range->el_count) continue; |
| 176 | r = range; |
| 177 | } else { |
| 178 | r = range->elements[i]; |
| 179 | } |
| 180 | if(_edge_compare(&r->left, edge) <= 0 |
| 181 | && _edge_compare(&r->right, edge) >= 0) |
| 182 | return 1; |
| 183 | } |
| 184 | |
| 185 | return 0; |
| 186 | } |
| 187 | |
| 188 | static int |
| 189 | _check_edges_within(const asn1cnst_range_t *range, const asn1cnst_range_t *r) { |
| 190 | |
| 191 | if(!_edge_is_within(range, &r->left)) { |
| 192 | FATAL("Constraint value %s at line %d " |
| 193 | "is not within " |
| 194 | "a parent constraint range", |
| 195 | _edge_value(&r->left), |
| 196 | r->left.lineno |
| 197 | ); |
| 198 | return -1; |
| 199 | } |
| 200 | |
| 201 | if(!_edge_is_within(range, &r->right)) { |
| 202 | FATAL("Constraint value %s at line %d " |
| 203 | "is not within " |
| 204 | "a parent constraint range", |
| 205 | _edge_value(&r->right), |
| 206 | r->right.lineno |
| 207 | ); |
| 208 | return -1; |
| 209 | } |
| 210 | |
| 211 | return 0; |
| 212 | } |
| 213 | |
| 214 | static int _range_merge_in(asn1cnst_range_t *into, asn1cnst_range_t *cr) { |
| 215 | asn1cnst_range_t *r; |
| 216 | int prev_count = into->el_count; |
| 217 | int i; |
| 218 | |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 219 | into->not_PER_visible |= cr->not_PER_visible; |
| 220 | into->extensible |= cr->extensible; |
| 221 | |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 222 | /* |
| 223 | * Add the element OR all its children "into". |
| 224 | */ |
| 225 | for(i = -1; i < cr->el_count; i++) { |
| 226 | |
| 227 | if(i == -1) { |
| 228 | if(cr->el_count) continue; |
| 229 | r = cr; |
| 230 | } else { |
| 231 | r = cr->elements[i]; |
| 232 | } |
| 233 | |
| 234 | if(_range_insert(into, r)) { |
| 235 | into->el_count = prev_count; /* Undo */ |
| 236 | return -1; |
| 237 | } |
| 238 | } |
| 239 | |
| 240 | if(cr->el_count) { |
| 241 | cr->el_count = 0; |
| 242 | _range_free(cr); |
| 243 | } else { |
| 244 | /* This range is linked into "into". */ |
| 245 | } |
| 246 | |
| 247 | return 0; |
| 248 | } |
| 249 | |
| 250 | static int _range_fill(asn1p_value_t *val, const asn1cnst_range_t *minmax, asn1cnst_edge_t *edge, asn1cnst_range_t *range, enum asn1p_constraint_type_e type, int lineno) { |
| 251 | unsigned char *p, *pend; |
| 252 | |
| 253 | edge->lineno = lineno; |
| 254 | |
| 255 | switch(val->type) { |
| 256 | case ATV_INTEGER: |
| 257 | if(type != ACT_EL_RANGE && type != ACT_CT_SIZE) { |
Lev Walkin | 33c16ba | 2004-09-24 21:01:43 +0000 | [diff] [blame] | 258 | FATAL("Integer %" PRIdASN " value invalid " |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 259 | "for %s constraint at line %d", |
Lev Walkin | 33c16ba | 2004-09-24 21:01:43 +0000 | [diff] [blame] | 260 | val->value.v_integer, |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 261 | asn1p_constraint_type2str(type), lineno); |
| 262 | return -1; |
| 263 | } |
| 264 | edge->type = ARE_VALUE; |
| 265 | edge->value = val->value.v_integer; |
| 266 | return 0; |
| 267 | case ATV_MIN: |
| 268 | if(type != ACT_EL_RANGE && type != ACT_CT_SIZE) { |
| 269 | FATAL("MIN invalid for %s constraint at line %d", |
| 270 | asn1p_constraint_type2str(type), lineno); |
| 271 | return -1; |
| 272 | } |
| 273 | edge->type = ARE_MIN; |
| 274 | if(minmax) *edge = minmax->left; |
| 275 | edge->lineno = lineno; /* Restore lineno */ |
| 276 | return 0; |
| 277 | case ATV_MAX: |
| 278 | if(type != ACT_EL_RANGE && type != ACT_CT_SIZE) { |
| 279 | FATAL("MAX invalid for %s constraint at line %d", |
| 280 | asn1p_constraint_type2str(type), lineno); |
| 281 | return -1; |
| 282 | } |
| 283 | edge->type = ARE_MAX; |
| 284 | if(minmax) *edge = minmax->right; |
| 285 | edge->lineno = lineno; /* Restore lineno */ |
| 286 | return 0; |
| 287 | case ATV_FALSE: |
| 288 | case ATV_TRUE: |
| 289 | if(type != ACT_EL_RANGE) { |
| 290 | FATAL("%s is invalid for %s constraint at line %d", |
| 291 | val->type==ATV_TRUE?"TRUE":"FALSE", |
| 292 | asn1p_constraint_type2str(type), |
| 293 | lineno); |
| 294 | return -1; |
| 295 | } |
| 296 | edge->type = ARE_VALUE; |
| 297 | edge->value = (val->type==ATV_TRUE); |
| 298 | return 0; |
Lev Walkin | 1e448d3 | 2005-03-24 14:26:38 +0000 | [diff] [blame] | 299 | case ATV_TUPLE: |
| 300 | case ATV_QUADRUPLE: |
| 301 | edge->type = ARE_VALUE; |
| 302 | edge->value = val->value.v_integer; |
| 303 | return 0; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 304 | case ATV_STRING: |
| 305 | if(type != ACT_CT_FROM) |
| 306 | return 0; |
| 307 | break; |
Lev Walkin | 1ef0516 | 2004-08-25 00:42:25 +0000 | [diff] [blame] | 308 | case ATV_REFERENCED: |
Lev Walkin | fd97d5e | 2004-09-15 11:45:44 +0000 | [diff] [blame] | 309 | FATAL("Unresolved constraint element \"%s\" at line %d", |
Lev Walkin | 1ef0516 | 2004-08-25 00:42:25 +0000 | [diff] [blame] | 310 | asn1f_printable_reference(val->value.reference), |
| 311 | lineno); |
| 312 | return -1; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 313 | default: |
| 314 | FATAL("Unrecognized constraint element at line %d", |
| 315 | lineno); |
| 316 | return -1; |
| 317 | } |
| 318 | |
| 319 | assert(val->type == ATV_STRING); |
| 320 | |
| 321 | p = val->value.string.buf; |
| 322 | pend = p + val->value.string.size; |
| 323 | if(p == pend) return 0; |
| 324 | |
| 325 | edge->type = ARE_VALUE; |
| 326 | if(val->value.string.size == 1) { |
| 327 | edge->value = *p; |
| 328 | } else { |
| 329 | /* |
| 330 | * Else this is a set: |
| 331 | * (FROM("abcdef")) |
| 332 | * However, (FROM("abc".."def")) is forbidden. |
| 333 | * See also 47.4.4. |
| 334 | */ |
Lev Walkin | b8108ec | 2004-09-29 13:17:17 +0000 | [diff] [blame] | 335 | asn1c_integer_t vmin, vmax; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 336 | vmin = vmax = *p; |
| 337 | for(; p < pend; p++) { |
| 338 | asn1cnst_range_t *nr = _range_new(); |
| 339 | int ret; |
| 340 | assert(nr); |
| 341 | |
| 342 | if(*p < vmin) vmin = *p; |
| 343 | if(*p > vmax) vmax = *p; |
| 344 | |
| 345 | ret = _range_insert(range, nr); |
| 346 | assert(ret == 0); |
| 347 | |
| 348 | nr->left.type = ARE_VALUE; |
| 349 | nr->left.value = *p; |
| 350 | nr->left.lineno = lineno; |
| 351 | nr->right = nr->left; |
| 352 | } |
| 353 | edge->value = (edge == &range->right) ? vmin : vmax; |
| 354 | } |
| 355 | |
| 356 | return 0; |
| 357 | } |
| 358 | |
| 359 | /* |
| 360 | * Check if ranges contain common elements. |
| 361 | */ |
| 362 | static int |
| 363 | _range_overlap(const asn1cnst_range_t *ra, const asn1cnst_range_t *rb) { |
| 364 | int lr, rl; |
| 365 | const asn1cnst_edge_t *ra_l = &ra->left; |
| 366 | const asn1cnst_edge_t *ra_r = &ra->right; |
| 367 | const asn1cnst_edge_t *rb_l = &rb->left; |
| 368 | const asn1cnst_edge_t *rb_r = &rb->right; |
| 369 | |
| 370 | assert(_edge_compare(ra_l, ra_r) <= 0); |
| 371 | assert(_edge_compare(rb_l, rb_r) <= 0); |
| 372 | |
| 373 | lr = _edge_compare(ra_l, rb_r); |
| 374 | rl = _edge_compare(ra_r, rb_l); |
| 375 | |
| 376 | /* |
| 377 | * L: |---| |
| 378 | * R: |---| |
| 379 | */ |
| 380 | if(lr > 0) return 0; |
| 381 | |
| 382 | /* |
| 383 | * L: |---| |
| 384 | * R: |---| |
| 385 | */ |
| 386 | if(rl < 0) return 0; |
| 387 | |
| 388 | return 1; |
| 389 | } |
| 390 | |
Lev Walkin | 3b2278a | 2016-01-24 16:43:50 -0800 | [diff] [blame] | 391 | |
| 392 | static int _range_partial_compare(const void *pa, const void *pb) { |
| 393 | const asn1cnst_range_t *ra = *(const void * const *)pa; |
| 394 | const asn1cnst_range_t *rb = *(const void * const *)pb; |
| 395 | |
| 396 | return _edge_compare(&ra->left, &rb->left); |
| 397 | } |
| 398 | |
| 399 | static void _range_partial_sort_elements(asn1cnst_range_t *r) { |
| 400 | qsort(r->elements, r->el_count, sizeof(r->elements[0]), |
| 401 | _range_partial_compare); |
| 402 | } |
| 403 | |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 404 | /* |
| 405 | * (MIN..20) x (10..15) = (MIN..9,10..15,16..20) |
| 406 | */ |
| 407 | static asn1cnst_range_t * |
| 408 | _range_split(asn1cnst_range_t *ra, const asn1cnst_range_t *rb) { |
| 409 | asn1cnst_range_t *range, *nr; |
| 410 | int ll, rr; |
| 411 | |
| 412 | assert(ra); |
| 413 | assert(rb); |
| 414 | assert(!ra->el_count); |
| 415 | assert(!rb->el_count); |
| 416 | |
| 417 | if(!_range_overlap(ra, rb)) { |
| 418 | errno = 0; |
| 419 | return 0; |
| 420 | } |
| 421 | |
| 422 | ll = _edge_compare(&ra->left, &rb->left); |
| 423 | rr = _edge_compare(&ra->right, &rb->right); |
| 424 | |
| 425 | /* |
| 426 | * L: |---| |
| 427 | * R: |-------| |
| 428 | */ |
| 429 | if(ll >= 0 && rr <= 0) { |
| 430 | errno = 0; |
| 431 | return 0; |
| 432 | } |
| 433 | |
| 434 | range = _range_new(); |
| 435 | assert(range); |
| 436 | |
| 437 | nr = _range_new(); |
| 438 | assert(nr); |
| 439 | |
| 440 | /* |
| 441 | * L: |---... |
| 442 | * R: |--.. |
| 443 | */ |
Lev Walkin | 88693e8 | 2005-05-17 21:46:18 +0000 | [diff] [blame] | 444 | while(ll < 0) { |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 445 | nr->left = ra->left; |
| 446 | nr->right = rb->left; |
Lev Walkin | 88693e8 | 2005-05-17 21:46:18 +0000 | [diff] [blame] | 447 | if(nr->right.type == ARE_VALUE) { |
Lev Walkin | 3b2278a | 2016-01-24 16:43:50 -0800 | [diff] [blame] | 448 | if(nr->right.value == INTMAX_MIN) { |
Lev Walkin | 88693e8 | 2005-05-17 21:46:18 +0000 | [diff] [blame] | 449 | /* We've hit the limit here. */ |
| 450 | break; |
| 451 | } |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 452 | nr->right.value--; |
Lev Walkin | 88693e8 | 2005-05-17 21:46:18 +0000 | [diff] [blame] | 453 | } |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 454 | _range_insert(range, nr); |
| 455 | nr = _range_new(); |
| 456 | assert(nr); |
Lev Walkin | 88693e8 | 2005-05-17 21:46:18 +0000 | [diff] [blame] | 457 | break; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 458 | } |
| 459 | |
| 460 | /* |
| 461 | * L: ...---| |
| 462 | * R: ..--| |
| 463 | */ |
Lev Walkin | 88693e8 | 2005-05-17 21:46:18 +0000 | [diff] [blame] | 464 | while(rr > 0) { |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 465 | nr->left = rb->right; |
| 466 | nr->right = ra->right; |
Lev Walkin | 88693e8 | 2005-05-17 21:46:18 +0000 | [diff] [blame] | 467 | if(nr->left.type == ARE_VALUE) { |
Lev Walkin | 3b2278a | 2016-01-24 16:43:50 -0800 | [diff] [blame] | 468 | if(nr->left.value == INTMAX_MAX) { |
Lev Walkin | 88693e8 | 2005-05-17 21:46:18 +0000 | [diff] [blame] | 469 | /* We've hit the limit here. */ |
| 470 | break; |
| 471 | } |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 472 | nr->left.value++; |
Lev Walkin | 88693e8 | 2005-05-17 21:46:18 +0000 | [diff] [blame] | 473 | } |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 474 | _range_insert(range, nr); |
| 475 | nr = _range_new(); |
| 476 | assert(nr); |
Lev Walkin | 88693e8 | 2005-05-17 21:46:18 +0000 | [diff] [blame] | 477 | break; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 478 | } |
| 479 | |
| 480 | /* |
| 481 | * L: |---| |
| 482 | * R: |-----| |
| 483 | */ |
| 484 | nr->left = ra->left; |
| 485 | nr->right = ra->right; |
| 486 | if(_edge_compare(&ra->left, &rb->left) < 0) |
| 487 | nr->left = rb->left; |
| 488 | if(_edge_compare(&ra->right, &rb->right) > 0) |
| 489 | nr->right = rb->right; |
| 490 | |
| 491 | _range_insert(range, nr); |
| 492 | |
Lev Walkin | 3b2278a | 2016-01-24 16:43:50 -0800 | [diff] [blame] | 493 | _range_partial_sort_elements(range); |
| 494 | |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 495 | return range; |
| 496 | } |
| 497 | |
| 498 | static int |
| 499 | _range_intersection(asn1cnst_range_t *range, const asn1cnst_range_t *with, int strict_edge_check) { |
| 500 | int ret; |
| 501 | int i, j; |
| 502 | |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 503 | assert(!range->incompatible); |
| 504 | |
| 505 | /* Propagate errors */ |
| 506 | range->extensible |= with->extensible; |
| 507 | range->not_PER_visible |= with->not_PER_visible; |
| 508 | range->empty_constraint |= with->empty_constraint; |
| 509 | |
| 510 | if(range->empty_constraint) { |
| 511 | /* No use in intersecting empty constraints */ |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 512 | return 0; |
| 513 | } |
| 514 | |
| 515 | /* |
| 516 | * This is an AND operation. |
| 517 | */ |
| 518 | |
| 519 | /* If this is the only element, insert it into itself as a child */ |
| 520 | if(range->el_count == 0) { |
| 521 | asn1cnst_range_t *r = _range_new(); |
| 522 | r->left = range->left; |
| 523 | r->right = range->right; |
| 524 | _range_insert(range, r); |
| 525 | assert(range->el_count == 1); |
| 526 | } |
| 527 | |
| 528 | /* |
| 529 | * Make sure we're dealing with sane data. |
| 530 | * G.4.2.3 |
| 531 | */ |
| 532 | if(strict_edge_check) { |
| 533 | for(j = -1; j < with->el_count; j++) { |
| 534 | |
| 535 | if(j == -1) { |
| 536 | if(with->el_count) continue; |
| 537 | if(_check_edges_within(range, with)) |
| 538 | return -1; |
| 539 | } else { |
| 540 | if(_check_edges_within(range, |
| 541 | with->elements[j])) |
| 542 | return -1; |
| 543 | } |
| 544 | } |
| 545 | } |
| 546 | |
| 547 | /* |
| 548 | * Split range in pieces. |
| 549 | */ |
| 550 | |
| 551 | for(i = 0; i < range->el_count; i++) { |
| 552 | for(j = -1; j < with->el_count; j++) { |
| 553 | const asn1cnst_range_t *wel; |
| 554 | asn1cnst_range_t *r; |
| 555 | |
| 556 | if(j == -1) { |
| 557 | if(with->el_count) continue; |
| 558 | wel = with; |
| 559 | } else { |
| 560 | wel = with->elements[j]; |
Lev Walkin | 88693e8 | 2005-05-17 21:46:18 +0000 | [diff] [blame] | 561 | assert(!wel->el_count); /* non-compound item! */ |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 562 | } |
| 563 | |
| 564 | r = _range_split(range->elements[i], wel); |
| 565 | if(r) { |
| 566 | int ec; |
| 567 | /* Substitute the current element with a split */ |
| 568 | _range_remove_element(range, i); |
| 569 | assert(r->el_count); |
| 570 | for(ec = 0; ec < r->el_count; ec++) { |
| 571 | ret = _range_insert(range, r->elements[ec]); |
| 572 | assert(ret == 0); |
| 573 | } |
| 574 | r->el_count = 0; |
| 575 | _range_free(r); |
| 576 | i--; |
| 577 | break; /* Try again from this point */ |
| 578 | } |
| 579 | } |
| 580 | } |
| 581 | |
| 582 | assert(range->el_count); |
| 583 | |
| 584 | /* |
| 585 | * Remove pieces which aren't AND-compatible "with" range. |
| 586 | */ |
| 587 | |
| 588 | for(i = 0; i < range->el_count; i++) { |
| 589 | for(j = -1; j < with->el_count; j++) { |
| 590 | const asn1cnst_range_t *wel; |
| 591 | |
| 592 | if(j == -1) { |
| 593 | if(with->el_count) continue; |
| 594 | wel = with; |
| 595 | } else { |
| 596 | wel = with->elements[j]; |
| 597 | } |
| 598 | |
| 599 | if(_range_overlap(range->elements[i], wel)) |
| 600 | break; |
| 601 | } |
| 602 | if(j == with->el_count) { |
| 603 | _range_remove_element(range, i); |
| 604 | i--; |
| 605 | } |
| 606 | } |
| 607 | |
| 608 | if(range->el_count == 0) |
| 609 | range->empty_constraint = 1; |
| 610 | |
| 611 | return 0; |
| 612 | } |
| 613 | |
| 614 | static int |
| 615 | _range_union(asn1cnst_range_t *range) { |
| 616 | int i; |
| 617 | |
| 618 | qsort(range->elements, range->el_count, sizeof(range->elements[0]), |
| 619 | _range_compare); |
| 620 | |
| 621 | /* |
| 622 | * The range is sorted by the start values. |
| 623 | */ |
| 624 | for(i = 1; i < range->el_count; i++) { |
| 625 | asn1cnst_range_t *ra = range->elements[i - 1]; |
| 626 | asn1cnst_range_t *rb = range->elements[i]; |
| 627 | |
| 628 | if(_range_overlap(ra, rb)) { |
| 629 | if(_edge_compare(&ra->left, &rb->left) < 0) |
| 630 | rb->left = ra->left; |
| 631 | |
| 632 | if(_edge_compare(&ra->right, &rb->right) > 0) |
| 633 | rb->right = ra->right; |
| 634 | } else { |
| 635 | /* |
| 636 | * Still, range may be joined: (1..4)(5..10). |
| 637 | * This logic is valid only for whole numbers |
| 638 | * (i.e., not REAL type, but REAL constraints |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 639 | * are not PER-visible (X.691, #9.3.12). |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 640 | */ |
| 641 | if(ra->right.type == ARE_VALUE |
| 642 | && rb->left.type == ARE_VALUE |
| 643 | && (rb->left.value - ra->right.value) == 1) { |
| 644 | /* (1..10) */ |
| 645 | rb->left = ra->left; |
| 646 | } else { |
| 647 | continue; |
| 648 | } |
| 649 | } |
| 650 | |
| 651 | /* |
| 652 | * Squeeze the array by removing the ra. |
| 653 | */ |
| 654 | _range_remove_element(range, i - 1); |
| 655 | |
| 656 | i--; /* Retry from the current point */ |
| 657 | } |
| 658 | |
| 659 | return 0; |
| 660 | } |
| 661 | |
| 662 | static int |
| 663 | _range_canonicalize(asn1cnst_range_t *range) { |
| 664 | |
| 665 | if(range->el_count == 0) { |
| 666 | /* |
| 667 | * Switch left and right edges, make them sorted. |
| 668 | * It might be a mild warning though. |
| 669 | */ |
| 670 | if(_edge_compare(&range->left, &range->right) > 0) { |
| 671 | asn1cnst_edge_t tmp = range->left; |
| 672 | range->left = range->right; |
| 673 | range->right = tmp; |
| 674 | } |
| 675 | |
Markus Elfring | f3d1861 | 2016-03-15 08:35:24 +0100 | [diff] [blame] | 676 | free(range->elements); |
| 677 | range->elements = 0; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 678 | range->el_size = 0; |
| 679 | return 0; |
| 680 | } |
| 681 | |
| 682 | /* |
| 683 | * Remove duplicates and overlaps by merging them in. |
| 684 | */ |
| 685 | _range_union(range); |
| 686 | |
| 687 | /* Refine the left edge of a parent */ |
| 688 | range->left = range->elements[0]->left; |
| 689 | |
| 690 | /* Refine the right edge of a parent */ |
| 691 | range->right = range->elements[range->el_count - 1]->right; |
| 692 | |
| 693 | /* Remove the child, if it's a single one */ |
| 694 | if(range->el_count == 1) { |
| 695 | _range_remove_element(range, 0); |
| 696 | } |
| 697 | |
| 698 | return 0; |
| 699 | } |
| 700 | |
| 701 | asn1cnst_range_t * |
Lev Walkin | 4b55341 | 2005-08-14 14:45:44 +0000 | [diff] [blame] | 702 | asn1constraint_compute_PER_range(asn1p_expr_type_e expr_type, const asn1p_constraint_t *ct, enum asn1p_constraint_type_e type, const asn1cnst_range_t *minmax, int *exmet, enum cpr_flags cpr_flags) { |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 703 | asn1cnst_range_t *range; |
| 704 | asn1cnst_range_t *tmp; |
| 705 | asn1p_value_t *vmin; |
| 706 | asn1p_value_t *vmax; |
| 707 | int expectation_met; |
Lev Walkin | d541c25 | 2004-09-05 10:36:22 +0000 | [diff] [blame] | 708 | unsigned int i; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 709 | int ret; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 710 | |
| 711 | if(!exmet) { |
| 712 | exmet = &expectation_met; |
| 713 | *exmet = 0; |
| 714 | } |
| 715 | |
| 716 | /* |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 717 | * Check if the requested constraint is theoretically compatible |
| 718 | * with the given expression type. |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 719 | */ |
Lev Walkin | 4b55341 | 2005-08-14 14:45:44 +0000 | [diff] [blame] | 720 | if(asn1constraint_compatible(expr_type, type, |
| 721 | cpr_flags & CPR_simulate_fbless_SIZE) != 1) { |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 722 | errno = EINVAL; |
| 723 | return 0; |
| 724 | } |
| 725 | |
| 726 | /* Check arguments' validity. */ |
| 727 | switch(type) { |
| 728 | case ACT_EL_RANGE: |
| 729 | if(exmet == &expectation_met) |
| 730 | *exmet = 1; |
| 731 | break; |
| 732 | case ACT_CT_FROM: |
| 733 | if(!minmax) { |
| 734 | minmax = asn1constraint_default_alphabet(expr_type); |
| 735 | if(minmax) { |
| 736 | break; |
| 737 | } |
| 738 | } |
| 739 | /* Fall through */ |
| 740 | case ACT_CT_SIZE: |
| 741 | if(!minmax) { |
| 742 | static asn1cnst_range_t mm; |
| 743 | mm.left.type = ARE_VALUE; |
| 744 | mm.left.value = 0; |
| 745 | mm.right.type = ARE_MAX; |
| 746 | minmax = &mm; |
| 747 | } |
| 748 | break; |
| 749 | default: |
| 750 | errno = EINVAL; |
| 751 | return 0; |
| 752 | } |
| 753 | |
| 754 | if(minmax) { |
| 755 | range = _range_clone(minmax); |
| 756 | } else { |
| 757 | range = _range_new(); |
| 758 | } |
| 759 | |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 760 | /* |
| 761 | * X.691, #9.3.6 |
| 762 | * Constraints on restricter character string types |
| 763 | * which are not known-multiplier are not PER-visible. |
| 764 | */ |
| 765 | if((expr_type & ASN_STRING_NKM_MASK)) |
| 766 | range->not_PER_visible = 1; |
| 767 | |
Lev Walkin | 4b55341 | 2005-08-14 14:45:44 +0000 | [diff] [blame] | 768 | if(!ct |
| 769 | || (range->not_PER_visible && (cpr_flags & CPR_strict_PER_visibility))) |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 770 | return range; |
| 771 | |
| 772 | switch(ct->type) { |
| 773 | case ACT_EL_VALUE: |
| 774 | vmin = vmax = ct->value; |
| 775 | break; |
| 776 | case ACT_EL_RANGE: |
| 777 | case ACT_EL_LLRANGE: |
| 778 | case ACT_EL_RLRANGE: |
| 779 | case ACT_EL_ULRANGE: |
| 780 | vmin = ct->range_start; |
| 781 | vmax = ct->range_stop; |
| 782 | break; |
| 783 | case ACT_EL_EXT: |
| 784 | if(!*exmet) { |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 785 | range->incompatible = 1; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 786 | } else { |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 787 | _range_free(range); |
| 788 | errno = ERANGE; |
| 789 | range = 0; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 790 | } |
| 791 | return range; |
| 792 | case ACT_CT_SIZE: |
| 793 | case ACT_CT_FROM: |
| 794 | if(type == ct->type) { |
| 795 | *exmet = 1; |
| 796 | } else { |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 797 | range->incompatible = 1; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 798 | return range; |
| 799 | } |
| 800 | assert(ct->el_count == 1); |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 801 | tmp = asn1constraint_compute_PER_range(expr_type, |
Lev Walkin | 4b55341 | 2005-08-14 14:45:44 +0000 | [diff] [blame] | 802 | ct->elements[0], type, minmax, exmet, cpr_flags); |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 803 | if(tmp) { |
| 804 | _range_free(range); |
| 805 | } else { |
| 806 | if(errno == ERANGE) { |
| 807 | range->empty_constraint = 1; |
| 808 | range->extensible = 1; |
| 809 | tmp = range; |
| 810 | } else { |
| 811 | _range_free(range); |
| 812 | } |
| 813 | } |
| 814 | return tmp; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 815 | case ACT_CA_SET: /* (10..20)(15..17) */ |
| 816 | case ACT_CA_INT: /* SIZE(1..2) ^ FROM("ABCD") */ |
| 817 | |
| 818 | /* AND constraints, one after another. */ |
| 819 | for(i = 0; i < ct->el_count; i++) { |
| 820 | tmp = asn1constraint_compute_PER_range(expr_type, |
| 821 | ct->elements[i], type, |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 822 | ct->type==ACT_CA_SET?range:minmax, exmet, |
Lev Walkin | 4b55341 | 2005-08-14 14:45:44 +0000 | [diff] [blame] | 823 | cpr_flags); |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 824 | if(!tmp) { |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 825 | if(errno == ERANGE) { |
| 826 | continue; |
| 827 | } else { |
| 828 | _range_free(range); |
| 829 | return NULL; |
| 830 | } |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 831 | } |
| 832 | |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 833 | if(tmp->incompatible) { |
| 834 | /* |
| 835 | * Ignore constraints |
| 836 | * incompatible with arguments: |
| 837 | * SIZE(1..2) ^ FROM("ABCD") |
| 838 | * either SIZE or FROM will be ignored. |
| 839 | */ |
| 840 | _range_free(tmp); |
| 841 | continue; |
| 842 | } |
| 843 | |
Lev Walkin | 4b55341 | 2005-08-14 14:45:44 +0000 | [diff] [blame] | 844 | if(tmp->not_PER_visible |
| 845 | && (cpr_flags & CPR_strict_PER_visibility)) { |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 846 | if(ct->type == ACT_CA_SET) { |
| 847 | /* |
| 848 | * X.691, #9.3.18: |
| 849 | * Ignore this separate component. |
| 850 | */ |
| 851 | } else { |
| 852 | /* |
| 853 | * X.691, #9.3.19: |
| 854 | * Ignore not PER-visible INTERSECTION |
| 855 | */ |
| 856 | } |
| 857 | _range_free(tmp); |
| 858 | continue; |
| 859 | } |
| 860 | |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 861 | ret = _range_intersection(range, tmp, |
| 862 | ct->type == ACT_CA_SET); |
| 863 | _range_free(tmp); |
| 864 | if(ret) { |
| 865 | _range_free(range); |
| 866 | errno = EPERM; |
| 867 | return NULL; |
| 868 | } |
| 869 | _range_canonicalize(range); |
| 870 | } |
| 871 | |
| 872 | return range; |
| 873 | case ACT_CA_CSV: /* SIZE(1..2, 3..4) */ |
| 874 | case ACT_CA_UNI: /* SIZE(1..2) | FROM("ABCD") */ |
| 875 | |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 876 | /* |
| 877 | * Grab the first valid constraint. |
| 878 | */ |
| 879 | tmp = 0; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 880 | for(i = 0; i < ct->el_count; i++) { |
| 881 | tmp = asn1constraint_compute_PER_range(expr_type, |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 882 | ct->elements[i], type, minmax, exmet, |
Lev Walkin | 4b55341 | 2005-08-14 14:45:44 +0000 | [diff] [blame] | 883 | cpr_flags); |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 884 | if(!tmp) { |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 885 | if(errno == ERANGE) { |
| 886 | range->extensible = 1; |
| 887 | continue; |
| 888 | } else { |
| 889 | _range_free(range); |
| 890 | return NULL; |
| 891 | } |
| 892 | } |
| 893 | if(tmp->incompatible) { |
| 894 | _range_free(tmp); |
| 895 | tmp = 0; |
| 896 | } |
| 897 | break; |
| 898 | } |
| 899 | if(tmp) { |
| 900 | tmp->extensible |= range->extensible; |
| 901 | tmp->empty_constraint |= range->empty_constraint; |
| 902 | _range_free(range); |
| 903 | range = tmp; |
| 904 | } else { |
| 905 | range->incompatible = 1; |
| 906 | return range; |
| 907 | } |
| 908 | |
| 909 | /* |
| 910 | * Merge with the rest of them. |
| 911 | * Canonicalizator will do the union magic. |
| 912 | */ |
| 913 | for(; i < ct->el_count; i++) { |
| 914 | tmp = asn1constraint_compute_PER_range(expr_type, |
| 915 | ct->elements[i], type, minmax, exmet, |
Lev Walkin | 4b55341 | 2005-08-14 14:45:44 +0000 | [diff] [blame] | 916 | cpr_flags); |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 917 | if(!tmp) { |
| 918 | if(errno == ERANGE) { |
| 919 | range->extensible = 1; |
| 920 | continue; |
| 921 | } else { |
| 922 | _range_free(range); |
| 923 | return NULL; |
| 924 | } |
| 925 | } |
| 926 | |
| 927 | if(tmp->incompatible) { |
| 928 | _range_free(tmp); |
| 929 | _range_canonicalize(range); |
| 930 | range->incompatible = 1; |
| 931 | return range; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 932 | } |
| 933 | |
| 934 | if(tmp->empty_constraint) { |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 935 | /* |
| 936 | * Ignore empty constraints in OR logic. |
| 937 | */ |
| 938 | range->extensible |= tmp->extensible; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 939 | _range_free(tmp); |
| 940 | continue; |
| 941 | } |
| 942 | |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 943 | _range_merge_in(range, tmp); |
| 944 | } |
| 945 | |
| 946 | _range_canonicalize(range); |
| 947 | |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 948 | if(range->extensible && type == ACT_CT_FROM) { |
| 949 | /* |
| 950 | * X.691, #9.3.10: |
| 951 | * Extensible permitted alphabet constraints |
| 952 | * are not PER-visible. |
| 953 | */ |
| 954 | range->not_PER_visible = 1; |
| 955 | } |
| 956 | |
Lev Walkin | 4b55341 | 2005-08-14 14:45:44 +0000 | [diff] [blame] | 957 | if(range->not_PER_visible |
| 958 | && (cpr_flags & CPR_strict_PER_visibility)) { |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 959 | /* |
| 960 | * X.691, #9.3.19: |
| 961 | * If not PER-visible constraint is part of UNION, |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 962 | * the whole resulting constraint is not PER-visible. |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 963 | */ |
| 964 | _range_free(range); |
| 965 | if(minmax) |
| 966 | range = _range_clone(minmax); |
| 967 | else |
| 968 | range = _range_new(); |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 969 | range->not_PER_visible = 1; |
| 970 | range->incompatible = 1; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 971 | } |
| 972 | |
| 973 | return range; |
| 974 | case ACT_CA_EXC: /* FROM("ABCD") EXCEPT FROM("AB") */ |
| 975 | /* |
| 976 | * X.691, #9.3.19: |
| 977 | * EXCEPT and the following value set is completely ignored. |
| 978 | */ |
| 979 | assert(ct->el_count >= 1); |
| 980 | _range_free(range); |
| 981 | range = asn1constraint_compute_PER_range(expr_type, |
Lev Walkin | 4b55341 | 2005-08-14 14:45:44 +0000 | [diff] [blame] | 982 | ct->elements[0], type, minmax, exmet, cpr_flags); |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 983 | return range; |
| 984 | default: |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 985 | range->incompatible = 1; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 986 | return range; |
| 987 | } |
| 988 | |
| 989 | |
| 990 | if(!*exmet) { |
| 991 | /* |
| 992 | * Expectation is not met. Return the default range. |
| 993 | */ |
Lev Walkin | b74ac57 | 2004-08-25 02:05:28 +0000 | [diff] [blame] | 994 | range->incompatible = 1; |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 995 | return range; |
| 996 | } |
| 997 | |
| 998 | _range_free(range); |
| 999 | range = _range_new(); |
| 1000 | |
| 1001 | ret = _range_fill(vmin, minmax, &range->left, |
| 1002 | range, type, ct->_lineno); |
Lev Walkin | 1ef0516 | 2004-08-25 00:42:25 +0000 | [diff] [blame] | 1003 | if(!ret) |
| 1004 | ret = _range_fill(vmax, minmax, &range->right, |
Lev Walkin | b45e067 | 2004-08-18 05:42:05 +0000 | [diff] [blame] | 1005 | range, type, ct->_lineno); |
| 1006 | if(ret) { |
| 1007 | _range_free(range); |
| 1008 | errno = EPERM; |
| 1009 | return NULL; |
| 1010 | } |
| 1011 | |
| 1012 | if(minmax) { |
| 1013 | asn1cnst_range_t *clone; |
| 1014 | |
| 1015 | clone = _range_clone(minmax); |
| 1016 | |
| 1017 | /* Constrain parent type with given data. */ |
| 1018 | ret = _range_intersection(clone, range, 1); |
| 1019 | _range_free(range); |
| 1020 | if(ret) { |
| 1021 | _range_free(clone); |
| 1022 | errno = EPERM; |
| 1023 | return NULL; |
| 1024 | } |
| 1025 | range = clone; |
| 1026 | } |
| 1027 | |
| 1028 | /* |
| 1029 | * Recompute elements's min/max, remove duplicates, etc. |
| 1030 | */ |
| 1031 | _range_canonicalize(range); |
| 1032 | |
| 1033 | return range; |
| 1034 | } |
| 1035 | |
Lev Walkin | 3b2278a | 2016-01-24 16:43:50 -0800 | [diff] [blame] | 1036 | #ifdef UNIT_TEST |
| 1037 | int main() { |
| 1038 | asn1cnst_range_t *ra = _range_new(); |
| 1039 | asn1cnst_range_t *rb = _range_new(); |
| 1040 | |
| 1041 | fprintf(stderr, "Testing (MIN..20) x (10..15) => (MIN..9,10..15,16..20)\n"); |
| 1042 | |
| 1043 | /* (MIN..20) */ |
| 1044 | ra->left.type = ARE_MIN; |
| 1045 | ra->right.type = ARE_VALUE; ra->right.value = 20; |
| 1046 | |
| 1047 | /* (10..15) */ |
| 1048 | rb->left.type = ARE_VALUE; rb->left.value = 10; |
| 1049 | rb->right.type = ARE_VALUE; rb->right.value = 15; |
| 1050 | |
| 1051 | /* |
| 1052 | * (MIN..20) x (10..15) = (MIN..9,10..15,16..20) |
| 1053 | */ |
| 1054 | asn1cnst_range_t *r = _range_split(ra, rb); |
| 1055 | assert(r); |
| 1056 | assert(r->left.type == ARE_MIN); |
| 1057 | assert(r->right.type == ARE_MAX); |
| 1058 | |
| 1059 | assert(r->el_count == 3); |
| 1060 | assert(r->elements[0]->elements == NULL); |
| 1061 | assert(r->elements[1]->elements == NULL); |
| 1062 | assert(r->elements[2]->elements == NULL); |
| 1063 | |
| 1064 | /* (MIN..9) */ |
| 1065 | fprintf(stderr, "[0].left = %s\n", _edge_value(&r->elements[0]->left)); |
| 1066 | fprintf(stderr, "[0].right = %s\n", _edge_value(&r->elements[0]->right)); |
| 1067 | assert(r->elements[0]->left.type == ARE_MIN); |
| 1068 | assert(r->elements[0]->right.type == ARE_VALUE); |
| 1069 | assert(r->elements[0]->right.value == 9); |
| 1070 | |
| 1071 | /* (10..15) */ |
| 1072 | fprintf(stderr, "[1].left = %s\n", _edge_value(&r->elements[1]->left)); |
| 1073 | fprintf(stderr, "[1].right = %s\n", _edge_value(&r->elements[1]->right)); |
| 1074 | assert(r->elements[1]->left.type == ARE_VALUE); |
| 1075 | assert(r->elements[1]->left.value == 10); |
| 1076 | assert(r->elements[1]->right.type == ARE_VALUE); |
| 1077 | assert(r->elements[1]->right.value == 15); |
| 1078 | |
| 1079 | /* (16..20) */ |
| 1080 | fprintf(stderr, "[2].left = %s\n", _edge_value(&r->elements[2]->left)); |
| 1081 | fprintf(stderr, "[2].right = %s\n", _edge_value(&r->elements[2]->right)); |
| 1082 | assert(r->elements[2]->left.type == ARE_VALUE); |
| 1083 | assert(r->elements[2]->left.value == 16); |
| 1084 | assert(r->elements[2]->right.type == ARE_VALUE); |
| 1085 | assert(r->elements[2]->right.value == 20); |
| 1086 | |
| 1087 | _range_free(r); |
| 1088 | |
| 1089 | |
| 1090 | |
| 1091 | fprintf(stderr, "Testing (MIN..20) x (<min>..15) => (<min>..15,16..20)\n"); |
| 1092 | |
| 1093 | /* (MIN..20) */ |
| 1094 | ra->left.type = ARE_MIN; |
| 1095 | ra->right.type = ARE_VALUE; ra->right.value = 20; |
| 1096 | |
| 1097 | /* (<INTMAX_MIN>..15) */ |
| 1098 | rb->left.type = ARE_VALUE; rb->left.value = INTMAX_MIN; |
| 1099 | rb->right.type = ARE_VALUE; rb->right.value = 15; |
| 1100 | |
| 1101 | r = _range_split(ra, rb); |
| 1102 | assert(r); |
| 1103 | assert(r->left.type == ARE_MIN); |
| 1104 | assert(r->right.type == ARE_MAX); |
| 1105 | |
| 1106 | assert(r->el_count == 2); |
| 1107 | assert(r->elements[0]->elements == NULL); |
| 1108 | assert(r->elements[1]->elements == NULL); |
| 1109 | |
| 1110 | /* (<min>..16) */ |
| 1111 | fprintf(stderr, "[0].left = %s\n", _edge_value(&r->elements[0]->left)); |
| 1112 | fprintf(stderr, "[0].right = %s\n", _edge_value(&r->elements[0]->right)); |
| 1113 | assert(r->elements[0]->left.type == ARE_VALUE); |
| 1114 | assert(r->elements[0]->left.value == INTMAX_MIN); |
| 1115 | assert(r->elements[0]->right.type == ARE_VALUE); |
| 1116 | assert(r->elements[0]->right.value == 15); |
| 1117 | |
| 1118 | /* (16..20) */ |
| 1119 | fprintf(stderr, "[1].left = %s\n", _edge_value(&r->elements[1]->left)); |
| 1120 | fprintf(stderr, "[1].right = %s\n", _edge_value(&r->elements[1]->right)); |
| 1121 | assert(r->elements[1]->left.type == ARE_VALUE); |
| 1122 | assert(r->elements[1]->left.value == 16); |
| 1123 | assert(r->elements[1]->right.type == ARE_VALUE); |
| 1124 | assert(r->elements[1]->right.value == 20); |
| 1125 | |
| 1126 | _range_free(r); |
| 1127 | |
| 1128 | return 0; |
| 1129 | } |
| 1130 | #endif |