45 #ifdef ENABLE_DEBUGGER_SUPPORT
49 if (!debug->has_break_points())
return result;
54 raw_constant_pool()))) {
60 Code* original_code = GetOriginalCode();
66 return result + delta;
78 if (!FLAG_enable_ool_constant_pool) {
82 #ifdef ENABLE_DEBUGGER_SUPPORT
86 if (!debug->has_break_points())
return *result;
91 if (debug->IsDebugBreak(
95 return GetOriginalCode()->constant_pool();
103 ConstantPoolArray* IC::raw_constant_pool()
const {
104 if (FLAG_enable_ool_constant_pool) {
105 return *raw_constant_pool_;
133 if (old_target->
kind() == Code::STORE_IC ||
134 old_target->
kind() == Code::KEYED_STORE_IC) {
142 heap->mark_compact_collector()->RecordCodeTargetPatch(address, target);
144 heap->incremental_marking()->RecordCodeTargetPatch(address, target);
151 if (object->IsJSObject())
return OWN_MAP;
154 ASSERT(object->IsString() ||
object->IsSymbol() ||
155 object->IsNumber() ||
object->IsBoolean());
165 ?
object :
object->GetPrototype(isolate);
171 if (type->
Is(HeapType::Boolean()) ||
172 type->
Is(HeapType::Number()) ||
173 type->
Is(HeapType::String()) ||
187 if (type->
Is(HeapType::Boolean())) {
188 constructor = context->boolean_function();
189 }
else if (type->
Is(HeapType::Number())) {
190 constructor = context->number_function();
191 }
else if (type->
Is(HeapType::String())) {
192 constructor = context->string_function();
195 constructor = context->symbol_function();
205 #endif // V8_IC_INL_H_
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
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 HeapObject * GetCodeCacheHolder(Isolate *isolate, Object *object, InlineCacheHolderFlag holder)
static HeapObject * cast(Object *obj)
static Address target_address_at(Address pc, ConstantPoolArray *constant_pool)
#define ASSERT(condition)
Object * instance_prototype()
Isolate * isolate() const
kInstanceClassNameOffset flag
static void PostPatching(Address address, Code *target, Code *old_target)
Context * native_context()
byte * instruction_start()
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
static Code * GetCodeFromTargetAddress(Address address)
bool is_inline_cache_stub()
static void SetTargetAtAddress(Address address, Code *target, ConstantPoolArray *constant_pool)
static Code * GetTargetAtAddress(Address address, ConstantPoolArray *constant_pool)
static StrictMode GetStrictMode(ExtraICState state)
bool is_compare_ic_stub()
Handle< T > handle(T *t, Isolate *isolate)
static InlineCacheHolderFlag GetCodeCacheForObject(Object *object)
static Address target_address_from_return_address(Address pc)
IN DWORD64 OUT PDWORD64 OUT PIMAGEHLP_SYMBOL64 Symbol
static void set_target_address_at(Address pc, ConstantPoolArray *constant_pool, Address target)
Handle< Code > target() const
ExtraICState extra_ic_state()
static JSObject * cast(Object *obj)
static InlineCacheHolderFlag GetCodeCacheFlag(HeapType *type)
static Handle< Map > TypeToMap(HeapType *type, Isolate *isolate)