2 * Copyright (c) 2007 Apple Inc. All Rights Reserved.
4 * @APPLE_LICENSE_HEADER_START@
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. Please obtain a copy of the License at
10 * http://www.opensource.apple.com/apsl/ and read it before using this
13 * The Original Code and all software distributed under the License are
14 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
15 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
16 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
18 * Please see the License for the specific language governing rights and
19 * limitations under the License.
21 * @APPLE_LICENSE_HEADER_END@
24 /***********************************************************************
26 * Error-checking locks for debugging.
27 **********************************************************************/
29 #include "objc-private.h"
31 #if LOCKDEBUG && !TARGET_OS_WIN32
33 #include <unordered_map>
36 /***********************************************************************
37 * Thread-local bool set during _objc_atfork_prepare().
38 * That function is allowed to break some lock ordering rules.
39 **********************************************************************/
41 static tls_key_t fork_prepare_tls;
44 lockdebug_setInForkPrepare(bool inForkPrepare)
46 INIT_ONCE_PTR(fork_prepare_tls, tls_create(nil), (void)0);
47 tls_set(fork_prepare_tls, (void*)inForkPrepare);
53 INIT_ONCE_PTR(fork_prepare_tls, tls_create(nil), (void)0);
54 return (bool)tls_get(fork_prepare_tls);
59 /***********************************************************************
61 * "lock X precedes lock Y" means that X must be acquired first.
62 * This property is transitive.
63 **********************************************************************/
67 std::vector<const lockorder *> predecessors;
69 mutable std::unordered_map<const lockorder *, bool> memo;
71 lockorder(const void *newl) : l(newl) { }
74 static std::unordered_map<const void*, lockorder *> lockOrderList;
75 // not mutex_t because we don't want lock debugging on this lock
76 static mutex_tt<false> lockOrderLock;
79 lockPrecedesLock(const lockorder *oldlock, const lockorder *newlock)
81 auto memoed = newlock->memo.find(oldlock);
82 if (memoed != newlock->memo.end()) {
83 return memoed->second;
87 for (const auto *pre : newlock->predecessors) {
88 if (oldlock == pre || lockPrecedesLock(oldlock, pre)) {
94 newlock->memo[oldlock] = result;
99 lockPrecedesLock(const void *oldlock, const void *newlock)
101 mutex_tt<false>::locker lock(lockOrderLock);
103 auto oldorder = lockOrderList.find(oldlock);
104 auto neworder = lockOrderList.find(newlock);
105 if (neworder == lockOrderList.end() || oldorder == lockOrderList.end()) {
108 return lockPrecedesLock(oldorder->second, neworder->second);
112 lockUnorderedWithLock(const void *oldlock, const void *newlock)
114 mutex_tt<false>::locker lock(lockOrderLock);
116 auto oldorder = lockOrderList.find(oldlock);
117 auto neworder = lockOrderList.find(newlock);
118 if (neworder == lockOrderList.end() || oldorder == lockOrderList.end()) {
122 if (lockPrecedesLock(oldorder->second, neworder->second) ||
123 lockPrecedesLock(neworder->second, oldorder->second))
131 void lockdebug_lock_precedes_lock(const void *oldlock, const void *newlock)
133 if (lockPrecedesLock(newlock, oldlock)) {
134 _objc_fatal("contradiction in lock order declaration");
137 mutex_tt<false>::locker lock(lockOrderLock);
139 auto oldorder = lockOrderList.find(oldlock);
140 auto neworder = lockOrderList.find(newlock);
141 if (oldorder == lockOrderList.end()) {
142 lockOrderList[oldlock] = new lockorder(oldlock);
143 oldorder = lockOrderList.find(oldlock);
145 if (neworder == lockOrderList.end()) {
146 lockOrderList[newlock] = new lockorder(newlock);
147 neworder = lockOrderList.find(newlock);
150 neworder->second->predecessors.push_back(oldorder->second);
154 /***********************************************************************
155 * Recording - per-thread list of mutexes and monitors held
156 **********************************************************************/
158 enum class lockkind {
159 MUTEX = 1, MONITOR = 2, RDLOCK = 3, WRLOCK = 4, RECURSIVE = 5
162 #define MUTEX lockkind::MUTEX
163 #define MONITOR lockkind::MONITOR
164 #define RDLOCK lockkind::RDLOCK
165 #define WRLOCK lockkind::WRLOCK
166 #define RECURSIVE lockkind::RECURSIVE
169 lockkind k; // the kind of lock it is (MUTEX, MONITOR, etc)
170 int i; // the lock's nest count
173 using objc_lock_list = std::unordered_map<const void *, lockcount>;
176 // Thread-local list of locks owned by a thread.
177 // Used by lock ownership checks.
178 static tls_key_t lock_tls;
180 // Global list of all locks.
181 // Used by fork() safety check.
182 // This can't be a static struct because of C++ initialization order problems.
183 static objc_lock_list& AllLocks() {
184 static objc_lock_list *locks;
185 INIT_ONCE_PTR(locks, new objc_lock_list, (void)0);
191 destroyLocks(void *value)
193 auto locks = (objc_lock_list *)value;
194 // fixme complain about any still-held locks?
195 if (locks) delete locks;
198 static objc_lock_list&
201 // Use a dedicated tls key to prevent differences vs non-debug in
202 // usage of objc's other tls keys (required for some unit tests).
203 INIT_ONCE_PTR(lock_tls, tls_create(&destroyLocks), (void)0);
205 auto locks = (objc_lock_list *)tls_get(lock_tls);
207 locks = new objc_lock_list;
208 tls_set(lock_tls, locks);
215 hasLock(objc_lock_list& locks, const void *lock, lockkind kind)
217 auto iter = locks.find(lock);
218 if (iter != locks.end() && iter->second.k == kind) return true;
223 static const char *sym(const void *lock)
226 int ok = dladdr(lock, &info);
227 if (ok && info.dli_sname && info.dli_sname[0]) return info.dli_sname;
232 setLock(objc_lock_list& locks, const void *lock, lockkind kind)
234 // Check if we already own this lock.
235 auto iter = locks.find(lock);
236 if (iter != locks.end() && iter->second.k == kind) {
241 // Newly-acquired lock. Verify lock ordering.
242 // Locks not in AllLocks are exempt (i.e. @synchronize locks)
243 if (&locks != &AllLocks() && AllLocks().find(lock) != AllLocks().end()) {
244 for (auto& oldlock : locks) {
245 if (AllLocks().find(oldlock.first) == AllLocks().end()) {
250 if (lockPrecedesLock(lock, oldlock.first)) {
251 _objc_fatal("lock %p (%s) incorrectly acquired before %p (%s)",
252 oldlock.first, sym(oldlock.first), lock, sym(lock));
254 if (!inForkPrepare() &&
255 lockUnorderedWithLock(lock, oldlock.first))
257 // _objc_atfork_prepare is allowed to acquire
258 // otherwise-unordered locks, but nothing else may.
259 _objc_fatal("lock %p (%s) acquired before %p (%s) "
260 "with no defined lock order",
261 oldlock.first, sym(oldlock.first), lock, sym(lock));
266 locks[lock] = lockcount{kind, 1};
270 clearLock(objc_lock_list& locks, const void *lock, lockkind kind)
272 auto iter = locks.find(lock);
273 if (iter != locks.end()) {
274 auto& l = iter->second;
283 _objc_fatal("lock not found!");
287 /***********************************************************************
288 * fork() safety checking
289 **********************************************************************/
292 lockdebug_remember_mutex(mutex_t *lock)
294 setLock(AllLocks(), lock, MUTEX);
298 lockdebug_remember_recursive_mutex(recursive_mutex_t *lock)
300 setLock(AllLocks(), lock, RECURSIVE);
304 lockdebug_remember_monitor(monitor_t *lock)
306 setLock(AllLocks(), lock, MONITOR);
310 lockdebug_remember_rwlock(rwlock_t *lock)
312 setLock(AllLocks(), lock, WRLOCK);
316 lockdebug_assert_all_locks_locked()
318 auto& owned = ownedLocks();
320 for (const auto& l : AllLocks()) {
321 if (!hasLock(owned, l.first, l.second.k)) {
322 _objc_fatal("lock %p:%d is incorrectly not owned",
323 l.first, l.second.k);
329 lockdebug_assert_no_locks_locked()
331 auto& owned = ownedLocks();
333 for (const auto& l : AllLocks()) {
334 if (hasLock(owned, l.first, l.second.k)) {
335 _objc_fatal("lock %p:%d is incorrectly owned", l.first, l.second.k);
341 /***********************************************************************
343 **********************************************************************/
346 lockdebug_mutex_lock(mutex_t *lock)
348 auto& locks = ownedLocks();
350 if (hasLock(locks, lock, MUTEX)) {
351 _objc_fatal("deadlock: relocking mutex");
353 setLock(locks, lock, MUTEX);
356 // try-lock success is the only case with lockdebug effects.
357 // try-lock when already locked is OK (will fail)
358 // try-lock failure does nothing.
360 lockdebug_mutex_try_lock_success(mutex_t *lock)
362 auto& locks = ownedLocks();
363 setLock(locks, lock, MUTEX);
367 lockdebug_mutex_unlock(mutex_t *lock)
369 auto& locks = ownedLocks();
371 if (!hasLock(locks, lock, MUTEX)) {
372 _objc_fatal("unlocking unowned mutex");
374 clearLock(locks, lock, MUTEX);
379 lockdebug_mutex_assert_locked(mutex_t *lock)
381 auto& locks = ownedLocks();
383 if (!hasLock(locks, lock, MUTEX)) {
384 _objc_fatal("mutex incorrectly not locked");
389 lockdebug_mutex_assert_unlocked(mutex_t *lock)
391 auto& locks = ownedLocks();
393 if (hasLock(locks, lock, MUTEX)) {
394 _objc_fatal("mutex incorrectly locked");
399 /***********************************************************************
400 * Recursive mutex checking
401 **********************************************************************/
404 lockdebug_recursive_mutex_lock(recursive_mutex_t *lock)
406 auto& locks = ownedLocks();
407 setLock(locks, lock, RECURSIVE);
411 lockdebug_recursive_mutex_unlock(recursive_mutex_t *lock)
413 auto& locks = ownedLocks();
415 if (!hasLock(locks, lock, RECURSIVE)) {
416 _objc_fatal("unlocking unowned recursive mutex");
418 clearLock(locks, lock, RECURSIVE);
423 lockdebug_recursive_mutex_assert_locked(recursive_mutex_t *lock)
425 auto& locks = ownedLocks();
427 if (!hasLock(locks, lock, RECURSIVE)) {
428 _objc_fatal("recursive mutex incorrectly not locked");
433 lockdebug_recursive_mutex_assert_unlocked(recursive_mutex_t *lock)
435 auto& locks = ownedLocks();
437 if (hasLock(locks, lock, RECURSIVE)) {
438 _objc_fatal("recursive mutex incorrectly locked");
443 /***********************************************************************
445 **********************************************************************/
448 lockdebug_monitor_enter(monitor_t *lock)
450 auto& locks = ownedLocks();
452 if (hasLock(locks, lock, MONITOR)) {
453 _objc_fatal("deadlock: relocking monitor");
455 setLock(locks, lock, MONITOR);
459 lockdebug_monitor_leave(monitor_t *lock)
461 auto& locks = ownedLocks();
463 if (!hasLock(locks, lock, MONITOR)) {
464 _objc_fatal("unlocking unowned monitor");
466 clearLock(locks, lock, MONITOR);
470 lockdebug_monitor_wait(monitor_t *lock)
472 auto& locks = ownedLocks();
474 if (!hasLock(locks, lock, MONITOR)) {
475 _objc_fatal("waiting in unowned monitor");
481 lockdebug_monitor_assert_locked(monitor_t *lock)
483 auto& locks = ownedLocks();
485 if (!hasLock(locks, lock, MONITOR)) {
486 _objc_fatal("monitor incorrectly not locked");
491 lockdebug_monitor_assert_unlocked(monitor_t *lock)
493 auto& locks = ownedLocks();
495 if (hasLock(locks, lock, MONITOR)) {
496 _objc_fatal("monitor incorrectly held");
501 /***********************************************************************
503 **********************************************************************/
506 lockdebug_rwlock_read(rwlock_t *lock)
508 auto& locks = ownedLocks();
510 if (hasLock(locks, lock, RDLOCK)) {
511 // Recursive rwlock read is bad (may deadlock vs pending writer)
512 _objc_fatal("recursive rwlock read");
514 if (hasLock(locks, lock, WRLOCK)) {
515 _objc_fatal("deadlock: read after write for rwlock");
517 setLock(locks, lock, RDLOCK);
520 // try-read success is the only case with lockdebug effects.
521 // try-read when already reading is OK (won't deadlock)
522 // try-read when already writing is OK (will fail)
523 // try-read failure does nothing.
525 lockdebug_rwlock_try_read_success(rwlock_t *lock)
527 auto& locks = ownedLocks();
528 setLock(locks, lock, RDLOCK);
532 lockdebug_rwlock_unlock_read(rwlock_t *lock)
534 auto& locks = ownedLocks();
536 if (!hasLock(locks, lock, RDLOCK)) {
537 _objc_fatal("un-reading unowned rwlock");
539 clearLock(locks, lock, RDLOCK);
544 lockdebug_rwlock_write(rwlock_t *lock)
546 auto& locks = ownedLocks();
548 if (hasLock(locks, lock, RDLOCK)) {
549 // Lock promotion not allowed (may deadlock)
550 _objc_fatal("deadlock: write after read for rwlock");
552 if (hasLock(locks, lock, WRLOCK)) {
553 _objc_fatal("recursive rwlock write");
555 setLock(locks, lock, WRLOCK);
558 // try-write success is the only case with lockdebug effects.
559 // try-write when already reading is OK (will fail)
560 // try-write when already writing is OK (will fail)
561 // try-write failure does nothing.
563 lockdebug_rwlock_try_write_success(rwlock_t *lock)
565 auto& locks = ownedLocks();
566 setLock(locks, lock, WRLOCK);
570 lockdebug_rwlock_unlock_write(rwlock_t *lock)
572 auto& locks = ownedLocks();
574 if (!hasLock(locks, lock, WRLOCK)) {
575 _objc_fatal("un-writing unowned rwlock");
577 clearLock(locks, lock, WRLOCK);
582 lockdebug_rwlock_assert_reading(rwlock_t *lock)
584 auto& locks = ownedLocks();
586 if (!hasLock(locks, lock, RDLOCK)) {
587 _objc_fatal("rwlock incorrectly not reading");
592 lockdebug_rwlock_assert_writing(rwlock_t *lock)
594 auto& locks = ownedLocks();
596 if (!hasLock(locks, lock, WRLOCK)) {
597 _objc_fatal("rwlock incorrectly not writing");
602 lockdebug_rwlock_assert_locked(rwlock_t *lock)
604 auto& locks = ownedLocks();
606 if (!hasLock(locks, lock, RDLOCK) && !hasLock(locks, lock, WRLOCK)) {
607 _objc_fatal("rwlock incorrectly neither reading nor writing");
612 lockdebug_rwlock_assert_unlocked(rwlock_t *lock)
614 auto& locks = ownedLocks();
616 if (hasLock(locks, lock, RDLOCK) || hasLock(locks, lock, WRLOCK)) {
617 _objc_fatal("rwlock incorrectly not unlocked");