?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
allocation_funcs: handle inline functions better
[smatch.git] / smatch_flow.c
blobc592691206cfa74acbb7b2984538f6ecc8a7e091
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 __pass_to_client(stmt, AFTER_LOOP_NO_BREAKS);
798 __use_breaks();
799
800 if (!__path_is_null())
801 __merge_stree_into_cur(stree);
802 free_stree(&stree);
803 } else {
804 __merge_continues();
805 unchanged = __iterator_unchanged(extra_sm);
806 __split_stmt(stmt->iterator_post_statement);
807 __prev_stmt = stmt->iterator_post_statement;
808 __cur_stmt = stmt;
809
810 __save_gotos(loop_name, NULL);
811 __in_pre_condition++;
812 __split_whole_condition(stmt->iterator_pre_condition);
813 __in_pre_condition--;
814 nullify_path();
815 __merge_false_states();
816 if (once_through)
817 __discard_false_states();
818 else
819 __merge_false_states();
820
821 if (extra_sm && unchanged)
822 __extra_pre_loop_hook_after(extra_sm,
823 stmt->iterator_post_statement,
824 stmt->iterator_pre_condition);
825 __pass_to_client(stmt, AFTER_LOOP_NO_BREAKS);
826 __merge_breaks();
827 }
828 loop_count--;
829 }
830
831 /*
832 * Post loops are do {} while();
833 */
834 static void handle_post_loop(struct statement *stmt)
835 {
836 char *loop_name;
837
838 loop_name = get_loop_name(loop_num);
839 loop_num++;
840 loop_count++;
841
842 __pass_to_client(stmt, POSTLOOP_HOOK);
843
844 __push_continues();
845 __push_breaks();
846 __merge_gotos(loop_name, NULL);
847 __split_stmt(stmt->iterator_statement);
848 __merge_continues();
849 if (!expr_is_zero(stmt->iterator_post_condition))
850 __save_gotos(loop_name, NULL);
851
852 if (is_forever_loop(stmt)) {
853 __pass_to_client(stmt, AFTER_LOOP_NO_BREAKS);
854 __use_breaks();
855 } else {
856 __split_whole_condition(stmt->iterator_post_condition);
857 __use_false_states();
858 __pass_to_client(stmt, AFTER_LOOP_NO_BREAKS);
859 __merge_breaks();
860 }
861 loop_count--;
862 }
863
864 static int empty_statement(struct statement *stmt)
865 {
866 if (!stmt)
867 return 0;
868 if (stmt->type == STMT_EXPRESSION && !stmt->expression)
869 return 1;
870 return 0;
871 }
872
873 static int last_stmt_on_same_line(void)
874 {
875 struct statement *stmt;
876 int i = 0;
877
878 FOR_EACH_PTR_REVERSE(big_statement_stack, stmt) {
879 if (!i++)
880 continue;
881 if (stmt->pos.line == get_lineno())
882 return 1;
883 return 0;
884 } END_FOR_EACH_PTR_REVERSE(stmt);
885 return 0;
886 }
887
888 static void split_asm_ops(struct asm_operand_list *ops)
889 {
890 struct asm_operand *op;
891
892 FOR_EACH_PTR(ops, op) {
893 __split_expr(op->expr);
894 } END_FOR_EACH_PTR(op);
895 }
896
897 static int is_case_val(struct statement *stmt, sval_t sval)
898 {
899 sval_t case_sval;
900
901 if (stmt->type != STMT_CASE)
902 return 0;
903 if (!stmt->case_expression) {
904 __set_default();
905 return 1;
906 }
907 if (!get_value(stmt->case_expression, &case_sval))
908 return 0;
909 if (case_sval.value == sval.value)
910 return 1;
911 return 0;
912 }
913
914 static struct range_list *get_case_rl(struct expression *switch_expr,
915 struct expression *case_expr,
916 struct expression *case_to)
917 {
918 sval_t start, end;
919 struct range_list *rl = NULL;
920 struct symbol *switch_type;
921
922 switch_type = get_type(switch_expr);
923 if (get_value(case_to, &end) && get_value(case_expr, &start)) {
924 start = sval_cast(switch_type, start);
925 end = sval_cast(switch_type, end);
926 add_range(&rl, start, end);
927 } else if (get_value(case_expr, &start)) {
928 start = sval_cast(switch_type, start);
929 add_range(&rl, start, start);
930 }
931
932 return rl;
933 }
934
935 static void split_known_switch(struct statement *stmt, sval_t sval)
936 {
937 struct statement *tmp;
938 struct range_list *rl;
939
940 __split_expr(stmt->switch_expression);
941 sval = sval_cast(get_type(stmt->switch_expression), sval);
942
943 push_expression(&switch_expr_stack, stmt->switch_expression);
944 __save_switch_states(top_expression(switch_expr_stack));
945 nullify_path();
946 __push_default();
947 __push_breaks();
948
949 stmt = stmt->switch_statement;
950
951 __push_scope_hooks();
952 FOR_EACH_PTR(stmt->stmts, tmp) {
953 __smatch_lineno = tmp->pos.line;
954 if (is_case_val(tmp, sval)) {
955 rl = alloc_rl(sval, sval);
956 __merge_switches(top_expression(switch_expr_stack), rl);
957 __pass_case_to_client(top_expression(switch_expr_stack), rl);
958 }
959 if (__path_is_null())
960 continue;
961 __split_stmt(tmp);
962 if (__path_is_null()) {
963 __set_default();
964 goto out;
965 }
966 } END_FOR_EACH_PTR(tmp);
967 out:
968 __call_scope_hooks();
969 if (!__pop_default())
970 __merge_switches(top_expression(switch_expr_stack), NULL);
971 __discard_switches();
972 __merge_breaks();
973 pop_expression(&switch_expr_stack);
974 }
975
976 static void split_case(struct statement *stmt)
977 {
978 struct range_list *rl = NULL;
979
980 expr_set_parent_stmt(stmt->case_expression, stmt);
981 expr_set_parent_stmt(stmt->case_to, stmt);
982
983 rl = get_case_rl(top_expression(switch_expr_stack),
984 stmt->case_expression, stmt->case_to);
985 while (stmt->case_statement->type == STMT_CASE) {
986 struct range_list *tmp;
987
988 tmp = get_case_rl(top_expression(switch_expr_stack),
989 stmt->case_statement->case_expression,
990 stmt->case_statement->case_to);
991 if (!tmp)
992 break;
993 rl = rl_union(rl, tmp);
994 if (!stmt->case_expression)
995 __set_default();
996 stmt = stmt->case_statement;
997 }
998
999 __merge_switches(top_expression(switch_expr_stack), rl);
1000
1001 if (!stmt->case_expression)
1002 __set_default();
1003
1004 stmt_set_parent_stmt(stmt->case_statement, stmt);
1005 __split_stmt(stmt->case_statement);
1006 }
1007
1008 int time_parsing_function(void)
1009 {
1010 return ms_since(&fn_start_time) / 1000;
1011 }
1012
1013 bool taking_too_long(void)
1014 {
1015 if ((ms_since(&outer_fn_start_time) / 1000) > 60 * 5) /* five minutes */
1016 return 1;
1017 return 0;
1018 }
1019
1020 struct statement *get_last_stmt(void)
1021 {
1022 struct symbol *fn;
1023 struct statement *stmt;
1024
1025 fn = get_base_type(cur_func_sym);
1026 if (!fn)
1027 return NULL;
1028 stmt = fn->stmt;
1029 if (!stmt)
1030 stmt = fn->inline_stmt;
1031 if (!stmt || stmt->type != STMT_COMPOUND)
1032 return NULL;
1033 stmt = last_ptr_list((struct ptr_list *)stmt->stmts);
1034 if (stmt && stmt->type == STMT_LABEL)
1035 stmt = stmt->label_statement;
1036 return stmt;
1037 }
1038
1039 int is_last_stmt(struct statement *cur_stmt)
1040 {
1041 struct statement *last;
1042
1043 last = get_last_stmt();
1044 if (last && last == cur_stmt)
1045 return 1;
1046 return 0;
1047 }
1048
1049 static void handle_backward_goto(struct statement *goto_stmt)
1050 {
1051 const char *goto_name, *label_name;
1052 struct statement *func_stmt;
1053 struct symbol *base_type = get_base_type(cur_func_sym);
1054 struct statement *tmp;
1055 int found = 0;
1056
1057 if (!option_info)
1058 return;
1059 if (last_goto_statement_handled)
1060 return;
1061 last_goto_statement_handled = 1;
1062
1063 if (!goto_stmt->goto_label ||
1064 goto_stmt->goto_label->type != SYM_LABEL ||
1065 !goto_stmt->goto_label->ident)
1066 return;
1067 goto_name = goto_stmt->goto_label->ident->name;
1068
1069 func_stmt = base_type->stmt;
1070 if (!func_stmt)
1071 func_stmt = base_type->inline_stmt;
1072 if (!func_stmt)
1073 return;
1074 if (func_stmt->type != STMT_COMPOUND)
1075 return;
1076
1077 FOR_EACH_PTR(func_stmt->stmts, tmp) {
1078 if (!found) {
1079 if (tmp->type != STMT_LABEL)
1080 continue;
1081 if (!tmp->label_identifier ||
1082 tmp->label_identifier->type != SYM_LABEL ||
1083 !tmp->label_identifier->ident)
1084 continue;
1085 label_name = tmp->label_identifier->ident->name;
1086 if (strcmp(goto_name, label_name) != 0)
1087 continue;
1088 found = 1;
1089 }
1090 __split_stmt(tmp);
1091 } END_FOR_EACH_PTR(tmp);
1092 }
1093
1094 static void fake_a_return(void)
1095 {
1096 struct expression *ret = NULL;
1097
1098 nullify_path();
1099 __unnullify_path();
1100
1101 if (cur_func_return_type() != &void_ctype)
1102 ret = unknown_value_expression(NULL);
1103
1104 __pass_to_client(ret, RETURN_HOOK);
1105 nullify_path();
1106 }
1107
1108 static void split_ret_value(struct expression *expr)
1109 {
1110 struct symbol *type;
1111
1112 if (!expr)
1113 return;
1114
1115 type = get_real_base_type(cur_func_sym);
1116 type = get_real_base_type(type);
1117 expr = fake_a_variable_assign(type, NULL, expr, -1);
1118
1119 __in_fake_var_assign++;
1120 __split_expr(expr);
1121 __in_fake_var_assign--;
1122 }
1123
1124 static void fake_an_empty_default(struct position pos)
1125 {
1126 static struct statement none = {};
1127
1128 none.pos = pos;
1129 none.type = STMT_NONE;
1130 __merge_switches(top_expression(switch_expr_stack), NULL);
1131 __split_stmt(&none);
1132 }
1133
1134 static void split_compound(struct statement *stmt)
1135 {
1136 struct statement *prev = NULL;
1137 struct statement *cur = NULL;
1138 struct statement *next;
1139
1140 __push_scope_hooks();
1141
1142 FOR_EACH_PTR(stmt->stmts, next) {
1143 /* just set them all ahead of time */
1144 stmt_set_parent_stmt(next, stmt);
1145
1146 if (cur) {
1147 __prev_stmt = prev;
1148 __next_stmt = next;
1149 __cur_stmt = cur;
1150 __split_stmt(cur);
1151 }
1152 prev = cur;
1153 cur = next;
1154 } END_FOR_EACH_PTR(next);
1155 if (cur) {
1156 __prev_stmt = prev;
1157 __cur_stmt = cur;
1158 __next_stmt = NULL;
1159 __split_stmt(cur);
1160 }
1161
1162 /*
1163 * For function scope, then delay calling the scope hooks until the
1164 * end of function hooks can run. I'm not positive this is the right
1165 * thing...
1166 */
1167 if (!is_last_stmt(cur))
1168 __call_scope_hooks();
1169 }
1170
1171 /*
1172 * This is a hack, work around for detecting empty functions.
1173 */
1174 static int need_delayed_scope_hooks(void)
1175 {
1176 struct symbol *fn = get_base_type(cur_func_sym);
1177 struct statement *stmt;
1178
1179 if (!fn)
1180 return 0;
1181 stmt = fn->stmt;
1182 if (!stmt)
1183 stmt = fn->inline_stmt;
1184 if (stmt && stmt->type == STMT_COMPOUND)
1185 return 1;
1186 return 0;
1187 }
1188
1189 void __split_label_stmt(struct statement *stmt)
1190 {
1191 if (stmt->label_identifier &&
1192 stmt->label_identifier->type == SYM_LABEL &&
1193 stmt->label_identifier->ident) {
1194 loop_count |= 0x0800000;
1195 __merge_gotos(stmt->label_identifier->ident->name, stmt->label_identifier);
1196 }
1197 }
1198
1199 static void find_asm_gotos(struct statement *stmt)
1200 {
1201 struct symbol *sym;
1202
1203 FOR_EACH_PTR(stmt->asm_labels, sym) {
1204 __save_gotos(sym->ident->name, sym);
1205 } END_FOR_EACH_PTR(sym);
1206 }
1207
1208 void __split_stmt(struct statement *stmt)
1209 {
1210 static int indent_cnt;
1211 sval_t sval;
1212 struct timeval start, stop;
1213
1214 gettimeofday(&start, NULL);
1215
1216 if (!stmt)
1217 goto out;
1218
1219 if (!__in_fake_assign)
1220 __silence_warnings_for_stmt = false;
1221
1222 if (__bail_on_rest_of_function || is_skipped_function())
1223 return;
1224
1225 if (out_of_memory() || taking_too_long()) {
1226 gettimeofday(&start, NULL);
1227
1228 __bail_on_rest_of_function = 1;
1229 final_pass = 1;
1230 sm_perror("Function too hairy. Giving up. %lu seconds",
1231 start.tv_sec - fn_start_time.tv_sec);
1232 fake_a_return();
1233 final_pass = 0; /* turn off sm_msg() from here */
1234 return;
1235 }
1236
1237 indent_cnt++;
1238
1239 add_ptr_list(&big_statement_stack, stmt);
1240 free_expression_stack(&big_expression_stack);
1241 set_position(stmt->pos);
1242 __pass_to_client(stmt, STMT_HOOK);
1243
1244 switch (stmt->type) {
1245 case STMT_DECLARATION:
1246 split_declaration(stmt->declaration);
1247 break;
1248 case STMT_RETURN:
1249 expr_set_parent_stmt(stmt->ret_value, stmt);
1250
1251 split_ret_value(stmt->ret_value);
1252 __pass_to_client(stmt->ret_value, RETURN_HOOK);
1253 __process_post_op_stack();
1254 nullify_path();
1255 break;
1256 case STMT_EXPRESSION:
1257 expr_set_parent_stmt(stmt->expression, stmt);
1258 expr_set_parent_stmt(stmt->context, stmt);
1259
1260 __split_expr(stmt->expression);
1261 break;
1262 case STMT_COMPOUND:
1263 split_compound(stmt);
1264 break;
1265 case STMT_IF:
1266 stmt_set_parent_stmt(stmt->if_true, stmt);
1267 stmt_set_parent_stmt(stmt->if_false, stmt);
1268 expr_set_parent_stmt(stmt->if_conditional, stmt);
1269
1270 if (known_condition_true(stmt->if_conditional)) {
1271 __split_stmt(stmt->if_true);
1272 break;
1273 }
1274 if (known_condition_false(stmt->if_conditional)) {
1275 __split_stmt(stmt->if_false);
1276 break;
1277 }
1278 __split_whole_condition(stmt->if_conditional);
1279 __split_stmt(stmt->if_true);
1280 if (empty_statement(stmt->if_true) &&
1281 last_stmt_on_same_line() &&
1282 !get_macro_name(stmt->if_true->pos))
1283 sm_warning("if();");
1284 __push_true_states();
1285 __use_false_states();
1286 __split_stmt(stmt->if_false);
1287 __merge_true_states();
1288 break;
1289 case STMT_ITERATOR:
1290 stmt_set_parent_stmt(stmt->iterator_pre_statement, stmt);
1291 stmt_set_parent_stmt(stmt->iterator_statement, stmt);
1292 stmt_set_parent_stmt(stmt->iterator_post_statement, stmt);
1293 expr_set_parent_stmt(stmt->iterator_pre_condition, stmt);
1294 expr_set_parent_stmt(stmt->iterator_post_condition, stmt);
1295
1296 if (stmt->iterator_pre_condition)
1297 handle_pre_loop(stmt);
1298 else if (stmt->iterator_post_condition)
1299 handle_post_loop(stmt);
1300 else {
1301 // these are for(;;) type loops.
1302 handle_pre_loop(stmt);
1303 }
1304 break;
1305 case STMT_SWITCH:
1306 stmt_set_parent_stmt(stmt->switch_statement, stmt);
1307 expr_set_parent_stmt(stmt->switch_expression, stmt);
1308
1309 if (get_value(stmt->switch_expression, &sval)) {
1310 split_known_switch(stmt, sval);
1311 break;
1312 }
1313 __split_expr(stmt->switch_expression);
1314 push_expression(&switch_expr_stack, stmt->switch_expression);
1315 __save_switch_states(top_expression(switch_expr_stack));
1316 nullify_path();
1317 __push_default();
1318 __push_breaks();
1319 __split_stmt(stmt->switch_statement);
1320 if (!__pop_default() && have_remaining_cases())
1321 fake_an_empty_default(stmt->pos);
1322 __discard_switches();
1323 __merge_breaks();
1324 pop_expression(&switch_expr_stack);
1325 break;
1326 case STMT_CASE:
1327 split_case(stmt);
1328 break;
1329 case STMT_LABEL:
1330 __split_label_stmt(stmt);
1331 __split_stmt(stmt->label_statement);
1332 break;
1333 case STMT_GOTO:
1334 expr_set_parent_stmt(stmt->goto_expression, stmt);
1335
1336 __split_expr(stmt->goto_expression);
1337 if (stmt->goto_label && stmt->goto_label->type == SYM_NODE) {
1338 if (!strcmp(stmt->goto_label->ident->name, "break")) {
1339 __process_breaks();
1340 } else if (!strcmp(stmt->goto_label->ident->name,
1341 "continue")) {
1342 __process_continues();
1343 }
1344 } else if (stmt->goto_label &&
1345 stmt->goto_label->type == SYM_LABEL &&
1346 stmt->goto_label->ident) {
1347 __save_gotos(stmt->goto_label->ident->name, stmt->goto_label);
1348 }
1349 nullify_path();
1350 if (is_last_stmt(stmt))
1351 handle_backward_goto(stmt);
1352 break;
1353 case STMT_NONE:
1354 break;
1355 case STMT_ASM:
1356 expr_set_parent_stmt(stmt->asm_string, stmt);
1357
1358 find_asm_gotos(stmt);
1359 __pass_to_client(stmt, ASM_HOOK);
1360 __split_expr(stmt->asm_string);
1361 split_asm_ops(stmt->asm_outputs);
1362 split_asm_ops(stmt->asm_inputs);
1363 split_expr_list(stmt->asm_clobbers, NULL);
1364 break;
1365 case STMT_CONTEXT:
1366 break;
1367 case STMT_RANGE:
1368 __split_expr(stmt->range_expression);
1369 __split_expr(stmt->range_low);
1370 __split_expr(stmt->range_high);
1371 break;
1372 }
1373 __pass_to_client(stmt, STMT_HOOK_AFTER);
1374 if (--indent_cnt == 1)
1375 __discard_fake_states(NULL);
1376
1377 out:
1378 __process_post_op_stack();
1379
1380 gettimeofday(&stop, NULL);
1381 if (option_time_stmt && stmt)
1382 sm_msg("stmt_time%s: %ld",
1383 stmt->type == STMT_COMPOUND ? "_block" : "",
1384 stop.tv_sec - start.tv_sec);
1385 }
1386
1387 static void split_expr_list(struct expression_list *expr_list, struct expression *parent)
1388 {
1389 struct expression *expr;
1390
1391 FOR_EACH_PTR(expr_list, expr) {
1392 expr_set_parent_expr(expr, parent);
1393 __split_expr(expr);
1394 __process_post_op_stack();
1395 } END_FOR_EACH_PTR(expr);
1396 }
1397
1398 static bool cast_arg(struct symbol *type, struct expression *arg)
1399 {
1400 struct symbol *orig;
1401
1402 if (!type)
1403 return false;
1404
1405 arg = strip_parens(arg);
1406 if (arg != strip_expr(arg))
1407 return true;
1408
1409 orig = get_type(arg);
1410 if (!orig)
1411 return true;
1412 if (types_equiv(orig, type))
1413 return false;
1414
1415 if (orig->type == SYM_ARRAY && type->type == SYM_PTR)
1416 return true;
1417
1418 /*
1419 * I would have expected that we could just do use (orig == type) but I
1420 * guess for pointers we need to get the basetype to do that comparison.
1421 *
1422 */
1423
1424 if (orig->type != SYM_PTR ||
1425 type->type != SYM_PTR) {
1426 if (type_fits(type, orig))
1427 return false;
1428 return true;
1429 }
1430 orig = get_real_base_type(orig);
1431 type = get_real_base_type(type);
1432 if (orig == type)
1433 return false;
1434
1435 return true;
1436 }
1437
1438 static struct expression *fake_a_variable_assign(struct symbol *type, struct expression *call, struct expression *expr, int nr)
1439 {
1440 char buf[64];
1441 bool cast;
1442
1443 if (!expr || !cur_func_sym)
1444 return NULL;
1445
1446 if (expr->type == EXPR_ASSIGNMENT)
1447 return expr;
1448
1449 /* for va_args then we don't know the type */
1450 if (!type)
1451 type = get_type(expr);
1452
1453 cast = cast_arg(type, expr);
1454 /*
1455 * Using expr_to_sym() here is a hack. We want to say that we don't
1456 * need to assign frob(foo) or frob(foo->bar) if the types are right.
1457 * It turns out faking these assignments is way more expensive than I
1458 * would have imagined. I'm not sure why exactly.
1459 *
1460 */
1461 if (!cast) {
1462 /*
1463 * if the code is "return *p;" where "p" is a user pointer then
1464 * we want to create a fake assignment so that it sets the state
1465 * in check_kernel_user_data.c.
1466 *
1467 */
1468 if (expr->type != EXPR_PREOP &&
1469 expr->op != '*' && expr->op != '&' &&
1470 expr_to_sym(expr))
1471 return expr;
1472 }
1473
1474 if (nr == -1)
1475 snprintf(buf, sizeof(buf), "__fake_return_%p", expr);
1476 else
1477 snprintf(buf, sizeof(buf), "__fake_param_%p_%d", call, nr);
1478 return create_fake_assign(buf, type, expr);
1479 }
1480
1481 static void split_args(struct expression *expr)
1482 {
1483 struct expression *arg, *tmp;
1484 struct symbol *type;
1485 int i;
1486
1487 i = -1;
1488 FOR_EACH_PTR(expr->args, arg) {
1489 i++;
1490 expr_set_parent_expr(arg, expr);
1491 type = get_arg_type(expr->fn, i);
1492 tmp = fake_a_variable_assign(type, expr, arg, i);
1493 if (tmp != arg)
1494 __in_fake_var_assign++;
1495 __split_expr(tmp);
1496 if (tmp != arg)
1497 __in_fake_var_assign--;
1498 __process_post_op_stack();
1499 } END_FOR_EACH_PTR(arg);
1500 }
1501
1502 static void split_sym(struct symbol *sym)
1503 {
1504 if (!sym)
1505 return;
1506 if (!(sym->namespace & NS_SYMBOL))
1507 return;
1508
1509 __split_stmt(sym->stmt);
1510 __split_expr(sym->array_size);
1511 split_symlist(sym->arguments);
1512 split_symlist(sym->symbol_list);
1513 __split_stmt(sym->inline_stmt);
1514 split_symlist(sym->inline_symbol_list);
1515 }
1516
1517 static void split_symlist(struct symbol_list *sym_list)
1518 {
1519 struct symbol *sym;
1520
1521 FOR_EACH_PTR(sym_list, sym) {
1522 split_sym(sym);
1523 } END_FOR_EACH_PTR(sym);
1524 }
1525
1526 typedef void (fake_cb)(struct expression *expr);
1527
1528 static int member_to_number(struct expression *expr, struct ident *member)
1529 {
1530 struct symbol *type, *tmp;
1531 char *name;
1532 int i;
1533
1534 if (!member)
1535 return -1;
1536 name = member->name;
1537
1538 type = get_type(expr);
1539 if (!type || type->type != SYM_STRUCT)
1540 return -1;
1541
1542 i = -1;
1543 FOR_EACH_PTR(type->symbol_list, tmp) {
1544 i++;
1545 if (!tmp->ident)
1546 continue;
1547 if (strcmp(name, tmp->ident->name) == 0)
1548 return i;
1549 } END_FOR_EACH_PTR(tmp);
1550 return -1;
1551 }
1552
1553 static struct ident *number_to_member(struct expression *expr, int num)
1554 {
1555 struct symbol *type, *member;
1556 int i = 0;
1557
1558 type = get_type(expr);
1559 if (!type || type->type != SYM_STRUCT)
1560 return NULL;
1561
1562 FOR_EACH_PTR(type->symbol_list, member) {
1563 if (i == num)
1564 return member->ident;
1565 i++;
1566 } END_FOR_EACH_PTR(member);
1567 return NULL;
1568 }
1569
1570 static void fake_element_assigns_helper(struct expression *array, struct expression_list *expr_list, fake_cb *fake_cb);
1571
1572 static void set_inner_struct_members(struct expression *expr, struct symbol *member)
1573 {
1574 struct expression *edge_member, *assign;
1575 struct symbol *base = get_real_base_type(member);
1576 struct symbol *tmp;
1577
1578 if (member->ident)
1579 expr = member_expression(expr, '.', member->ident);
1580
1581 FOR_EACH_PTR(base->symbol_list, tmp) {
1582 struct symbol *type;
1583
1584 type = get_real_base_type(tmp);
1585 if (!type)
1586 continue;
1587
1588 edge_member = member_expression(expr, '.', tmp->ident);
1589 if (get_extra_state(edge_member))
1590 continue;
1591
1592 if (type->type == SYM_UNION || type->type == SYM_STRUCT) {
1593 set_inner_struct_members(expr, tmp);
1594 continue;
1595 }
1596
1597 if (!tmp->ident)
1598 continue;
1599
1600 assign = assign_expression(edge_member, '=', zero_expr());
1601 __split_expr(assign);
1602 } END_FOR_EACH_PTR(tmp);
1603
1604
1605 }
1606
1607 static void set_unset_to_zero(struct symbol *type, struct expression *expr)
1608 {
1609 struct symbol *tmp;
1610 struct expression *member = NULL;
1611 struct expression *assign;
1612
1613 FOR_EACH_PTR(type->symbol_list, tmp) {
1614 type = get_real_base_type(tmp);
1615 if (!type)
1616 continue;
1617
1618 if (tmp->ident) {
1619 member = member_expression(expr, '.', tmp->ident);
1620 if (get_extra_state(member))
1621 continue;
1622 }
1623
1624 if (type->type == SYM_UNION || type->type == SYM_STRUCT) {
1625 set_inner_struct_members(expr, tmp);
1626 continue;
1627 }
1628 if (type->type == SYM_ARRAY)
1629 continue;
1630 if (!tmp->ident)
1631 continue;
1632
1633 assign = assign_expression(member, '=', zero_expr());
1634 __split_expr(assign);
1635 } END_FOR_EACH_PTR(tmp);
1636 }
1637
1638 static void fake_member_assigns_helper(struct expression *symbol, struct expression_list *members, fake_cb *fake_cb)
1639 {
1640 struct expression *deref, *assign, *tmp, *right;
1641 struct symbol *struct_type, *type;
1642 struct ident *member;
1643 int member_idx;
1644
1645 struct_type = get_type(symbol);
1646 if (!struct_type ||
1647 (struct_type->type != SYM_STRUCT && struct_type->type != SYM_UNION))
1648 return;
1649
1650 /*
1651 * We're parsing an initializer that could look something like this:
1652 * struct foo foo = {
1653 * 42,
1654 * .whatever.xxx = 11,
1655 * .zzz = 12,
1656 * };
1657 *
1658 * So what we have here is a list with 42, .whatever, and .zzz. We need
1659 * to break it up into left and right sides of the assignments.
1660 *
1661 */
1662 member_idx = 0;
1663 FOR_EACH_PTR(members, tmp) {
1664 deref = NULL;
1665 if (tmp->type == EXPR_IDENTIFIER) {
1666 member_idx = member_to_number(symbol, tmp->expr_ident);
1667 while (tmp->type == EXPR_IDENTIFIER) {
1668 member = tmp->expr_ident;
1669 tmp = tmp->ident_expression;
1670 if (deref)
1671 deref = member_expression(deref, '.', member);
1672 else
1673 deref = member_expression(symbol, '.', member);
1674 }
1675 } else {
1676 member = number_to_member(symbol, member_idx);
1677 deref = member_expression(symbol, '.', member);
1678 }
1679 right = tmp;
1680 member_idx++;
1681 if (right->type == EXPR_INITIALIZER) {
1682 type = get_type(deref);
1683 if (type && type->type == SYM_ARRAY)
1684 fake_element_assigns_helper(deref, right->expr_list, fake_cb);
1685 else
1686 fake_member_assigns_helper(deref, right->expr_list, fake_cb);
1687 } else {
1688 assign = assign_expression(deref, '=', right);
1689 fake_cb(assign);
1690 }
1691 } END_FOR_EACH_PTR(tmp);
1692
1693 set_unset_to_zero(struct_type, symbol);
1694 }
1695
1696 static void fake_member_assigns(struct symbol *sym, fake_cb *fake_cb)
1697 {
1698 fake_member_assigns_helper(symbol_expression(sym),
1699 sym->initializer->expr_list, fake_cb);
1700 }
1701
1702 static void fake_element_assigns_helper(struct expression *array, struct expression_list *expr_list, fake_cb *fake_cb)
1703 {
1704 struct expression *offset, *binop, *assign, *tmp;
1705 struct symbol *type;
1706 int idx, max;
1707
1708 if (ptr_list_size((struct ptr_list *)expr_list) > 1000)
1709 return;
1710
1711 max = 0;
1712 idx = 0;
1713 FOR_EACH_PTR(expr_list, tmp) {
1714 if (tmp->type == EXPR_INDEX) {
1715 if (tmp->idx_from != tmp->idx_to)
1716 return;
1717 idx = tmp->idx_from;
1718 if (idx > max)
1719 max = idx;
1720 if (!tmp->idx_expression)
1721 goto next;
1722 tmp = tmp->idx_expression;
1723 }
1724 offset = value_expr(idx);
1725 binop = array_element_expression(array, offset);
1726 if (tmp->type == EXPR_INITIALIZER) {
1727 type = get_type(binop);
1728 if (type && type->type == SYM_ARRAY)
1729 fake_element_assigns_helper(binop, tmp->expr_list, fake_cb);
1730 else
1731 fake_member_assigns_helper(binop, tmp->expr_list, fake_cb);
1732 } else {
1733 assign = assign_expression(binop, '=', tmp);
1734 fake_cb(assign);
1735 }
1736 next:
1737 idx++;
1738 if (idx > max)
1739 max = idx;
1740 } END_FOR_EACH_PTR(tmp);
1741
1742 __call_array_initialized_hooks(array, max);
1743 }
1744
1745 static void fake_element_assigns(struct symbol *sym, fake_cb *fake_cb)
1746 {
1747 fake_element_assigns_helper(symbol_expression(sym), sym->initializer->expr_list, fake_cb);
1748 }
1749
1750 static void fake_assign_expr(struct symbol *sym)
1751 {
1752 struct expression *assign, *symbol;
1753
1754 symbol = symbol_expression(sym);
1755 assign = assign_expression(symbol, '=', sym->initializer);
1756 __split_expr(assign);
1757 }
1758
1759 static void do_initializer_stuff(struct symbol *sym)
1760 {
1761 if (!sym->initializer)
1762 return;
1763
1764 if (sym->initializer->type == EXPR_INITIALIZER) {
1765 if (get_real_base_type(sym)->type == SYM_ARRAY)
1766 fake_element_assigns(sym, __split_expr);
1767 else
1768 fake_member_assigns(sym, __split_expr);
1769 } else {
1770 fake_assign_expr(sym);
1771 }
1772 }
1773
1774 static void split_declaration(struct symbol_list *sym_list)
1775 {
1776 struct symbol *sym;
1777
1778 FOR_EACH_PTR(sym_list, sym) {
1779 __pass_to_client(sym, DECLARATION_HOOK);
1780 do_initializer_stuff(sym);
1781 __pass_to_client(sym, DECLARATION_HOOK_AFTER);
1782 split_sym(sym);
1783 } END_FOR_EACH_PTR(sym);
1784 }
1785
1786 static void call_global_assign_hooks(struct expression *assign)
1787 {
1788 __pass_to_client(assign, GLOBAL_ASSIGNMENT_HOOK);
1789 }
1790
1791 static void fake_global_assign(struct symbol *sym)
1792 {
1793 struct expression *assign, *symbol;
1794
1795 if (get_real_base_type(sym)->type == SYM_ARRAY) {
1796 if (sym->initializer && sym->initializer->type == EXPR_INITIALIZER) {
1797 fake_element_assigns(sym, call_global_assign_hooks);
1798 } else if (sym->initializer) {
1799 symbol = symbol_expression(sym);
1800 assign = assign_expression(symbol, '=', sym->initializer);
1801 __pass_to_client(assign, GLOBAL_ASSIGNMENT_HOOK);
1802 } else {
1803 fake_element_assigns_helper(symbol_expression(sym), NULL, call_global_assign_hooks);
1804 }
1805 } else if (get_real_base_type(sym)->type == SYM_STRUCT) {
1806 if (sym->initializer && sym->initializer->type == EXPR_INITIALIZER) {
1807 fake_member_assigns(sym, call_global_assign_hooks);
1808 } else if (sym->initializer) {
1809 symbol = symbol_expression(sym);
1810 assign = assign_expression(symbol, '=', sym->initializer);
1811 __pass_to_client(assign, GLOBAL_ASSIGNMENT_HOOK);
1812 } else {
1813 fake_member_assigns_helper(symbol_expression(sym), NULL, call_global_assign_hooks);
1814 }
1815 } else {
1816 symbol = symbol_expression(sym);
1817 if (sym->initializer) {
1818 assign = assign_expression(symbol, '=', sym->initializer);
1819 __split_expr(assign);
1820 } else {
1821 assign = assign_expression(symbol, '=', zero_expr());
1822 }
1823 __pass_to_client(assign, GLOBAL_ASSIGNMENT_HOOK);
1824 }
1825 }
1826
1827 static void start_function_definition(struct symbol *sym)
1828 {
1829 __in_function_def = 1;
1830 __pass_to_client(sym, FUNC_DEF_HOOK);
1831 __in_function_def = 0;
1832 __pass_to_client(sym, AFTER_DEF_HOOK);
1833
1834 }
1835
1836 void add_function_data(unsigned long *fn_data)
1837 {
1838 __add_ptr_list(&fn_data_list, fn_data);
1839 }
1840
1841 static void clear_function_data(void)
1842 {
1843 unsigned long *tmp;
1844
1845 FOR_EACH_PTR(fn_data_list, tmp) {
1846 *tmp = 0;
1847 } END_FOR_EACH_PTR(tmp);
1848 }
1849
1850 static void record_func_time(void)
1851 {
1852 struct timeval stop;
1853 int func_time;
1854 char buf[32];
1855
1856 gettimeofday(&stop, NULL);
1857 func_time = stop.tv_sec - fn_start_time.tv_sec;
1858 snprintf(buf, sizeof(buf), "%d", func_time);
1859 sql_insert_return_implies(FUNC_TIME, 0, "", buf);
1860 if (option_time && func_time > 2) {
1861 final_pass++;
1862 sm_msg("func_time: %d", func_time);
1863 final_pass--;
1864 }
1865 }
1866
1867 static void split_function(struct symbol *sym)
1868 {
1869 struct symbol *base_type = get_base_type(sym);
1870
1871 if (!base_type->stmt && !base_type->inline_stmt)
1872 return;
1873
1874 gettimeofday(&outer_fn_start_time, NULL);
1875 gettimeofday(&fn_start_time, NULL);
1876 cur_func_sym = sym;
1877 if (sym->ident)
1878 cur_func = sym->ident->name;
1879 set_position(sym->pos);
1880 clear_function_data();
1881 loop_count = 0;
1882 last_goto_statement_handled = 0;
1883 sm_debug("new function: %s\n", cur_func);
1884 __stree_id = 0;
1885 if (option_two_passes) {
1886 __unnullify_path();
1887 loop_num = 0;
1888 final_pass = 0;
1889 start_function_definition(sym);
1890 __split_stmt(base_type->stmt);
1891 __split_stmt(base_type->inline_stmt);
1892 nullify_path();
1893 }
1894 __unnullify_path();
1895 loop_num = 0;
1896 final_pass = 1;
1897 start_function_definition(sym);
1898 __split_stmt(base_type->stmt);
1899 __split_stmt(base_type->inline_stmt);
1900 if (!__path_is_null() &&
1901 cur_func_return_type() == &void_ctype &&
1902 !__bail_on_rest_of_function) {
1903 __pass_to_client(NULL, RETURN_HOOK);
1904 nullify_path();
1905 }
1906 __pass_to_client(sym, END_FUNC_HOOK);
1907 if (need_delayed_scope_hooks())
1908 __call_scope_hooks();
1909 __pass_to_client(sym, AFTER_FUNC_HOOK);
1910 sym->parsed = true;
1911
1912 clear_all_states();
1913
1914 record_func_time();
1915
1916 cur_func_sym = NULL;
1917 cur_func = NULL;
1918 free_data_info_allocs();
1919 free_expression_stack(&switch_expr_stack);
1920 __free_ptr_list((struct ptr_list **)&big_statement_stack);
1921 __bail_on_rest_of_function = 0;
1922 }
1923
1924 static void save_flow_state(void)
1925 {
1926 unsigned long *tmp;
1927
1928 __add_ptr_list(&backup, INT_PTR(loop_num << 2));
1929 __add_ptr_list(&backup, INT_PTR(loop_count << 2));
1930 __add_ptr_list(&backup, INT_PTR(final_pass << 2));
1931
1932 __add_ptr_list(&backup, big_statement_stack);
1933 __add_ptr_list(&backup, big_expression_stack);
1934 __add_ptr_list(&backup, big_condition_stack);
1935 __add_ptr_list(&backup, switch_expr_stack);
1936
1937 __add_ptr_list(&backup, cur_func_sym);
1938
1939 __add_ptr_list(&backup, __prev_stmt);
1940 __add_ptr_list(&backup, __cur_stmt);
1941 __add_ptr_list(&backup, __next_stmt);
1942
1943 FOR_EACH_PTR(fn_data_list, tmp) {
1944 __add_ptr_list(&backup, (void *)*tmp);
1945 } END_FOR_EACH_PTR(tmp);
1946 }
1947
1948 static void *pop_backup(void)
1949 {
1950 void *ret;
1951
1952 ret = last_ptr_list(backup);
1953 delete_ptr_list_last(&backup);
1954 return ret;
1955 }
1956
1957 static void restore_flow_state(void)
1958 {
1959 unsigned long *tmp;
1960
1961 FOR_EACH_PTR_REVERSE(fn_data_list, tmp) {
1962 *tmp = (unsigned long)pop_backup();
1963 } END_FOR_EACH_PTR_REVERSE(tmp);
1964
1965 __next_stmt = pop_backup();
1966 __cur_stmt = pop_backup();
1967 __prev_stmt = pop_backup();
1968
1969 cur_func_sym = pop_backup();
1970 switch_expr_stack = pop_backup();
1971 big_condition_stack = pop_backup();
1972 big_expression_stack = pop_backup();
1973 big_statement_stack = pop_backup();
1974 final_pass = PTR_INT(pop_backup()) >> 2;
1975 loop_count = PTR_INT(pop_backup()) >> 2;
1976 loop_num = PTR_INT(pop_backup()) >> 2;
1977 }
1978
1979 static void parse_inline(struct expression *call)
1980 {
1981 struct symbol *base_type;
1982 char *cur_func_bak = cur_func; /* not aligned correctly for backup */
1983 struct timeval time_backup = fn_start_time;
1984 struct expression *orig_inline = __inline_fn;
1985 int orig_budget;
1986
1987 if (out_of_memory() || taking_too_long())
1988 return;
1989
1990 save_flow_state();
1991
1992 __pass_to_client(call, INLINE_FN_START);
1993 final_pass = 0; /* don't print anything */
1994 __inline_fn = call;
1995 orig_budget = inline_budget;
1996 inline_budget = inline_budget - 5;
1997
1998 base_type = get_base_type(call->fn->symbol);
1999 cur_func_sym = call->fn->symbol;
2000 if (call->fn->symbol->ident)
2001 cur_func = call->fn->symbol->ident->name;
2002 else
2003 cur_func = NULL;
2004 set_position(call->fn->symbol->pos);
2005
2006 save_all_states();
2007 big_statement_stack = NULL;
2008 big_expression_stack = NULL;
2009 big_condition_stack = NULL;
2010 switch_expr_stack = NULL;
2011
2012 sm_debug("inline function: %s\n", cur_func);
2013 __unnullify_path();
2014 clear_function_data();
2015 loop_num = 0;
2016 loop_count = 0;
2017 start_function_definition(call->fn->symbol);
2018 __split_stmt(base_type->stmt);
2019 __split_stmt(base_type->inline_stmt);
2020 __pass_to_client(call->fn->symbol, END_FUNC_HOOK);
2021 __pass_to_client(call->fn->symbol, AFTER_FUNC_HOOK);
2022 call->fn->symbol->parsed = true;
2023
2024 free_expression_stack(&switch_expr_stack);
2025 __free_ptr_list((struct ptr_list **)&big_statement_stack);
2026 nullify_path();
2027 free_goto_stack();
2028
2029 restore_flow_state();
2030 fn_start_time = time_backup;
2031 cur_func = cur_func_bak;
2032
2033 restore_all_states();
2034 set_position(call->pos);
2035 __inline_fn = orig_inline;
2036 inline_budget = orig_budget;
2037 __pass_to_client(call, INLINE_FN_END);
2038 }
2039
2040 static struct symbol_list *inlines_called;
2041 static void add_inline_function(struct symbol *sym)
2042 {
2043 static struct symbol_list *already_added;
2044 struct symbol *tmp;
2045
2046 FOR_EACH_PTR(already_added, tmp) {
2047 if (tmp == sym)
2048 return;
2049 } END_FOR_EACH_PTR(tmp);
2050
2051 add_ptr_list(&already_added, sym);
2052 add_ptr_list(&inlines_called, sym);
2053 }
2054
2055 static void process_inlines(void)
2056 {
2057 struct symbol *tmp;
2058
2059 FOR_EACH_PTR(inlines_called, tmp) {
2060 split_function(tmp);
2061 } END_FOR_EACH_PTR(tmp);
2062 free_ptr_list(&inlines_called);
2063 }
2064
2065 static struct symbol *get_last_scoped_symbol(struct symbol_list *big_list, int use_static)
2066 {
2067 struct symbol *sym;
2068
2069 FOR_EACH_PTR_REVERSE(big_list, sym) {
2070 if (!sym->scope)
2071 continue;
2072 if (use_static && sym->ctype.modifiers & MOD_STATIC)
2073 return sym;
2074 if (!use_static && !(sym->ctype.modifiers & MOD_STATIC))
2075 return sym;
2076 } END_FOR_EACH_PTR_REVERSE(sym);
2077
2078 return NULL;
2079 }
2080
2081 static bool interesting_function(struct symbol *sym)
2082 {
2083 static int prev_stream = -1;
2084 static bool prev_answer;
2085 const char *filename;
2086 int len;
2087
2088 if (!(sym->ctype.modifiers & MOD_INLINE))
2089 return true;
2090
2091 if (sym->pos.stream == prev_stream)
2092 return prev_answer;
2093
2094 prev_stream = sym->pos.stream;
2095 prev_answer = false;
2096
2097 filename = stream_name(sym->pos.stream);
2098 len = strlen(filename);
2099 if (len > 0 && filename[len - 1] == 'c')
2100 prev_answer = true;
2101 return prev_answer;
2102 }
2103
2104 static void split_inlines_in_scope(struct symbol *sym)
2105 {
2106 struct symbol *base;
2107 struct symbol_list *scope_list;
2108 int stream;
2109
2110 scope_list = sym->scope->symbols;
2111 stream = sym->pos.stream;
2112
2113 /* find the last static symbol in the file */
2114 FOR_EACH_PTR_REVERSE(scope_list, sym) {
2115 if (sym->pos.stream != stream)
2116 continue;
2117 if (sym->type != SYM_NODE)
2118 continue;
2119 base = get_base_type(sym);
2120 if (!base)
2121 continue;
2122 if (base->type != SYM_FN)
2123 continue;
2124 if (!base->inline_stmt)
2125 continue;
2126 if (!interesting_function(sym))
2127 continue;
2128 add_inline_function(sym);
2129 } END_FOR_EACH_PTR_REVERSE(sym);
2130
2131 process_inlines();
2132 }
2133
2134 static void split_inlines(struct symbol_list *sym_list)
2135 {
2136 struct symbol *sym;
2137
2138 sym = get_last_scoped_symbol(sym_list, 0);
2139 if (sym)
2140 split_inlines_in_scope(sym);
2141 sym = get_last_scoped_symbol(sym_list, 1);
2142 if (sym)
2143 split_inlines_in_scope(sym);
2144 }
2145
2146 static struct stree *clone_estates_perm(struct stree *orig)
2147 {
2148 struct stree *ret = NULL;
2149 struct sm_state *tmp;
2150
2151 FOR_EACH_SM(orig, tmp) {
2152 set_state_stree_perm(&ret, tmp->owner, tmp->name, tmp->sym, clone_estate_perm(tmp->state));
2153 } END_FOR_EACH_SM(tmp);
2154
2155 return ret;
2156 }
2157
2158 struct position last_pos;
2159 static void split_c_file_functions(struct symbol_list *sym_list)
2160 {
2161 struct symbol *sym;
2162
2163 __unnullify_path();
2164 FOR_EACH_PTR(sym_list, sym) {
2165 set_position(sym->pos);
2166 if (sym->type != SYM_NODE || get_base_type(sym)->type != SYM_FN) {
2167 __pass_to_client(sym, BASE_HOOK);
2168 fake_global_assign(sym);
2169 __pass_to_client(sym, DECLARATION_HOOK_AFTER);
2170 }
2171 } END_FOR_EACH_PTR(sym);
2172 global_states = clone_estates_perm(get_all_states_stree(SMATCH_EXTRA));
2173 nullify_path();
2174
2175 FOR_EACH_PTR(sym_list, sym) {
2176 set_position(sym->pos);
2177 last_pos = sym->pos;
2178 if (!interesting_function(sym))
2179 continue;
2180 if (sym->type == SYM_NODE && get_base_type(sym)->type == SYM_FN) {
2181 split_function(sym);
2182 process_inlines();
2183 }
2184 last_pos = sym->pos;
2185 } END_FOR_EACH_PTR(sym);
2186 split_inlines(sym_list);
2187 __pass_to_client(sym_list, END_FILE_HOOK);
2188 }
2189
2190 static int final_before_fake;
2191 void init_fake_env(void)
2192 {
2193 if (!in_fake_env)
2194 final_before_fake = final_pass;
2195 in_fake_env++;
2196 __push_fake_cur_stree();
2197 final_pass = 0;
2198 }
2199
2200 void end_fake_env(void)
2201 {
2202 __free_fake_cur_stree();
2203 in_fake_env--;
2204 if (!in_fake_env)
2205 final_pass = final_before_fake;
2206 }
2207
2208 static void open_output_files(char *base_file)
2209 {
2210 char buf[256];
2211
2212 snprintf(buf, sizeof(buf), "%s.smatch", base_file);
2213 sm_outfd = fopen(buf, "w");
2214 if (!sm_outfd)
2215 sm_fatal("Cannot open %s", buf);
2216
2217 if (!option_info)
2218 return;
2219
2220 snprintf(buf, sizeof(buf), "%s.smatch.sql", base_file);
2221 sql_outfd = fopen(buf, "w");
2222 if (!sql_outfd)
2223 sm_fatal("Error: Cannot open %s", buf);
2224
2225 snprintf(buf, sizeof(buf), "%s.smatch.caller_info", base_file);
2226 caller_info_fd = fopen(buf, "w");
2227 if (!caller_info_fd)
2228 sm_fatal("Error: Cannot open %s", buf);
2229 }
2230
2231 void smatch(struct string_list *filelist)
2232 {
2233 struct symbol_list *sym_list;
2234 struct timeval stop, start;
2235 char *path;
2236 int len;
2237
2238 gettimeofday(&start, NULL);
2239
2240 FOR_EACH_PTR_NOTAG(filelist, base_file) {
2241 path = getcwd(NULL, 0);
2242 free(full_base_file);
2243 if (path) {
2244 len = strlen(path) + 1 + strlen(base_file) + 1;
2245 full_base_file = malloc(len);
2246 snprintf(full_base_file, len, "%s/%s", path, base_file);
2247 } else {
2248 full_base_file = alloc_string(base_file);
2249 }
2250 if (option_file_output)
2251 open_output_files(base_file);
2252 base_file_stream = input_stream_nr;
2253 sym_list = sparse_keep_tokens(base_file);
2254 split_c_file_functions(sym_list);
2255 } END_FOR_EACH_PTR_NOTAG(base_file);
2256
2257 gettimeofday(&stop, NULL);
2258
2259 set_position(last_pos);
2260 final_pass = 1;
2261 if (option_time)
2262 sm_msg("time: %lu", stop.tv_sec - start.tv_sec);
2263 if (option_mem)
2264 sm_msg("mem: %luKb", get_max_memory());
2265 }
Static analysis for C