0c615a01ae
* Trivial adjustments of code using mutexes. Mostly removing the mutex_init() return value check. * Added mutex_lock_threads_locked(), which is called with the threads spinlock being held. The spinlock is released while waiting, of course. This function is useful in cases where the existence of the mutex object is ensured by holding the threads spinlock. * Changed the two instances in the VFS code where an IO context of another team needs to be locked to use mutex_lock_threads_locked(). Before it required a semaphore-based mutex implementation. git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@25283 a95241bf-73f2-0310-859d-f6bbb57e9c96
161 lines
2.8 KiB
C++
161 lines
2.8 KiB
C++
/*
|
|
* Copyright 2005-2007, Ingo Weinhold, bonefish@users.sf.net. All rights reserved.
|
|
* Distributed under the terms of the MIT License.
|
|
*/
|
|
#ifndef KERNEL_UTIL_AUTO_LOCKER_H
|
|
#define KERNEL_UTIL_AUTO_LOCKER_H
|
|
|
|
|
|
#include <KernelExport.h>
|
|
|
|
#include <shared/AutoLocker.h>
|
|
|
|
#include <int.h>
|
|
#include <lock.h>
|
|
|
|
|
|
namespace BPrivate {
|
|
|
|
// MutexLocking
|
|
class MutexLocking {
|
|
public:
|
|
inline bool Lock(mutex *lockable)
|
|
{
|
|
return mutex_lock(lockable) == B_OK;
|
|
}
|
|
|
|
inline void Unlock(mutex *lockable)
|
|
{
|
|
mutex_unlock(lockable);
|
|
}
|
|
};
|
|
|
|
// MutexLocker
|
|
typedef AutoLocker<mutex, MutexLocking> MutexLocker;
|
|
|
|
// RecursiveLockLocking
|
|
class RecursiveLockLocking {
|
|
public:
|
|
inline bool Lock(recursive_lock *lockable)
|
|
{
|
|
return recursive_lock_lock(lockable) == B_OK;
|
|
}
|
|
|
|
inline void Unlock(recursive_lock *lockable)
|
|
{
|
|
recursive_lock_unlock(lockable);
|
|
}
|
|
};
|
|
|
|
// RecursiveLocker
|
|
typedef AutoLocker<recursive_lock, RecursiveLockLocking> RecursiveLocker;
|
|
|
|
// BenaphoreLocking
|
|
class BenaphoreLocking {
|
|
public:
|
|
inline bool Lock(benaphore *lockable)
|
|
{
|
|
return benaphore_lock(lockable) == B_OK;
|
|
}
|
|
|
|
inline void Unlock(benaphore *lockable)
|
|
{
|
|
benaphore_unlock(lockable);
|
|
}
|
|
};
|
|
|
|
// BenaphoreLocker
|
|
typedef AutoLocker<benaphore, BenaphoreLocking> BenaphoreLocker;
|
|
|
|
// InterruptsLocking
|
|
class InterruptsLocking {
|
|
public:
|
|
inline bool Lock(int* lockable)
|
|
{
|
|
*lockable = disable_interrupts();
|
|
return true;
|
|
}
|
|
|
|
inline void Unlock(int* lockable)
|
|
{
|
|
restore_interrupts(*lockable);
|
|
}
|
|
};
|
|
|
|
// InterruptsLocker
|
|
class InterruptsLocker : public AutoLocker<int, InterruptsLocking> {
|
|
public:
|
|
inline InterruptsLocker(bool alreadyLocked = false,
|
|
bool lockIfNotLocked = true)
|
|
: AutoLocker<int, InterruptsLocking>(&fState, alreadyLocked,
|
|
lockIfNotLocked)
|
|
{
|
|
}
|
|
|
|
private:
|
|
int fState;
|
|
};
|
|
|
|
// SpinLocking
|
|
class SpinLocking {
|
|
public:
|
|
inline bool Lock(spinlock* lockable)
|
|
{
|
|
acquire_spinlock(lockable);
|
|
return true;
|
|
}
|
|
|
|
inline void Unlock(spinlock* lockable)
|
|
{
|
|
release_spinlock(lockable);
|
|
}
|
|
};
|
|
|
|
// SpinLocker
|
|
typedef AutoLocker<spinlock, SpinLocking> SpinLocker;
|
|
|
|
// InterruptsSpinLocking
|
|
class InterruptsSpinLocking {
|
|
public:
|
|
struct State {
|
|
State(spinlock* lock)
|
|
: lock(lock)
|
|
{
|
|
}
|
|
|
|
int state;
|
|
spinlock* lock;
|
|
};
|
|
|
|
inline bool Lock(spinlock* lockable)
|
|
{
|
|
fState = disable_interrupts();
|
|
acquire_spinlock(lockable);
|
|
return true;
|
|
}
|
|
|
|
inline void Unlock(spinlock* lockable)
|
|
{
|
|
release_spinlock(lockable);
|
|
restore_interrupts(fState);
|
|
}
|
|
|
|
private:
|
|
int fState;
|
|
};
|
|
|
|
// InterruptsSpinLocker
|
|
typedef AutoLocker<spinlock, InterruptsSpinLocking> InterruptsSpinLocker;
|
|
|
|
} // namespace BPrivate
|
|
|
|
using BPrivate::AutoLocker;
|
|
using BPrivate::MutexLocker;
|
|
using BPrivate::RecursiveLocker;
|
|
using BPrivate::BenaphoreLocker;
|
|
using BPrivate::InterruptsLocker;
|
|
using BPrivate::SpinLocker;
|
|
using BPrivate::InterruptsSpinLocker;
|
|
|
|
#endif // KERNEL_UTIL_AUTO_LOCKER_H
|