2 * sparse/smatch_ranges.c
4 * Copyright (C) 2009 Dan Carpenter.
6 * Licensed under the Open Software License version 1.1
12 #include "smatch_extra.h"
13 #include "smatch_slist.h"
15 ALLOCATOR(data_info
, "smatch extra data");
16 ALLOCATOR(data_range
, "data range");
17 __DO_ALLOCATOR(struct data_range
, sizeof(struct data_range
), __alignof__(struct data_range
),
18 "permanent ranges", perm_data_range
);
20 struct data_range whole_range
= {
25 static char *show_num(long long num
)
27 static char buff
[256];
29 if (num
== whole_range
.min
)
30 snprintf(buff
, 255, "min");
31 else if (num
== whole_range
.max
)
32 snprintf(buff
, 255, "max");
34 snprintf(buff
, 255, "(%lld)", num
);
36 snprintf(buff
, 255, "%lld", num
);
42 char *show_ranges(struct range_list
*list
)
44 struct data_range
*tmp
;
50 FOR_EACH_PTR(list
, tmp
) {
52 strncat(full
, ",", 254 - strlen(full
));
53 if (tmp
->min
== tmp
->max
) {
54 strncat(full
, show_num(tmp
->min
), 254 - strlen(full
));
57 strncat(full
, show_num(tmp
->min
), 254 - strlen(full
));
58 strncat(full
, "-", 254 - strlen(full
));
59 strncat(full
, show_num(tmp
->max
), 254 - strlen(full
));
60 } END_FOR_EACH_PTR(tmp
);
61 return alloc_sname(full
);
64 void get_value_ranges(char *value
, struct range_list
**rl
)
77 if (!strncmp(start
, "min", 3)) {
81 while (*c
&& *c
!= ',' && *c
!= '-')
83 val1
= strtoll(start
, &c
, 10);
88 add_range(rl
, val1
, val1
);
92 add_range(rl
, val1
, val1
);
97 c
++; /* skip the dash in eg. 4-5 */
101 if (!strncmp(start
, "max", 3)) {
106 while (*c
&& *c
!= ',' && *c
!= '-')
108 val2
= strtoll(start
, &c
, 10);
110 add_range(rl
, val1
, val2
);
115 c
++; /* skip the comma in eg: 4-5,7 */
120 static struct data_range range_zero
= {
125 static struct data_range range_one
= {
130 int is_whole_range_rl(struct range_list
*rl
)
132 struct data_range
*drange
;
134 if (ptr_list_empty(rl
))
136 drange
= first_ptr_list((struct ptr_list
*)rl
);
137 if (drange
->min
== whole_range
.min
&& drange
->max
== whole_range
.max
)
142 int rl_contiguous(struct range_list
*rl
)
144 if (first_ptr_list((struct ptr_list
*)rl
) == last_ptr_list((struct ptr_list
*)rl
))
149 long long rl_min(struct range_list
*rl
)
151 struct data_range
*drange
;
153 if (ptr_list_empty(rl
))
154 return whole_range
.min
;
155 drange
= first_ptr_list((struct ptr_list
*)rl
);
159 long long rl_max(struct range_list
*rl
)
161 struct data_range
*drange
;
163 if (ptr_list_empty(rl
))
164 return whole_range
.max
;
165 drange
= last_ptr_list((struct ptr_list
*)rl
);
169 static struct data_range
*alloc_range_helper(long long min
, long long max
, int perm
)
171 struct data_range
*ret
;
174 sm_msg("Error invalid range %lld to %lld", min
, max
);
175 min
= whole_range
.min
;
176 max
= whole_range
.max
;
178 if (min
== whole_range
.min
&& max
== whole_range
.max
)
180 if (min
== 0 && max
== 0)
182 if (min
== 1 && max
== 1)
186 ret
= __alloc_perm_data_range(0);
188 ret
= __alloc_data_range(0);
194 struct data_range
*alloc_range(long long min
, long long max
)
196 return alloc_range_helper(min
, max
, 0);
199 struct data_range
*alloc_range_perm(long long min
, long long max
)
201 return alloc_range_helper(min
, max
, 1);
204 struct range_list
*alloc_range_list(long long min
, long long max
)
206 struct range_list
*rl
= NULL
;
208 add_range(&rl
, min
, max
);
212 struct range_list
*whole_range_list(void)
214 return alloc_range_list(whole_range
.min
, whole_range
.max
);
217 void add_range(struct range_list
**list
, long long min
, long long max
)
219 struct data_range
*tmp
= NULL
;
220 struct data_range
*new = NULL
;
224 * FIXME: This has a problem merging a range_list like: min-0,3-max
225 * with a range like 1-2. You end up with min-2,3-max instead of
228 FOR_EACH_PTR(*list
, tmp
) {
230 /* Sometimes we overlap with more than one range
231 so we have to delete or modify the next range. */
232 if (max
+ 1 == tmp
->min
) {
233 /* join 2 ranges here */
235 DELETE_CURRENT_PTR(tmp
);
239 /* Doesn't overlap with the next one. */
242 /* Partially overlaps with the next one. */
243 if (max
< tmp
->max
) {
247 /* Completely overlaps with the next one. */
248 if (max
>= tmp
->max
) {
249 DELETE_CURRENT_PTR(tmp
);
250 /* there could be more ranges to delete */
254 if (max
!= whole_range
.max
&& max
+ 1 == tmp
->min
) {
255 /* join 2 ranges into a big range */
256 new = alloc_range(min
, tmp
->max
);
257 REPLACE_CURRENT_PTR(tmp
, new);
260 if (max
< tmp
->min
) { /* new range entirely below */
261 new = alloc_range(min
, max
);
262 INSERT_CURRENT(new, tmp
);
265 if (min
< tmp
->min
) { /* new range partially below */
270 new = alloc_range(min
, max
);
271 REPLACE_CURRENT_PTR(tmp
, new);
276 if (max
<= tmp
->max
) /* new range already included */
278 if (min
<= tmp
->max
) { /* new range partially above */
280 new = alloc_range(min
, max
);
281 REPLACE_CURRENT_PTR(tmp
, new);
285 if (min
!= whole_range
.min
&& min
- 1 == tmp
->max
) {
286 /* join 2 ranges into a big range */
287 new = alloc_range(tmp
->min
, max
);
288 REPLACE_CURRENT_PTR(tmp
, new);
292 /* the new range is entirely above the existing ranges */
293 } END_FOR_EACH_PTR(tmp
);
296 new = alloc_range(min
, max
);
297 add_ptr_list(list
, new);
300 struct range_list
*clone_range_list(struct range_list
*list
)
302 struct data_range
*tmp
;
303 struct range_list
*ret
= NULL
;
305 FOR_EACH_PTR(list
, tmp
) {
306 add_ptr_list(&ret
, tmp
);
307 } END_FOR_EACH_PTR(tmp
);
311 struct range_list
*clone_permanent(struct range_list
*list
)
313 struct data_range
*tmp
;
314 struct data_range
*new;
315 struct range_list
*ret
= NULL
;
317 FOR_EACH_PTR(list
, tmp
) {
318 new = alloc_range_perm(tmp
->min
, tmp
->max
);
319 add_ptr_list(&ret
, new);
320 } END_FOR_EACH_PTR(tmp
);
324 struct range_list
*range_list_union(struct range_list
*one
, struct range_list
*two
)
326 struct data_range
*tmp
;
327 struct range_list
*ret
= NULL
;
329 FOR_EACH_PTR(one
, tmp
) {
330 add_range(&ret
, tmp
->min
, tmp
->max
);
331 } END_FOR_EACH_PTR(tmp
);
332 FOR_EACH_PTR(two
, tmp
) {
333 add_range(&ret
, tmp
->min
, tmp
->max
);
334 } END_FOR_EACH_PTR(tmp
);
338 struct range_list
*remove_range(struct range_list
*list
, long long min
, long long max
)
340 struct data_range
*tmp
;
341 struct range_list
*ret
= NULL
;
343 FOR_EACH_PTR(list
, tmp
) {
344 if (tmp
->max
< min
) {
345 add_range(&ret
, tmp
->min
, tmp
->max
);
348 if (tmp
->min
> max
) {
349 add_range(&ret
, tmp
->min
, tmp
->max
);
352 if (tmp
->min
>= min
&& tmp
->max
<= max
)
354 if (tmp
->min
>= min
) {
355 add_range(&ret
, max
+ 1, tmp
->max
);
356 } else if (tmp
->max
<= max
) {
357 add_range(&ret
, tmp
->min
, min
- 1);
359 add_range(&ret
, tmp
->min
, min
- 1);
360 add_range(&ret
, max
+ 1, tmp
->max
);
362 } END_FOR_EACH_PTR(tmp
);
366 struct range_list
*invert_range_list(struct range_list
*orig
)
368 struct range_list
*ret
= NULL
;
369 struct data_range
*tmp
;
375 gap_min
= whole_range
.min
;
376 FOR_EACH_PTR(orig
, tmp
) {
377 if (tmp
->min
> gap_min
)
378 add_range(&ret
, gap_min
, tmp
->min
- 1);
379 gap_min
= tmp
->max
+ 1;
380 if (tmp
->max
== whole_range
.max
)
381 gap_min
= whole_range
.max
;
382 } END_FOR_EACH_PTR(tmp
);
384 if (gap_min
!= whole_range
.max
)
385 add_range(&ret
, gap_min
, whole_range
.max
);
391 * if it can be only one and only value return 1, else return 0
393 int estate_get_single_value(struct smatch_state
*state
, long long *val
)
395 struct data_info
*dinfo
;
396 struct data_range
*tmp
;
399 dinfo
= get_dinfo(state
);
400 if (!dinfo
|| dinfo
->type
!= DATA_RANGE
)
403 FOR_EACH_PTR(dinfo
->value_ranges
, tmp
) {
405 if (tmp
->min
!= tmp
->max
)
411 } END_FOR_EACH_PTR(tmp
);
415 int range_lists_equiv(struct range_list
*one
, struct range_list
*two
)
417 struct data_range
*one_range
;
418 struct data_range
*two_range
;
420 PREPARE_PTR_LIST(one
, one_range
);
421 PREPARE_PTR_LIST(two
, two_range
);
423 if (!one_range
&& !two_range
)
425 if (!one_range
|| !two_range
)
427 if (one_range
->min
!= two_range
->min
)
429 if (one_range
->max
!= two_range
->max
)
431 NEXT_PTR_LIST(one_range
);
432 NEXT_PTR_LIST(two_range
);
434 FINISH_PTR_LIST(two_range
);
435 FINISH_PTR_LIST(one_range
);
440 int true_comparison_range(struct data_range
*left
, int comparison
, struct data_range
*right
)
442 switch (comparison
) {
444 case SPECIAL_UNSIGNED_LT
:
445 if (left
->min
< right
->max
)
448 case SPECIAL_UNSIGNED_LTE
:
450 if (left
->min
<= right
->max
)
454 if (left
->max
< right
->min
)
456 if (left
->min
> right
->max
)
459 case SPECIAL_UNSIGNED_GTE
:
461 if (left
->max
>= right
->min
)
465 case SPECIAL_UNSIGNED_GT
:
466 if (left
->max
> right
->min
)
469 case SPECIAL_NOTEQUAL
:
470 if (left
->min
!= left
->max
)
472 if (right
->min
!= right
->max
)
474 if (left
->min
!= right
->min
)
478 sm_msg("unhandled comparison %d\n", comparison
);
484 int true_comparison_range_lr(int comparison
, struct data_range
*var
, struct data_range
*val
, int left
)
487 return true_comparison_range(var
, comparison
, val
);
489 return true_comparison_range(val
, comparison
, var
);
492 static int false_comparison_range(struct data_range
*left
, int comparison
, struct data_range
*right
)
494 switch (comparison
) {
496 case SPECIAL_UNSIGNED_LT
:
497 if (left
->max
>= right
->min
)
500 case SPECIAL_UNSIGNED_LTE
:
502 if (left
->max
> right
->min
)
506 if (left
->min
!= left
->max
)
508 if (right
->min
!= right
->max
)
510 if (left
->min
!= right
->min
)
513 case SPECIAL_UNSIGNED_GTE
:
515 if (left
->min
< right
->max
)
519 case SPECIAL_UNSIGNED_GT
:
520 if (left
->min
<= right
->max
)
523 case SPECIAL_NOTEQUAL
:
524 if (left
->max
< right
->min
)
526 if (left
->min
> right
->max
)
530 sm_msg("unhandled comparison %d\n", comparison
);
536 int false_comparison_range_lr(int comparison
, struct data_range
*var
, struct data_range
*val
, int left
)
539 return false_comparison_range(var
, comparison
, val
);
541 return false_comparison_range(val
, comparison
, var
);
544 int possibly_true(struct expression
*left
, int comparison
, struct expression
*right
)
546 struct range_list
*rl_left
, *rl_right
;
547 struct data_range
*tmp_left
, *tmp_right
;
549 if (!get_implied_range_list(left
, &rl_left
))
551 if (!get_implied_range_list(right
, &rl_right
))
554 FOR_EACH_PTR(rl_left
, tmp_left
) {
555 FOR_EACH_PTR(rl_right
, tmp_right
) {
556 if (true_comparison_range(tmp_left
, comparison
, tmp_right
))
558 } END_FOR_EACH_PTR(tmp_right
);
559 } END_FOR_EACH_PTR(tmp_left
);
563 int possibly_false(struct expression
*left
, int comparison
, struct expression
*right
)
565 struct range_list
*rl_left
, *rl_right
;
566 struct data_range
*tmp_left
, *tmp_right
;
568 if (!get_implied_range_list(left
, &rl_left
))
570 if (!get_implied_range_list(right
, &rl_right
))
573 FOR_EACH_PTR(rl_left
, tmp_left
) {
574 FOR_EACH_PTR(rl_right
, tmp_right
) {
575 if (false_comparison_range(tmp_left
, comparison
, tmp_right
))
577 } END_FOR_EACH_PTR(tmp_right
);
578 } END_FOR_EACH_PTR(tmp_left
);
582 int possibly_true_range_lists(struct range_list
*left_ranges
, int comparison
, struct range_list
*right_ranges
)
584 struct data_range
*left_tmp
, *right_tmp
;
586 if (!left_ranges
|| !right_ranges
)
589 FOR_EACH_PTR(left_ranges
, left_tmp
) {
590 FOR_EACH_PTR(right_ranges
, right_tmp
) {
591 if (true_comparison_range(left_tmp
, comparison
, right_tmp
))
593 } END_FOR_EACH_PTR(right_tmp
);
594 } END_FOR_EACH_PTR(left_tmp
);
598 int possibly_false_range_lists(struct range_list
*left_ranges
, int comparison
, struct range_list
*right_ranges
)
600 struct data_range
*left_tmp
, *right_tmp
;
602 if (!left_ranges
|| !right_ranges
)
605 FOR_EACH_PTR(left_ranges
, left_tmp
) {
606 FOR_EACH_PTR(right_ranges
, right_tmp
) {
607 if (false_comparison_range(left_tmp
, comparison
, right_tmp
))
609 } END_FOR_EACH_PTR(right_tmp
);
610 } END_FOR_EACH_PTR(left_tmp
);
614 int possibly_true_range_lists_rl(int comparison
, struct range_list
*a
, struct range_list
*b
, int left
)
617 return possibly_true_range_lists(a
, comparison
, b
);
619 return possibly_true_range_lists(b
, comparison
, a
);
622 int possibly_false_range_lists_rl(int comparison
, struct range_list
*a
, struct range_list
*b
, int left
)
625 return possibly_false_range_lists(a
, comparison
, b
);
627 return possibly_false_range_lists(b
, comparison
, a
);
630 void tack_on(struct range_list
**list
, struct data_range
*drange
)
632 add_ptr_list(list
, drange
);
635 int in_list_exact(struct range_list
*list
, struct data_range
*drange
)
637 struct data_range
*tmp
;
639 FOR_EACH_PTR(list
, tmp
) {
640 if (tmp
->min
== drange
->min
&& tmp
->max
== drange
->max
)
642 } END_FOR_EACH_PTR(tmp
);
647 void push_range_list(struct range_list_stack
**rl_stack
, struct range_list
*rl
)
649 add_ptr_list(rl_stack
, rl
);
652 struct range_list
*pop_range_list(struct range_list_stack
**rl_stack
)
654 struct range_list
*rl
;
656 rl
= last_ptr_list((struct ptr_list
*)*rl_stack
);
657 delete_ptr_list_last((struct ptr_list
**)rl_stack
);
661 struct range_list
*top_range_list(struct range_list_stack
*rl_stack
)
663 struct range_list
*rl
;
665 rl
= last_ptr_list((struct ptr_list
*)rl_stack
);
669 void filter_top_range_list(struct range_list_stack
**rl_stack
, long long num
)
671 struct range_list
*rl
;
673 rl
= pop_range_list(rl_stack
);
674 rl
= remove_range(rl
, num
, num
);
675 push_range_list(rl_stack
, rl
);
678 void free_range_list(struct range_list
**rlist
)
680 __free_ptr_list((struct ptr_list
**)rlist
);
683 static void free_single_dinfo(struct data_info
*dinfo
)
685 if (dinfo
->type
== DATA_RANGE
)
686 free_range_list(&dinfo
->value_ranges
);
689 static void free_dinfos(struct allocation_blob
*blob
)
691 unsigned int size
= sizeof(struct data_info
);
692 unsigned int offset
= 0;
694 while (offset
< blob
->offset
) {
695 free_single_dinfo((struct data_info
*)(blob
->data
+ offset
));
700 void free_data_info_allocs(void)
702 struct allocator_struct
*desc
= &data_info_allocator
;
703 struct allocation_blob
*blob
= desc
->blobs
;
706 desc
->allocations
= 0;
707 desc
->total_bytes
= 0;
708 desc
->useful_bytes
= 0;
709 desc
->freelist
= NULL
;
711 struct allocation_blob
*next
= blob
->next
;
713 blob_free(blob
, desc
->chunking
);
716 clear_data_range_alloc();