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 static char *show_num(long long num
)
22 static char buff
[256];
24 if (num
== whole_range
.min
) {
25 snprintf(buff
, 255, "min");
26 } else if (num
== whole_range
.max
) {
27 snprintf(buff
, 255, "max");
29 snprintf(buff
, 255, "(%lld)", num
);
31 snprintf(buff
, 255, "%lld", num
);
37 char *show_ranges(struct range_list
*list
)
39 struct data_range
*tmp
;
45 FOR_EACH_PTR(list
, tmp
) {
47 strncat(full
, ",", 254 - strlen(full
));
48 if (tmp
->min
== tmp
->max
) {
49 strncat(full
, show_num(tmp
->min
), 254 - strlen(full
));
52 strncat(full
, show_num(tmp
->min
), 254 - strlen(full
));
53 strncat(full
, "-", 254 - strlen(full
));
54 strncat(full
, show_num(tmp
->max
), 254 - strlen(full
));
55 } END_FOR_EACH_PTR(tmp
);
56 return alloc_sname(full
);
59 static struct data_range range_zero
= {
64 static struct data_range range_one
= {
69 struct data_range
*alloc_range(long long min
, long long max
)
71 struct data_range
*ret
;
74 printf("Error invalid range %lld to %lld\n", min
, max
);
76 if (min
== whole_range
.min
&& max
== whole_range
.max
)
78 if (min
== 0 && max
== 0)
80 if (min
== 1 && max
== 1)
82 ret
= __alloc_data_range(0);
88 struct data_range
*alloc_range_perm(long long min
, long long max
)
90 struct data_range
*ret
;
93 printf("Error invalid range %lld to %lld\n", min
, max
);
95 if (min
== whole_range
.min
&& max
== whole_range
.max
)
97 if (min
== 0 && max
== 0)
99 if (min
== 1 && max
== 1)
101 ret
= __alloc_perm_data_range(0);
107 struct data_info
*alloc_dinfo_range(long long min
, long long max
)
109 struct data_info
*ret
;
111 ret
= __alloc_data_info(0);
112 ret
->type
= DATA_RANGE
;
113 ret
->value_ranges
= NULL
;
114 add_range(&ret
->value_ranges
, min
, max
);
118 struct data_info
*alloc_dinfo_range_list(struct range_list
*rl
)
120 struct data_info
*ret
;
122 ret
= __alloc_data_info(0);
123 ret
->type
= DATA_RANGE
;
124 ret
->value_ranges
= rl
;
128 void add_range(struct range_list
**list
, long long min
, long long max
)
130 struct data_range
*tmp
= NULL
;
131 struct data_range
*new = NULL
;
134 FOR_EACH_PTR(*list
, tmp
) {
136 /* Sometimes we overlap with more than one range
137 so we have to delete or modify the next range. */
138 if (max
+ 1 == tmp
->min
) {
139 /* join 2 ranges here */
141 DELETE_CURRENT_PTR(tmp
);
145 /* Doesn't overlap with the next one. */
148 /* Partially overlaps with the next one. */
149 if (max
< tmp
->max
) {
153 /* Completely overlaps with the next one. */
154 if (max
>= tmp
->max
) {
155 DELETE_CURRENT_PTR(tmp
);
156 /* there could be more ranges to delete */
160 if (max
!= whole_range
.max
&& max
+ 1 == tmp
->min
) {
161 /* join 2 ranges into a big range */
162 new = alloc_range(min
, tmp
->max
);
163 REPLACE_CURRENT_PTR(tmp
, new);
166 if (max
< tmp
->min
) { /* new range entirely below */
167 new = alloc_range(min
, max
);
168 INSERT_CURRENT(new, tmp
);
171 if (min
< tmp
->min
) { /* new range partially below */
176 new = alloc_range(min
, max
);
177 REPLACE_CURRENT_PTR(tmp
, new);
182 if (max
<= tmp
->max
) /* new range already included */
184 if (min
<= tmp
->max
) { /* new range partially above */
186 new = alloc_range(min
, max
);
187 REPLACE_CURRENT_PTR(tmp
, new);
191 if (min
!= whole_range
.min
&& min
- 1 == tmp
->max
) {
192 /* join 2 ranges into a big range */
193 new = alloc_range(tmp
->min
, max
);
194 REPLACE_CURRENT_PTR(tmp
, new);
198 /* the new range is entirely above the existing ranges */
199 } END_FOR_EACH_PTR(tmp
);
202 new = alloc_range(min
, max
);
203 add_ptr_list(list
, new);
206 struct range_list
*clone_range_list(struct range_list
*list
)
208 struct data_range
*tmp
;
209 struct range_list
*ret
= NULL
;
211 FOR_EACH_PTR(list
, tmp
) {
212 add_ptr_list(&ret
, tmp
);
213 } END_FOR_EACH_PTR(tmp
);
217 struct range_list
*range_list_union(struct range_list
*one
, struct range_list
*two
)
219 struct data_range
*tmp
;
220 struct range_list
*ret
= NULL
;
222 FOR_EACH_PTR(one
, tmp
) {
223 add_range(&ret
, tmp
->min
, tmp
->max
);
224 } END_FOR_EACH_PTR(tmp
);
225 FOR_EACH_PTR(two
, tmp
) {
226 add_range(&ret
, tmp
->min
, tmp
->max
);
227 } END_FOR_EACH_PTR(tmp
);
231 struct range_list
*remove_range(struct range_list
*list
, long long min
, long long max
)
233 struct data_range
*tmp
;
234 struct range_list
*ret
= NULL
;
236 FOR_EACH_PTR(list
, tmp
) {
237 if (tmp
->max
< min
) {
238 add_range(&ret
, tmp
->min
, tmp
->max
);
241 if (tmp
->min
> max
) {
242 add_range(&ret
, tmp
->min
, tmp
->max
);
245 if (tmp
->min
>= min
&& tmp
->max
<= max
)
247 if (tmp
->min
>= min
) {
248 add_range(&ret
, max
+ 1, tmp
->max
);
249 } else if (tmp
->max
<= max
) {
250 add_range(&ret
, tmp
->min
, min
- 1);
252 add_range(&ret
, tmp
->min
, min
- 1);
253 add_range(&ret
, max
+ 1, tmp
->max
);
255 } END_FOR_EACH_PTR(tmp
);
259 long long get_dinfo_min(struct data_info
*dinfo
)
261 struct data_range
*drange
;
263 if (!dinfo
|| !dinfo
->value_ranges
)
264 return whole_range
.min
;
265 drange
= first_ptr_list((struct ptr_list
*)dinfo
->value_ranges
);
269 long long get_dinfo_max(struct data_info
*dinfo
)
271 struct data_range
*drange
;
273 if (!dinfo
|| !dinfo
->value_ranges
)
274 return whole_range
.max
;
275 drange
= last_ptr_list((struct ptr_list
*)dinfo
->value_ranges
);
280 * if it can be only one and only value return 1, else return 0
282 int get_single_value_from_range(struct data_info
*dinfo
, long long *val
)
284 struct data_range
*tmp
;
287 if (dinfo
->type
!= DATA_RANGE
)
290 FOR_EACH_PTR(dinfo
->value_ranges
, tmp
) {
292 if (tmp
->min
!= tmp
->max
)
298 } END_FOR_EACH_PTR(tmp
);
302 int true_comparison_range(struct data_range
*left
, int comparison
, struct data_range
*right
)
304 switch (comparison
) {
306 case SPECIAL_UNSIGNED_LT
:
307 if (left
->min
< right
->max
)
310 case SPECIAL_UNSIGNED_LTE
:
312 if (left
->min
<= right
->max
)
316 if (left
->max
< right
->min
)
318 if (left
->min
> right
->max
)
321 case SPECIAL_UNSIGNED_GTE
:
323 if (left
->max
>= right
->min
)
327 case SPECIAL_UNSIGNED_GT
:
328 if (left
->max
> right
->min
)
331 case SPECIAL_NOTEQUAL
:
332 if (left
->min
!= left
->max
)
334 if (right
->min
!= right
->max
)
336 if (left
->min
!= right
->min
)
340 sm_msg("unhandled comparison %d\n", comparison
);
346 int true_comparison_range_lr(int comparison
, struct data_range
*var
, struct data_range
*val
, int left
)
349 return true_comparison_range(var
, comparison
, val
);
351 return true_comparison_range(val
, comparison
, var
);
354 static int false_comparison_range(struct data_range
*left
, int comparison
, struct data_range
*right
)
356 switch (comparison
) {
358 case SPECIAL_UNSIGNED_LT
:
359 if (left
->max
>= right
->min
)
362 case SPECIAL_UNSIGNED_LTE
:
364 if (left
->max
> right
->min
)
368 if (left
->min
!= left
->max
)
370 if (right
->min
!= right
->max
)
372 if (left
->min
!= right
->min
)
375 case SPECIAL_UNSIGNED_GTE
:
377 if (left
->min
< right
->max
)
381 case SPECIAL_UNSIGNED_GT
:
382 if (left
->min
<= right
->max
)
385 case SPECIAL_NOTEQUAL
:
386 if (left
->max
< right
->min
)
388 if (left
->min
> right
->max
)
392 sm_msg("unhandled comparison %d\n", comparison
);
398 int false_comparison_range_lr(int comparison
, struct data_range
*var
, struct data_range
*val
, int left
)
401 return false_comparison_range(var
, comparison
, val
);
403 return false_comparison_range(val
, comparison
, var
);
406 int possibly_true(int comparison
, struct data_info
*dinfo
, int num
, int left
)
408 struct data_range
*tmp
;
409 struct data_range drange
;
414 FOR_EACH_PTR(dinfo
->value_ranges
, tmp
) {
415 if (true_comparison_range_lr(comparison
, tmp
, &drange
, left
))
417 } END_FOR_EACH_PTR(tmp
);
421 int possibly_false(int comparison
, struct data_info
*dinfo
, int num
, int left
)
423 struct data_range
*tmp
;
424 struct data_range drange
;
429 FOR_EACH_PTR(dinfo
->value_ranges
, tmp
) {
430 if (false_comparison_range_lr(comparison
, tmp
, &drange
, left
))
432 } END_FOR_EACH_PTR(tmp
);
436 int possibly_true_range_list(int comparison
, struct data_info
*dinfo
, struct range_list
*values
, int left
)
438 struct data_range
*tmp
, *tmp2
;
440 FOR_EACH_PTR(dinfo
->value_ranges
, tmp
) {
441 FOR_EACH_PTR(values
, tmp2
) {
442 if (true_comparison_range_lr(comparison
, tmp
, tmp2
, left
))
444 } END_FOR_EACH_PTR(tmp2
);
445 } END_FOR_EACH_PTR(tmp
);
449 int possibly_false_range_list(int comparison
, struct data_info
*dinfo
, struct range_list
*values
, int left
)
451 struct data_range
*tmp
, *tmp2
;
453 FOR_EACH_PTR(dinfo
->value_ranges
, tmp
) {
454 FOR_EACH_PTR(values
, tmp2
) {
455 if (false_comparison_range_lr(comparison
, tmp
, tmp2
, left
))
457 } END_FOR_EACH_PTR(tmp2
);
458 } END_FOR_EACH_PTR(tmp
);
462 void tack_on(struct range_list
**list
, struct data_range
*drange
)
464 add_ptr_list(list
, drange
);
467 int in_list_exact(struct range_list
*list
, struct data_range
*drange
)
469 struct data_range
*tmp
;
471 FOR_EACH_PTR(list
, tmp
) {
472 if (tmp
->min
== drange
->min
&& tmp
->max
== drange
->max
)
474 } END_FOR_EACH_PTR(tmp
);
479 void push_range_list(struct range_list_stack
**rl_stack
, struct range_list
*rl
)
481 add_ptr_list(rl_stack
, rl
);
484 struct range_list
*pop_range_list(struct range_list_stack
**rl_stack
)
486 struct range_list
*rl
;
488 rl
= last_ptr_list((struct ptr_list
*)*rl_stack
);
489 delete_ptr_list_last((struct ptr_list
**)rl_stack
);
493 struct range_list
*top_range_list(struct range_list_stack
*rl_stack
)
495 struct range_list
*rl
;
497 rl
= last_ptr_list((struct ptr_list
*)rl_stack
);
501 void filter_top_range_list(struct range_list_stack
**rl_stack
, long long num
)
503 struct range_list
*rl
;
505 rl
= pop_range_list(rl_stack
);
506 rl
= remove_range(rl
, num
, num
);
507 push_range_list(rl_stack
, rl
);
510 static void free_single_dinfo(struct data_info
*dinfo
)
512 if (dinfo
->type
== DATA_RANGE
)
513 __free_ptr_list((struct ptr_list
**)&dinfo
->value_ranges
);
516 static void free_dinfos(struct allocation_blob
*blob
)
518 unsigned int size
= sizeof(struct data_info
);
519 unsigned int offset
= 0;
521 while (offset
< blob
->offset
) {
522 free_single_dinfo((struct data_info
*)(blob
->data
+ offset
));
527 void free_data_info_allocs(void)
529 struct allocator_struct
*desc
= &data_info_allocator
;
530 struct allocation_blob
*blob
= desc
->blobs
;
533 desc
->allocations
= 0;
534 desc
->total_bytes
= 0;
535 desc
->useful_bytes
= 0;
536 desc
->freelist
= NULL
;
538 struct allocation_blob
*next
= blob
->next
;
540 blob_free(blob
, desc
->chunking
);
543 clear_data_range_alloc();