source: mainline/uspace/lib/c/generic/private/futex.h@ 0b5203b

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 0b5203b was 9e889f6, checked in by Jakub Jermar <jakub@…>, 7 years ago

Switch userspace futexes to using waitq kobjects

This replaces futexes entirely when they are not shared across address
spaces.

  • Property mode set to 100644
File size: 6.8 KB
Line 
1/*
2 * Copyright (c) 2006 Jakub Jermar
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * - The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29/** @addtogroup libc
30 * @{
31 */
32/** @file
33 */
34
35#ifndef LIBC_FUTEX_H_
36#define LIBC_FUTEX_H_
37
38#include <assert.h>
39#include <stdatomic.h>
40#include <errno.h>
41#include <libc.h>
42#include <time.h>
43#include <fibril.h>
44#include <abi/cap.h>
45
46typedef struct futex {
47 volatile atomic_int val;
48 volatile atomic_int alloc_lock;
49 cap_waitq_handle_t whandle;
50
51#ifdef CONFIG_DEBUG_FUTEX
52 _Atomic(fibril_t *) owner;
53#endif
54} futex_t;
55
56extern void futex_initialize(futex_t *futex, int value);
57
58#ifdef CONFIG_DEBUG_FUTEX
59
60#define FUTEX_INITIALIZE(val) { (val), 0, CAP_NIL, NULL }
61#define FUTEX_INITIALIZER FUTEX_INITIALIZE(1)
62
63void __futex_assert_is_locked(futex_t *, const char *);
64void __futex_assert_is_not_locked(futex_t *, const char *);
65void __futex_lock(futex_t *, const char *);
66void __futex_unlock(futex_t *, const char *);
67bool __futex_trylock(futex_t *, const char *);
68void __futex_give_to(futex_t *, void *, const char *);
69
70#define futex_lock(futex) __futex_lock((futex), #futex)
71#define futex_unlock(futex) __futex_unlock((futex), #futex)
72#define futex_trylock(futex) __futex_trylock((futex), #futex)
73
74#define futex_give_to(futex, new_owner) __futex_give_to((futex), (new_owner), #futex)
75#define futex_assert_is_locked(futex) __futex_assert_is_locked((futex), #futex)
76#define futex_assert_is_not_locked(futex) __futex_assert_is_not_locked((futex), #futex)
77
78#else
79
80#define FUTEX_INITIALIZE(val) { (val), 0, CAP_NIL }
81#define FUTEX_INITIALIZER FUTEX_INITIALIZE(1)
82
83#define futex_lock(fut) (void) futex_down((fut))
84#define futex_trylock(fut) futex_trydown((fut))
85#define futex_unlock(fut) (void) futex_up((fut))
86
87#define futex_give_to(fut, owner) ((void)0)
88#define futex_assert_is_locked(fut) assert(atomic_load_explicit(&(fut)->val, memory_order_relaxed) <= 0)
89#define futex_assert_is_not_locked(fut) ((void)0)
90
91#endif
92
93/** Down the futex with timeout, composably.
94 *
95 * This means that when the operation fails due to a timeout or being
96 * interrupted, the next futex_up() is ignored, which allows certain kinds of
97 * composition of synchronization primitives.
98 *
99 * In most other circumstances, regular futex_down_timeout() is a better choice.
100 *
101 * @param futex Futex.
102 *
103 * @return ENOENT if there is no such virtual address.
104 * @return ETIMEOUT if timeout expires.
105 * @return EOK on success.
106 * @return Error code from <errno.h> otherwise.
107 *
108 */
109static inline errno_t futex_down_composable(futex_t *futex,
110 const struct timespec *expires)
111{
112 // TODO: Add tests for this.
113
114 if (atomic_fetch_sub_explicit(&futex->val, 1, memory_order_acquire) > 0)
115 return EOK;
116
117 /* There wasn't any token. We must defer to the underlying semaphore. */
118
119 usec_t timeout;
120
121 if (!expires) {
122 /* No timeout. */
123 timeout = 0;
124 } else {
125 if (expires->tv_sec == 0) {
126 /* We can't just return ETIMEOUT. That wouldn't be composable. */
127 timeout = 1;
128 } else {
129 struct timespec tv;
130 getuptime(&tv);
131 timeout = ts_gteq(&tv, expires) ? 1 :
132 NSEC2USEC(ts_sub_diff(expires, &tv));
133 }
134
135 assert(timeout > 0);
136 }
137
138 if (futex->whandle == CAP_NIL) {
139 while (atomic_exchange_explicit(&futex->alloc_lock, 1,
140 memory_order_acquire) == 1)
141 ;
142 if (futex->whandle == CAP_NIL) {
143 errno_t rc = __SYSCALL1(SYS_WAITQ_CREATE,
144 (sysarg_t) &futex->whandle);
145 if (rc != EOK) {
146 atomic_store_explicit(&futex->alloc_lock, 0,
147 memory_order_release);
148 return rc;
149 }
150 }
151
152 atomic_store_explicit(&futex->alloc_lock, 0,
153 memory_order_release);
154 }
155
156 return __SYSCALL2(SYS_WAITQ_SLEEP, (sysarg_t) futex->whandle,
157 (sysarg_t) timeout);
158}
159
160/** Up the futex.
161 *
162 * @param futex Futex.
163 *
164 * @return ENOENT if there is no such virtual address.
165 * @return EOK on success.
166 * @return Error code from <errno.h> otherwise.
167 *
168 */
169static inline errno_t futex_up(futex_t *futex)
170{
171 if (atomic_fetch_add_explicit(&futex->val, 1, memory_order_release) < 0)
172 return __SYSCALL1(SYS_WAITQ_WAKEUP, (sysarg_t) futex->whandle);
173
174 return EOK;
175}
176
177static inline errno_t futex_down_timeout(futex_t *futex,
178 const struct timespec *expires)
179{
180 /*
181 * This combination of a "composable" sleep followed by futex_up() on
182 * failure is necessary to prevent breakage due to certain race
183 * conditions.
184 */
185 errno_t rc = futex_down_composable(futex, expires);
186 if (rc != EOK)
187 futex_up(futex);
188 return rc;
189}
190
191/** Try to down the futex.
192 *
193 * @param futex Futex.
194 *
195 * @return true if the futex was acquired.
196 * @return false if the futex was not acquired.
197 *
198 */
199static inline bool futex_trydown(futex_t *futex)
200{
201 /*
202 * We can't just use CAS here.
203 * If we don't succeed with CAS, we can't return failure
204 * because that would lead to spurious failures where
205 * futex_down_timeout returns ETIMEOUT despite there being
206 * available tokens. That would break some algorithms.
207 * We also don't want to loop on CAS indefinitely, because
208 * that would make the semaphore not wait-free, even when all
209 * atomic operations and the underlying base semaphore are all
210 * wait-free.
211 * It's much less trouble (and code bloat) to just do regular
212 * down_timeout(), with an already expired deadline.
213 */
214 struct timespec tv = { .tv_sec = 0, .tv_nsec = 0 };
215 return futex_down_timeout(futex, &tv) == EOK;
216}
217
218/** Down the futex.
219 *
220 * @param futex Futex.
221 *
222 * @return ENOENT if there is no such virtual address.
223 * @return EOK on success.
224 * @return Error code from <errno.h> otherwise.
225 *
226 */
227static inline errno_t futex_down(futex_t *futex)
228{
229 return futex_down_timeout(futex, NULL);
230}
231
232#endif
233
234/** @}
235 */
Note: See TracBrowser for help on using the repository browser.