?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
extra: fix values_fit_type()
[smatch.git] / smatch_ranges.c
blob8e0918d0c8595868822d6762bd7f388a2202f21b
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 filter_by_comparison(&start_rl, comparison, right_orig);
300 return start_rl;
301 }
302
303 static sval_t parse_val(int use_max, struct expression *call, struct symbol *type, char *c, char **endp)
304 {
305 char *start = c;
306 sval_t ret;
307
308 if (!strncmp(start, "max", 3)) {
309 ret = sval_type_max(type);
310 c += 3;
311 } else if (!strncmp(start, "u64max", 6)) {
312 ret = sval_type_val(type, ULLONG_MAX);
313 c += 6;
314 } else if (!strncmp(start, "s64max", 6)) {
315 ret = sval_type_val(type, LLONG_MAX);
316 c += 6;
317 } else if (!strncmp(start, "u32max", 6)) {
318 ret = sval_type_val(type, UINT_MAX);
319 c += 6;
320 } else if (!strncmp(start, "s32max", 6)) {
321 ret = sval_type_val(type, INT_MAX);
322 c += 6;
323 } else if (!strncmp(start, "u16max", 6)) {
324 ret = sval_type_val(type, USHRT_MAX);
325 c += 6;
326 } else if (!strncmp(start, "s16max", 6)) {
327 ret = sval_type_val(type, SHRT_MAX);
328 c += 6;
329 } else if (!strncmp(start, "min", 3)) {
330 ret = sval_type_min(type);
331 c += 3;
332 } else if (!strncmp(start, "s64min", 6)) {
333 ret = sval_type_val(type, LLONG_MIN);
334 c += 6;
335 } else if (!strncmp(start, "s32min", 6)) {
336 ret = sval_type_val(type, INT_MIN);
337 c += 6;
338 } else if (!strncmp(start, "s16min", 6)) {
339 ret = sval_type_val(type, SHRT_MIN);
340 c += 6;
341 } else if (!strncmp(start, "long_min", 8)) {
342 ret = sval_type_val(type, LONG_MIN);
343 c += 8;
344 } else if (!strncmp(start, "long_max", 8)) {
345 ret = sval_type_val(type, LONG_MAX);
346 c += 8;
347 } else if (!strncmp(start, "ulong_max", 9)) {
348 ret = sval_type_val(type, ULONG_MAX);
349 c += 8;
350 } else if (!strncmp(start, "ptr_max", 7)) {
351 ret = sval_type_val(type, valid_ptr_max);
352 c += 8;
353 } else if (start[0] == '[') {
354 /* this parses [==p0] comparisons */
355 get_val_from_key(1, type, start, call, &c, &ret);
356 } else {
357 ret = sval_type_val(type, strtoll(start, &c, 10));
358 }
359 *endp = c;
360 return ret;
361 }
362
363 static char *jump_to_call_math(char *value)
364 {
365 char *c = value;
366
367 while (*c && *c != '[')
368 c++;
369
370 if (!*c)
371 return NULL;
372 c++;
373 if (*c == '<' || *c == '=' || *c == '>' || *c == '!')
374 return NULL;
375
376 return c;
377 }
378
379 static void str_to_rl_helper(struct expression *call, struct symbol *type, char *str, char **endp, struct range_list **rl)
380 {
381 struct range_list *rl_tmp = NULL;
382 sval_t min, max;
383 char *c;
384
385 min = sval_type_min(type);
386 max = sval_type_max(type);
387 c = str;
388 while (*c != '\0' && *c != '[') {
389 if (*c == '(')
390 c++;
391 min = parse_val(0, call, type, c, &c);
392 max = min;
393 if (*c == ')')
394 c++;
395 if (*c == '\0' || *c == '[') {
396 add_range_t(type, &rl_tmp, min, min);
397 break;
398 }
399 if (*c == ',') {
400 add_range_t(type, &rl_tmp, min, min);
401 c++;
402 continue;
403 }
404 if (*c != '-') {
405 sm_msg("debug XXX: trouble parsing %s c = %s", str, c);
406 break;
407 }
408 c++;
409 if (*c == '(')
410 c++;
411 max = parse_val(1, call, type, c, &c);
412 add_range_t(type, &rl_tmp, min, max);
413 if (*c == ')')
414 c++;
415 if (*c == ',')
416 c++;
417 }
418
419 *rl = rl_tmp;
420 *endp = c;
421 }
422
423 static void str_to_dinfo(struct expression *call, struct symbol *type, char *value, struct data_info *dinfo)
424 {
425 struct range_list *math_rl;
426 char *call_math;
427 char *c;
428 struct range_list *rl = NULL;
429
430 if (!type)
431 type = &llong_ctype;
432
433 if (strcmp(value, "empty") == 0)
434 return;
435
436 if (strncmp(value, "[==$", 4) == 0) {
437 struct expression *arg;
438 int comparison;
439
440 if (!str_to_comparison_arg(value, call, &comparison, &arg))
441 return;
442 if (!get_implied_rl(arg, &rl))
443 return;
444 goto cast;
445 }
446
447 str_to_rl_helper(call, type, value, &c, &rl);
448 if (*c == '\0')
449 goto cast;
450
451 call_math = jump_to_call_math(value);
452 if (call_math && parse_call_math_rl(call, call_math, &math_rl)) {
453 rl = rl_intersection(rl, math_rl);
454 goto cast;
455 }
456
457 /*
458 * For now if we already tried to handle the call math and couldn't
459 * figure it out then bail.
460 */
461 if (jump_to_call_math(c) == c + 1)
462 goto cast;
463
464 rl = filter_by_comparison_call(c, call, &c, rl);
465
466 cast:
467 rl = cast_rl(type, rl);
468 dinfo->value_ranges = rl;
469 }
470
471 void str_to_rl(struct symbol *type, char *value, struct range_list **rl)
472 {
473 struct data_info dinfo = {};
474
475 str_to_dinfo(NULL, type, value, &dinfo);
476 *rl = dinfo.value_ranges;
477 }
478
479 void call_results_to_rl(struct expression *expr, struct symbol *type, char *value, struct range_list **rl)
480 {
481 struct data_info dinfo = {};
482
483 str_to_dinfo(strip_expr(expr), type, value, &dinfo);
484 *rl = dinfo.value_ranges;
485 }
486
487 int is_whole_rl(struct range_list *rl)
488 {
489 struct data_range *drange;
490
491 if (ptr_list_empty(rl))
492 return 0;
493 drange = first_ptr_list((struct ptr_list *)rl);
494 if (sval_is_min(drange->min) && sval_is_max(drange->max))
495 return 1;
496 return 0;
497 }
498
499 sval_t rl_min(struct range_list *rl)
500 {
501 struct data_range *drange;
502 sval_t ret;
503
504 ret.type = &llong_ctype;
505 ret.value = LLONG_MIN;
506 if (ptr_list_empty(rl))
507 return ret;
508 drange = first_ptr_list((struct ptr_list *)rl);
509 return drange->min;
510 }
511
512 sval_t rl_max(struct range_list *rl)
513 {
514 struct data_range *drange;
515 sval_t ret;
516
517 ret.type = &llong_ctype;
518 ret.value = LLONG_MAX;
519 if (ptr_list_empty(rl))
520 return ret;
521 drange = last_ptr_list((struct ptr_list *)rl);
522 return drange->max;
523 }
524
525 int rl_to_sval(struct range_list *rl, sval_t *sval)
526 {
527 sval_t min, max;
528
529 if (!rl)
530 return 0;
531
532 min = rl_min(rl);
533 max = rl_max(rl);
534 if (sval_cmp(min, max) != 0)
535 return 0;
536 *sval = min;
537 return 1;
538 }
539
540 struct symbol *rl_type(struct range_list *rl)
541 {
542 if (!rl)
543 return NULL;
544 return rl_min(rl).type;
545 }
546
547 static struct data_range *alloc_range_helper_sval(sval_t min, sval_t max, int perm)
548 {
549 struct data_range *ret;
550
551 if (perm)
552 ret = __alloc_perm_data_range(0);
553 else
554 ret = __alloc_data_range(0);
555 ret->min = min;
556 ret->max = max;
557 return ret;
558 }
559
560 struct data_range *alloc_range(sval_t min, sval_t max)
561 {
562 return alloc_range_helper_sval(min, max, 0);
563 }
564
565 struct data_range *alloc_range_perm(sval_t min, sval_t max)
566 {
567 return alloc_range_helper_sval(min, max, 1);
568 }
569
570 struct range_list *alloc_rl(sval_t min, sval_t max)
571 {
572 struct range_list *rl = NULL;
573
574 if (sval_cmp(min, max) > 0)
575 return alloc_whole_rl(min.type);
576
577 add_range(&rl, min, max);
578 return rl;
579 }
580
581 struct range_list *alloc_whole_rl(struct symbol *type)
582 {
583 if (!type || type_positive_bits(type) < 0)
584 type = &llong_ctype;
585 if (type->type == SYM_ARRAY)
586 type = &ptr_ctype;
587
588 return alloc_rl(sval_type_min(type), sval_type_max(type));
589 }
590
591 void add_range(struct range_list **list, sval_t min, sval_t max)
592 {
593 struct data_range *tmp = NULL;
594 struct data_range *new = NULL;
595 int check_next = 0;
596
597 if (sval_cmp(min, max) > 0) {
598 min = sval_type_min(min.type);
599 max = sval_type_max(min.type);
600 }
601
602 /*
603 * FIXME: This has a problem merging a range_list like: min-0,3-max
604 * with a range like 1-2. You end up with min-2,3-max instead of
605 * just min-max.
606 */
607 FOR_EACH_PTR(*list, tmp) {
608 if (check_next) {
609 /* Sometimes we overlap with more than one range
610 so we have to delete or modify the next range. */
611 if (!sval_is_max(max) && max.value + 1 == tmp->min.value) {
612 /* join 2 ranges here */
613 new->max = tmp->max;
614 DELETE_CURRENT_PTR(tmp);
615 return;
616 }
617
618 /* Doesn't overlap with the next one. */
619 if (sval_cmp(max, tmp->min) < 0)
620 return;
621
622 if (sval_cmp(max, tmp->max) <= 0) {
623 /* Partially overlaps the next one. */
624 new->max = tmp->max;
625 DELETE_CURRENT_PTR(tmp);
626 return;
627 } else {
628 /* Completely overlaps the next one. */
629 DELETE_CURRENT_PTR(tmp);
630 /* there could be more ranges to delete */
631 continue;
632 }
633 }
634 if (!sval_is_max(max) && max.value + 1 == tmp->min.value) {
635 /* join 2 ranges into a big range */
636 new = alloc_range(min, tmp->max);
637 REPLACE_CURRENT_PTR(tmp, new);
638 return;
639 }
640 if (sval_cmp(max, tmp->min) < 0) { /* new range entirely below */
641 new = alloc_range(min, max);
642 INSERT_CURRENT(new, tmp);
643 return;
644 }
645 if (sval_cmp(min, tmp->min) < 0) { /* new range partially below */
646 if (sval_cmp(max, tmp->max) < 0)
647 max = tmp->max;
648 else
649 check_next = 1;
650 new = alloc_range(min, max);
651 REPLACE_CURRENT_PTR(tmp, new);
652 if (!check_next)
653 return;
654 continue;
655 }
656 if (sval_cmp(max, tmp->max) <= 0) /* new range already included */
657 return;
658 if (sval_cmp(min, tmp->max) <= 0) { /* new range partially above */
659 min = tmp->min;
660 new = alloc_range(min, max);
661 REPLACE_CURRENT_PTR(tmp, new);
662 check_next = 1;
663 continue;
664 }
665 if (!sval_is_min(min) && min.value - 1 == tmp->max.value) {
666 /* join 2 ranges into a big range */
667 new = alloc_range(tmp->min, max);
668 REPLACE_CURRENT_PTR(tmp, new);
669 check_next = 1;
670 continue;
671 }
672 /* the new range is entirely above the existing ranges */
673 } END_FOR_EACH_PTR(tmp);
674 if (check_next)
675 return;
676 new = alloc_range(min, max);
677 add_ptr_list(list, new);
678 }
679
680 struct range_list *clone_rl(struct range_list *list)
681 {
682 struct data_range *tmp;
683 struct range_list *ret = NULL;
684
685 FOR_EACH_PTR(list, tmp) {
686 add_ptr_list(&ret, tmp);
687 } END_FOR_EACH_PTR(tmp);
688 return ret;
689 }
690
691 struct range_list *clone_rl_permanent(struct range_list *list)
692 {
693 struct data_range *tmp;
694 struct data_range *new;
695 struct range_list *ret = NULL;
696
697 FOR_EACH_PTR(list, tmp) {
698 new = alloc_range_perm(tmp->min, tmp->max);
699 add_ptr_list(&ret, new);
700 } END_FOR_EACH_PTR(tmp);
701 return ret;
702 }
703
704 struct range_list *rl_union(struct range_list *one, struct range_list *two)
705 {
706 struct data_range *tmp;
707 struct range_list *ret = NULL;
708
709 FOR_EACH_PTR(one, tmp) {
710 add_range(&ret, tmp->min, tmp->max);
711 } END_FOR_EACH_PTR(tmp);
712 FOR_EACH_PTR(two, tmp) {
713 add_range(&ret, tmp->min, tmp->max);
714 } END_FOR_EACH_PTR(tmp);
715 return ret;
716 }
717
718 struct range_list *remove_range(struct range_list *list, sval_t min, sval_t max)
719 {
720 struct data_range *tmp;
721 struct range_list *ret = NULL;
722
723 FOR_EACH_PTR(list, tmp) {
724 if (sval_cmp(tmp->max, min) < 0) {
725 add_range(&ret, tmp->min, tmp->max);
726 continue;
727 }
728 if (sval_cmp(tmp->min, max) > 0) {
729 add_range(&ret, tmp->min, tmp->max);
730 continue;
731 }
732 if (sval_cmp(tmp->min, min) >= 0 && sval_cmp(tmp->max, max) <= 0)
733 continue;
734 if (sval_cmp(tmp->min, min) >= 0) {
735 max.value++;
736 add_range(&ret, max, tmp->max);
737 } else if (sval_cmp(tmp->max, max) <= 0) {
738 min.value--;
739 add_range(&ret, tmp->min, min);
740 } else {
741 min.value--;
742 max.value++;
743 add_range(&ret, tmp->min, min);
744 add_range(&ret, max, tmp->max);
745 }
746 } END_FOR_EACH_PTR(tmp);
747 return ret;
748 }
749
750 int ranges_equiv(struct data_range *one, struct data_range *two)
751 {
752 if (!one && !two)
753 return 1;
754 if (!one || !two)
755 return 0;
756 if (sval_cmp(one->min, two->min) != 0)
757 return 0;
758 if (sval_cmp(one->max, two->max) != 0)
759 return 0;
760 return 1;
761 }
762
763 int rl_equiv(struct range_list *one, struct range_list *two)
764 {
765 struct data_range *one_range;
766 struct data_range *two_range;
767
768 if (one == two)
769 return 1;
770
771 PREPARE_PTR_LIST(one, one_range);
772 PREPARE_PTR_LIST(two, two_range);
773 for (;;) {
774 if (!one_range && !two_range)
775 return 1;
776 if (!ranges_equiv(one_range, two_range))
777 return 0;
778 NEXT_PTR_LIST(one_range);
779 NEXT_PTR_LIST(two_range);
780 }
781 FINISH_PTR_LIST(two_range);
782 FINISH_PTR_LIST(one_range);
783
784 return 1;
785 }
786
787 int true_comparison_range(struct data_range *left, int comparison, struct data_range *right)
788 {
789 switch (comparison) {
790 case '<':
791 case SPECIAL_UNSIGNED_LT:
792 if (sval_cmp(left->min, right->max) < 0)
793 return 1;
794 return 0;
795 case SPECIAL_UNSIGNED_LTE:
796 case SPECIAL_LTE:
797 if (sval_cmp(left->min, right->max) <= 0)
798 return 1;
799 return 0;
800 case SPECIAL_EQUAL:
801 if (sval_cmp(left->max, right->min) < 0)
802 return 0;
803 if (sval_cmp(left->min, right->max) > 0)
804 return 0;
805 return 1;
806 case SPECIAL_UNSIGNED_GTE:
807 case SPECIAL_GTE:
808 if (sval_cmp(left->max, right->min) >= 0)
809 return 1;
810 return 0;
811 case '>':
812 case SPECIAL_UNSIGNED_GT:
813 if (sval_cmp(left->max, right->min) > 0)
814 return 1;
815 return 0;
816 case SPECIAL_NOTEQUAL:
817 if (sval_cmp(left->min, left->max) != 0)
818 return 1;
819 if (sval_cmp(right->min, right->max) != 0)
820 return 1;
821 if (sval_cmp(left->min, right->min) != 0)
822 return 1;
823 return 0;
824 default:
825 sm_msg("unhandled comparison %d\n", comparison);
826 return 0;
827 }
828 return 0;
829 }
830
831 int true_comparison_range_LR(int comparison, struct data_range *var, struct data_range *val, int left)
832 {
833 if (left)
834 return true_comparison_range(var, comparison, val);
835 else
836 return true_comparison_range(val, comparison, var);
837 }
838
839 static int false_comparison_range_sval(struct data_range *left, int comparison, struct data_range *right)
840 {
841 switch (comparison) {
842 case '<':
843 case SPECIAL_UNSIGNED_LT:
844 if (sval_cmp(left->max, right->min) >= 0)
845 return 1;
846 return 0;
847 case SPECIAL_UNSIGNED_LTE:
848 case SPECIAL_LTE:
849 if (sval_cmp(left->max, right->min) > 0)
850 return 1;
851 return 0;
852 case SPECIAL_EQUAL:
853 if (sval_cmp(left->min, left->max) != 0)
854 return 1;
855 if (sval_cmp(right->min, right->max) != 0)
856 return 1;
857 if (sval_cmp(left->min, right->min) != 0)
858 return 1;
859 return 0;
860 case SPECIAL_UNSIGNED_GTE:
861 case SPECIAL_GTE:
862 if (sval_cmp(left->min, right->max) < 0)
863 return 1;
864 return 0;
865 case '>':
866 case SPECIAL_UNSIGNED_GT:
867 if (sval_cmp(left->min, right->max) <= 0)
868 return 1;
869 return 0;
870 case SPECIAL_NOTEQUAL:
871 if (sval_cmp(left->max, right->min) < 0)
872 return 0;
873 if (sval_cmp(left->min, right->max) > 0)
874 return 0;
875 return 1;
876 default:
877 sm_msg("unhandled comparison %d\n", comparison);
878 return 0;
879 }
880 return 0;
881 }
882
883 int false_comparison_range_LR(int comparison, struct data_range *var, struct data_range *val, int left)
884 {
885 if (left)
886 return false_comparison_range_sval(var, comparison, val);
887 else
888 return false_comparison_range_sval(val, comparison, var);
889 }
890
891 int possibly_true(struct expression *left, int comparison, struct expression *right)
892 {
893 struct range_list *rl_left, *rl_right;
894 struct data_range *tmp_left, *tmp_right;
895 struct symbol *type;
896
897 if (!get_implied_rl(left, &rl_left))
898 return 1;
899 if (!get_implied_rl(right, &rl_right))
900 return 1;
901
902 type = rl_type(rl_left);
903 if (type_positive_bits(type) < type_positive_bits(rl_type(rl_right)))
904 type = rl_type(rl_right);
905 if (type_positive_bits(type) < 31)
906 type = &int_ctype;
907
908 rl_left = cast_rl(type, rl_left);
909 rl_right = cast_rl(type, rl_right);
910
911 FOR_EACH_PTR(rl_left, tmp_left) {
912 FOR_EACH_PTR(rl_right, tmp_right) {
913 if (true_comparison_range(tmp_left, comparison, tmp_right))
914 return 1;
915 } END_FOR_EACH_PTR(tmp_right);
916 } END_FOR_EACH_PTR(tmp_left);
917 return 0;
918 }
919
920 int possibly_false(struct expression *left, int comparison, struct expression *right)
921 {
922 struct range_list *rl_left, *rl_right;
923 struct data_range *tmp_left, *tmp_right;
924 struct symbol *type;
925
926 if (!get_implied_rl(left, &rl_left))
927 return 1;
928 if (!get_implied_rl(right, &rl_right))
929 return 1;
930
931 type = rl_type(rl_left);
932 if (type_positive_bits(type) < type_positive_bits(rl_type(rl_right)))
933 type = rl_type(rl_right);
934 if (type_positive_bits(type) < 31)
935 type = &int_ctype;
936
937 rl_left = cast_rl(type, rl_left);
938 rl_right = cast_rl(type, rl_right);
939
940 FOR_EACH_PTR(rl_left, tmp_left) {
941 FOR_EACH_PTR(rl_right, tmp_right) {
942 if (false_comparison_range_sval(tmp_left, comparison, tmp_right))
943 return 1;
944 } END_FOR_EACH_PTR(tmp_right);
945 } END_FOR_EACH_PTR(tmp_left);
946 return 0;
947 }
948
949 int possibly_true_rl(struct range_list *left_ranges, int comparison, struct range_list *right_ranges)
950 {
951 struct data_range *left_tmp, *right_tmp;
952 struct symbol *type;
953
954 if (!left_ranges || !right_ranges)
955 return 1;
956
957 type = rl_type(left_ranges);
958 if (type_positive_bits(type) < type_positive_bits(rl_type(right_ranges)))
959 type = rl_type(right_ranges);
960 if (type_positive_bits(type) < 31)
961 type = &int_ctype;
962
963 left_ranges = cast_rl(type, left_ranges);
964 right_ranges = cast_rl(type, right_ranges);
965
966 FOR_EACH_PTR(left_ranges, left_tmp) {
967 FOR_EACH_PTR(right_ranges, right_tmp) {
968 if (true_comparison_range(left_tmp, comparison, right_tmp))
969 return 1;
970 } END_FOR_EACH_PTR(right_tmp);
971 } END_FOR_EACH_PTR(left_tmp);
972 return 0;
973 }
974
975 int possibly_false_rl(struct range_list *left_ranges, int comparison, struct range_list *right_ranges)
976 {
977 struct data_range *left_tmp, *right_tmp;
978 struct symbol *type;
979
980 if (!left_ranges || !right_ranges)
981 return 1;
982
983 type = rl_type(left_ranges);
984 if (type_positive_bits(type) < type_positive_bits(rl_type(right_ranges)))
985 type = rl_type(right_ranges);
986 if (type_positive_bits(type) < 31)
987 type = &int_ctype;
988
989 left_ranges = cast_rl(type, left_ranges);
990 right_ranges = cast_rl(type, right_ranges);
991
992 FOR_EACH_PTR(left_ranges, left_tmp) {
993 FOR_EACH_PTR(right_ranges, right_tmp) {
994 if (false_comparison_range_sval(left_tmp, comparison, right_tmp))
995 return 1;
996 } END_FOR_EACH_PTR(right_tmp);
997 } END_FOR_EACH_PTR(left_tmp);
998 return 0;
999 }
1000
1001 /* FIXME: the _rl here stands for right left so really it should be _lr */
1002 int possibly_true_rl_LR(int comparison, struct range_list *a, struct range_list *b, int left)
1003 {
1004 if (left)
1005 return possibly_true_rl(a, comparison, b);
1006 else
1007 return possibly_true_rl(b, comparison, a);
1008 }
1009
1010 int possibly_false_rl_LR(int comparison, struct range_list *a, struct range_list *b, int left)
1011 {
1012 if (left)
1013 return possibly_false_rl(a, comparison, b);
1014 else
1015 return possibly_false_rl(b, comparison, a);
1016 }
1017
1018 int rl_has_sval(struct range_list *rl, sval_t sval)
1019 {
1020 struct data_range *tmp;
1021
1022 FOR_EACH_PTR(rl, tmp) {
1023 if (sval_cmp(tmp->min, sval) <= 0 &&
1024 sval_cmp(tmp->max, sval) >= 0)
1025 return 1;
1026 } END_FOR_EACH_PTR(tmp);
1027 return 0;
1028 }
1029
1030 void tack_on(struct range_list **list, struct data_range *drange)
1031 {
1032 add_ptr_list(list, drange);
1033 }
1034
1035 void push_rl(struct range_list_stack **rl_stack, struct range_list *rl)
1036 {
1037 add_ptr_list(rl_stack, rl);
1038 }
1039
1040 struct range_list *pop_rl(struct range_list_stack **rl_stack)
1041 {
1042 struct range_list *rl;
1043
1044 rl = last_ptr_list((struct ptr_list *)*rl_stack);
1045 delete_ptr_list_last((struct ptr_list **)rl_stack);
1046 return rl;
1047 }
1048
1049 struct range_list *top_rl(struct range_list_stack *rl_stack)
1050 {
1051 struct range_list *rl;
1052
1053 rl = last_ptr_list((struct ptr_list *)rl_stack);
1054 return rl;
1055 }
1056
1057 void filter_top_rl(struct range_list_stack **rl_stack, sval_t start, sval_t end)
1058 {
1059 struct range_list *rl;
1060
1061 rl = pop_rl(rl_stack);
1062 rl = remove_range(rl, start, end);
1063 push_rl(rl_stack, rl);
1064 }
1065
1066 struct range_list *rl_truncate_cast(struct symbol *type, struct range_list *rl)
1067 {
1068 struct data_range *tmp;
1069 struct range_list *ret = NULL;
1070 sval_t min, max;
1071
1072 if (!rl)
1073 return NULL;
1074
1075 if (!type || type == rl_type(rl))
1076 return rl;
1077
1078 FOR_EACH_PTR(rl, tmp) {
1079 min = tmp->min;
1080 max = tmp->max;
1081 if (type_bits(type) < type_bits(rl_type(rl))) {
1082 min.uvalue = tmp->min.uvalue & ((1ULL << type_bits(type)) - 1);
1083 max.uvalue = tmp->max.uvalue & ((1ULL << type_bits(type)) - 1);
1084 }
1085 if (sval_cmp(min, max) > 0) {
1086 min = sval_cast(type, min);
1087 max = sval_cast(type, max);
1088 }
1089 add_range_t(type, &ret, min, max);
1090 } END_FOR_EACH_PTR(tmp);
1091
1092 return ret;
1093 }
1094
1095 static int rl_is_sane(struct range_list *rl)
1096 {
1097 struct data_range *tmp;
1098 struct symbol *type;
1099
1100 type = rl_type(rl);
1101 FOR_EACH_PTR(rl, tmp) {
1102 if (!sval_fits(type, tmp->min))
1103 return 0;
1104 if (!sval_fits(type, tmp->max))
1105 return 0;
1106 if (sval_cmp(tmp->min, tmp->max) > 0)
1107 return 0;
1108 } END_FOR_EACH_PTR(tmp);
1109
1110 return 1;
1111 }
1112
1113 static int rl_type_consistent(struct range_list *rl)
1114 {
1115 struct data_range *tmp;
1116 struct symbol *type;
1117
1118 type = rl_type(rl);
1119 FOR_EACH_PTR(rl, tmp) {
1120 if (type != tmp->min.type || type != tmp->max.type)
1121 return 0;
1122 } END_FOR_EACH_PTR(tmp);
1123 return 1;
1124 }
1125
1126 struct range_list *cast_rl(struct symbol *type, struct range_list *rl)
1127 {
1128 struct data_range *tmp;
1129 struct range_list *ret = NULL;
1130
1131 if (!rl)
1132 return NULL;
1133
1134 if (!type)
1135 return rl;
1136 if (!rl_is_sane(rl))
1137 return alloc_whole_rl(type);
1138 if (type == rl_type(rl) && rl_type_consistent(rl))
1139 return rl;
1140
1141 FOR_EACH_PTR(rl, tmp) {
1142 add_range_t(type, &ret, tmp->min, tmp->max);
1143 } END_FOR_EACH_PTR(tmp);
1144
1145 if (!ret)
1146 return alloc_whole_rl(type);
1147
1148 return ret;
1149 }
1150
1151 struct range_list *rl_invert(struct range_list *orig)
1152 {
1153 struct range_list *ret = NULL;
1154 struct data_range *tmp;
1155 sval_t gap_min, abs_max, sval;
1156
1157 if (!orig)
1158 return NULL;
1159
1160 gap_min = sval_type_min(rl_min(orig).type);
1161 abs_max = sval_type_max(rl_max(orig).type);
1162
1163 FOR_EACH_PTR(orig, tmp) {
1164 if (sval_cmp(tmp->min, gap_min) > 0) {
1165 sval = sval_type_val(tmp->min.type, tmp->min.value - 1);
1166 add_range(&ret, gap_min, sval);
1167 }
1168 gap_min = sval_type_val(tmp->max.type, tmp->max.value + 1);
1169 if (sval_cmp(tmp->max, abs_max) == 0)
1170 gap_min = abs_max;
1171 } END_FOR_EACH_PTR(tmp);
1172
1173 if (sval_cmp(gap_min, abs_max) < 0)
1174 add_range(&ret, gap_min, abs_max);
1175
1176 return ret;
1177 }
1178
1179 struct range_list *rl_filter(struct range_list *rl, struct range_list *filter)
1180 {
1181 struct data_range *tmp;
1182
1183 FOR_EACH_PTR(filter, tmp) {
1184 rl = remove_range(rl, tmp->min, tmp->max);
1185 } END_FOR_EACH_PTR(tmp);
1186
1187 return rl;
1188 }
1189
1190 struct range_list *rl_intersection(struct range_list *one, struct range_list *two)
1191 {
1192 struct range_list *one_orig;
1193 struct range_list *two_orig;
1194 struct range_list *ret;
1195 struct symbol *ret_type;
1196 struct symbol *small_type;
1197 struct symbol *large_type;
1198
1199 if (!two)
1200 return NULL;
1201 if (!one)
1202 return NULL;
1203
1204 one_orig = one;
1205 two_orig = two;
1206
1207 ret_type = rl_type(one);
1208 small_type = rl_type(one);
1209 large_type = rl_type(two);
1210
1211 if (type_bits(rl_type(two)) < type_bits(small_type)) {
1212 small_type = rl_type(two);
1213 large_type = rl_type(one);
1214 }
1215
1216 one = cast_rl(large_type, one);
1217 two = cast_rl(large_type, two);
1218
1219 ret = one;
1220 one = rl_invert(one);
1221 two = rl_invert(two);
1222
1223 ret = rl_filter(ret, one);
1224 ret = rl_filter(ret, two);
1225
1226 one = cast_rl(small_type, one_orig);
1227 two = cast_rl(small_type, two_orig);
1228
1229 one = rl_invert(one);
1230 two = rl_invert(two);
1231
1232 ret = cast_rl(small_type, ret);
1233 ret = rl_filter(ret, one);
1234 ret = rl_filter(ret, two);
1235
1236 return cast_rl(ret_type, ret);
1237 }
1238
1239 static struct range_list *handle_mod_rl(struct range_list *left, struct range_list *right)
1240 {
1241 sval_t zero;
1242 sval_t max;
1243
1244 max = rl_max(right);
1245 if (sval_is_max(max))
1246 return left;
1247 if (max.value == 0)
1248 return NULL;
1249 max.value--;
1250 if (sval_is_negative(max))
1251 return NULL;
1252 if (sval_cmp(rl_max(left), max) < 0)
1253 return left;
1254 zero = max;
1255 zero.value = 0;
1256 return alloc_rl(zero, max);
1257 }
1258
1259 static struct range_list *get_neg_rl(struct range_list *rl)
1260 {
1261 struct data_range *tmp;
1262 struct data_range *new;
1263 struct range_list *ret = NULL;
1264
1265 if (!rl)
1266 return NULL;
1267 if (sval_is_positive(rl_min(rl)))
1268 return NULL;
1269
1270 FOR_EACH_PTR(rl, tmp) {
1271 if (sval_is_positive(tmp->min))
1272 return ret;
1273 if (sval_is_positive(tmp->max)) {
1274 new = alloc_range(tmp->min, tmp->max);
1275 new->max.value = -1;
1276 add_range(&ret, new->min, new->max);
1277 return ret;
1278 }
1279 add_range(&ret, tmp->min, tmp->max);
1280 } END_FOR_EACH_PTR(tmp);
1281
1282 return ret;
1283 }
1284
1285 static struct range_list *get_pos_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_negative(rl_max(rl)))
1294 return NULL;
1295
1296 FOR_EACH_PTR(rl, tmp) {
1297 if (sval_is_negative(tmp->max))
1298 continue;
1299 if (sval_is_positive(tmp->min)) {
1300 add_range(&ret, tmp->min, tmp->max);
1301 continue;
1302 }
1303 new = alloc_range(tmp->min, tmp->max);
1304 new->min.value = 0;
1305 add_range(&ret, new->min, new->max);
1306 } END_FOR_EACH_PTR(tmp);
1307
1308 return ret;
1309 }
1310
1311 static struct range_list *divide_rl_helper(struct range_list *left, struct range_list *right)
1312 {
1313 sval_t right_min, right_max;
1314 sval_t min, max;
1315
1316 if (!left || !right)
1317 return NULL;
1318
1319 /* let's assume we never divide by zero */
1320 right_min = rl_min(right);
1321 right_max = rl_max(right);
1322 if (right_min.value == 0 && right_max.value == 0)
1323 return NULL;
1324 if (right_min.value == 0)
1325 right_min.value = 1;
1326 if (right_max.value == 0)
1327 right_max.value = -1;
1328
1329 max = sval_binop(rl_max(left), '/', right_min);
1330 min = sval_binop(rl_min(left), '/', right_max);
1331
1332 return alloc_rl(min, max);
1333 }
1334
1335 static struct range_list *handle_divide_rl(struct range_list *left, struct range_list *right)
1336 {
1337 struct range_list *left_neg, *left_pos, *right_neg, *right_pos;
1338 struct range_list *neg_neg, *neg_pos, *pos_neg, *pos_pos;
1339 struct range_list *ret;
1340
1341 if (is_whole_rl(right))
1342 return NULL;
1343
1344 left_neg = get_neg_rl(left);
1345 left_pos = get_pos_rl(left);
1346 right_neg = get_neg_rl(right);
1347 right_pos = get_pos_rl(right);
1348
1349 neg_neg = divide_rl_helper(left_neg, right_neg);
1350 neg_pos = divide_rl_helper(left_neg, right_pos);
1351 pos_neg = divide_rl_helper(left_pos, right_neg);
1352 pos_pos = divide_rl_helper(left_pos, right_pos);
1353
1354 ret = rl_union(neg_neg, neg_pos);
1355 ret = rl_union(ret, pos_neg);
1356 return rl_union(ret, pos_pos);
1357 }
1358
1359 static struct range_list *handle_add_mult_rl(struct range_list *left, int op, struct range_list *right)
1360 {
1361 sval_t min, max;
1362
1363 if (sval_binop_overflows(rl_min(left), op, rl_min(right)))
1364 return NULL;
1365 min = sval_binop(rl_min(left), op, rl_min(right));
1366
1367 if (sval_binop_overflows(rl_max(left), op, rl_max(right)))
1368 return NULL;
1369 max = sval_binop(rl_max(left), op, rl_max(right));
1370
1371 return alloc_rl(min, max);
1372 }
1373
1374 static unsigned long long rl_bits_always_set(struct range_list *rl)
1375 {
1376 return sval_fls_mask(rl_min(rl));
1377 }
1378
1379 static unsigned long long rl_bits_maybe_set(struct range_list *rl)
1380 {
1381 return sval_fls_mask(rl_max(rl));
1382 }
1383
1384 static struct range_list *handle_OR_rl(struct range_list *left, struct range_list *right)
1385 {
1386 unsigned long long left_min, left_max, right_min, right_max;
1387 sval_t min, max;
1388 sval_t sval;
1389
1390 if ((rl_to_sval(left, &sval) || rl_to_sval(right, &sval)) &&
1391 !sval_binop_overflows(rl_max(left), '+', rl_max(right)))
1392 return rl_binop(left, '+', right);
1393
1394 left_min = rl_bits_always_set(left);
1395 left_max = rl_bits_maybe_set(left);
1396 right_min = rl_bits_always_set(right);
1397 right_max = rl_bits_maybe_set(right);
1398
1399 min.type = max.type = &ullong_ctype;
1400 min.uvalue = left_min | right_min;
1401 max.uvalue = left_max | right_max;
1402
1403 return cast_rl(rl_type(left), alloc_rl(min, max));
1404 }
1405
1406 static struct range_list *handle_XOR_rl(struct range_list *left, struct range_list *right)
1407 {
1408 unsigned long long left_set, left_maybe;
1409 unsigned long long right_set, right_maybe;
1410 sval_t zero, max;
1411
1412 left_set = rl_bits_always_set(left);
1413 left_maybe = rl_bits_maybe_set(left);
1414
1415 right_set = rl_bits_always_set(right);
1416 right_maybe = rl_bits_maybe_set(right);
1417
1418 zero = max = rl_min(left);
1419 zero.uvalue = 0;
1420 max.uvalue = fls_mask((left_maybe | right_maybe) ^ (left_set & right_set));
1421
1422 return cast_rl(rl_type(left), alloc_rl(zero, max));
1423 }
1424
1425 struct range_list *rl_binop(struct range_list *left, int op, struct range_list *right)
1426 {
1427 struct symbol *cast_type;
1428 sval_t left_sval, right_sval;
1429 struct range_list *ret = NULL;
1430
1431 cast_type = rl_type(left);
1432 if (sval_type_max(rl_type(left)).uvalue < sval_type_max(rl_type(right)).uvalue)
1433 cast_type = rl_type(right);
1434 if (sval_type_max(cast_type).uvalue < INT_MAX)
1435 cast_type = &int_ctype;
1436
1437 left = cast_rl(cast_type, left);
1438 right = cast_rl(cast_type, right);
1439
1440 if (!left || !right)
1441 return alloc_whole_rl(cast_type);
1442
1443 if (rl_to_sval(left, &left_sval) && rl_to_sval(right, &right_sval)) {
1444 sval_t val = sval_binop(left_sval, op, right_sval);
1445 return alloc_rl(val, val);
1446 }
1447
1448 switch (op) {
1449 case '%':
1450 ret = handle_mod_rl(left, right);
1451 break;
1452 case '/':
1453 ret = handle_divide_rl(left, right);
1454 break;
1455 case '*':
1456 case '+':
1457 ret = handle_add_mult_rl(left, op, right);
1458 break;
1459 case '|':
1460 ret = handle_OR_rl(left, right);
1461 break;
1462 case '^':
1463 ret = handle_XOR_rl(left, right);
1464 break;
1465
1466 /* FIXME: Do the rest as well */
1467 case '-':
1468 case '&':
1469 case SPECIAL_RIGHTSHIFT:
1470 case SPECIAL_LEFTSHIFT:
1471 break;
1472 }
1473
1474 if (!ret)
1475 ret = alloc_whole_rl(cast_type);
1476 return ret;
1477 }
1478
1479 void free_rl(struct range_list **rlist)
1480 {
1481 __free_ptr_list((struct ptr_list **)rlist);
1482 }
1483
1484 static void free_single_dinfo(struct data_info *dinfo)
1485 {
1486 free_rl(&dinfo->value_ranges);
1487 }
1488
1489 static void free_dinfos(struct allocation_blob *blob)
1490 {
1491 unsigned int size = sizeof(struct data_info);
1492 unsigned int offset = 0;
1493
1494 while (offset < blob->offset) {
1495 free_single_dinfo((struct data_info *)(blob->data + offset));
1496 offset += size;
1497 }
1498 }
1499
1500 void free_data_info_allocs(void)
1501 {
1502 struct allocator_struct *desc = &data_info_allocator;
1503 struct allocation_blob *blob = desc->blobs;
1504
1505 desc->blobs = NULL;
1506 desc->allocations = 0;
1507 desc->total_bytes = 0;
1508 desc->useful_bytes = 0;
1509 desc->freelist = NULL;
1510 while (blob) {
1511 struct allocation_blob *next = blob->next;
1512 free_dinfos(blob);
1513 blob_free(blob, desc->chunking);
1514 blob = next;
1515 }
1516 clear_data_range_alloc();
1517 }
1518
Static analysis for C