| // Copyright 2006-2008 the V8 project authors. All rights reserved. |
| // Redistribution and use in source and binary forms, with or without |
| // modification, are permitted provided that the following conditions are |
| // met: |
| // |
| // * Redistributions of source code must retain the above copyright |
| // notice, this list of conditions and the following disclaimer. |
| // * Redistributions in binary form must reproduce the above |
| // copyright notice, this list of conditions and the following |
| // disclaimer in the documentation and/or other materials provided |
| // with the distribution. |
| // * Neither the name of Google Inc. nor the names of its |
| // contributors may be used to endorse or promote products derived |
| // from this software without specific prior written permission. |
| // |
| // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| // |
| // Tests of the TokenLock class from lock.h |
| |
| #include <pthread.h> |
| #include <stdlib.h> |
| #include <unistd.h> // for usleep() |
| |
| #include "v8.h" |
| |
| #include "platform.h" |
| #include "cctest.h" |
| |
| using namespace ::v8::internal; |
| |
| |
| static void yield() { |
| usleep(1); |
| } |
| |
| static const int kLockCounterLimit = 50; |
| static int busy_lock_counter = 0; |
| |
| |
| static void LoopIncrement(Mutex* mutex, int rem) { |
| while (true) { |
| int count = 0; |
| int last_count = -1; |
| do { |
| LockGuard<Mutex> lock_guard(mutex); |
| count = busy_lock_counter; |
| yield(); |
| } while (count % 2 == rem && count < kLockCounterLimit); |
| if (count >= kLockCounterLimit) break; |
| LockGuard<Mutex> lock_guard(mutex); |
| CHECK_EQ(count, busy_lock_counter); |
| CHECK(last_count == -1 || count == last_count + 1); |
| busy_lock_counter++; |
| last_count = count; |
| yield(); |
| } |
| } |
| |
| |
| static void* RunTestBusyLock(void* arg) { |
| LoopIncrement(static_cast<Mutex*>(arg), 0); |
| return 0; |
| } |
| |
| |
| // Runs two threads that repeatedly acquire the lock and conditionally |
| // increment a variable. |
| TEST(BusyLock) { |
| pthread_t other; |
| Mutex mutex; |
| int thread_created = pthread_create(&other, |
| NULL, |
| &RunTestBusyLock, |
| &mutex); |
| CHECK_EQ(0, thread_created); |
| LoopIncrement(&mutex, 1); |
| pthread_join(other, NULL); |
| } |
| |
| |
| TEST(VirtualMemory) { |
| OS::SetUp(); |
| VirtualMemory* vm = new VirtualMemory(1 * MB); |
| CHECK(vm->IsReserved()); |
| void* block_addr = vm->address(); |
| size_t block_size = 4 * KB; |
| CHECK(vm->Commit(block_addr, block_size, false)); |
| // Check whether we can write to memory. |
| int* addr = static_cast<int*>(block_addr); |
| addr[KB-1] = 2; |
| CHECK(vm->Uncommit(block_addr, block_size)); |
| delete vm; |
| } |
| |
| |
| TEST(GetCurrentProcessId) { |
| OS::SetUp(); |
| CHECK_EQ(static_cast<int>(getpid()), OS::GetCurrentProcessId()); |
| } |