0
0
mirror of https://github.com/mongodb/mongo.git synced 2024-12-01 09:32:32 +01:00
mongodb/util/concurrency
2011-07-25 15:52:36 -04:00
..
list.h dont assert in destructor 2011-05-04 13:13:38 -04:00
msg.h ran astyle SERVER-2304 2011-01-04 00:40:41 -05:00
mutex.h added a check with DEBUG that warns if you try to lock during static shutdown 2011-07-25 15:52:36 -04:00
mvar.h ran astyle SERVER-2304 2011-01-04 00:40:41 -05:00
race.h defensive 2011-07-17 10:31:25 -04:00
README
rwlock.h use MONGOIF in headers 2011-07-18 16:29:59 -04:00
shared_mutex_win.hpp file mode 2011-03-17 14:50:38 -04:00
spin_lock.cpp use _WIN32, not WIN32 2011-05-11 11:45:47 -04:00
spin_lock.h spinlock default implementation was using rwlock which is suboptimal. 2011-07-11 17:19:11 -04:00
synchronization.cpp fix attempt for getlasterror fsync true in 1.9 2011-03-15 10:22:11 -04:00
synchronization.h fix attempt for getlasterror fsync true in 1.9 2011-03-15 10:22:11 -04:00
task.cpp ran astyle SERVER-2304 2011-01-04 00:40:41 -05:00
task.h ran astyle SERVER-2304 2011-01-04 00:40:41 -05:00
thread_pool.cpp ran astyle SERVER-2304 2011-01-04 00:40:41 -05:00
thread_pool.h ran astyle SERVER-2304 2011-01-04 00:40:41 -05:00
value.h diagstr typo arg 2011-05-09 13:13:14 -04:00
vars.cpp redo diagstr 2011-05-09 09:40:48 -04:00

util/concurrency/ files

list.h - a list class that is lock-free for reads
rwlock.h - read/write locks (RWLock)
msg.h - message passing between threads
task.h - an abstraction around threads
mutex.h - small enhancements that wrap boost::mutex
mvar.h
 This is based on haskell's MVar synchronization primitive:
 http://www.haskell.org/ghc/docs/latest/html/libraries/base-4.2.0.0/Control-Concurrent-MVar.html
 It is a thread-safe queue that can hold at most one object.
 You can also think of it as a box that can be either full or empty.
value.h
 Atomic wrapper for values/objects that are copy constructable / assignable
thread_pool.h 
spinlock.h
synchronization.h 
 A class to establish a sinchronization point between two threads. One thread is the waiter and one 
 is the notifier. After the notification event, both proceed normally.