?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
implied: tiny speed up
[smatch.git] / smatch_extra.c
blobefee8f9510c3379747a0d024015cfdedd5eec956
1 /*
2 * Copyright (C) 2008 Dan Carpenter.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version 2
7 * of the License, or (at your option) any later version.
8 *
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, see http://www.gnu.org/copyleft/gpl.txt
16 */
17
18 /*
19 * smatch_extra.c is supposed to track the value of every variable.
20 *
21 */
22
23 #define _GNU_SOURCE
24 #include <string.h>
25
26 #include <stdlib.h>
27 #include <errno.h>
28 #ifndef __USE_ISOC99
29 #define __USE_ISOC99
30 #endif
31 #include <limits.h>
32 #include "parse.h"
33 #include "smatch.h"
34 #include "smatch_slist.h"
35 #include "smatch_extra.h"
36
37 static int my_id;
38 static int link_id;
39
40 static void match_link_modify(struct sm_state *sm, struct expression *mod_expr);
41
42 struct string_list *__ignored_macros = NULL;
43 static int in_warn_on_macro(void)
44 {
45 struct statement *stmt;
46 char *tmp;
47 char *macro;
48
49 stmt = get_current_statement();
50 if (!stmt)
51 return 0;
52 macro = get_macro_name(stmt->pos);
53 if (!macro)
54 return 0;
55
56 FOR_EACH_PTR(__ignored_macros, tmp) {
57 if (!strcmp(tmp, macro))
58 return 1;
59 } END_FOR_EACH_PTR(tmp);
60 return 0;
61 }
62
63 typedef void (mod_hook)(const char *name, struct symbol *sym, struct smatch_state *state);
64 DECLARE_PTR_LIST(void_fn_list, mod_hook *);
65 static struct void_fn_list *extra_mod_hooks;
66 void add_extra_mod_hook(mod_hook *fn)
67 {
68 mod_hook **p = malloc(sizeof(mod_hook *));
69 *p = fn;
70 add_ptr_list(&extra_mod_hooks, p);
71 }
72
73 void call_extra_mod_hooks(const char *name, struct symbol *sym, struct smatch_state *state)
74 {
75 mod_hook **fn;
76
77 FOR_EACH_PTR(extra_mod_hooks, fn) {
78 (*fn)(name, sym, state);
79 } END_FOR_EACH_PTR(fn);
80 }
81
82 struct sm_state *set_extra_mod_helper(const char *name, struct symbol *sym, struct smatch_state *state)
83 {
84 remove_from_equiv(name, sym);
85 call_extra_mod_hooks(name, sym, state);
86 if (__in_fake_assign && estate_is_unknown(state) && !get_state(SMATCH_EXTRA, name, sym))
87 return NULL;
88 return set_state(SMATCH_EXTRA, name, sym, state);
89 }
90
91 char *get_other_name_sym(const char *name, struct symbol *sym, struct symbol **new_sym)
92 {
93 struct expression *assigned;
94 char *orig_name = NULL;
95 char buf[256];
96 char *ret = NULL;
97 int skip;
98
99 *new_sym = NULL;
100
101 if (!sym || !sym->ident)
102 return NULL;
103
104 skip = strlen(sym->ident->name);
105 if (name[skip] != '-' || name[skip + 1] != '>')
106 return NULL;
107 skip += 2;
108
109 assigned = get_assigned_expr_name_sym(sym->ident->name, sym);
110 if (!assigned)
111 return NULL;
112 if (assigned->type == EXPR_PREOP || assigned->op == '&') {
113
114 orig_name = expr_to_var_sym(assigned, new_sym);
115 if (!orig_name || !*new_sym)
116 goto free;
117
118 snprintf(buf, sizeof(buf), "%s.%s", orig_name + 1, name + skip);
119 ret = alloc_string(buf);
120 free_string(orig_name);
121 return ret;
122 }
123
124 if (assigned->type != EXPR_DEREF)
125 goto free;
126
127 orig_name = expr_to_var_sym(assigned, new_sym);
128 if (!orig_name || !*new_sym)
129 goto free;
130
131 snprintf(buf, sizeof(buf), "%s->%s", orig_name, name + skip);
132 ret = alloc_string(buf);
133 free_string(orig_name);
134 return ret;
135
136 free:
137 free_string(orig_name);
138 return NULL;
139 }
140
141 struct sm_state *set_extra_mod(const char *name, struct symbol *sym, struct smatch_state *state)
142 {
143 char *new_name;
144 struct symbol *new_sym;
145 struct sm_state *sm;
146
147 sm = set_extra_mod_helper(name, sym, state);
148 new_name = get_other_name_sym(name, sym, &new_sym);
149 if (new_name && new_sym)
150 set_extra_mod_helper(new_name, new_sym, state);
151 free_string(new_name);
152 return sm;
153 }
154
155 static void clear_array_states(struct expression *array)
156 {
157 struct sm_state *sm;
158
159 sm = get_sm_state_expr(link_id, array);
160 if (sm)
161 match_link_modify(sm, NULL);
162 }
163
164 static struct sm_state *set_extra_array_mod(struct expression *expr, struct smatch_state *state)
165 {
166 struct expression *array;
167 struct var_sym_list *vsl;
168 struct var_sym *vs;
169 char *name;
170 struct symbol *sym;
171 struct sm_state *ret = NULL;
172
173 array = get_array_base(expr);
174
175 name = expr_to_chunk_sym_vsl(expr, &sym, &vsl);
176 if (!name || !vsl) {
177 clear_array_states(array);
178 goto free;
179 }
180
181 FOR_EACH_PTR(vsl, vs) {
182 store_link(link_id, vs->var, vs->sym, name, sym);
183 } END_FOR_EACH_PTR(vs);
184
185 call_extra_mod_hooks(name, sym, state);
186 ret = set_state(SMATCH_EXTRA, name, sym, state);
187 free:
188 free_string(name);
189 return ret;
190 }
191
192 struct sm_state *set_extra_expr_mod(struct expression *expr, struct smatch_state *state)
193 {
194 struct symbol *sym;
195 char *name;
196 struct sm_state *ret = NULL;
197
198 if (is_array(expr))
199 return set_extra_array_mod(expr, state);
200
201 expr = strip_expr(expr);
202 name = expr_to_var_sym(expr, &sym);
203 if (!name || !sym)
204 goto free;
205 ret = set_extra_mod(name, sym, state);
206 free:
207 free_string(name);
208 return ret;
209 }
210
211 void set_extra_nomod(const char *name, struct symbol *sym, struct smatch_state *state)
212 {
213 char *new_name;
214 struct symbol *new_sym;
215 struct relation *rel;
216 struct smatch_state *orig_state;
217
218 orig_state = get_state(SMATCH_EXTRA, name, sym);
219
220 new_name = get_other_name_sym(name, sym, &new_sym);
221 if (new_name && new_sym)
222 set_state(SMATCH_EXTRA, new_name, new_sym, state);
223 free_string(new_name);
224
225 if (!estate_related(orig_state)) {
226 set_state(SMATCH_EXTRA, name, sym, state);
227 return;
228 }
229
230 set_related(state, estate_related(orig_state));
231 FOR_EACH_PTR(estate_related(orig_state), rel) {
232 struct smatch_state *estate;
233
234 if (option_debug_related)
235 sm_msg("%s updating related %s to %s", name, rel->name, state->name);
236 estate = get_state(SMATCH_EXTRA, rel->name, rel->sym);
237 if (!estate)
238 continue;
239 set_state(SMATCH_EXTRA, rel->name, rel->sym, clone_estate_cast(estate_type(estate), state));
240 } END_FOR_EACH_PTR(rel);
241 }
242
243 void set_extra_nomod_vsl(const char *name, struct symbol *sym, struct var_sym_list *vsl, struct smatch_state *state)
244 {
245 struct var_sym *vs;
246
247 FOR_EACH_PTR(vsl, vs) {
248 store_link(link_id, vs->var, vs->sym, name, sym);
249 } END_FOR_EACH_PTR(vs);
250
251 set_extra_nomod(name, sym, state);
252 }
253
254 /*
255 * This is for return_implies_state() hooks which modify a SMATCH_EXTRA state
256 */
257 void set_extra_expr_nomod(struct expression *expr, struct smatch_state *state)
258 {
259 struct var_sym_list *vsl;
260 struct var_sym *vs;
261 char *name;
262 struct symbol *sym;
263
264 name = expr_to_chunk_sym_vsl(expr, &sym, &vsl);
265 if (!name || !vsl)
266 goto free;
267 FOR_EACH_PTR(vsl, vs) {
268 store_link(link_id, vs->var, vs->sym, name, sym);
269 } END_FOR_EACH_PTR(vs);
270
271 set_extra_nomod(name, sym, state);
272 free:
273 free_string(name);
274 }
275
276 static void set_extra_true_false(const char *name, struct symbol *sym,
277 struct smatch_state *true_state,
278 struct smatch_state *false_state)
279 {
280 char *new_name;
281 struct symbol *new_sym;
282 struct relation *rel;
283 struct smatch_state *orig_state;
284
285 if (!true_state && !false_state)
286 return;
287
288 if (in_warn_on_macro())
289 return;
290
291 new_name = get_other_name_sym(name, sym, &new_sym);
292 if (new_name && new_sym)
293 set_true_false_states(SMATCH_EXTRA, new_name, new_sym, true_state, false_state);
294 free_string(new_name);
295
296 orig_state = get_state(SMATCH_EXTRA, name, sym);
297
298 if (!estate_related(orig_state)) {
299 set_true_false_states(SMATCH_EXTRA, name, sym, true_state, false_state);
300 return;
301 }
302
303 if (true_state)
304 set_related(true_state, estate_related(orig_state));
305 if (false_state)
306 set_related(false_state, estate_related(orig_state));
307
308 FOR_EACH_PTR(estate_related(orig_state), rel) {
309 set_true_false_states(SMATCH_EXTRA, rel->name, rel->sym,
310 true_state, false_state);
311 } END_FOR_EACH_PTR(rel);
312 }
313
314 static void set_extra_chunk_true_false(struct expression *expr,
315 struct smatch_state *true_state,
316 struct smatch_state *false_state)
317 {
318 struct var_sym_list *vsl;
319 struct var_sym *vs;
320 struct symbol *type;
321 char *name;
322 struct symbol *sym;
323
324 if (in_warn_on_macro())
325 return;
326
327 type = get_type(expr);
328 if (!type)
329 return;
330
331 name = expr_to_chunk_sym_vsl(expr, &sym, &vsl);
332 if (!name || !vsl)
333 goto free;
334 FOR_EACH_PTR(vsl, vs) {
335 store_link(link_id, vs->var, vs->sym, name, sym);
336 } END_FOR_EACH_PTR(vs);
337
338 set_true_false_states(SMATCH_EXTRA, name, sym,
339 clone_estate(true_state),
340 clone_estate(false_state));
341 free:
342 free_string(name);
343 }
344
345 static void set_extra_expr_true_false(struct expression *expr,
346 struct smatch_state *true_state,
347 struct smatch_state *false_state)
348 {
349 char *name;
350 struct symbol *sym;
351 sval_t sval;
352
353 if (!true_state && !false_state)
354 return;
355
356 if (get_value(expr, &sval))
357 return;
358
359 expr = strip_expr(expr);
360 name = expr_to_var_sym(expr, &sym);
361 if (!name || !sym) {
362 free_string(name);
363 set_extra_chunk_true_false(expr, true_state, false_state);
364 return;
365 }
366 set_extra_true_false(name, sym, true_state, false_state);
367 free_string(name);
368 }
369
370 static struct sm_state *handle_canonical_while_count_down(struct statement *loop)
371 {
372 struct expression *iter_var;
373 struct expression *condition;
374 struct sm_state *sm;
375 struct smatch_state *estate;
376 sval_t start;
377
378 condition = strip_expr(loop->iterator_pre_condition);
379 if (!condition)
380 return NULL;
381 if (condition->type != EXPR_PREOP && condition->type != EXPR_POSTOP)
382 return NULL;
383 if (condition->op != SPECIAL_DECREMENT)
384 return NULL;
385
386 iter_var = condition->unop;
387 sm = get_sm_state_expr(SMATCH_EXTRA, iter_var);
388 if (!sm)
389 return NULL;
390 if (sval_cmp_val(estate_min(sm->state), 0) < 0)
391 return NULL;
392 start = estate_max(sm->state);
393 if (sval_cmp_val(start, 0) <= 0)
394 return NULL;
395 if (!sval_is_max(start))
396 start.value--;
397
398 if (condition->type == EXPR_PREOP) {
399 estate = alloc_estate_range(sval_type_val(start.type, 1), start);
400 if (estate_has_hard_max(sm->state))
401 estate_set_hard_max(estate);
402 estate_copy_fuzzy_max(estate, sm->state);
403 set_extra_expr_mod(iter_var, estate);
404 }
405 if (condition->type == EXPR_POSTOP) {
406 estate = alloc_estate_range(sval_type_val(start.type, 0), start);
407 if (estate_has_hard_max(sm->state))
408 estate_set_hard_max(estate);
409 estate_copy_fuzzy_max(estate, sm->state);
410 set_extra_expr_mod(iter_var, estate);
411 }
412 return get_sm_state_expr(SMATCH_EXTRA, iter_var);
413 }
414
415 static struct sm_state *handle_canonical_for_inc(struct expression *iter_expr,
416 struct expression *condition)
417 {
418 struct expression *iter_var;
419 struct sm_state *sm;
420 struct smatch_state *estate;
421 sval_t start, end, max;
422
423 iter_var = iter_expr->unop;
424 sm = get_sm_state_expr(SMATCH_EXTRA, iter_var);
425 if (!sm)
426 return NULL;
427 if (!estate_get_single_value(sm->state, &start))
428 return NULL;
429 if (get_implied_max(condition->right, &end))
430 end = sval_cast(get_type(iter_var), end);
431 else
432 end = sval_type_max(get_type(iter_var));
433
434 if (get_sm_state_expr(SMATCH_EXTRA, condition->left) != sm)
435 return NULL;
436
437 switch (condition->op) {
438 case SPECIAL_UNSIGNED_LT:
439 case SPECIAL_NOTEQUAL:
440 case '<':
441 if (!sval_is_min(end))
442 end.value--;
443 break;
444 case SPECIAL_UNSIGNED_LTE:
445 case SPECIAL_LTE:
446 break;
447 default:
448 return NULL;
449 }
450 if (sval_cmp(end, start) < 0)
451 return NULL;
452 estate = alloc_estate_range(start, end);
453 if (get_hard_max(condition->right, &max)) {
454 estate_set_hard_max(estate);
455 if (condition->op == '<' ||
456 condition->op == SPECIAL_UNSIGNED_LT ||
457 condition->op == SPECIAL_NOTEQUAL)
458 max.value--;
459 estate_set_fuzzy_max(estate, max);
460 }
461 set_extra_expr_mod(iter_var, estate);
462 return get_sm_state_expr(SMATCH_EXTRA, iter_var);
463 }
464
465 static struct sm_state *handle_canonical_for_dec(struct expression *iter_expr,
466 struct expression *condition)
467 {
468 struct expression *iter_var;
469 struct sm_state *sm;
470 struct smatch_state *estate;
471 sval_t start, end;
472
473 iter_var = iter_expr->unop;
474 sm = get_sm_state_expr(SMATCH_EXTRA, iter_var);
475 if (!sm)
476 return NULL;
477 if (!estate_get_single_value(sm->state, &start))
478 return NULL;
479 if (!get_implied_min(condition->right, &end))
480 end = sval_type_min(get_type(iter_var));
481 if (get_sm_state_expr(SMATCH_EXTRA, condition->left) != sm)
482 return NULL;
483
484 switch (condition->op) {
485 case SPECIAL_NOTEQUAL:
486 case '>':
487 if (!sval_is_min(end) && !sval_is_max(end))
488 end.value++;
489 break;
490 case SPECIAL_GTE:
491 break;
492 default:
493 return NULL;
494 }
495 if (sval_cmp(end, start) > 0)
496 return NULL;
497 estate = alloc_estate_range(end, start);
498 estate_set_hard_max(estate);
499 estate_set_fuzzy_max(estate, estate_get_fuzzy_max(estate));
500 set_extra_expr_mod(iter_var, estate);
501 return get_sm_state_expr(SMATCH_EXTRA, iter_var);
502 }
503
504 static struct sm_state *handle_canonical_for_loops(struct statement *loop)
505 {
506 struct expression *iter_expr;
507 struct expression *condition;
508
509 if (!loop->iterator_post_statement)
510 return NULL;
511 if (loop->iterator_post_statement->type != STMT_EXPRESSION)
512 return NULL;
513 iter_expr = loop->iterator_post_statement->expression;
514 if (!loop->iterator_pre_condition)
515 return NULL;
516 if (loop->iterator_pre_condition->type != EXPR_COMPARE)
517 return NULL;
518 condition = loop->iterator_pre_condition;
519
520 if (iter_expr->op == SPECIAL_INCREMENT)
521 return handle_canonical_for_inc(iter_expr, condition);
522 if (iter_expr->op == SPECIAL_DECREMENT)
523 return handle_canonical_for_dec(iter_expr, condition);
524 return NULL;
525 }
526
527 struct sm_state *__extra_handle_canonical_loops(struct statement *loop, struct stree **stree)
528 {
529 struct sm_state *ret;
530
531 __push_fake_cur_stree();
532 if (!loop->iterator_post_statement)
533 ret = handle_canonical_while_count_down(loop);
534 else
535 ret = handle_canonical_for_loops(loop);
536 *stree = __pop_fake_cur_stree();
537 return ret;
538 }
539
540 int __iterator_unchanged(struct sm_state *sm)
541 {
542 if (!sm)
543 return 0;
544 if (get_sm_state(my_id, sm->name, sm->sym) == sm)
545 return 1;
546 return 0;
547 }
548
549 static void while_count_down_after(struct sm_state *sm, struct expression *condition)
550 {
551 sval_t after_value;
552
553 /* paranoid checking. prolly not needed */
554 condition = strip_expr(condition);
555 if (!condition)
556 return;
557 if (condition->type != EXPR_PREOP && condition->type != EXPR_POSTOP)
558 return;
559 if (condition->op != SPECIAL_DECREMENT)
560 return;
561 after_value = estate_min(sm->state);
562 after_value.value--;
563 set_extra_mod(sm->name, sm->sym, alloc_estate_sval(after_value));
564 }
565
566 void __extra_pre_loop_hook_after(struct sm_state *sm,
567 struct statement *iterator,
568 struct expression *condition)
569 {
570 struct expression *iter_expr;
571 sval_t limit;
572 struct smatch_state *state;
573
574 if (!iterator) {
575 while_count_down_after(sm, condition);
576 return;
577 }
578
579 iter_expr = iterator->expression;
580
581 if (condition->type != EXPR_COMPARE)
582 return;
583 if (iter_expr->op == SPECIAL_INCREMENT) {
584 limit = sval_binop(estate_max(sm->state), '+',
585 sval_type_val(estate_type(sm->state), 1));
586 } else {
587 limit = sval_binop(estate_min(sm->state), '-',
588 sval_type_val(estate_type(sm->state), 1));
589 }
590 if (!estate_has_hard_max(sm->state) && !__has_breaks()) {
591 if (iter_expr->op == SPECIAL_INCREMENT)
592 state = alloc_estate_range(estate_min(sm->state), limit);
593 else
594 state = alloc_estate_range(limit, estate_max(sm->state));
595 } else {
596 state = alloc_estate_sval(limit);
597 }
598 if (!estate_has_hard_max(sm->state)) {
599 estate_clear_hard_max(state);
600 }
601 if (estate_has_fuzzy_max(sm->state)) {
602 sval_t hmax = estate_get_fuzzy_max(sm->state);
603 sval_t max = estate_max(sm->state);
604
605 if (sval_cmp(hmax, max) != 0)
606 estate_clear_fuzzy_max(state);
607 } else if (!estate_has_fuzzy_max(sm->state)) {
608 estate_clear_fuzzy_max(state);
609 }
610
611 set_extra_mod(sm->name, sm->sym, state);
612 }
613
614 static struct stree *unmatched_stree;
615 static struct smatch_state *unmatched_state(struct sm_state *sm)
616 {
617 struct smatch_state *state;
618
619 if (unmatched_stree) {
620 state = get_state_stree(unmatched_stree, SMATCH_EXTRA, sm->name, sm->sym);
621 if (state)
622 return state;
623 }
624 if (parent_is_gone_var_sym(sm->name, sm->sym))
625 return alloc_estate_empty();
626 return alloc_estate_whole(estate_type(sm->state));
627 }
628
629 static void clear_the_pointed_at(struct expression *expr)
630 {
631 struct stree *stree;
632 char *name;
633 struct symbol *sym;
634 struct sm_state *tmp;
635
636 name = expr_to_var_sym(expr, &sym);
637 if (!name || !sym)
638 goto free;
639
640 stree = __get_cur_stree();
641 FOR_EACH_MY_SM(SMATCH_EXTRA, stree, tmp) {
642 if (tmp->name[0] != '*')
643 continue;
644 if (tmp->sym != sym)
645 continue;
646 if (strcmp(tmp->name + 1, name) != 0)
647 continue;
648 set_extra_mod(tmp->name, tmp->sym, alloc_estate_whole(estate_type(tmp->state)));
649 } END_FOR_EACH_SM(tmp);
650
651 free:
652 free_string(name);
653 }
654
655 static void match_function_call(struct expression *expr)
656 {
657 struct expression *arg;
658 struct expression *tmp;
659
660 /* if we have the db this is handled in smatch_function_hooks.c */
661 if (!option_no_db)
662 return;
663 if (inlinable(expr->fn))
664 return;
665
666 FOR_EACH_PTR(expr->args, arg) {
667 tmp = strip_expr(arg);
668 if (tmp->type == EXPR_PREOP && tmp->op == '&')
669 set_extra_expr_mod(tmp->unop, alloc_estate_whole(get_type(tmp->unop)));
670 else
671 clear_the_pointed_at(tmp);
672 } END_FOR_EACH_PTR(arg);
673 }
674
675 static int values_fit_type(struct expression *left, struct expression *right)
676 {
677 struct range_list *rl;
678 struct symbol *type;
679
680 type = get_type(left);
681 if (!type)
682 return 0;
683 get_absolute_rl(right, &rl);
684 if (type_unsigned(type) && sval_is_negative(rl_min(rl)))
685 return 0;
686 if (sval_cmp(sval_type_min(type), rl_min(rl)) > 0)
687 return 0;
688 if (sval_cmp(sval_type_max(type), rl_max(rl)) < 0)
689 return 0;
690 return 1;
691 }
692
693 static void save_chunk_info(struct expression *left, struct expression *right)
694 {
695 struct var_sym_list *vsl;
696 struct var_sym *vs;
697 struct expression *add_expr;
698 struct symbol *type;
699 sval_t sval;
700 char *name;
701 struct symbol *sym;
702
703 if (right->type != EXPR_BINOP || right->op != '-')
704 return;
705 if (!get_value(right->left, &sval))
706 return;
707 if (!expr_to_sym(right->right))
708 return;
709
710 add_expr = binop_expression(left, '+', right->right);
711 type = get_type(add_expr);
712 if (!type)
713 return;
714 name = expr_to_chunk_sym_vsl(add_expr, &sym, &vsl);
715 if (!name || !vsl)
716 goto free;
717 FOR_EACH_PTR(vsl, vs) {
718 store_link(link_id, vs->var, vs->sym, name, sym);
719 } END_FOR_EACH_PTR(vs);
720
721 set_state(SMATCH_EXTRA, name, sym, alloc_estate_sval(sval_cast(type, sval)));
722 free:
723 free_string(name);
724 }
725
726 static void do_array_assign(struct expression *left, int op, struct expression *right)
727 {
728 struct range_list *rl;
729
730 if (op == '=') {
731 get_absolute_rl(right, &rl);
732 rl = cast_rl(get_type(left), rl);
733 } else {
734 rl = alloc_whole_rl(get_type(left));
735 }
736
737 set_extra_array_mod(left, alloc_estate_rl(rl));
738 }
739
740 static void match_untracked_array(struct expression *call, int param)
741 {
742 struct expression *arg;
743
744 arg = get_argument_from_call_expr(call->args, param);
745 arg = strip_expr(arg);
746
747 clear_array_states(arg);
748 }
749
750 static void match_vanilla_assign(struct expression *left, struct expression *right)
751 {
752 struct range_list *orig_rl = NULL;
753 struct range_list *rl = NULL;
754 struct symbol *right_sym;
755 struct symbol *left_type;
756 struct symbol *right_type;
757 char *right_name = NULL;
758 struct symbol *sym;
759 char *name;
760 sval_t max;
761 struct smatch_state *state;
762 int comparison;
763
764 if (is_struct(left))
765 return;
766
767 save_chunk_info(left, right);
768
769 name = expr_to_var_sym(left, &sym);
770 if (!name) {
771 if (is_array(left))
772 do_array_assign(left, '=', right);
773 return;
774 }
775
776 left_type = get_type(left);
777 right_type = get_type(right);
778
779 right_name = expr_to_var_sym(right, &right_sym);
780
781 if (!__in_fake_assign &&
782 !(right->type == EXPR_PREOP && right->op == '&') &&
783 right_name && right_sym &&
784 values_fit_type(left, right) &&
785 !has_symbol(right, sym)) {
786 set_equiv(left, right);
787 goto free;
788 }
789
790 if (is_pointer(right) && get_address_rl(right, &rl)) {
791 state = alloc_estate_rl(rl);
792 goto done;
793 }
794
795 if (__in_fake_assign) {
796 struct smatch_state *right_state;
797 sval_t sval;
798
799 if (get_value(right, &sval)) {
800 sval = sval_cast(left_type, sval);
801 state = alloc_estate_sval(sval);
802 goto done;
803 }
804
805 right_state = get_state(SMATCH_EXTRA, right_name, right_sym);
806 if (right_state) {
807 /* simple assignment */
808 state = clone_estate(right_state);
809 goto done;
810 }
811
812 state = alloc_estate_rl(alloc_whole_rl(left_type));
813 goto done;
814 }
815
816 comparison = get_comparison(left, right);
817 if (comparison) {
818 comparison = flip_comparison(comparison);
819 get_implied_rl(left, &orig_rl);
820 }
821
822 if (get_implied_rl(right, &rl)) {
823 rl = cast_rl(left_type, rl);
824 if (orig_rl)
825 filter_by_comparison(&rl, comparison, orig_rl);
826 state = alloc_estate_rl(rl);
827 if (get_hard_max(right, &max)) {
828 estate_set_hard_max(state);
829 estate_set_fuzzy_max(state, max);
830 }
831 } else {
832 rl = alloc_whole_rl(right_type);
833 rl = cast_rl(left_type, rl);
834 if (orig_rl)
835 filter_by_comparison(&rl, comparison, orig_rl);
836 state = alloc_estate_rl(rl);
837 }
838
839 done:
840 set_extra_mod(name, sym, state);
841 free:
842 free_string(right_name);
843 }
844
845 static int op_remove_assign(int op)
846 {
847 switch (op) {
848 case SPECIAL_ADD_ASSIGN:
849 return '+';
850 case SPECIAL_SUB_ASSIGN:
851 return '-';
852 case SPECIAL_MUL_ASSIGN:
853 return '*';
854 case SPECIAL_DIV_ASSIGN:
855 return '/';
856 case SPECIAL_MOD_ASSIGN:
857 return '%';
858 case SPECIAL_AND_ASSIGN:
859 return '&';
860 case SPECIAL_OR_ASSIGN:
861 return '|';
862 case SPECIAL_XOR_ASSIGN:
863 return '^';
864 case SPECIAL_SHL_ASSIGN:
865 return SPECIAL_LEFTSHIFT;
866 case SPECIAL_SHR_ASSIGN:
867 return SPECIAL_RIGHTSHIFT;
868 default:
869 return op;
870 }
871 }
872
873 static void match_assign(struct expression *expr)
874 {
875 struct range_list *rl = NULL;
876 struct expression *left;
877 struct expression *right;
878 struct expression *binop_expr;
879 struct symbol *left_type;
880 struct symbol *sym;
881 char *name;
882 sval_t left_min, left_max;
883 sval_t right_min, right_max;
884 sval_t res_min, res_max;
885
886 left = strip_expr(expr->left);
887
888 right = strip_parens(expr->right);
889 if (right->type == EXPR_CALL && sym_name_is("__builtin_expect", right->fn))
890 right = get_argument_from_call_expr(right->args, 0);
891 while (right->type == EXPR_ASSIGNMENT && right->op == '=')
892 right = strip_parens(right->left);
893
894 if (expr->op == '=' && is_condition(expr->right))
895 return; /* handled in smatch_condition.c */
896 if (expr->op == '=' && right->type == EXPR_CALL)
897 return; /* handled in smatch_function_hooks.c */
898 if (expr->op == '=') {
899 match_vanilla_assign(left, right);
900 return;
901 }
902
903 name = expr_to_var_sym(left, &sym);
904 if (!name)
905 return;
906
907 left_type = get_type(left);
908
909 res_min = sval_type_min(left_type);
910 res_max = sval_type_max(left_type);
911
912 switch (expr->op) {
913 case SPECIAL_ADD_ASSIGN:
914 get_absolute_max(left, &left_max);
915 get_absolute_max(right, &right_max);
916 if (sval_binop_overflows(left_max, '+', right_max))
917 break;
918 if (get_implied_min(left, &left_min) &&
919 !sval_is_negative_min(left_min) &&
920 get_implied_min(right, &right_min) &&
921 !sval_is_negative_min(right_min)) {
922 res_min = sval_binop(left_min, '+', right_min);
923 res_min = sval_cast(left_type, res_min);
924 }
925 if (inside_loop()) /* we are assuming loops don't lead to wrapping */
926 break;
927 res_max = sval_binop(left_max, '+', right_max);
928 res_max = sval_cast(left_type, res_max);
929 break;
930 case SPECIAL_SUB_ASSIGN:
931 if (get_implied_max(left, &left_max) &&
932 !sval_is_max(left_max) &&
933 get_implied_min(right, &right_min) &&
934 !sval_is_min(right_min)) {
935 res_max = sval_binop(left_max, '-', right_min);
936 res_max = sval_cast(left_type, res_max);
937 }
938 if (inside_loop())
939 break;
940 if (get_implied_min(left, &left_min) &&
941 !sval_is_min(left_min) &&
942 get_implied_max(right, &right_max) &&
943 !sval_is_max(right_max) &&
944 sval_cmp(left_min, right_max) > 0) {
945 res_min = sval_binop(left_min, '-', right_max);
946 res_min = sval_cast(left_type, res_min);
947 }
948 break;
949 case SPECIAL_AND_ASSIGN:
950 case SPECIAL_MOD_ASSIGN:
951 case SPECIAL_SHL_ASSIGN:
952 case SPECIAL_SHR_ASSIGN:
953 case SPECIAL_OR_ASSIGN:
954 case SPECIAL_XOR_ASSIGN:
955 case SPECIAL_MUL_ASSIGN:
956 case SPECIAL_DIV_ASSIGN:
957 binop_expr = binop_expression(expr->left,
958 op_remove_assign(expr->op),
959 expr->right);
960 if (get_absolute_rl(binop_expr, &rl)) {
961 rl = cast_rl(left_type, rl);
962 set_extra_mod(name, sym, alloc_estate_rl(rl));
963 goto free;
964 }
965 break;
966 }
967 rl = cast_rl(left_type, alloc_rl(res_min, res_max));
968 set_extra_mod(name, sym, alloc_estate_rl(rl));
969 free:
970 free_string(name);
971 }
972
973 static struct smatch_state *increment_state(struct smatch_state *state)
974 {
975 sval_t min = estate_min(state);
976 sval_t max = estate_max(state);
977
978 if (!estate_rl(state))
979 return NULL;
980
981 if (inside_loop())
982 max = sval_type_max(max.type);
983
984 if (!sval_is_min(min) && !sval_is_max(min))
985 min.value++;
986 if (!sval_is_min(max) && !sval_is_max(max))
987 max.value++;
988 return alloc_estate_range(min, max);
989 }
990
991 static struct smatch_state *decrement_state(struct smatch_state *state)
992 {
993 sval_t min = estate_min(state);
994 sval_t max = estate_max(state);
995
996 if (!estate_rl(state))
997 return NULL;
998
999 if (inside_loop())
1000 min = sval_type_min(min.type);
1001
1002 if (!sval_is_min(min) && !sval_is_max(min))
1003 min.value--;
1004 if (!sval_is_min(max) && !sval_is_max(max))
1005 max.value--;
1006 return alloc_estate_range(min, max);
1007 }
1008
1009 static void clear_pointed_at_state(struct expression *expr)
1010 {
1011 struct symbol *type;
1012
1013 /*
1014 * ALERT: This is sort of a mess. If it's is a struct assigment like
1015 * "foo = bar;", then that's handled by smatch_struct_assignment.c.
1016 * the same thing for p++ where "p" is a struct. Most modifications
1017 * are handled by the assignment hook or the db. Smatch_extra.c doesn't
1018 * use smatch_modification.c because we have to get the ordering right
1019 * or something. So if you have p++ where p is a pointer to a standard
1020 * c type then we handle that here. What a mess.
1021 */
1022
1023 type = get_type(expr);
1024 if (!type || type->type != SYM_PTR)
1025 return;
1026 type = get_real_base_type(type);
1027 if (!type || type->type != SYM_BASETYPE)
1028 return;
1029 set_extra_expr_mod(deref_expression(expr), alloc_estate_whole(type));
1030 }
1031
1032 static void unop_expr(struct expression *expr)
1033 {
1034 struct smatch_state *state;
1035
1036 if (expr->smatch_flags & Handled)
1037 return;
1038
1039 switch (expr->op) {
1040 case SPECIAL_INCREMENT:
1041 state = get_state_expr(SMATCH_EXTRA, expr->unop);
1042 state = increment_state(state);
1043 if (!state)
1044 state = alloc_estate_whole(get_type(expr));
1045 set_extra_expr_mod(expr->unop, state);
1046 clear_pointed_at_state(expr->unop);
1047 break;
1048 case SPECIAL_DECREMENT:
1049 state = get_state_expr(SMATCH_EXTRA, expr->unop);
1050 state = decrement_state(state);
1051 if (!state)
1052 state = alloc_estate_whole(get_type(expr));
1053 set_extra_expr_mod(expr->unop, state);
1054 clear_pointed_at_state(expr->unop);
1055 break;
1056 default:
1057 return;
1058 }
1059 }
1060
1061 static void asm_expr(struct statement *stmt)
1062 {
1063
1064 struct expression *expr;
1065 struct symbol *type;
1066 int state = 0;
1067
1068 FOR_EACH_PTR(stmt->asm_outputs, expr) {
1069 switch (state) {
1070 case 0: /* identifier */
1071 case 1: /* constraint */
1072 state++;
1073 continue;
1074 case 2: /* expression */
1075 state = 0;
1076 type = get_type(strip_expr(expr));
1077 set_extra_expr_mod(expr, alloc_estate_whole(type));
1078 continue;
1079 }
1080 } END_FOR_EACH_PTR(expr);
1081 }
1082
1083 static void check_dereference(struct expression *expr)
1084 {
1085 if (__in_fake_assign)
1086 return;
1087 if (outside_of_function())
1088 return;
1089 if (implied_not_equal(expr, 0))
1090 return;
1091 set_extra_expr_nomod(expr, alloc_estate_range(valid_ptr_min_sval, valid_ptr_max_sval));
1092 }
1093
1094 static void match_dereferences(struct expression *expr)
1095 {
1096 if (expr->type != EXPR_PREOP)
1097 return;
1098 /* it's saying that foo[1] = bar dereferences foo[1] */
1099 if (is_array(expr))
1100 return;
1101 check_dereference(expr->unop);
1102 }
1103
1104 static void match_pointer_as_array(struct expression *expr)
1105 {
1106 if (!is_array(expr))
1107 return;
1108 check_dereference(get_array_base(expr));
1109 }
1110
1111 static void find_dereferences(struct expression *expr)
1112 {
1113 while (expr->type == EXPR_PREOP) {
1114 if (expr->op == '*')
1115 check_dereference(expr->unop);
1116 expr = strip_expr(expr->unop);
1117 }
1118 }
1119
1120 static void set_param_dereferenced(struct expression *arg, char *key, char *unused)
1121 {
1122 struct symbol *sym;
1123 char *name;
1124
1125 name = get_variable_from_key(arg, key, &sym);
1126 if (name && sym)
1127 set_extra_nomod(name, sym, alloc_estate_range(valid_ptr_min_sval, valid_ptr_max_sval));
1128 free_string(name);
1129
1130 find_dereferences(arg);
1131 }
1132
1133 static sval_t add_one(sval_t sval)
1134 {
1135 sval.value++;
1136 return sval;
1137 }
1138
1139 static int handle_postop_inc(struct expression *left, int op, struct expression *right)
1140 {
1141 struct statement *stmt;
1142 struct expression *cond;
1143 struct smatch_state *true_state, *false_state;
1144 sval_t start;
1145 sval_t limit;
1146
1147 /*
1148 * If we're decrementing here then that's a canonical while count down
1149 * so it's handled already. We're only handling loops like:
1150 * i = 0;
1151 * do { ... } while (i++ < 3);
1152 */
1153
1154 if (left->type != EXPR_POSTOP || left->op != SPECIAL_INCREMENT)
1155 return 0;
1156
1157 stmt = __cur_stmt->parent;
1158 if (!stmt)
1159 return 0;
1160 if (stmt->type == STMT_COMPOUND)
1161 stmt = stmt->parent;
1162 if (!stmt || stmt->type != STMT_ITERATOR || !stmt->iterator_post_condition)
1163 return 0;
1164
1165 cond = strip_expr(stmt->iterator_post_condition);
1166 if (cond->type != EXPR_COMPARE || cond->op != op)
1167 return 0;
1168 if (left != strip_expr(cond->left) || right != strip_expr(cond->right))
1169 return 0;
1170
1171 if (!get_implied_value(left->unop, &start))
1172 return 0;
1173 if (!get_implied_value(right, &limit))
1174 return 0;
1175
1176 if (sval_cmp(start, limit) > 0)
1177 return 0;
1178
1179 switch (op) {
1180 case '<':
1181 case SPECIAL_UNSIGNED_LT:
1182 break;
1183 case SPECIAL_LTE:
1184 case SPECIAL_UNSIGNED_LTE:
1185 limit = add_one(limit);
1186 default:
1187 return 0;
1188
1189 }
1190
1191 true_state = alloc_estate_range(add_one(start), limit);
1192 false_state = alloc_estate_range(add_one(limit), add_one(limit));
1193
1194 /* Currently we just discard the false state but when two passes is
1195 * implimented correctly then it will use it.
1196 */
1197
1198 set_extra_expr_true_false(left->unop, true_state, false_state);
1199
1200 return 1;
1201 }
1202
1203 static void handle_comparison(struct symbol *type, struct expression *left, int op, struct expression *right)
1204 {
1205 struct range_list *left_orig;
1206 struct range_list *left_true;
1207 struct range_list *left_false;
1208 struct range_list *right_orig;
1209 struct range_list *right_true;
1210 struct range_list *right_false;
1211 struct smatch_state *left_true_state;
1212 struct smatch_state *left_false_state;
1213 struct smatch_state *right_true_state;
1214 struct smatch_state *right_false_state;
1215 sval_t dummy, hard_max;
1216 int left_postop = 0;
1217 int right_postop = 0;
1218
1219 if (left->op == SPECIAL_INCREMENT || left->op == SPECIAL_DECREMENT) {
1220 if (left->type == EXPR_POSTOP) {
1221 left->smatch_flags |= Handled;
1222 left_postop = left->op;
1223 if (handle_postop_inc(left, op, right))
1224 return;
1225 }
1226 left = strip_parens(left->unop);
1227 }
1228 while (left->type == EXPR_ASSIGNMENT)
1229 left = strip_parens(left->left);
1230
1231 if (right->op == SPECIAL_INCREMENT || right->op == SPECIAL_DECREMENT) {
1232 if (right->type == EXPR_POSTOP) {
1233 right->smatch_flags |= Handled;
1234 right_postop = right->op;
1235 }
1236 right = strip_parens(right->unop);
1237 }
1238
1239 get_real_absolute_rl(left, &left_orig);
1240 left_orig = cast_rl(type, left_orig);
1241
1242 get_real_absolute_rl(right, &right_orig);
1243 right_orig = cast_rl(type, right_orig);
1244
1245 split_comparison_rl(left_orig, op, right_orig, &left_true, &left_false, &right_true, &right_false);
1246
1247 left_true = rl_truncate_cast(get_type(strip_expr(left)), left_true);
1248 left_false = rl_truncate_cast(get_type(strip_expr(left)), left_false);
1249 right_true = rl_truncate_cast(get_type(strip_expr(right)), right_true);
1250 right_false = rl_truncate_cast(get_type(strip_expr(right)), right_false);
1251
1252 if (!left_true || !left_false) {
1253 struct range_list *tmp_true, *tmp_false;
1254
1255 split_comparison_rl(alloc_whole_rl(type), op, right_orig, &tmp_true, &tmp_false, NULL, NULL);
1256 tmp_true = rl_truncate_cast(get_type(strip_expr(left)), tmp_true);
1257 tmp_false = rl_truncate_cast(get_type(strip_expr(left)), tmp_false);
1258 if (tmp_true && tmp_false)
1259 __save_imaginary_state(left, tmp_true, tmp_false);
1260 }
1261
1262 if (!right_true || !right_false) {
1263 struct range_list *tmp_true, *tmp_false;
1264
1265 split_comparison_rl(alloc_whole_rl(type), op, right_orig, NULL, NULL, &tmp_true, &tmp_false);
1266 tmp_true = rl_truncate_cast(get_type(strip_expr(right)), tmp_true);
1267 tmp_false = rl_truncate_cast(get_type(strip_expr(right)), tmp_false);
1268 if (tmp_true && tmp_false)
1269 __save_imaginary_state(right, tmp_true, tmp_false);
1270 }
1271
1272 left_true_state = alloc_estate_rl(left_true);
1273 left_false_state = alloc_estate_rl(left_false);
1274 right_true_state = alloc_estate_rl(right_true);
1275 right_false_state = alloc_estate_rl(right_false);
1276
1277 switch (op) {
1278 case '<':
1279 case SPECIAL_UNSIGNED_LT:
1280 case SPECIAL_UNSIGNED_LTE:
1281 case SPECIAL_LTE:
1282 if (get_hard_max(right, &dummy))
1283 estate_set_hard_max(left_true_state);
1284 if (get_hard_max(left, &dummy))
1285 estate_set_hard_max(right_false_state);
1286 break;
1287 case '>':
1288 case SPECIAL_UNSIGNED_GT:
1289 case SPECIAL_UNSIGNED_GTE:
1290 case SPECIAL_GTE:
1291 if (get_hard_max(left, &dummy))
1292 estate_set_hard_max(right_true_state);
1293 if (get_hard_max(right, &dummy))
1294 estate_set_hard_max(left_false_state);
1295 break;
1296 }
1297
1298 switch (op) {
1299 case '<':
1300 case SPECIAL_UNSIGNED_LT:
1301 case SPECIAL_UNSIGNED_LTE:
1302 case SPECIAL_LTE:
1303 if (get_hard_max(right, &hard_max)) {
1304 if (op == '<' || op == SPECIAL_UNSIGNED_LT)
1305 hard_max.value--;
1306 estate_set_fuzzy_max(left_true_state, hard_max);
1307 }
1308 if (get_implied_value(right, &hard_max)) {
1309 if (op == SPECIAL_UNSIGNED_LTE ||
1310 op == SPECIAL_LTE)
1311 hard_max.value++;
1312 estate_set_fuzzy_max(left_false_state, hard_max);
1313 }
1314 if (get_hard_max(left, &hard_max)) {
1315 if (op == SPECIAL_UNSIGNED_LTE ||
1316 op == SPECIAL_LTE)
1317 hard_max.value--;
1318 estate_set_fuzzy_max(right_false_state, hard_max);
1319 }
1320 if (get_implied_value(left, &hard_max)) {
1321 if (op == '<' || op == SPECIAL_UNSIGNED_LT)
1322 hard_max.value++;
1323 estate_set_fuzzy_max(right_true_state, hard_max);
1324 }
1325 break;
1326 case '>':
1327 case SPECIAL_UNSIGNED_GT:
1328 case SPECIAL_UNSIGNED_GTE:
1329 case SPECIAL_GTE:
1330 if (get_hard_max(left, &hard_max)) {
1331 if (op == '>' || op == SPECIAL_UNSIGNED_GT)
1332 hard_max.value--;
1333 estate_set_fuzzy_max(right_true_state, hard_max);
1334 }
1335 if (get_implied_value(left, &hard_max)) {
1336 if (op == SPECIAL_UNSIGNED_GTE ||
1337 op == SPECIAL_GTE)
1338 hard_max.value++;
1339 estate_set_fuzzy_max(right_false_state, hard_max);
1340 }
1341 if (get_hard_max(right, &hard_max)) {
1342 if (op == SPECIAL_UNSIGNED_LTE ||
1343 op == SPECIAL_LTE)
1344 hard_max.value--;
1345 estate_set_fuzzy_max(left_false_state, hard_max);
1346 }
1347 if (get_implied_value(right, &hard_max)) {
1348 if (op == '>' ||
1349 op == SPECIAL_UNSIGNED_GT)
1350 hard_max.value++;
1351 estate_set_fuzzy_max(left_true_state, hard_max);
1352 }
1353 break;
1354 case SPECIAL_EQUAL:
1355 if (get_hard_max(left, &hard_max))
1356 estate_set_fuzzy_max(right_true_state, hard_max);
1357 if (get_hard_max(right, &hard_max))
1358 estate_set_fuzzy_max(left_true_state, hard_max);
1359 break;
1360 }
1361
1362 if (get_hard_max(left, &hard_max)) {
1363 estate_set_hard_max(left_true_state);
1364 estate_set_hard_max(left_false_state);
1365 }
1366 if (get_hard_max(right, &hard_max)) {
1367 estate_set_hard_max(right_true_state);
1368 estate_set_hard_max(right_false_state);
1369 }
1370
1371 if (left_postop == SPECIAL_INCREMENT) {
1372 left_true_state = increment_state(left_true_state);
1373 left_false_state = increment_state(left_false_state);
1374 }
1375 if (left_postop == SPECIAL_DECREMENT) {
1376 left_true_state = decrement_state(left_true_state);
1377 left_false_state = decrement_state(left_false_state);
1378 }
1379 if (right_postop == SPECIAL_INCREMENT) {
1380 right_true_state = increment_state(right_true_state);
1381 right_false_state = increment_state(right_false_state);
1382 }
1383 if (right_postop == SPECIAL_DECREMENT) {
1384 right_true_state = decrement_state(right_true_state);
1385 right_false_state = decrement_state(right_false_state);
1386 }
1387
1388 if (estate_rl(left_true_state) && estates_equiv(left_true_state, left_false_state)) {
1389 left_true_state = NULL;
1390 left_false_state = NULL;
1391 }
1392
1393 if (estate_rl(right_true_state) && estates_equiv(right_true_state, right_false_state)) {
1394 right_true_state = NULL;
1395 right_false_state = NULL;
1396 }
1397
1398 set_extra_expr_true_false(left, left_true_state, left_false_state);
1399 set_extra_expr_true_false(right, right_true_state, right_false_state);
1400 }
1401
1402 static int is_simple_math(struct expression *expr)
1403 {
1404 if (!expr)
1405 return 0;
1406 if (expr->type != EXPR_BINOP)
1407 return 0;
1408 switch (expr->op) {
1409 case '+':
1410 case '-':
1411 case '*':
1412 return 1;
1413 }
1414 return 0;
1415 }
1416
1417 static void move_known_values(struct expression **left_p, struct expression **right_p)
1418 {
1419 struct expression *left = *left_p;
1420 struct expression *right = *right_p;
1421 sval_t sval;
1422
1423 if (get_implied_value(left, &sval)) {
1424 if (!is_simple_math(right))
1425 return;
1426 if (right->op == '*') {
1427 sval_t divisor;
1428
1429 if (!get_value(right->right, &divisor))
1430 return;
1431 if (divisor.value == 0 && sval.value % divisor.value)
1432 return;
1433 *left_p = binop_expression(left, invert_op(right->op), right->right);
1434 *right_p = right->left;
1435 return;
1436 }
1437 if (right->op == '+' && get_value(right->left, &sval)) {
1438 *left_p = binop_expression(left, invert_op(right->op), right->left);
1439 *right_p = right->right;
1440 return;
1441 }
1442 if (get_value(right->right, &sval)) {
1443 *left_p = binop_expression(left, invert_op(right->op), right->right);
1444 *right_p = right->left;
1445 return;
1446 }
1447 return;
1448 }
1449 if (get_implied_value(right, &sval)) {
1450 if (!is_simple_math(left))
1451 return;
1452 if (left->op == '*') {
1453 sval_t divisor;
1454
1455 if (!get_value(left->right, &divisor))
1456 return;
1457 if (divisor.value == 0 && sval.value % divisor.value)
1458 return;
1459 *right_p = binop_expression(right, invert_op(left->op), left->right);
1460 *left_p = left->left;
1461 return;
1462 }
1463 if (left->op == '+' && get_value(left->left, &sval)) {
1464 *right_p = binop_expression(right, invert_op(left->op), left->left);
1465 *left_p = left->right;
1466 return;
1467 }
1468
1469 if (get_value(left->right, &sval)) {
1470 *right_p = binop_expression(right, invert_op(left->op), left->right);
1471 *left_p = left->left;
1472 return;
1473 }
1474 return;
1475 }
1476 }
1477
1478 static int match_func_comparison(struct expression *expr)
1479 {
1480 struct expression *left = strip_expr(expr->left);
1481 struct expression *right = strip_expr(expr->right);
1482 sval_t sval;
1483
1484 /*
1485 * fixme: think about this harder. We should always be trying to limit
1486 * the non-call side as well. If we can't determine the limitter does
1487 * that mean we aren't querying the database and are missing important
1488 * information?
1489 */
1490
1491 if (left->type == EXPR_CALL) {
1492 if (get_implied_value(left, &sval)) {
1493 handle_comparison(get_type(expr), left, expr->op, right);
1494 return 1;
1495 }
1496 function_comparison(left, expr->op, right);
1497 return 1;
1498 }
1499
1500 if (right->type == EXPR_CALL) {
1501 if (get_implied_value(right, &sval)) {
1502 handle_comparison(get_type(expr), left, expr->op, right);
1503 return 1;
1504 }
1505 function_comparison(left, expr->op, right);
1506 return 1;
1507 }
1508
1509 return 0;
1510 }
1511
1512 /* Handle conditions like "if (foo + bar < foo) {" */
1513 static int handle_integer_overflow_test(struct expression *expr)
1514 {
1515 struct expression *left, *right;
1516 struct symbol *type;
1517 sval_t left_min, right_min, min, max;
1518
1519 if (expr->op != '<' && expr->op != SPECIAL_UNSIGNED_LT)
1520 return 0;
1521
1522 left = strip_parens(expr->left);
1523 right = strip_parens(expr->right);
1524
1525 if (left->op != '+')
1526 return 0;
1527
1528 type = get_type(expr);
1529 if (!type)
1530 return 0;
1531 if (type_positive_bits(type) == 32) {
1532 max.type = &uint_ctype;
1533 max.uvalue = (unsigned int)-1;
1534 } else if (type_positive_bits(type) == 64) {
1535 max.type = &ulong_ctype;
1536 max.value = (unsigned long long)-1;
1537 } else {
1538 return 0;
1539 }
1540
1541 if (!expr_equiv(left->left, right) && !expr_equiv(left->right, right))
1542 return 0;
1543
1544 get_absolute_min(left->left, &left_min);
1545 get_absolute_min(left->right, &right_min);
1546 min = sval_binop(left_min, '+', right_min);
1547
1548 set_extra_chunk_true_false(left, NULL, alloc_estate_range(min, max));
1549 return 1;
1550 }
1551
1552 static void match_comparison(struct expression *expr)
1553 {
1554 struct expression *left_orig = strip_parens(expr->left);
1555 struct expression *right_orig = strip_parens(expr->right);
1556 struct expression *left, *right;
1557 struct expression *prev;
1558 struct symbol *type;
1559
1560 if (match_func_comparison(expr))
1561 return;
1562
1563 type = get_type(expr);
1564 if (!type)
1565 type = &llong_ctype;
1566
1567 if (handle_integer_overflow_test(expr))
1568 return;
1569
1570 left = left_orig;
1571 right = right_orig;
1572 move_known_values(&left, &right);
1573 handle_comparison(type, left, expr->op, right);
1574
1575 prev = get_assigned_expr(left_orig);
1576 if (is_simple_math(prev) && has_variable(prev, left_orig) == 0) {
1577 left = prev;
1578 right = right_orig;
1579 move_known_values(&left, &right);
1580 handle_comparison(type, left, expr->op, right);
1581 }
1582
1583 prev = get_assigned_expr(right_orig);
1584 if (is_simple_math(prev) && has_variable(prev, right_orig) == 0) {
1585 left = left_orig;
1586 right = prev;
1587 move_known_values(&left, &right);
1588 handle_comparison(type, left, expr->op, right);
1589 }
1590 }
1591
1592 static sval_t get_high_mask(sval_t known)
1593 {
1594 sval_t ret;
1595 int i;
1596
1597 ret = known;
1598 ret.value = 0;
1599
1600 for (i = type_bits(known.type) - 1; i >= 0; i--) {
1601 if (known.uvalue & (1ULL << i))
1602 ret.uvalue |= (1ULL << i);
1603 else
1604 return ret;
1605
1606 }
1607 return ret;
1608 }
1609
1610 static void handle_AND_condition(struct expression *expr)
1611 {
1612 struct range_list *orig_rl;
1613 struct range_list *true_rl = NULL;
1614 struct range_list *false_rl = NULL;
1615 sval_t known;
1616 int bit;
1617
1618 if (get_implied_value(expr->left, &known)) {
1619 sval_t low_mask = known;
1620 sval_t high_mask;
1621
1622 if (known.value > 0) {
1623 bit = ffsll(known.value) - 1;
1624 low_mask.uvalue = (1ULL << bit) - 1;
1625 get_absolute_rl(expr->right, &orig_rl);
1626 true_rl = remove_range(orig_rl, sval_type_val(known.type, 0), low_mask);
1627 }
1628 high_mask = get_high_mask(known);
1629 if (high_mask.value) {
1630 bit = ffsll(high_mask.value) - 1;
1631 low_mask.uvalue = (1ULL << bit) - 1;
1632
1633 get_absolute_rl(expr->left, &orig_rl);
1634 if (sval_is_negative(rl_min(orig_rl)))
1635 orig_rl = remove_range(orig_rl, sval_type_min(known.type), sval_type_val(known.type, -1));
1636 false_rl = remove_range(orig_rl, low_mask, sval_type_max(known.type));
1637 if (type_signed(high_mask.type) && type_unsigned(rl_type(false_rl))) {
1638 false_rl = remove_range(false_rl,
1639 sval_type_val(rl_type(false_rl), sval_type_max(known.type).uvalue),
1640 sval_type_val(rl_type(false_rl), -1));
1641 }
1642 }
1643 set_extra_expr_true_false(expr->right,
1644 true_rl ? alloc_estate_rl(true_rl) : NULL,
1645 false_rl ? alloc_estate_rl(false_rl) : NULL);
1646
1647 return;
1648 }
1649
1650 if (get_implied_value(expr->right, &known)) {
1651 sval_t low_mask = known;
1652 sval_t high_mask;
1653
1654 if (known.value > 0) {
1655 bit = ffsll(known.value) - 1;
1656 low_mask.uvalue = (1ULL << bit) - 1;
1657 get_absolute_rl(expr->left, &orig_rl);
1658 true_rl = remove_range(orig_rl, sval_type_val(known.type, 0), low_mask);
1659 }
1660 high_mask = get_high_mask(known);
1661 if (high_mask.value) {
1662 bit = ffsll(high_mask.value) - 1;
1663 low_mask.uvalue = (1ULL << bit) - 1;
1664
1665 get_absolute_rl(expr->left, &orig_rl);
1666 if (sval_is_negative(rl_min(orig_rl)))
1667 orig_rl = remove_range(orig_rl, sval_type_min(known.type), sval_type_val(known.type, -1));
1668 false_rl = remove_range(orig_rl, low_mask, sval_type_max(known.type));
1669 if (type_signed(high_mask.type) && type_unsigned(rl_type(false_rl))) {
1670 false_rl = remove_range(false_rl,
1671 sval_type_val(rl_type(false_rl), sval_type_max(known.type).uvalue),
1672 sval_type_val(rl_type(false_rl), -1));
1673 }
1674 }
1675 set_extra_expr_true_false(expr->left,
1676 true_rl ? alloc_estate_rl(true_rl) : NULL,
1677 false_rl ? alloc_estate_rl(false_rl) : NULL);
1678 return;
1679 }
1680 }
1681
1682 /* this is actually hooked from smatch_implied.c... it's hacky, yes */
1683 void __extra_match_condition(struct expression *expr)
1684 {
1685 struct smatch_state *pre_state;
1686 struct smatch_state *true_state;
1687 struct smatch_state *false_state;
1688
1689 expr = strip_expr(expr);
1690 switch (expr->type) {
1691 case EXPR_CALL:
1692 function_comparison(expr, SPECIAL_NOTEQUAL, zero_expr());
1693 return;
1694 case EXPR_PREOP:
1695 case EXPR_SYMBOL:
1696 case EXPR_DEREF: {
1697 sval_t zero;
1698
1699 zero = sval_blank(expr);
1700 zero.value = 0;
1701
1702 pre_state = get_extra_state(expr);
1703 true_state = estate_filter_sval(pre_state, zero);
1704 if (possibly_true(expr, SPECIAL_EQUAL, zero_expr()))
1705 false_state = alloc_estate_sval(zero);
1706 else
1707 false_state = alloc_estate_empty();
1708 set_extra_expr_true_false(expr, true_state, false_state);
1709 return;
1710 }
1711 case EXPR_COMPARE:
1712 match_comparison(expr);
1713 return;
1714 case EXPR_ASSIGNMENT:
1715 __extra_match_condition(expr->left);
1716 return;
1717 case EXPR_BINOP:
1718 if (expr->op == '&')
1719 handle_AND_condition(expr);
1720 return;
1721 }
1722 }
1723
1724 static void assume_indexes_are_valid(struct expression *expr)
1725 {
1726 struct expression *array_expr;
1727 int array_size;
1728 struct expression *offset;
1729 struct symbol *offset_type;
1730 struct range_list *rl_before;
1731 struct range_list *rl_after;
1732 struct range_list *filter = NULL;
1733 sval_t size;
1734
1735 expr = strip_expr(expr);
1736 if (!is_array(expr))
1737 return;
1738
1739 offset = get_array_offset(expr);
1740 offset_type = get_type(offset);
1741 if (offset_type && type_signed(offset_type)) {
1742 filter = alloc_rl(sval_type_min(offset_type),
1743 sval_type_val(offset_type, -1));
1744 }
1745
1746 array_expr = get_array_base(expr);
1747 array_size = get_real_array_size(array_expr);
1748 if (array_size > 1) {
1749 size = sval_type_val(offset_type, array_size);
1750 add_range(&filter, size, sval_type_max(offset_type));
1751 }
1752
1753 if (!filter)
1754 return;
1755 get_absolute_rl(offset, &rl_before);
1756 rl_after = rl_filter(rl_before, filter);
1757 if (rl_equiv(rl_before, rl_after))
1758 return;
1759 set_extra_expr_nomod(offset, alloc_estate_rl(rl_after));
1760 }
1761
1762 /* returns 1 if it is not possible for expr to be value, otherwise returns 0 */
1763 int implied_not_equal(struct expression *expr, long long val)
1764 {
1765 return !possibly_false(expr, SPECIAL_NOTEQUAL, value_expr(val));
1766 }
1767
1768 int implied_not_equal_name_sym(char *name, struct symbol *sym, long long val)
1769 {
1770 struct smatch_state *estate;
1771
1772 estate = get_state(SMATCH_EXTRA, name, sym);
1773 if (!estate)
1774 return 0;
1775 if (!rl_has_sval(estate_rl(estate), sval_type_val(estate_type(estate), 0)))
1776 return 1;
1777 return 0;
1778 }
1779
1780 int parent_is_null_var_sym(const char *name, struct symbol *sym)
1781 {
1782 char buf[256];
1783 char *start;
1784 char *end;
1785 struct smatch_state *state;
1786
1787 strncpy(buf, name, sizeof(buf) - 1);
1788 buf[sizeof(buf) - 1] = '\0';
1789
1790 start = &buf[0];
1791 while (*start == '*') {
1792 start++;
1793 state = get_state(SMATCH_EXTRA, start, sym);
1794 if (!state)
1795 continue;
1796 if (!estate_rl(state))
1797 return 1;
1798 if (estate_min(state).value == 0 &&
1799 estate_max(state).value == 0)
1800 return 1;
1801 }
1802
1803 start = &buf[0];
1804 while (*start == '&')
1805 start++;
1806
1807 while ((end = strrchr(start, '-'))) {
1808 *end = '\0';
1809 state = get_state(SMATCH_EXTRA, start, sym);
1810 if (!state)
1811 continue;
1812 if (estate_min(state).value == 0 &&
1813 estate_max(state).value == 0)
1814 return 1;
1815 }
1816 return 0;
1817 }
1818
1819 int parent_is_null(struct expression *expr)
1820 {
1821 struct symbol *sym;
1822 char *var;
1823 int ret = 0;
1824
1825 expr = strip_expr(expr);
1826 var = expr_to_var_sym(expr, &sym);
1827 if (!var || !sym)
1828 goto free;
1829 ret = parent_is_null_var_sym(var, sym);
1830 free:
1831 free_string(var);
1832 return ret;
1833 }
1834
1835 static int param_used_callback(void *found, int argc, char **argv, char **azColName)
1836 {
1837 *(int *)found = 1;
1838 return 0;
1839 }
1840
1841 static int filter_unused_kzalloc_info(struct expression *call, int param, char *printed_name, struct sm_state *sm)
1842 {
1843 sval_t sval;
1844 int found = 0;
1845
1846 /* for function pointers assume everything is used */
1847 if (call->fn->type != EXPR_SYMBOL)
1848 return 0;
1849
1850 /*
1851 * kzalloc() information is treated as special because so there is just
1852 * a lot of stuff initialized to zero and it makes building the database
1853 * take hours and hours.
1854 *
1855 * In theory, we should just remove this line and not pass any unused
1856 * information, but I'm not sure enough that this code works so I want
1857 * to hold off on that for now.
1858 */
1859 if (!estate_get_single_value(sm->state, &sval) || sval.value != 0)
1860 return 0;
1861
1862 run_sql(&param_used_callback, &found,
1863 "select * from call_implies where %s and type = %d and parameter = %d and key = '%s';",
1864 get_static_filter(call->fn->symbol), PARAM_USED, param, printed_name);
1865 if (found)
1866 return 0;
1867
1868 /* If the database is not built yet, then assume everything is used */
1869 run_sql(&param_used_callback, &found,
1870 "select * from call_implies where %s and type = %d;",
1871 get_static_filter(call->fn->symbol), PARAM_USED);
1872 if (!found)
1873 return 0;
1874
1875 return 1;
1876 }
1877
1878 static void struct_member_callback(struct expression *call, int param, char *printed_name, struct sm_state *sm)
1879 {
1880 if (estate_is_whole(sm->state))
1881 return;
1882 if (filter_unused_kzalloc_info(call, param, printed_name, sm))
1883 return;
1884 sql_insert_caller_info(call, PARAM_VALUE, param, printed_name, sm->state->name);
1885 if (estate_has_fuzzy_max(sm->state))
1886 sql_insert_caller_info(call, FUZZY_MAX, param, printed_name,
1887 sval_to_str(estate_get_fuzzy_max(sm->state)));
1888 }
1889
1890 static void returned_struct_members(int return_id, char *return_ranges, struct expression *expr)
1891 {
1892 struct symbol *returned_sym;
1893 struct sm_state *sm;
1894 const char *param_name;
1895 char *compare_str;
1896 char buf[256];
1897
1898 returned_sym = expr_to_sym(expr);
1899 if (!returned_sym)
1900 return;
1901
1902 FOR_EACH_MY_SM(my_id, __get_cur_stree(), sm) {
1903 if (!estate_rl(sm->state))
1904 continue;
1905 if (returned_sym != sm->sym)
1906 continue;
1907
1908 param_name = get_param_name(sm);
1909 if (!param_name)
1910 continue;
1911 if (strcmp(param_name, "$") == 0)
1912 continue;
1913 compare_str = name_sym_to_param_comparison(sm->name, sm->sym);
1914 if (!compare_str && estate_is_whole(sm->state))
1915 continue;
1916 snprintf(buf, sizeof(buf), "%s%s", sm->state->name, compare_str ?: "");
1917
1918 sql_insert_return_states(return_id, return_ranges, PARAM_VALUE,
1919 -1, param_name, buf);
1920 } END_FOR_EACH_SM(sm);
1921 }
1922
1923 static void db_limited_before(void)
1924 {
1925 unmatched_stree = clone_stree(__get_cur_stree());
1926 }
1927
1928 static void db_limited_after(void)
1929 {
1930 free_stree(&unmatched_stree);
1931 }
1932
1933 static int rl_fits_in_type(struct range_list *rl, struct symbol *type)
1934 {
1935 if (type_bits(rl_type(rl)) <= type_bits(type))
1936 return 1;
1937 if (sval_cmp(rl_max(rl), sval_type_max(type)) > 0)
1938 return 0;
1939 if (sval_is_negative(rl_min(rl)) &&
1940 sval_cmp(rl_min(rl), sval_type_min(type)) < 0)
1941 return 0;
1942 return 1;
1943 }
1944
1945 static void db_param_limit_filter(struct expression *expr, int param, char *key, char *value, enum info_type op)
1946 {
1947 struct expression *arg;
1948 char *name;
1949 struct symbol *sym;
1950 struct var_sym_list *vsl = NULL;
1951 struct sm_state *sm;
1952 struct symbol *compare_type, *var_type;
1953 struct range_list *rl;
1954 struct range_list *limit;
1955 struct range_list *new;
1956
1957 while (expr->type == EXPR_ASSIGNMENT)
1958 expr = strip_expr(expr->right);
1959 if (expr->type != EXPR_CALL)
1960 return;
1961
1962 arg = get_argument_from_call_expr(expr->args, param);
1963 if (!arg)
1964 return;
1965
1966 name = get_chunk_from_key(arg, key, &sym, &vsl);
1967 if (!name)
1968 return;
1969 if (op != PARAM_LIMIT && !sym)
1970 goto free;
1971
1972 if (strcmp(key, "$") == 0)
1973 compare_type = get_arg_type(expr->fn, param);
1974 else
1975 compare_type = get_member_type_from_key(arg, key);
1976
1977 sm = get_sm_state(SMATCH_EXTRA, name, sym);
1978 if (sm)
1979 rl = estate_rl(sm->state);
1980 else
1981 rl = alloc_whole_rl(compare_type);
1982
1983 if (op == PARAM_LIMIT && !rl_fits_in_type(rl, compare_type))
1984 goto free;
1985
1986 call_results_to_rl(expr, compare_type, value, &limit);
1987 new = rl_intersection(rl, limit);
1988
1989 var_type = get_member_type_from_key(arg, key);
1990 new = cast_rl(var_type, new);
1991
1992 /* We want to preserve the implications here */
1993 if (sm && rl_equiv(estate_rl(sm->state), new))
1994 __set_sm(sm);
1995 else {
1996 if (op == PARAM_LIMIT)
1997 set_extra_nomod_vsl(name, sym, vsl, alloc_estate_rl(new));
1998 else
1999 set_extra_mod(name, sym, alloc_estate_rl(new));
2000 }
2001
2002 free:
2003 free_string(name);
2004 }
2005
2006 static void db_param_limit(struct expression *expr, int param, char *key, char *value)
2007 {
2008 db_param_limit_filter(expr, param, key, value, PARAM_LIMIT);
2009 }
2010
2011 static void db_param_filter(struct expression *expr, int param, char *key, char *value)
2012 {
2013 db_param_limit_filter(expr, param, key, value, PARAM_FILTER);
2014 }
2015
2016 static void db_param_add_set(struct expression *expr, int param, char *key, char *value, enum info_type op)
2017 {
2018 struct expression *arg;
2019 char *name;
2020 struct symbol *sym;
2021 struct symbol *type;
2022 struct smatch_state *state;
2023 struct range_list *new = NULL;
2024 struct range_list *added = NULL;
2025
2026 while (expr->type == EXPR_ASSIGNMENT)
2027 expr = strip_expr(expr->right);
2028 if (expr->type != EXPR_CALL)
2029 return;
2030
2031 arg = get_argument_from_call_expr(expr->args, param);
2032 if (!arg)
2033 return;
2034 type = get_member_type_from_key(arg, key);
2035 name = get_variable_from_key(arg, key, &sym);
2036 if (!name || !sym)
2037 goto free;
2038
2039 state = get_state(SMATCH_EXTRA, name, sym);
2040 if (state)
2041 new = estate_rl(state);
2042
2043 call_results_to_rl(expr, type, value, &added);
2044
2045 if (op == PARAM_SET)
2046 new = added;
2047 else
2048 new = rl_union(new, added);
2049
2050 set_extra_mod(name, sym, alloc_estate_rl(new));
2051 free:
2052 free_string(name);
2053 }
2054
2055 static void db_param_add(struct expression *expr, int param, char *key, char *value)
2056 {
2057 db_param_add_set(expr, param, key, value, PARAM_ADD);
2058 }
2059
2060 static void db_param_set(struct expression *expr, int param, char *key, char *value)
2061 {
2062 db_param_add_set(expr, param, key, value, PARAM_SET);
2063 }
2064
2065 static void db_param_value(struct expression *expr, int param, char *key, char *value)
2066 {
2067 struct expression *call;
2068 char *name;
2069 struct symbol *sym;
2070 struct symbol *type;
2071 struct range_list *rl = NULL;
2072
2073 if (param != -1)
2074 return;
2075
2076 call = expr;
2077 while (call->type == EXPR_ASSIGNMENT)
2078 call = strip_expr(call->right);
2079 if (call->type != EXPR_CALL)
2080 return;
2081
2082 type = get_member_type_from_key(expr->left, key);
2083 name = get_variable_from_key(expr->left, key, &sym);
2084 if (!name || !sym)
2085 goto free;
2086
2087 call_results_to_rl(call, type, value, &rl);
2088
2089 set_extra_mod(name, sym, alloc_estate_rl(rl));
2090 free:
2091 free_string(name);
2092 }
2093
2094 static void match_call_info(struct expression *expr)
2095 {
2096 struct smatch_state *state;
2097 struct range_list *rl = NULL;
2098 struct expression *arg;
2099 struct symbol *type;
2100 int i = 0;
2101
2102 FOR_EACH_PTR(expr->args, arg) {
2103 type = get_arg_type(expr->fn, i);
2104
2105 if (get_implied_rl(arg, &rl))
2106 rl = cast_rl(type, rl);
2107 else
2108 rl = cast_rl(type, alloc_whole_rl(get_type(arg)));
2109
2110 if (!is_whole_rl(rl))
2111 sql_insert_caller_info(expr, PARAM_VALUE, i, "$", show_rl(rl));
2112 state = get_state_expr(SMATCH_EXTRA, arg);
2113 if (estate_has_fuzzy_max(state)) {
2114 sql_insert_caller_info(expr, FUZZY_MAX, i, "$",
2115 sval_to_str(estate_get_fuzzy_max(state)));
2116 }
2117 i++;
2118 } END_FOR_EACH_PTR(arg);
2119 }
2120
2121 static void set_param_value(const char *name, struct symbol *sym, char *key, char *value)
2122 {
2123 struct range_list *rl = NULL;
2124 struct smatch_state *state;
2125 struct symbol *type;
2126 char fullname[256];
2127
2128 if (strcmp(key, "*$") == 0)
2129 snprintf(fullname, sizeof(fullname), "*%s", name);
2130 else if (strncmp(key, "$", 1) == 0)
2131 snprintf(fullname, 256, "%s%s", name, key + 1);
2132 else
2133 return;
2134
2135 type = get_member_type_from_key(symbol_expression(sym), key);
2136 str_to_rl(type, value, &rl);
2137 state = alloc_estate_rl(rl);
2138 set_state(SMATCH_EXTRA, fullname, sym, state);
2139 }
2140
2141 static void set_param_hard_max(const char *name, struct symbol *sym, char *key, char *value)
2142 {
2143 struct range_list *rl = NULL;
2144 struct smatch_state *state;
2145 struct symbol *type;
2146 char fullname[256];
2147 sval_t max;
2148
2149 if (strcmp(key, "*$") == 0)
2150 snprintf(fullname, sizeof(fullname), "*%s", name);
2151 else if (strncmp(key, "$", 1) == 0)
2152 snprintf(fullname, 256, "%s%s", name, key + 1);
2153 else
2154 return;
2155
2156 state = get_state(SMATCH_EXTRA, fullname, sym);
2157 if (!state)
2158 return;
2159 type = get_member_type_from_key(symbol_expression(sym), key);
2160 str_to_rl(type, value, &rl);
2161 if (!rl_to_sval(rl, &max))
2162 return;
2163 estate_set_fuzzy_max(state, max);
2164 }
2165
2166 struct smatch_state *get_extra_state(struct expression *expr)
2167 {
2168 char *name;
2169 struct symbol *sym;
2170 struct smatch_state *ret = NULL;
2171 struct range_list *rl;
2172
2173 if (is_pointer(expr) && get_address_rl(expr, &rl))
2174 return alloc_estate_rl(rl);
2175
2176 name = expr_to_known_chunk_sym(expr, &sym);
2177 if (!name)
2178 goto free;
2179
2180 ret = get_state(SMATCH_EXTRA, name, sym);
2181 free:
2182 free_string(name);
2183 return ret;
2184 }
2185
2186 void register_smatch_extra(int id)
2187 {
2188 my_id = id;
2189
2190 add_merge_hook(my_id, &merge_estates);
2191 add_unmatched_state_hook(my_id, &unmatched_state);
2192 select_caller_info_hook(set_param_value, PARAM_VALUE);
2193 select_caller_info_hook(set_param_hard_max, FUZZY_MAX);
2194 select_return_states_before(&db_limited_before);
2195 select_return_states_hook(PARAM_LIMIT, &db_param_limit);
2196 select_return_states_hook(PARAM_FILTER, &db_param_filter);
2197 select_return_states_hook(PARAM_ADD, &db_param_add);
2198 select_return_states_hook(PARAM_SET, &db_param_set);
2199 select_return_states_hook(PARAM_VALUE, &db_param_value);
2200 select_return_states_after(&db_limited_after);
2201 }
2202
2203 static void match_link_modify(struct sm_state *sm, struct expression *mod_expr)
2204 {
2205 struct var_sym_list *links;
2206 struct var_sym *tmp;
2207 struct smatch_state *state;
2208
2209 links = sm->state->data;
2210
2211 FOR_EACH_PTR(links, tmp) {
2212 if (sm->sym == tmp->sym &&
2213 strcmp(sm->name, tmp->var) == 0)
2214 continue;
2215 state = get_state(SMATCH_EXTRA, tmp->var, tmp->sym);
2216 if (!state)
2217 continue;
2218 set_state(SMATCH_EXTRA, tmp->var, tmp->sym, alloc_estate_whole(estate_type(state)));
2219 } END_FOR_EACH_PTR(tmp);
2220 set_state(link_id, sm->name, sm->sym, &undefined);
2221 }
2222
2223 void register_smatch_extra_links(int id)
2224 {
2225 link_id = id;
2226 }
2227
2228 void register_smatch_extra_late(int id)
2229 {
2230 add_merge_hook(link_id, &merge_link_states);
2231 add_modification_hook(link_id, &match_link_modify);
2232 add_hook(&match_dereferences, DEREF_HOOK);
2233 add_hook(&match_pointer_as_array, OP_HOOK);
2234 select_call_implies_hook(DEREFERENCE, &set_param_dereferenced);
2235 add_hook(&match_function_call, FUNCTION_CALL_HOOK);
2236 add_hook(&match_assign, ASSIGNMENT_HOOK);
2237 add_hook(&match_assign, GLOBAL_ASSIGNMENT_HOOK);
2238 add_hook(&unop_expr, OP_HOOK);
2239 add_hook(&asm_expr, ASM_HOOK);
2240 add_untracked_param_hook(&match_untracked_array);
2241
2242 add_hook(&match_call_info, FUNCTION_CALL_HOOK);
2243 add_member_info_callback(my_id, struct_member_callback);
2244 add_split_return_callback(&returned_struct_members);
2245
2246 add_hook(&assume_indexes_are_valid, OP_HOOK);
2247 }
Static analysis for C