blob: 985b9e5b99308a87b25c0c6420630d119f20976c [file] [log] [blame]
Steve Blocka7e24c12009-10-30 11:49:00 +00001// Copyright 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#include "v8.h"
29
30#include "platform.h"
Ben Murdoch8b112d22011-06-08 16:22:53 +010031#include "isolate.h"
Steve Blocka7e24c12009-10-30 11:49:00 +000032
33#include "cctest.h"
34
35
36TEST(Preemption) {
37 v8::Locker locker;
38 v8::V8::Initialize();
39 v8::HandleScope scope;
40 v8::Context::Scope context_scope(v8::Context::New());
41
42 v8::Locker::StartPreemption(100);
43
44 v8::Handle<v8::Script> script = v8::Script::Compile(
45 v8::String::New("var count = 0; var obj = new Object(); count++;\n"));
46
47 script->Run();
48
49 v8::Locker::StopPreemption();
50 v8::internal::OS::Sleep(500); // Make sure the timer fires.
51
52 script->Run();
53}
Steve Block6ded16b2010-05-10 14:33:55 +010054
55
56enum Turn {
57 FILL_CACHE,
58 CLEAN_CACHE,
59 SECOND_TIME_FILL_CACHE,
60 DONE
61};
62
63static Turn turn = FILL_CACHE;
64
65
66class ThreadA: public v8::internal::Thread {
67 public:
Ben Murdoch3fb3ca82011-12-02 17:19:32 +000068 ThreadA() : Thread("ThreadA") { }
Steve Block6ded16b2010-05-10 14:33:55 +010069 void Run() {
70 v8::Locker locker;
71 v8::HandleScope scope;
72 v8::Context::Scope context_scope(v8::Context::New());
73
74 CHECK_EQ(FILL_CACHE, turn);
75
76 // Fill String.search cache.
77 v8::Handle<v8::Script> script = v8::Script::Compile(
78 v8::String::New(
79 "for (var i = 0; i < 3; i++) {"
80 " var result = \"a\".search(\"a\");"
81 " if (result != 0) throw \"result: \" + result + \" @\" + i;"
82 "};"
83 "true"));
84 CHECK(script->Run()->IsTrue());
85
86 turn = CLEAN_CACHE;
87 do {
88 {
89 v8::Unlocker unlocker;
90 Thread::YieldCPU();
91 }
92 } while (turn != SECOND_TIME_FILL_CACHE);
93
94 // Rerun the script.
95 CHECK(script->Run()->IsTrue());
96
97 turn = DONE;
98 }
99};
100
101
102class ThreadB: public v8::internal::Thread {
103 public:
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000104 ThreadB() : Thread("ThreadB") { }
Steve Block6ded16b2010-05-10 14:33:55 +0100105 void Run() {
106 do {
107 {
108 v8::Locker locker;
109 if (turn == CLEAN_CACHE) {
110 v8::HandleScope scope;
111 v8::Context::Scope context_scope(v8::Context::New());
112
113 // Clear the caches by forcing major GC.
Steve Block44f0eee2011-05-26 01:26:41 +0100114 HEAP->CollectAllGarbage(false);
Steve Block6ded16b2010-05-10 14:33:55 +0100115 turn = SECOND_TIME_FILL_CACHE;
116 break;
117 }
118 }
119
120 Thread::YieldCPU();
121 } while (true);
122 }
123};
124
125
126TEST(JSFunctionResultCachesInTwoThreads) {
127 v8::V8::Initialize();
128
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000129 ThreadA threadA;
130 ThreadB threadB;
Steve Block6ded16b2010-05-10 14:33:55 +0100131
132 threadA.Start();
133 threadB.Start();
134
135 threadA.Join();
136 threadB.Join();
137
138 CHECK_EQ(DONE, turn);
139}
Ben Murdoch8b112d22011-06-08 16:22:53 +0100140
141class ThreadIdValidationThread : public v8::internal::Thread {
142 public:
143 ThreadIdValidationThread(i::Thread* thread_to_start,
144 i::List<i::ThreadId>* refs,
145 unsigned int thread_no,
146 i::Semaphore* semaphore)
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000147 : Thread("ThreadRefValidationThread"),
Ben Murdoch8b112d22011-06-08 16:22:53 +0100148 refs_(refs), thread_no_(thread_no), thread_to_start_(thread_to_start),
149 semaphore_(semaphore) {
150 }
151
152 void Run() {
153 i::ThreadId thread_id = i::ThreadId::Current();
154 for (int i = 0; i < thread_no_; i++) {
155 CHECK(!(*refs_)[i].Equals(thread_id));
156 }
157 CHECK(thread_id.IsValid());
158 (*refs_)[thread_no_] = thread_id;
159 if (thread_to_start_ != NULL) {
160 thread_to_start_->Start();
161 }
162 semaphore_->Signal();
163 }
Ben Murdoch589d6972011-11-30 16:04:58 +0000164
Ben Murdoch8b112d22011-06-08 16:22:53 +0100165 private:
166 i::List<i::ThreadId>* refs_;
167 int thread_no_;
168 i::Thread* thread_to_start_;
169 i::Semaphore* semaphore_;
170};
171
172TEST(ThreadIdValidation) {
173 const int kNThreads = 100;
174 i::List<ThreadIdValidationThread*> threads(kNThreads);
175 i::List<i::ThreadId> refs(kNThreads);
176 i::Semaphore* semaphore = i::OS::CreateSemaphore(0);
177 ThreadIdValidationThread* prev = NULL;
178 for (int i = kNThreads - 1; i >= 0; i--) {
179 ThreadIdValidationThread* newThread =
180 new ThreadIdValidationThread(prev, &refs, i, semaphore);
181 threads.Add(newThread);
182 prev = newThread;
183 refs.Add(i::ThreadId::Invalid());
184 }
185 prev->Start();
186 for (int i = 0; i < kNThreads; i++) {
187 semaphore->Wait();
188 }
189 for (int i = 0; i < kNThreads; i++) {
190 delete threads[i];
191 }
192}