]>
git.saurik.com Git - apple/xnu.git/blob - libkern/gen/OSAtomicOperations.c
2 * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
4 * @APPLE_LICENSE_OSREFERENCE_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. The rights granted to you under the
10 * License may not be used to create, or enable the creation or
11 * redistribution of, unlawful or unlicensed copies of an Apple operating
12 * system, or to circumvent, violate, or enable the circumvention or
13 * violation of, any terms of an Apple operating system software license
16 * Please obtain a copy of the License at
17 * http://www.opensource.apple.com/apsl/ and read it before using this
20 * The Original Code and all software distributed under the License are
21 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
22 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
23 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
24 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
25 * Please see the License for the specific language governing rights and
26 * limitations under the License.
28 * @APPLE_LICENSE_OSREFERENCE_HEADER_END@
31 #include <libkern/OSAtomic.h>
41 * these are _the_ atomic operations, currently cast atop CompareAndSwap,
42 * which is implemented in assembler. if we are worried about the cost of
43 * this layering (we shouldn't be), then all this stuff could be
44 * implemented in assembler, as it is in MacOS8/9
45 * (derived from SuperMario/NativeLibs/IO/DriverServices/Synchronization.s,
46 * which I wrote for NuKernel in a previous life with a different last name...)
48 * native Boolean CompareAndSwap(UInt32 oldValue, UInt32 newValue, UInt32 * oldValuePtr);
50 * We've since implemented a few more of these -- OSAddAtomic, OSDequeueAtomic,
51 * OSEnqueueAtomic etc -- in assembler, either for speed or correctness. See also the
52 * commpage atomic operations, and the platform specific versions.
53 * Like standards, there are a lot of atomic ops to choose from!
58 SInt32
OSAddAtomic(SInt32 amount
, SInt32
* value
)
65 newValue
= oldValue
+ amount
;
66 } while (! OSCompareAndSwap((UInt32
) oldValue
, (UInt32
) newValue
, (UInt32
*) value
));
71 SInt32
OSIncrementAtomic(SInt32
* value
)
73 return OSAddAtomic(1, value
);
76 SInt32
OSDecrementAtomic(SInt32
* value
)
78 return OSAddAtomic(-1, value
);
82 void * OSDequeueAtomic(void ** inList
, SInt32 inOffset
)
88 oldListHead
= *inList
;
89 if (oldListHead
== NULL
) {
93 newListHead
= *(void **) (((char *) oldListHead
) + inOffset
);
94 } while (! OSCompareAndSwap((UInt32
)oldListHead
,
95 (UInt32
)newListHead
, (UInt32
*)inList
));
99 void OSEnqueueAtomic(void ** inList
, void * inNewLink
, SInt32 inOffset
)
102 void * newListHead
= inNewLink
;
103 void ** newLinkNextPtr
= (void **) (((char *) inNewLink
) + inOffset
);
106 oldListHead
= *inList
;
107 *newLinkNextPtr
= oldListHead
;
108 } while (! OSCompareAndSwap((UInt32
)oldListHead
, (UInt32
)newListHead
,
111 #endif /* CMPXCHG8B */
112 #endif /* !__ppc__ */
114 static UInt32
OSBitwiseAtomic(UInt32 and_mask
, UInt32 or_mask
, UInt32 xor_mask
, UInt32
* value
)
121 newValue
= ((oldValue
& and_mask
) | or_mask
) ^ xor_mask
;
122 } while (! OSCompareAndSwap(oldValue
, newValue
, value
));
127 UInt32
OSBitAndAtomic(UInt32 mask
, UInt32
* value
)
129 return OSBitwiseAtomic(mask
, 0, 0, value
);
132 UInt32
OSBitOrAtomic(UInt32 mask
, UInt32
* value
)
134 return OSBitwiseAtomic((UInt32
) -1, mask
, 0, value
);
137 UInt32
OSBitXorAtomic(UInt32 mask
, UInt32
* value
)
139 return OSBitwiseAtomic((UInt32
) -1, 0, mask
, value
);
142 static Boolean
OSCompareAndSwap8(UInt8 oldValue8
, UInt8 newValue8
, UInt8
* value8
)
144 UInt32 mask
= 0x000000ff;
145 UInt32 alignment
= ((UInt32
) value8
) & (sizeof(UInt32
) - 1);
146 UInt32 shiftValues
= (24 << 24) | (16 << 16) | (8 << 8);
147 int shift
= (UInt32
) *(((UInt8
*) &shiftValues
) + alignment
);
148 UInt32
* value32
= (UInt32
*) (value8
- alignment
);
155 oldValue
= (oldValue
& ~mask
) | (oldValue8
<< shift
);
156 newValue
= (oldValue
& ~mask
) | (newValue8
<< shift
);
158 return OSCompareAndSwap(oldValue
, newValue
, value32
);
161 static Boolean
OSTestAndSetClear(UInt32 bit
, Boolean wantSet
, UInt8
* startAddress
)
167 startAddress
+= (bit
/ 8);
168 mask
<<= (7 - (bit
% 8));
169 wantValue
= wantSet
? mask
: 0;
172 oldValue
= *startAddress
;
173 if ((oldValue
& mask
) == wantValue
) {
176 } while (! OSCompareAndSwap8(oldValue
, (oldValue
& ~mask
) | wantValue
, startAddress
));
178 return (oldValue
& mask
) == wantValue
;
181 Boolean
OSTestAndSet(UInt32 bit
, UInt8
* startAddress
)
183 return OSTestAndSetClear(bit
, true, startAddress
);
186 Boolean
OSTestAndClear(UInt32 bit
, UInt8
* startAddress
)
188 return OSTestAndSetClear(bit
, false, startAddress
);
192 * silly unaligned versions
195 SInt8
OSIncrementAtomic8(SInt8
* value
)
197 return OSAddAtomic8(1, value
);
200 SInt8
OSDecrementAtomic8(SInt8
* value
)
202 return OSAddAtomic8(-1, value
);
205 SInt8
OSAddAtomic8(SInt32 amount
, SInt8
* value
)
212 newValue
= oldValue
+ amount
;
213 } while (! OSCompareAndSwap8((UInt8
) oldValue
, (UInt8
) newValue
, (UInt8
*) value
));
218 static UInt8
OSBitwiseAtomic8(UInt32 and_mask
, UInt32 or_mask
, UInt32 xor_mask
, UInt8
* value
)
225 newValue
= ((oldValue
& and_mask
) | or_mask
) ^ xor_mask
;
226 } while (! OSCompareAndSwap8(oldValue
, newValue
, value
));
231 UInt8
OSBitAndAtomic8(UInt32 mask
, UInt8
* value
)
233 return OSBitwiseAtomic8(mask
, 0, 0, value
);
236 UInt8
OSBitOrAtomic8(UInt32 mask
, UInt8
* value
)
238 return OSBitwiseAtomic8((UInt32
) -1, mask
, 0, value
);
241 UInt8
OSBitXorAtomic8(UInt32 mask
, UInt8
* value
)
243 return OSBitwiseAtomic8((UInt32
) -1, 0, mask
, value
);
246 static Boolean
OSCompareAndSwap16(UInt16 oldValue16
, UInt16 newValue16
, UInt16
* value16
)
248 UInt32 mask
= 0x0000ffff;
249 UInt32 alignment
= ((UInt32
) value16
) & (sizeof(UInt32
) - 1);
250 UInt32 shiftValues
= (16 << 24) | (16 << 16);
251 UInt32 shift
= (UInt32
) *(((UInt8
*) &shiftValues
) + alignment
);
252 UInt32
* value32
= (UInt32
*) (((UInt32
) value16
) - alignment
);
259 oldValue
= (oldValue
& ~mask
) | (oldValue16
<< shift
);
260 newValue
= (oldValue
& ~mask
) | (newValue16
<< shift
);
262 return OSCompareAndSwap(oldValue
, newValue
, value32
);
265 SInt16
OSIncrementAtomic16(SInt16
* value
)
267 return OSAddAtomic16(1, value
);
270 SInt16
OSDecrementAtomic16(SInt16
* value
)
272 return OSAddAtomic16(-1, value
);
275 SInt16
OSAddAtomic16(SInt32 amount
, SInt16
* value
)
282 newValue
= oldValue
+ amount
;
283 } while (! OSCompareAndSwap16((UInt16
) oldValue
, (UInt16
) newValue
, (UInt16
*) value
));
288 static UInt16
OSBitwiseAtomic16(UInt32 and_mask
, UInt32 or_mask
, UInt32 xor_mask
, UInt16
* value
)
295 newValue
= ((oldValue
& and_mask
) | or_mask
) ^ xor_mask
;
296 } while (! OSCompareAndSwap16(oldValue
, newValue
, value
));
301 UInt16
OSBitAndAtomic16(UInt32 mask
, UInt16
* value
)
303 return OSBitwiseAtomic16(mask
, 0, 0, value
);
306 UInt16
OSBitOrAtomic16(UInt32 mask
, UInt16
* value
)
308 return OSBitwiseAtomic16((UInt32
) -1, mask
, 0, value
);
311 UInt16
OSBitXorAtomic16(UInt32 mask
, UInt16
* value
)
313 return OSBitwiseAtomic16((UInt32
) -1, 0, mask
, value
);