blob: 1e9b5dc142025aad9fbe471ee79c8b30e3b8973c [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"
Ben Murdoch69a99ed2011-11-30 16:03:39 +000031#include "elements.h"
Steve Blocka7e24c12009-10-30 11:49:00 +000032#include "bootstrapper.h"
33#include "debug.h"
Ben Murdochb0fe1622011-05-05 13:52:32 +010034#include "deoptimizer.h"
35#include "heap-profiler.h"
36#include "hydrogen.h"
37#include "lithium-allocator.h"
38#include "log.h"
Ben Murdochb0fe1622011-05-05 13:52:32 +010039#include "runtime-profiler.h"
Steve Blocka7e24c12009-10-30 11:49:00 +000040#include "serialize.h"
Steve Blocka7e24c12009-10-30 11:49:00 +000041
42namespace v8 {
43namespace internal {
44
Ben Murdoch8b112d22011-06-08 16:22:53 +010045static Mutex* init_once_mutex = OS::CreateMutex();
46static bool init_once_called = false;
47
Steve Blocka7e24c12009-10-30 11:49:00 +000048bool V8::is_running_ = false;
49bool V8::has_been_setup_ = false;
50bool V8::has_been_disposed_ = false;
51bool V8::has_fatal_error_ = false;
Ben Murdochb0fe1622011-05-05 13:52:32 +010052bool V8::use_crankshaft_ = true;
Steve Blocka7e24c12009-10-30 11:49:00 +000053
Ben Murdoch3fb3ca82011-12-02 17:19:32 +000054static Mutex* entropy_mutex = OS::CreateMutex();
55static EntropySource entropy_source;
56
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -080057
Steve Block6ded16b2010-05-10 14:33:55 +010058bool V8::Initialize(Deserializer* des) {
Ben Murdoch8b112d22011-06-08 16:22:53 +010059 InitializeOncePerProcess();
60
Steve Block44f0eee2011-05-26 01:26:41 +010061 // The current thread may not yet had entered an isolate to run.
62 // Note the Isolate::Current() may be non-null because for various
63 // initialization purposes an initializing thread may be assigned an isolate
64 // but not actually enter it.
65 if (i::Isolate::CurrentPerIsolateThreadData() == NULL) {
66 i::Isolate::EnterDefaultIsolate();
67 }
68
69 ASSERT(i::Isolate::CurrentPerIsolateThreadData() != NULL);
Ben Murdoch8b112d22011-06-08 16:22:53 +010070 ASSERT(i::Isolate::CurrentPerIsolateThreadData()->thread_id().Equals(
71 i::ThreadId::Current()));
Steve Block44f0eee2011-05-26 01:26:41 +010072 ASSERT(i::Isolate::CurrentPerIsolateThreadData()->isolate() ==
73 i::Isolate::Current());
74
75 if (IsDead()) return false;
76
77 Isolate* isolate = Isolate::Current();
78 if (isolate->IsInitialized()) return true;
Steve Blocka7e24c12009-10-30 11:49:00 +000079
80 is_running_ = true;
81 has_been_setup_ = true;
82 has_fatal_error_ = false;
83 has_been_disposed_ = false;
Steve Blocka7e24c12009-10-30 11:49:00 +000084
Steve Block44f0eee2011-05-26 01:26:41 +010085 return isolate->Init(des);
Steve Blocka7e24c12009-10-30 11:49:00 +000086}
87
88
89void V8::SetFatalError() {
90 is_running_ = false;
91 has_fatal_error_ = true;
92}
93
94
95void V8::TearDown() {
Steve Block44f0eee2011-05-26 01:26:41 +010096 Isolate* isolate = Isolate::Current();
97 ASSERT(isolate->IsDefaultIsolate());
98
Steve Blocka7e24c12009-10-30 11:49:00 +000099 if (!has_been_setup_ || has_been_disposed_) return;
Steve Block44f0eee2011-05-26 01:26:41 +0100100 isolate->TearDown();
Steve Blocka7e24c12009-10-30 11:49:00 +0000101
102 is_running_ = false;
103 has_been_disposed_ = true;
104}
105
106
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000107static void seed_random(uint32_t* state) {
108 for (int i = 0; i < 2; ++i) {
109 if (FLAG_random_seed != 0) {
110 state[i] = FLAG_random_seed;
111 } else if (entropy_source != NULL) {
112 uint32_t val;
113 ScopedLock lock(entropy_mutex);
114 entropy_source(reinterpret_cast<unsigned char*>(&val), sizeof(uint32_t));
115 state[i] = val;
116 } else {
117 state[i] = random();
118 }
Steve Block6ded16b2010-05-10 14:33:55 +0100119 }
Steve Block6ded16b2010-05-10 14:33:55 +0100120}
121
122
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -0800123// Random number generator using George Marsaglia's MWC algorithm.
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000124static uint32_t random_base(uint32_t* state) {
125 // Initialize seed using the system random().
126 // No non-zero seed will ever become zero again.
127 if (state[0] == 0) seed_random(state);
Steve Blocka7e24c12009-10-30 11:49:00 +0000128
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000129 // Mix the bits. Never replaces state[i] with 0 if it is nonzero.
130 state[0] = 18273 * (state[0] & 0xFFFF) + (state[0] >> 16);
131 state[1] = 36969 * (state[1] & 0xFFFF) + (state[1] >> 16);
132
133 return (state[0] << 14) + (state[1] & 0x3FFFF);
134}
135
136
137void V8::SetEntropySource(EntropySource source) {
138 entropy_source = source;
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -0800139}
140
141
142// Used by JavaScript APIs
Steve Block44f0eee2011-05-26 01:26:41 +0100143uint32_t V8::Random(Isolate* isolate) {
144 ASSERT(isolate == Isolate::Current());
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000145 return random_base(isolate->random_seed());
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -0800146}
147
148
149// Used internally by the JIT and memory allocator for security
150// purposes. So, we keep a different state to prevent informations
151// leaks that could be used in an exploit.
Steve Block44f0eee2011-05-26 01:26:41 +0100152uint32_t V8::RandomPrivate(Isolate* isolate) {
153 ASSERT(isolate == Isolate::Current());
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000154 return random_base(isolate->private_random_seed());
Steve Blocka7e24c12009-10-30 11:49:00 +0000155}
156
157
Steve Block3ce2e202009-11-05 08:53:23 +0000158bool V8::IdleNotification() {
Steve Blocka7e24c12009-10-30 11:49:00 +0000159 // Returning true tells the caller that there is no need to call
160 // IdleNotification again.
161 if (!FLAG_use_idle_notification) return true;
Steve Blocka7e24c12009-10-30 11:49:00 +0000162
163 // Tell the heap that it may want to adjust.
Steve Block44f0eee2011-05-26 01:26:41 +0100164 return HEAP->IdleNotification();
Steve Blocka7e24c12009-10-30 11:49:00 +0000165}
166
167
Steve Block6ded16b2010-05-10 14:33:55 +0100168// Use a union type to avoid type-aliasing optimizations in GCC.
169typedef union {
170 double double_value;
171 uint64_t uint64_t_value;
172} double_int_union;
173
174
Ben Murdoch8b112d22011-06-08 16:22:53 +0100175Object* V8::FillHeapNumberWithRandom(Object* heap_number, Isolate* isolate) {
176 uint64_t random_bits = Random(isolate);
Steve Block6ded16b2010-05-10 14:33:55 +0100177 // Make a double* from address (heap_number + sizeof(double)).
178 double_int_union* r = reinterpret_cast<double_int_union*>(
179 reinterpret_cast<char*>(heap_number) +
180 HeapNumber::kValueOffset - kHeapObjectTag);
181 // Convert 32 random bits to 0.(32 random bits) in a double
182 // by computing:
183 // ( 1.(20 0s)(32 random bits) x 2^20 ) - (1.0 x 2^20)).
184 const double binary_million = 1048576.0;
185 r->double_value = binary_million;
186 r->uint64_t_value |= random_bits;
187 r->double_value -= binary_million;
188
189 return heap_number;
Steve Blocka7e24c12009-10-30 11:49:00 +0000190}
191
Ben Murdoch8b112d22011-06-08 16:22:53 +0100192
193void V8::InitializeOncePerProcess() {
194 ScopedLock lock(init_once_mutex);
195 if (init_once_called) return;
196 init_once_called = true;
197
198 // Setup the platform OS support.
199 OS::Setup();
200
201 use_crankshaft_ = FLAG_crankshaft;
202
203 if (Serializer::enabled()) {
204 use_crankshaft_ = false;
205 }
206
207 CPU::Setup();
208 if (!CPU::SupportsCrankshaft()) {
209 use_crankshaft_ = false;
210 }
211
212 RuntimeProfiler::GlobalSetup();
213
214 // Peephole optimization might interfere with deoptimization.
215 FLAG_peephole_optimization = !use_crankshaft_;
Ben Murdoch69a99ed2011-11-30 16:03:39 +0000216
217 ElementsAccessor::InitializeOncePerProcess();
Ben Murdoch8b112d22011-06-08 16:22:53 +0100218}
219
Steve Blocka7e24c12009-10-30 11:49:00 +0000220} } // namespace v8::internal