| OLD | NEW |
| 1 // Copyright 2006-2009 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2009 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 10 matching lines...) Expand all Loading... |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #include "v8.h" | 28 #include "v8.h" |
| 29 | 29 |
| 30 #include "isolate.h" | 30 #include "isolate.h" |
| 31 #include "bootstrapper.h" |
| 32 #include "debug.h" |
| 33 #include "deoptimizer.h" |
| 34 #include "heap-profiler.h" |
| 35 #include "hydrogen.h" |
| 36 #include "lithium-allocator.h" |
| 37 #include "log.h" |
| 38 #include "runtime-profiler.h" |
| 31 #include "serialize.h" | 39 #include "serialize.h" |
| 32 | 40 |
| 33 namespace v8 { | 41 namespace v8 { |
| 34 namespace internal { | 42 namespace internal { |
| 35 | 43 |
| 36 bool V8::is_running_ = false; | 44 bool V8::is_running_ = false; |
| 37 bool V8::has_been_setup_ = false; | 45 bool V8::has_been_setup_ = false; |
| 38 bool V8::has_been_disposed_ = false; | 46 bool V8::has_been_disposed_ = false; |
| 39 bool V8::has_fatal_error_ = false; | 47 bool V8::has_fatal_error_ = false; |
| 40 bool V8::use_crankshaft_ = true; | 48 bool V8::use_crankshaft_ = true; |
| (...skipping 12 matching lines...) Expand all Loading... |
| 53 ASSERT(i::Isolate::CurrentPerIsolateThreadData()->thread_id() == | 61 ASSERT(i::Isolate::CurrentPerIsolateThreadData()->thread_id() == |
| 54 i::Thread::GetThreadLocalInt(i::Isolate::thread_id_key())); | 62 i::Thread::GetThreadLocalInt(i::Isolate::thread_id_key())); |
| 55 ASSERT(i::Isolate::CurrentPerIsolateThreadData()->isolate() == | 63 ASSERT(i::Isolate::CurrentPerIsolateThreadData()->isolate() == |
| 56 i::Isolate::Current()); | 64 i::Isolate::Current()); |
| 57 | 65 |
| 58 if (IsDead()) return false; | 66 if (IsDead()) return false; |
| 59 | 67 |
| 60 Isolate* isolate = Isolate::Current(); | 68 Isolate* isolate = Isolate::Current(); |
| 61 if (isolate->IsInitialized()) return true; | 69 if (isolate->IsInitialized()) return true; |
| 62 | 70 |
| 71 #if defined(V8_TARGET_ARCH_ARM) && !defined(USE_ARM_EABI) |
| 72 use_crankshaft_ = false; |
| 73 #else |
| 63 use_crankshaft_ = FLAG_crankshaft; | 74 use_crankshaft_ = FLAG_crankshaft; |
| 75 #endif |
| 76 |
| 64 // Peephole optimization might interfere with deoptimization. | 77 // Peephole optimization might interfere with deoptimization. |
| 65 FLAG_peephole_optimization = !use_crankshaft_; | 78 FLAG_peephole_optimization = !use_crankshaft_; |
| 66 | 79 |
| 67 is_running_ = true; | 80 is_running_ = true; |
| 68 has_been_setup_ = true; | 81 has_been_setup_ = true; |
| 69 has_fatal_error_ = false; | 82 has_fatal_error_ = false; |
| 70 has_been_disposed_ = false; | 83 has_been_disposed_ = false; |
| 71 | 84 |
| 72 return isolate->Init(des); | 85 return isolate->Init(des); |
| 73 } | 86 } |
| (...skipping 95 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 169 // ( 1.(20 0s)(32 random bits) x 2^20 ) - (1.0 x 2^20)). | 182 // ( 1.(20 0s)(32 random bits) x 2^20 ) - (1.0 x 2^20)). |
| 170 const double binary_million = 1048576.0; | 183 const double binary_million = 1048576.0; |
| 171 r->double_value = binary_million; | 184 r->double_value = binary_million; |
| 172 r->uint64_t_value |= random_bits; | 185 r->uint64_t_value |= random_bits; |
| 173 r->double_value -= binary_million; | 186 r->double_value -= binary_million; |
| 174 | 187 |
| 175 return heap_number; | 188 return heap_number; |
| 176 } | 189 } |
| 177 | 190 |
| 178 } } // namespace v8::internal | 191 } } // namespace v8::internal |
| OLD | NEW |