Lines Matching full:lck1
9 lck_mtx_t lck1, lck2;
54 lck_mtx_lock(&lck1); // no-warning
60 if (lck_mtx_try_lock(&lck1) != 0) // no-warning
61 lck_mtx_unlock(&lck1); // no-warning
217 lck_mtx_lock(&lck1); // no-warning
218 lck_mtx_lock(&lck1); // expected-warning{{This lock has already been acquired}}
224 lck_mtx_lock(&lck1); // no-warning
225 lck_mtx_unlock(&lck1); // no-warning
226 lck_mtx_lock(&lck1); // no-warning
227 lck_mtx_lock(&lck1); // expected-warning{{This lock has already been acquired}}
233 lck_mtx_lock(&lck1); // no-warning
235 lck_mtx_unlock(&lck1); // expected-warning{{This was not the most recently acquired lock}}
242 if (lck_mtx_try_lock(&lck1) == 0) // no-warning
245 lck_mtx_unlock(&lck1); // expected-warning{{This was not the most recently acquired lock}}
251 lck_mtx_unlock(&lck1); // no-warning
252 lck_mtx_unlock(&lck1); // expected-warning{{This lock has already been unlocked}}
258 lck_mtx_lock(&lck1); // no-warning
259 lck_mtx_unlock(&lck1); // no-warning
260 lck_mtx_unlock(&lck1); // expected-warning{{This lock has already been unlocked}}
272 lck_mtx_lock(&lck1); // no-warning
273 lck_mtx_unlock(&lck1); // no-warning
275 bad11_sub(&lck1);
