OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 245 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
256 // ( 1.(20 0s)(32 random bits) x 2^20 ) - (1.0 x 2^20)). | 256 // ( 1.(20 0s)(32 random bits) x 2^20 ) - (1.0 x 2^20)). |
257 static const double binary_million = 1048576.0; | 257 static const double binary_million = 1048576.0; |
258 r.double_value = binary_million; | 258 r.double_value = binary_million; |
259 r.uint64_t_value |= random_bits; | 259 r.uint64_t_value |= random_bits; |
260 r.double_value -= binary_million; | 260 r.double_value -= binary_million; |
261 | 261 |
262 HeapNumber::cast(heap_number)->set_value(r.double_value); | 262 HeapNumber::cast(heap_number)->set_value(r.double_value); |
263 return heap_number; | 263 return heap_number; |
264 } | 264 } |
265 | 265 |
| 266 |
266 void V8::InitializeOncePerProcessImpl() { | 267 void V8::InitializeOncePerProcessImpl() { |
267 FlagList::EnforceFlagImplications(); | 268 FlagList::EnforceFlagImplications(); |
268 if (FLAG_stress_compaction) { | 269 if (FLAG_stress_compaction) { |
269 FLAG_force_marking_deque_overflows = true; | 270 FLAG_force_marking_deque_overflows = true; |
270 FLAG_gc_global = true; | 271 FLAG_gc_global = true; |
271 FLAG_max_new_space_size = (1 << (kPageSizeBits - 10)) * 2; | 272 FLAG_max_new_space_size = (1 << (kPageSizeBits - 10)) * 2; |
272 } | 273 } |
273 if (FLAG_trace_hydrogen) FLAG_parallel_recompilation = false; | 274 if (FLAG_trace_hydrogen) FLAG_parallel_recompilation = false; |
274 | 275 |
275 if (FLAG_sweeper_threads <= 0) { | 276 if (FLAG_sweeper_threads <= 0) { |
(...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
316 && !Serializer::enabled() | 317 && !Serializer::enabled() |
317 && CPU::SupportsCrankshaft(); | 318 && CPU::SupportsCrankshaft(); |
318 OS::PostSetUp(); | 319 OS::PostSetUp(); |
319 ElementsAccessor::InitializeOncePerProcess(); | 320 ElementsAccessor::InitializeOncePerProcess(); |
320 LOperand::SetUpCaches(); | 321 LOperand::SetUpCaches(); |
321 SetUpJSCallerSavedCodeData(); | 322 SetUpJSCallerSavedCodeData(); |
322 ExternalReference::SetUp(); | 323 ExternalReference::SetUp(); |
323 Bootstrapper::InitializeOncePerProcess(); | 324 Bootstrapper::InitializeOncePerProcess(); |
324 } | 325 } |
325 | 326 |
| 327 |
326 void V8::InitializeOncePerProcess() { | 328 void V8::InitializeOncePerProcess() { |
327 CallOnce(&init_once, &InitializeOncePerProcessImpl); | 329 CallOnce(&init_once, &InitializeOncePerProcessImpl); |
328 } | 330 } |
329 | 331 |
330 } } // namespace v8::internal | 332 } } // namespace v8::internal |
OLD | NEW |