?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
sizeof_param: remove read_rom() from checked functions
[smatch.git] / smatch_ranges.c
blob2c5832d96934a5b0246d0261a90e802b90ab334a
1 /*
2 * Copyright (C) 2009 Dan Carpenter.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version 2
7 * of the License, or (at your option) any later version.
8 *
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, see http://www.gnu.org/copyleft/gpl.txt
16 */
17
18 #include "parse.h"
19 #include "smatch.h"
20 #include "smatch_extra.h"
21 #include "smatch_slist.h"
22
23 ALLOCATOR(data_info, "smatch extra data");
24 ALLOCATOR(data_range, "data range");
25 __DO_ALLOCATOR(struct data_range, sizeof(struct data_range), __alignof__(struct data_range),
26 "permanent ranges", perm_data_range);
27
28 char *show_rl(struct range_list *list)
29 {
30 struct data_range *tmp;
31 char full[256];
32 int i = 0;
33
34 full[0] = '\0';
35 full[255] = '\0';
36 FOR_EACH_PTR(list, tmp) {
37 if (i++)
38 strncat(full, ",", 254 - strlen(full));
39 if (sval_cmp(tmp->min, tmp->max) == 0) {
40 strncat(full, sval_to_str(tmp->min), 254 - strlen(full));
41 continue;
42 }
43 strncat(full, sval_to_str(tmp->min), 254 - strlen(full));
44 strncat(full, "-", 254 - strlen(full));
45 strncat(full, sval_to_str(tmp->max), 254 - strlen(full));
46 } END_FOR_EACH_PTR(tmp);
47 return alloc_sname(full);
48 }
49
50 static int sval_too_big(struct symbol *type, sval_t sval)
51 {
52 if (type_bits(type) == 64)
53 return 0;
54 if (sval.uvalue > ((1ULL << type_bits(type)) - 1))
55 return 1;
56 return 0;
57 }
58
59 static void add_range_t(struct symbol *type, struct range_list **rl, sval_t min, sval_t max)
60 {
61 /* If we're just adding a number, cast it and add it */
62 if (sval_cmp(min, max) == 0) {
63 add_range(rl, sval_cast(type, min), sval_cast(type, max));
64 return;
65 }
66
67 /* If the range is within the type range then add it */
68 if (sval_fits(type, min) && sval_fits(type, max)) {
69 add_range(rl, sval_cast(type, min), sval_cast(type, max));
70 return;
71 }
72
73 /*
74 * If the range we are adding has more bits than the range type then
75 * add the whole range type. Eg:
76 * 0x8000000000000000 - 0xf000000000000000 -> cast to int
77 * This isn't totally the right thing to do. We could be more granular.
78 */
79 if (sval_too_big(type, min) || sval_too_big(type, max)) {
80 add_range(rl, sval_type_min(type), sval_type_max(type));
81 return;
82 }
83
84 /* Cast negative values to high positive values */
85 if (sval_is_negative(min) && type_unsigned(type)) {
86 if (sval_is_positive(max)) {
87 if (sval_too_high(type, max)) {
88 add_range(rl, sval_type_min(type), sval_type_max(type));
89 return;
90 }
91 add_range(rl, sval_type_val(type, 0), sval_cast(type, max));
92 max = sval_type_max(type);
93 } else {
94 max = sval_cast(type, max);
95 }
96 min = sval_cast(type, min);
97 add_range(rl, min, max);
98 }
99
100 /* Cast high positive numbers to negative */
101 if (sval_unsigned(max) && sval_is_negative(sval_cast(type, max))) {
102 if (!sval_is_negative(sval_cast(type, min))) {
103 add_range(rl, sval_cast(type, min), sval_type_max(type));
104 min = sval_type_min(type);
105 } else {
106 min = sval_cast(type, min);
107 }
108 max = sval_cast(type, max);
109 add_range(rl, min, max);
110 }
111
112 add_range(rl, sval_cast(type, min), sval_cast(type, max));
113 return;
114 }
115
116 static int str_to_comparison_arg_helper(const char *str,
117 struct expression *call, int *comparison,
118 struct expression **arg, char **endp)
119 {
120 int param;
121 char *c = (char *)str;
122
123 if (*c != '[')
124 return 0;
125 c++;
126
127 if (*c == '<') {
128 c++;
129 if (*c == '=') {
130 *comparison = SPECIAL_LTE;
131 c++;
132 } else {
133 *comparison = '<';
134 }
135 } else if (*c == '=') {
136 c++;
137 c++;
138 *comparison = SPECIAL_EQUAL;
139 } else if (*c == '>') {
140 c++;
141 if (*c == '=') {
142 *comparison = SPECIAL_GTE;
143 c++;
144 } else {
145 *comparison = '>';
146 }
147 } else if (*c == '!') {
148 c++;
149 c++;
150 *comparison = SPECIAL_NOTEQUAL;
151 } else {
152 return 0;
153 }
154
155 if (*c != '$')
156 return 0;
157 c++;
158
159 param = strtoll(c, &c, 10);
160 c++; /* skip the ']' character */
161 if (endp)
162 *endp = (char *)c;
163
164 if (!call)
165 return 0;
166 *arg = get_argument_from_call_expr(call->args, param);
167 if (!*arg)
168 return 0;
169 return 1;
170 }
171
172 int str_to_comparison_arg(const char *str, struct expression *call, int *comparison, struct expression **arg)
173 {
174 while (1) {
175 if (!*str)
176 return 0;
177 if (*str == '[')
178 break;
179 str++;
180 }
181 return str_to_comparison_arg_helper(str, call, comparison, arg, NULL);
182 }
183
184 static int get_val_from_key(int use_max, struct symbol *type, char *c, struct expression *call, char **endp, sval_t *sval)
185 {
186 struct expression *arg;
187 int comparison;
188 sval_t ret, tmp;
189
190 if (use_max)
191 ret = sval_type_max(type);
192 else
193 ret = sval_type_min(type);
194
195 if (!str_to_comparison_arg_helper(c, call, &comparison, &arg, endp)) {
196 *sval = ret;
197 return 0;
198 }
199
200 if (use_max && get_implied_max(arg, &tmp)) {
201 ret = tmp;
202 if (comparison == '<') {
203 tmp.value = 1;
204 ret = sval_binop(ret, '-', tmp);
205 }
206 }
207 if (!use_max && get_implied_min(arg, &tmp)) {
208 ret = tmp;
209 if (comparison == '>') {
210 tmp.value = 1;
211 ret = sval_binop(ret, '+', tmp);
212 }
213 }
214
215 *sval = ret;
216 return 1;
217 }
218
219 static sval_t add_one(sval_t sval)
220 {
221 sval.value++;
222 return sval;
223 }
224
225 static sval_t sub_one(sval_t sval)
226 {
227 sval.value--;
228 return sval;
229 }
230
231 void filter_by_comparison(struct range_list **rl, int comparison, struct range_list *right)
232 {
233 struct range_list *left_orig = *rl;
234 struct range_list *right_orig = right;
235 struct range_list *ret_rl = *rl;
236 struct symbol *cast_type;
237 sval_t min, max;
238
239 cast_type = rl_type(left_orig);
240 if (sval_type_max(rl_type(left_orig)).uvalue < sval_type_max(rl_type(right_orig)).uvalue)
241 cast_type = rl_type(right_orig);
242 if (sval_type_max(cast_type).uvalue < INT_MAX)
243 cast_type = &int_ctype;
244
245 min = sval_type_min(cast_type);
246 max = sval_type_max(cast_type);
247 left_orig = cast_rl(cast_type, left_orig);
248 right_orig = cast_rl(cast_type, right_orig);
249
250 switch (comparison) {
251 case '<':
252 case SPECIAL_UNSIGNED_LT:
253 ret_rl = remove_range(left_orig, rl_max(right_orig), max);
254 break;
255 case SPECIAL_LTE:
256 case SPECIAL_UNSIGNED_LTE:
257 if (!sval_is_max(rl_max(right_orig)))
258 ret_rl = remove_range(left_orig, add_one(rl_max(right_orig)), max);
259 break;
260 case SPECIAL_EQUAL:
261 if (!sval_is_max(rl_max(right_orig)))
262 ret_rl = remove_range(ret_rl, add_one(rl_max(right_orig)), max);
263 if (!sval_is_min(rl_min(right_orig)))
264 ret_rl = remove_range(ret_rl, min, sub_one(rl_min(right_orig)));
265 break;
266 case SPECIAL_GTE:
267 case SPECIAL_UNSIGNED_GTE:
268 if (!sval_is_min(rl_min(right_orig)))
269 ret_rl = remove_range(left_orig, min, sub_one(rl_min(right_orig)));
270 break;
271 case '>':
272 case SPECIAL_UNSIGNED_GT:
273 ret_rl = remove_range(left_orig, min, rl_min(right_orig));
274 break;
275 case SPECIAL_NOTEQUAL:
276 if (sval_cmp(rl_min(right_orig), rl_max(right_orig)) == 0)
277 ret_rl = remove_range(left_orig, rl_min(right_orig), rl_min(right_orig));
278 break;
279 default:
280 sm_msg("internal error: unhandled comparison %s", show_special(comparison));
281 return;
282 }
283
284 *rl = cast_rl(rl_type(*rl), ret_rl);
285 }
286
287 static struct range_list *filter_by_comparison_call(char *c, struct expression *call, char **endp, struct range_list *start_rl)
288 {
289 struct expression *arg;
290 struct range_list *right_orig;
291 int comparison;
292
293 if (!str_to_comparison_arg_helper(c, call, &comparison, &arg, endp))
294 return NULL;
295
296 if (!get_implied_rl(arg, &right_orig))
297 return NULL;
298
299 if (rl_type(start_rl) == &int_ctype &&
300 sval_is_negative(rl_min(start_rl)) &&
301 type_unsigned(rl_type(right_orig)))
302 right_orig = cast_rl(&int_ctype, right_orig);
303
304 filter_by_comparison(&start_rl, comparison, right_orig);
305 return start_rl;
306 }
307
308 static sval_t parse_val(int use_max, struct expression *call, struct symbol *type, char *c, char **endp)
309 {
310 char *start = c;
311 sval_t ret;
312
313 if (!strncmp(start, "max", 3)) {
314 ret = sval_type_max(type);
315 c += 3;
316 } else if (!strncmp(start, "u64max", 6)) {
317 ret = sval_type_val(type, ULLONG_MAX);
318 c += 6;
319 } else if (!strncmp(start, "s64max", 6)) {
320 ret = sval_type_val(type, LLONG_MAX);
321 c += 6;
322 } else if (!strncmp(start, "u32max", 6)) {
323 ret = sval_type_val(type, UINT_MAX);
324 c += 6;
325 } else if (!strncmp(start, "s32max", 6)) {
326 ret = sval_type_val(type, INT_MAX);
327 c += 6;
328 } else if (!strncmp(start, "u16max", 6)) {
329 ret = sval_type_val(type, USHRT_MAX);
330 c += 6;
331 } else if (!strncmp(start, "s16max", 6)) {
332 ret = sval_type_val(type, SHRT_MAX);
333 c += 6;
334 } else if (!strncmp(start, "min", 3)) {
335 ret = sval_type_min(type);
336 c += 3;
337 } else if (!strncmp(start, "s64min", 6)) {
338 ret = sval_type_val(type, LLONG_MIN);
339 c += 6;
340 } else if (!strncmp(start, "s32min", 6)) {
341 ret = sval_type_val(type, INT_MIN);
342 c += 6;
343 } else if (!strncmp(start, "s16min", 6)) {
344 ret = sval_type_val(type, SHRT_MIN);
345 c += 6;
346 } else if (!strncmp(start, "long_min", 8)) {
347 ret = sval_type_val(type, LONG_MIN);
348 c += 8;
349 } else if (!strncmp(start, "long_max", 8)) {
350 ret = sval_type_val(type, LONG_MAX);
351 c += 8;
352 } else if (!strncmp(start, "ulong_max", 9)) {
353 ret = sval_type_val(type, ULONG_MAX);
354 c += 8;
355 } else if (!strncmp(start, "ptr_max", 7)) {
356 ret = sval_type_val(type, valid_ptr_max);
357 c += 8;
358 } else if (start[0] == '[') {
359 /* this parses [==p0] comparisons */
360 get_val_from_key(1, type, start, call, &c, &ret);
361 } else {
362 ret = sval_type_val(type, strtoll(start, &c, 10));
363 }
364 *endp = c;
365 return ret;
366 }
367
368 static char *jump_to_call_math(char *value)
369 {
370 char *c = value;
371
372 while (*c && *c != '[')
373 c++;
374
375 if (!*c)
376 return NULL;
377 c++;
378 if (*c == '<' || *c == '=' || *c == '>' || *c == '!')
379 return NULL;
380
381 return c;
382 }
383
384 static void str_to_rl_helper(struct expression *call, struct symbol *type, char *str, char **endp, struct range_list **rl)
385 {
386 struct range_list *rl_tmp = NULL;
387 sval_t min, max;
388 char *c;
389
390 min = sval_type_min(type);
391 max = sval_type_max(type);
392 c = str;
393 while (*c != '\0' && *c != '[') {
394 if (*c == '(')
395 c++;
396 min = parse_val(0, call, type, c, &c);
397 max = min;
398 if (*c == ')')
399 c++;
400 if (*c == '\0' || *c == '[') {
401 add_range_t(type, &rl_tmp, min, min);
402 break;
403 }
404 if (*c == ',') {
405 add_range_t(type, &rl_tmp, min, min);
406 c++;
407 continue;
408 }
409 if (*c != '-') {
410 sm_msg("debug XXX: trouble parsing %s c = %s", str, c);
411 break;
412 }
413 c++;
414 if (*c == '(')
415 c++;
416 max = parse_val(1, call, type, c, &c);
417 add_range_t(type, &rl_tmp, min, max);
418 if (*c == ')')
419 c++;
420 if (*c == ',')
421 c++;
422 }
423
424 *rl = rl_tmp;
425 *endp = c;
426 }
427
428 static void str_to_dinfo(struct expression *call, struct symbol *type, char *value, struct data_info *dinfo)
429 {
430 struct range_list *math_rl;
431 char *call_math;
432 char *c;
433 struct range_list *rl = NULL;
434
435 if (!type)
436 type = &llong_ctype;
437
438 if (strcmp(value, "empty") == 0)
439 return;
440
441 if (strncmp(value, "[==$", 4) == 0) {
442 struct expression *arg;
443 int comparison;
444
445 if (!str_to_comparison_arg(value, call, &comparison, &arg))
446 return;
447 if (!get_implied_rl(arg, &rl))
448 return;
449 goto cast;
450 }
451
452 str_to_rl_helper(call, type, value, &c, &rl);
453 if (*c == '\0')
454 goto cast;
455
456 call_math = jump_to_call_math(value);
457 if (call_math && parse_call_math_rl(call, call_math, &math_rl)) {
458 rl = rl_intersection(rl, math_rl);
459 goto cast;
460 }
461
462 /*
463 * For now if we already tried to handle the call math and couldn't
464 * figure it out then bail.
465 */
466 if (jump_to_call_math(c) == c + 1)
467 goto cast;
468
469 rl = filter_by_comparison_call(c, call, &c, rl);
470
471 cast:
472 rl = cast_rl(type, rl);
473 dinfo->value_ranges = rl;
474 }
475
476 void str_to_rl(struct symbol *type, char *value, struct range_list **rl)
477 {
478 struct data_info dinfo = {};
479
480 str_to_dinfo(NULL, type, value, &dinfo);
481 *rl = dinfo.value_ranges;
482 }
483
484 void call_results_to_rl(struct expression *expr, struct symbol *type, char *value, struct range_list **rl)
485 {
486 struct data_info dinfo = {};
487
488 str_to_dinfo(strip_expr(expr), type, value, &dinfo);
489 *rl = dinfo.value_ranges;
490 }
491
492 int is_whole_rl(struct range_list *rl)
493 {
494 struct data_range *drange;
495
496 if (ptr_list_empty(rl))
497 return 0;
498 drange = first_ptr_list((struct ptr_list *)rl);
499 if (sval_is_min(drange->min) && sval_is_max(drange->max))
500 return 1;
501 return 0;
502 }
503
504 int is_whole_rl_non_zero(struct range_list *rl)
505 {
506 struct data_range *drange;
507
508 if (ptr_list_empty(rl))
509 return 0;
510 drange = first_ptr_list((struct ptr_list *)rl);
511 if (sval_unsigned(drange->min) &&
512 drange->min.value == 1 &&
513 sval_is_max(drange->max))
514 return 1;
515 if (!sval_is_min(drange->min) || drange->max.value != -1)
516 return 0;
517 drange = last_ptr_list((struct ptr_list *)rl);
518 if (drange->min.value != 1 || !sval_is_max(drange->max))
519 return 0;
520 return 1;
521 }
522
523 sval_t rl_min(struct range_list *rl)
524 {
525 struct data_range *drange;
526 sval_t ret;
527
528 ret.type = &llong_ctype;
529 ret.value = LLONG_MIN;
530 if (ptr_list_empty(rl))
531 return ret;
532 drange = first_ptr_list((struct ptr_list *)rl);
533 return drange->min;
534 }
535
536 sval_t rl_max(struct range_list *rl)
537 {
538 struct data_range *drange;
539 sval_t ret;
540
541 ret.type = &llong_ctype;
542 ret.value = LLONG_MAX;
543 if (ptr_list_empty(rl))
544 return ret;
545 drange = last_ptr_list((struct ptr_list *)rl);
546 return drange->max;
547 }
548
549 int rl_to_sval(struct range_list *rl, sval_t *sval)
550 {
551 sval_t min, max;
552
553 if (!rl)
554 return 0;
555
556 min = rl_min(rl);
557 max = rl_max(rl);
558 if (sval_cmp(min, max) != 0)
559 return 0;
560 *sval = min;
561 return 1;
562 }
563
564 struct symbol *rl_type(struct range_list *rl)
565 {
566 if (!rl)
567 return NULL;
568 return rl_min(rl).type;
569 }
570
571 static struct data_range *alloc_range_helper_sval(sval_t min, sval_t max, int perm)
572 {
573 struct data_range *ret;
574
575 if (perm)
576 ret = __alloc_perm_data_range(0);
577 else
578 ret = __alloc_data_range(0);
579 ret->min = min;
580 ret->max = max;
581 return ret;
582 }
583
584 struct data_range *alloc_range(sval_t min, sval_t max)
585 {
586 return alloc_range_helper_sval(min, max, 0);
587 }
588
589 struct data_range *alloc_range_perm(sval_t min, sval_t max)
590 {
591 return alloc_range_helper_sval(min, max, 1);
592 }
593
594 struct range_list *alloc_rl(sval_t min, sval_t max)
595 {
596 struct range_list *rl = NULL;
597
598 if (sval_cmp(min, max) > 0)
599 return alloc_whole_rl(min.type);
600
601 add_range(&rl, min, max);
602 return rl;
603 }
604
605 struct range_list *alloc_whole_rl(struct symbol *type)
606 {
607 if (!type || type_positive_bits(type) < 0)
608 type = &llong_ctype;
609 if (type->type == SYM_ARRAY)
610 type = &ptr_ctype;
611
612 return alloc_rl(sval_type_min(type), sval_type_max(type));
613 }
614
615 void add_range(struct range_list **list, sval_t min, sval_t max)
616 {
617 struct data_range *tmp;
618 struct data_range *new = NULL;
619 int check_next = 0;
620
621 if (sval_cmp(min, max) > 0) {
622 min = sval_type_min(min.type);
623 max = sval_type_max(min.type);
624 }
625
626 /*
627 * FIXME: This has a problem merging a range_list like: min-0,3-max
628 * with a range like 1-2. You end up with min-2,3-max instead of
629 * just min-max.
630 */
631 FOR_EACH_PTR(*list, tmp) {
632 if (check_next) {
633 /* Sometimes we overlap with more than one range
634 so we have to delete or modify the next range. */
635 if (!sval_is_max(max) && max.value + 1 == tmp->min.value) {
636 /* join 2 ranges here */
637 new->max = tmp->max;
638 DELETE_CURRENT_PTR(tmp);
639 return;
640 }
641
642 /* Doesn't overlap with the next one. */
643 if (sval_cmp(max, tmp->min) < 0)
644 return;
645
646 if (sval_cmp(max, tmp->max) <= 0) {
647 /* Partially overlaps the next one. */
648 new->max = tmp->max;
649 DELETE_CURRENT_PTR(tmp);
650 return;
651 } else {
652 /* Completely overlaps the next one. */
653 DELETE_CURRENT_PTR(tmp);
654 /* there could be more ranges to delete */
655 continue;
656 }
657 }
658 if (!sval_is_max(max) && max.value + 1 == tmp->min.value) {
659 /* join 2 ranges into a big range */
660 new = alloc_range(min, tmp->max);
661 REPLACE_CURRENT_PTR(tmp, new);
662 return;
663 }
664 if (sval_cmp(max, tmp->min) < 0) { /* new range entirely below */
665 new = alloc_range(min, max);
666 INSERT_CURRENT(new, tmp);
667 return;
668 }
669 if (sval_cmp(min, tmp->min) < 0) { /* new range partially below */
670 if (sval_cmp(max, tmp->max) < 0)
671 max = tmp->max;
672 else
673 check_next = 1;
674 new = alloc_range(min, max);
675 REPLACE_CURRENT_PTR(tmp, new);
676 if (!check_next)
677 return;
678 continue;
679 }
680 if (sval_cmp(max, tmp->max) <= 0) /* new range already included */
681 return;
682 if (sval_cmp(min, tmp->max) <= 0) { /* new range partially above */
683 min = tmp->min;
684 new = alloc_range(min, max);
685 REPLACE_CURRENT_PTR(tmp, new);
686 check_next = 1;
687 continue;
688 }
689 if (!sval_is_min(min) && min.value - 1 == tmp->max.value) {
690 /* join 2 ranges into a big range */
691 new = alloc_range(tmp->min, max);
692 REPLACE_CURRENT_PTR(tmp, new);
693 check_next = 1;
694 continue;
695 }
696 /* the new range is entirely above the existing ranges */
697 } END_FOR_EACH_PTR(tmp);
698 if (check_next)
699 return;
700 new = alloc_range(min, max);
701 add_ptr_list(list, new);
702 }
703
704 struct range_list *clone_rl(struct range_list *list)
705 {
706 struct data_range *tmp;
707 struct range_list *ret = NULL;
708
709 FOR_EACH_PTR(list, tmp) {
710 add_ptr_list(&ret, tmp);
711 } END_FOR_EACH_PTR(tmp);
712 return ret;
713 }
714
715 struct range_list *clone_rl_permanent(struct range_list *list)
716 {
717 struct data_range *tmp;
718 struct data_range *new;
719 struct range_list *ret = NULL;
720
721 FOR_EACH_PTR(list, tmp) {
722 new = alloc_range_perm(tmp->min, tmp->max);
723 add_ptr_list(&ret, new);
724 } END_FOR_EACH_PTR(tmp);
725 return ret;
726 }
727
728 struct range_list *rl_union(struct range_list *one, struct range_list *two)
729 {
730 struct data_range *tmp;
731 struct range_list *ret = NULL;
732
733 FOR_EACH_PTR(one, tmp) {
734 add_range(&ret, tmp->min, tmp->max);
735 } END_FOR_EACH_PTR(tmp);
736 FOR_EACH_PTR(two, tmp) {
737 add_range(&ret, tmp->min, tmp->max);
738 } END_FOR_EACH_PTR(tmp);
739 return ret;
740 }
741
742 struct range_list *remove_range(struct range_list *list, sval_t min, sval_t max)
743 {
744 struct data_range *tmp;
745 struct range_list *ret = NULL;
746
747 FOR_EACH_PTR(list, tmp) {
748 if (sval_cmp(tmp->max, min) < 0) {
749 add_range(&ret, tmp->min, tmp->max);
750 continue;
751 }
752 if (sval_cmp(tmp->min, max) > 0) {
753 add_range(&ret, tmp->min, tmp->max);
754 continue;
755 }
756 if (sval_cmp(tmp->min, min) >= 0 && sval_cmp(tmp->max, max) <= 0)
757 continue;
758 if (sval_cmp(tmp->min, min) >= 0) {
759 max.value++;
760 add_range(&ret, max, tmp->max);
761 } else if (sval_cmp(tmp->max, max) <= 0) {
762 min.value--;
763 add_range(&ret, tmp->min, min);
764 } else {
765 min.value--;
766 max.value++;
767 add_range(&ret, tmp->min, min);
768 add_range(&ret, max, tmp->max);
769 }
770 } END_FOR_EACH_PTR(tmp);
771 return ret;
772 }
773
774 int ranges_equiv(struct data_range *one, struct data_range *two)
775 {
776 if (!one && !two)
777 return 1;
778 if (!one || !two)
779 return 0;
780 if (sval_cmp(one->min, two->min) != 0)
781 return 0;
782 if (sval_cmp(one->max, two->max) != 0)
783 return 0;
784 return 1;
785 }
786
787 int rl_equiv(struct range_list *one, struct range_list *two)
788 {
789 struct data_range *one_range;
790 struct data_range *two_range;
791
792 if (one == two)
793 return 1;
794
795 PREPARE_PTR_LIST(one, one_range);
796 PREPARE_PTR_LIST(two, two_range);
797 for (;;) {
798 if (!one_range && !two_range)
799 return 1;
800 if (!ranges_equiv(one_range, two_range))
801 return 0;
802 NEXT_PTR_LIST(one_range);
803 NEXT_PTR_LIST(two_range);
804 }
805 FINISH_PTR_LIST(two_range);
806 FINISH_PTR_LIST(one_range);
807
808 return 1;
809 }
810
811 int true_comparison_range(struct data_range *left, int comparison, struct data_range *right)
812 {
813 switch (comparison) {
814 case '<':
815 case SPECIAL_UNSIGNED_LT:
816 if (sval_cmp(left->min, right->max) < 0)
817 return 1;
818 return 0;
819 case SPECIAL_UNSIGNED_LTE:
820 case SPECIAL_LTE:
821 if (sval_cmp(left->min, right->max) <= 0)
822 return 1;
823 return 0;
824 case SPECIAL_EQUAL:
825 if (sval_cmp(left->max, right->min) < 0)
826 return 0;
827 if (sval_cmp(left->min, right->max) > 0)
828 return 0;
829 return 1;
830 case SPECIAL_UNSIGNED_GTE:
831 case SPECIAL_GTE:
832 if (sval_cmp(left->max, right->min) >= 0)
833 return 1;
834 return 0;
835 case '>':
836 case SPECIAL_UNSIGNED_GT:
837 if (sval_cmp(left->max, right->min) > 0)
838 return 1;
839 return 0;
840 case SPECIAL_NOTEQUAL:
841 if (sval_cmp(left->min, left->max) != 0)
842 return 1;
843 if (sval_cmp(right->min, right->max) != 0)
844 return 1;
845 if (sval_cmp(left->min, right->min) != 0)
846 return 1;
847 return 0;
848 default:
849 sm_msg("unhandled comparison %d\n", comparison);
850 return 0;
851 }
852 return 0;
853 }
854
855 int true_comparison_range_LR(int comparison, struct data_range *var, struct data_range *val, int left)
856 {
857 if (left)
858 return true_comparison_range(var, comparison, val);
859 else
860 return true_comparison_range(val, comparison, var);
861 }
862
863 static int false_comparison_range_sval(struct data_range *left, int comparison, struct data_range *right)
864 {
865 switch (comparison) {
866 case '<':
867 case SPECIAL_UNSIGNED_LT:
868 if (sval_cmp(left->max, right->min) >= 0)
869 return 1;
870 return 0;
871 case SPECIAL_UNSIGNED_LTE:
872 case SPECIAL_LTE:
873 if (sval_cmp(left->max, right->min) > 0)
874 return 1;
875 return 0;
876 case SPECIAL_EQUAL:
877 if (sval_cmp(left->min, left->max) != 0)
878 return 1;
879 if (sval_cmp(right->min, right->max) != 0)
880 return 1;
881 if (sval_cmp(left->min, right->min) != 0)
882 return 1;
883 return 0;
884 case SPECIAL_UNSIGNED_GTE:
885 case SPECIAL_GTE:
886 if (sval_cmp(left->min, right->max) < 0)
887 return 1;
888 return 0;
889 case '>':
890 case SPECIAL_UNSIGNED_GT:
891 if (sval_cmp(left->min, right->max) <= 0)
892 return 1;
893 return 0;
894 case SPECIAL_NOTEQUAL:
895 if (sval_cmp(left->max, right->min) < 0)
896 return 0;
897 if (sval_cmp(left->min, right->max) > 0)
898 return 0;
899 return 1;
900 default:
901 sm_msg("unhandled comparison %d\n", comparison);
902 return 0;
903 }
904 return 0;
905 }
906
907 int false_comparison_range_LR(int comparison, struct data_range *var, struct data_range *val, int left)
908 {
909 if (left)
910 return false_comparison_range_sval(var, comparison, val);
911 else
912 return false_comparison_range_sval(val, comparison, var);
913 }
914
915 int possibly_true(struct expression *left, int comparison, struct expression *right)
916 {
917 struct range_list *rl_left, *rl_right;
918 struct data_range *tmp_left, *tmp_right;
919 struct symbol *type;
920
921 if (!get_implied_rl(left, &rl_left))
922 return 1;
923 if (!get_implied_rl(right, &rl_right))
924 return 1;
925
926 type = rl_type(rl_left);
927 if (type_positive_bits(type) < type_positive_bits(rl_type(rl_right)))
928 type = rl_type(rl_right);
929 if (type_positive_bits(type) < 31)
930 type = &int_ctype;
931
932 rl_left = cast_rl(type, rl_left);
933 rl_right = cast_rl(type, rl_right);
934
935 FOR_EACH_PTR(rl_left, tmp_left) {
936 FOR_EACH_PTR(rl_right, tmp_right) {
937 if (true_comparison_range(tmp_left, comparison, tmp_right))
938 return 1;
939 } END_FOR_EACH_PTR(tmp_right);
940 } END_FOR_EACH_PTR(tmp_left);
941 return 0;
942 }
943
944 int possibly_false(struct expression *left, int comparison, struct expression *right)
945 {
946 struct range_list *rl_left, *rl_right;
947 struct data_range *tmp_left, *tmp_right;
948 struct symbol *type;
949
950 if (!get_implied_rl(left, &rl_left))
951 return 1;
952 if (!get_implied_rl(right, &rl_right))
953 return 1;
954
955 type = rl_type(rl_left);
956 if (type_positive_bits(type) < type_positive_bits(rl_type(rl_right)))
957 type = rl_type(rl_right);
958 if (type_positive_bits(type) < 31)
959 type = &int_ctype;
960
961 rl_left = cast_rl(type, rl_left);
962 rl_right = cast_rl(type, rl_right);
963
964 FOR_EACH_PTR(rl_left, tmp_left) {
965 FOR_EACH_PTR(rl_right, tmp_right) {
966 if (false_comparison_range_sval(tmp_left, comparison, tmp_right))
967 return 1;
968 } END_FOR_EACH_PTR(tmp_right);
969 } END_FOR_EACH_PTR(tmp_left);
970 return 0;
971 }
972
973 int possibly_true_rl(struct range_list *left_ranges, int comparison, struct range_list *right_ranges)
974 {
975 struct data_range *left_tmp, *right_tmp;
976 struct symbol *type;
977
978 if (!left_ranges || !right_ranges)
979 return 1;
980
981 type = rl_type(left_ranges);
982 if (type_positive_bits(type) < type_positive_bits(rl_type(right_ranges)))
983 type = rl_type(right_ranges);
984 if (type_positive_bits(type) < 31)
985 type = &int_ctype;
986
987 left_ranges = cast_rl(type, left_ranges);
988 right_ranges = cast_rl(type, right_ranges);
989
990 FOR_EACH_PTR(left_ranges, left_tmp) {
991 FOR_EACH_PTR(right_ranges, right_tmp) {
992 if (true_comparison_range(left_tmp, comparison, right_tmp))
993 return 1;
994 } END_FOR_EACH_PTR(right_tmp);
995 } END_FOR_EACH_PTR(left_tmp);
996 return 0;
997 }
998
999 int possibly_false_rl(struct range_list *left_ranges, int comparison, struct range_list *right_ranges)
1000 {
1001 struct data_range *left_tmp, *right_tmp;
1002 struct symbol *type;
1003
1004 if (!left_ranges || !right_ranges)
1005 return 1;
1006
1007 type = rl_type(left_ranges);
1008 if (type_positive_bits(type) < type_positive_bits(rl_type(right_ranges)))
1009 type = rl_type(right_ranges);
1010 if (type_positive_bits(type) < 31)
1011 type = &int_ctype;
1012
1013 left_ranges = cast_rl(type, left_ranges);
1014 right_ranges = cast_rl(type, right_ranges);
1015
1016 FOR_EACH_PTR(left_ranges, left_tmp) {
1017 FOR_EACH_PTR(right_ranges, right_tmp) {
1018 if (false_comparison_range_sval(left_tmp, comparison, right_tmp))
1019 return 1;
1020 } END_FOR_EACH_PTR(right_tmp);
1021 } END_FOR_EACH_PTR(left_tmp);
1022 return 0;
1023 }
1024
1025 /* FIXME: the _rl here stands for right left so really it should be _lr */
1026 int possibly_true_rl_LR(int comparison, struct range_list *a, struct range_list *b, int left)
1027 {
1028 if (left)
1029 return possibly_true_rl(a, comparison, b);
1030 else
1031 return possibly_true_rl(b, comparison, a);
1032 }
1033
1034 int possibly_false_rl_LR(int comparison, struct range_list *a, struct range_list *b, int left)
1035 {
1036 if (left)
1037 return possibly_false_rl(a, comparison, b);
1038 else
1039 return possibly_false_rl(b, comparison, a);
1040 }
1041
1042 int rl_has_sval(struct range_list *rl, sval_t sval)
1043 {
1044 struct data_range *tmp;
1045
1046 FOR_EACH_PTR(rl, tmp) {
1047 if (sval_cmp(tmp->min, sval) <= 0 &&
1048 sval_cmp(tmp->max, sval) >= 0)
1049 return 1;
1050 } END_FOR_EACH_PTR(tmp);
1051 return 0;
1052 }
1053
1054 void tack_on(struct range_list **list, struct data_range *drange)
1055 {
1056 add_ptr_list(list, drange);
1057 }
1058
1059 void push_rl(struct range_list_stack **rl_stack, struct range_list *rl)
1060 {
1061 add_ptr_list(rl_stack, rl);
1062 }
1063
1064 struct range_list *pop_rl(struct range_list_stack **rl_stack)
1065 {
1066 struct range_list *rl;
1067
1068 rl = last_ptr_list((struct ptr_list *)*rl_stack);
1069 delete_ptr_list_last((struct ptr_list **)rl_stack);
1070 return rl;
1071 }
1072
1073 struct range_list *top_rl(struct range_list_stack *rl_stack)
1074 {
1075 struct range_list *rl;
1076
1077 rl = last_ptr_list((struct ptr_list *)rl_stack);
1078 return rl;
1079 }
1080
1081 void filter_top_rl(struct range_list_stack **rl_stack, struct range_list *filter)
1082 {
1083 struct range_list *rl;
1084
1085 rl = pop_rl(rl_stack);
1086 rl = rl_filter(rl, filter);
1087 push_rl(rl_stack, rl);
1088 }
1089
1090 struct range_list *rl_truncate_cast(struct symbol *type, struct range_list *rl)
1091 {
1092 struct data_range *tmp;
1093 struct range_list *ret = NULL;
1094 sval_t min, max;
1095
1096 if (!rl)
1097 return NULL;
1098
1099 if (!type || type == rl_type(rl))
1100 return rl;
1101
1102 FOR_EACH_PTR(rl, tmp) {
1103 min = tmp->min;
1104 max = tmp->max;
1105 if (type_bits(type) < type_bits(rl_type(rl))) {
1106 min.uvalue = tmp->min.uvalue & ((1ULL << type_bits(type)) - 1);
1107 max.uvalue = tmp->max.uvalue & ((1ULL << type_bits(type)) - 1);
1108 }
1109 if (sval_cmp(min, max) > 0) {
1110 min = sval_cast(type, min);
1111 max = sval_cast(type, max);
1112 }
1113 add_range_t(type, &ret, min, max);
1114 } END_FOR_EACH_PTR(tmp);
1115
1116 return ret;
1117 }
1118
1119 static int rl_is_sane(struct range_list *rl)
1120 {
1121 struct data_range *tmp;
1122 struct symbol *type;
1123
1124 type = rl_type(rl);
1125 FOR_EACH_PTR(rl, tmp) {
1126 if (!sval_fits(type, tmp->min))
1127 return 0;
1128 if (!sval_fits(type, tmp->max))
1129 return 0;
1130 if (sval_cmp(tmp->min, tmp->max) > 0)
1131 return 0;
1132 } END_FOR_EACH_PTR(tmp);
1133
1134 return 1;
1135 }
1136
1137 static int rl_type_consistent(struct range_list *rl)
1138 {
1139 struct data_range *tmp;
1140 struct symbol *type;
1141
1142 type = rl_type(rl);
1143 FOR_EACH_PTR(rl, tmp) {
1144 if (type != tmp->min.type || type != tmp->max.type)
1145 return 0;
1146 } END_FOR_EACH_PTR(tmp);
1147 return 1;
1148 }
1149
1150 struct range_list *cast_rl(struct symbol *type, struct range_list *rl)
1151 {
1152 struct data_range *tmp;
1153 struct range_list *ret = NULL;
1154
1155 if (!rl)
1156 return NULL;
1157
1158 if (!type)
1159 return rl;
1160 if (!rl_is_sane(rl))
1161 return alloc_whole_rl(type);
1162 if (type == rl_type(rl) && rl_type_consistent(rl))
1163 return rl;
1164
1165 FOR_EACH_PTR(rl, tmp) {
1166 add_range_t(type, &ret, tmp->min, tmp->max);
1167 } END_FOR_EACH_PTR(tmp);
1168
1169 if (!ret)
1170 return alloc_whole_rl(type);
1171
1172 return ret;
1173 }
1174
1175 struct range_list *rl_invert(struct range_list *orig)
1176 {
1177 struct range_list *ret = NULL;
1178 struct data_range *tmp;
1179 sval_t gap_min, abs_max, sval;
1180
1181 if (!orig)
1182 return NULL;
1183 if (type_bits(rl_type(orig)) < 0) /* void type mostly */
1184 return NULL;
1185
1186 gap_min = sval_type_min(rl_min(orig).type);
1187 abs_max = sval_type_max(rl_max(orig).type);
1188
1189 FOR_EACH_PTR(orig, tmp) {
1190 if (sval_cmp(tmp->min, gap_min) > 0) {
1191 sval = sval_type_val(tmp->min.type, tmp->min.value - 1);
1192 add_range(&ret, gap_min, sval);
1193 }
1194 if (sval_cmp(tmp->max, abs_max) == 0)
1195 return ret;
1196 gap_min = sval_type_val(tmp->max.type, tmp->max.value + 1);
1197 } END_FOR_EACH_PTR(tmp);
1198
1199 if (sval_cmp(gap_min, abs_max) <= 0)
1200 add_range(&ret, gap_min, abs_max);
1201
1202 return ret;
1203 }
1204
1205 struct range_list *rl_filter(struct range_list *rl, struct range_list *filter)
1206 {
1207 struct data_range *tmp;
1208
1209 FOR_EACH_PTR(filter, tmp) {
1210 rl = remove_range(rl, tmp->min, tmp->max);
1211 } END_FOR_EACH_PTR(tmp);
1212
1213 return rl;
1214 }
1215
1216 struct range_list *rl_intersection(struct range_list *one, struct range_list *two)
1217 {
1218 struct range_list *one_orig;
1219 struct range_list *two_orig;
1220 struct range_list *ret;
1221 struct symbol *ret_type;
1222 struct symbol *small_type;
1223 struct symbol *large_type;
1224
1225 if (!two)
1226 return NULL;
1227 if (!one)
1228 return NULL;
1229
1230 one_orig = one;
1231 two_orig = two;
1232
1233 ret_type = rl_type(one);
1234 small_type = rl_type(one);
1235 large_type = rl_type(two);
1236
1237 if (type_bits(rl_type(two)) < type_bits(small_type)) {
1238 small_type = rl_type(two);
1239 large_type = rl_type(one);
1240 }
1241
1242 one = cast_rl(large_type, one);
1243 two = cast_rl(large_type, two);
1244
1245 ret = one;
1246 one = rl_invert(one);
1247 two = rl_invert(two);
1248
1249 ret = rl_filter(ret, one);
1250 ret = rl_filter(ret, two);
1251
1252 one = cast_rl(small_type, one_orig);
1253 two = cast_rl(small_type, two_orig);
1254
1255 one = rl_invert(one);
1256 two = rl_invert(two);
1257
1258 ret = cast_rl(small_type, ret);
1259 ret = rl_filter(ret, one);
1260 ret = rl_filter(ret, two);
1261
1262 return cast_rl(ret_type, ret);
1263 }
1264
1265 static struct range_list *handle_mod_rl(struct range_list *left, struct range_list *right)
1266 {
1267 sval_t zero;
1268 sval_t max;
1269
1270 max = rl_max(right);
1271 if (sval_is_max(max))
1272 return left;
1273 if (max.value == 0)
1274 return NULL;
1275 max.value--;
1276 if (sval_is_negative(max))
1277 return NULL;
1278 if (sval_cmp(rl_max(left), max) < 0)
1279 return left;
1280 zero = max;
1281 zero.value = 0;
1282 return alloc_rl(zero, max);
1283 }
1284
1285 static struct range_list *get_neg_rl(struct range_list *rl)
1286 {
1287 struct data_range *tmp;
1288 struct data_range *new;
1289 struct range_list *ret = NULL;
1290
1291 if (!rl)
1292 return NULL;
1293 if (sval_is_positive(rl_min(rl)))
1294 return NULL;
1295
1296 FOR_EACH_PTR(rl, tmp) {
1297 if (sval_is_positive(tmp->min))
1298 return ret;
1299 if (sval_is_positive(tmp->max)) {
1300 new = alloc_range(tmp->min, tmp->max);
1301 new->max.value = -1;
1302 add_range(&ret, new->min, new->max);
1303 return ret;
1304 }
1305 add_range(&ret, tmp->min, tmp->max);
1306 } END_FOR_EACH_PTR(tmp);
1307
1308 return ret;
1309 }
1310
1311 static struct range_list *get_pos_rl(struct range_list *rl)
1312 {
1313 struct data_range *tmp;
1314 struct data_range *new;
1315 struct range_list *ret = NULL;
1316
1317 if (!rl)
1318 return NULL;
1319 if (sval_is_negative(rl_max(rl)))
1320 return NULL;
1321
1322 FOR_EACH_PTR(rl, tmp) {
1323 if (sval_is_negative(tmp->max))
1324 continue;
1325 if (sval_is_positive(tmp->min)) {
1326 add_range(&ret, tmp->min, tmp->max);
1327 continue;
1328 }
1329 new = alloc_range(tmp->min, tmp->max);
1330 new->min.value = 0;
1331 add_range(&ret, new->min, new->max);
1332 } END_FOR_EACH_PTR(tmp);
1333
1334 return ret;
1335 }
1336
1337 static struct range_list *divide_rl_helper(struct range_list *left, struct range_list *right)
1338 {
1339 sval_t right_min, right_max;
1340 sval_t min, max;
1341
1342 if (!left || !right)
1343 return NULL;
1344
1345 /* let's assume we never divide by zero */
1346 right_min = rl_min(right);
1347 right_max = rl_max(right);
1348 if (right_min.value == 0 && right_max.value == 0)
1349 return NULL;
1350 if (right_min.value == 0)
1351 right_min.value = 1;
1352 if (right_max.value == 0)
1353 right_max.value = -1;
1354
1355 max = sval_binop(rl_max(left), '/', right_min);
1356 min = sval_binop(rl_min(left), '/', right_max);
1357
1358 return alloc_rl(min, max);
1359 }
1360
1361 static struct range_list *handle_divide_rl(struct range_list *left, struct range_list *right)
1362 {
1363 struct range_list *left_neg, *left_pos, *right_neg, *right_pos;
1364 struct range_list *neg_neg, *neg_pos, *pos_neg, *pos_pos;
1365 struct range_list *ret;
1366
1367 if (is_whole_rl(right))
1368 return NULL;
1369
1370 left_neg = get_neg_rl(left);
1371 left_pos = get_pos_rl(left);
1372 right_neg = get_neg_rl(right);
1373 right_pos = get_pos_rl(right);
1374
1375 neg_neg = divide_rl_helper(left_neg, right_neg);
1376 neg_pos = divide_rl_helper(left_neg, right_pos);
1377 pos_neg = divide_rl_helper(left_pos, right_neg);
1378 pos_pos = divide_rl_helper(left_pos, right_pos);
1379
1380 ret = rl_union(neg_neg, neg_pos);
1381 ret = rl_union(ret, pos_neg);
1382 return rl_union(ret, pos_pos);
1383 }
1384
1385 static struct range_list *handle_add_mult_rl(struct range_list *left, int op, struct range_list *right)
1386 {
1387 sval_t min, max;
1388
1389 if (sval_binop_overflows(rl_min(left), op, rl_min(right)))
1390 return NULL;
1391 min = sval_binop(rl_min(left), op, rl_min(right));
1392
1393 if (sval_binop_overflows(rl_max(left), op, rl_max(right)))
1394 return NULL;
1395 max = sval_binop(rl_max(left), op, rl_max(right));
1396
1397 return alloc_rl(min, max);
1398 }
1399
1400 static unsigned long long rl_bits_always_set(struct range_list *rl)
1401 {
1402 return sval_fls_mask(rl_min(rl));
1403 }
1404
1405 static unsigned long long rl_bits_maybe_set(struct range_list *rl)
1406 {
1407 return sval_fls_mask(rl_max(rl));
1408 }
1409
1410 static struct range_list *handle_OR_rl(struct range_list *left, struct range_list *right)
1411 {
1412 unsigned long long left_min, left_max, right_min, right_max;
1413 sval_t min, max;
1414 sval_t sval;
1415
1416 if ((rl_to_sval(left, &sval) || rl_to_sval(right, &sval)) &&
1417 !sval_binop_overflows(rl_max(left), '+', rl_max(right)))
1418 return rl_binop(left, '+', right);
1419
1420 left_min = rl_bits_always_set(left);
1421 left_max = rl_bits_maybe_set(left);
1422 right_min = rl_bits_always_set(right);
1423 right_max = rl_bits_maybe_set(right);
1424
1425 min.type = max.type = &ullong_ctype;
1426 min.uvalue = left_min | right_min;
1427 max.uvalue = left_max | right_max;
1428
1429 return cast_rl(rl_type(left), alloc_rl(min, max));
1430 }
1431
1432 static struct range_list *handle_XOR_rl(struct range_list *left, struct range_list *right)
1433 {
1434 unsigned long long left_set, left_maybe;
1435 unsigned long long right_set, right_maybe;
1436 sval_t zero, max;
1437
1438 left_set = rl_bits_always_set(left);
1439 left_maybe = rl_bits_maybe_set(left);
1440
1441 right_set = rl_bits_always_set(right);
1442 right_maybe = rl_bits_maybe_set(right);
1443
1444 zero = max = rl_min(left);
1445 zero.uvalue = 0;
1446 max.uvalue = fls_mask((left_maybe | right_maybe) ^ (left_set & right_set));
1447
1448 return cast_rl(rl_type(left), alloc_rl(zero, max));
1449 }
1450
1451 struct range_list *rl_binop(struct range_list *left, int op, struct range_list *right)
1452 {
1453 struct symbol *cast_type;
1454 sval_t left_sval, right_sval;
1455 struct range_list *ret = NULL;
1456
1457 cast_type = rl_type(left);
1458 if (sval_type_max(rl_type(left)).uvalue < sval_type_max(rl_type(right)).uvalue)
1459 cast_type = rl_type(right);
1460 if (sval_type_max(cast_type).uvalue < INT_MAX)
1461 cast_type = &int_ctype;
1462
1463 left = cast_rl(cast_type, left);
1464 right = cast_rl(cast_type, right);
1465
1466 if (!left || !right)
1467 return alloc_whole_rl(cast_type);
1468
1469 if (rl_to_sval(left, &left_sval) && rl_to_sval(right, &right_sval)) {
1470 sval_t val = sval_binop(left_sval, op, right_sval);
1471 return alloc_rl(val, val);
1472 }
1473
1474 switch (op) {
1475 case '%':
1476 ret = handle_mod_rl(left, right);
1477 break;
1478 case '/':
1479 ret = handle_divide_rl(left, right);
1480 break;
1481 case '*':
1482 case '+':
1483 ret = handle_add_mult_rl(left, op, right);
1484 break;
1485 case '|':
1486 ret = handle_OR_rl(left, right);
1487 break;
1488 case '^':
1489 ret = handle_XOR_rl(left, right);
1490 break;
1491
1492 /* FIXME: Do the rest as well */
1493 case '-':
1494 case '&':
1495 case SPECIAL_RIGHTSHIFT:
1496 case SPECIAL_LEFTSHIFT:
1497 break;
1498 }
1499
1500 if (!ret)
1501 ret = alloc_whole_rl(cast_type);
1502 return ret;
1503 }
1504
1505 void free_rl(struct range_list **rlist)
1506 {
1507 __free_ptr_list((struct ptr_list **)rlist);
1508 }
1509
1510 static void free_single_dinfo(struct data_info *dinfo)
1511 {
1512 free_rl(&dinfo->value_ranges);
1513 }
1514
1515 static void free_dinfos(struct allocation_blob *blob)
1516 {
1517 unsigned int size = sizeof(struct data_info);
1518 unsigned int offset = 0;
1519
1520 while (offset < blob->offset) {
1521 free_single_dinfo((struct data_info *)(blob->data + offset));
1522 offset += size;
1523 }
1524 }
1525
1526 void free_data_info_allocs(void)
1527 {
1528 struct allocator_struct *desc = &data_info_allocator;
1529 struct allocation_blob *blob = desc->blobs;
1530
1531 desc->blobs = NULL;
1532 desc->allocations = 0;
1533 desc->total_bytes = 0;
1534 desc->useful_bytes = 0;
1535 desc->freelist = NULL;
1536 while (blob) {
1537 struct allocation_blob *next = blob->next;
1538 free_dinfos(blob);
1539 blob_free(blob, desc->chunking);
1540 blob = next;
1541 }
1542 clear_data_range_alloc();
1543 }
1544
1545 void split_comparison_rl(struct range_list *left_orig, int op, struct range_list *right_orig,
1546 struct range_list **left_true_rl, struct range_list **left_false_rl,
1547 struct range_list **right_true_rl, struct range_list **right_false_rl)
1548 {
1549 struct range_list *left_true, *left_false;
1550 struct range_list *right_true, *right_false;
1551 sval_t min, max;
1552
1553 min = sval_type_min(rl_type(left_orig));
1554 max = sval_type_max(rl_type(left_orig));
1555
1556 left_true = clone_rl(left_orig);
1557 left_false = clone_rl(left_orig);
1558 right_true = clone_rl(right_orig);
1559 right_false = clone_rl(right_orig);
1560
1561 switch (op) {
1562 case '<':
1563 case SPECIAL_UNSIGNED_LT:
1564 left_true = remove_range(left_orig, rl_max(right_orig), max);
1565 if (!sval_is_min(rl_min(right_orig))) {
1566 left_false = remove_range(left_orig, min, sub_one(rl_min(right_orig)));
1567 }
1568
1569 right_true = remove_range(right_orig, min, rl_min(left_orig));
1570 if (!sval_is_max(rl_max(left_orig)))
1571 right_false = remove_range(right_orig, add_one(rl_max(left_orig)), max);
1572 break;
1573 case SPECIAL_UNSIGNED_LTE:
1574 case SPECIAL_LTE:
1575 if (!sval_is_max(rl_max(right_orig)))
1576 left_true = remove_range(left_orig, add_one(rl_max(right_orig)), max);
1577 left_false = remove_range(left_orig, min, rl_min(right_orig));
1578
1579 if (!sval_is_min(rl_min(left_orig)))
1580 right_true = remove_range(right_orig, min, sub_one(rl_min(left_orig)));
1581 right_false = remove_range(right_orig, rl_max(left_orig), max);
1582
1583 if (sval_cmp(rl_min(left_orig), rl_min(right_orig)) == 0)
1584 left_false = remove_range(left_false, rl_min(left_orig), rl_min(left_orig));
1585 if (sval_cmp(rl_max(left_orig), rl_max(right_orig)) == 0)
1586 right_false = remove_range(right_false, rl_max(left_orig), rl_max(left_orig));
1587 break;
1588 case SPECIAL_EQUAL:
1589 if (!sval_is_max(rl_max(right_orig))) {
1590 left_true = remove_range(left_true, add_one(rl_max(right_orig)), max);
1591 }
1592 if (!sval_is_min(rl_min(right_orig))) {
1593 left_true = remove_range(left_true, min, sub_one(rl_min(right_orig)));
1594 }
1595 if (sval_cmp(rl_min(right_orig), rl_max(right_orig)) == 0)
1596 left_false = remove_range(left_orig, rl_min(right_orig), rl_min(right_orig));
1597
1598 if (!sval_is_max(rl_max(left_orig)))
1599 right_true = remove_range(right_true, add_one(rl_max(left_orig)), max);
1600 if (!sval_is_min(rl_min(left_orig)))
1601 right_true = remove_range(right_true, min, sub_one(rl_min(left_orig)));
1602 if (sval_cmp(rl_min(left_orig), rl_max(left_orig)) == 0)
1603 right_false = remove_range(right_orig, rl_min(left_orig), rl_min(left_orig));
1604 break;
1605 case SPECIAL_UNSIGNED_GTE:
1606 case SPECIAL_GTE:
1607 if (!sval_is_min(rl_min(right_orig)))
1608 left_true = remove_range(left_orig, min, sub_one(rl_min(right_orig)));
1609 left_false = remove_range(left_orig, rl_max(right_orig), max);
1610
1611 if (!sval_is_max(rl_max(left_orig)))
1612 right_true = remove_range(right_orig, add_one(rl_max(left_orig)), max);
1613 right_false = remove_range(right_orig, min, rl_min(left_orig));
1614
1615 if (sval_cmp(rl_min(left_orig), rl_min(right_orig)) == 0)
1616 right_false = remove_range(right_false, rl_min(left_orig), rl_min(left_orig));
1617 if (sval_cmp(rl_max(left_orig), rl_max(right_orig)) == 0)
1618 left_false = remove_range(left_false, rl_max(left_orig), rl_max(left_orig));
1619 break;
1620 case '>':
1621 case SPECIAL_UNSIGNED_GT:
1622 left_true = remove_range(left_orig, min, rl_min(right_orig));
1623 if (!sval_is_max(rl_max(right_orig)))
1624 left_false = remove_range(left_orig, add_one(rl_max(right_orig)), max);
1625
1626 right_true = remove_range(right_orig, rl_max(left_orig), max);
1627 if (!sval_is_min(rl_min(left_orig)))
1628 right_false = remove_range(right_orig, min, sub_one(rl_min(left_orig)));
1629 break;
1630 case SPECIAL_NOTEQUAL:
1631 if (!sval_is_max(rl_max(right_orig)))
1632 left_false = remove_range(left_false, add_one(rl_max(right_orig)), max);
1633 if (!sval_is_min(rl_min(right_orig)))
1634 left_false = remove_range(left_false, min, sub_one(rl_min(right_orig)));
1635 if (sval_cmp(rl_min(right_orig), rl_max(right_orig)) == 0)
1636 left_true = remove_range(left_orig, rl_min(right_orig), rl_min(right_orig));
1637
1638 if (!sval_is_max(rl_max(left_orig)))
1639 right_false = remove_range(right_false, add_one(rl_max(left_orig)), max);
1640 if (!sval_is_min(rl_min(left_orig)))
1641 right_false = remove_range(right_false, min, sub_one(rl_min(left_orig)));
1642 if (sval_cmp(rl_min(left_orig), rl_max(left_orig)) == 0)
1643 right_true = remove_range(right_orig, rl_min(left_orig), rl_min(left_orig));
1644 break;
1645 default:
1646 sm_msg("internal error: unhandled comparison %d", op);
1647 return;
1648 }
1649
1650 if (left_true_rl) {
1651 *left_true_rl = left_true;
1652 *left_false_rl = left_false;
1653 }
1654 if (right_true_rl) {
1655 *right_true_rl = right_true;
1656 *right_false_rl = right_false;
1657 }
1658 }
Static analysis for C