ucommon
7.0.0
About: GNU uCommon C++ is a portable and optimized class framework for writing C++ applications that need to use threads and support concurrent synchronization, and that use sockets, XML parsing, object serialization, thread-optimized string and data structure classes, etc..
![]() ![]() |
#include <ucommon/cpr.h>
#include <ucommon/access.h>
#include <ucommon/timers.h>
#include <ucommon/memory.h>
Go to the source code of this file.
Classes | |
class | ucommon::ConditionMutex |
class | ucommon::ConditionMutex::autolock |
class | ucommon::ConditionVar |
class | ucommon::Conditional |
class | ucommon::Conditional::attribute |
class | ucommon::ConditionalAccess |
class | ucommon::ConditionalLock |
class | ucommon::ConditionalLock::Context |
class | ucommon::Barrier |
class | ucommon::Semaphore |
Namespaces | |
ucommon | |
Typedefs | |
typedef ConditionalLock | ucommon::condlock_t |
typedef ConditionalAccess | ucommon::accesslock_t |
typedef Semaphore | ucommon::semaphore_t |
typedef Barrier | ucommon::barrier_t |
Condition classes for thread sychronization and timing. The theory behind ucommon sychronization objects is that all upper level sychronization objects can be formed directly from a mutex and conditional. This includes semaphores, barriers, rwlock, our own specialized conditional lock, resource-bound locking, and recursive exclusive locks. Using only conditionals means we are not dependent on platform specific pthread implementations that may not implement some of these, and hence improves portability and consistency. Given that our rwlocks are recursive access locks, one can safely create read/write threading pairs where the read threads need not worry about deadlocks and the writers need not either if they only write-lock one instance at a time to change state.
Definition in file condition.h.