blob: 36f835f00f1be73859bd305ab77f6277759e2058 [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
Ben Murdoch3fb3ca82011-12-02 17:19:32 +000053static Mutex* entropy_mutex = OS::CreateMutex();
54static EntropySource entropy_source;
55
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -080056
Steve Block6ded16b2010-05-10 14:33:55 +010057bool V8::Initialize(Deserializer* des) {
Ben Murdoch8b112d22011-06-08 16:22:53 +010058 InitializeOncePerProcess();
59
Steve Block44f0eee2011-05-26 01:26:41 +010060 // The current thread may not yet had entered an isolate to run.
61 // Note the Isolate::Current() may be non-null because for various
62 // initialization purposes an initializing thread may be assigned an isolate
63 // but not actually enter it.
64 if (i::Isolate::CurrentPerIsolateThreadData() == NULL) {
65 i::Isolate::EnterDefaultIsolate();
66 }
67
68 ASSERT(i::Isolate::CurrentPerIsolateThreadData() != NULL);
Ben Murdoch8b112d22011-06-08 16:22:53 +010069 ASSERT(i::Isolate::CurrentPerIsolateThreadData()->thread_id().Equals(
70 i::ThreadId::Current()));
Steve Block44f0eee2011-05-26 01:26:41 +010071 ASSERT(i::Isolate::CurrentPerIsolateThreadData()->isolate() ==
72 i::Isolate::Current());
73
74 if (IsDead()) return false;
75
76 Isolate* isolate = Isolate::Current();
77 if (isolate->IsInitialized()) return true;
Steve Blocka7e24c12009-10-30 11:49:00 +000078
79 is_running_ = true;
80 has_been_setup_ = true;
81 has_fatal_error_ = false;
82 has_been_disposed_ = false;
Steve Blocka7e24c12009-10-30 11:49:00 +000083
Steve Block44f0eee2011-05-26 01:26:41 +010084 return isolate->Init(des);
Steve Blocka7e24c12009-10-30 11:49:00 +000085}
86
87
88void V8::SetFatalError() {
89 is_running_ = false;
90 has_fatal_error_ = true;
91}
92
93
94void V8::TearDown() {
Steve Block44f0eee2011-05-26 01:26:41 +010095 Isolate* isolate = Isolate::Current();
96 ASSERT(isolate->IsDefaultIsolate());
97
Steve Blocka7e24c12009-10-30 11:49:00 +000098 if (!has_been_setup_ || has_been_disposed_) return;
Steve Block44f0eee2011-05-26 01:26:41 +010099 isolate->TearDown();
Steve Blocka7e24c12009-10-30 11:49:00 +0000100
101 is_running_ = false;
102 has_been_disposed_ = true;
103}
104
105
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000106static void seed_random(uint32_t* state) {
107 for (int i = 0; i < 2; ++i) {
108 if (FLAG_random_seed != 0) {
109 state[i] = FLAG_random_seed;
110 } else if (entropy_source != NULL) {
111 uint32_t val;
112 ScopedLock lock(entropy_mutex);
113 entropy_source(reinterpret_cast<unsigned char*>(&val), sizeof(uint32_t));
114 state[i] = val;
115 } else {
116 state[i] = random();
117 }
Steve Block6ded16b2010-05-10 14:33:55 +0100118 }
Steve Block6ded16b2010-05-10 14:33:55 +0100119}
120
121
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -0800122// Random number generator using George Marsaglia's MWC algorithm.
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000123static uint32_t random_base(uint32_t* state) {
124 // Initialize seed using the system random().
125 // No non-zero seed will ever become zero again.
126 if (state[0] == 0) seed_random(state);
Steve Blocka7e24c12009-10-30 11:49:00 +0000127
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000128 // Mix the bits. Never replaces state[i] with 0 if it is nonzero.
129 state[0] = 18273 * (state[0] & 0xFFFF) + (state[0] >> 16);
130 state[1] = 36969 * (state[1] & 0xFFFF) + (state[1] >> 16);
131
132 return (state[0] << 14) + (state[1] & 0x3FFFF);
133}
134
135
136void V8::SetEntropySource(EntropySource source) {
137 entropy_source = source;
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -0800138}
139
140
141// Used by JavaScript APIs
Steve Block44f0eee2011-05-26 01:26:41 +0100142uint32_t V8::Random(Isolate* isolate) {
143 ASSERT(isolate == Isolate::Current());
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000144 return random_base(isolate->random_seed());
Shimeng (Simon) Wang8a31eba2010-12-06 19:01:33 -0800145}
146
147
148// Used internally by the JIT and memory allocator for security
149// purposes. So, we keep a different state to prevent informations
150// leaks that could be used in an exploit.
Steve Block44f0eee2011-05-26 01:26:41 +0100151uint32_t V8::RandomPrivate(Isolate* isolate) {
152 ASSERT(isolate == Isolate::Current());
Ben Murdoch3fb3ca82011-12-02 17:19:32 +0000153 return random_base(isolate->private_random_seed());
Steve Blocka7e24c12009-10-30 11:49:00 +0000154}
155
156
Steve Block3ce2e202009-11-05 08:53:23 +0000157bool V8::IdleNotification() {
Steve Blocka7e24c12009-10-30 11:49:00 +0000158 // Returning true tells the caller that there is no need to call
159 // IdleNotification again.
160 if (!FLAG_use_idle_notification) return true;
Steve Blocka7e24c12009-10-30 11:49:00 +0000161
162 // Tell the heap that it may want to adjust.
Steve Block44f0eee2011-05-26 01:26:41 +0100163 return HEAP->IdleNotification();
Steve Blocka7e24c12009-10-30 11:49:00 +0000164}
165
166
Steve Block6ded16b2010-05-10 14:33:55 +0100167// Use a union type to avoid type-aliasing optimizations in GCC.
168typedef union {
169 double double_value;
170 uint64_t uint64_t_value;
171} double_int_union;
172
173
Ben Murdoch8b112d22011-06-08 16:22:53 +0100174Object* V8::FillHeapNumberWithRandom(Object* heap_number, Isolate* isolate) {
175 uint64_t random_bits = Random(isolate);
Steve Block6ded16b2010-05-10 14:33:55 +0100176 // Make a double* from address (heap_number + sizeof(double)).
177 double_int_union* r = reinterpret_cast<double_int_union*>(
178 reinterpret_cast<char*>(heap_number) +
179 HeapNumber::kValueOffset - kHeapObjectTag);
180 // Convert 32 random bits to 0.(32 random bits) in a double
181 // by computing:
182 // ( 1.(20 0s)(32 random bits) x 2^20 ) - (1.0 x 2^20)).
183 const double binary_million = 1048576.0;
184 r->double_value = binary_million;
185 r->uint64_t_value |= random_bits;
186 r->double_value -= binary_million;
187
188 return heap_number;
Steve Blocka7e24c12009-10-30 11:49:00 +0000189}
190
Ben Murdoch8b112d22011-06-08 16:22:53 +0100191
192void V8::InitializeOncePerProcess() {
193 ScopedLock lock(init_once_mutex);
194 if (init_once_called) return;
195 init_once_called = true;
196
197 // Setup the platform OS support.
198 OS::Setup();
199
200 use_crankshaft_ = FLAG_crankshaft;
201
202 if (Serializer::enabled()) {
203 use_crankshaft_ = false;
204 }
205
206 CPU::Setup();
207 if (!CPU::SupportsCrankshaft()) {
208 use_crankshaft_ = false;
209 }
210
211 RuntimeProfiler::GlobalSetup();
212
213 // Peephole optimization might interfere with deoptimization.
214 FLAG_peephole_optimization = !use_crankshaft_;
215}
216
Steve Blocka7e24c12009-10-30 11:49:00 +0000217} } // namespace v8::internal