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 long long rl_min(struct range_list
*rl
)
144 struct data_range
*drange
;
146 if (ptr_list_empty(rl
))
147 return whole_range
.min
;
148 drange
= first_ptr_list((struct ptr_list
*)rl
);
152 long long rl_max(struct range_list
*rl
)
154 struct data_range
*drange
;
156 if (ptr_list_empty(rl
))
157 return whole_range
.max
;
158 drange
= last_ptr_list((struct ptr_list
*)rl
);
162 static struct data_range
*alloc_range_helper(long long min
, long long max
, int perm
)
164 struct data_range
*ret
;
167 sm_msg("Error invalid range %lld to %lld", min
, max
);
168 min
= whole_range
.min
;
169 max
= whole_range
.max
;
171 if (min
== whole_range
.min
&& max
== whole_range
.max
)
173 if (min
== 0 && max
== 0)
175 if (min
== 1 && max
== 1)
179 ret
= __alloc_perm_data_range(0);
181 ret
= __alloc_data_range(0);
187 struct data_range
*alloc_range(long long min
, long long max
)
189 return alloc_range_helper(min
, max
, 0);
192 struct data_range
*alloc_range_perm(long long min
, long long max
)
194 return alloc_range_helper(min
, max
, 1);
197 struct range_list
*alloc_range_list(long long min
, long long max
)
199 struct range_list
*rl
= NULL
;
201 add_range(&rl
, min
, max
);
205 struct range_list
*whole_range_list(void)
207 return alloc_range_list(whole_range
.min
, whole_range
.max
);
210 void add_range(struct range_list
**list
, long long min
, long long max
)
212 struct data_range
*tmp
= NULL
;
213 struct data_range
*new = NULL
;
217 * FIXME: This has a problem merging a range_list like: min-0,3-max
218 * with a range like 1-2. You end up with min-2,3-max instead of
221 FOR_EACH_PTR(*list
, tmp
) {
223 /* Sometimes we overlap with more than one range
224 so we have to delete or modify the next range. */
225 if (max
+ 1 == tmp
->min
) {
226 /* join 2 ranges here */
228 DELETE_CURRENT_PTR(tmp
);
232 /* Doesn't overlap with the next one. */
235 /* Partially overlaps with the next one. */
236 if (max
< tmp
->max
) {
240 /* Completely overlaps with the next one. */
241 if (max
>= tmp
->max
) {
242 DELETE_CURRENT_PTR(tmp
);
243 /* there could be more ranges to delete */
247 if (max
!= whole_range
.max
&& max
+ 1 == tmp
->min
) {
248 /* join 2 ranges into a big range */
249 new = alloc_range(min
, tmp
->max
);
250 REPLACE_CURRENT_PTR(tmp
, new);
253 if (max
< tmp
->min
) { /* new range entirely below */
254 new = alloc_range(min
, max
);
255 INSERT_CURRENT(new, tmp
);
258 if (min
< tmp
->min
) { /* new range partially below */
263 new = alloc_range(min
, max
);
264 REPLACE_CURRENT_PTR(tmp
, new);
269 if (max
<= tmp
->max
) /* new range already included */
271 if (min
<= tmp
->max
) { /* new range partially above */
273 new = alloc_range(min
, max
);
274 REPLACE_CURRENT_PTR(tmp
, new);
278 if (min
!= whole_range
.min
&& min
- 1 == tmp
->max
) {
279 /* join 2 ranges into a big range */
280 new = alloc_range(tmp
->min
, max
);
281 REPLACE_CURRENT_PTR(tmp
, new);
285 /* the new range is entirely above the existing ranges */
286 } END_FOR_EACH_PTR(tmp
);
289 new = alloc_range(min
, max
);
290 add_ptr_list(list
, new);
293 struct range_list
*clone_range_list(struct range_list
*list
)
295 struct data_range
*tmp
;
296 struct range_list
*ret
= NULL
;
298 FOR_EACH_PTR(list
, tmp
) {
299 add_ptr_list(&ret
, tmp
);
300 } END_FOR_EACH_PTR(tmp
);
304 struct range_list
*clone_permanent(struct range_list
*list
)
306 struct data_range
*tmp
;
307 struct data_range
*new;
308 struct range_list
*ret
= NULL
;
310 FOR_EACH_PTR(list
, tmp
) {
311 new = alloc_range_perm(tmp
->min
, tmp
->max
);
312 add_ptr_list(&ret
, new);
313 } END_FOR_EACH_PTR(tmp
);
317 struct range_list
*range_list_union(struct range_list
*one
, struct range_list
*two
)
319 struct data_range
*tmp
;
320 struct range_list
*ret
= NULL
;
322 FOR_EACH_PTR(one
, tmp
) {
323 add_range(&ret
, tmp
->min
, tmp
->max
);
324 } END_FOR_EACH_PTR(tmp
);
325 FOR_EACH_PTR(two
, tmp
) {
326 add_range(&ret
, tmp
->min
, tmp
->max
);
327 } END_FOR_EACH_PTR(tmp
);
331 struct range_list
*remove_range(struct range_list
*list
, long long min
, long long max
)
333 struct data_range
*tmp
;
334 struct range_list
*ret
= NULL
;
336 FOR_EACH_PTR(list
, tmp
) {
337 if (tmp
->max
< min
) {
338 add_range(&ret
, tmp
->min
, tmp
->max
);
341 if (tmp
->min
> max
) {
342 add_range(&ret
, tmp
->min
, tmp
->max
);
345 if (tmp
->min
>= min
&& tmp
->max
<= max
)
347 if (tmp
->min
>= min
) {
348 add_range(&ret
, max
+ 1, tmp
->max
);
349 } else if (tmp
->max
<= max
) {
350 add_range(&ret
, tmp
->min
, min
- 1);
352 add_range(&ret
, tmp
->min
, min
- 1);
353 add_range(&ret
, max
+ 1, tmp
->max
);
355 } END_FOR_EACH_PTR(tmp
);
359 struct range_list
*invert_range_list(struct range_list
*orig
)
361 struct range_list
*ret
= NULL
;
362 struct data_range
*tmp
;
368 gap_min
= whole_range
.min
;
369 FOR_EACH_PTR(orig
, tmp
) {
370 if (tmp
->min
> gap_min
)
371 add_range(&ret
, gap_min
, tmp
->min
- 1);
372 gap_min
= tmp
->max
+ 1;
373 if (tmp
->max
== whole_range
.max
)
374 gap_min
= whole_range
.max
;
375 } END_FOR_EACH_PTR(tmp
);
377 if (gap_min
!= whole_range
.max
)
378 add_range(&ret
, gap_min
, whole_range
.max
);
384 * if it can be only one and only value return 1, else return 0
386 int estate_get_single_value(struct smatch_state
*state
, long long *val
)
388 struct data_info
*dinfo
;
389 struct data_range
*tmp
;
392 dinfo
= get_dinfo(state
);
393 if (!dinfo
|| dinfo
->type
!= DATA_RANGE
)
396 FOR_EACH_PTR(dinfo
->value_ranges
, tmp
) {
398 if (tmp
->min
!= tmp
->max
)
404 } END_FOR_EACH_PTR(tmp
);
408 int range_lists_equiv(struct range_list
*one
, struct range_list
*two
)
410 struct data_range
*one_range
;
411 struct data_range
*two_range
;
413 PREPARE_PTR_LIST(one
, one_range
);
414 PREPARE_PTR_LIST(two
, two_range
);
416 if (!one_range
&& !two_range
)
418 if (!one_range
|| !two_range
)
420 if (one_range
->min
!= two_range
->min
)
422 if (one_range
->max
!= two_range
->max
)
424 NEXT_PTR_LIST(one_range
);
425 NEXT_PTR_LIST(two_range
);
427 FINISH_PTR_LIST(two_range
);
428 FINISH_PTR_LIST(one_range
);
433 int true_comparison_range(struct data_range
*left
, int comparison
, struct data_range
*right
)
435 switch (comparison
) {
437 case SPECIAL_UNSIGNED_LT
:
438 if (left
->min
< right
->max
)
441 case SPECIAL_UNSIGNED_LTE
:
443 if (left
->min
<= right
->max
)
447 if (left
->max
< right
->min
)
449 if (left
->min
> right
->max
)
452 case SPECIAL_UNSIGNED_GTE
:
454 if (left
->max
>= right
->min
)
458 case SPECIAL_UNSIGNED_GT
:
459 if (left
->max
> right
->min
)
462 case SPECIAL_NOTEQUAL
:
463 if (left
->min
!= left
->max
)
465 if (right
->min
!= right
->max
)
467 if (left
->min
!= right
->min
)
471 sm_msg("unhandled comparison %d\n", comparison
);
477 int true_comparison_range_lr(int comparison
, struct data_range
*var
, struct data_range
*val
, int left
)
480 return true_comparison_range(var
, comparison
, val
);
482 return true_comparison_range(val
, comparison
, var
);
485 static int false_comparison_range(struct data_range
*left
, int comparison
, struct data_range
*right
)
487 switch (comparison
) {
489 case SPECIAL_UNSIGNED_LT
:
490 if (left
->max
>= right
->min
)
493 case SPECIAL_UNSIGNED_LTE
:
495 if (left
->max
> right
->min
)
499 if (left
->min
!= left
->max
)
501 if (right
->min
!= right
->max
)
503 if (left
->min
!= right
->min
)
506 case SPECIAL_UNSIGNED_GTE
:
508 if (left
->min
< right
->max
)
512 case SPECIAL_UNSIGNED_GT
:
513 if (left
->min
<= right
->max
)
516 case SPECIAL_NOTEQUAL
:
517 if (left
->max
< right
->min
)
519 if (left
->min
> right
->max
)
523 sm_msg("unhandled comparison %d\n", comparison
);
529 int false_comparison_range_lr(int comparison
, struct data_range
*var
, struct data_range
*val
, int left
)
532 return false_comparison_range(var
, comparison
, val
);
534 return false_comparison_range(val
, comparison
, var
);
537 int possibly_true(struct expression
*left
, int comparison
, struct expression
*right
)
539 struct range_list
*rl_left
, *rl_right
;
540 struct data_range
*tmp_left
, *tmp_right
;
542 if (!get_implied_range_list(left
, &rl_left
))
544 if (!get_implied_range_list(right
, &rl_right
))
547 FOR_EACH_PTR(rl_left
, tmp_left
) {
548 FOR_EACH_PTR(rl_right
, tmp_right
) {
549 if (true_comparison_range(tmp_left
, comparison
, tmp_right
))
551 } END_FOR_EACH_PTR(tmp_right
);
552 } END_FOR_EACH_PTR(tmp_left
);
556 int possibly_false(struct expression
*left
, int comparison
, struct expression
*right
)
558 struct range_list
*rl_left
, *rl_right
;
559 struct data_range
*tmp_left
, *tmp_right
;
561 if (!get_implied_range_list(left
, &rl_left
))
563 if (!get_implied_range_list(right
, &rl_right
))
566 FOR_EACH_PTR(rl_left
, tmp_left
) {
567 FOR_EACH_PTR(rl_right
, tmp_right
) {
568 if (false_comparison_range(tmp_left
, comparison
, tmp_right
))
570 } END_FOR_EACH_PTR(tmp_right
);
571 } END_FOR_EACH_PTR(tmp_left
);
575 int possibly_true_range_lists(struct range_list
*left_ranges
, int comparison
, struct range_list
*right_ranges
)
577 struct data_range
*left_tmp
, *right_tmp
;
579 if (!left_ranges
|| !right_ranges
)
582 FOR_EACH_PTR(left_ranges
, left_tmp
) {
583 FOR_EACH_PTR(right_ranges
, right_tmp
) {
584 if (true_comparison_range(left_tmp
, comparison
, right_tmp
))
586 } END_FOR_EACH_PTR(right_tmp
);
587 } END_FOR_EACH_PTR(left_tmp
);
591 int possibly_false_range_lists(struct range_list
*left_ranges
, int comparison
, struct range_list
*right_ranges
)
593 struct data_range
*left_tmp
, *right_tmp
;
595 if (!left_ranges
|| !right_ranges
)
598 FOR_EACH_PTR(left_ranges
, left_tmp
) {
599 FOR_EACH_PTR(right_ranges
, right_tmp
) {
600 if (false_comparison_range(left_tmp
, comparison
, right_tmp
))
602 } END_FOR_EACH_PTR(right_tmp
);
603 } END_FOR_EACH_PTR(left_tmp
);
607 int possibly_true_range_lists_rl(int comparison
, struct range_list
*a
, struct range_list
*b
, int left
)
610 return possibly_true_range_lists(a
, comparison
, b
);
612 return possibly_true_range_lists(b
, comparison
, a
);
615 int possibly_false_range_lists_rl(int comparison
, struct range_list
*a
, struct range_list
*b
, int left
)
618 return possibly_false_range_lists(a
, comparison
, b
);
620 return possibly_false_range_lists(b
, comparison
, a
);
623 void tack_on(struct range_list
**list
, struct data_range
*drange
)
625 add_ptr_list(list
, drange
);
628 int in_list_exact(struct range_list
*list
, struct data_range
*drange
)
630 struct data_range
*tmp
;
632 FOR_EACH_PTR(list
, tmp
) {
633 if (tmp
->min
== drange
->min
&& tmp
->max
== drange
->max
)
635 } END_FOR_EACH_PTR(tmp
);
640 void push_range_list(struct range_list_stack
**rl_stack
, struct range_list
*rl
)
642 add_ptr_list(rl_stack
, rl
);
645 struct range_list
*pop_range_list(struct range_list_stack
**rl_stack
)
647 struct range_list
*rl
;
649 rl
= last_ptr_list((struct ptr_list
*)*rl_stack
);
650 delete_ptr_list_last((struct ptr_list
**)rl_stack
);
654 struct range_list
*top_range_list(struct range_list_stack
*rl_stack
)
656 struct range_list
*rl
;
658 rl
= last_ptr_list((struct ptr_list
*)rl_stack
);
662 void filter_top_range_list(struct range_list_stack
**rl_stack
, long long num
)
664 struct range_list
*rl
;
666 rl
= pop_range_list(rl_stack
);
667 rl
= remove_range(rl
, num
, num
);
668 push_range_list(rl_stack
, rl
);
671 void free_range_list(struct range_list
**rlist
)
673 __free_ptr_list((struct ptr_list
**)rlist
);
676 static void free_single_dinfo(struct data_info
*dinfo
)
678 if (dinfo
->type
== DATA_RANGE
)
679 free_range_list(&dinfo
->value_ranges
);
682 static void free_dinfos(struct allocation_blob
*blob
)
684 unsigned int size
= sizeof(struct data_info
);
685 unsigned int offset
= 0;
687 while (offset
< blob
->offset
) {
688 free_single_dinfo((struct data_info
*)(blob
->data
+ offset
));
693 void free_data_info_allocs(void)
695 struct allocator_struct
*desc
= &data_info_allocator
;
696 struct allocation_blob
*blob
= desc
->blobs
;
699 desc
->allocations
= 0;
700 desc
->total_bytes
= 0;
701 desc
->useful_bytes
= 0;
702 desc
->freelist
= NULL
;
704 struct allocation_blob
*next
= blob
->next
;
706 blob_free(blob
, desc
->chunking
);
709 clear_data_range_alloc();