2 * sparse/smatch_extra_helper.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 void add_range(struct range_list
**list
, long long min
, long long max
)
120 struct data_range
*tmp
= NULL
;
121 struct data_range
*new;
123 FOR_EACH_PTR(*list
, tmp
) {
124 if (max
!= whole_range
.max
&& max
+ 1 == tmp
->min
) {
125 /* join 2 ranges into a big range */
126 new = alloc_range(min
, tmp
->max
);
127 REPLACE_CURRENT_PTR(tmp
, new);
130 if (max
< tmp
->min
) { /* new range entirely below */
131 new = alloc_range(min
, max
);
132 INSERT_CURRENT(new, tmp
);
135 if (min
< tmp
->min
) { /* new range partially below */
138 new = alloc_range(min
, max
);
139 REPLACE_CURRENT_PTR(tmp
, new);
142 if (max
<= tmp
->max
) /* new range already included */
144 if (min
<= tmp
->max
) { /* new range partially above */
146 new = alloc_range(min
, max
);
147 REPLACE_CURRENT_PTR(tmp
, new);
150 if (min
!= whole_range
.min
&& min
- 1 == tmp
->max
) {
151 /* join 2 ranges into a big range */
152 new = alloc_range(tmp
->min
, max
);
153 REPLACE_CURRENT_PTR(tmp
, new);
156 } END_FOR_EACH_PTR(tmp
);
157 new = alloc_range(min
, max
);
158 add_ptr_list(list
, new);
161 struct range_list
*clone_range_list(struct range_list
*list
)
163 struct data_range
*tmp
;
164 struct range_list
*ret
= NULL
;
166 FOR_EACH_PTR(list
, tmp
) {
167 add_ptr_list(&ret
, tmp
);
168 } END_FOR_EACH_PTR(tmp
);
172 struct range_list
*range_list_union(struct range_list
*one
, struct range_list
*two
)
174 struct data_range
*tmp
;
175 struct range_list
*ret
= NULL
;
177 if (!one
|| !two
) /*having nothing in a list means everything is in */
180 FOR_EACH_PTR(one
, tmp
) {
181 add_range(&ret
, tmp
->min
, tmp
->max
);
182 } END_FOR_EACH_PTR(tmp
);
183 FOR_EACH_PTR(two
, tmp
) {
184 add_range(&ret
, tmp
->min
, tmp
->max
);
185 } END_FOR_EACH_PTR(tmp
);
189 struct range_list
*remove_range(struct range_list
*list
, long long min
, long long max
)
191 struct data_range
*tmp
;
192 struct range_list
*ret
= NULL
;
194 FOR_EACH_PTR(list
, tmp
) {
195 if (tmp
->max
< min
) {
196 add_range(&ret
, tmp
->min
, tmp
->max
);
199 if (tmp
->min
> max
) {
200 add_range(&ret
, tmp
->min
, tmp
->max
);
203 if (tmp
->min
>= min
&& tmp
->max
<= max
)
205 if (tmp
->min
>= min
) {
206 add_range(&ret
, max
+ 1, tmp
->max
);
207 } else if (tmp
->max
<= max
) {
208 add_range(&ret
, tmp
->min
, min
- 1);
210 add_range(&ret
, tmp
->min
, min
- 1);
211 add_range(&ret
, max
+ 1, tmp
->max
);
213 } END_FOR_EACH_PTR(tmp
);
217 long long get_dinfo_min(struct data_info
*dinfo
)
219 struct data_range
*drange
;
221 if (!dinfo
|| !dinfo
->value_ranges
)
222 return whole_range
.min
;
223 drange
= first_ptr_list((struct ptr_list
*)dinfo
->value_ranges
);
227 long long get_dinfo_max(struct data_info
*dinfo
)
229 struct data_range
*drange
;
231 if (!dinfo
|| !dinfo
->value_ranges
)
232 return whole_range
.max
;
233 drange
= first_ptr_list((struct ptr_list
*)dinfo
->value_ranges
);
238 * if it can be only one value return that, else return UNDEFINED
240 long long get_single_value_from_range(struct data_info
*dinfo
)
242 struct data_range
*tmp
;
244 long long ret
= UNDEFINED
;
246 if (dinfo
->type
!= DATA_RANGE
)
249 FOR_EACH_PTR(dinfo
->value_ranges
, tmp
) {
251 if (tmp
->min
!= tmp
->max
)
257 } END_FOR_EACH_PTR(tmp
);
261 int true_comparison_range(struct data_range
*left
, int comparison
, struct data_range
*right
)
265 case SPECIAL_UNSIGNED_LT
:
266 if (left
->min
< right
->max
)
269 case SPECIAL_UNSIGNED_LTE
:
271 if (left
->min
<= right
->max
)
275 if (left
->max
< right
->min
)
277 if (left
->min
> right
->max
)
280 case SPECIAL_UNSIGNED_GTE
:
282 if (left
->max
>= right
->min
)
286 case SPECIAL_UNSIGNED_GT
:
287 if (left
->max
> right
->min
)
290 case SPECIAL_NOTEQUAL
:
291 if (left
->min
!= left
->max
)
293 if (right
->min
!= right
->max
)
295 if (left
->min
!= right
->min
)
299 smatch_msg("unhandled comparison %d\n", comparison
);
305 int true_comparison_range_lr(int comparison
, struct data_range
*var
, struct data_range
*val
, int left
)
308 return true_comparison_range(var
, comparison
, val
);
310 return true_comparison_range(val
, comparison
, var
);
313 static int false_comparison_range(struct data_range
*left
, int comparison
, struct data_range
*right
)
317 case SPECIAL_UNSIGNED_LT
:
318 if (left
->max
>= right
->min
)
321 case SPECIAL_UNSIGNED_LTE
:
323 if (left
->max
> right
->min
)
327 if (left
->min
!= left
->max
)
329 if (right
->min
!= right
->max
)
331 if (left
->min
!= right
->min
)
334 case SPECIAL_UNSIGNED_GTE
:
336 if (left
->min
< right
->max
)
340 case SPECIAL_UNSIGNED_GT
:
341 if (left
->min
<= right
->max
)
344 case SPECIAL_NOTEQUAL
:
345 if (left
->max
< right
->min
)
347 if (left
->min
> right
->max
)
351 smatch_msg("unhandled comparison %d\n", comparison
);
357 int false_comparison_range_lr(int comparison
, struct data_range
*var
, struct data_range
*val
, int left
)
360 return false_comparison_range(var
, comparison
, val
);
362 return false_comparison_range(val
, comparison
, var
);
365 int possibly_true(int comparison
, struct data_info
*dinfo
, int num
, int left
)
367 struct data_range
*tmp
;
368 struct data_range drange
;
373 FOR_EACH_PTR(dinfo
->value_ranges
, tmp
) {
374 if (true_comparison_range_lr(comparison
, tmp
, &drange
, left
))
376 } END_FOR_EACH_PTR(tmp
);
380 int possibly_false(int comparison
, struct data_info
*dinfo
, int num
, int left
)
382 struct data_range
*tmp
;
383 struct data_range drange
;
388 FOR_EACH_PTR(dinfo
->value_ranges
, tmp
) {
389 if (false_comparison_range_lr(comparison
, tmp
, &drange
, left
))
391 } END_FOR_EACH_PTR(tmp
);
395 void tack_on(struct range_list
**list
, struct data_range
*drange
)
397 add_ptr_list(list
, drange
);
400 int in_list_exact(struct range_list
*list
, struct data_range
*drange
)
402 struct data_range
*tmp
;
404 FOR_EACH_PTR(list
, tmp
) {
405 if (tmp
->min
== drange
->min
&& tmp
->max
== drange
->max
)
407 } END_FOR_EACH_PTR(tmp
);
412 static void free_single_dinfo(struct data_info
*dinfo
)
414 if (dinfo
->type
== DATA_RANGE
)
415 __free_ptr_list((struct ptr_list
**)&dinfo
->value_ranges
);
418 static void free_dinfos(struct allocation_blob
*blob
)
420 unsigned int size
= sizeof(struct data_info
);
421 unsigned int offset
= 0;
423 while (offset
< blob
->offset
) {
424 free_single_dinfo((struct data_info
*)(blob
->data
+ offset
));
429 void free_data_info_allocs(void)
431 struct allocator_struct
*desc
= &data_info_allocator
;
432 struct allocation_blob
*blob
= desc
->blobs
;
435 desc
->allocations
= 0;
436 desc
->total_bytes
= 0;
437 desc
->useful_bytes
= 0;
438 desc
->freelist
= NULL
;
440 struct allocation_blob
*next
= blob
->next
;
442 blob_free(blob
, desc
->chunking
);
445 clear_data_range_alloc();