2 * sparse/check_locking.c
4 * Copyright (C) 2009 Dan Carpenter.
6 * Licensed under the Open Software License version 1.1
11 * This test checks that locks are held the same across all returns.
13 * Of course, some functions are designed to only hold the locks on success.
14 * Oh well... We can rewrite it later if we want.
19 #include "smatch_slist.h"
21 static const char *lock_funcs
[] = {
27 "_spin_lock_irqsave_nested",
34 "_write_lock_irqsave",
43 static const char *unlock_funcs
[] = {
45 "_spin_unlock_irqrestore",
50 "_read_unlock_irqrestore",
54 "_write_unlock_irqrestore",
62 /* These are return 1 if they aquire the lock */
63 static const char *conditional_funcs
[] = {
68 "generic__raw_read_trylock",
74 "__raw_write_trylock",
75 "__raw_write_trylock",
80 /* These functions return 0 on success */
81 static const char *reverse_cond_funcs
[] = {
87 /* todo still need to handle__raw_spin_is_locked */
95 static struct locked_call lock_needed
[] = {
96 {"tty_ldisc_ref_wait", "tty_ldisc_lock"},
101 static struct tracker_list
*starts_locked
;
102 static struct tracker_list
*starts_unlocked
;
104 struct locks_on_return
{
106 struct tracker_list
*locked
;
107 struct tracker_list
*unlocked
;
109 DECLARE_PTR_LIST(return_list
, struct locks_on_return
);
110 static struct return_list
*all_returns
;
116 * merge_func() is used merging NULL and a state should be merge plus
117 * the state that the function was originally called with. This way
118 * we can sometimes avoid being &undefined.
120 static struct smatch_state
*merge_func(const char *name
, struct symbol
*sym
,
121 struct smatch_state
*s1
,
122 struct smatch_state
*s2
)
129 if (in_tracker_list(starts_locked
, name
, my_id
, sym
))
131 if (in_tracker_list(starts_unlocked
, name
, my_id
, sym
))
133 if (is_locked
&& is_unlocked
)
135 if (s2
== &locked
&& is_locked
)
137 if (s2
== &unlocked
&& is_unlocked
)
142 static char *match_func(const char *list
[], char *fn_name
,
143 struct expression_list
*args
)
145 struct expression
*lock_expr
;
148 for (i
= 0; list
[i
]; i
++) {
149 if (!strcmp(fn_name
, list
[i
])) {
150 lock_expr
= get_argument_from_call_expr(args
, 0);
151 return get_variable_from_expr(lock_expr
, NULL
);
157 static char kernel
[] = "kernel";
158 static char *match_lock_func(char *fn_name
, struct expression_list
*args
)
162 arg
= match_func(lock_funcs
, fn_name
, args
);
165 if (!strcmp(fn_name
, "lock_kernel"))
166 return alloc_string(kernel
);
170 static char *match_unlock_func(char *fn_name
, struct expression_list
*args
)
174 arg
= match_func(unlock_funcs
, fn_name
, args
);
177 if (!strcmp(fn_name
, "unlock_kernel"))
178 return alloc_string(kernel
);
182 static void check_locks_needed(const char *fn_name
)
184 struct smatch_state
*state
;
187 for (i
= 0; i
< sizeof(lock_needed
)/sizeof(struct locked_call
); i
++) {
188 if (!strcmp(fn_name
, lock_needed
[i
].function
)) {
189 state
= get_state(lock_needed
[i
].lock
, my_id
, NULL
);
190 if (state
!= &locked
) {
191 smatch_msg("error: %s called without holding '%s' lock",
192 lock_needed
[i
].function
,
193 lock_needed
[i
].lock
);
199 static void match_call(struct expression
*expr
)
205 fn_name
= get_variable_from_expr(expr
->fn
, NULL
);
209 if ((lock_name
= match_lock_func(fn_name
, expr
->args
))) {
210 sm
= get_sm_state(lock_name
, my_id
, NULL
);
212 add_tracker(&starts_unlocked
, lock_name
, my_id
, NULL
);
213 if (sm
&& slist_has_state(sm
->possible
, &locked
))
214 smatch_msg("error: double lock '%s'", lock_name
);
215 set_state(lock_name
, my_id
, NULL
, &locked
);
216 } else if ((lock_name
= match_unlock_func(fn_name
, expr
->args
))) {
217 sm
= get_sm_state(lock_name
, my_id
, NULL
);
219 add_tracker(&starts_locked
, lock_name
, my_id
, NULL
);
220 if (sm
&& slist_has_state(sm
->possible
, &unlocked
))
221 smatch_msg("error: double unlock '%s'", lock_name
);
222 set_state(lock_name
, my_id
, NULL
, &unlocked
);
224 check_locks_needed(fn_name
);
225 free_string(lock_name
);
226 free_string(fn_name
);
230 static void match_condition(struct expression
*expr
)
235 if (expr
->type
!= EXPR_CALL
)
238 fn_name
= get_variable_from_expr(expr
->fn
, NULL
);
242 if ((lock_name
= match_func(conditional_funcs
, fn_name
, expr
->args
))) {
243 if (!get_state(lock_name
, my_id
, NULL
))
244 add_tracker(&starts_unlocked
, lock_name
, my_id
, NULL
);
245 set_true_false_states(lock_name
, my_id
, NULL
, &locked
, &unlocked
);
247 if ((lock_name
= match_func(reverse_cond_funcs
, fn_name
, expr
->args
))) {
248 if (!get_state(lock_name
, my_id
, NULL
))
249 add_tracker(&starts_unlocked
, lock_name
, my_id
, NULL
);
250 set_true_false_states(lock_name
, my_id
, NULL
, &unlocked
, &locked
);
252 free_string(lock_name
);
253 free_string(fn_name
);
257 static struct locks_on_return
*alloc_return(int line
)
259 struct locks_on_return
*ret
;
261 ret
= malloc(sizeof(*ret
));
264 ret
->unlocked
= NULL
;
268 static void check_possible(struct sm_state
*sm
)
270 struct sm_state
*tmp
;
275 FOR_EACH_PTR(sm
->possible
, tmp
) {
276 if (tmp
->state
== &locked
)
278 else if (tmp
->state
== &unlocked
)
280 else if (tmp
->state
== &undefined
)
282 } END_FOR_EACH_PTR(tmp
);
283 if ((islocked
&& isunlocked
) || undef
)
284 smatch_msg("warn: '%s' is sometimes locked here and "
285 "sometimes unlocked.", sm
->name
);
288 static void match_return(struct statement
*stmt
)
290 struct locks_on_return
*ret
;
291 struct state_list
*slist
;
292 struct sm_state
*tmp
;
294 ret
= alloc_return(get_lineno());
296 slist
= get_all_states(my_id
);
297 FOR_EACH_PTR(slist
, tmp
) {
298 if (tmp
->state
== &locked
) {
299 add_tracker(&ret
->locked
, tmp
->name
, tmp
->owner
,
301 } else if (tmp
->state
== &unlocked
) {
302 add_tracker(&ret
->unlocked
, tmp
->name
, tmp
->owner
,
307 } END_FOR_EACH_PTR(tmp
);
309 add_ptr_list(&all_returns
, ret
);
312 static void check_returns_consistently(struct tracker
*lock
,
313 struct smatch_state
*start
)
315 int returns_locked
= 0;
316 int returns_unlocked
= 0;
317 struct locks_on_return
*tmp
;
319 FOR_EACH_PTR(all_returns
, tmp
) {
320 if (in_tracker_list(tmp
->unlocked
, lock
->name
, lock
->owner
,
322 returns_unlocked
= tmp
->line
;
323 else if (in_tracker_list(tmp
->locked
, lock
->name
, lock
->owner
,
325 returns_locked
= tmp
->line
;
326 else if (start
== &locked
)
327 returns_locked
= tmp
->line
;
328 else if (start
== &unlocked
)
329 returns_unlocked
= tmp
->line
;
330 } END_FOR_EACH_PTR(tmp
);
332 if (returns_locked
&& returns_unlocked
)
333 smatch_msg("warn: lock '%s' held on line %d but not on %d.",
334 lock
->name
, returns_locked
, returns_unlocked
);
338 static void clear_lists()
340 struct locks_on_return
*tmp
;
342 free_trackers_and_list(&starts_locked
);
343 free_trackers_and_list(&starts_unlocked
);
345 FOR_EACH_PTR(all_returns
, tmp
) {
346 free_trackers_and_list(&tmp
->locked
);
347 free_trackers_and_list(&tmp
->unlocked
);
348 } END_FOR_EACH_PTR(tmp
);
349 __free_ptr_list((struct ptr_list
**)&all_returns
);
352 static void check_consistency(struct symbol
*sym
)
359 FOR_EACH_PTR(starts_locked
, tmp
) {
360 if (in_tracker_list(starts_unlocked
, tmp
->name
, tmp
->owner
,
362 smatch_msg("error: locking inconsistency. We assume "
363 "'%s' is both locked and unlocked at the "
366 } END_FOR_EACH_PTR(tmp
);
368 FOR_EACH_PTR(starts_locked
, tmp
) {
369 check_returns_consistently(tmp
, &locked
);
370 } END_FOR_EACH_PTR(tmp
);
372 FOR_EACH_PTR(starts_unlocked
, tmp
) {
373 check_returns_consistently(tmp
, &unlocked
);
374 } END_FOR_EACH_PTR(tmp
);
379 void register_locking(int id
)
382 add_merge_hook(my_id
, &merge_func
);
383 add_hook(&match_condition
, CONDITION_HOOK
);
384 add_hook(&match_call
, FUNCTION_CALL_HOOK
);
385 add_hook(&match_return
, RETURN_HOOK
);
386 add_hook(&check_consistency
, END_FUNC_HOOK
);