2 * Copyright (C) 2006 Dan Carpenter.
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.
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.
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
28 struct hook_container
{
33 ALLOCATOR(hook_container
, "hook functions");
34 DECLARE_PTR_LIST(hook_func_list
, struct hook_container
);
36 typedef void (expr_func
)(struct expression
*expr
);
37 typedef void (stmt_func
)(struct statement
*stmt
);
38 typedef void (sym_func
)(struct symbol
*sym
);
39 typedef void (sym_list_func
)(struct symbol_list
*sym_list
);
41 static struct hook_func_list
*merge_funcs
;
42 static struct hook_func_list
*unmatched_state_funcs
;
43 static struct hook_func_list
*hook_array
[NUM_HOOKS
] = {};
44 static const enum data_type data_types
[NUM_HOOKS
] = {
45 [EXPR_HOOK
] = EXPR_PTR
,
46 [EXPR_HOOK_AFTER
] = EXPR_PTR
,
47 [STMT_HOOK
] = STMT_PTR
,
48 [STMT_HOOK_AFTER
] = STMT_PTR
,
49 [SYM_HOOK
] = EXPR_PTR
,
50 [STRING_HOOK
] = EXPR_PTR
,
51 [DECLARATION_HOOK
] = SYMBOL_PTR
,
52 [ASSIGNMENT_HOOK
] = EXPR_PTR
,
53 [ASSIGNMENT_HOOK_AFTER
] = EXPR_PTR
,
54 [RAW_ASSIGNMENT_HOOK
] = EXPR_PTR
,
55 [GLOBAL_ASSIGNMENT_HOOK
] = EXPR_PTR
,
56 [CALL_ASSIGNMENT_HOOK
] = EXPR_PTR
,
57 [MACRO_ASSIGNMENT_HOOK
] = EXPR_PTR
,
58 [BINOP_HOOK
] = EXPR_PTR
,
60 [LOGIC_HOOK
] = EXPR_PTR
,
61 [PRELOOP_HOOK
] = STMT_PTR
,
62 [CONDITION_HOOK
] = EXPR_PTR
,
63 [SELECT_HOOK
] = EXPR_PTR
,
64 [WHOLE_CONDITION_HOOK
] = EXPR_PTR
,
65 [FUNCTION_CALL_HOOK
] = EXPR_PTR
,
66 [CALL_HOOK_AFTER_INLINE
] = EXPR_PTR
,
67 [FUNCTION_CALL_HOOK_AFTER_DB
] = EXPR_PTR
,
68 [DEREF_HOOK
] = EXPR_PTR
,
69 [CASE_HOOK
] = NO_DATA
,
70 [ASM_HOOK
] = STMT_PTR
,
71 [CAST_HOOK
] = EXPR_PTR
,
72 [SIZEOF_HOOK
] = EXPR_PTR
,
73 [BASE_HOOK
] = SYMBOL_PTR
,
74 [FUNC_DEF_HOOK
] = SYMBOL_PTR
,
75 [AFTER_DEF_HOOK
] = SYMBOL_PTR
,
76 [END_FUNC_HOOK
] = SYMBOL_PTR
,
77 [AFTER_FUNC_HOOK
] = SYMBOL_PTR
,
78 [RETURN_HOOK
] = EXPR_PTR
,
79 [INLINE_FN_START
] = EXPR_PTR
,
80 [INLINE_FN_END
] = EXPR_PTR
,
81 [END_FILE_HOOK
] = SYM_LIST_PTR
,
84 void (**pre_merge_hooks
)(struct sm_state
*cur
, struct sm_state
*other
);
86 struct scope_container
{
90 ALLOCATOR(scope_container
, "scope hook functions");
91 DECLARE_PTR_LIST(scope_hook_list
, struct scope_container
);
92 DECLARE_PTR_LIST(scope_hook_stack
, struct scope_hook_list
);
93 static struct scope_hook_stack
*scope_hooks
;
95 void add_hook(void *func
, enum hook_type type
)
97 struct hook_container
*container
= __alloc_hook_container(0);
99 container
->hook_type
= type
;
100 container
->fn
= func
;
102 add_ptr_list(&hook_array
[type
], container
);
105 void add_merge_hook(int client_id
, merge_func_t
*func
)
107 struct hook_container
*container
= __alloc_hook_container(0);
108 container
->owner
= client_id
;
109 container
->fn
= func
;
110 add_ptr_list(&merge_funcs
, container
);
113 void add_unmatched_state_hook(int client_id
, unmatched_func_t
*func
)
115 struct hook_container
*container
= __alloc_hook_container(0);
116 container
->owner
= client_id
;
117 container
->fn
= func
;
118 add_ptr_list(&unmatched_state_funcs
, container
);
121 void add_pre_merge_hook(int client_id
, void (*hook
)(struct sm_state
*cur
, struct sm_state
*other
))
123 pre_merge_hooks
[client_id
] = hook
;
126 static void pass_expr_to_client(void *fn
, void *data
)
128 ((expr_func
*)fn
)((struct expression
*)data
);
131 static void pass_stmt_to_client(void *fn
, void *data
)
133 ((stmt_func
*)fn
)((struct statement
*)data
);
136 static void pass_sym_to_client(void *fn
, void *data
)
138 ((sym_func
*)fn
)((struct symbol
*)data
);
141 static void pass_sym_list_to_client(void *fn
, void *data
)
143 ((sym_list_func
*)fn
)((struct symbol_list
*)data
);
146 void __pass_to_client(void *data
, enum hook_type type
)
148 struct hook_container
*container
;
150 FOR_EACH_PTR(hook_array
[type
], container
) {
151 switch (data_types
[type
]) {
153 pass_expr_to_client(container
->fn
, data
);
156 pass_stmt_to_client(container
->fn
, data
);
159 pass_sym_to_client(container
->fn
, data
);
162 pass_sym_list_to_client(container
->fn
, data
);
165 } END_FOR_EACH_PTR(container
);
168 void __pass_case_to_client(struct expression
*switch_expr
,
169 struct range_list
*rl
)
171 typedef void (case_func
)(struct expression
*switch_expr
,
172 struct range_list
*rl
);
173 struct hook_container
*container
;
175 FOR_EACH_PTR(hook_array
[CASE_HOOK
], container
) {
176 ((case_func
*)container
->fn
)(switch_expr
, rl
);
177 } END_FOR_EACH_PTR(container
);
180 int __has_merge_function(int client_id
)
182 struct hook_container
*tmp
;
184 FOR_EACH_PTR(merge_funcs
, tmp
) {
185 if (tmp
->owner
== client_id
)
187 } END_FOR_EACH_PTR(tmp
);
191 struct smatch_state
*__client_merge_function(int owner
,
192 struct smatch_state
*s1
,
193 struct smatch_state
*s2
)
195 struct smatch_state
*tmp_state
;
196 struct hook_container
*tmp
;
198 /* Pass NULL states first and the rest alphabetically by name */
199 if (!s2
|| (s1
&& strcmp(s2
->name
, s1
->name
) < 0)) {
205 FOR_EACH_PTR(merge_funcs
, tmp
) {
206 if (tmp
->owner
== owner
)
207 return ((merge_func_t
*)tmp
->fn
)(s1
, s2
);
208 } END_FOR_EACH_PTR(tmp
);
212 struct smatch_state
*__client_unmatched_state_function(struct sm_state
*sm
)
214 struct hook_container
*tmp
;
216 FOR_EACH_PTR(unmatched_state_funcs
, tmp
) {
217 if (tmp
->owner
== sm
->owner
)
218 return ((unmatched_func_t
*)tmp
->fn
)(sm
);
219 } END_FOR_EACH_PTR(tmp
);
223 void call_pre_merge_hook(struct sm_state
*cur
, struct sm_state
*other
)
225 if (cur
->owner
>= num_checks
)
228 if (pre_merge_hooks
[cur
->owner
])
229 pre_merge_hooks
[cur
->owner
](cur
, other
);
232 static struct scope_hook_list
*pop_scope_hook_list(struct scope_hook_stack
**stack
)
234 struct scope_hook_list
*hook_list
;
236 hook_list
= last_ptr_list((struct ptr_list
*)*stack
);
237 delete_ptr_list_last((struct ptr_list
**)stack
);
241 static void push_scope_hook_list(struct scope_hook_stack
**stack
, struct scope_hook_list
*l
)
243 add_ptr_list(stack
, l
);
246 void add_scope_hook(scope_hook
*fn
, void *data
)
248 struct scope_hook_list
*hook_list
;
249 struct scope_container
*new;
253 hook_list
= pop_scope_hook_list(&scope_hooks
);
254 new = __alloc_scope_container(0);
257 add_ptr_list(&hook_list
, new);
258 push_scope_hook_list(&scope_hooks
, hook_list
);
261 void __push_scope_hooks(void)
263 push_scope_hook_list(&scope_hooks
, NULL
);
266 void __call_scope_hooks(void)
268 struct scope_hook_list
*hook_list
;
269 struct scope_container
*tmp
;
274 hook_list
= pop_scope_hook_list(&scope_hooks
);
275 FOR_EACH_PTR(hook_list
, tmp
) {
276 ((scope_hook
*)tmp
->fn
)(tmp
->data
);
277 __free_scope_container(tmp
);
278 } END_FOR_EACH_PTR(tmp
);
281 void allocate_hook_memory(void)
283 pre_merge_hooks
= malloc(num_checks
* sizeof(*pre_merge_hooks
));
284 memset(pre_merge_hooks
, 0, num_checks
* sizeof(*pre_merge_hooks
));