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