atomic.h revision 1.15 1 1.8 riastrad /* $NetBSD: atomic.h,v 1.15 2018/08/27 15:08:54 riastradh Exp $ */
2 1.2 riastrad
3 1.2 riastrad /*-
4 1.2 riastrad * Copyright (c) 2013 The NetBSD Foundation, Inc.
5 1.2 riastrad * All rights reserved.
6 1.2 riastrad *
7 1.2 riastrad * This code is derived from software contributed to The NetBSD Foundation
8 1.2 riastrad * by Taylor R. Campbell.
9 1.2 riastrad *
10 1.2 riastrad * Redistribution and use in source and binary forms, with or without
11 1.2 riastrad * modification, are permitted provided that the following conditions
12 1.2 riastrad * are met:
13 1.2 riastrad * 1. Redistributions of source code must retain the above copyright
14 1.2 riastrad * notice, this list of conditions and the following disclaimer.
15 1.2 riastrad * 2. Redistributions in binary form must reproduce the above copyright
16 1.2 riastrad * notice, this list of conditions and the following disclaimer in the
17 1.2 riastrad * documentation and/or other materials provided with the distribution.
18 1.2 riastrad *
19 1.2 riastrad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.2 riastrad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.2 riastrad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.2 riastrad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.2 riastrad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.2 riastrad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.2 riastrad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.2 riastrad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.2 riastrad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.2 riastrad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.2 riastrad * POSSIBILITY OF SUCH DAMAGE.
30 1.2 riastrad */
31 1.2 riastrad
32 1.2 riastrad #ifndef _LINUX_ATOMIC_H_
33 1.2 riastrad #define _LINUX_ATOMIC_H_
34 1.2 riastrad
35 1.2 riastrad #include <sys/atomic.h>
36 1.2 riastrad
37 1.2 riastrad #include <machine/limits.h>
38 1.2 riastrad
39 1.13 riastrad #if defined(MULTIPROCESSOR) && !defined(__HAVE_ATOMIC_AS_MEMBAR)
40 1.13 riastrad # define smp_mb__before_atomic() membar_exit()
41 1.13 riastrad # define smp_mb__after_atomic() membar_enter()
42 1.13 riastrad #else
43 1.13 riastrad # define smp_mb__before_atomic() __insn_barrier()
44 1.13 riastrad # define smp_mb__after_atomic() __insn_barrier()
45 1.13 riastrad #endif
46 1.13 riastrad
47 1.13 riastrad /*
48 1.13 riastrad * atomic (u)int operations
49 1.13 riastrad *
50 1.13 riastrad * Atomics that return a value, other than atomic_read, imply a
51 1.13 riastrad * full memory_sync barrier. Those that do not return a value
52 1.13 riastrad * imply no memory barrier.
53 1.13 riastrad */
54 1.13 riastrad
55 1.2 riastrad struct atomic {
56 1.2 riastrad union {
57 1.3 riastrad volatile int au_int;
58 1.3 riastrad volatile unsigned int au_uint;
59 1.2 riastrad } a_u;
60 1.2 riastrad };
61 1.2 riastrad
62 1.2 riastrad #define ATOMIC_INIT(i) { .a_u = { .au_int = (i) } }
63 1.2 riastrad
64 1.2 riastrad typedef struct atomic atomic_t;
65 1.2 riastrad
66 1.2 riastrad static inline int
67 1.2 riastrad atomic_read(atomic_t *atomic)
68 1.2 riastrad {
69 1.13 riastrad /* no membar */
70 1.3 riastrad return atomic->a_u.au_int;
71 1.2 riastrad }
72 1.2 riastrad
73 1.2 riastrad static inline void
74 1.2 riastrad atomic_set(atomic_t *atomic, int value)
75 1.2 riastrad {
76 1.13 riastrad /* no membar */
77 1.2 riastrad atomic->a_u.au_int = value;
78 1.2 riastrad }
79 1.2 riastrad
80 1.2 riastrad static inline void
81 1.2 riastrad atomic_add(int addend, atomic_t *atomic)
82 1.2 riastrad {
83 1.13 riastrad /* no membar */
84 1.2 riastrad atomic_add_int(&atomic->a_u.au_uint, addend);
85 1.2 riastrad }
86 1.2 riastrad
87 1.2 riastrad static inline void
88 1.2 riastrad atomic_sub(int subtrahend, atomic_t *atomic)
89 1.2 riastrad {
90 1.13 riastrad /* no membar */
91 1.2 riastrad atomic_add_int(&atomic->a_u.au_uint, -subtrahend);
92 1.2 riastrad }
93 1.2 riastrad
94 1.2 riastrad static inline int
95 1.2 riastrad atomic_add_return(int addend, atomic_t *atomic)
96 1.2 riastrad {
97 1.13 riastrad int v;
98 1.13 riastrad
99 1.13 riastrad smp_mb__before_atomic();
100 1.13 riastrad v = (int)atomic_add_int_nv(&atomic->a_u.au_uint, addend);
101 1.13 riastrad smp_mb__after_atomic();
102 1.13 riastrad
103 1.13 riastrad return v;
104 1.2 riastrad }
105 1.2 riastrad
106 1.2 riastrad static inline void
107 1.2 riastrad atomic_inc(atomic_t *atomic)
108 1.2 riastrad {
109 1.13 riastrad /* no membar */
110 1.2 riastrad atomic_inc_uint(&atomic->a_u.au_uint);
111 1.2 riastrad }
112 1.2 riastrad
113 1.2 riastrad static inline void
114 1.2 riastrad atomic_dec(atomic_t *atomic)
115 1.2 riastrad {
116 1.13 riastrad /* no membar */
117 1.2 riastrad atomic_dec_uint(&atomic->a_u.au_uint);
118 1.2 riastrad }
119 1.2 riastrad
120 1.2 riastrad static inline int
121 1.2 riastrad atomic_inc_return(atomic_t *atomic)
122 1.2 riastrad {
123 1.13 riastrad int v;
124 1.13 riastrad
125 1.13 riastrad smp_mb__before_atomic();
126 1.13 riastrad v = (int)atomic_inc_uint_nv(&atomic->a_u.au_uint);
127 1.13 riastrad smp_mb__after_atomic();
128 1.13 riastrad
129 1.13 riastrad return v;
130 1.2 riastrad }
131 1.2 riastrad
132 1.2 riastrad static inline int
133 1.2 riastrad atomic_dec_return(atomic_t *atomic)
134 1.2 riastrad {
135 1.13 riastrad int v;
136 1.13 riastrad
137 1.13 riastrad smp_mb__before_atomic();
138 1.13 riastrad v = (int)atomic_dec_uint_nv(&atomic->a_u.au_uint);
139 1.13 riastrad smp_mb__after_atomic();
140 1.13 riastrad
141 1.13 riastrad return v;
142 1.2 riastrad }
143 1.2 riastrad
144 1.2 riastrad static inline int
145 1.2 riastrad atomic_dec_and_test(atomic_t *atomic)
146 1.2 riastrad {
147 1.13 riastrad /* membar implied by atomic_dec_return */
148 1.13 riastrad return atomic_dec_return(atomic) == 0;
149 1.2 riastrad }
150 1.2 riastrad
151 1.2 riastrad static inline void
152 1.8 riastrad atomic_or(int value, atomic_t *atomic)
153 1.8 riastrad {
154 1.13 riastrad /* no membar */
155 1.8 riastrad atomic_or_uint(&atomic->a_u.au_uint, value);
156 1.8 riastrad }
157 1.8 riastrad
158 1.8 riastrad static inline void
159 1.2 riastrad atomic_set_mask(unsigned long mask, atomic_t *atomic)
160 1.2 riastrad {
161 1.13 riastrad /* no membar */
162 1.2 riastrad atomic_or_uint(&atomic->a_u.au_uint, mask);
163 1.2 riastrad }
164 1.2 riastrad
165 1.2 riastrad static inline void
166 1.2 riastrad atomic_clear_mask(unsigned long mask, atomic_t *atomic)
167 1.2 riastrad {
168 1.13 riastrad /* no membar */
169 1.2 riastrad atomic_and_uint(&atomic->a_u.au_uint, ~mask);
170 1.2 riastrad }
171 1.2 riastrad
172 1.2 riastrad static inline int
173 1.2 riastrad atomic_add_unless(atomic_t *atomic, int addend, int zero)
174 1.2 riastrad {
175 1.2 riastrad int value;
176 1.2 riastrad
177 1.13 riastrad smp_mb__before_atomic();
178 1.2 riastrad do {
179 1.2 riastrad value = atomic->a_u.au_int;
180 1.2 riastrad if (value == zero)
181 1.13 riastrad break;
182 1.2 riastrad } while (atomic_cas_uint(&atomic->a_u.au_uint, value, (value + addend))
183 1.2 riastrad != value);
184 1.13 riastrad smp_mb__after_atomic();
185 1.2 riastrad
186 1.13 riastrad return value != zero;
187 1.2 riastrad }
188 1.2 riastrad
189 1.2 riastrad static inline int
190 1.2 riastrad atomic_inc_not_zero(atomic_t *atomic)
191 1.2 riastrad {
192 1.13 riastrad /* membar implied by atomic_add_unless */
193 1.2 riastrad return atomic_add_unless(atomic, 1, 0);
194 1.2 riastrad }
195 1.2 riastrad
196 1.5 riastrad static inline int
197 1.5 riastrad atomic_xchg(atomic_t *atomic, int new)
198 1.5 riastrad {
199 1.13 riastrad int old;
200 1.13 riastrad
201 1.13 riastrad smp_mb__before_atomic();
202 1.13 riastrad old = (int)atomic_swap_uint(&atomic->a_u.au_uint, (unsigned)new);
203 1.13 riastrad smp_mb__after_atomic();
204 1.13 riastrad
205 1.13 riastrad return old;
206 1.5 riastrad }
207 1.5 riastrad
208 1.5 riastrad static inline int
209 1.13 riastrad atomic_cmpxchg(atomic_t *atomic, int expect, int new)
210 1.5 riastrad {
211 1.13 riastrad int old;
212 1.13 riastrad
213 1.13 riastrad /*
214 1.13 riastrad * XXX As an optimization, under Linux's semantics we are
215 1.13 riastrad * allowed to skip the memory barrier if the comparison fails,
216 1.13 riastrad * but taking advantage of that is not convenient here.
217 1.13 riastrad */
218 1.13 riastrad smp_mb__before_atomic();
219 1.13 riastrad old = (int)atomic_cas_uint(&atomic->a_u.au_uint, (unsigned)expect,
220 1.5 riastrad (unsigned)new);
221 1.13 riastrad smp_mb__after_atomic();
222 1.13 riastrad
223 1.13 riastrad return old;
224 1.5 riastrad }
225 1.5 riastrad
226 1.6 riastrad struct atomic64 {
227 1.6 riastrad volatile uint64_t a_v;
228 1.6 riastrad };
229 1.6 riastrad
230 1.6 riastrad typedef struct atomic64 atomic64_t;
231 1.6 riastrad
232 1.15 riastrad int linux_atomic64_init(void);
233 1.15 riastrad void linux_atomic64_fini(void);
234 1.15 riastrad
235 1.15 riastrad #ifdef __HAVE_ATOMIC64_OPS
236 1.15 riastrad
237 1.6 riastrad static inline uint64_t
238 1.6 riastrad atomic64_read(const struct atomic64 *a)
239 1.6 riastrad {
240 1.13 riastrad /* no membar */
241 1.6 riastrad return a->a_v;
242 1.6 riastrad }
243 1.6 riastrad
244 1.6 riastrad static inline void
245 1.6 riastrad atomic64_set(struct atomic64 *a, uint64_t v)
246 1.6 riastrad {
247 1.13 riastrad /* no membar */
248 1.6 riastrad a->a_v = v;
249 1.6 riastrad }
250 1.6 riastrad
251 1.6 riastrad static inline void
252 1.6 riastrad atomic64_add(long long d, struct atomic64 *a)
253 1.6 riastrad {
254 1.13 riastrad /* no membar */
255 1.6 riastrad atomic_add_64(&a->a_v, d);
256 1.6 riastrad }
257 1.6 riastrad
258 1.6 riastrad static inline void
259 1.6 riastrad atomic64_sub(long long d, struct atomic64 *a)
260 1.6 riastrad {
261 1.13 riastrad /* no membar */
262 1.6 riastrad atomic_add_64(&a->a_v, -d);
263 1.6 riastrad }
264 1.6 riastrad
265 1.6 riastrad static inline uint64_t
266 1.13 riastrad atomic64_xchg(struct atomic64 *a, uint64_t new)
267 1.6 riastrad {
268 1.13 riastrad uint64_t old;
269 1.13 riastrad
270 1.13 riastrad smp_mb__before_atomic();
271 1.13 riastrad old = atomic_swap_64(&a->a_v, new);
272 1.13 riastrad smp_mb__after_atomic();
273 1.13 riastrad
274 1.13 riastrad return old;
275 1.6 riastrad }
276 1.6 riastrad
277 1.9 riastrad static inline uint64_t
278 1.13 riastrad atomic64_cmpxchg(struct atomic64 *atomic, uint64_t expect, uint64_t new)
279 1.9 riastrad {
280 1.13 riastrad uint64_t old;
281 1.13 riastrad
282 1.13 riastrad /*
283 1.13 riastrad * XXX As an optimization, under Linux's semantics we are
284 1.13 riastrad * allowed to skip the memory barrier if the comparison fails,
285 1.13 riastrad * but taking advantage of that is not convenient here.
286 1.13 riastrad */
287 1.13 riastrad smp_mb__before_atomic();
288 1.13 riastrad old = atomic_cas_64(&atomic->a_v, expect, new);
289 1.13 riastrad smp_mb__after_atomic();
290 1.13 riastrad
291 1.13 riastrad return old;
292 1.9 riastrad }
293 1.9 riastrad
294 1.15 riastrad #else /* !defined(__HAVE_ATOMIC64_OPS) */
295 1.15 riastrad
296 1.15 riastrad #define atomic64_read linux_atomic64_read
297 1.15 riastrad #define atomic64_set linux_atomic64_set
298 1.15 riastrad #define atomic64_add linux_atomic64_add
299 1.15 riastrad #define atomic64_sub linux_atomic64_sub
300 1.15 riastrad #define atomic64_xchg linux_atomic64_xchg
301 1.15 riastrad #define atomic64_cmpxchg linux_atomic64_cmpxchg
302 1.15 riastrad
303 1.15 riastrad uint64_t atomic64_read(const struct atomic64 *);
304 1.15 riastrad void atomic64_set(struct atomic64 *, uint64_t);
305 1.15 riastrad void atomic64_add(long long, struct atomic64 *);
306 1.15 riastrad void atomic64_sub(long long, struct atomic64 *);
307 1.15 riastrad uint64_t atomic64_xchg(struct atomic64 *, uint64_t);
308 1.15 riastrad uint64_t atomic64_cmpxchg(struct atomic64 *, uint64_t, uint64_t);
309 1.15 riastrad
310 1.15 riastrad #endif
311 1.15 riastrad
312 1.14 riastrad struct atomic_long {
313 1.14 riastrad volatile unsigned long al_v;
314 1.14 riastrad };
315 1.14 riastrad
316 1.14 riastrad typedef struct atomic_long atomic_long_t;
317 1.14 riastrad
318 1.14 riastrad static inline long
319 1.14 riastrad atomic_long_read(struct atomic_long *a)
320 1.14 riastrad {
321 1.14 riastrad /* no membar */
322 1.14 riastrad return (unsigned long)a->al_v;
323 1.14 riastrad }
324 1.14 riastrad
325 1.14 riastrad static inline void
326 1.14 riastrad atomic_long_set(struct atomic_long *a, long v)
327 1.14 riastrad {
328 1.14 riastrad /* no membar */
329 1.14 riastrad a->al_v = v;
330 1.14 riastrad }
331 1.14 riastrad
332 1.14 riastrad static inline long
333 1.14 riastrad atomic_long_add_unless(struct atomic_long *a, long addend, long zero)
334 1.14 riastrad {
335 1.14 riastrad long value;
336 1.14 riastrad
337 1.14 riastrad smp_mb__before_atomic();
338 1.14 riastrad do {
339 1.14 riastrad value = (long)a->al_v;
340 1.14 riastrad if (value == zero)
341 1.14 riastrad break;
342 1.14 riastrad } while (atomic_cas_ulong(&a->al_v, (unsigned long)value,
343 1.14 riastrad (unsigned long)(value + addend)) != (unsigned long)value);
344 1.14 riastrad smp_mb__after_atomic();
345 1.14 riastrad
346 1.14 riastrad return value != zero;
347 1.14 riastrad }
348 1.14 riastrad
349 1.14 riastrad static inline long
350 1.14 riastrad atomic_long_inc_not_zero(struct atomic_long *a)
351 1.14 riastrad {
352 1.14 riastrad /* membar implied by atomic_long_add_unless */
353 1.14 riastrad return atomic_long_add_unless(a, 1, 0);
354 1.14 riastrad }
355 1.14 riastrad
356 1.14 riastrad static inline long
357 1.14 riastrad atomic_long_cmpxchg(struct atomic_long *a, long expect, long new)
358 1.14 riastrad {
359 1.14 riastrad long old;
360 1.14 riastrad
361 1.14 riastrad /*
362 1.14 riastrad * XXX As an optimization, under Linux's semantics we are
363 1.14 riastrad * allowed to skip the memory barrier if the comparison fails,
364 1.14 riastrad * but taking advantage of that is not convenient here.
365 1.14 riastrad */
366 1.14 riastrad smp_mb__before_atomic();
367 1.14 riastrad old = (long)atomic_cas_ulong(&a->al_v, (unsigned long)expect,
368 1.14 riastrad (unsigned long)new);
369 1.14 riastrad smp_mb__after_atomic();
370 1.14 riastrad
371 1.14 riastrad return old;
372 1.14 riastrad }
373 1.14 riastrad
374 1.2 riastrad static inline void
375 1.2 riastrad set_bit(unsigned int bit, volatile unsigned long *ptr)
376 1.2 riastrad {
377 1.2 riastrad const unsigned int units = (sizeof(*ptr) * CHAR_BIT);
378 1.2 riastrad
379 1.13 riastrad /* no memory barrier */
380 1.2 riastrad atomic_or_ulong(&ptr[bit / units], (1UL << (bit % units)));
381 1.2 riastrad }
382 1.2 riastrad
383 1.2 riastrad static inline void
384 1.2 riastrad clear_bit(unsigned int bit, volatile unsigned long *ptr)
385 1.2 riastrad {
386 1.2 riastrad const unsigned int units = (sizeof(*ptr) * CHAR_BIT);
387 1.2 riastrad
388 1.13 riastrad /* no memory barrier */
389 1.2 riastrad atomic_and_ulong(&ptr[bit / units], ~(1UL << (bit % units)));
390 1.2 riastrad }
391 1.2 riastrad
392 1.2 riastrad static inline void
393 1.2 riastrad change_bit(unsigned int bit, volatile unsigned long *ptr)
394 1.2 riastrad {
395 1.2 riastrad const unsigned int units = (sizeof(*ptr) * CHAR_BIT);
396 1.2 riastrad volatile unsigned long *const p = &ptr[bit / units];
397 1.2 riastrad const unsigned long mask = (1UL << (bit % units));
398 1.2 riastrad unsigned long v;
399 1.2 riastrad
400 1.13 riastrad /* no memory barrier */
401 1.2 riastrad do v = *p; while (atomic_cas_ulong(p, v, (v ^ mask)) != v);
402 1.2 riastrad }
403 1.2 riastrad
404 1.11 riastrad static inline int
405 1.2 riastrad test_and_set_bit(unsigned int bit, volatile unsigned long *ptr)
406 1.2 riastrad {
407 1.2 riastrad const unsigned int units = (sizeof(*ptr) * CHAR_BIT);
408 1.2 riastrad volatile unsigned long *const p = &ptr[bit / units];
409 1.2 riastrad const unsigned long mask = (1UL << (bit % units));
410 1.2 riastrad unsigned long v;
411 1.2 riastrad
412 1.13 riastrad smp_mb__before_atomic();
413 1.2 riastrad do v = *p; while (atomic_cas_ulong(p, v, (v | mask)) != v);
414 1.13 riastrad smp_mb__after_atomic();
415 1.2 riastrad
416 1.7 riastrad return ((v & mask) != 0);
417 1.2 riastrad }
418 1.2 riastrad
419 1.11 riastrad static inline int
420 1.2 riastrad test_and_clear_bit(unsigned int bit, volatile unsigned long *ptr)
421 1.2 riastrad {
422 1.2 riastrad const unsigned int units = (sizeof(*ptr) * CHAR_BIT);
423 1.2 riastrad volatile unsigned long *const p = &ptr[bit / units];
424 1.2 riastrad const unsigned long mask = (1UL << (bit % units));
425 1.2 riastrad unsigned long v;
426 1.2 riastrad
427 1.13 riastrad smp_mb__before_atomic();
428 1.2 riastrad do v = *p; while (atomic_cas_ulong(p, v, (v & ~mask)) != v);
429 1.13 riastrad smp_mb__after_atomic();
430 1.2 riastrad
431 1.7 riastrad return ((v & mask) != 0);
432 1.2 riastrad }
433 1.2 riastrad
434 1.11 riastrad static inline int
435 1.2 riastrad test_and_change_bit(unsigned int bit, volatile unsigned long *ptr)
436 1.2 riastrad {
437 1.2 riastrad const unsigned int units = (sizeof(*ptr) * CHAR_BIT);
438 1.2 riastrad volatile unsigned long *const p = &ptr[bit / units];
439 1.2 riastrad const unsigned long mask = (1UL << (bit % units));
440 1.2 riastrad unsigned long v;
441 1.2 riastrad
442 1.13 riastrad smp_mb__before_atomic();
443 1.2 riastrad do v = *p; while (atomic_cas_ulong(p, v, (v ^ mask)) != v);
444 1.13 riastrad smp_mb__after_atomic();
445 1.2 riastrad
446 1.7 riastrad return ((v & mask) != 0);
447 1.2 riastrad }
448 1.2 riastrad
449 1.2 riastrad #endif /* _LINUX_ATOMIC_H_ */
450