Here's the final benapohre - with an templated option for recursive[...]
access.
fast path semaphores are fun:
Even in the post n case:
____________
void post_n(int n)
{
std::atomic_thread_fence(std::memory_order_release);
int old_count = m_count.fetch_add(n, std::memory_order_relaxed);
// If old_count was negative, there were waiters.
if (old_count < 0)
{
// Calculate how many actually need a signal.
// If we have 5 waiters (count == -5) and we post 10,
// we only signal 5.
int to_signal = std::min(-old_count, n);
m_semaphore.post_n(to_signal);
}
}
____________
Loopless, no CAS, just accounting.
| Date | Sujet | # | Auteur | |
| 27 Mar 26 |  A simple futex'd benaphore | 4 | Bonita Montero | |
| 6 Apr 26 |  Re: A simple futex'd benaphore | 3 | Bonita Montero | |
| 6 Apr 26 |  Re: A simple futex'd benaphore | 2 | Chris M. Thomasson | |
| 7 Apr 26 |  Re: A simple futex'd benaphore | 1 | Bonita Montero |
Les messages affichés proviennent d'usenet.