43 : register_param_count_(-1),
44 stack_parameter_count_(
no_reg),
45 hint_stack_parameter_count_(-1),
47 register_params_(
NULL),
48 deoptimization_handler_(
NULL),
51 has_miss_handler_(
false) { }
54 bool CodeStub::FindCodeInCache(
Code** code_out,
Isolate* isolate) {
65 SmartArrayPointer<const char> CodeStub::GetName() {
67 NoAllocationStringAllocator allocator(buffer,
68 static_cast<unsigned>(
sizeof(buffer)));
69 StringStream stream(&allocator);
71 return stream.ToCString();
75 void CodeStub::RecordCodeGeneration(Code*
code, Isolate* isolate) {
76 SmartArrayPointer<const char>
name = GetName();
77 PROFILE(isolate, CodeCreateEvent(Logger::STUB_TAG, code, name.get()));
79 Counters* counters = isolate->counters();
80 counters->total_stubs_code_size()->Increment(code->instruction_size());
89 Handle<Code> CodeStub::GetCodeCopy(Isolate* isolate,
90 const Code::FindAndReplacePattern& pattern) {
91 Handle<Code> ic = GetCode(isolate);
92 ic = isolate->factory()->CopyCode(ic);
93 ic->FindAndReplace(pattern);
94 RecordCodeGeneration(*ic, isolate);
107 isolate->
counters()->code_stubs()->Increment();
126 desc, flags, masm.
CodeObject(), NeedsImmovableCode());
131 void CodeStub::VerifyPlatformFeatures(
Isolate* isolate) {
137 Factory* factory = isolate->factory();
138 Heap* heap = isolate->heap();
140 if (UseSpecialCache()
141 ? FindCodeInSpecialCache(&code, isolate)
142 : FindCodeInCache(&code, isolate)) {
143 ASSERT(GetCodeKind() == code->kind());
148 VerifyPlatformFeatures(isolate);
152 HandleScope scope(isolate);
154 Handle<Code> new_object = GenerateCode(isolate);
155 new_object->set_major_key(MajorKey());
156 FinishCode(new_object);
157 RecordCodeGeneration(*new_object, isolate);
159 #ifdef ENABLE_DISASSEMBLER
160 if (FLAG_print_code_stubs) {
161 CodeTracer::Scope trace_scope(isolate->GetCodeTracer());
162 new_object->Disassemble(GetName().
get(), trace_scope.file());
163 PrintF(trace_scope.file(),
"\n");
167 if (UseSpecialCache()) {
168 AddToSpecialCache(new_object);
171 Handle<UnseededNumberDictionary> dict =
172 factory->DictionaryAtNumberPut(
173 Handle<UnseededNumberDictionary>(heap->code_stubs()),
176 heap->public_set_code_stubs(*dict);
182 ASSERT(!NeedsImmovableCode() ||
183 heap->lo_space()->Contains(code) ||
184 heap->code_space()->FirstPage()->Contains(code->address()));
185 return Handle<Code>(
code, isolate);
189 const char* CodeStub::MajorName(CodeStub::Major major_key,
190 bool allow_unknown_keys) {
192 #define DEF_CASE(name) case name: return #name "Stub";
195 case UninitializedMajorKey:
return "<UninitializedMajorKey>Stub";
197 if (!allow_unknown_keys) {
205 void CodeStub::PrintBaseName(StringStream* stream) {
206 stream->Add(
"%s", MajorName(MajorKey(),
false));
210 void CodeStub::PrintName(StringStream* stream) {
211 PrintBaseName(stream);
219 for (
int op = Token::BIT_OR; op <= Token::MOD; ++op) {
222 static_cast<OverwriteMode>(
mode));
223 stub.GetCode(isolate);
233 state_.Print(stream);
241 stub.GetCode(isolate);
246 void BinaryOpICWithAllocationSiteStub::GenerateAheadOfTime(
Isolate* isolate) {
248 BinaryOpIC::State::GenerateAheadOfTime(isolate, &GenerateAheadOfTime);
252 void BinaryOpICWithAllocationSiteStub::PrintState(StringStream* stream) {
253 state_.Print(stream);
258 void BinaryOpICWithAllocationSiteStub::GenerateAheadOfTime(
260 if (state.CouldCreateAllocationMementos()) {
261 BinaryOpICWithAllocationSiteStub stub(state);
262 stub.GetCode(isolate);
267 void StringAddStub::PrintBaseName(StringStream* stream) {
268 stream->Add(
"StringAddStub");
270 stream->Add(
"_CheckBoth");
272 stream->Add(
"_CheckLeft");
274 stream->Add(
"_CheckRight");
276 if (pretenure_flag() ==
TENURED) {
277 stream->Add(
"_Tenured");
303 void ICCompareStub::AddToSpecialCache(
Handle<Code> new_object) {
305 Isolate* isolate = new_object->GetIsolate();
309 factory->strict_compare_ic_string() :
310 factory->compare_ic_string(),
315 bool ICCompareStub::FindCodeInSpecialCache(Code** code_out,
Isolate* isolate) {
316 Factory* factory = isolate->factory();
322 known_map_->FindInCodeCache(
324 *factory->strict_compare_ic_string() :
325 *factory->compare_ic_string(),
328 if (probe->IsCode()) {
342 int ICCompareStub::MinorKey() {
343 return OpField::encode(op_ -
Token::EQ) |
344 LeftStateField::encode(left_) |
345 RightStateField::encode(right_) |
346 HandlerStateField::encode(state_);
382 GenerateNumbers(masm);
385 GenerateStrings(masm);
388 GenerateInternalizedStrings(masm);
391 GenerateUniqueNames(masm);
394 GenerateObjects(masm);
398 GenerateKnownObjects(masm);
401 GenerateGeneric(masm);
408 ASSERT(!state_.Contains(GENERIC));
409 State old_state(state_);
411 state_.Add(NULL_TYPE);
413 state_.Add(UNDEFINED);
414 }
else if (object->IsUndetectableObject() ||
415 object->IsOddball() ||
416 !
object->IsHeapObject()) {
423 state_.Add(MONOMORPHIC_MAP);
429 template<
class StateType>
434 if (!FLAG_trace_ic)
return;
437 static_cast<unsigned>(
sizeof(buffer)));
440 PrintBaseName(&stream);
451 CodeStub::PrintBaseName(stream);
458 state_.Print(stream);
465 if (IsEmpty()) printer.Add(
"None");
466 if (Contains(UNDEFINED)) printer.Add(
"Undefined");
467 if (Contains(NULL_TYPE)) printer.Add(
"Null");
468 if (Contains(MONOMORPHIC_MAP)) printer.Add(
"MonomorphicMap");
469 if (Contains(
GENERIC)) printer.Add(
"Generic");
475 if (state_.Contains(CompareNilICStub::GENERIC)) {
476 return Type::Any(zone);
480 if (state_.Contains(CompareNilICStub::UNDEFINED)) {
483 if (state_.Contains(CompareNilICStub::NULL_TYPE)) {
486 if (state_.Contains(CompareNilICStub::MONOMORPHIC_MAP)) {
505 const char* args =
"";
506 if (HasArgsInRegisters()) {
510 const char* inline_check =
"";
511 if (HasCallSiteInlineCheck()) {
512 inline_check =
"_INLINE";
515 const char* return_true_false_object =
"";
516 if (ReturnTrueFalseObject()) {
517 return_true_false_object =
"_TRUEFALSE";
520 stream->
Add(
"InstanceofStub%s%s%s",
523 return_true_false_object);
527 void JSEntryStub::FinishCode(Handle<Code> code) {
528 Handle<FixedArray> handler_table =
529 code->GetIsolate()->factory()->NewFixedArray(1,
TENURED);
531 code->set_handler_table(*handler_table);
543 stub.GetCode(isolate);
548 switch (elements_kind_) {
555 #define TYPED_ARRAY_CASE(Type, type, TYPE, ctype, size) \
556 case EXTERNAL_##TYPE##_ELEMENTS: \
557 case TYPE##_ELEMENTS:
560 #undef TYPED_ARRAY_CASE
573 void ArgumentsAccessStub::PrintName(
StringStream* stream) {
574 stream->
Add(
"ArgumentsAccessStub_");
584 void CallFunctionStub::PrintName(StringStream* stream) {
585 stream->Add(
"CallFunctionStub_Args%d", argc_);
586 if (RecordCallTarget()) stream->Add(
"_Recording");
590 void CallConstructStub::PrintName(StringStream* stream) {
591 stream->Add(
"CallConstructStub");
592 if (RecordCallTarget()) stream->Add(
"_Recording");
596 void ArrayConstructorStub::PrintName(StringStream* stream) {
597 stream->Add(
"ArrayConstructorStub");
598 switch (argument_count_) {
599 case ANY: stream->Add(
"_Any");
break;
600 case NONE: stream->Add(
"_None");
break;
601 case ONE: stream->Add(
"_One");
break;
613 stream->
Add(
"_DISABLE_ALLOCATION_SITES");
619 Types old_types(types_);
622 return to_boolean_value;
627 types_.
Print(stream);
653 return object->IsTrue();
654 }
else if (object->
IsNull()) {
657 }
else if (object->IsSmi()) {
660 }
else if (object->IsSpecObject()) {
662 return !
object->IsUndetectableObject();
665 return !
object->IsUndetectableObject() &&
670 }
else if (object->IsHeapNumber()) {
671 ASSERT(!object->IsUndetectableObject());
700 stub1.GetCode(isolate);
701 stub2.GetCode(isolate);
705 void ProfileEntryHookStub::EntryHookTrampoline(intptr_t
function,
706 intptr_t stack_pointer,
710 entry_hook(
function, stack_pointer);
715 int major_key = stub->MajorKey();
716 CodeStubInterfaceDescriptor* descriptor =
717 isolate->code_stub_interface_descriptor(major_key);
718 if (!descriptor->initialized()) {
719 stub->InitializeInterfaceDescriptor(isolate, descriptor);
726 InstallDescriptor(isolate, &stub1);
728 InstallDescriptor(isolate, &stub2);
730 InstallDescriptor(isolate, &stub3);
734 void NumberToStringStub::InstallDescriptors(
Isolate* isolate) {
735 NumberToStringStub stub;
736 InstallDescriptor(isolate, &stub);
742 InstallDescriptor(isolate, &stub);
746 void FastNewContextStub::InstallDescriptors(
Isolate* isolate) {
747 FastNewContextStub stub(FastNewContextStub::kMaximumSlots);
748 InstallDescriptor(isolate, &stub);
756 InstallDescriptor(isolate, &stub);
763 InstallDescriptor(isolate, &stub);
768 void BinaryOpWithAllocationSiteStub::InstallDescriptors(
Isolate* isolate) {
770 InstallDescriptor(isolate, &stub);
775 void StringAddStub::InstallDescriptors(
Isolate* isolate) {
777 InstallDescriptor(isolate, &stub);
782 void RegExpConstructResultStub::InstallDescriptors(Isolate* isolate) {
783 RegExpConstructResultStub stub;
784 InstallDescriptor(isolate, &stub);
789 : argument_count_(ANY) {
795 int argument_count) {
796 if (argument_count == 0) {
797 argument_count_ =
NONE;
798 }
else if (argument_count == 1) {
799 argument_count_ =
ONE;
800 }
else if (argument_count >= 2) {
811 InstallDescriptor(isolate, &stub1);
813 InstallDescriptor(isolate, &stub2);
815 InstallDescriptor(isolate, &stub3);
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
InternalArrayConstructorStub(Isolate *isolate)
static const int kNotFound
#define PROFILE(IsolateGetter, Call)
static void GenerateAheadOfTime(Isolate *isolate)
void PrintF(const char *format,...)
static void DecodeMinorKey(int minor_key, CompareIC::State *left_state, CompareIC::State *right_state, CompareIC::State *handler_state, Token::Value *op)
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 map
static String * cast(Object *obj)
Type * GetType(Zone *zone, Handle< Map > map=Handle< Map >())
static void InstallDescriptors(Isolate *isolate)
static Smi * FromInt(int value)
bool IsMonomorphic() const
static void GenerateAheadOfTime(Isolate *isolate)
ArrayConstructorStub(Isolate *isolate, int argument_count)
ElementsKind elements_kind() const
void BasePrintName(const char *name, StringStream *stream)
virtual void PrintState(StringStream *stream)
bool CanBeUndetectable() const
#define ASSERT(condition)
static Code * cast(Object *obj)
static Smi * cast(Object *object)
Handle< Object > CodeObject()
void Add(Vector< const char > format, Vector< FmtElm > elms)
Object * ValueAt(int entry)
void(* FunctionEntryHook)(uintptr_t function, uintptr_t return_addr_location)
V8_INLINE bool IsNull() const
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
void UpdateStatus(Handle< Object > object)
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 only print modified registers Don t break for ASM_UNIMPLEMENTED_BREAK macros print stack trace when an illegal exception is thrown randomize hashes to avoid predictable hash Fixed seed to use to hash property Print the time it takes to deserialize the snapshot testing_bool_flag testing_int_flag string flag tmp file in which to serialize heap Print the time it takes to lazily compile hydrogen code stubs concurrent_recompilation concurrent_sweeping Print usage including flags
FunctionEntryHook function_entry_hook()
void Add(const char *str)
#define TYPED_ARRAY_CASE(Type, type, TYPE, ctype, size)
void GetCode(CodeDesc *desc)
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 code(assertions) for debugging") DEFINE_bool(code_comments
AllocationSiteOverrideMode override_mode() const
virtual void PrintState(StringStream *stream)
static void UpdateCodeCache(Handle< Map > map, Handle< Name > name, Handle< Code > code)
static void GenerateStubsAheadOfTime(Isolate *isolate)
static void InstallDescriptors(Isolate *isolate)
V8_INLINE bool IsUndefined() const
V8_INLINE Handle< Primitive > Undefined(Isolate *isolate)
static void GenerateLoadDictionaryElement(MacroAssembler *masm)
bool UpdateStatus(Handle< Object > object)
V8_INLINE bool IsString() const
Type * GetInputType(Zone *zone, Handle< Map > map)
virtual void PrintBaseName(StringStream *stream)
static HeapNumber * cast(Object *obj)
HydrogenCodeStub(InitializationState state=INITIALIZED)
const char * ElementsKindToString(ElementsKind kind)
bool Contains(Typeelement) const
ElementsKind GetInitialFastElementsKind()
static void InstallDescriptors(Isolate *isolate)
static Flags ComputeFlags(Kind kind, InlineCacheState ic_state=UNINITIALIZED, ExtraICState extra_ic_state=kNoExtraICState, StubType type=NORMAL, InlineCacheHolderFlag holder=OWN_MAP)
static bool VerifyCrossCompiling()
Handle< Code > NewCode(const CodeDesc &desc, Code::Flags flags, Handle< Object > self_reference, bool immovable=false, bool crankshafted=false, int prologue_offset=Code::kPrologueOffsetNotSet)
static void GenerateStubsAheadOfTime(Isolate *isolate)
bool UpdateStatus(Handle< Object > object)
static void InstallDescriptors(Isolate *isolate)
void set_generating_stub(bool value)
void Print(const v8::FunctionCallbackInfo< v8::Value > &args)
static void InstallDescriptors(Isolate *isolate)
void Generate(MacroAssembler *masm)
void TraceTransition(StateType from, StateType to)
static void GenerateAheadOfTime(Isolate *isolate)
static TypeHandle Union(TypeHandle type1, TypeHandle type2, Region *reg)
virtual InlineCacheState GetICState()
static TypeHandle Class(i::Handle< i::Map > map, Region *region)
virtual void Generate(MacroAssembler *masm)
#define CODE_STUB_LIST(V)
void Print(StringStream *stream) const
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
V8_INLINE Handle< Primitive > Null(Isolate *isolate)
virtual void PrintState(StringStream *stream) V8_FINAL V8_OVERRIDE
static void GenerateStoreDictionaryElement(MacroAssembler *masm)
CodeStubInterfaceDescriptor()