blob: 0b562fc282f3fc63e2a8b55bdf2555db93acc909 [file] [log] [blame]
Ben Murdoch8b112d22011-06-08 16:22:53 +01001// Copyright 2011 the V8 project authors. All rights reserved.
Steve Blocka7e24c12009-10-30 11:49:00 +00002// 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
Steve Block44f0eee2011-05-26 01:26:41 +010030#include "isolate.h"
Steve Blocka7e24c12009-10-30 11:49:00 +000031#include "bootstrapper.h"
32#include "debug.h"
Ben Murdochb0fe1622011-05-05 13:52:32 +010033#include "deoptimizer.h"
34#include "heap-profiler.h"
35#include "hydrogen.h"
36#include "lithium-allocator.h"
37#include "log.h"
Ben Murdochb0fe1622011-05-05 13:52:32 +010038#include "runtime-profiler.h"
Steve Blocka7e24c12009-10-30 11:49:00 +000039#include "serialize.h"
Steve Blocka7e24c12009-10-30 11:49:00 +000040
41namespace v8 {
42namespace internal {
43
Ben Murdoch8b112d22011-06-08 16:22:53 +010044static Mutex* init_once_mutex = OS::CreateMutex();
45static bool init_once_called = false;
46
Steve Blocka7e24c12009-10-30 11:49:00 +000047bool V8::is_running_ = false;
48bool V8::has_been_setup_ = false;
49bool V8::has_been_disposed_ = false;
50bool V8::has_fatal_error_ = false;
Ben Murdochb0fe1622011-05-05 13:52:32 +010051bool V8::use_crankshaft_ = true;
Steve Blocka7e24c12009-10-30 11:49:00 +000052
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -080053
Steve Block6ded16b2010-05-10 14:33:55 +010054bool V8::Initialize(Deserializer* des) {
Ben Murdoch8b112d22011-06-08 16:22:53 +010055 InitializeOncePerProcess();
56
Steve Block44f0eee2011-05-26 01:26:41 +010057 // The current thread may not yet had entered an isolate to run.
58 // Note the Isolate::Current() may be non-null because for various
59 // initialization purposes an initializing thread may be assigned an isolate
60 // but not actually enter it.
61 if (i::Isolate::CurrentPerIsolateThreadData() == NULL) {
62 i::Isolate::EnterDefaultIsolate();
63 }
64
65 ASSERT(i::Isolate::CurrentPerIsolateThreadData() != NULL);
Ben Murdoch8b112d22011-06-08 16:22:53 +010066 ASSERT(i::Isolate::CurrentPerIsolateThreadData()->thread_id().Equals(
67 i::ThreadId::Current()));
Steve Block44f0eee2011-05-26 01:26:41 +010068 ASSERT(i::Isolate::CurrentPerIsolateThreadData()->isolate() ==
69 i::Isolate::Current());
70
71 if (IsDead()) return false;
72
73 Isolate* isolate = Isolate::Current();
74 if (isolate->IsInitialized()) return true;
Steve Blocka7e24c12009-10-30 11:49:00 +000075
76 is_running_ = true;
77 has_been_setup_ = true;
78 has_fatal_error_ = false;
79 has_been_disposed_ = false;
Steve Blocka7e24c12009-10-30 11:49:00 +000080
Steve Block44f0eee2011-05-26 01:26:41 +010081 return isolate->Init(des);
Steve Blocka7e24c12009-10-30 11:49:00 +000082}
83
84
85void V8::SetFatalError() {
86 is_running_ = false;
87 has_fatal_error_ = true;
88}
89
90
91void V8::TearDown() {
Steve Block44f0eee2011-05-26 01:26:41 +010092 Isolate* isolate = Isolate::Current();
93 ASSERT(isolate->IsDefaultIsolate());
94
Steve Blocka7e24c12009-10-30 11:49:00 +000095 if (!has_been_setup_ || has_been_disposed_) return;
Steve Block44f0eee2011-05-26 01:26:41 +010096 isolate->TearDown();
Steve Blocka7e24c12009-10-30 11:49:00 +000097
98 is_running_ = false;
99 has_been_disposed_ = true;
100}
101
102
Steve Block6ded16b2010-05-10 14:33:55 +0100103static uint32_t random_seed() {
104 if (FLAG_random_seed == 0) {
105 return random();
106 }
107 return FLAG_random_seed;
108}
109
110
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -0800111typedef struct {
112 uint32_t hi;
113 uint32_t lo;
114} random_state;
Steve Blocka7e24c12009-10-30 11:49:00 +0000115
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -0800116
117// Random number generator using George Marsaglia's MWC algorithm.
118static uint32_t random_base(random_state *state) {
Steve Blocka7e24c12009-10-30 11:49:00 +0000119 // Initialize seed using the system random(). If one of the seeds
120 // should ever become zero again, or if random() returns zero, we
121 // avoid getting stuck with zero bits in hi or lo by re-initializing
122 // them on demand.
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -0800123 if (state->hi == 0) state->hi = random_seed();
124 if (state->lo == 0) state->lo = random_seed();
Steve Blocka7e24c12009-10-30 11:49:00 +0000125
126 // Mix the bits.
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -0800127 state->hi = 36969 * (state->hi & 0xFFFF) + (state->hi >> 16);
128 state->lo = 18273 * (state->lo & 0xFFFF) + (state->lo >> 16);
129 return (state->hi << 16) + (state->lo & 0xFFFF);
130}
131
132
133// Used by JavaScript APIs
Steve Block44f0eee2011-05-26 01:26:41 +0100134uint32_t V8::Random(Isolate* isolate) {
135 ASSERT(isolate == Isolate::Current());
136 // TODO(isolates): move lo and hi to isolate
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -0800137 static random_state state = {0, 0};
138 return random_base(&state);
139}
140
141
142// Used internally by the JIT and memory allocator for security
143// purposes. So, we keep a different state to prevent informations
144// leaks that could be used in an exploit.
Steve Block44f0eee2011-05-26 01:26:41 +0100145uint32_t V8::RandomPrivate(Isolate* isolate) {
146 ASSERT(isolate == Isolate::Current());
147 // TODO(isolates): move lo and hi to isolate
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -0800148 static random_state state = {0, 0};
149 return random_base(&state);
Steve Blocka7e24c12009-10-30 11:49:00 +0000150}
151
152
Steve Block3ce2e202009-11-05 08:53:23 +0000153bool V8::IdleNotification() {
Steve Blocka7e24c12009-10-30 11:49:00 +0000154 // Returning true tells the caller that there is no need to call
155 // IdleNotification again.
156 if (!FLAG_use_idle_notification) return true;
Steve Blocka7e24c12009-10-30 11:49:00 +0000157
158 // Tell the heap that it may want to adjust.
Steve Block44f0eee2011-05-26 01:26:41 +0100159 return HEAP->IdleNotification();
Steve Blocka7e24c12009-10-30 11:49:00 +0000160}
161
162
Steve Block6ded16b2010-05-10 14:33:55 +0100163// Use a union type to avoid type-aliasing optimizations in GCC.
164typedef union {
165 double double_value;
166 uint64_t uint64_t_value;
167} double_int_union;
168
169
Ben Murdoch8b112d22011-06-08 16:22:53 +0100170Object* V8::FillHeapNumberWithRandom(Object* heap_number, Isolate* isolate) {
171 uint64_t random_bits = Random(isolate);
Steve Block6ded16b2010-05-10 14:33:55 +0100172 // Make a double* from address (heap_number + sizeof(double)).
173 double_int_union* r = reinterpret_cast<double_int_union*>(
174 reinterpret_cast<char*>(heap_number) +
175 HeapNumber::kValueOffset - kHeapObjectTag);
176 // Convert 32 random bits to 0.(32 random bits) in a double
177 // by computing:
178 // ( 1.(20 0s)(32 random bits) x 2^20 ) - (1.0 x 2^20)).
179 const double binary_million = 1048576.0;
180 r->double_value = binary_million;
181 r->uint64_t_value |= random_bits;
182 r->double_value -= binary_million;
183
184 return heap_number;
Steve Blocka7e24c12009-10-30 11:49:00 +0000185}
186
Ben Murdoch8b112d22011-06-08 16:22:53 +0100187
188void V8::InitializeOncePerProcess() {
189 ScopedLock lock(init_once_mutex);
190 if (init_once_called) return;
191 init_once_called = true;
192
193 // Setup the platform OS support.
194 OS::Setup();
195
196 use_crankshaft_ = FLAG_crankshaft;
197
198 if (Serializer::enabled()) {
199 use_crankshaft_ = false;
200 }
201
202 CPU::Setup();
203 if (!CPU::SupportsCrankshaft()) {
204 use_crankshaft_ = false;
205 }
206
207 RuntimeProfiler::GlobalSetup();
208
209 // Peephole optimization might interfere with deoptimization.
210 FLAG_peephole_optimization = !use_crankshaft_;
211}
212
Steve Blocka7e24c12009-10-30 11:49:00 +0000213} } // namespace v8::internal