v8  3.25.30(node0.11.13)
V8 is Google's open source JavaScript engine
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
Data Structures | Namespaces | Macros | Functions | Variables
objects-inl.h File Reference
#include "elements.h"
#include "objects.h"
#include "contexts.h"
#include "conversions-inl.h"
#include "heap.h"
#include "isolate.h"
#include "heap-inl.h"
#include "property.h"
#include "spaces.h"
#include "store-buffer.h"
#include "v8memory.h"
#include "factory.h"
#include "incremental-marking.h"
#include "transitions-inl.h"
#include "objects-visiting.h"
Include dependency graph for objects-inl.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

class  SequentialStringKey< Char >
 
class  OneByteStringKey
 
class  SubStringKey< Char >
 
class  TwoByteStringKey
 
class  Utf8StringKey
 
class  ConsStringCaptureOp
 
class  Code::FindAndReplacePattern
 

Namespaces

 v8
 
 v8::internal
 

Macros

#define TYPE_CHECKER(type, instancetype)
 
#define CAST_ACCESSOR(type)
 
#define FIXED_TYPED_ARRAY_CAST_ACCESSOR(type)
 
#define INT_ACCESSORS(holder, name, offset)
 
#define ACCESSORS(holder, name, type, offset)
 
#define ACCESSORS_TO_SMI(holder, name, offset)
 
#define SMI_ACCESSORS(holder, name, offset)
 
#define BOOL_GETTER(holder, field, name, offset)
 
#define BOOL_ACCESSORS(holder, field, name, offset)
 
#define TYPED_ARRAY_TYPE_CHECKER(Type, type, TYPE, ctype, size)
 
#define MAKE_STRUCT_CASE(NAME, Name, name)   case NAME##_TYPE: return true;
 
#define MAKE_STRUCT_PREDICATE(NAME, Name, name)
 
#define FIELD_ADDR(p, offset)   (reinterpret_cast<byte*>(p) + offset - kHeapObjectTag)
 
#define READ_FIELD(p, offset)   (*reinterpret_cast<Object**>(FIELD_ADDR(p, offset)))
 
#define WRITE_FIELD(p, offset, value)   (*reinterpret_cast<Object**>(FIELD_ADDR(p, offset)) = value)
 
#define WRITE_BARRIER(heap, object, offset, value)
 
#define CONDITIONAL_WRITE_BARRIER(heap, object, offset, value, mode)
 
#define READ_DOUBLE_FIELD(p, offset)   (*reinterpret_cast<double*>(FIELD_ADDR(p, offset)))
 
#define WRITE_DOUBLE_FIELD(p, offset, value)   (*reinterpret_cast<double*>(FIELD_ADDR(p, offset)) = value)
 
#define READ_INT_FIELD(p, offset)   (*reinterpret_cast<int*>(FIELD_ADDR(p, offset)))
 
#define WRITE_INT_FIELD(p, offset, value)   (*reinterpret_cast<int*>(FIELD_ADDR(p, offset)) = value)
 
#define READ_INTPTR_FIELD(p, offset)   (*reinterpret_cast<intptr_t*>(FIELD_ADDR(p, offset)))
 
#define WRITE_INTPTR_FIELD(p, offset, value)   (*reinterpret_cast<intptr_t*>(FIELD_ADDR(p, offset)) = value)
 
#define READ_UINT32_FIELD(p, offset)   (*reinterpret_cast<uint32_t*>(FIELD_ADDR(p, offset)))
 
#define WRITE_UINT32_FIELD(p, offset, value)   (*reinterpret_cast<uint32_t*>(FIELD_ADDR(p, offset)) = value)
 
#define READ_INT32_FIELD(p, offset)   (*reinterpret_cast<int32_t*>(FIELD_ADDR(p, offset)))
 
#define WRITE_INT32_FIELD(p, offset, value)   (*reinterpret_cast<int32_t*>(FIELD_ADDR(p, offset)) = value)
 
#define READ_INT64_FIELD(p, offset)   (*reinterpret_cast<int64_t*>(FIELD_ADDR(p, offset)))
 
#define WRITE_INT64_FIELD(p, offset, value)   (*reinterpret_cast<int64_t*>(FIELD_ADDR(p, offset)) = value)
 
#define READ_SHORT_FIELD(p, offset)   (*reinterpret_cast<uint16_t*>(FIELD_ADDR(p, offset)))
 
#define WRITE_SHORT_FIELD(p, offset, value)   (*reinterpret_cast<uint16_t*>(FIELD_ADDR(p, offset)) = value)
 
#define READ_BYTE_FIELD(p, offset)   (*reinterpret_cast<byte*>(FIELD_ADDR(p, offset)))
 
#define WRITE_BYTE_FIELD(p, offset, value)   (*reinterpret_cast<byte*>(FIELD_ADDR(p, offset)) = value)
 
#define MAKE_STRUCT_CAST(NAME, Name, name)   CAST_ACCESSOR(Name)
 
#define TYPED_ARRAY_CASE(Type, type, TYPE, ctype, size)
 
#define CASE(name)   case name: return true;
 
#define PSEUDO_SMI_ACCESSORS_LO(holder, name, offset)
 
#define PSEUDO_SMI_ACCESSORS_HI(holder, name, offset)
 
#define EXTERNAL_ELEMENTS_CHECK(Type, type, TYPE, ctype, size)
 
#define FIXED_TYPED_ELEMENTS_CHECK(Type, type, TYPE, ctype, size)
 

Functions

 STATIC_CHECK ((kStringRepresentationMask|kStringEncodingMask)==Internals::kFullStringRepresentationMask)
 
 STATIC_CHECK (static_cast< uint32_t >(kStringEncodingMask)==Internals::kStringEncodingMask)
 
 STATIC_CHECK ((kExternalStringTag|kOneByteStringTag)==Internals::kExternalAsciiRepresentationTag)
 
 STATIC_CHECK (v8::String::ASCII_ENCODING==kOneByteStringTag)
 
 STATIC_CHECK ((kExternalStringTag|kTwoByteStringTag)==Internals::kExternalTwoByteRepresentationTag)
 
 STATIC_CHECK (v8::String::TWO_BYTE_ENCODING==kTwoByteStringTag)
 
template<>
bool Is< JSFunction > (Object *obj)
 
template<>
bool Is< JSArray > (Object *obj)
 
 SMI_ACCESSORS (ConstantPoolArray, first_code_ptr_index, kFirstCodePointerIndexOffset) SMI_ACCESSORS(ConstantPoolArray
 
kFirstHeapPointerIndexOffset SMI_ACCESSORS (ConstantPoolArray, first_int32_index, kFirstInt32IndexOffset) int ConstantPoolArray
 
template<SearchMode search_mode, typename T >
int BinarySearch (T *array, Name *name, int low, int high, int valid_entries)
 
template<SearchMode search_mode, typename T >
int LinearSearch (T *array, Name *name, int len, int valid_entries)
 
template<SearchMode search_mode, typename T >
int Search (T *array, Name *name, int valid_entries)
 
 ACCESSORS (AccessorInfo, expected_receiver_type, Object, kExpectedReceiverTypeOffset) ACCESSORS(DeclaredAccessorDescriptor
 
kSerializedDataOffset ACCESSORS (DeclaredAccessorInfo, descriptor, DeclaredAccessorDescriptor, kDescriptorOffset) ACCESSORS(FunctionTemplateInfo
 
kSerializedDataOffset
kPrototypeTemplateOffset 		ACCESSORS (FunctionTemplateInfo, named_property_handler, Object, kNamedPropertyHandlerOffset) ACCESSORS(FunctionTemplateInfo
 
kSerializedDataOffset
kPrototypeTemplateOffset
kIndexedPropertyHandlerOffset 		ACCESSORS (FunctionTemplateInfo, instance_template, Object, kInstanceTemplateOffset) ACCESSORS(FunctionTemplateInfo
 
kSerializedDataOffset
kPrototypeTemplateOffset
kIndexedPropertyHandlerOffset
kInstanceCallHandlerOffset 		ACCESSORS (FunctionTemplateInfo, access_check_info, Object, kAccessCheckInfoOffset) ACCESSORS(ObjectTemplateInfo
 
kSerializedDataOffset
kPrototypeTemplateOffset
kIndexedPropertyHandlerOffset
kInstanceCallHandlerOffset
kInternalFieldCountOffset 		ACCESSORS_TO_SMI (AllocationSite, pretenure_create_count, kPretenureCreateCountOffset) ACCESSORS(AllocationSite
 
kSerializedDataOffset
kPrototypeTemplateOffset
kIndexedPropertyHandlerOffset
kInstanceCallHandlerOffset
kInternalFieldCountOffset
kDependentCodeOffset 		ACCESSORS_TO_SMI (Script, eval_from_instructions_offset, kEvalFrominstructionsOffsetOffset) Script
 
 ACCESSORS (SharedFunctionInfo, optimized_code_map, Object, kOptimizedCodeMapOffset) ACCESSORS(SharedFunctionInfo
 
kInstanceClassNameOffset BOOL_ACCESSORS (FunctionTemplateInfo, flag, hidden_prototype, kHiddenPrototypeBit) BOOL_ACCESSORS(FunctionTemplateInfo
 
kInstanceClassNameOffset
kNeedsAccessCheckBit 		BOOL_ACCESSORS (FunctionTemplateInfo, flag, read_only_prototype, kReadOnlyPrototypeBit) BOOL_ACCESSORS(FunctionTemplateInfo
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit 		BOOL_ACCESSORS (FunctionTemplateInfo, flag, do_not_cache, kDoNotCacheBit) BOOL_ACCESSORS(SharedFunctionInfo
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit
kIsExpressionBit 		BOOL_ACCESSORS (SharedFunctionInfo, start_position_and_type, is_toplevel, kIsTopLevelBit) BOOL_ACCESSORS(SharedFunctionInfo
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit
kIsExpressionBit
kAllowLazyCompilation 		BOOL_ACCESSORS (SharedFunctionInfo, compiler_hints, allows_lazy_compilation_without_context, kAllowLazyCompilationWithoutContext) BOOL_ACCESSORS(SharedFunctionInfo
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit
kIsExpressionBit
kAllowLazyCompilation
kUsesArguments 		BOOL_ACCESSORS (SharedFunctionInfo, compiler_hints, has_duplicate_parameters, kHasDuplicateParameters) PSEUDO_SMI_ACCESSORS_HI(SharedFunctionInfo
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit
kIsExpressionBit
kAllowLazyCompilation
kUsesArguments
kFormalParameterCountOffset 		PSEUDO_SMI_ACCESSORS_LO (SharedFunctionInfo, expected_nof_properties, kExpectedNofPropertiesOffset) PSEUDO_SMI_ACCESSORS_HI(SharedFunctionInfo
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit
kIsExpressionBit
kAllowLazyCompilation
kUsesArguments
kFormalParameterCountOffset
kStartPositionAndTypeOffset 		PSEUDO_SMI_ACCESSORS_LO (SharedFunctionInfo, function_token_position, kFunctionTokenPositionOffset) PSEUDO_SMI_ACCESSORS_HI(SharedFunctionInfo
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit
kIsExpressionBit
kAllowLazyCompilation
kUsesArguments
kFormalParameterCountOffset
kStartPositionAndTypeOffset
kCompilerHintsOffset 		PSEUDO_SMI_ACCESSORS_LO (SharedFunctionInfo, opt_count_and_bailout_reason, kOptCountAndBailoutReasonOffset) int SharedFunctionInfo
 
 BOOL_ACCESSORS (SharedFunctionInfo, compiler_hints, live_objects_may_exist, kLiveObjectsMayExist) bool SharedFunctionInfo
 
 BOOL_GETTER (SharedFunctionInfo, compiler_hints, optimization_disabled, kOptimizationDisabled) void SharedFunctionInfo
 
 BOOL_ACCESSORS (SharedFunctionInfo, compiler_hints, inline_builtin, kInlineBuiltin) BOOL_ACCESSORS(SharedFunctionInfo
 
kNameShouldPrintAsAnonymous BOOL_ACCESSORS (SharedFunctionInfo, compiler_hints, dont_optimize, kDontOptimize) void SharedFunctionInfo
 
 ACCESSORS (JSFunction, prototype_or_initial_map, Object, kPrototypeOrInitialMapOffset) Map *JSFunction
 
 ACCESSORS (TypeFeedbackInfo, feedback_vector, FixedArray, kFeedbackVectorOffset) Relocatable
 

Variables

 first_heap_ptr_index
 
 serialized_data
 
 ByteArray
 
kSerializedDataOffset prototype_template
 
kSerializedDataOffset Object
 
kSerializedDataOffset
kPrototypeTemplateOffset 		indexed_property_handler
 
kSerializedDataOffset
kPrototypeTemplateOffset
kIndexedPropertyHandlerOffset 		instance_call_handler
 
kSerializedDataOffset
kPrototypeTemplateOffset
kIndexedPropertyHandlerOffset
kInstanceCallHandlerOffset 		internal_field_count
 
kSerializedDataOffset
kPrototypeTemplateOffset
kIndexedPropertyHandlerOffset
kInstanceCallHandlerOffset
kInternalFieldCountOffset 		dependent_code
 
kSerializedDataOffset
kPrototypeTemplateOffset
kIndexedPropertyHandlerOffset
kInstanceCallHandlerOffset
kInternalFieldCountOffset 		DependentCode
 
 instance_class_name
 
kInstanceClassNameOffset flag
 
kInstanceClassNameOffset needs_access_check
 
kInstanceClassNameOffset
kNeedsAccessCheckBit 		remove_prototype
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit 		start_position_and_type
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit 		is_expression
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit
kIsExpressionBit 		compiler_hints
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit
kIsExpressionBit 		allows_lazy_compilation
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit
kIsExpressionBit
kAllowLazyCompilation 		uses_arguments
 
kInstanceClassNameOffset
kNeedsAccessCheckBit
kRemovePrototypeBit
kIsExpressionBit
kAllowLazyCompilation
kUsesArguments 		formal_parameter_count
 
 name_should_print_as_anonymous
 

Macro Definition Documentation

#define ACCESSORS (   holder,
  name,
  type,
  offset 
)
Value:
type* holder::name() { return type::cast(READ_FIELD(this, offset)); } \
void holder::set_##name(type* value, WriteBarrierMode mode) { \
WRITE_FIELD(this, offset, value); \
CONDITIONAL_WRITE_BARRIER(GetHeap(), this, offset, value, mode); \
}
CONDITIONAL_WRITE_BARRIER
#define CONDITIONAL_WRITE_BARRIER(heap, object, offset, value, mode)
Definition: objects-inl.h:1108
READ_FIELD
#define READ_FIELD(p, offset)
Definition: objects-inl.h:1095
name
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV 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 expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in name
Definition: flag-definitions.h:504
WRITE_FIELD
#define WRITE_FIELD(p, offset, value)
Definition: objects-inl.h:1098
mode
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV 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 mode(MIPS only)") DEFINE_string(expose_natives_as

Definition at line 102 of file objects-inl.h.

#define ACCESSORS_TO_SMI (   holder,
  name,
  offset 
)
Value:
Smi* holder::name() { return Smi::cast(READ_FIELD(this, offset)); } \
void holder::set_##name(Smi* value, WriteBarrierMode mode) { \
WRITE_FIELD(this, offset, value); \
}
READ_FIELD
#define READ_FIELD(p, offset)
Definition: objects-inl.h:1095
name
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV 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 expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in name
Definition: flag-definitions.h:504
WRITE_FIELD
#define WRITE_FIELD(p, offset, value)
Definition: objects-inl.h:1098
mode
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV 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 mode(MIPS only)") DEFINE_string(expose_natives_as

Definition at line 111 of file objects-inl.h.

#define BOOL_ACCESSORS (   holder,
  field,
  name,
  offset 
)
Value:
bool holder::name() { \
return BooleanBit::get(field(), offset); \
} \
void holder::set_##name(bool value) { \
set_##field(BooleanBit::set(field(), offset, value)); \
}
name
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV 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 expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in name
Definition: flag-definitions.h:504

Definition at line 135 of file objects-inl.h.

#define BOOL_GETTER (   holder,
  field,
  name,
  offset 
)
Value:
bool holder::name() { \
return BooleanBit::get(field(), offset); \
} \
name
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV 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 expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in name
Definition: flag-definitions.h:504

Definition at line 129 of file objects-inl.h.

#define CASE (   name)    case name: return true;

Referenced by Code::is_inline_cache_stub(), and TEST().

#define CAST_ACCESSOR (   type)
Value:
type* type::cast(Object* object) { \
SLOW_ASSERT(object->Is##type()); \
return reinterpret_cast<type*>(object); \
}
SLOW_ASSERT
#define SLOW_ASSERT(condition)
Definition: checks.h:306
v8::internal::Object
kSerializedDataOffset Object
Definition: objects-inl.h:5016

Definition at line 83 of file objects-inl.h.

#define CONDITIONAL_WRITE_BARRIER (   heap,
  object,
  offset,
  value,
  mode 
)
Value:
if (mode == UPDATE_WRITE_BARRIER) { \
heap->incremental_marking()->RecordWrite( \
object, HeapObject::RawField(object, offset), value); \
if (heap->InNewSpace(value)) { \
heap->RecordWrite(object->address(), offset); \
} \
}
mode
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV 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 mode(MIPS only)") DEFINE_string(expose_natives_as

Definition at line 1108 of file objects-inl.h.

Referenced by Map::ClearTransitions(), JSObject::InObjectPropertyAtPut(), FixedArray::set(), ConsString::set_first(), JSObject::set_map_and_elements(), SlicedString::set_parent(), ConsString::set_second(), Code::set_type_feedback_info(), and Map::SetBackPointer().

#define EXTERNAL_ELEMENTS_CHECK (   Type,
  type,
  TYPE,
  ctype,
  size 
)
Value:
bool JSObject::HasExternal##Type##Elements() { \
HeapObject* array = elements(); \
ASSERT(array != NULL); \
if (!array->IsHeapObject()) \
return false; \
return array->map()->instance_type() == EXTERNAL_##TYPE##_ARRAY_TYPE; \
}
NULL
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter NULL
Definition: flag-definitions.h:268
v8::internal::Type
TypeImpl< ZoneTypeConfig > Type
Definition: property-details.h:62
ASSERT
#define ASSERT(condition)
Definition: checks.h:329

Definition at line 6079 of file objects-inl.h.

#define FIELD_ADDR (   p,
  offset 
)    (reinterpret_cast<byte*>(p) + offset - kHeapObjectTag)

Definition at line 1092 of file objects-inl.h.

Referenced by JSFunction::code(), FixedDoubleArray::data_start(), FixedTypedArrayBase::DataPtr(), ExternalAsciiString::ExternalAsciiStringIterateBody(), ExternalTwoByteString::ExternalTwoByteStringIterateBody(), Foreign::ForeignIterateBody(), FixedTypedArray< Traits >::get_scalar(), SeqTwoByteString::GetChars(), SeqOneByteString::GetCharsAddress(), SeqTwoByteString::GetCharsAddress(), FixedArray::GetFirstElementAddress(), Code::instruction_start(), HeapObject::IterateNextCodeLink(), HeapObject::IteratePointer(), HeapObject::IteratePointers(), ExternalAsciiString::resource(), ExternalTwoByteString::resource(), FixedTypedArray< Traits >::set(), ExternalAsciiString::set_resource(), ExternalTwoByteString::set_resource(), ExternalAsciiString::update_data_cache(), and ExternalTwoByteString::update_data_cache().

#define FIXED_TYPED_ARRAY_CAST_ACCESSOR (   type)
Value:
template<> \
type* type::cast(Object* object) { \
SLOW_ASSERT(object->Is##type()); \
return reinterpret_cast<type*>(object); \
}
SLOW_ASSERT
#define SLOW_ASSERT(condition)
Definition: checks.h:306
v8::internal::Object
kSerializedDataOffset Object
Definition: objects-inl.h:5016

Definition at line 90 of file objects-inl.h.

#define FIXED_TYPED_ELEMENTS_CHECK (   Type,
  type,
  TYPE,
  ctype,
  size 
)
Value:
bool JSObject::HasFixed##Type##Elements() { \
HeapObject* array = elements(); \
ASSERT(array != NULL); \
if (!array->IsHeapObject()) \
return false; \
return array->map()->instance_type() == FIXED_##TYPE##_ARRAY_TYPE; \
}
NULL
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter NULL
Definition: flag-definitions.h:268
v8::internal::Type
TypeImpl< ZoneTypeConfig > Type
Definition: property-details.h:62
ASSERT
#define ASSERT(condition)
Definition: checks.h:329

Definition at line 6100 of file objects-inl.h.

#define INT_ACCESSORS (   holder,
  name,
  offset 
)
Value:
int holder::name() { return READ_INT_FIELD(this, offset); } \
void holder::set_##name(int value) { WRITE_INT_FIELD(this, offset, value); }
WRITE_INT_FIELD
#define WRITE_INT_FIELD(p, offset, value)
Definition: objects-inl.h:1159
name
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV 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 expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in name
Definition: flag-definitions.h:504
READ_INT_FIELD
#define READ_INT_FIELD(p, offset)
Definition: objects-inl.h:1156

Definition at line 97 of file objects-inl.h.

#define MAKE_STRUCT_CASE (   NAME,
  Name,
  name 
)    case NAME##_TYPE: return true;

Referenced by Object::IsStruct().

#define MAKE_STRUCT_CAST (   NAME,
  Name,
  name 
)    CAST_ACCESSOR(Name)

Definition at line 2923 of file objects-inl.h.

#define MAKE_STRUCT_PREDICATE (   NAME,
  Name,
  name 
)
Value:
bool Object::Is##Name() { \
return Object::IsHeapObject() \
&& HeapObject::cast(this)->map()->instance_type() == NAME##_TYPE; \
}
v8::internal::Is
bool Is(Object *obj)

Definition at line 971 of file objects-inl.h.

#define PSEUDO_SMI_ACCESSORS_HI (   holder,
  name,
  offset 
)
Value:
STATIC_ASSERT(holder::offset % kPointerSize == kIntSize); \
INT_ACCESSORS(holder, name, offset)
name
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV 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 expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in name
Definition: flag-definitions.h:504
v8::internal::kIntSize
const int kIntSize
Definition: globals.h:263
v8::internal::kPointerSize
const int kPointerSize
Definition: globals.h:268
INT_ACCESSORS
#define INT_ACCESSORS(holder, name, offset)
Definition: objects-inl.h:97
STATIC_ASSERT
#define STATIC_ASSERT(test)
Definition: checks.h:341
#define PSEUDO_SMI_ACCESSORS_LO (   holder,
  name,
  offset 
)
Value:
STATIC_ASSERT(holder::offset % kPointerSize == 0); \
int holder::name() { \
int value = READ_INT_FIELD(this, offset); \
ASSERT(kHeapObjectTag == 1); \
ASSERT((value & kHeapObjectTag) == 0); \
return value >> 1; \
} \
void holder::set_##name(int value) { \
ASSERT(kHeapObjectTag == 1); \
ASSERT((value & 0xC0000000) == 0xC0000000 || \
(value & 0xC0000000) == 0x000000000); \
WRITE_INT_FIELD(this, \
offset, \
(value << 1) & ~kHeapObjectTag); \
}
ASSERT
#define ASSERT(condition)
Definition: checks.h:329
WRITE_INT_FIELD
#define WRITE_INT_FIELD(p, offset, value)
Definition: objects-inl.h:1159
name
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV 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 expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in name
Definition: flag-definitions.h:504
READ_INT_FIELD
#define READ_INT_FIELD(p, offset)
Definition: objects-inl.h:1156
v8::internal::kPointerSize
const int kPointerSize
Definition: globals.h:268
v8::internal::kHeapObjectTag
const int kHeapObjectTag
Definition: v8.h:5473
STATIC_ASSERT
#define STATIC_ASSERT(test)
Definition: checks.h:341
#define READ_BYTE_FIELD (   p,
  offset 
)    (*reinterpret_cast<byte*>(FIELD_ADDR(p, offset)))

Definition at line 1192 of file objects-inl.h.

Referenced by Code::allow_osr_at_loop_nesting_level(), Map::bit_field(), Map::bit_field2(), ByteArray::get(), Code::has_debug_break_slots(), Code::has_deoptimization_support(), Map::inobject_properties(), Map::instance_size(), Map::instance_type(), Code::is_compiled_optimizable(), Code::optimizable(), Map::pre_allocated_property_fields(), Code::profiler_ticks(), v8::internal::PSEUDO_SMI_ACCESSORS_LO(), SeqOneByteString::SeqOneByteStringGet(), Code::set_compiled_optimizable(), Code::set_has_debug_break_slots(), Code::set_has_deoptimization_support(), Map::unused_property_fields(), and Map::visitor_id().

#define READ_DOUBLE_FIELD (   p,
  offset 
)    (*reinterpret_cast<double*>(FIELD_ADDR(p, offset)))

Definition at line 1118 of file objects-inl.h.

Referenced by ConstantPoolArray::get_int64_entry_as_double(), FixedDoubleArray::get_scalar(), FixedTypedArray< Traits >::get_scalar(), FixedDoubleArray::is_the_hole(), and HeapNumber::value().

#define READ_FIELD (   p,
  offset 
)    (*reinterpret_cast<Object**>(FIELD_ADDR(p, offset)))

Definition at line 1095 of file objects-inl.h.

Referenced by Map::bit_field3(), TypeFeedbackInfo::change_ic_with_type_info_count(), TypeFeedbackInfo::change_own_type_change_checksum(), Code::constant_pool(), JSFunction::context(), ConsString::first(), FixedArray::get(), ConstantPoolArray::get_code_ptr_entry(), ConstantPoolArray::get_heap_ptr_entry(), Map::GetBackPointer(), JSObject::GetElementsKind(), JSObject::GetInternalField(), String::GetUnderlying(), Map::HasTransitionArray(), TypeFeedbackInfo::ic_total_count(), TypeFeedbackInfo::ic_with_type_info_count(), JSObject::InObjectPropertyAt(), JSBuiltinsObject::javascript_builtin(), JSBuiltinsObject::javascript_builtin_code(), Oddball::kind(), HeapObject::map_word(), TypeFeedbackInfo::matches_inlined_type_change_checksum(), TypeFeedbackInfo::own_type_change_checksum(), SlicedString::parent(), JSObject::RawFastPropertyAt(), HeapObject::RawField(), ConsString::second(), TypeFeedbackInfo::set_ic_total_count(), TypeFeedbackInfo::set_inlined_type_change_checksum(), Map::SetBackPointer(), ConsString::unchecked_first(), Code::unchecked_relocation_info(), ConsString::unchecked_second(), and Code::WipeOutHeader().

#define READ_INT32_FIELD (   p,
  offset 
)    (*reinterpret_cast<int32_t*>(FIELD_ADDR(p, offset)))

Definition at line 1174 of file objects-inl.h.

Referenced by ConstantPoolArray::get_int32_entry().

#define READ_INT64_FIELD (   p,
  offset 
)    (*reinterpret_cast<int64_t*>(FIELD_ADDR(p, offset)))

Definition at line 1180 of file objects-inl.h.

Referenced by ConstantPoolArray::get_int64_entry(), and FixedDoubleArray::get_representation().

#define READ_INT_FIELD (   p,
  offset 
)    (*reinterpret_cast<int*>(FIELD_ADDR(p, offset)))

Definition at line 1156 of file objects-inl.h.

Referenced by Code::flags(), HeapNumber::get_exponent(), ByteArray::get_int(), and HeapNumber::get_sign().

#define READ_INTPTR_FIELD (   p,
  offset 
)    (*reinterpret_cast<intptr_t*>(FIELD_ADDR(p, offset)))

Definition at line 1162 of file objects-inl.h.

Referenced by Foreign::foreign_address().

#define READ_SHORT_FIELD (   p,
  offset 
)    (*reinterpret_cast<uint16_t*>(FIELD_ADDR(p, offset)))

Definition at line 1186 of file objects-inl.h.

Referenced by SeqTwoByteString::SeqTwoByteStringGet().

#define READ_UINT32_FIELD (   p,
  offset 
)    (*reinterpret_cast<uint32_t*>(FIELD_ADDR(p, offset)))

Definition at line 1168 of file objects-inl.h.

Referenced by Code::back_edge_table_offset(), Code::back_edges_patched_for_osr(), Code::has_function_cache(), Name::hash_field(), Code::is_crankshafted(), Code::major_key(), Code::marked_for_deoptimization(), Code::safepoint_table_offset(), Code::set_back_edge_table_offset(), Code::set_back_edges_patched_for_osr(), Code::set_has_function_cache(), Code::set_is_crankshafted(), Code::set_major_key(), Code::set_marked_for_deoptimization(), Code::set_safepoint_table_offset(), Code::set_stack_slots(), and Code::stack_slots().

#define SMI_ACCESSORS (   holder,
  name,
  offset 
)
Value:
int holder::name() { \
Object* value = READ_FIELD(this, offset); \
return Smi::cast(value)->value(); \
} \
void holder::set_##name(int value) { \
WRITE_FIELD(this, offset, Smi::FromInt(value)); \
}
v8::internal::Object
kSerializedDataOffset Object
Definition: objects-inl.h:5016
READ_FIELD
#define READ_FIELD(p, offset)
Definition: objects-inl.h:1095
name
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV 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 expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in name
Definition: flag-definitions.h:504
WRITE_FIELD
#define WRITE_FIELD(p, offset, value)
Definition: objects-inl.h:1098

Definition at line 119 of file objects-inl.h.

#define TYPE_CHECKER (   type,
  instancetype 
)
Value:
bool Object::Is##type() { \
return Object::IsHeapObject() && \
HeapObject::cast(this)->map()->instance_type() == instancetype; \
}
v8::internal::Is
bool Is(Object *obj)

Definition at line 76 of file objects-inl.h.

#define TYPED_ARRAY_CASE (   Type,
  type,
  TYPE,
  ctype,
  size 
)
Value:
case FIXED_##TYPE##_ARRAY_TYPE: \
element_size = size; \
break;
size
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object size
Definition: flag-definitions.h:210

Referenced by FixedTypedArrayBase::DataSize().

#define TYPED_ARRAY_TYPE_CHECKER (   Type,
  type,
  TYPE,
  ctype,
  size 
)
Value:
TYPE_CHECKER(External##Type##Array, EXTERNAL_##TYPE##_ARRAY_TYPE) \
TYPE_CHECKER(Fixed##Type##Array, FIXED_##TYPE##_ARRAY_TYPE)
v8::internal::Type
TypeImpl< ZoneTypeConfig > Type
Definition: property-details.h:62
TYPE_CHECKER
#define TYPE_CHECKER(type, instancetype)
Definition: objects-inl.h:76

Definition at line 623 of file objects-inl.h.

#define WRITE_BARRIER (   heap,
  object,
  offset,
  value 
)
Value:
heap->incremental_marking()->RecordWrite( \
object, HeapObject::RawField(object, offset), value); \
if (heap->InNewSpace(value)) { \
heap->RecordWrite(object->address(), offset); \
}

Definition at line 1101 of file objects-inl.h.

Referenced by JSObject::FastPropertyAtPut(), FixedArray::set(), ConstantPoolArray::set(), Code::set_constant_pool(), JSFunction::set_context(), JSBuiltinsObject::set_javascript_builtin(), and JSObject::SetInternalField().

#define WRITE_BYTE_FIELD (   p,
  offset,
  value 
)    (*reinterpret_cast<byte*>(FIELD_ADDR(p, offset)) = value)

Definition at line 1195 of file objects-inl.h.

Referenced by SeqOneByteString::SeqOneByteStringSet(), ByteArray::set(), Code::set_allow_osr_at_loop_nesting_level(), Map::set_bit_field(), Map::set_bit_field2(), Code::set_compiled_optimizable(), SharedFunctionInfo::set_construction_count(), Code::set_has_debug_break_slots(), Code::set_has_deoptimization_support(), Map::set_inobject_properties(), Map::set_instance_size(), Map::set_instance_type(), Code::set_optimizable(), Map::set_pre_allocated_property_fields(), Code::set_profiler_ticks(), Map::set_unused_property_fields(), and Map::set_visitor_id().

#define WRITE_DOUBLE_FIELD (   p,
  offset,
  value 
)    (*reinterpret_cast<double*>(FIELD_ADDR(p, offset)) = value)

Definition at line 1136 of file objects-inl.h.

Referenced by FixedDoubleArray::set(), ConstantPoolArray::set(), FixedTypedArray< Traits >::set(), FixedDoubleArray::set_the_hole(), and HeapNumber::set_value().

#define WRITE_FIELD (   p,
  offset,
  value 
)    (*reinterpret_cast<Object**>(FIELD_ADDR(p, offset)) = value)

Definition at line 1098 of file objects-inl.h.

Referenced by TypeFeedbackInfo::change_ic_with_type_info_count(), TypeFeedbackInfo::change_own_type_change_checksum(), Map::ClearCodeCache(), Map::ClearTransitions(), JSObject::FastPropertyAtPut(), Map::init_back_pointer(), JSObject::initialize_elements(), TypeFeedbackInfo::initialize_storage(), JSObject::InitializeBody(), Struct::InitializeBody(), JSProxy::InitializeBody(), JSObject::InObjectPropertyAtPut(), FixedArray::NoIncrementalWriteBarrierSet(), FixedArray::NoWriteBarrierSet(), FixedArray::set(), ConstantPoolArray::set(), Map::set_bit_field3(), Code::set_constant_pool(), JSFunction::set_context(), ConsString::set_first(), TypeFeedbackInfo::set_ic_total_count(), TypeFeedbackInfo::set_inlined_type_change_checksum(), JSBuiltinsObject::set_javascript_builtin(), JSBuiltinsObject::set_javascript_builtin_code(), Oddball::set_kind(), JSObject::set_map_and_elements(), HeapObject::set_map_word(), FixedArray::set_null(), SlicedString::set_parent(), ConsString::set_second(), FixedArray::set_the_hole(), FixedArray::set_undefined(), Map::SetBackPointer(), JSObject::SetInternalField(), DescriptorArray::SetNumberOfDescriptors(), and Code::WipeOutHeader().

#define WRITE_INT32_FIELD (   p,
  offset,
  value 
)    (*reinterpret_cast<int32_t*>(FIELD_ADDR(p, offset)) = value)

Definition at line 1177 of file objects-inl.h.

Referenced by ConstantPoolArray::set().

#define WRITE_INT64_FIELD (   p,
  offset,
  value 
)    (*reinterpret_cast<int64_t*>(FIELD_ADDR(p, offset)) = value)

Definition at line 1183 of file objects-inl.h.

Referenced by ConstantPoolArray::set().

#define WRITE_INT_FIELD (   p,
  offset,
  value 
)    (*reinterpret_cast<int*>(FIELD_ADDR(p, offset)) = value)

Definition at line 1159 of file objects-inl.h.

Referenced by Code::set_flags(), Code::set_raw_kind_specific_flags1(), and Code::set_raw_kind_specific_flags2().

#define WRITE_INTPTR_FIELD (   p,
  offset,
  value 
)    (*reinterpret_cast<intptr_t*>(FIELD_ADDR(p, offset)) = value)

Definition at line 1165 of file objects-inl.h.

Referenced by JSFunction::set_code(), JSFunction::set_code_no_write_barrier(), and Foreign::set_foreign_address().

#define WRITE_SHORT_FIELD (   p,
  offset,
  value 
)    (*reinterpret_cast<uint16_t*>(FIELD_ADDR(p, offset)) = value)

Definition at line 1189 of file objects-inl.h.

Referenced by SeqTwoByteString::SeqTwoByteStringSet().

#define WRITE_UINT32_FIELD (   p,
  offset,
  value 
)    (*reinterpret_cast<uint32_t*>(FIELD_ADDR(p, offset)) = value)

Definition at line 1171 of file objects-inl.h.

Referenced by Code::set_back_edge_table_offset(), Code::set_back_edges_patched_for_osr(), Code::set_has_function_cache(), Name::set_hash_field(), Code::set_is_crankshafted(), Code::set_major_key(), Code::set_marked_for_deoptimization(), Code::set_safepoint_table_offset(), and Code::set_stack_slots().