OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 10 matching lines...) Expand all Loading... |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #ifndef WTF_SpinLock_h | 31 #include "config.h" |
32 #define WTF_SpinLock_h | 32 #include "wtf/QuantizedAllocation.h" |
33 | |
34 // DESCRIPTION | |
35 // spinLockLock() and spinLockUnlock() are simple spinlock primitives based on | |
36 // the standard CPU primitive of atomic increment and decrement of an int at | |
37 // a given memory address. | |
38 | |
39 #include "wtf/Atomics.h" | |
40 | 33 |
41 namespace WTF { | 34 namespace WTF { |
42 | 35 |
43 ALWAYS_INLINE void spinLockLock(int volatile* lock) | 36 unsigned short QuantizedAllocation::table[QuantizedAllocation::kTableSize]; |
| 37 |
| 38 void QuantizedAllocation::init() |
44 { | 39 { |
45 while (atomicIncrement(lock) != 1) | 40 size_t currAllocation = 0; |
46 atomicDecrement(lock); | 41 size_t currRounding = kMinRounding; |
47 } | 42 size_t currRoundingLimit = kMinRoundingLimit / 2; |
48 | 43 size_t numCurrRounding = 0; |
49 ALWAYS_INLINE void spinLockUnlock(int volatile* lock) | 44 for (size_t i = 0; i < kTableSize; ++i) { |
50 { | 45 table[i] = currRounding - 1; |
51 atomicDecrement(lock); | 46 currAllocation += kMinRoundingLimit; |
| 47 if (currAllocation == currRoundingLimit * 2) { |
| 48 currRoundingLimit *= 2; |
| 49 currRounding *= 2; |
| 50 } |
| 51 } |
52 } | 52 } |
53 | 53 |
54 } // namespace WTF | 54 } // namespace WTF |
55 | |
56 using WTF::spinLockLock; | |
57 using WTF::spinLockUnlock; | |
58 | |
59 #endif // WTF_PartitionAlloc_h | |
OLD | NEW |