0
0
mirror of https://github.com/mongodb/mongo.git synced 2024-12-01 09:32:32 +01:00
mongodb/util/concurrency
2010-12-13 00:21:08 -05:00
..
list.h SERVER-2184 clarify usage of mongo mutex 2010-12-08 00:32:56 -08:00
msg.h SERVER-1804 tighter background job 2010-10-13 17:38:09 -04:00
mutex.h fix warning 2010-11-19 11:24:21 -05:00
mvar.h
README dur getlasterror wait for group commit via fsync:1 2010-12-13 00:21:08 -05:00
rwlock.h cleaning 2010-11-12 20:35:36 -05:00
spin_lock.cpp delet ecritical seciotn 2010-08-26 23:51:03 -04:00
spin_lock.h delet ecritical seciotn 2010-08-26 23:51:03 -04:00
synchronization.cpp dur getlasterror wait for group commit via fsync:1 2010-12-13 00:21:08 -05:00
synchronization.h dur getlasterror wait for group commit via fsync:1 2010-12-13 00:21:08 -05:00
task.cpp SERVER-1804 tighter background job 2010-10-13 17:38:09 -04:00
task.h SERVER-1804 tighter background job 2010-10-13 17:38:09 -04:00
thread_pool.cpp
thread_pool.h missing pragma onces 2010-11-05 22:50:04 -04:00
value.h rs elect better 2010-07-22 15:10:23 -04:00
vars.cpp SERVER-2184 clarify usage of mongo mutex 2010-12-08 00:32:56 -08: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.