OLD | NEW |
(Empty) | |
| 1 /* Copyright (c) 2010, Google Inc. |
| 2 * All rights reserved. |
| 3 * |
| 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are |
| 6 * met: |
| 7 * |
| 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above |
| 11 * copyright notice, this list of conditions and the following disclaimer |
| 12 * in the documentation and/or other materials provided with the |
| 13 * distribution. |
| 14 * * Neither the name of Google Inc. nor the names of its |
| 15 * contributors may be used to endorse or promote products derived from |
| 16 * this software without specific prior written permission. |
| 17 * |
| 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ |
| 30 |
| 31 // The OS-specific header included below must provide two calls: |
| 32 // base::internal::SpinLockDelay() and base::internal::SpinLockWake(). |
| 33 // See spinlock_internal.h for the spec of SpinLockWake(). |
| 34 |
| 35 // void SpinLockDelay(volatile Atomic32 *w, int32 value, int loop) |
| 36 // SpinLockDelay() generates an apprproate spin delay on iteration "loop" of a |
| 37 // spin loop on location *w, whose previously observed value was "value". |
| 38 // SpinLockDelay() may do nothing, may yield the CPU, may sleep a clock tick, |
| 39 // or may wait for a delay that can be truncated by a call to SpinlockWake(w). |
| 40 // In all cases, it must return in bounded time even if SpinlockWake() is not |
| 41 // called. |
| 42 |
| 43 #include "base/spinlock_internal.h" |
| 44 |
| 45 #if defined(_WIN32) |
| 46 #include "base/spinlock_win32-inl.h" |
| 47 #elif defined(__linux__) |
| 48 #include "base/spinlock_linux-inl.h" |
| 49 #else |
| 50 #include "base/spinlock_posix-inl.h" |
| 51 #endif |
| 52 |
| 53 namespace base { |
| 54 namespace internal { |
| 55 |
| 56 // See spinlock_internal.h for spec. |
| 57 int32 SpinLockWait(volatile Atomic32 *w, int n, |
| 58 const SpinLockWaitTransition trans[]) { |
| 59 int32 v; |
| 60 bool done = false; |
| 61 for (int loop = 0; !done; loop++) { |
| 62 v = base::subtle::Acquire_Load(w); |
| 63 int i; |
| 64 for (i = 0; i != n && v != trans[i].from; i++) { |
| 65 } |
| 66 if (i == n) { |
| 67 SpinLockDelay(w, v, loop); // no matching transition |
| 68 } else if (trans[i].to == v || // null transition |
| 69 base::subtle::Acquire_CompareAndSwap(w, v, trans[i].to) == v) { |
| 70 done = trans[i].done; |
| 71 } |
| 72 } |
| 73 return v; |
| 74 } |
| 75 |
| 76 } // namespace internal |
| 77 } // namespace base |
OLD | NEW |