Home
last modified time | relevance | path

Searched refs:barrier (Results 1 – 7 of 7) sorted by relevance

/haiku/src/system/libroot/posix/pthread/
H A Dpthread_barrier.cpp29 pthread_barrier_init(pthread_barrier_t* barrier, in pthread_barrier_init() argument
35 if (barrier == NULL || attr == NULL || count < 1) in pthread_barrier_init()
38 barrier->flags = attr->process_shared ? BARRIER_FLAG_SHARED : 0; in pthread_barrier_init()
39 barrier->lock = B_USER_MUTEX_LOCKED; in pthread_barrier_init()
40 barrier->mutex = 0; in pthread_barrier_init()
41 barrier->waiter_count = 0; in pthread_barrier_init()
42 barrier->waiter_max = count; in pthread_barrier_init()
76 barrier_ensure_idle(pthread_barrier_t* barrier) in barrier_ensure_idle() argument
78 const uint32 flags = (barrier->flags & BARRIER_FLAG_SHARED) ? B_USER_MUTEX_SHARED : 0; in barrier_ensure_idle()
82 while (atomic_get((int32*)&barrier->waiter_count) < 0) { in barrier_ensure_idle()
[all …]
/haiku/headers/posix/
H A Dpthread.h124 extern int pthread_barrier_init(pthread_barrier_t *barrier,
126 extern int pthread_barrier_destroy(pthread_barrier_t *barrier);
127 extern int pthread_barrier_wait(pthread_barrier_t *barrier);
/haiku/docs/user/drivers/
H A DKernelExport.dox379 \brief Execute a memory read barrier.
382 the instruction ordering, and the memory. A barrier makes sure every read that should be
383 executed before the barrier will be complete before any more memory access operations can be
389 \brief Execute a memory write barrier.
392 the instruction ordering, and the memory. A barrier makes sure every read that should be
393 executed before the barrier will be complete before any more memory access operations can be
/haiku/src/libs/linprog/
H A DLayoutOptimizer.cpp828 int barrier = -1; in _Solve() local
845 barrier = i; in _Solve()
848 TRACE("alpha: %f, barrier: %d\n", alpha, barrier); in _Solve()
851 activeConstraints.AddItem(fConstraints->ItemAt(barrier)); in _Solve()
/haiku/src/kits/interface/layouter/
H A DLayoutOptimizer.cpp856 int barrier = -1; in _Solve() local
873 barrier = i; in _Solve()
876 TRACE("alpha: %f, barrier: %d\n", alpha, barrier); in _Solve()
879 activeConstraints.AddItem(fConstraints.ItemAt(barrier)); in _Solve()
/haiku/data/system/data/fortunes/
H A DComputers2930 More than a mere hindrance. It's a whole new barrier!
/haiku/src/apps/mail/
H A Dwords6475 barrier/MS