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)) {
80 } else if (!strncmp(start
, "max", 3)) {
84 while (*c
&& *c
!= ',' && *c
!= '-')
86 val1
= strtoll(start
, &c
, 10);
91 add_range(rl
, val1
, val1
);
95 add_range(rl
, val1
, val1
);
100 c
++; /* skip the dash in eg. 4-5 */
104 if (!strncmp(start
, "max", 3)) {
109 while (*c
&& *c
!= ',' && *c
!= '-')
111 val2
= strtoll(start
, &c
, 10);
113 add_range(rl
, val1
, val2
);
118 c
++; /* skip the comma in eg: 4-5,7 */
122 static struct data_range range_zero
= {
127 static struct data_range range_one
= {
132 int is_whole_range_rl(struct range_list
*rl
)
134 struct data_range
*drange
;
136 if (ptr_list_empty(rl
))
138 drange
= first_ptr_list((struct ptr_list
*)rl
);
139 if (drange
->min
== whole_range
.min
&& drange
->max
== whole_range
.max
)
144 int rl_contiguous(struct range_list
*rl
)
146 if (first_ptr_list((struct ptr_list
*)rl
) == last_ptr_list((struct ptr_list
*)rl
))
151 long long rl_min(struct range_list
*rl
)
153 struct data_range
*drange
;
155 if (ptr_list_empty(rl
))
156 return whole_range
.min
;
157 drange
= first_ptr_list((struct ptr_list
*)rl
);
161 long long rl_max(struct range_list
*rl
)
163 struct data_range
*drange
;
165 if (ptr_list_empty(rl
))
166 return whole_range
.max
;
167 drange
= last_ptr_list((struct ptr_list
*)rl
);
171 static struct data_range
*alloc_range_helper(long long min
, long long max
, int perm
)
173 struct data_range
*ret
;
176 // sm_msg("debug invalid range %lld to %lld", min, max);
177 min
= whole_range
.min
;
178 max
= whole_range
.max
;
180 if (min
== whole_range
.min
&& max
== whole_range
.max
)
182 if (min
== 0 && max
== 0)
184 if (min
== 1 && max
== 1)
188 ret
= __alloc_perm_data_range(0);
190 ret
= __alloc_data_range(0);
196 struct data_range
*alloc_range(long long min
, long long max
)
198 return alloc_range_helper(min
, max
, 0);
201 struct data_range
*alloc_range_perm(long long min
, long long max
)
203 return alloc_range_helper(min
, max
, 1);
206 struct range_list
*alloc_range_list(long long min
, long long max
)
208 struct range_list
*rl
= NULL
;
210 add_range(&rl
, min
, max
);
214 struct range_list
*whole_range_list(void)
216 return alloc_range_list(whole_range
.min
, whole_range
.max
);
219 void add_range(struct range_list
**list
, long long min
, long long max
)
221 struct data_range
*tmp
= NULL
;
222 struct data_range
*new = NULL
;
226 * FIXME: This has a problem merging a range_list like: min-0,3-max
227 * with a range like 1-2. You end up with min-2,3-max instead of
230 FOR_EACH_PTR(*list
, tmp
) {
232 /* Sometimes we overlap with more than one range
233 so we have to delete or modify the next range. */
234 if (max
+ 1 == tmp
->min
) {
235 /* join 2 ranges here */
237 DELETE_CURRENT_PTR(tmp
);
241 /* Doesn't overlap with the next one. */
244 /* Partially overlaps with the next one. */
245 if (max
< tmp
->max
) {
249 /* Completely overlaps with the next one. */
250 if (max
>= tmp
->max
) {
251 DELETE_CURRENT_PTR(tmp
);
252 /* there could be more ranges to delete */
256 if (max
!= whole_range
.max
&& max
+ 1 == tmp
->min
) {
257 /* join 2 ranges into a big range */
258 new = alloc_range(min
, tmp
->max
);
259 REPLACE_CURRENT_PTR(tmp
, new);
262 if (max
< tmp
->min
) { /* new range entirely below */
263 new = alloc_range(min
, max
);
264 INSERT_CURRENT(new, tmp
);
267 if (min
< tmp
->min
) { /* new range partially below */
272 new = alloc_range(min
, max
);
273 REPLACE_CURRENT_PTR(tmp
, new);
278 if (max
<= tmp
->max
) /* new range already included */
280 if (min
<= tmp
->max
) { /* new range partially above */
282 new = alloc_range(min
, max
);
283 REPLACE_CURRENT_PTR(tmp
, new);
287 if (min
!= whole_range
.min
&& min
- 1 == tmp
->max
) {
288 /* join 2 ranges into a big range */
289 new = alloc_range(tmp
->min
, max
);
290 REPLACE_CURRENT_PTR(tmp
, new);
294 /* the new range is entirely above the existing ranges */
295 } END_FOR_EACH_PTR(tmp
);
298 new = alloc_range(min
, max
);
299 add_ptr_list(list
, new);
302 struct range_list
*clone_range_list(struct range_list
*list
)
304 struct data_range
*tmp
;
305 struct range_list
*ret
= NULL
;
307 FOR_EACH_PTR(list
, tmp
) {
308 add_ptr_list(&ret
, tmp
);
309 } END_FOR_EACH_PTR(tmp
);
313 struct range_list
*clone_permanent(struct range_list
*list
)
315 struct data_range
*tmp
;
316 struct data_range
*new;
317 struct range_list
*ret
= NULL
;
319 FOR_EACH_PTR(list
, tmp
) {
320 new = alloc_range_perm(tmp
->min
, tmp
->max
);
321 add_ptr_list(&ret
, new);
322 } END_FOR_EACH_PTR(tmp
);
326 struct range_list
*range_list_union(struct range_list
*one
, struct range_list
*two
)
328 struct data_range
*tmp
;
329 struct range_list
*ret
= NULL
;
331 FOR_EACH_PTR(one
, tmp
) {
332 add_range(&ret
, tmp
->min
, tmp
->max
);
333 } END_FOR_EACH_PTR(tmp
);
334 FOR_EACH_PTR(two
, tmp
) {
335 add_range(&ret
, tmp
->min
, tmp
->max
);
336 } END_FOR_EACH_PTR(tmp
);
340 struct range_list
*remove_range(struct range_list
*list
, long long min
, long long max
)
342 struct data_range
*tmp
;
343 struct range_list
*ret
= NULL
;
345 FOR_EACH_PTR(list
, tmp
) {
346 if (tmp
->max
< min
) {
347 add_range(&ret
, tmp
->min
, tmp
->max
);
350 if (tmp
->min
> max
) {
351 add_range(&ret
, tmp
->min
, tmp
->max
);
354 if (tmp
->min
>= min
&& tmp
->max
<= max
)
356 if (tmp
->min
>= min
) {
357 add_range(&ret
, max
+ 1, tmp
->max
);
358 } else if (tmp
->max
<= max
) {
359 add_range(&ret
, tmp
->min
, min
- 1);
361 add_range(&ret
, tmp
->min
, min
- 1);
362 add_range(&ret
, max
+ 1, tmp
->max
);
364 } END_FOR_EACH_PTR(tmp
);
368 struct range_list
*invert_range_list(struct range_list
*orig
)
370 struct range_list
*ret
= NULL
;
371 struct data_range
*tmp
;
377 gap_min
= whole_range
.min
;
378 FOR_EACH_PTR(orig
, tmp
) {
379 if (tmp
->min
> gap_min
)
380 add_range(&ret
, gap_min
, tmp
->min
- 1);
381 gap_min
= tmp
->max
+ 1;
382 if (tmp
->max
== whole_range
.max
)
383 gap_min
= whole_range
.max
;
384 } END_FOR_EACH_PTR(tmp
);
386 if (gap_min
!= whole_range
.max
)
387 add_range(&ret
, gap_min
, whole_range
.max
);
393 * if it can be only one and only value return 1, else return 0
395 int estate_get_single_value(struct smatch_state
*state
, long long *val
)
397 struct data_info
*dinfo
;
398 struct data_range
*tmp
;
401 dinfo
= get_dinfo(state
);
402 if (!dinfo
|| dinfo
->type
!= DATA_RANGE
)
405 FOR_EACH_PTR(dinfo
->value_ranges
, tmp
) {
407 if (tmp
->min
!= tmp
->max
)
413 } END_FOR_EACH_PTR(tmp
);
417 int range_lists_equiv(struct range_list
*one
, struct range_list
*two
)
419 struct data_range
*one_range
;
420 struct data_range
*two_range
;
422 PREPARE_PTR_LIST(one
, one_range
);
423 PREPARE_PTR_LIST(two
, two_range
);
425 if (!one_range
&& !two_range
)
427 if (!one_range
|| !two_range
)
429 if (one_range
->min
!= two_range
->min
)
431 if (one_range
->max
!= two_range
->max
)
433 NEXT_PTR_LIST(one_range
);
434 NEXT_PTR_LIST(two_range
);
436 FINISH_PTR_LIST(two_range
);
437 FINISH_PTR_LIST(one_range
);
442 int true_comparison_range(struct data_range
*left
, int comparison
, struct data_range
*right
)
444 switch (comparison
) {
446 case SPECIAL_UNSIGNED_LT
:
447 if (left
->min
< right
->max
)
450 case SPECIAL_UNSIGNED_LTE
:
452 if (left
->min
<= right
->max
)
456 if (left
->max
< right
->min
)
458 if (left
->min
> right
->max
)
461 case SPECIAL_UNSIGNED_GTE
:
463 if (left
->max
>= right
->min
)
467 case SPECIAL_UNSIGNED_GT
:
468 if (left
->max
> right
->min
)
471 case SPECIAL_NOTEQUAL
:
472 if (left
->min
!= left
->max
)
474 if (right
->min
!= right
->max
)
476 if (left
->min
!= right
->min
)
480 sm_msg("unhandled comparison %d\n", comparison
);
486 int true_comparison_range_lr(int comparison
, struct data_range
*var
, struct data_range
*val
, int left
)
489 return true_comparison_range(var
, comparison
, val
);
491 return true_comparison_range(val
, comparison
, var
);
494 static int false_comparison_range(struct data_range
*left
, int comparison
, struct data_range
*right
)
496 switch (comparison
) {
498 case SPECIAL_UNSIGNED_LT
:
499 if (left
->max
>= right
->min
)
502 case SPECIAL_UNSIGNED_LTE
:
504 if (left
->max
> right
->min
)
508 if (left
->min
!= left
->max
)
510 if (right
->min
!= right
->max
)
512 if (left
->min
!= right
->min
)
515 case SPECIAL_UNSIGNED_GTE
:
517 if (left
->min
< right
->max
)
521 case SPECIAL_UNSIGNED_GT
:
522 if (left
->min
<= right
->max
)
525 case SPECIAL_NOTEQUAL
:
526 if (left
->max
< right
->min
)
528 if (left
->min
> right
->max
)
532 sm_msg("unhandled comparison %d\n", comparison
);
538 int false_comparison_range_lr(int comparison
, struct data_range
*var
, struct data_range
*val
, int left
)
541 return false_comparison_range(var
, comparison
, val
);
543 return false_comparison_range(val
, comparison
, var
);
546 int possibly_true(struct expression
*left
, int comparison
, struct expression
*right
)
548 struct range_list
*rl_left
, *rl_right
;
549 struct data_range
*tmp_left
, *tmp_right
;
551 if (!get_implied_range_list(left
, &rl_left
))
553 if (!get_implied_range_list(right
, &rl_right
))
556 FOR_EACH_PTR(rl_left
, tmp_left
) {
557 FOR_EACH_PTR(rl_right
, tmp_right
) {
558 if (true_comparison_range(tmp_left
, comparison
, tmp_right
))
560 } END_FOR_EACH_PTR(tmp_right
);
561 } END_FOR_EACH_PTR(tmp_left
);
565 int possibly_false(struct expression
*left
, int comparison
, struct expression
*right
)
567 struct range_list
*rl_left
, *rl_right
;
568 struct data_range
*tmp_left
, *tmp_right
;
570 if (!get_implied_range_list(left
, &rl_left
))
572 if (!get_implied_range_list(right
, &rl_right
))
575 FOR_EACH_PTR(rl_left
, tmp_left
) {
576 FOR_EACH_PTR(rl_right
, tmp_right
) {
577 if (false_comparison_range(tmp_left
, comparison
, tmp_right
))
579 } END_FOR_EACH_PTR(tmp_right
);
580 } END_FOR_EACH_PTR(tmp_left
);
584 int possibly_true_range_lists(struct range_list
*left_ranges
, int comparison
, struct range_list
*right_ranges
)
586 struct data_range
*left_tmp
, *right_tmp
;
588 if (!left_ranges
|| !right_ranges
)
591 FOR_EACH_PTR(left_ranges
, left_tmp
) {
592 FOR_EACH_PTR(right_ranges
, right_tmp
) {
593 if (true_comparison_range(left_tmp
, comparison
, right_tmp
))
595 } END_FOR_EACH_PTR(right_tmp
);
596 } END_FOR_EACH_PTR(left_tmp
);
600 int possibly_false_range_lists(struct range_list
*left_ranges
, int comparison
, struct range_list
*right_ranges
)
602 struct data_range
*left_tmp
, *right_tmp
;
604 if (!left_ranges
|| !right_ranges
)
607 FOR_EACH_PTR(left_ranges
, left_tmp
) {
608 FOR_EACH_PTR(right_ranges
, right_tmp
) {
609 if (false_comparison_range(left_tmp
, comparison
, right_tmp
))
611 } END_FOR_EACH_PTR(right_tmp
);
612 } END_FOR_EACH_PTR(left_tmp
);
616 int possibly_true_range_lists_rl(int comparison
, struct range_list
*a
, struct range_list
*b
, int left
)
619 return possibly_true_range_lists(a
, comparison
, b
);
621 return possibly_true_range_lists(b
, comparison
, a
);
624 int possibly_false_range_lists_rl(int comparison
, struct range_list
*a
, struct range_list
*b
, int left
)
627 return possibly_false_range_lists(a
, comparison
, b
);
629 return possibly_false_range_lists(b
, comparison
, a
);
632 void tack_on(struct range_list
**list
, struct data_range
*drange
)
634 add_ptr_list(list
, drange
);
637 int in_list_exact(struct range_list
*list
, struct data_range
*drange
)
639 struct data_range
*tmp
;
641 FOR_EACH_PTR(list
, tmp
) {
642 if (tmp
->min
== drange
->min
&& tmp
->max
== drange
->max
)
644 } END_FOR_EACH_PTR(tmp
);
648 void push_range_list(struct range_list_stack
**rl_stack
, struct range_list
*rl
)
650 add_ptr_list(rl_stack
, rl
);
653 struct range_list
*pop_range_list(struct range_list_stack
**rl_stack
)
655 struct range_list
*rl
;
657 rl
= last_ptr_list((struct ptr_list
*)*rl_stack
);
658 delete_ptr_list_last((struct ptr_list
**)rl_stack
);
662 struct range_list
*top_range_list(struct range_list_stack
*rl_stack
)
664 struct range_list
*rl
;
666 rl
= last_ptr_list((struct ptr_list
*)rl_stack
);
670 void filter_top_range_list(struct range_list_stack
**rl_stack
, long long num
)
672 struct range_list
*rl
;
674 rl
= pop_range_list(rl_stack
);
675 rl
= remove_range(rl
, num
, num
);
676 push_range_list(rl_stack
, rl
);
679 void free_range_list(struct range_list
**rlist
)
681 __free_ptr_list((struct ptr_list
**)rlist
);
684 static void free_single_dinfo(struct data_info
*dinfo
)
686 if (dinfo
->type
== DATA_RANGE
)
687 free_range_list(&dinfo
->value_ranges
);
690 static void free_dinfos(struct allocation_blob
*blob
)
692 unsigned int size
= sizeof(struct data_info
);
693 unsigned int offset
= 0;
695 while (offset
< blob
->offset
) {
696 free_single_dinfo((struct data_info
*)(blob
->data
+ offset
));
701 void free_data_info_allocs(void)
703 struct allocator_struct
*desc
= &data_info_allocator
;
704 struct allocation_blob
*blob
= desc
->blobs
;
707 desc
->allocations
= 0;
708 desc
->total_bytes
= 0;
709 desc
->useful_bytes
= 0;
710 desc
->freelist
= NULL
;
712 struct allocation_blob
*next
= blob
->next
;
714 blob_free(blob
, desc
->chunking
);
717 clear_data_range_alloc();