OLD | NEW |
| (Empty) |
1 // Copyright 2006-2008 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 the TokenLock class from lock.h | |
29 | |
30 #include <stdlib.h> | |
31 | |
32 #include "v8.h" | |
33 | |
34 #include "platform.h" | |
35 #include "cctest.h" | |
36 | |
37 | |
38 using namespace ::v8::internal; | |
39 | |
40 | |
41 // Simple test of locking logic | |
42 TEST(Simple) { | |
43 Mutex* mutex = OS::CreateMutex(); | |
44 CHECK_EQ(0, mutex->Lock()); // acquire the lock with the right token | |
45 CHECK_EQ(0, mutex->Unlock()); // can unlock with the right token | |
46 delete mutex; | |
47 } | |
48 | |
49 | |
50 TEST(MultiLock) { | |
51 Mutex* mutex = OS::CreateMutex(); | |
52 CHECK_EQ(0, mutex->Lock()); | |
53 CHECK_EQ(0, mutex->Unlock()); | |
54 delete mutex; | |
55 } | |
56 | |
57 | |
58 TEST(ShallowLock) { | |
59 Mutex* mutex = OS::CreateMutex(); | |
60 CHECK_EQ(0, mutex->Lock()); | |
61 CHECK_EQ(0, mutex->Unlock()); | |
62 CHECK_EQ(0, mutex->Lock()); | |
63 CHECK_EQ(0, mutex->Unlock()); | |
64 delete mutex; | |
65 } | |
66 | |
67 | |
68 TEST(SemaphoreTimeout) { | |
69 bool ok; | |
70 Semaphore* sem = OS::CreateSemaphore(0); | |
71 | |
72 // Semaphore not signalled - timeout. | |
73 ok = sem->Wait(0); | |
74 CHECK(!ok); | |
75 ok = sem->Wait(100); | |
76 CHECK(!ok); | |
77 ok = sem->Wait(1000); | |
78 CHECK(!ok); | |
79 | |
80 // Semaphore signalled - no timeout. | |
81 sem->Signal(); | |
82 ok = sem->Wait(0); | |
83 sem->Signal(); | |
84 ok = sem->Wait(100); | |
85 sem->Signal(); | |
86 ok = sem->Wait(1000); | |
87 CHECK(ok); | |
88 delete sem; | |
89 } | |
OLD | NEW |