40 using namespace v8::internal;
46 static void DummyStaticFunction(
Object* result) {
55 Assembler assm(isolate, buffer,
sizeof buffer);
56 DummyStaticFunction(
NULL);
59 __ adc(
eax, 12345678);
60 __ add(
eax, Immediate(12345678));
61 __ or_(
eax, 12345678);
62 __ sub(
eax, Immediate(12345678));
63 __ xor_(
eax, 12345678);
64 __ and_(
eax, 12345678);
97 __ add(
ebx, Immediate(12));
131 __ push(Immediate(12));
132 __ push(Immediate(23456));
158 __ mov(
edx, 1234567);
215 __ add(
ebx, Immediate(12));
221 __ cmp(
ebx, Immediate(12));
227 __ sub(
ebx, Immediate(12));
243 __ test(
edx, Immediate(12345));
270 __ call(ic, RelocInfo::CODE_TARGET);
277 #ifdef ENABLE_DEBUGGER_SUPPORT
278 ExternalReference after_break_target =
279 ExternalReference(Debug_Address::AfterBreakTarget(), isolate);
280 __ jmp(Operand::StaticVariable(after_break_target));
281 #endif // ENABLE_DEBUGGER_SUPPORT
282 __ jmp(ic, RelocInfo::CODE_TARGET);
370 CpuFeatureScope fscope(&assm,
SSE2);
396 CpuFeatureScope fscope(&assm,
SSE2);
426 CpuFeatureScope use_cmov(&assm,
CMOV);
449 CpuFeatureScope scope(&assm,
SSE4_1);
457 for (
int i = 0; i < 16; i++) {
469 CHECK(code->IsCode());
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
static void Disassemble(FILE *f, byte *begin, byte *end)
static bool IsSupported(CpuFeature f)
static Handle< Code > initialize_stub(Isolate *isolate, ExtraICState extra_state)
static Code * cast(Object *obj)
byte * instruction_start()
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
Handle< FixedArray > NewFixedArray(int size, PretenureFlag pretenure=NOT_TENURED)
static i::Isolate * i_isolate()
MUST_USE_RESULT MaybeObject * CreateCode(const CodeDesc &desc, Code::Flags flags, Handle< Object > self_reference, bool immovable=false, bool crankshafted=false, int prologue_offset=Code::kPrologueOffsetNotSet)
static void InitializeVM()
static const int kFunctionOffset
static Flags ComputeFlags(Kind kind, InlineCacheState ic_state=UNINITIALIZED, ExtraICState extra_ic_state=kNoExtraICState, StubType type=NORMAL, InlineCacheHolderFlag holder=OWN_MAP)
#define RUNTIME_ENTRY(name, nargs, ressize)