heap.h File Reference
#include <cmath>#include "src/allocation.h"#include "src/assert-scope.h"#include "src/counters.h"#include "src/globals.h"#include "src/heap/gc-idle-time-handler.h"#include "src/heap/gc-tracer.h"#include "src/heap/incremental-marking.h"#include "src/heap/mark-compact.h"#include "src/heap/objects-visiting.h"#include "src/heap/spaces.h"#include "src/heap/store-buffer.h"#include "src/list.h"#include "src/splay-tree-inl.h"
Include dependency graph for heap.h: This graph shows which files directly or indirectly include this file:Go to the source code of this file.
Namespaces | |
| v8 | |
| Debugger support for the V8 JavaScript engine. | |
| v8::internal | |
Macros | |
| #define | STRONG_ROOT_LIST(V) |
| #define | SMI_ROOT_LIST(V) |
| #define | ROOT_LIST(V) |
| #define | IMMORTAL_IMMOVABLE_ROOT_LIST(V) |
| #define | INTERNALIZED_STRING_LIST(V) |
| #define | ROOT_ACCESSOR(type, name, camel_name) |
| #define | STRUCT_MAP_ACCESSOR(NAME, Name, name) Map* name##_map() { return Map::cast(roots_[k##Name##MapRootIndex]); } |
| #define | STRING_ACCESSOR(name, str) String* name() { return String::cast(roots_[k##name##RootIndex]); } |
| #define | ROOT_INDEX_DECLARATION(type, name, camel_name) k##camel_name##RootIndex, |
| #define | STRING_INDEX_DECLARATION(name, str) k##name##RootIndex, |
| #define | DECLARE_STRUCT_MAP(NAME, Name, name) k##Name##MapRootIndex, |
| #define | ROOT_INDEX_DECLARATION(type, name, camel_name) k##camel_name##RootIndex, |
| #define | ROOT_ACCESSOR(type, name, camel_name) |
Typedefs | |
| typedef String *(* | v8::internal::ExternalStringTableUpdaterCallback) (Heap *heap, Object **pointer) |
| typedef void(* | v8::internal::ScavengingCallback) (Map *map, HeapObject **slot, HeapObject *object) |
Enumerations | |
| enum | v8::internal::ArrayStorageAllocationMode { v8::internal::DONT_INITIALIZE_ARRAY_ELEMENTS , v8::internal::INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE } |
Macro Definition Documentation
◆ DECLARE_STRUCT_MAP
| #define DECLARE_STRUCT_MAP | ( | NAME, | |
| Name, | |||
| name | |||
| ) | k##Name##MapRootIndex, |
◆ IMMORTAL_IMMOVABLE_ROOT_LIST
◆ INTERNALIZED_STRING_LIST
◆ ROOT_ACCESSOR [1/2]
| #define ROOT_ACCESSOR | ( | type, | |
| name, | |||
| camel_name | |||
| ) |
Value:
type* name() { return type::cast(roots_[k##camel_name##RootIndex]); } \
type* raw_unchecked_##name() { \
return reinterpret_cast<type*>(roots_[k##camel_name##RootIndex]); \
}
enable harmony numeric enable harmony object literal extensions Optimize object Array DOM strings and string trace pretenuring decisions of HAllocate instructions Enables optimizations which favor memory size over execution speed maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining trace the tracking of allocation sites deoptimize every n garbage collections perform array bounds checks elimination analyze liveness of environment slots and zap dead values flushes the cache of optimized code for closures on every GC allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes enable context specialization in TurboFan execution budget before interrupt is triggered max percentage of megamorphic generic ICs to allow optimization enable use of SAHF instruction if enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable use of MLS instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long enable alignment of csp to bytes on platforms which prefer the register to always be expose gc extension under the specified name show built in functions in stack traces use random jit cookie to mask large constants minimum length for automatic enable preparsing CPU profiler sampling interval in microseconds trace out of bounds accesses to external arrays default size of stack region v8 is allowed to maximum length of function source code printed in a stack trace min size of a semi the new space consists of two semi spaces print one trace line following each garbage collection do not print trace line after scavenger collection print cumulative GC statistics in name
Definition: flag-definitions.h:504
◆ ROOT_ACCESSOR [2/2]
| #define ROOT_ACCESSOR | ( | type, | |
| name, | |||
| camel_name | |||
| ) |
Value:
/* The deserializer makes use of the fact that these common roots are */ \
/* never in new space and never on a page that is being compacted. */ \
DCHECK(k##camel_name##RootIndex >= kOldSpaceRoots || !InNewSpace(value)); \
roots_[k##camel_name##RootIndex] = value; \
}
◆ ROOT_INDEX_DECLARATION [1/2]
| #define ROOT_INDEX_DECLARATION | ( | type, | |
| name, | |||
| camel_name | |||
| ) | k##camel_name##RootIndex, |
◆ ROOT_INDEX_DECLARATION [2/2]
| #define ROOT_INDEX_DECLARATION | ( | type, | |
| name, | |||
| camel_name | |||
| ) | k##camel_name##RootIndex, |
◆ ROOT_LIST
◆ SMI_ROOT_LIST
| #define SMI_ROOT_LIST | ( | V | ) |
Value:
V(Smi, stack_limit, StackLimit) \
V(Smi, real_stack_limit, RealStackLimit) \
V(Smi, last_script_id, LastScriptId) \
V(Smi, arguments_adaptor_deopt_pc_offset, ArgumentsAdaptorDeoptPCOffset) \
V(Smi, construct_stub_deopt_pc_offset, ConstructStubDeoptPCOffset) \
V(Smi, getter_stub_deopt_pc_offset, GetterStubDeoptPCOffset) \
V(Smi, setter_stub_deopt_pc_offset, SetterStubDeoptPCOffset)
