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