]>
git.saurik.com Git - apple/libc.git/blob - include/libkern/OSAtomic.h
1d42a8e71b22d8014701fecbefb650331af149f0
2 * Copyright (c) 2004 Apple Computer, Inc. All rights reserved.
4 * @APPLE_LICENSE_HEADER_START@
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. Please obtain a copy of the License at
10 * http://www.opensource.apple.com/apsl/ and read it before using this
13 * The Original Code and all software distributed under the License are
14 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
15 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
16 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
18 * Please see the License for the specific language governing rights and
19 * limitations under the License.
21 * @APPLE_LICENSE_HEADER_END@
28 #include <sys/cdefs.h>
32 /* These are the preferred versions of the atomic and synchronization operations.
33 * Their implementation is customized at boot time for the platform, including
34 * late-breaking errata fixes as necessary. They are thread safe.
36 * WARNING: all addresses passed to these functions must be "naturally aligned", ie
37 * int32_t's must be 32-bit aligned (low 2 bits of address zero), and int64_t's
38 * must be 64-bit aligned (low 3 bits of address zero.)
40 * Note that some versions of the atomic functions incorporate memory barriers,
41 * and some do not. Barriers strictly order memory access on a weakly-ordered
42 * architecture such as PPC. All loads and stores executed in sequential program
43 * order before the barrier will complete before any load or store executed after
44 * the barrier. On a uniprocessor, the barrier operation is typically a nop.
45 * On a multiprocessor, the barrier can be quite expensive.
47 * Most code will want to use the barrier functions to insure that memory shared
48 * between threads is properly synchronized. For example, if you want to initialize
49 * a shared data structure and then atomically increment a variable to indicate
50 * that the initialization is complete, then you MUST use OSAtomicIncrement32Barrier()
51 * to ensure that the stores to your data structure complete before the atomic add.
52 * Likewise, the consumer of that data structure MUST use OSAtomicDecrement32Barrier(),
53 * in order to ensure that their loads of the structure are not executed before
54 * the atomic decrement. On the other hand, if you are simply incrementing a global
55 * counter, then it is safe and potentially faster to use OSAtomicIncrement32().
57 * If you are unsure which version to use, prefer the barrier variants as they are
60 * The spinlock and queue operations always incorporate a barrier.
65 /* Arithmetic functions. They return the new value. All the "or", "and", and "xor"
66 * operations, and the barrier forms of add, are layered on top of compare-and-swap.
68 int32_t OSAtomicAdd32( int32_t theAmount
, int32_t *theValue
);
69 int32_t OSAtomicAdd32Barrier( int32_t theAmount
, int32_t *theValue
);
72 int32_t OSAtomicIncrement32( int32_t *theValue
)
73 { return OSAtomicAdd32( 1, theValue
); }
75 int32_t OSAtomicIncrement32Barrier( int32_t *theValue
)
76 { return OSAtomicAdd32Barrier( 1, theValue
); }
79 int32_t OSAtomicDecrement32( int32_t *theValue
)
80 { return OSAtomicAdd32( -1, theValue
); }
82 int32_t OSAtomicDecrement32Barrier( int32_t *theValue
)
83 { return OSAtomicAdd32Barrier( -1, theValue
); }
85 int32_t OSAtomicOr32( uint32_t theMask
, uint32_t *theValue
);
86 int32_t OSAtomicOr32Barrier( uint32_t theMask
, uint32_t *theValue
);
88 int32_t OSAtomicAnd32( uint32_t theMask
, uint32_t *theValue
);
89 int32_t OSAtomicAnd32Barrier( uint32_t theMask
, uint32_t *theValue
);
91 int32_t OSAtomicXor32( uint32_t theMask
, uint32_t *theValue
);
92 int32_t OSAtomicXor32Barrier( uint32_t theMask
, uint32_t *theValue
);
94 #if defined(__ppc64__) || defined(__i386__) || defined(__x86_64__)
96 int64_t OSAtomicAdd64( int64_t theAmount
, int64_t *theValue
);
97 int64_t OSAtomicAdd64Barrier( int64_t theAmount
, int64_t *theValue
);
100 int64_t OSAtomicIncrement64( int64_t *theValue
)
101 { return OSAtomicAdd64( 1, theValue
); }
103 int64_t OSAtomicIncrement64Barrier( int64_t *theValue
)
104 { return OSAtomicAdd64Barrier( 1, theValue
); }
107 int64_t OSAtomicDecrement64( int64_t *theValue
)
108 { return OSAtomicAdd64( -1, theValue
); }
110 int64_t OSAtomicDecrement64Barrier( int64_t *theValue
)
111 { return OSAtomicAdd64Barrier( -1, theValue
); }
113 #endif /* defined(__ppc64__) || defined(__i386__) || defined(__x86_64__) */
116 /* Compare and swap. They return true if the swap occured.
118 bool OSAtomicCompareAndSwap32( int32_t oldValue
, int32_t newValue
, int32_t *theValue
);
119 bool OSAtomicCompareAndSwap32Barrier( int32_t oldValue
, int32_t newValue
, int32_t *theValue
);
121 #if defined(__ppc64__) || defined(__i386__) || defined(__x86_64__)
123 bool OSAtomicCompareAndSwap64( int64_t oldValue
, int64_t newValue
, int64_t *theValue
);
124 bool OSAtomicCompareAndSwap64Barrier( int64_t oldValue
, int64_t newValue
, int64_t *theValue
);
126 #endif /* defined(__ppc64__) || defined(__i386__) || defined(__x86_64__) */
129 /* Test and set. They return the original value of the bit, and operate on bit (0x80>>(n&7))
130 * in byte ((char*)theAddress + (n>>3)). They are layered on top of the compare-and-swap
133 bool OSAtomicTestAndSet( uint32_t n
, void *theAddress
);
134 bool OSAtomicTestAndSetBarrier( uint32_t n
, void *theAddress
);
135 bool OSAtomicTestAndClear( uint32_t n
, void *theAddress
);
136 bool OSAtomicTestAndClearBarrier( uint32_t n
, void *theAddress
);
138 /* Spinlocks. These use memory barriers as required to synchronize access to shared
139 * memory protected by the lock. The lock operation spins, but employs various strategies
140 * to back off if the lock is held, making it immune to most priority-inversion livelocks.
141 * The try operation immediately returns false if the lock was held, true if it took the
142 * lock. The convention is that unlocked is zero, locked is nonzero.
144 #define OS_SPINLOCK_INIT 0
146 typedef int32_t OSSpinLock
;
148 bool OSSpinLockTry( OSSpinLock
*lock
);
149 void OSSpinLockLock( OSSpinLock
*lock
);
150 void OSSpinLockUnlock( OSSpinLock
*lock
);
153 /* Memory barrier. It is both a read and write barrier.
155 void OSMemoryBarrier( void );
159 #endif /* _OSATOMIC_H_ */