?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
scope: fix is_outer_stmt()
[smatch.git] / smatch_flow.c
blob67f957894085c02c00630fa3dd8614adf06c6645
1 /*
2 * Copyright (C) 2006,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 #define _GNU_SOURCE 1
19 #include <unistd.h>
20 #include <stdio.h>
21 #include "token.h"
22 #include "scope.h"
23 #include "smatch.h"
24 #include "smatch_expression_stacks.h"
25 #include "smatch_extra.h"
26 #include "smatch_slist.h"
27
28 int __in_fake_assign;
29 int __in_fake_struct_assign;
30 int in_fake_env;
31 int final_pass;
32 int __inline_call;
33 struct expression *__inline_fn;
34
35 static int __smatch_lineno = 0;
36
37 static char *base_file;
38 static const char *filename;
39 static char *pathname;
40 static char *full_filename;
41 static char *full_base_file;
42 static char *cur_func;
43 static unsigned int loop_count;
44 static int last_goto_statement_handled;
45 int __expr_stmt_count;
46 int __in_function_def;
47 static struct expression_list *switch_expr_stack = NULL;
48 static struct expression_list *post_op_stack = NULL;
49
50 static struct ptr_list *backup;
51
52 struct expression_list *big_expression_stack;
53 struct statement_list *big_statement_stack;
54 struct statement *__prev_stmt;
55 struct statement *__cur_stmt;
56 struct statement *__next_stmt;
57 int __in_pre_condition = 0;
58 int __bail_on_rest_of_function = 0;
59 static struct timeval fn_start_time;
60 static struct timeval outer_fn_start_time;
61 char *get_function(void) { return cur_func; }
62 int get_lineno(void) { return __smatch_lineno; }
63 int inside_loop(void) { return !!loop_count; }
64 int definitely_inside_loop(void) { return !!(loop_count & ~0x08000000); }
65 struct expression *get_switch_expr(void) { return top_expression(switch_expr_stack); }
66 int in_expression_statement(void) { return !!__expr_stmt_count; }
67
68 static void split_symlist(struct symbol_list *sym_list);
69 static void split_declaration(struct symbol_list *sym_list);
70 static void split_expr_list(struct expression_list *expr_list, struct expression *parent);
71 static void add_inline_function(struct symbol *sym);
72 static void parse_inline(struct expression *expr);
73
74 int option_assume_loops = 0;
75 int option_two_passes = 0;
76 struct symbol *cur_func_sym = NULL;
77 struct stree *global_states;
78
79 long long valid_ptr_min = 4096;
80 long long valid_ptr_max = 2117777777;
81 sval_t valid_ptr_min_sval = {
82 .type = &ptr_ctype,
83 {.value = 4096},
84 };
85 sval_t valid_ptr_max_sval = {
86 .type = &ptr_ctype,
87 {.value = LONG_MAX - 100000},
88 };
89 struct range_list *valid_ptr_rl;
90
91 static void set_valid_ptr_max(void)
92 {
93 if (type_bits(&ptr_ctype) == 32)
94 valid_ptr_max = 2117777777;
95 else if (type_bits(&ptr_ctype) == 64)
96 valid_ptr_max = 2117777777777777777LL;
97
98 valid_ptr_max_sval.value = valid_ptr_max;
99 }
100
101 static void alloc_valid_ptr_rl(void)
102 {
103 valid_ptr_rl = alloc_rl(valid_ptr_min_sval, valid_ptr_max_sval);
104 valid_ptr_rl = cast_rl(&ptr_ctype, valid_ptr_rl);
105 valid_ptr_rl = clone_rl_permanent(valid_ptr_rl);
106 }
107
108 int outside_of_function(void)
109 {
110 return cur_func_sym == NULL;
111 }
112
113 const char *get_filename(void)
114 {
115 if (option_info && option_full_path)
116 return full_base_file;
117 if (option_info)
118 return base_file;
119 if (option_full_path)
120 return full_filename;
121 return filename;
122 }
123
124 const char *get_base_file(void)
125 {
126 if (option_full_path)
127 return full_base_file;
128 return base_file;
129 }
130
131 static void set_position(struct position pos)
132 {
133 int len;
134 static int prev_stream = -1;
135
136 if (in_fake_env)
137 return;
138
139 if (pos.stream == 0 && pos.line == 0)
140 return;
141
142 __smatch_lineno = pos.line;
143
144 if (pos.stream == prev_stream)
145 return;
146
147 filename = stream_name(pos.stream);
148
149 free(full_filename);
150 pathname = getcwd(NULL, 0);
151 if (pathname) {
152 len = strlen(pathname) + 1 + strlen(filename) + 1;
153 full_filename = malloc(len);
154 snprintf(full_filename, len, "%s/%s", pathname, filename);
155 } else {
156 full_filename = alloc_string(filename);
157 }
158 free(pathname);
159 }
160
161 int is_assigned_call(struct expression *expr)
162 {
163 struct expression *parent = expr_get_parent_expr(expr);
164
165 if (parent &&
166 parent->type == EXPR_ASSIGNMENT &&
167 parent->op == '=' &&
168 strip_expr(parent->right) == expr)
169 return 1;
170
171 return 0;
172 }
173
174 static int is_inline_func(struct expression *expr)
175 {
176 if (expr->type != EXPR_SYMBOL || !expr->symbol)
177 return 0;
178 if (expr->symbol->ctype.modifiers & MOD_INLINE)
179 return 1;
180 return 0;
181 }
182
183 static int is_noreturn_func(struct expression *expr)
184 {
185 if (expr->type != EXPR_SYMBOL || !expr->symbol)
186 return 0;
187 if (expr->symbol->ctype.modifiers & MOD_NORETURN)
188 return 1;
189 return 0;
190 }
191
192 static int inline_budget = 20;
193
194 int inlinable(struct expression *expr)
195 {
196 struct symbol *sym;
197 struct statement *last_stmt = NULL;
198
199 if (__inline_fn) /* don't nest */
200 return 0;
201
202 if (expr->type != EXPR_SYMBOL || !expr->symbol)
203 return 0;
204 if (is_no_inline_function(expr->symbol->ident->name))
205 return 0;
206 sym = get_base_type(expr->symbol);
207 if (sym->stmt && sym->stmt->type == STMT_COMPOUND) {
208 if (ptr_list_size((struct ptr_list *)sym->stmt->stmts) > 10)
209 return 0;
210 if (sym->stmt->type != STMT_COMPOUND)
211 return 0;
212 last_stmt = last_ptr_list((struct ptr_list *)sym->stmt->stmts);
213 }
214 if (sym->inline_stmt && sym->inline_stmt->type == STMT_COMPOUND) {
215 if (ptr_list_size((struct ptr_list *)sym->inline_stmt->stmts) > 10)
216 return 0;
217 if (sym->inline_stmt->type != STMT_COMPOUND)
218 return 0;
219 last_stmt = last_ptr_list((struct ptr_list *)sym->inline_stmt->stmts);
220 }
221
222 if (!last_stmt)
223 return 0;
224
225 /* the magic numbers in this function are pulled out of my bum. */
226 if (last_stmt->pos.line > sym->pos.line + inline_budget)
227 return 0;
228
229 return 1;
230 }
231
232 void __process_post_op_stack(void)
233 {
234 struct expression *expr;
235
236 FOR_EACH_PTR(post_op_stack, expr) {
237 __pass_to_client(expr, OP_HOOK);
238 } END_FOR_EACH_PTR(expr);
239
240 __free_ptr_list((struct ptr_list **)&post_op_stack);
241 }
242
243 static int handle_comma_assigns(struct expression *expr)
244 {
245 struct expression *right;
246 struct expression *assign;
247
248 right = strip_expr(expr->right);
249 if (right->type != EXPR_COMMA)
250 return 0;
251
252 __split_expr(right->left);
253 __process_post_op_stack();
254
255 assign = assign_expression(expr->left, '=', right->right);
256 __split_expr(assign);
257
258 return 1;
259 }
260
261 /* This is to handle *p++ = foo; assignments */
262 static int handle_postop_assigns(struct expression *expr)
263 {
264 struct expression *left, *fake_left;
265 struct expression *assign;
266
267 left = strip_expr(expr->left);
268 if (left->type != EXPR_PREOP || left->op != '*')
269 return 0;
270 left = strip_expr(left->unop);
271 if (left->type != EXPR_POSTOP)
272 return 0;
273
274 fake_left = deref_expression(strip_expr(left->unop));
275 assign = assign_expression(fake_left, '=', expr->right);
276
277 __split_expr(assign);
278 __split_expr(expr->left);
279
280 return 1;
281 }
282
283 static int prev_expression_is_getting_address(struct expression *expr)
284 {
285 struct expression *parent;
286
287 do {
288 parent = expr_get_parent_expr(expr);
289
290 if (!parent)
291 return 0;
292 if (parent->type == EXPR_PREOP && parent->op == '&')
293 return 1;
294 if (parent->type == EXPR_PREOP && parent->op == '(')
295 goto next;
296 if (parent->type == EXPR_DEREF && parent->op == '.')
297 goto next;
298
299 return 0;
300 next:
301 expr = parent;
302 } while (1);
303 }
304
305 static void handle_builtin_overflow_func(struct expression *expr)
306 {
307 struct expression *a, *b, *res, *assign;
308 int op;
309
310 if (sym_name_is("__builtin_add_overflow", expr->fn))
311 op = '+';
312 else if (sym_name_is("__builtin_sub_overflow", expr->fn))
313 op = '-';
314 else if (sym_name_is("__builtin_mul_overflow", expr->fn))
315 op = '*';
316 else
317 return;
318
319 a = get_argument_from_call_expr(expr->args, 0);
320 b = get_argument_from_call_expr(expr->args, 1);
321 res = get_argument_from_call_expr(expr->args, 2);
322
323 assign = assign_expression(deref_expression(res), '=', binop_expression(a, op, b));
324 __split_expr(assign);
325 }
326
327 static int handle__builtin_choose_expr(struct expression *expr)
328 {
329 struct expression *const_expr, *expr1, *expr2;
330 sval_t sval;
331
332 if (!sym_name_is("__builtin_choose_expr", expr->fn))
333 return 0;
334
335 const_expr = get_argument_from_call_expr(expr->args, 0);
336 expr1 = get_argument_from_call_expr(expr->args, 1);
337 expr2 = get_argument_from_call_expr(expr->args, 2);
338
339 if (!get_value(const_expr, &sval) || !expr1 || !expr2)
340 return 0;
341 if (sval.value)
342 __split_expr(expr1);
343 else
344 __split_expr(expr2);
345 return 1;
346 }
347
348 static int handle__builtin_choose_expr_assigns(struct expression *expr)
349 {
350 struct expression *const_expr, *right, *expr1, *expr2, *fake;
351 sval_t sval;
352
353 right = strip_expr(expr->right);
354 if (right->type != EXPR_CALL)
355 return 0;
356 if (!sym_name_is("__builtin_choose_expr", right->fn))
357 return 0;
358
359 const_expr = get_argument_from_call_expr(right->args, 0);
360 expr1 = get_argument_from_call_expr(right->args, 1);
361 expr2 = get_argument_from_call_expr(right->args, 2);
362
363 if (!get_value(const_expr, &sval) || !expr1 || !expr2)
364 return 0;
365
366 fake = assign_expression(expr->left, '=', sval.value ? expr1 : expr2);
367 __split_expr(fake);
368 return 1;
369 }
370
371 void __split_expr(struct expression *expr)
372 {
373 if (!expr)
374 return;
375
376 // sm_msg(" Debug expr_type %d %s", expr->type, show_special(expr->op));
377
378 if (__in_fake_assign && expr->type != EXPR_ASSIGNMENT)
379 return;
380 if (__in_fake_assign >= 4) /* don't allow too much nesting */
381 return;
382
383 push_expression(&big_expression_stack, expr);
384 set_position(expr->pos);
385 __pass_to_client(expr, EXPR_HOOK);
386
387 switch (expr->type) {
388 case EXPR_PREOP:
389 expr_set_parent_expr(expr->unop, expr);
390
391 if (expr->op == '*' &&
392 !prev_expression_is_getting_address(expr))
393 __pass_to_client(expr, DEREF_HOOK);
394 __split_expr(expr->unop);
395 __pass_to_client(expr, OP_HOOK);
396 break;
397 case EXPR_POSTOP:
398 expr_set_parent_expr(expr->unop, expr);
399
400 __split_expr(expr->unop);
401 push_expression(&post_op_stack, expr);
402 break;
403 case EXPR_STATEMENT:
404 __expr_stmt_count++;
405 if (expr->statement && !expr->statement) {
406 stmt_set_parent_stmt(expr->statement,
407 last_ptr_list((struct ptr_list *)big_statement_stack));
408 }
409 __split_stmt(expr->statement);
410 __expr_stmt_count--;
411 break;
412 case EXPR_LOGICAL:
413 case EXPR_COMPARE:
414 expr_set_parent_expr(expr->left, expr);
415 expr_set_parent_expr(expr->right, expr);
416
417 __pass_to_client(expr, LOGIC_HOOK);
418 __handle_logic(expr);
419 break;
420 case EXPR_BINOP:
421 expr_set_parent_expr(expr->left, expr);
422 expr_set_parent_expr(expr->right, expr);
423
424 __pass_to_client(expr, BINOP_HOOK);
425 case EXPR_COMMA:
426 expr_set_parent_expr(expr->left, expr);
427 expr_set_parent_expr(expr->right, expr);
428
429 __split_expr(expr->left);
430 __process_post_op_stack();
431 __split_expr(expr->right);
432 break;
433 case EXPR_ASSIGNMENT: {
434 struct expression *right;
435
436 expr_set_parent_expr(expr->left, expr);
437 expr_set_parent_expr(expr->right, expr);
438
439 right = strip_expr(expr->right);
440 if (!right)
441 break;
442
443 __pass_to_client(expr, RAW_ASSIGNMENT_HOOK);
444
445 /* foo = !bar() */
446 if (__handle_condition_assigns(expr))
447 break;
448 /* foo = (x < 5 ? foo : 5); */
449 if (__handle_select_assigns(expr))
450 break;
451 /* foo = ({frob(); frob(); frob(); 1;}) */
452 if (__handle_expr_statement_assigns(expr))
453 break;
454 /* foo = (3, 4); */
455 if (handle_comma_assigns(expr))
456 break;
457 if (handle_postop_assigns(expr))
458 break;
459 if (handle__builtin_choose_expr_assigns(expr))
460 break;
461
462 __split_expr(expr->right);
463 if (outside_of_function())
464 __pass_to_client(expr, GLOBAL_ASSIGNMENT_HOOK);
465 else
466 __pass_to_client(expr, ASSIGNMENT_HOOK);
467
468 __fake_struct_member_assignments(expr);
469
470 if (expr->op == '=' && right->type == EXPR_CALL)
471 __pass_to_client(expr, CALL_ASSIGNMENT_HOOK);
472
473 if (get_macro_name(right->pos) &&
474 get_macro_name(expr->pos) != get_macro_name(right->pos))
475 __pass_to_client(expr, MACRO_ASSIGNMENT_HOOK);
476
477 __pass_to_client(expr, ASSIGNMENT_HOOK_AFTER);
478
479 __split_expr(expr->left);
480 break;
481 }
482 case EXPR_DEREF:
483 expr_set_parent_expr(expr->deref, expr);
484
485 __pass_to_client(expr, DEREF_HOOK);
486 __split_expr(expr->deref);
487 break;
488 case EXPR_SLICE:
489 expr_set_parent_expr(expr->base, expr);
490
491 __split_expr(expr->base);
492 break;
493 case EXPR_CAST:
494 case EXPR_FORCE_CAST:
495 expr_set_parent_expr(expr->cast_expression, expr);
496
497 __pass_to_client(expr, CAST_HOOK);
498 __split_expr(expr->cast_expression);
499 break;
500 case EXPR_SIZEOF:
501 if (expr->cast_expression)
502 __pass_to_client(strip_parens(expr->cast_expression),
503 SIZEOF_HOOK);
504 break;
505 case EXPR_OFFSETOF:
506 case EXPR_ALIGNOF:
507 evaluate_expression(expr);
508 break;
509 case EXPR_CONDITIONAL:
510 case EXPR_SELECT:
511 expr_set_parent_expr(expr->conditional, expr);
512 expr_set_parent_expr(expr->cond_true, expr);
513 expr_set_parent_expr(expr->cond_false, expr);
514
515 if (known_condition_true(expr->conditional)) {
516 __split_expr(expr->cond_true);
517 break;
518 }
519 if (known_condition_false(expr->conditional)) {
520 __split_expr(expr->cond_false);
521 break;
522 }
523 __pass_to_client(expr, SELECT_HOOK);
524 __split_whole_condition(expr->conditional);
525 __split_expr(expr->cond_true);
526 __push_true_states();
527 __use_false_states();
528 __split_expr(expr->cond_false);
529 __merge_true_states();
530 break;
531 case EXPR_CALL:
532 expr_set_parent_expr(expr->fn, expr);
533
534 if (sym_name_is("__builtin_constant_p", expr->fn))
535 break;
536 if (handle__builtin_choose_expr(expr))
537 break;
538 split_expr_list(expr->args, expr);
539 __split_expr(expr->fn);
540 if (is_inline_func(expr->fn))
541 add_inline_function(expr->fn->symbol);
542 if (inlinable(expr->fn))
543 __inline_call = 1;
544 __process_post_op_stack();
545 __pass_to_client(expr, FUNCTION_CALL_HOOK_BEFORE);
546 __pass_to_client(expr, FUNCTION_CALL_HOOK);
547 __inline_call = 0;
548 if (inlinable(expr->fn)) {
549 parse_inline(expr);
550 }
551 __pass_to_client(expr, CALL_HOOK_AFTER_INLINE);
552 if (is_noreturn_func(expr->fn))
553 nullify_path();
554 handle_builtin_overflow_func(expr);
555 break;
556 case EXPR_INITIALIZER:
557 split_expr_list(expr->expr_list, expr);
558 break;
559 case EXPR_IDENTIFIER:
560 expr_set_parent_expr(expr->ident_expression, expr);
561 __split_expr(expr->ident_expression);
562 break;
563 case EXPR_INDEX:
564 expr_set_parent_expr(expr->idx_expression, expr);
565 __split_expr(expr->idx_expression);
566 break;
567 case EXPR_POS:
568 expr_set_parent_expr(expr->init_expr, expr);
569 __split_expr(expr->init_expr);
570 break;
571 case EXPR_SYMBOL:
572 __pass_to_client(expr, SYM_HOOK);
573 break;
574 case EXPR_STRING:
575 __pass_to_client(expr, STRING_HOOK);
576 break;
577 default:
578 break;
579 };
580 pop_expression(&big_expression_stack);
581 }
582
583 static int is_forever_loop(struct statement *stmt)
584 {
585 struct expression *expr;
586 sval_t sval;
587
588 expr = strip_expr(stmt->iterator_pre_condition);
589 if (!expr)
590 expr = stmt->iterator_post_condition;
591 if (!expr) {
592 /* this is a for(;;) loop... */
593 return 1;
594 }
595
596 if (get_value(expr, &sval) && sval.value != 0)
597 return 1;
598
599 return 0;
600 }
601
602 static int loop_num;
603 static char *get_loop_name(int num)
604 {
605 char buf[256];
606
607 snprintf(buf, 255, "-loop%d", num);
608 buf[255] = '\0';
609 return alloc_sname(buf);
610 }
611
612 /*
613 * Pre Loops are while and for loops.
614 */
615 static void handle_pre_loop(struct statement *stmt)
616 {
617 int once_through; /* we go through the loop at least once */
618 struct sm_state *extra_sm = NULL;
619 int unchanged = 0;
620 char *loop_name;
621 struct stree *stree = NULL;
622 struct sm_state *sm = NULL;
623
624 loop_name = get_loop_name(loop_num);
625 loop_num++;
626
627 __split_stmt(stmt->iterator_pre_statement);
628 __prev_stmt = stmt->iterator_pre_statement;
629
630 once_through = implied_condition_true(stmt->iterator_pre_condition);
631
632 loop_count++;
633 __push_continues();
634 __push_breaks();
635
636 __merge_gotos(loop_name, NULL);
637
638 extra_sm = __extra_handle_canonical_loops(stmt, &stree);
639 __in_pre_condition++;
640 __pass_to_client(stmt, PRELOOP_HOOK);
641 __split_whole_condition(stmt->iterator_pre_condition);
642 __in_pre_condition--;
643 FOR_EACH_SM(stree, sm) {
644 set_state(sm->owner, sm->name, sm->sym, sm->state);
645 } END_FOR_EACH_SM(sm);
646 free_stree(&stree);
647 if (extra_sm)
648 extra_sm = get_sm_state(extra_sm->owner, extra_sm->name, extra_sm->sym);
649
650 if (option_assume_loops)
651 once_through = 1;
652
653 __split_stmt(stmt->iterator_statement);
654 if (is_forever_loop(stmt)) {
655 __merge_continues();
656 __save_gotos(loop_name, NULL);
657
658 __push_fake_cur_stree();
659 __split_stmt(stmt->iterator_post_statement);
660 stree = __pop_fake_cur_stree();
661
662 __discard_false_states();
663 __use_breaks();
664
665 if (!__path_is_null())
666 __merge_stree_into_cur(stree);
667 free_stree(&stree);
668 } else {
669 __merge_continues();
670 unchanged = __iterator_unchanged(extra_sm);
671 __split_stmt(stmt->iterator_post_statement);
672 __prev_stmt = stmt->iterator_post_statement;
673 __cur_stmt = stmt;
674
675 __save_gotos(loop_name, NULL);
676 __in_pre_condition++;
677 __split_whole_condition(stmt->iterator_pre_condition);
678 __in_pre_condition--;
679 nullify_path();
680 __merge_false_states();
681 if (once_through)
682 __discard_false_states();
683 else
684 __merge_false_states();
685
686 if (extra_sm && unchanged)
687 __extra_pre_loop_hook_after(extra_sm,
688 stmt->iterator_post_statement,
689 stmt->iterator_pre_condition);
690 __merge_breaks();
691 }
692 loop_count--;
693 }
694
695 /*
696 * Post loops are do {} while();
697 */
698 static void handle_post_loop(struct statement *stmt)
699 {
700 char *loop_name;
701
702 loop_name = get_loop_name(loop_num);
703 loop_num++;
704 loop_count++;
705
706 __push_continues();
707 __push_breaks();
708 __merge_gotos(loop_name, NULL);
709 __split_stmt(stmt->iterator_statement);
710 __merge_continues();
711 if (!is_zero(stmt->iterator_post_condition))
712 __save_gotos(loop_name, NULL);
713
714 if (is_forever_loop(stmt)) {
715 __use_breaks();
716 } else {
717 __split_whole_condition(stmt->iterator_post_condition);
718 __use_false_states();
719 __merge_breaks();
720 }
721 loop_count--;
722 }
723
724 static int empty_statement(struct statement *stmt)
725 {
726 if (!stmt)
727 return 0;
728 if (stmt->type == STMT_EXPRESSION && !stmt->expression)
729 return 1;
730 return 0;
731 }
732
733 static int last_stmt_on_same_line(void)
734 {
735 struct statement *stmt;
736 int i = 0;
737
738 FOR_EACH_PTR_REVERSE(big_statement_stack, stmt) {
739 if (!i++)
740 continue;
741 if (stmt->pos.line == get_lineno())
742 return 1;
743 return 0;
744 } END_FOR_EACH_PTR_REVERSE(stmt);
745 return 0;
746 }
747
748 static void split_asm_constraints(struct expression_list *expr_list)
749 {
750 struct expression *expr;
751 int state = 0;
752
753 FOR_EACH_PTR(expr_list, expr) {
754 switch (state) {
755 case 0: /* identifier */
756 case 1: /* constraint */
757 state++;
758 continue;
759 case 2: /* expression */
760 state = 0;
761 __split_expr(expr);
762 continue;
763 }
764 } END_FOR_EACH_PTR(expr);
765 }
766
767 static int is_case_val(struct statement *stmt, sval_t sval)
768 {
769 sval_t case_sval;
770
771 if (stmt->type != STMT_CASE)
772 return 0;
773 if (!stmt->case_expression) {
774 __set_default();
775 return 1;
776 }
777 if (!get_value(stmt->case_expression, &case_sval))
778 return 0;
779 if (case_sval.value == sval.value)
780 return 1;
781 return 0;
782 }
783
784 static struct range_list *get_case_rl(struct expression *switch_expr,
785 struct expression *case_expr,
786 struct expression *case_to)
787 {
788 sval_t start, end;
789 struct range_list *rl = NULL;
790 struct symbol *switch_type;
791
792 switch_type = get_type(switch_expr);
793 if (get_value(case_to, &end) && get_value(case_expr, &start)) {
794 start = sval_cast(switch_type, start);
795 end = sval_cast(switch_type, end);
796 add_range(&rl, start, end);
797 } else if (get_value(case_expr, &start)) {
798 start = sval_cast(switch_type, start);
799 add_range(&rl, start, start);
800 }
801
802 return rl;
803 }
804
805 static void split_known_switch(struct statement *stmt, sval_t sval)
806 {
807 struct statement *tmp;
808 struct range_list *rl;
809
810 __split_expr(stmt->switch_expression);
811 sval = sval_cast(get_type(stmt->switch_expression), sval);
812
813 push_expression(&switch_expr_stack, stmt->switch_expression);
814 __save_switch_states(top_expression(switch_expr_stack));
815 nullify_path();
816 __push_default();
817 __push_breaks();
818
819 stmt = stmt->switch_statement;
820
821 __push_scope_hooks();
822 FOR_EACH_PTR(stmt->stmts, tmp) {
823 __smatch_lineno = tmp->pos.line;
824 if (is_case_val(tmp, sval)) {
825 rl = alloc_rl(sval, sval);
826 __merge_switches(top_expression(switch_expr_stack), rl);
827 __pass_case_to_client(top_expression(switch_expr_stack), rl);
828 }
829 if (__path_is_null())
830 continue;
831 __split_stmt(tmp);
832 if (__path_is_null()) {
833 __set_default();
834 goto out;
835 }
836 } END_FOR_EACH_PTR(tmp);
837 out:
838 __call_scope_hooks();
839 if (!__pop_default())
840 __merge_switches(top_expression(switch_expr_stack), NULL);
841 __discard_switches();
842 __merge_breaks();
843 pop_expression(&switch_expr_stack);
844 }
845
846 static void split_case(struct statement *stmt)
847 {
848 struct range_list *rl = NULL;
849
850 expr_set_parent_stmt(stmt->case_expression, stmt);
851 expr_set_parent_stmt(stmt->case_to, stmt);
852
853 rl = get_case_rl(top_expression(switch_expr_stack),
854 stmt->case_expression, stmt->case_to);
855 while (stmt->case_statement->type == STMT_CASE) {
856 struct range_list *tmp;
857
858 tmp = get_case_rl(top_expression(switch_expr_stack),
859 stmt->case_statement->case_expression,
860 stmt->case_statement->case_to);
861 if (!tmp)
862 break;
863 rl = rl_union(rl, tmp);
864 if (!stmt->case_expression)
865 __set_default();
866 stmt = stmt->case_statement;
867 }
868
869 __merge_switches(top_expression(switch_expr_stack), rl);
870
871 if (!stmt->case_expression)
872 __set_default();
873 __split_stmt(stmt->case_statement);
874 }
875
876 int time_parsing_function(void)
877 {
878 return ms_since(&fn_start_time) / 1000;
879 }
880
881 static int taking_too_long(void)
882 {
883 if ((ms_since(&outer_fn_start_time) / 1000) > 60 * 5) /* five minutes */
884 return 1;
885 return 0;
886 }
887
888 static int is_last_stmt(struct statement *cur_stmt)
889 {
890 struct symbol *fn = get_base_type(cur_func_sym);
891 struct statement *stmt;
892
893 if (!fn)
894 return 0;
895 stmt = fn->stmt;
896 if (!stmt)
897 stmt = fn->inline_stmt;
898 if (!stmt || stmt->type != STMT_COMPOUND)
899 return 0;
900 stmt = last_ptr_list((struct ptr_list *)stmt->stmts);
901 if (stmt && stmt->type == STMT_LABEL)
902 stmt = stmt->label_statement;
903 if (stmt == cur_stmt)
904 return 1;
905 return 0;
906 }
907
908 static void handle_backward_goto(struct statement *goto_stmt)
909 {
910 const char *goto_name, *label_name;
911 struct statement *func_stmt;
912 struct symbol *base_type = get_base_type(cur_func_sym);
913 struct statement *tmp;
914 int found = 0;
915
916 if (!option_info)
917 return;
918 if (last_goto_statement_handled)
919 return;
920 last_goto_statement_handled = 1;
921
922 if (!goto_stmt->goto_label ||
923 goto_stmt->goto_label->type != SYM_LABEL ||
924 !goto_stmt->goto_label->ident)
925 return;
926 goto_name = goto_stmt->goto_label->ident->name;
927
928 func_stmt = base_type->stmt;
929 if (!func_stmt)
930 func_stmt = base_type->inline_stmt;
931 if (!func_stmt)
932 return;
933 if (func_stmt->type != STMT_COMPOUND)
934 return;
935
936 FOR_EACH_PTR(func_stmt->stmts, tmp) {
937 if (!found) {
938 if (tmp->type != STMT_LABEL)
939 continue;
940 if (!tmp->label_identifier ||
941 tmp->label_identifier->type != SYM_LABEL ||
942 !tmp->label_identifier->ident)
943 continue;
944 label_name = tmp->label_identifier->ident->name;
945 if (strcmp(goto_name, label_name) != 0)
946 continue;
947 found = 1;
948 }
949 __split_stmt(tmp);
950 } END_FOR_EACH_PTR(tmp);
951 }
952
953 static void fake_a_return(void)
954 {
955 struct symbol *return_type;
956
957 nullify_path();
958 __unnullify_path();
959
960 return_type = get_real_base_type(cur_func_sym);
961 return_type = get_real_base_type(return_type);
962 if (return_type != &void_ctype) {
963 __pass_to_client(unknown_value_expression(NULL), RETURN_HOOK);
964 nullify_path();
965 }
966 }
967
968 static void fake_an_empty_default(struct position pos)
969 {
970 static struct statement none = {};
971
972 none.pos = pos;
973 none.type = STMT_NONE;
974 __merge_switches(top_expression(switch_expr_stack), NULL);
975 __split_stmt(&none);
976 }
977
978 static void split_compound(struct statement *stmt)
979 {
980 struct statement *prev = NULL;
981 struct statement *cur = NULL;
982 struct statement *next;
983
984 __push_scope_hooks();
985
986 FOR_EACH_PTR(stmt->stmts, next) {
987 /* just set them all ahead of time */
988 stmt_set_parent_stmt(next, stmt);
989
990 if (cur) {
991 __prev_stmt = prev;
992 __next_stmt = next;
993 __cur_stmt = cur;
994 __split_stmt(cur);
995 }
996 prev = cur;
997 cur = next;
998 } END_FOR_EACH_PTR(next);
999 if (cur) {
1000 __prev_stmt = prev;
1001 __cur_stmt = cur;
1002 __next_stmt = NULL;
1003 __split_stmt(cur);
1004 }
1005
1006 /*
1007 * For function scope, then delay calling the scope hooks until the
1008 * end of function hooks can run. I'm not positive this is the right
1009 * thing...
1010 */
1011 if (!is_last_stmt(cur))
1012 __call_scope_hooks();
1013 }
1014
1015 /*
1016 * This is a hack, work around for detecting empty functions.
1017 */
1018 static int need_delayed_scope_hooks(void)
1019 {
1020 struct symbol *fn = get_base_type(cur_func_sym);
1021 struct statement *stmt;
1022
1023 if (!fn)
1024 return 0;
1025 stmt = fn->stmt;
1026 if (!stmt)
1027 stmt = fn->inline_stmt;
1028 if (stmt && stmt->type == STMT_COMPOUND)
1029 return 1;
1030 return 0;
1031 }
1032
1033 void __split_label_stmt(struct statement *stmt)
1034 {
1035 if (stmt->label_identifier &&
1036 stmt->label_identifier->type == SYM_LABEL &&
1037 stmt->label_identifier->ident) {
1038 loop_count |= 0x0800000;
1039 __merge_gotos(stmt->label_identifier->ident->name, stmt->label_identifier);
1040 }
1041 }
1042
1043 static void find_asm_gotos(struct statement *stmt)
1044 {
1045 struct symbol *sym;
1046
1047 FOR_EACH_PTR(stmt->asm_labels, sym) {
1048 __save_gotos(sym->ident->name, sym);
1049 } END_FOR_EACH_PTR(sym);
1050 }
1051
1052 void __split_stmt(struct statement *stmt)
1053 {
1054 sval_t sval;
1055
1056 if (!stmt)
1057 goto out;
1058
1059 if (!__in_fake_assign)
1060 __silence_warnings_for_stmt = false;
1061
1062 if (__bail_on_rest_of_function)
1063 return;
1064
1065 if (out_of_memory() || taking_too_long()) {
1066 struct timeval stop;
1067
1068 gettimeofday(&stop, NULL);
1069
1070 __bail_on_rest_of_function = 1;
1071 final_pass = 1;
1072 sm_msg("Function too hairy. Giving up. %lu seconds",
1073 stop.tv_sec - fn_start_time.tv_sec);
1074 fake_a_return();
1075 final_pass = 0; /* turn off sm_msg() from here */
1076 return;
1077 }
1078
1079 add_ptr_list(&big_statement_stack, stmt);
1080 free_expression_stack(&big_expression_stack);
1081 set_position(stmt->pos);
1082 __pass_to_client(stmt, STMT_HOOK);
1083
1084 switch (stmt->type) {
1085 case STMT_DECLARATION:
1086 split_declaration(stmt->declaration);
1087 break;
1088 case STMT_RETURN:
1089 expr_set_parent_stmt(stmt->ret_value, stmt);
1090
1091 __split_expr(stmt->ret_value);
1092 __pass_to_client(stmt->ret_value, RETURN_HOOK);
1093 __process_post_op_stack();
1094 nullify_path();
1095 break;
1096 case STMT_EXPRESSION:
1097 expr_set_parent_stmt(stmt->expression, stmt);
1098 expr_set_parent_stmt(stmt->context, stmt);
1099
1100 __split_expr(stmt->expression);
1101 break;
1102 case STMT_COMPOUND:
1103 split_compound(stmt);
1104 break;
1105 case STMT_IF:
1106 stmt_set_parent_stmt(stmt->if_true, stmt);
1107 stmt_set_parent_stmt(stmt->if_false, stmt);
1108 expr_set_parent_stmt(stmt->if_conditional, stmt);
1109
1110 if (known_condition_true(stmt->if_conditional)) {
1111 __split_stmt(stmt->if_true);
1112 break;
1113 }
1114 if (known_condition_false(stmt->if_conditional)) {
1115 __split_stmt(stmt->if_false);
1116 break;
1117 }
1118 __split_whole_condition(stmt->if_conditional);
1119 __split_stmt(stmt->if_true);
1120 if (empty_statement(stmt->if_true) &&
1121 last_stmt_on_same_line() &&
1122 !get_macro_name(stmt->if_true->pos))
1123 sm_msg("warn: if();");
1124 __push_true_states();
1125 __use_false_states();
1126 __split_stmt(stmt->if_false);
1127 __merge_true_states();
1128 break;
1129 case STMT_ITERATOR:
1130 stmt_set_parent_stmt(stmt->iterator_pre_statement, stmt);
1131 stmt_set_parent_stmt(stmt->iterator_statement, stmt);
1132 stmt_set_parent_stmt(stmt->iterator_post_statement, stmt);
1133 expr_set_parent_stmt(stmt->iterator_pre_condition, stmt);
1134 expr_set_parent_stmt(stmt->iterator_post_condition, stmt);
1135
1136 if (stmt->iterator_pre_condition)
1137 handle_pre_loop(stmt);
1138 else if (stmt->iterator_post_condition)
1139 handle_post_loop(stmt);
1140 else {
1141 // these are for(;;) type loops.
1142 handle_pre_loop(stmt);
1143 }
1144 break;
1145 case STMT_SWITCH:
1146 stmt_set_parent_stmt(stmt->switch_statement, stmt);
1147 expr_set_parent_stmt(stmt->switch_expression, stmt);
1148
1149 if (get_value(stmt->switch_expression, &sval)) {
1150 split_known_switch(stmt, sval);
1151 break;
1152 }
1153 __split_expr(stmt->switch_expression);
1154 push_expression(&switch_expr_stack, stmt->switch_expression);
1155 __save_switch_states(top_expression(switch_expr_stack));
1156 nullify_path();
1157 __push_default();
1158 __push_breaks();
1159 __split_stmt(stmt->switch_statement);
1160 if (!__pop_default() && have_remaining_cases())
1161 fake_an_empty_default(stmt->pos);
1162 __discard_switches();
1163 __merge_breaks();
1164 pop_expression(&switch_expr_stack);
1165 break;
1166 case STMT_CASE:
1167 split_case(stmt);
1168 break;
1169 case STMT_LABEL:
1170 __split_label_stmt(stmt);
1171 __split_stmt(stmt->label_statement);
1172 break;
1173 case STMT_GOTO:
1174 expr_set_parent_stmt(stmt->goto_expression, stmt);
1175
1176 __split_expr(stmt->goto_expression);
1177 if (stmt->goto_label && stmt->goto_label->type == SYM_NODE) {
1178 if (!strcmp(stmt->goto_label->ident->name, "break")) {
1179 __process_breaks();
1180 } else if (!strcmp(stmt->goto_label->ident->name,
1181 "continue")) {
1182 __process_continues();
1183 }
1184 } else if (stmt->goto_label &&
1185 stmt->goto_label->type == SYM_LABEL &&
1186 stmt->goto_label->ident) {
1187 __save_gotos(stmt->goto_label->ident->name, stmt->goto_label);
1188 }
1189 nullify_path();
1190 if (is_last_stmt(stmt))
1191 handle_backward_goto(stmt);
1192 break;
1193 case STMT_NONE:
1194 break;
1195 case STMT_ASM:
1196 expr_set_parent_stmt(stmt->asm_string, stmt);
1197
1198 find_asm_gotos(stmt);
1199 __pass_to_client(stmt, ASM_HOOK);
1200 __split_expr(stmt->asm_string);
1201 split_asm_constraints(stmt->asm_outputs);
1202 split_asm_constraints(stmt->asm_inputs);
1203 split_asm_constraints(stmt->asm_clobbers);
1204 break;
1205 case STMT_CONTEXT:
1206 break;
1207 case STMT_RANGE:
1208 __split_expr(stmt->range_expression);
1209 __split_expr(stmt->range_low);
1210 __split_expr(stmt->range_high);
1211 break;
1212 }
1213 __pass_to_client(stmt, STMT_HOOK_AFTER);
1214 out:
1215 __process_post_op_stack();
1216 }
1217
1218 static void split_expr_list(struct expression_list *expr_list, struct expression *parent)
1219 {
1220 struct expression *expr;
1221
1222 FOR_EACH_PTR(expr_list, expr) {
1223 expr_set_parent_expr(expr, parent);
1224 __split_expr(expr);
1225 __process_post_op_stack();
1226 } END_FOR_EACH_PTR(expr);
1227 }
1228
1229 static void split_sym(struct symbol *sym)
1230 {
1231 if (!sym)
1232 return;
1233 if (!(sym->namespace & NS_SYMBOL))
1234 return;
1235
1236 __split_stmt(sym->stmt);
1237 __split_expr(sym->array_size);
1238 split_symlist(sym->arguments);
1239 split_symlist(sym->symbol_list);
1240 __split_stmt(sym->inline_stmt);
1241 split_symlist(sym->inline_symbol_list);
1242 }
1243
1244 static void split_symlist(struct symbol_list *sym_list)
1245 {
1246 struct symbol *sym;
1247
1248 FOR_EACH_PTR(sym_list, sym) {
1249 split_sym(sym);
1250 } END_FOR_EACH_PTR(sym);
1251 }
1252
1253 typedef void (fake_cb)(struct expression *expr);
1254
1255 static int member_to_number(struct expression *expr, struct ident *member)
1256 {
1257 struct symbol *type, *tmp;
1258 char *name;
1259 int i;
1260
1261 if (!member)
1262 return -1;
1263 name = member->name;
1264
1265 type = get_type(expr);
1266 if (!type || type->type != SYM_STRUCT)
1267 return -1;
1268
1269 i = -1;
1270 FOR_EACH_PTR(type->symbol_list, tmp) {
1271 i++;
1272 if (!tmp->ident)
1273 continue;
1274 if (strcmp(name, tmp->ident->name) == 0)
1275 return i;
1276 } END_FOR_EACH_PTR(tmp);
1277 return -1;
1278 }
1279
1280 static struct ident *number_to_member(struct expression *expr, int num)
1281 {
1282 struct symbol *type, *member;
1283 int i = 0;
1284
1285 type = get_type(expr);
1286 if (!type || type->type != SYM_STRUCT)
1287 return NULL;
1288
1289 FOR_EACH_PTR(type->symbol_list, member) {
1290 if (i == num)
1291 return member->ident;
1292 i++;
1293 } END_FOR_EACH_PTR(member);
1294 return NULL;
1295 }
1296
1297 static void fake_element_assigns_helper(struct expression *array, struct expression_list *expr_list, fake_cb *fake_cb);
1298
1299 static void set_inner_struct_members(struct expression *expr, struct symbol *member)
1300 {
1301 struct expression *edge_member, *assign;
1302 struct symbol *base = get_real_base_type(member);
1303 struct symbol *tmp;
1304
1305 if (member->ident)
1306 expr = member_expression(expr, '.', member->ident);
1307
1308 FOR_EACH_PTR(base->symbol_list, tmp) {
1309 struct symbol *type;
1310
1311 type = get_real_base_type(tmp);
1312 if (!type)
1313 continue;
1314
1315 edge_member = member_expression(expr, '.', tmp->ident);
1316 if (get_extra_state(edge_member))
1317 continue;
1318
1319 if (type->type == SYM_UNION || type->type == SYM_STRUCT) {
1320 set_inner_struct_members(expr, tmp);
1321 continue;
1322 }
1323
1324 if (!tmp->ident)
1325 continue;
1326
1327 assign = assign_expression(edge_member, '=', zero_expr());
1328 __split_expr(assign);
1329 } END_FOR_EACH_PTR(tmp);
1330
1331
1332 }
1333
1334 static void set_unset_to_zero(struct symbol *type, struct expression *expr)
1335 {
1336 struct symbol *tmp;
1337 struct expression *member = NULL;
1338 struct expression *assign;
1339 int op = '*';
1340
1341 if (expr->type == EXPR_PREOP && expr->op == '&') {
1342 expr = strip_expr(expr->unop);
1343 op = '.';
1344 }
1345
1346 FOR_EACH_PTR(type->symbol_list, tmp) {
1347 type = get_real_base_type(tmp);
1348 if (!type)
1349 continue;
1350
1351 if (tmp->ident) {
1352 member = member_expression(expr, op, tmp->ident);
1353 if (get_extra_state(member))
1354 continue;
1355 }
1356
1357 if (type->type == SYM_UNION || type->type == SYM_STRUCT) {
1358 set_inner_struct_members(expr, tmp);
1359 continue;
1360 }
1361 if (type->type == SYM_ARRAY)
1362 continue;
1363 if (!tmp->ident)
1364 continue;
1365
1366 assign = assign_expression(member, '=', zero_expr());
1367 __split_expr(assign);
1368 } END_FOR_EACH_PTR(tmp);
1369 }
1370
1371 static void fake_member_assigns_helper(struct expression *symbol, struct expression_list *members, fake_cb *fake_cb)
1372 {
1373 struct expression *deref, *assign, *tmp, *right;
1374 struct symbol *struct_type, *type;
1375 struct ident *member;
1376 int member_idx;
1377
1378 struct_type = get_type(symbol);
1379 if (!struct_type ||
1380 (struct_type->type != SYM_STRUCT && struct_type->type != SYM_UNION))
1381 return;
1382
1383 /*
1384 * We're parsing an initializer that could look something like this:
1385 * struct foo foo = {
1386 * 42,
1387 * .whatever.xxx = 11,
1388 * .zzz = 12,
1389 * };
1390 *
1391 * So what we have here is a list with 42, .whatever, and .zzz. We need
1392 * to break it up into left and right sides of the assignments.
1393 *
1394 */
1395 member_idx = 0;
1396 FOR_EACH_PTR(members, tmp) {
1397 deref = NULL;
1398 if (tmp->type == EXPR_IDENTIFIER) {
1399 member_idx = member_to_number(symbol, tmp->expr_ident);
1400 while (tmp->type == EXPR_IDENTIFIER) {
1401 member = tmp->expr_ident;
1402 tmp = tmp->ident_expression;
1403 if (deref)
1404 deref = member_expression(deref, '.', member);
1405 else
1406 deref = member_expression(symbol, '.', member);
1407 }
1408 } else {
1409 member = number_to_member(symbol, member_idx);
1410 deref = member_expression(symbol, '.', member);
1411 }
1412 right = tmp;
1413 member_idx++;
1414 if (right->type == EXPR_INITIALIZER) {
1415 type = get_type(deref);
1416 if (type && type->type == SYM_ARRAY)
1417 fake_element_assigns_helper(deref, right->expr_list, fake_cb);
1418 else
1419 fake_member_assigns_helper(deref, right->expr_list, fake_cb);
1420 } else {
1421 assign = assign_expression(deref, '=', right);
1422 fake_cb(assign);
1423 }
1424 } END_FOR_EACH_PTR(tmp);
1425
1426 set_unset_to_zero(struct_type, symbol);
1427 }
1428
1429 static void fake_member_assigns(struct symbol *sym, fake_cb *fake_cb)
1430 {
1431 fake_member_assigns_helper(symbol_expression(sym),
1432 sym->initializer->expr_list, fake_cb);
1433 }
1434
1435 static void fake_element_assigns_helper(struct expression *array, struct expression_list *expr_list, fake_cb *fake_cb)
1436 {
1437 struct expression *offset, *binop, *assign, *tmp;
1438 struct symbol *type;
1439 int idx;
1440
1441 if (ptr_list_size((struct ptr_list *)expr_list) > 1000)
1442 return;
1443
1444 idx = 0;
1445 FOR_EACH_PTR(expr_list, tmp) {
1446 if (tmp->type == EXPR_INDEX) {
1447 if (tmp->idx_from != tmp->idx_to)
1448 return;
1449 idx = tmp->idx_from;
1450 if (!tmp->idx_expression)
1451 goto next;
1452 tmp = tmp->idx_expression;
1453 }
1454 offset = value_expr(idx);
1455 binop = array_element_expression(array, offset);
1456 if (tmp->type == EXPR_INITIALIZER) {
1457 type = get_type(binop);
1458 if (type && type->type == SYM_ARRAY)
1459 fake_element_assigns_helper(binop, tmp->expr_list, fake_cb);
1460 else
1461 fake_member_assigns_helper(binop, tmp->expr_list, fake_cb);
1462 } else {
1463 assign = assign_expression(binop, '=', tmp);
1464 fake_cb(assign);
1465 }
1466 next:
1467 idx++;
1468 } END_FOR_EACH_PTR(tmp);
1469 }
1470
1471 static void fake_element_assigns(struct symbol *sym, fake_cb *fake_cb)
1472 {
1473 fake_element_assigns_helper(symbol_expression(sym), sym->initializer->expr_list, fake_cb);
1474 }
1475
1476 static void fake_assign_expr(struct symbol *sym)
1477 {
1478 struct expression *assign, *symbol;
1479
1480 symbol = symbol_expression(sym);
1481 assign = assign_expression(symbol, '=', sym->initializer);
1482 __split_expr(assign);
1483 }
1484
1485 static void do_initializer_stuff(struct symbol *sym)
1486 {
1487 if (!sym->initializer)
1488 return;
1489
1490 if (sym->initializer->type == EXPR_INITIALIZER) {
1491 if (get_real_base_type(sym)->type == SYM_ARRAY)
1492 fake_element_assigns(sym, __split_expr);
1493 else
1494 fake_member_assigns(sym, __split_expr);
1495 } else {
1496 fake_assign_expr(sym);
1497 }
1498 }
1499
1500 static void split_declaration(struct symbol_list *sym_list)
1501 {
1502 struct symbol *sym;
1503
1504 FOR_EACH_PTR(sym_list, sym) {
1505 __pass_to_client(sym, DECLARATION_HOOK);
1506 do_initializer_stuff(sym);
1507 split_sym(sym);
1508 } END_FOR_EACH_PTR(sym);
1509 }
1510
1511 static void call_global_assign_hooks(struct expression *assign)
1512 {
1513 __pass_to_client(assign, GLOBAL_ASSIGNMENT_HOOK);
1514 }
1515
1516 static void fake_global_assign(struct symbol *sym)
1517 {
1518 struct expression *assign, *symbol;
1519
1520 if (get_real_base_type(sym)->type == SYM_ARRAY) {
1521 if (sym->initializer && sym->initializer->type == EXPR_INITIALIZER) {
1522 fake_element_assigns(sym, call_global_assign_hooks);
1523 } else if (sym->initializer) {
1524 symbol = symbol_expression(sym);
1525 assign = assign_expression(symbol, '=', sym->initializer);
1526 __pass_to_client(assign, GLOBAL_ASSIGNMENT_HOOK);
1527 } else {
1528 fake_element_assigns_helper(symbol_expression(sym), NULL, call_global_assign_hooks);
1529 }
1530 } else if (get_real_base_type(sym)->type == SYM_STRUCT) {
1531 if (sym->initializer && sym->initializer->type == EXPR_INITIALIZER) {
1532 fake_member_assigns(sym, call_global_assign_hooks);
1533 } else if (sym->initializer) {
1534 symbol = symbol_expression(sym);
1535 assign = assign_expression(symbol, '=', sym->initializer);
1536 __pass_to_client(assign, GLOBAL_ASSIGNMENT_HOOK);
1537 } else {
1538 fake_member_assigns_helper(symbol_expression(sym), NULL, call_global_assign_hooks);
1539 }
1540 } else {
1541 symbol = symbol_expression(sym);
1542 if (sym->initializer) {
1543 assign = assign_expression(symbol, '=', sym->initializer);
1544 __split_expr(assign);
1545 } else {
1546 assign = assign_expression(symbol, '=', zero_expr());
1547 }
1548 __pass_to_client(assign, GLOBAL_ASSIGNMENT_HOOK);
1549 }
1550 }
1551
1552 static void start_function_definition(struct symbol *sym)
1553 {
1554 __in_function_def = 1;
1555 __pass_to_client(sym, FUNC_DEF_HOOK);
1556 __in_function_def = 0;
1557 __pass_to_client(sym, AFTER_DEF_HOOK);
1558
1559 }
1560
1561 static void split_function(struct symbol *sym)
1562 {
1563 struct symbol *base_type = get_base_type(sym);
1564 struct timeval stop;
1565
1566 if (!base_type->stmt && !base_type->inline_stmt)
1567 return;
1568
1569 gettimeofday(&outer_fn_start_time, NULL);
1570 gettimeofday(&fn_start_time, NULL);
1571 cur_func_sym = sym;
1572 if (sym->ident)
1573 cur_func = sym->ident->name;
1574 set_position(sym->pos);
1575 loop_count = 0;
1576 last_goto_statement_handled = 0;
1577 sm_debug("new function: %s\n", cur_func);
1578 __stree_id = 0;
1579 if (option_two_passes) {
1580 __unnullify_path();
1581 loop_num = 0;
1582 final_pass = 0;
1583 start_function_definition(sym);
1584 __split_stmt(base_type->stmt);
1585 __split_stmt(base_type->inline_stmt);
1586 nullify_path();
1587 }
1588 __unnullify_path();
1589 loop_num = 0;
1590 final_pass = 1;
1591 start_function_definition(sym);
1592 __split_stmt(base_type->stmt);
1593 __split_stmt(base_type->inline_stmt);
1594 __pass_to_client(sym, END_FUNC_HOOK);
1595 if (need_delayed_scope_hooks())
1596 __call_scope_hooks();
1597 __pass_to_client(sym, AFTER_FUNC_HOOK);
1598
1599 clear_all_states();
1600
1601 gettimeofday(&stop, NULL);
1602 if (option_time && stop.tv_sec - fn_start_time.tv_sec > 2) {
1603 final_pass++;
1604 sm_msg("func_time: %lu", stop.tv_sec - fn_start_time.tv_sec);
1605 final_pass--;
1606 }
1607 cur_func_sym = NULL;
1608 cur_func = NULL;
1609 free_data_info_allocs();
1610 free_expression_stack(&switch_expr_stack);
1611 __free_ptr_list((struct ptr_list **)&big_statement_stack);
1612 __bail_on_rest_of_function = 0;
1613 }
1614
1615 static void save_flow_state(void)
1616 {
1617 __add_ptr_list(&backup, INT_PTR(loop_num << 2), 0);
1618 __add_ptr_list(&backup, INT_PTR(loop_count << 2), 0);
1619 __add_ptr_list(&backup, INT_PTR(final_pass << 2), 0);
1620
1621 __add_ptr_list(&backup, big_statement_stack, 0);
1622 __add_ptr_list(&backup, big_expression_stack, 0);
1623 __add_ptr_list(&backup, big_condition_stack, 0);
1624 __add_ptr_list(&backup, switch_expr_stack, 0);
1625
1626 __add_ptr_list(&backup, cur_func_sym, 0);
1627
1628 __add_ptr_list(&backup, __prev_stmt, 0);
1629 __add_ptr_list(&backup, __cur_stmt, 0);
1630 __add_ptr_list(&backup, __next_stmt, 0);
1631
1632 }
1633
1634 static void *pop_backup(void)
1635 {
1636 void *ret;
1637
1638 ret = last_ptr_list(backup);
1639 delete_ptr_list_last(&backup);
1640 return ret;
1641 }
1642
1643 static void restore_flow_state(void)
1644 {
1645 __next_stmt = pop_backup();
1646 __cur_stmt = pop_backup();
1647 __prev_stmt = pop_backup();
1648
1649 cur_func_sym = pop_backup();
1650 switch_expr_stack = pop_backup();
1651 big_condition_stack = pop_backup();
1652 big_expression_stack = pop_backup();
1653 big_statement_stack = pop_backup();
1654 final_pass = PTR_INT(pop_backup()) >> 2;
1655 loop_count = PTR_INT(pop_backup()) >> 2;
1656 loop_num = PTR_INT(pop_backup()) >> 2;
1657 }
1658
1659 static void parse_inline(struct expression *call)
1660 {
1661 struct symbol *base_type;
1662 char *cur_func_bak = cur_func; /* not aligned correctly for backup */
1663 struct timeval time_backup = fn_start_time;
1664 struct expression *orig_inline = __inline_fn;
1665 int orig_budget;
1666
1667 if (out_of_memory() || taking_too_long())
1668 return;
1669
1670 save_flow_state();
1671
1672 __pass_to_client(call, INLINE_FN_START);
1673 final_pass = 0; /* don't print anything */
1674 __inline_fn = call;
1675 orig_budget = inline_budget;
1676 inline_budget = inline_budget - 5;
1677
1678 base_type = get_base_type(call->fn->symbol);
1679 cur_func_sym = call->fn->symbol;
1680 if (call->fn->symbol->ident)
1681 cur_func = call->fn->symbol->ident->name;
1682 else
1683 cur_func = NULL;
1684 set_position(call->fn->symbol->pos);
1685
1686 save_all_states();
1687 big_statement_stack = NULL;
1688 big_expression_stack = NULL;
1689 big_condition_stack = NULL;
1690 switch_expr_stack = NULL;
1691
1692 sm_debug("inline function: %s\n", cur_func);
1693 __unnullify_path();
1694 loop_num = 0;
1695 loop_count = 0;
1696 start_function_definition(call->fn->symbol);
1697 __split_stmt(base_type->stmt);
1698 __split_stmt(base_type->inline_stmt);
1699 __pass_to_client(call->fn->symbol, END_FUNC_HOOK);
1700 __pass_to_client(call->fn->symbol, AFTER_FUNC_HOOK);
1701
1702 free_expression_stack(&switch_expr_stack);
1703 __free_ptr_list((struct ptr_list **)&big_statement_stack);
1704 nullify_path();
1705 free_goto_stack();
1706
1707 restore_flow_state();
1708 fn_start_time = time_backup;
1709 cur_func = cur_func_bak;
1710
1711 restore_all_states();
1712 set_position(call->pos);
1713 __inline_fn = orig_inline;
1714 inline_budget = orig_budget;
1715 __pass_to_client(call, INLINE_FN_END);
1716 }
1717
1718 static struct symbol_list *inlines_called;
1719 static void add_inline_function(struct symbol *sym)
1720 {
1721 static struct symbol_list *already_added;
1722 struct symbol *tmp;
1723
1724 FOR_EACH_PTR(already_added, tmp) {
1725 if (tmp == sym)
1726 return;
1727 } END_FOR_EACH_PTR(tmp);
1728
1729 add_ptr_list(&already_added, sym);
1730 add_ptr_list(&inlines_called, sym);
1731 }
1732
1733 static void process_inlines(void)
1734 {
1735 struct symbol *tmp;
1736
1737 FOR_EACH_PTR(inlines_called, tmp) {
1738 split_function(tmp);
1739 } END_FOR_EACH_PTR(tmp);
1740 free_ptr_list(&inlines_called);
1741 }
1742
1743 static struct symbol *get_last_scoped_symbol(struct symbol_list *big_list, int use_static)
1744 {
1745 struct symbol *sym;
1746
1747 FOR_EACH_PTR_REVERSE(big_list, sym) {
1748 if (!sym->scope)
1749 continue;
1750 if (use_static && sym->ctype.modifiers & MOD_STATIC)
1751 return sym;
1752 if (!use_static && !(sym->ctype.modifiers & MOD_STATIC))
1753 return sym;
1754 } END_FOR_EACH_PTR_REVERSE(sym);
1755
1756 return NULL;
1757 }
1758
1759 static bool interesting_function(struct symbol *sym)
1760 {
1761 static int prev_stream = -1;
1762 static bool prev_answer;
1763 const char *filename;
1764 int len;
1765
1766 if (!(sym->ctype.modifiers & MOD_INLINE))
1767 return true;
1768
1769 if (sym->pos.stream == prev_stream)
1770 return prev_answer;
1771
1772 prev_stream = sym->pos.stream;
1773 prev_answer = false;
1774
1775 filename = stream_name(sym->pos.stream);
1776 len = strlen(filename);
1777 if (len > 0 && filename[len - 1] == 'c')
1778 prev_answer = true;
1779 return prev_answer;
1780 }
1781
1782 static void split_inlines_in_scope(struct symbol *sym)
1783 {
1784 struct symbol *base;
1785 struct symbol_list *scope_list;
1786 int stream;
1787
1788 scope_list = sym->scope->symbols;
1789 stream = sym->pos.stream;
1790
1791 /* find the last static symbol in the file */
1792 FOR_EACH_PTR_REVERSE(scope_list, sym) {
1793 if (sym->pos.stream != stream)
1794 continue;
1795 if (sym->type != SYM_NODE)
1796 continue;
1797 base = get_base_type(sym);
1798 if (!base)
1799 continue;
1800 if (base->type != SYM_FN)
1801 continue;
1802 if (!base->inline_stmt)
1803 continue;
1804 if (!interesting_function(sym))
1805 continue;
1806 add_inline_function(sym);
1807 } END_FOR_EACH_PTR_REVERSE(sym);
1808
1809 process_inlines();
1810 }
1811
1812 static void split_inlines(struct symbol_list *sym_list)
1813 {
1814 struct symbol *sym;
1815
1816 sym = get_last_scoped_symbol(sym_list, 0);
1817 if (sym)
1818 split_inlines_in_scope(sym);
1819 sym = get_last_scoped_symbol(sym_list, 1);
1820 if (sym)
1821 split_inlines_in_scope(sym);
1822 }
1823
1824 static struct stree *clone_estates_perm(struct stree *orig)
1825 {
1826 struct stree *ret = NULL;
1827 struct sm_state *tmp;
1828
1829 FOR_EACH_SM(orig, tmp) {
1830 set_state_stree_perm(&ret, tmp->owner, tmp->name, tmp->sym, clone_estate_perm(tmp->state));
1831 } END_FOR_EACH_SM(tmp);
1832
1833 return ret;
1834 }
1835
1836 struct position last_pos;
1837 static void split_c_file_functions(struct symbol_list *sym_list)
1838 {
1839 struct symbol *sym;
1840
1841 __unnullify_path();
1842 FOR_EACH_PTR(sym_list, sym) {
1843 set_position(sym->pos);
1844 if (sym->type != SYM_NODE || get_base_type(sym)->type != SYM_FN) {
1845 __pass_to_client(sym, BASE_HOOK);
1846 fake_global_assign(sym);
1847 }
1848 } END_FOR_EACH_PTR(sym);
1849 global_states = clone_estates_perm(get_all_states_stree(SMATCH_EXTRA));
1850 nullify_path();
1851
1852 FOR_EACH_PTR(sym_list, sym) {
1853 set_position(sym->pos);
1854 last_pos = sym->pos;
1855 if (!interesting_function(sym))
1856 continue;
1857 if (sym->type == SYM_NODE && get_base_type(sym)->type == SYM_FN) {
1858 split_function(sym);
1859 process_inlines();
1860 }
1861 last_pos = sym->pos;
1862 } END_FOR_EACH_PTR(sym);
1863 split_inlines(sym_list);
1864 __pass_to_client(sym_list, END_FILE_HOOK);
1865 }
1866
1867 static int final_before_fake;
1868 void init_fake_env(void)
1869 {
1870 if (!in_fake_env)
1871 final_before_fake = final_pass;
1872 in_fake_env++;
1873 __push_fake_cur_stree();
1874 final_pass = 0;
1875 }
1876
1877 void end_fake_env(void)
1878 {
1879 __pop_fake_cur_stree();
1880 in_fake_env--;
1881 if (!in_fake_env)
1882 final_pass = final_before_fake;
1883 }
1884
1885 static void open_output_files(char *base_file)
1886 {
1887 char buf[256];
1888
1889 snprintf(buf, sizeof(buf), "%s.smatch", base_file);
1890 sm_outfd = fopen(buf, "w");
1891 if (!sm_outfd) {
1892 printf("Error: Cannot open %s\n", buf);
1893 exit(1);
1894 }
1895
1896 if (!option_info)
1897 return;
1898
1899 snprintf(buf, sizeof(buf), "%s.smatch.sql", base_file);
1900 sql_outfd = fopen(buf, "w");
1901 if (!sql_outfd) {
1902 printf("Error: Cannot open %s\n", buf);
1903 exit(1);
1904 }
1905
1906 snprintf(buf, sizeof(buf), "%s.smatch.caller_info", base_file);
1907 caller_info_fd = fopen(buf, "w");
1908 if (!caller_info_fd) {
1909 printf("Error: Cannot open %s\n", buf);
1910 exit(1);
1911 }
1912 }
1913
1914 void smatch(int argc, char **argv)
1915 {
1916 struct string_list *filelist = NULL;
1917 struct symbol_list *sym_list;
1918 struct timeval stop, start;
1919 char *path;
1920 int len;
1921
1922 gettimeofday(&start, NULL);
1923
1924 if (argc < 2) {
1925 printf("Usage: smatch [--debug] <filename.c>\n");
1926 exit(1);
1927 }
1928 sparse_initialize(argc, argv, &filelist);
1929 set_valid_ptr_max();
1930 alloc_valid_ptr_rl();
1931 FOR_EACH_PTR_NOTAG(filelist, base_file) {
1932 path = getcwd(NULL, 0);
1933 free(full_base_file);
1934 if (path) {
1935 len = strlen(path) + 1 + strlen(base_file) + 1;
1936 full_base_file = malloc(len);
1937 snprintf(full_base_file, len, "%s/%s", path, base_file);
1938 } else {
1939 full_base_file = alloc_string(base_file);
1940 }
1941 if (option_file_output)
1942 open_output_files(base_file);
1943 sym_list = sparse_keep_tokens(base_file);
1944 split_c_file_functions(sym_list);
1945 } END_FOR_EACH_PTR_NOTAG(base_file);
1946
1947 gettimeofday(&stop, NULL);
1948
1949 set_position(last_pos);
1950 if (option_time)
1951 sm_msg("time: %lu", stop.tv_sec - start.tv_sec);
1952 if (option_mem)
1953 sm_msg("mem: %luKb", get_max_memory());
1954 }
Static analysis for C