2003-03-17 11:22:52 +00:00
|
|
|
/* sem_post -- post to a POSIX semaphore. Generic futex-using version.
|
2015-01-02 16:28:19 +00:00
|
|
|
Copyright (C) 2003-2015 Free Software Foundation, Inc.
|
2003-03-17 11:22:52 +00:00
|
|
|
This file is part of the GNU C Library.
|
2003-06-19 19:53:12 +00:00
|
|
|
Contributed by Jakub Jelinek <jakub@redhat.com>, 2003.
|
2003-03-17 11:22:52 +00:00
|
|
|
|
|
|
|
The GNU C Library is free software; you can redistribute it and/or
|
|
|
|
modify it under the terms of the GNU Lesser General Public
|
|
|
|
License as published by the Free Software Foundation; either
|
|
|
|
version 2.1 of the License, or (at your option) any later version.
|
|
|
|
|
|
|
|
The GNU C Library is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
Lesser General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
2012-02-09 23:18:22 +00:00
|
|
|
License along with the GNU C Library; if not, see
|
|
|
|
<http://www.gnu.org/licenses/>. */
|
2003-03-17 11:22:52 +00:00
|
|
|
|
2013-04-07 20:13:02 +00:00
|
|
|
#include <atomic.h>
|
2003-03-17 11:22:52 +00:00
|
|
|
#include <errno.h>
|
|
|
|
#include <sysdep.h>
|
|
|
|
#include <lowlevellock.h>
|
|
|
|
#include <internaltypes.h>
|
|
|
|
#include <semaphore.h>
|
|
|
|
|
|
|
|
#include <shlib-compat.h>
|
|
|
|
|
2015-01-21 05:46:16 +00:00
|
|
|
/* Wrapper for lll_futex_wake, with error checking.
|
|
|
|
TODO Remove when cleaning up the futex API throughout glibc. */
|
|
|
|
static __always_inline void
|
|
|
|
futex_wake (unsigned int* futex, int processes_to_wake, int private)
|
|
|
|
{
|
|
|
|
int res = lll_futex_wake (futex, processes_to_wake, private);
|
|
|
|
/* No error. Ignore the number of woken processes. */
|
|
|
|
if (res >= 0)
|
|
|
|
return;
|
|
|
|
switch (res)
|
|
|
|
{
|
|
|
|
case -EFAULT: /* Could have happened due to memory reuse. */
|
|
|
|
case -EINVAL: /* Could be either due to incorrect alignment (a bug in
|
|
|
|
glibc or in the application) or due to memory being
|
|
|
|
reused for a PI futex. We cannot distinguish between the
|
|
|
|
two causes, and one of them is correct use, so we do not
|
|
|
|
act in this case. */
|
|
|
|
return;
|
|
|
|
case -ENOSYS: /* Must have been caused by a glibc bug. */
|
|
|
|
/* No other errors are documented at this time. */
|
|
|
|
default:
|
|
|
|
abort ();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* See sem_wait for an explanation of the algorithm. */
|
2003-03-17 11:22:52 +00:00
|
|
|
int
|
|
|
|
__new_sem_post (sem_t *sem)
|
2007-05-26 01:31:40 +00:00
|
|
|
{
|
|
|
|
struct new_sem *isem = (struct new_sem *) sem;
|
2015-01-21 05:46:16 +00:00
|
|
|
int private = isem->private;
|
2007-05-26 01:31:40 +00:00
|
|
|
|
2015-01-21 05:46:16 +00:00
|
|
|
#if __HAVE_64B_ATOMICS
|
|
|
|
/* Add a token to the semaphore. We use release MO to make sure that a
|
|
|
|
thread acquiring this token synchronizes with us and other threads that
|
|
|
|
added tokens before (the release sequence includes atomic RMW operations
|
|
|
|
by other threads). */
|
|
|
|
/* TODO Use atomic_fetch_add to make it scale better than a CAS loop? */
|
2015-01-23 22:48:40 +00:00
|
|
|
uint64_t d = atomic_load_relaxed (&isem->data);
|
2008-01-10 18:34:43 +00:00
|
|
|
do
|
|
|
|
{
|
2015-01-21 05:46:16 +00:00
|
|
|
if ((d & SEM_VALUE_MASK) == SEM_VALUE_MAX)
|
2008-01-10 18:34:43 +00:00
|
|
|
{
|
|
|
|
__set_errno (EOVERFLOW);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
2015-01-21 05:46:16 +00:00
|
|
|
while (!atomic_compare_exchange_weak_release (&isem->data, &d, d + 1));
|
2008-01-10 18:34:43 +00:00
|
|
|
|
2015-01-21 05:46:16 +00:00
|
|
|
/* If there is any potentially blocked waiter, wake one of them. */
|
|
|
|
if ((d >> SEM_NWAITERS_SHIFT) > 0)
|
|
|
|
futex_wake (((unsigned int *) &isem->data) + SEM_VALUE_OFFSET, 1, private);
|
|
|
|
#else
|
|
|
|
/* Add a token to the semaphore. Similar to 64b version. */
|
|
|
|
unsigned int v = atomic_load_relaxed (&isem->value);
|
|
|
|
do
|
2007-05-26 01:31:40 +00:00
|
|
|
{
|
2015-01-21 05:46:16 +00:00
|
|
|
if ((v << SEM_VALUE_SHIFT) == SEM_VALUE_MAX)
|
2007-05-26 01:31:40 +00:00
|
|
|
{
|
2015-01-21 05:46:16 +00:00
|
|
|
__set_errno (EOVERFLOW);
|
2007-05-26 01:31:40 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
2015-01-21 05:46:16 +00:00
|
|
|
while (!atomic_compare_exchange_weak_release (&isem->value,
|
|
|
|
&v, v + (1 << SEM_VALUE_SHIFT)));
|
|
|
|
|
|
|
|
/* If there is any potentially blocked waiter, wake one of them. */
|
|
|
|
if ((v & SEM_NWAITERS_MASK) != 0)
|
|
|
|
futex_wake (&isem->value, 1, private);
|
|
|
|
#endif
|
|
|
|
|
2007-05-26 01:31:40 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
versioned_symbol (libpthread, __new_sem_post, sem_post, GLIBC_2_1);
|
|
|
|
|
|
|
|
|
|
|
|
#if SHLIB_COMPAT (libpthread, GLIBC_2_0, GLIBC_2_1)
|
|
|
|
int
|
|
|
|
attribute_compat_text_section
|
|
|
|
__old_sem_post (sem_t *sem)
|
2003-03-17 11:22:52 +00:00
|
|
|
{
|
|
|
|
int *futex = (int *) sem;
|
|
|
|
|
2015-01-21 05:46:16 +00:00
|
|
|
/* We must need to synchronize with consumers of this token, so the atomic
|
|
|
|
increment must have release MO semantics. */
|
|
|
|
atomic_write_barrier ();
|
2012-11-21 20:00:52 +00:00
|
|
|
(void) atomic_increment_val (futex);
|
2007-06-08 02:50:59 +00:00
|
|
|
/* We always have to assume it is a shared semaphore. */
|
|
|
|
int err = lll_futex_wake (futex, 1, LLL_SHARED);
|
2007-05-15 06:49:29 +00:00
|
|
|
if (__builtin_expect (err, 0) < 0)
|
2003-06-19 19:53:12 +00:00
|
|
|
{
|
2007-05-15 06:49:29 +00:00
|
|
|
__set_errno (-err);
|
|
|
|
return -1;
|
2003-06-19 19:53:12 +00:00
|
|
|
}
|
|
|
|
return 0;
|
2003-03-17 11:22:52 +00:00
|
|
|
}
|
|
|
|
compat_symbol (libpthread, __old_sem_post, sem_post, GLIBC_2_0);
|
|
|
|
#endif
|