| OLD | NEW |
| (Empty) |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | |
| 2 // Redistribution and use in source and binary forms, with or without | |
| 3 // modification, are permitted provided that the following conditions are | |
| 4 // met: | |
| 5 // | |
| 6 // * Redistributions of source code must retain the above copyright | |
| 7 // notice, this list of conditions and the following disclaimer. | |
| 8 // * Redistributions in binary form must reproduce the above | |
| 9 // copyright notice, this list of conditions and the following | |
| 10 // disclaimer in the documentation and/or other materials provided | |
| 11 // with the distribution. | |
| 12 // * Neither the name of Google Inc. nor the names of its | |
| 13 // contributors may be used to endorse or promote products derived | |
| 14 // from this software without specific prior written permission. | |
| 15 // | |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 27 // | |
| 28 // Tests of fast TLS support. | |
| 29 | |
| 30 #include "src/v8.h" | |
| 31 | |
| 32 #include "src/base/logging.h" | |
| 33 #include "src/base/platform/platform.h" | |
| 34 #include "test/cctest/cctest.h" | |
| 35 | |
| 36 using v8::base::Thread; | |
| 37 | |
| 38 static const int kValueCount = 128; | |
| 39 | |
| 40 static Thread::LocalStorageKey keys[kValueCount]; | |
| 41 | |
| 42 static void* GetValue(int num) { | |
| 43 return reinterpret_cast<void*>(static_cast<intptr_t>(num + 1)); | |
| 44 } | |
| 45 | |
| 46 | |
| 47 static void DoTest() { | |
| 48 for (int i = 0; i < kValueCount; i++) { | |
| 49 CHECK(!Thread::HasThreadLocal(keys[i])); | |
| 50 } | |
| 51 for (int i = 0; i < kValueCount; i++) { | |
| 52 Thread::SetThreadLocal(keys[i], GetValue(i)); | |
| 53 } | |
| 54 for (int i = 0; i < kValueCount; i++) { | |
| 55 CHECK(Thread::HasThreadLocal(keys[i])); | |
| 56 } | |
| 57 for (int i = 0; i < kValueCount; i++) { | |
| 58 CHECK_EQ(GetValue(i), Thread::GetThreadLocal(keys[i])); | |
| 59 CHECK_EQ(GetValue(i), Thread::GetExistingThreadLocal(keys[i])); | |
| 60 } | |
| 61 for (int i = 0; i < kValueCount; i++) { | |
| 62 Thread::SetThreadLocal(keys[i], GetValue(kValueCount - i - 1)); | |
| 63 } | |
| 64 for (int i = 0; i < kValueCount; i++) { | |
| 65 CHECK(Thread::HasThreadLocal(keys[i])); | |
| 66 } | |
| 67 for (int i = 0; i < kValueCount; i++) { | |
| 68 CHECK_EQ(GetValue(kValueCount - i - 1), | |
| 69 Thread::GetThreadLocal(keys[i])); | |
| 70 CHECK_EQ(GetValue(kValueCount - i - 1), | |
| 71 Thread::GetExistingThreadLocal(keys[i])); | |
| 72 } | |
| 73 } | |
| 74 | |
| 75 class TestThread : public Thread { | |
| 76 public: | |
| 77 TestThread() : Thread("TestThread") {} | |
| 78 | |
| 79 virtual void Run() { | |
| 80 DoTest(); | |
| 81 } | |
| 82 }; | |
| 83 | |
| 84 | |
| 85 TEST(FastTLS) { | |
| 86 for (int i = 0; i < kValueCount; i++) { | |
| 87 keys[i] = Thread::CreateThreadLocalKey(); | |
| 88 } | |
| 89 DoTest(); | |
| 90 TestThread thread; | |
| 91 thread.Start(); | |
| 92 thread.Join(); | |
| 93 } | |
| OLD | NEW |