An MCS queuing spinlock. More...
#include <mcs_lock.h>
Inheritance diagram for mcs_lock:
Classes | |
| struct | ext_qnode |
| struct | qnode |
Public Member Functions | |
| mcs_lock () | |
| void | spin_on_waiting (qnode *me) |
| bool | attempt (ext_qnode *me) |
| bool | attempt (qnode *me) |
| void * | acquire (ext_qnode *me) |
| void * | acquire (qnode *me) |
| qnode * | __unsafe_begin_acquire (qnode *me) |
| void * | __unsafe_end_acquire (qnode *me, qnode *pred) |
| qnode * | spin_on_next (qnode *me) |
| void | release (ext_qnode *me) |
| void | release (ext_qnode &me) |
| void | release (qnode &me) |
| void | release (qnode *me) |
| bool | is_mine (ext_qnode *me) |
Public Attributes | |
| qnode * | _tail |
Detailed Description
An MCS queuing spinlock.
Useful for short, contended critical sections. If contention is expected to be rare, use a tatas_lock; if critical sections are long, use pthread_mutex_t so the thread can block instead of spinning.
Tradeoffs are:
- test-and-test-and-set locks: low-overhead but not scalable
- queue-based locks: higher overhead but scalable
- pthread mutexes : high overhead and blocks, but frees up cpu for other threads
Constructor & Destructor Documentation
§ mcs_lock()
|
inline |
Member Function Documentation
§ __unsafe_begin_acquire()
§ __unsafe_end_acquire()
§ acquire() [1/2]
|
inline |
§ acquire() [2/2]
|
inline |
§ attempt() [1/2]
|
inline |
§ attempt() [2/2]
|
inline |
§ is_mine()
|
inline |
§ release() [1/4]
|
inline |
§ release() [2/4]
|
inline |
§ release() [3/4]
|
inline |
§ release() [4/4]
|
inline |
§ spin_on_next()
§ spin_on_waiting()
|
inline |
Member Data Documentation
§ _tail
| qnode* mcs_lock::_tail |
The documentation for this struct was generated from the following file:
- src/common/mcs_lock.h
