diff options
| author | Ali Ijaz Sheikh <ofrobots@google.com> | 2016-01-20 09:45:45 -0800 |
|---|---|---|
| committer | Ali Ijaz Sheikh <ofrobots@google.com> | 2016-01-21 16:53:58 -0800 |
| commit | ef4170ea03a80b21b2d8a65ce432efaa370fe2fa (patch) | |
| tree | e382b1b38b729cd8155b56b441c3a563914854a3 /deps/v8/src/ppc | |
| parent | 5f6dfab832979999d2f806fc1a2f1c11a25b0f35 (diff) | |
| download | android-node-v8-ef4170ea03a80b21b2d8a65ce432efaa370fe2fa.tar.gz android-node-v8-ef4170ea03a80b21b2d8a65ce432efaa370fe2fa.tar.bz2 android-node-v8-ef4170ea03a80b21b2d8a65ce432efaa370fe2fa.zip | |
deps: upgrade to V8 4.8.271.17
Pick up V8 4.8 branch-head. This branch brings in @@isConcatSpreadable,
@@toPrimitive and ToLength ES6 changes. For full details see:
http://v8project.blogspot.de/2015/11/v8-release-48.html
https://github.com/v8/v8/commit/fa163e2
Ref: https://github.com/nodejs/node/pull/4399
PR-URL: https://github.com/nodejs/node/pull/4785
Reviewed-By: bnoordhuis - Ben Noordhuis <info@bnoordhuis.nl>
Diffstat (limited to 'deps/v8/src/ppc')
23 files changed, 622 insertions, 12968 deletions
diff --git a/deps/v8/src/ppc/assembler-ppc-inl.h b/deps/v8/src/ppc/assembler-ppc-inl.h index b1e2825751..4f6a35d66e 100644 --- a/deps/v8/src/ppc/assembler-ppc-inl.h +++ b/deps/v8/src/ppc/assembler-ppc-inl.h @@ -720,7 +720,7 @@ void Assembler::set_target_address_at(Address pc, Address constant_pool, } UNREACHABLE(); } -} -} // namespace v8::internal +} // namespace internal +} // namespace v8 #endif // V8_PPC_ASSEMBLER_PPC_INL_H_ diff --git a/deps/v8/src/ppc/assembler-ppc.cc b/deps/v8/src/ppc/assembler-ppc.cc index 6bbb53c4ba..ac03ce6949 100644 --- a/deps/v8/src/ppc/assembler-ppc.cc +++ b/deps/v8/src/ppc/assembler-ppc.cc @@ -128,16 +128,6 @@ Register ToRegister(int num) { } -const char* DoubleRegister::AllocationIndexToString(int index) { - DCHECK(index >= 0 && index < kMaxNumAllocatableRegisters); - const char* const names[] = { - "d1", "d2", "d3", "d4", "d5", "d6", "d7", "d8", "d9", "d10", - "d11", "d12", "d15", "d16", "d17", "d18", "d19", "d20", "d21", "d22", - "d23", "d24", "d25", "d26", "d27", "d28", "d29", "d30", "d31"}; - return names[index]; -} - - // ----------------------------------------------------------------------------- // Implementation of RelocInfo @@ -286,14 +276,14 @@ bool Assembler::IsBranch(Instr instr) { return ((instr & kOpcodeMask) == BCX); } Register Assembler::GetRA(Instr instr) { Register reg; - reg.code_ = Instruction::RAValue(instr); + reg.reg_code = Instruction::RAValue(instr); return reg; } Register Assembler::GetRB(Instr instr) { Register reg; - reg.code_ = Instruction::RBValue(instr); + reg.reg_code = Instruction::RBValue(instr); return reg; } @@ -747,6 +737,11 @@ void Assembler::cntlzw_(Register ra, Register rs, RCBit rc) { } +void Assembler::popcntw(Register ra, Register rs) { + emit(EXT2 | POPCNTW | rs.code() * B21 | ra.code() * B16); +} + + void Assembler::and_(Register ra, Register rs, Register rb, RCBit rc) { x_form(EXT2 | ANDX, ra, rs, rb, rc); } @@ -1481,6 +1476,11 @@ void Assembler::cntlzd_(Register ra, Register rs, RCBit rc) { } +void Assembler::popcntd(Register ra, Register rs) { + emit(EXT2 | POPCNTD | rs.code() * B21 | ra.code() * B16); +} + + void Assembler::mulld(Register dst, Register src1, Register src2, OEBit o, RCBit r) { xo_form(EXT2 | MULLD, dst, src1, src2, o, r); @@ -2163,6 +2163,12 @@ void Assembler::fcfid(const DoubleRegister frt, const DoubleRegister frb, } +void Assembler::fcfids(const DoubleRegister frt, const DoubleRegister frb, + RCBit rc) { + emit(EXT3 | FCFID | frt.code() * B21 | frb.code() * B11 | rc); +} + + void Assembler::fctid(const DoubleRegister frt, const DoubleRegister frb, RCBit rc) { emit(EXT4 | FCTID | frt.code() * B21 | frb.code() * B11 | rc); diff --git a/deps/v8/src/ppc/assembler-ppc.h b/deps/v8/src/ppc/assembler-ppc.h index a1c08ad0ea..36843c17ab 100644 --- a/deps/v8/src/ppc/assembler-ppc.h +++ b/deps/v8/src/ppc/assembler-ppc.h @@ -44,7 +44,6 @@ #include <vector> #include "src/assembler.h" -#include "src/compiler.h" #include "src/ppc/constants-ppc.h" #define ABI_USES_FUNCTION_DESCRIPTORS \ @@ -61,9 +60,9 @@ (V8_HOST_ARCH_PPC && V8_TARGET_ARCH_PPC64 && V8_TARGET_LITTLE_ENDIAN) #if !V8_HOST_ARCH_PPC || V8_OS_AIX || V8_TARGET_ARCH_PPC64 -#define ABI_TOC_REGISTER kRegister_r2_Code +#define ABI_TOC_REGISTER Register::kCode_r2 #else -#define ABI_TOC_REGISTER kRegister_r13_Code +#define ABI_TOC_REGISTER Register::kCode_r13 #endif #define INSTR_AND_DATA_CACHE_COHERENCY LWSYNC @@ -71,6 +70,40 @@ namespace v8 { namespace internal { +// clang-format off +#define GENERAL_REGISTERS(V) \ + V(r0) V(sp) V(r2) V(r3) V(r4) V(r5) V(r6) V(r7) \ + V(r8) V(r9) V(r10) V(r11) V(ip) V(r13) V(r14) V(r15) \ + V(r16) V(r17) V(r18) V(r19) V(r20) V(r21) V(r22) V(r23) \ + V(r24) V(r25) V(r26) V(r27) V(r28) V(r29) V(r30) V(fp) + +#if V8_EMBEDDED_CONSTANT_POOL +#define ALLOCATABLE_GENERAL_REGISTERS(V) \ + V(r3) V(r4) V(r5) V(r6) V(r7) \ + V(r8) V(r9) V(r10) V(r14) V(r15) \ + V(r16) V(r17) V(r18) V(r19) V(r20) V(r21) V(r22) V(r23) \ + V(r24) V(r25) V(r26) V(r27) V(r30) +#else +#define ALLOCATABLE_GENERAL_REGISTERS(V) \ + V(r3) V(r4) V(r5) V(r6) V(r7) \ + V(r8) V(r9) V(r10) V(r14) V(r15) \ + V(r16) V(r17) V(r18) V(r19) V(r20) V(r21) V(r22) V(r23) \ + V(r24) V(r25) V(r26) V(r27) V(r28) V(r30) +#endif + +#define DOUBLE_REGISTERS(V) \ + V(d0) V(d1) V(d2) V(d3) V(d4) V(d5) V(d6) V(d7) \ + V(d8) V(d9) V(d10) V(d11) V(d12) V(d13) V(d14) V(d15) \ + V(d16) V(d17) V(d18) V(d19) V(d20) V(d21) V(d22) V(d23) \ + V(d24) V(d25) V(d26) V(d27) V(d28) V(d29) V(d30) V(d31) + +#define ALLOCATABLE_DOUBLE_REGISTERS(V) \ + V(d1) V(d2) V(d3) V(d4) V(d5) V(d6) V(d7) \ + V(d8) V(d9) V(d10) V(d11) V(d12) V(d15) \ + V(d16) V(d17) V(d18) V(d19) V(d20) V(d21) V(d22) V(d23) \ + V(d24) V(d25) V(d26) V(d27) V(d28) V(d29) V(d30) V(d31) +// clang-format on + // CPU Registers. // // 1) We would prefer to use an enum, but enum values are assignment- @@ -92,310 +125,112 @@ namespace internal { // mode. This way we get the compile-time error checking in debug mode // and best performance in optimized code. -// Core register struct Register { - static const int kNumRegisters = 32; - static const int kSizeInBytes = kPointerSize; - -#if V8_TARGET_LITTLE_ENDIAN - static const int kMantissaOffset = 0; - static const int kExponentOffset = 4; -#else - static const int kMantissaOffset = 4; - static const int kExponentOffset = 0; -#endif - - static const int kAllocatableLowRangeBegin = 3; - static const int kAllocatableLowRangeEnd = 10; - static const int kAllocatableHighRangeBegin = 14; - static const int kAllocatableHighRangeEnd = - FLAG_enable_embedded_constant_pool ? 27 : 28; - static const int kAllocatableContext = 30; - - static const int kNumAllocatableLow = - kAllocatableLowRangeEnd - kAllocatableLowRangeBegin + 1; - static const int kNumAllocatableHigh = - kAllocatableHighRangeEnd - kAllocatableHighRangeBegin + 1; - static const int kMaxNumAllocatableRegisters = - kNumAllocatableLow + kNumAllocatableHigh + 1; // cp - - static int NumAllocatableRegisters() { return kMaxNumAllocatableRegisters; } - - static int ToAllocationIndex(Register reg) { - int index; - int code = reg.code(); - if (code == kAllocatableContext) { - // Context is the last index - index = NumAllocatableRegisters() - 1; - } else if (code <= kAllocatableLowRangeEnd) { - // low range - index = code - kAllocatableLowRangeBegin; - } else { - // high range - index = code - kAllocatableHighRangeBegin + kNumAllocatableLow; - } - DCHECK(index >= 0 && index < kMaxNumAllocatableRegisters); - return index; - } + enum Code { +#define REGISTER_CODE(R) kCode_##R, + GENERAL_REGISTERS(REGISTER_CODE) +#undef REGISTER_CODE + kAfterLast, + kCode_no_reg = -1 + }; - static Register FromAllocationIndex(int index) { - DCHECK(index >= 0 && index < kMaxNumAllocatableRegisters); - // Last index is always the 'cp' register. - if (index == kMaxNumAllocatableRegisters - 1) { - return from_code(kAllocatableContext); - } - return (index < kNumAllocatableLow) - ? from_code(index + kAllocatableLowRangeBegin) - : from_code(index - kNumAllocatableLow + - kAllocatableHighRangeBegin); - } + static const int kNumRegisters = Code::kAfterLast; - static const char* AllocationIndexToString(int index) { - DCHECK(index >= 0 && index < kMaxNumAllocatableRegisters); - const char* const names[] = { - "r3", - "r4", - "r5", - "r6", - "r7", - "r8", - "r9", - "r10", - "r14", - "r15", - "r16", - "r17", - "r18", - "r19", - "r20", - "r21", - "r22", - "r23", - "r24", - "r25", - "r26", - "r27", - "r28", - "cp", - }; - if (FLAG_enable_embedded_constant_pool && - (index == kMaxNumAllocatableRegisters - 2)) { - return names[index + 1]; - } - return names[index]; - } +#define REGISTER_COUNT(R) 1 + + static const int kNumAllocatable = + ALLOCATABLE_GENERAL_REGISTERS(REGISTER_COUNT)0; +#undef REGISTER_COUNT +#define REGISTER_BIT(R) 1 << kCode_##R | static const RegList kAllocatable = - 1 << 3 | 1 << 4 | 1 << 5 | 1 << 6 | 1 << 7 | 1 << 8 | 1 << 9 | 1 << 10 | - 1 << 14 | 1 << 15 | 1 << 16 | 1 << 17 | 1 << 18 | 1 << 19 | 1 << 20 | - 1 << 21 | 1 << 22 | 1 << 23 | 1 << 24 | 1 << 25 | 1 << 26 | 1 << 27 | - (FLAG_enable_embedded_constant_pool ? 0 : 1 << 28) | 1 << 30; + ALLOCATABLE_GENERAL_REGISTERS(REGISTER_BIT)0; +#undef REGISTER_BIT static Register from_code(int code) { + DCHECK(code >= 0); + DCHECK(code < kNumRegisters); Register r = {code}; return r; } - - bool is_valid() const { return 0 <= code_ && code_ < kNumRegisters; } - bool is(Register reg) const { return code_ == reg.code_; } + const char* ToString(); + bool IsAllocatable() const; + bool is_valid() const { return 0 <= reg_code && reg_code < kNumRegisters; } + bool is(Register reg) const { return reg_code == reg.reg_code; } int code() const { DCHECK(is_valid()); - return code_; + return reg_code; } int bit() const { DCHECK(is_valid()); - return 1 << code_; + return 1 << reg_code; } - void set_code(int code) { - code_ = code; + reg_code = code; DCHECK(is_valid()); } +#if V8_TARGET_LITTLE_ENDIAN + static const int kMantissaOffset = 0; + static const int kExponentOffset = 4; +#else + static const int kMantissaOffset = 4; + static const int kExponentOffset = 0; +#endif + // Unfortunately we can't make this private in a struct. - int code_; + int reg_code; }; -// These constants are used in several locations, including static initializers -const int kRegister_no_reg_Code = -1; -const int kRegister_r0_Code = 0; // general scratch -const int kRegister_sp_Code = 1; // stack pointer -const int kRegister_r2_Code = 2; // special on PowerPC -const int kRegister_r3_Code = 3; -const int kRegister_r4_Code = 4; -const int kRegister_r5_Code = 5; -const int kRegister_r6_Code = 6; -const int kRegister_r7_Code = 7; -const int kRegister_r8_Code = 8; -const int kRegister_r9_Code = 9; -const int kRegister_r10_Code = 10; -const int kRegister_r11_Code = 11; // lithium scratch -const int kRegister_ip_Code = 12; // ip (general scratch) -const int kRegister_r13_Code = 13; // special on PowerPC -const int kRegister_r14_Code = 14; -const int kRegister_r15_Code = 15; - -const int kRegister_r16_Code = 16; -const int kRegister_r17_Code = 17; -const int kRegister_r18_Code = 18; -const int kRegister_r19_Code = 19; -const int kRegister_r20_Code = 20; -const int kRegister_r21_Code = 21; -const int kRegister_r22_Code = 22; -const int kRegister_r23_Code = 23; -const int kRegister_r24_Code = 24; -const int kRegister_r25_Code = 25; -const int kRegister_r26_Code = 26; -const int kRegister_r27_Code = 27; -const int kRegister_r28_Code = 28; // constant pool pointer -const int kRegister_r29_Code = 29; // roots array pointer -const int kRegister_r30_Code = 30; // context pointer -const int kRegister_fp_Code = 31; // frame pointer - -const Register no_reg = {kRegister_no_reg_Code}; - -const Register r0 = {kRegister_r0_Code}; -const Register sp = {kRegister_sp_Code}; -const Register r2 = {kRegister_r2_Code}; -const Register r3 = {kRegister_r3_Code}; -const Register r4 = {kRegister_r4_Code}; -const Register r5 = {kRegister_r5_Code}; -const Register r6 = {kRegister_r6_Code}; -const Register r7 = {kRegister_r7_Code}; -const Register r8 = {kRegister_r8_Code}; -const Register r9 = {kRegister_r9_Code}; -const Register r10 = {kRegister_r10_Code}; -const Register r11 = {kRegister_r11_Code}; -const Register ip = {kRegister_ip_Code}; -const Register r13 = {kRegister_r13_Code}; -const Register r14 = {kRegister_r14_Code}; -const Register r15 = {kRegister_r15_Code}; - -const Register r16 = {kRegister_r16_Code}; -const Register r17 = {kRegister_r17_Code}; -const Register r18 = {kRegister_r18_Code}; -const Register r19 = {kRegister_r19_Code}; -const Register r20 = {kRegister_r20_Code}; -const Register r21 = {kRegister_r21_Code}; -const Register r22 = {kRegister_r22_Code}; -const Register r23 = {kRegister_r23_Code}; -const Register r24 = {kRegister_r24_Code}; -const Register r25 = {kRegister_r25_Code}; -const Register r26 = {kRegister_r26_Code}; -const Register r27 = {kRegister_r27_Code}; -const Register r28 = {kRegister_r28_Code}; -const Register r29 = {kRegister_r29_Code}; -const Register r30 = {kRegister_r30_Code}; -const Register fp = {kRegister_fp_Code}; - -// Give alias names to registers -const Register cp = {kRegister_r30_Code}; // JavaScript context pointer -const Register kRootRegister = {kRegister_r29_Code}; // Roots array pointer. -const Register kConstantPoolRegister = {kRegister_r28_Code}; // Constant pool +#define DECLARE_REGISTER(R) const Register R = {Register::kCode_##R}; +GENERAL_REGISTERS(DECLARE_REGISTER) +#undef DECLARE_REGISTER +const Register no_reg = {Register::kCode_no_reg}; + +// Aliases +const Register kLithiumScratch = r11; // lithium scratch. +const Register kConstantPoolRegister = r28; // Constant pool. +const Register kRootRegister = r29; // Roots array pointer. +const Register cp = r30; // JavaScript context pointer. // Double word FP register. struct DoubleRegister { - static const int kNumRegisters = 32; - static const int kMaxNumRegisters = kNumRegisters; - static const int kNumVolatileRegisters = 14; // d0-d13 - static const int kSizeInBytes = 8; - - static const int kAllocatableLowRangeBegin = 1; - static const int kAllocatableLowRangeEnd = 12; - static const int kAllocatableHighRangeBegin = 15; - static const int kAllocatableHighRangeEnd = 31; - - static const int kNumAllocatableLow = - kAllocatableLowRangeEnd - kAllocatableLowRangeBegin + 1; - static const int kNumAllocatableHigh = - kAllocatableHighRangeEnd - kAllocatableHighRangeBegin + 1; - static const int kMaxNumAllocatableRegisters = - kNumAllocatableLow + kNumAllocatableHigh; - static int NumAllocatableRegisters() { return kMaxNumAllocatableRegisters; } - - // TODO(turbofan) - inline static int NumAllocatableAliasedRegisters() { - return NumAllocatableRegisters(); - } - - static int ToAllocationIndex(DoubleRegister reg) { - int code = reg.code(); - int index = (code <= kAllocatableLowRangeEnd) - ? code - kAllocatableLowRangeBegin - : code - kAllocatableHighRangeBegin + kNumAllocatableLow; - DCHECK(index < kMaxNumAllocatableRegisters); - return index; - } - - static DoubleRegister FromAllocationIndex(int index) { - DCHECK(index >= 0 && index < kMaxNumAllocatableRegisters); - return (index < kNumAllocatableLow) - ? from_code(index + kAllocatableLowRangeBegin) - : from_code(index - kNumAllocatableLow + - kAllocatableHighRangeBegin); - } - - static const char* AllocationIndexToString(int index); - - static DoubleRegister from_code(int code) { - DoubleRegister r = {code}; - return r; - } + enum Code { +#define REGISTER_CODE(R) kCode_##R, + DOUBLE_REGISTERS(REGISTER_CODE) +#undef REGISTER_CODE + kAfterLast, + kCode_no_reg = -1 + }; - bool is_valid() const { return 0 <= code_ && code_ < kMaxNumRegisters; } - bool is(DoubleRegister reg) const { return code_ == reg.code_; } + static const int kNumRegisters = Code::kAfterLast; + static const int kMaxNumRegisters = kNumRegisters; + const char* ToString(); + bool IsAllocatable() const; + bool is_valid() const { return 0 <= reg_code && reg_code < kNumRegisters; } + bool is(DoubleRegister reg) const { return reg_code == reg.reg_code; } int code() const { DCHECK(is_valid()); - return code_; + return reg_code; } int bit() const { DCHECK(is_valid()); - return 1 << code_; + return 1 << reg_code; } - void split_code(int* vm, int* m) const { - DCHECK(is_valid()); - *m = (code_ & 0x10) >> 4; - *vm = code_ & 0x0F; + + static DoubleRegister from_code(int code) { + DoubleRegister r = {code}; + return r; } - int code_; + int reg_code; }; - -const DoubleRegister no_dreg = {-1}; -const DoubleRegister d0 = {0}; -const DoubleRegister d1 = {1}; -const DoubleRegister d2 = {2}; -const DoubleRegister d3 = {3}; -const DoubleRegister d4 = {4}; -const DoubleRegister d5 = {5}; -const DoubleRegister d6 = {6}; -const DoubleRegister d7 = {7}; -const DoubleRegister d8 = {8}; -const DoubleRegister d9 = {9}; -const DoubleRegister d10 = {10}; -const DoubleRegister d11 = {11}; -const DoubleRegister d12 = {12}; -const DoubleRegister d13 = {13}; -const DoubleRegister d14 = {14}; -const DoubleRegister d15 = {15}; -const DoubleRegister d16 = {16}; -const DoubleRegister d17 = {17}; -const DoubleRegister d18 = {18}; -const DoubleRegister d19 = {19}; -const DoubleRegister d20 = {20}; -const DoubleRegister d21 = {21}; -const DoubleRegister d22 = {22}; -const DoubleRegister d23 = {23}; -const DoubleRegister d24 = {24}; -const DoubleRegister d25 = {25}; -const DoubleRegister d26 = {26}; -const DoubleRegister d27 = {27}; -const DoubleRegister d28 = {28}; -const DoubleRegister d29 = {29}; -const DoubleRegister d30 = {30}; -const DoubleRegister d31 = {31}; +#define DECLARE_REGISTER(R) \ + const DoubleRegister R = {DoubleRegister::kCode_##R}; +DOUBLE_REGISTERS(DECLARE_REGISTER) +#undef DECLARE_REGISTER +const Register no_dreg = {Register::kCode_no_reg}; // Aliases for double registers. Defined using #define instead of // "static const DoubleRegister&" because Clang complains otherwise when a @@ -409,19 +244,19 @@ Register ToRegister(int num); // Coprocessor register struct CRegister { - bool is_valid() const { return 0 <= code_ && code_ < 16; } - bool is(CRegister creg) const { return code_ == creg.code_; } + bool is_valid() const { return 0 <= reg_code && reg_code < 16; } + bool is(CRegister creg) const { return reg_code == creg.reg_code; } int code() const { DCHECK(is_valid()); - return code_; + return reg_code; } int bit() const { DCHECK(is_valid()); - return 1 << code_; + return 1 << reg_code; } // Unfortunately we can't make this private in a struct. - int code_; + int reg_code; }; @@ -1072,6 +907,7 @@ class Assembler : public AssemblerBase { void rotldi(Register ra, Register rs, int sh, RCBit r = LeaveRC); void rotrdi(Register ra, Register rs, int sh, RCBit r = LeaveRC); void cntlzd_(Register dst, Register src, RCBit rc = LeaveRC); + void popcntd(Register dst, Register src); void mulld(Register dst, Register src1, Register src2, OEBit o = LeaveOE, RCBit r = LeaveRC); void divd(Register dst, Register src1, Register src2, OEBit o = LeaveOE, @@ -1101,6 +937,7 @@ class Assembler : public AssemblerBase { void rotrwi(Register ra, Register rs, int sh, RCBit r = LeaveRC); void cntlzw_(Register dst, Register src, RCBit rc = LeaveRC); + void popcntw(Register dst, Register src); void subi(Register dst, Register src1, const Operand& src2); @@ -1213,6 +1050,8 @@ class Assembler : public AssemblerBase { RCBit rc = LeaveRC); void fcfid(const DoubleRegister frt, const DoubleRegister frb, RCBit rc = LeaveRC); + void fcfids(const DoubleRegister frt, const DoubleRegister frb, + RCBit rc = LeaveRC); void fctid(const DoubleRegister frt, const DoubleRegister frb, RCBit rc = LeaveRC); void fctidz(const DoubleRegister frt, const DoubleRegister frb, @@ -1471,7 +1310,10 @@ class Assembler : public AssemblerBase { } void StartBlockTrampolinePool() { trampoline_pool_blocked_nesting_++; } - void EndBlockTrampolinePool() { trampoline_pool_blocked_nesting_--; } + void EndBlockTrampolinePool() { + int count = --trampoline_pool_blocked_nesting_; + if (count == 0) CheckTrampolinePoolQuick(); + } bool is_trampoline_pool_blocked() const { return trampoline_pool_blocked_nesting_ > 0; } @@ -1612,7 +1454,7 @@ class EnsureSpace BASE_EMBEDDED { public: explicit EnsureSpace(Assembler* assembler) { assembler->CheckBuffer(); } }; -} -} // namespace v8::internal +} // namespace internal +} // namespace v8 #endif // V8_PPC_ASSEMBLER_PPC_H_ diff --git a/deps/v8/src/ppc/builtins-ppc.cc b/deps/v8/src/ppc/builtins-ppc.cc index e08c865e4e..9b3a3fb9ad 100644 --- a/deps/v8/src/ppc/builtins-ppc.cc +++ b/deps/v8/src/ppc/builtins-ppc.cc @@ -21,11 +21,12 @@ void Builtins::Generate_Adaptor(MacroAssembler* masm, CFunctionId id, BuiltinExtraArguments extra_args) { // ----------- S t a t e ------------- // -- r3 : number of arguments excluding receiver - // -- r4 : called function (only guaranteed when - // extra_args requires it) + // (only guaranteed when the called function + // is not marked as DontAdaptArguments) + // -- r4 : called function // -- sp[0] : last argument // -- ... - // -- sp[4 * (argc - 1)] : first argument (argc == r0) + // -- sp[4 * (argc - 1)] : first argument // -- sp[4 * argc] : receiver // ----------------------------------- __ AssertFunction(r4); @@ -46,9 +47,27 @@ void Builtins::Generate_Adaptor(MacroAssembler* masm, CFunctionId id, DCHECK(extra_args == NO_EXTRA_ARGUMENTS); } - // JumpToExternalReference expects r0 to contain the number of arguments - // including the receiver and the extra arguments. + // JumpToExternalReference expects r3 to contain the number of arguments + // including the receiver and the extra arguments. But r3 is only valid + // if the called function is marked as DontAdaptArguments, otherwise we + // need to load the argument count from the SharedFunctionInfo. + __ LoadP(r5, FieldMemOperand(r4, JSFunction::kSharedFunctionInfoOffset)); + __ LoadWordArith( + r5, FieldMemOperand(r5, SharedFunctionInfo::kFormalParameterCountOffset)); +#if !V8_TARGET_ARCH_PPC64 + __ SmiUntag(r5); +#endif + __ cmpi(r5, Operand(SharedFunctionInfo::kDontAdaptArgumentsSentinel)); + if (CpuFeatures::IsSupported(ISELECT)) { + __ isel(ne, r3, r5, r3); + } else { + Label skip; + __ beq(&skip); + __ mr(r3, r5); + __ bind(&skip); + } __ addi(r3, r3, Operand(num_extra_args + 1)); + __ JumpToExternalReference(ExternalReference(id, masm->isolate())); } @@ -60,7 +79,8 @@ static void GenerateLoadInternalArrayFunction(MacroAssembler* masm, __ LoadP(result, MemOperand(cp, Context::SlotOffset(Context::GLOBAL_OBJECT_INDEX))); - __ LoadP(result, FieldMemOperand(result, GlobalObject::kNativeContextOffset)); + __ LoadP(result, + FieldMemOperand(result, JSGlobalObject::kNativeContextOffset)); // Load the InternalArray function from the native context. __ LoadP(result, MemOperand(result, Context::SlotOffset( @@ -74,7 +94,8 @@ static void GenerateLoadArrayFunction(MacroAssembler* masm, Register result) { __ LoadP(result, MemOperand(cp, Context::SlotOffset(Context::GLOBAL_OBJECT_INDEX))); - __ LoadP(result, FieldMemOperand(result, GlobalObject::kNativeContextOffset)); + __ LoadP(result, + FieldMemOperand(result, JSGlobalObject::kNativeContextOffset)); // Load the Array function from the native context. __ LoadP( result, @@ -201,41 +222,44 @@ void Builtins::Generate_StringConstructor_ConstructStub(MacroAssembler* masm) { // ----------- S t a t e ------------- // -- r3 : number of arguments // -- r4 : constructor function + // -- r6 : original constructor // -- lr : return address // -- sp[(argc - n - 1) * 4] : arg[n] (zero based) // -- sp[argc * 4] : receiver // ----------------------------------- - // 1. Load the first argument into r3 and get rid of the rest (including the + // 1. Load the first argument into r5 and get rid of the rest (including the // receiver). { Label no_arguments, done; __ cmpi(r3, Operand::Zero()); __ beq(&no_arguments); __ subi(r3, r3, Operand(1)); - __ ShiftLeftImm(r3, r3, Operand(kPointerSizeLog2)); - __ LoadPUX(r3, MemOperand(sp, r3)); + __ ShiftLeftImm(r5, r3, Operand(kPointerSizeLog2)); + __ LoadPUX(r5, MemOperand(sp, r5)); __ Drop(2); __ b(&done); __ bind(&no_arguments); - __ LoadRoot(r3, Heap::kempty_stringRootIndex); + __ LoadRoot(r5, Heap::kempty_stringRootIndex); __ Drop(1); __ bind(&done); } - // 2. Make sure r3 is a string. + // 2. Make sure r5 is a string. { Label convert, done_convert; - __ JumpIfSmi(r3, &convert); - __ CompareObjectType(r3, r5, r5, FIRST_NONSTRING_TYPE); + __ JumpIfSmi(r5, &convert); + __ CompareObjectType(r5, r7, r7, FIRST_NONSTRING_TYPE); __ blt(&done_convert); __ bind(&convert); { FrameAndConstantPoolScope scope(masm, StackFrame::INTERNAL); ToStringStub stub(masm->isolate()); - __ push(r4); + __ Push(r4, r6); + __ mr(r3, r5); __ CallStub(&stub); - __ pop(r4); + __ mr(r5, r3); + __ Pop(r4, r6); } __ bind(&done_convert); } @@ -243,13 +267,18 @@ void Builtins::Generate_StringConstructor_ConstructStub(MacroAssembler* masm) { // 3. Allocate a JSValue wrapper for the string. { // ----------- S t a t e ------------- - // -- r3 : the first argument + // -- r5 : the first argument // -- r4 : constructor function + // -- r6 : original constructor // -- lr : return address // ----------------------------------- - Label allocate, done_allocate; - __ mr(r5, r3); + Label allocate, done_allocate, rt_call; + + // Fall back to runtime if the original constructor and function differ. + __ cmp(r4, r6); + __ bne(&rt_call); + __ Allocate(JSValue::kSize, r3, r6, r7, &allocate, TAG_OBJECT); __ bind(&done_allocate); @@ -273,6 +302,17 @@ void Builtins::Generate_StringConstructor_ConstructStub(MacroAssembler* masm) { __ Pop(r4, r5); } __ b(&done_allocate); + + // Fallback to the runtime to create new object. + __ bind(&rt_call); + { + FrameAndConstantPoolScope scope(masm, StackFrame::INTERNAL); + __ Push(r4, r5, r4, r6); // constructor function, original constructor + __ CallRuntime(Runtime::kNewObject, 2); + __ Pop(r4, r5); + } + __ StoreP(r5, FieldMemOperand(r3, JSValue::kValueOffset), r0); + __ Ret(); } } @@ -356,18 +396,24 @@ static void Generate_JSConstructStubHelper(MacroAssembler* masm, __ cmpi(r5, Operand::Zero()); __ bne(&rt_call); - // Fall back to runtime if the original constructor and function differ. - __ cmp(r4, r6); + // Verify that the original constructor is a JSFunction. + __ CompareObjectType(r6, r8, r7, JS_FUNCTION_TYPE); __ bne(&rt_call); // Load the initial map and verify that it is in fact a map. - // r4: constructor function + // r6: original constructor __ LoadP(r5, - FieldMemOperand(r4, JSFunction::kPrototypeOrInitialMapOffset)); + FieldMemOperand(r6, JSFunction::kPrototypeOrInitialMapOffset)); __ JumpIfSmi(r5, &rt_call); __ CompareObjectType(r5, r8, r7, MAP_TYPE); __ bne(&rt_call); + // Fall back to runtime if the expected base constructor and base + // constructor differ. + __ LoadP(r8, FieldMemOperand(r5, Map::kConstructorOrBackPointerOffset)); + __ cmp(r4, r8); + __ bne(&rt_call); + // Check that the constructor is not constructing a JSFunction (see // comments in Runtime_NewObject in runtime.cc). In which case the // initial map's instance type would be JS_FUNCTION_TYPE. @@ -390,9 +436,7 @@ static void Generate_JSConstructStubHelper(MacroAssembler* masm, __ cmpi(r11, Operand(Map::kSlackTrackingCounterEnd)); __ bne(&allocate); - __ push(r4); - - __ Push(r5, r4); // r4 = constructor + __ Push(r4, r5, r5); // r5 = initial map __ CallRuntime(Runtime::kFinalizeInstanceSize, 1); __ Pop(r4, r5); @@ -488,7 +532,7 @@ static void Generate_JSConstructStubHelper(MacroAssembler* masm, // r4: constructor function // r6: original constructor __ bind(&rt_call); - __ Push(r4, r6); + __ Push(r4, r6); // constructor function, original constructor __ CallRuntime(Runtime::kNewObject, 2); __ mr(r7, r3); @@ -885,21 +929,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(MacroAssembler* masm) { // - Support profiler (specifically profiling_counter). // - Call ProfileEntryHookStub when isolate has a function_entry_hook. // - Allow simulator stop operations if FLAG_stop_at is set. - // - Deal with sloppy mode functions which need to replace the - // receiver with the global proxy when called as functions (without an - // explicit receiver object). // - Code aging of the BytecodeArray object. - // - Supporting FLAG_trace. - // - // The following items are also not done here, and will probably be done using - // explicit bytecodes instead: - // - Allocating a new local context if applicable. - // - Setting up a local binding to the this function, which is used in - // derived constructors with super calls. - // - Setting new.target if required. - // - Dealing with REST parameters (only if - // https://codereview.chromium.org/1235153006 doesn't land by then). - // - Dealing with argument objects. // Perform stack guard check. { @@ -907,7 +937,9 @@ void Builtins::Generate_InterpreterEntryTrampoline(MacroAssembler* masm) { __ LoadRoot(r0, Heap::kStackLimitRootIndex); __ cmp(sp, r0); __ bge(&ok); + __ push(kInterpreterBytecodeArrayRegister); __ CallRuntime(Runtime::kStackGuard, 0); + __ pop(kInterpreterBytecodeArrayRegister); __ bind(&ok); } @@ -956,6 +988,63 @@ void Builtins::Generate_InterpreterExitTrampoline(MacroAssembler* masm) { } +static void Generate_InterpreterPushArgs(MacroAssembler* masm, Register index, + Register count, Register scratch) { + Label loop; + __ addi(index, index, Operand(kPointerSize)); // Bias up for LoadPU + __ mtctr(count); + __ bind(&loop); + __ LoadPU(scratch, MemOperand(index, -kPointerSize)); + __ push(scratch); + __ bdnz(&loop); +} + + +// static +void Builtins::Generate_InterpreterPushArgsAndCall(MacroAssembler* masm) { + // ----------- S t a t e ------------- + // -- r3 : the number of arguments (not including the receiver) + // -- r5 : the address of the first argument to be pushed. Subsequent + // arguments should be consecutive above this, in the same order as + // they are to be pushed onto the stack. + // -- r4 : the target to call (can be any Object). + // ----------------------------------- + + // Calculate number of arguments (add one for receiver). + __ addi(r6, r3, Operand(1)); + + // Push the arguments. + Generate_InterpreterPushArgs(masm, r5, r6, r7); + + // Call the target. + __ Jump(masm->isolate()->builtins()->Call(), RelocInfo::CODE_TARGET); +} + + +// static +void Builtins::Generate_InterpreterPushArgsAndConstruct(MacroAssembler* masm) { + // ----------- S t a t e ------------- + // -- r3 : argument count (not including receiver) + // -- r6 : original constructor + // -- r4 : constructor to call + // -- r5 : address of the first argument + // ----------------------------------- + + // Push a slot for the receiver to be constructed. + __ push(r3); + + // Push the arguments (skip if none). + Label skip; + __ cmpi(r3, Operand::Zero()); + __ beq(&skip); + Generate_InterpreterPushArgs(masm, r5, r3, r7); + __ bind(&skip); + + // Call the constructor with r3, r4, and r6 unmodified. + __ Jump(masm->isolate()->builtins()->Construct(), RelocInfo::CONSTRUCT_CALL); +} + + void Builtins::Generate_CompileLazy(MacroAssembler* masm) { CallRuntimePassFunction(masm, Runtime::kCompileLazy); GenerateTailCallToReturnedCode(masm); @@ -1499,71 +1588,80 @@ static void LeaveArgumentsAdaptorFrame(MacroAssembler* masm) { // static -void Builtins::Generate_CallFunction(MacroAssembler* masm) { +void Builtins::Generate_CallFunction(MacroAssembler* masm, + ConvertReceiverMode mode) { // ----------- S t a t e ------------- // -- r3 : the number of arguments (not including the receiver) // -- r4 : the function to call (checked to be a JSFunction) // ----------------------------------- - - Label convert, convert_global_proxy, convert_to_object, done_convert; __ AssertFunction(r4); - // TODO(bmeurer): Throw a TypeError if function's [[FunctionKind]] internal - // slot is "classConstructor". + + // See ES6 section 9.2.1 [[Call]] ( thisArgument, argumentsList) + // Check that the function is not a "classConstructor". + Label class_constructor; + __ LoadP(r5, FieldMemOperand(r4, JSFunction::kSharedFunctionInfoOffset)); + __ lwz(r6, FieldMemOperand(r5, SharedFunctionInfo::kCompilerHintsOffset)); + __ TestBitMask(r6, SharedFunctionInfo::kClassConstructorBits, r0); + __ bne(&class_constructor, cr0); + // Enter the context of the function; ToObject has to run in the function // context, and we also need to take the global proxy from the function // context in case of conversion. - // See ES6 section 9.2.1 [[Call]] ( thisArgument, argumentsList) - STATIC_ASSERT(SharedFunctionInfo::kNativeByteOffset == - SharedFunctionInfo::kStrictModeByteOffset); __ LoadP(cp, FieldMemOperand(r4, JSFunction::kContextOffset)); - __ LoadP(r5, FieldMemOperand(r4, JSFunction::kSharedFunctionInfoOffset)); // We need to convert the receiver for non-native sloppy mode functions. - __ lbz(r6, FieldMemOperand(r5, SharedFunctionInfo::kNativeByteOffset)); - __ andi(r0, r6, Operand((1 << SharedFunctionInfo::kNativeBitWithinByte) | - (1 << SharedFunctionInfo::kStrictModeBitWithinByte))); + Label done_convert; + __ andi(r0, r6, Operand((1 << SharedFunctionInfo::kStrictModeBit) | + (1 << SharedFunctionInfo::kNativeBit))); __ bne(&done_convert, cr0); { - __ ShiftLeftImm(r6, r3, Operand(kPointerSizeLog2)); - __ LoadPX(r6, MemOperand(sp, r6)); - // ----------- S t a t e ------------- // -- r3 : the number of arguments (not including the receiver) // -- r4 : the function to call (checked to be a JSFunction) // -- r5 : the shared function info. - // -- r6 : the receiver // -- cp : the function context. // ----------------------------------- - Label convert_receiver; - __ JumpIfSmi(r6, &convert_to_object); - STATIC_ASSERT(LAST_JS_RECEIVER_TYPE == LAST_TYPE); - __ CompareObjectType(r6, r7, r7, FIRST_JS_RECEIVER_TYPE); - __ bge(&done_convert); - __ JumpIfRoot(r6, Heap::kUndefinedValueRootIndex, &convert_global_proxy); - __ JumpIfNotRoot(r6, Heap::kNullValueRootIndex, &convert_to_object); - __ bind(&convert_global_proxy); - { + if (mode == ConvertReceiverMode::kNullOrUndefined) { // Patch receiver to global proxy. __ LoadGlobalProxy(r6); + } else { + Label convert_to_object, convert_receiver; + __ ShiftLeftImm(r6, r3, Operand(kPointerSizeLog2)); + __ LoadPX(r6, MemOperand(sp, r6)); + __ JumpIfSmi(r6, &convert_to_object); + STATIC_ASSERT(LAST_JS_RECEIVER_TYPE == LAST_TYPE); + __ CompareObjectType(r6, r7, r7, FIRST_JS_RECEIVER_TYPE); + __ bge(&done_convert); + if (mode != ConvertReceiverMode::kNotNullOrUndefined) { + Label convert_global_proxy; + __ JumpIfRoot(r6, Heap::kUndefinedValueRootIndex, + &convert_global_proxy); + __ JumpIfNotRoot(r6, Heap::kNullValueRootIndex, &convert_to_object); + __ bind(&convert_global_proxy); + { + // Patch receiver to global proxy. + __ LoadGlobalProxy(r6); + } + __ b(&convert_receiver); + } + __ bind(&convert_to_object); + { + // Convert receiver using ToObject. + // TODO(bmeurer): Inline the allocation here to avoid building the frame + // in the fast case? (fall back to AllocateInNewSpace?) + FrameAndConstantPoolScope scope(masm, StackFrame::INTERNAL); + __ SmiTag(r3); + __ Push(r3, r4); + __ mr(r3, r6); + ToObjectStub stub(masm->isolate()); + __ CallStub(&stub); + __ mr(r6, r3); + __ Pop(r3, r4); + __ SmiUntag(r3); + } + __ LoadP(r5, FieldMemOperand(r4, JSFunction::kSharedFunctionInfoOffset)); + __ bind(&convert_receiver); } - __ b(&convert_receiver); - __ bind(&convert_to_object); - { - // Convert receiver using ToObject. - // TODO(bmeurer): Inline the allocation here to avoid building the frame - // in the fast case? (fall back to AllocateInNewSpace?) - FrameAndConstantPoolScope scope(masm, StackFrame::INTERNAL); - __ SmiTag(r3); - __ Push(r3, r4); - __ mr(r3, r6); - ToObjectStub stub(masm->isolate()); - __ CallStub(&stub); - __ mr(r6, r3); - __ Pop(r3, r4); - __ SmiUntag(r3); - } - __ LoadP(r5, FieldMemOperand(r4, JSFunction::kSharedFunctionInfoOffset)); - __ bind(&convert_receiver); __ ShiftLeftImm(r7, r3, Operand(kPointerSizeLog2)); __ StorePX(r6, MemOperand(sp, r7)); } @@ -1585,11 +1683,18 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm) { ParameterCount actual(r3); ParameterCount expected(r5); __ InvokeCode(r6, expected, actual, JUMP_FUNCTION, NullCallWrapper()); + + // The function is a "classConstructor", need to raise an exception. + __ bind(&class_constructor); + { + FrameAndConstantPoolScope frame(masm, StackFrame::INTERNAL); + __ CallRuntime(Runtime::kThrowConstructorNonCallableError, 0); + } } // static -void Builtins::Generate_Call(MacroAssembler* masm) { +void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) { // ----------- S t a t e ------------- // -- r3 : the number of arguments (not including the receiver) // -- r4 : the target to call (can be any Object). @@ -1599,8 +1704,8 @@ void Builtins::Generate_Call(MacroAssembler* masm) { __ JumpIfSmi(r4, &non_callable); __ bind(&non_smi); __ CompareObjectType(r4, r7, r8, JS_FUNCTION_TYPE); - __ Jump(masm->isolate()->builtins()->CallFunction(), RelocInfo::CODE_TARGET, - eq); + __ Jump(masm->isolate()->builtins()->CallFunction(mode), + RelocInfo::CODE_TARGET, eq); __ cmpi(r8, Operand(JS_FUNCTION_PROXY_TYPE)); __ bne(&non_function); @@ -1622,7 +1727,9 @@ void Builtins::Generate_Call(MacroAssembler* masm) { __ StorePX(r4, MemOperand(sp, r8)); // Let the "call_as_function_delegate" take care of the rest. __ LoadGlobalFunction(Context::CALL_AS_FUNCTION_DELEGATE_INDEX, r4); - __ Jump(masm->isolate()->builtins()->CallFunction(), RelocInfo::CODE_TARGET); + __ Jump(masm->isolate()->builtins()->CallFunction( + ConvertReceiverMode::kNotNullOrUndefined), + RelocInfo::CODE_TARGET); // 3. Call to something that is not callable. __ bind(&non_callable); @@ -1719,32 +1826,6 @@ void Builtins::Generate_Construct(MacroAssembler* masm) { } -// static -void Builtins::Generate_PushArgsAndCall(MacroAssembler* masm) { - // ----------- S t a t e ------------- - // -- r3 : the number of arguments (not including the receiver) - // -- r5 : the address of the first argument to be pushed. Subsequent - // arguments should be consecutive above this, in the same order as - // they are to be pushed onto the stack. - // -- r4 : the target to call (can be any Object). - - // Calculate number of arguments (add one for receiver). - __ addi(r6, r3, Operand(1)); - - // Push the arguments. - Label loop; - __ addi(r5, r5, Operand(kPointerSize)); // Bias up for LoadPU - __ mtctr(r6); - __ bind(&loop); - __ LoadPU(r6, MemOperand(r5, -kPointerSize)); - __ push(r6); - __ bdnz(&loop); - - // Call the target. - __ Jump(masm->isolate()->builtins()->Call(), RelocInfo::CODE_TARGET); -} - - void Builtins::Generate_ArgumentsAdaptorTrampoline(MacroAssembler* masm) { // ----------- S t a t e ------------- // -- r3 : actual number of arguments @@ -1804,13 +1885,7 @@ void Builtins::Generate_ArgumentsAdaptorTrampoline(MacroAssembler* masm) { Label no_strong_error; __ LoadP(r7, FieldMemOperand(r4, JSFunction::kSharedFunctionInfoOffset)); __ lwz(r8, FieldMemOperand(r7, SharedFunctionInfo::kCompilerHintsOffset)); - __ TestBit(r8, -#if V8_TARGET_ARCH_PPC64 - SharedFunctionInfo::kStrongModeFunction, -#else - SharedFunctionInfo::kStrongModeFunction + kSmiTagSize, -#endif - r0); + __ TestBit(r8, SharedFunctionInfo::kStrongModeBit, r0); __ beq(&no_strong_error, cr0); // What we really care about is the required number of arguments. diff --git a/deps/v8/src/ppc/code-stubs-ppc.cc b/deps/v8/src/ppc/code-stubs-ppc.cc index 290159a3e7..92501a4a23 100644 --- a/deps/v8/src/ppc/code-stubs-ppc.cc +++ b/deps/v8/src/ppc/code-stubs-ppc.cc @@ -1034,15 +1034,22 @@ void CEntryStub::Generate(MacroAssembler* masm) { // fp: frame pointer (restored after C call) // sp: stack pointer (restored as callee's sp after C call) // cp: current context (C callee-saved) - + // + // If argv_in_register(): + // r5: pointer to the first argument ProfileEntryHookStub::MaybeCallEntryHook(masm); __ mr(r15, r4); - // Compute the argv pointer. - __ ShiftLeftImm(r4, r3, Operand(kPointerSizeLog2)); - __ add(r4, r4, sp); - __ subi(r4, r4, Operand(kPointerSize)); + if (argv_in_register()) { + // Move argv into the correct register. + __ mr(r4, r5); + } else { + // Compute the argv pointer. + __ ShiftLeftImm(r4, r3, Operand(kPointerSizeLog2)); + __ add(r4, r4, sp); + __ subi(r4, r4, Operand(kPointerSize)); + } // Enter the exit frame that transitions from JavaScript to C++. FrameScope scope(masm, StackFrame::MANUAL); @@ -1141,8 +1148,15 @@ void CEntryStub::Generate(MacroAssembler* masm) { // r3:r4: result // sp: stack pointer // fp: frame pointer - // r14: still holds argc (callee-saved). - __ LeaveExitFrame(save_doubles(), r14, true); + Register argc; + if (argv_in_register()) { + // We don't want to pop arguments so set argc to no_reg. + argc = no_reg; + } else { + // r14: still holds argc (callee-saved). + argc = r14; + } + __ LeaveExitFrame(save_doubles(), argc, true); __ blr(); // Handling of exception. @@ -1416,13 +1430,7 @@ void InstanceOfStub::Generate(MacroAssembler* masm) { FieldMemOperand(function, JSFunction::kSharedFunctionInfoOffset)); __ lwz(scratch, FieldMemOperand(shared_info, SharedFunctionInfo::kCompilerHintsOffset)); - __ TestBit(scratch, -#if V8_TARGET_ARCH_PPC64 - SharedFunctionInfo::kBoundFunction, -#else - SharedFunctionInfo::kBoundFunction + kSmiTagSize, -#endif - r0); + __ TestBit(scratch, SharedFunctionInfo::kBoundBit, r0); __ bne(&slow_case, cr0); // Get the "prototype" (or initial map) of the {function}. @@ -1697,7 +1705,7 @@ void ArgumentsAccessStub::GenerateNewSloppyFast(MacroAssembler* masm) { __ LoadP(r7, MemOperand(cp, Context::SlotOffset(Context::GLOBAL_OBJECT_INDEX))); - __ LoadP(r7, FieldMemOperand(r7, GlobalObject::kNativeContextOffset)); + __ LoadP(r7, FieldMemOperand(r7, JSGlobalObject::kNativeContextOffset)); __ cmpi(r9, Operand::Zero()); if (CpuFeatures::IsSupported(ISELECT)) { __ LoadP(r11, MemOperand(r7, kNormalOffset)); @@ -1914,7 +1922,7 @@ void ArgumentsAccessStub::GenerateNewStrict(MacroAssembler* masm) { // Get the arguments boilerplate from the current native context. __ LoadP(r7, MemOperand(cp, Context::SlotOffset(Context::GLOBAL_OBJECT_INDEX))); - __ LoadP(r7, FieldMemOperand(r7, GlobalObject::kNativeContextOffset)); + __ LoadP(r7, FieldMemOperand(r7, JSGlobalObject::kNativeContextOffset)); __ LoadP( r7, MemOperand(r7, Context::SlotOffset(Context::STRICT_ARGUMENTS_MAP_INDEX))); @@ -2521,110 +2529,6 @@ static void GenerateRecordCallTarget(MacroAssembler* masm, bool is_super) { } -static void EmitContinueIfStrictOrNative(MacroAssembler* masm, Label* cont) { - // Do not transform the receiver for strict mode functions and natives. - __ LoadP(r6, FieldMemOperand(r4, JSFunction::kSharedFunctionInfoOffset)); - __ lwz(r7, FieldMemOperand(r6, SharedFunctionInfo::kCompilerHintsOffset)); - __ TestBit(r7, -#if V8_TARGET_ARCH_PPC64 - SharedFunctionInfo::kStrictModeFunction, -#else - SharedFunctionInfo::kStrictModeFunction + kSmiTagSize, -#endif - r0); - __ bne(cont, cr0); - - // Do not transform the receiver for native. - __ TestBit(r7, -#if V8_TARGET_ARCH_PPC64 - SharedFunctionInfo::kNative, -#else - SharedFunctionInfo::kNative + kSmiTagSize, -#endif - r0); - __ bne(cont, cr0); -} - - -static void EmitSlowCase(MacroAssembler* masm, int argc) { - __ mov(r3, Operand(argc)); - __ Jump(masm->isolate()->builtins()->Call(), RelocInfo::CODE_TARGET); -} - - -static void EmitWrapCase(MacroAssembler* masm, int argc, Label* cont) { - // Wrap the receiver and patch it back onto the stack. - { - FrameAndConstantPoolScope frame_scope(masm, StackFrame::INTERNAL); - __ push(r4); - __ mr(r3, r6); - ToObjectStub stub(masm->isolate()); - __ CallStub(&stub); - __ pop(r4); - } - __ StoreP(r3, MemOperand(sp, argc * kPointerSize), r0); - __ b(cont); -} - - -static void CallFunctionNoFeedback(MacroAssembler* masm, int argc, - bool needs_checks, bool call_as_method) { - // r4 : the function to call - Label slow, wrap, cont; - - if (needs_checks) { - // Check that the function is really a JavaScript function. - // r4: pushed function (to be verified) - __ JumpIfSmi(r4, &slow); - - // Goto slow case if we do not have a function. - __ CompareObjectType(r4, r7, r7, JS_FUNCTION_TYPE); - __ bne(&slow); - } - - // Fast-case: Invoke the function now. - // r4: pushed function - ParameterCount actual(argc); - - if (call_as_method) { - if (needs_checks) { - EmitContinueIfStrictOrNative(masm, &cont); - } - - // Compute the receiver in sloppy mode. - __ LoadP(r6, MemOperand(sp, argc * kPointerSize), r0); - - if (needs_checks) { - __ JumpIfSmi(r6, &wrap); - __ CompareObjectType(r6, r7, r7, FIRST_SPEC_OBJECT_TYPE); - __ blt(&wrap); - } else { - __ b(&wrap); - } - - __ bind(&cont); - } - - __ InvokeFunction(r4, actual, JUMP_FUNCTION, NullCallWrapper()); - - if (needs_checks) { - // Slow-case: Non-function called. - __ bind(&slow); - EmitSlowCase(masm, argc); - } - - if (call_as_method) { - __ bind(&wrap); - EmitWrapCase(masm, argc, &cont); - } -} - - -void CallFunctionStub::Generate(MacroAssembler* masm) { - CallFunctionNoFeedback(masm, argc(), NeedsChecks(), CallAsMethod()); -} - - void CallConstructStub::Generate(MacroAssembler* masm) { // r3 : number of arguments // r4 : the function to call @@ -2715,9 +2619,7 @@ void CallICStub::Generate(MacroAssembler* masm) { FixedArray::OffsetOfElementAt(TypeFeedbackVector::kWithTypesIndex); const int generic_offset = FixedArray::OffsetOfElementAt(TypeFeedbackVector::kGenericCountIndex); - Label extra_checks_or_miss, slow_start; - Label slow, wrap, cont; - Label have_js_function; + Label extra_checks_or_miss, call; int argc = arg_count(); ParameterCount actual(argc); @@ -2754,34 +2656,15 @@ void CallICStub::Generate(MacroAssembler* masm) { __ AddSmiLiteral(r6, r6, Smi::FromInt(CallICNexus::kCallCountIncrement), r0); __ StoreP(r6, FieldMemOperand(r9, count_offset), r0); - __ bind(&have_js_function); - if (CallAsMethod()) { - EmitContinueIfStrictOrNative(masm, &cont); - // Compute the receiver in sloppy mode. - __ LoadP(r6, MemOperand(sp, argc * kPointerSize), r0); - - __ JumpIfSmi(r6, &wrap); - __ CompareObjectType(r6, r7, r7, FIRST_SPEC_OBJECT_TYPE); - __ blt(&wrap); - - __ bind(&cont); - } - - __ InvokeFunction(r4, actual, JUMP_FUNCTION, NullCallWrapper()); - - __ bind(&slow); - EmitSlowCase(masm, argc); - - if (CallAsMethod()) { - __ bind(&wrap); - EmitWrapCase(masm, argc, &cont); - } + __ bind(&call); + __ mov(r3, Operand(argc)); + __ Jump(masm->isolate()->builtins()->Call(), RelocInfo::CODE_TARGET); __ bind(&extra_checks_or_miss); Label uninitialized, miss, not_allocation_site; __ CompareRoot(r7, Heap::kmegamorphic_symbolRootIndex); - __ beq(&slow_start); + __ beq(&call); // Verify that r7 contains an AllocationSite __ LoadP(r8, FieldMemOperand(r7, HeapObject::kMapOffset)); @@ -2816,7 +2699,7 @@ void CallICStub::Generate(MacroAssembler* masm) { __ LoadP(r7, FieldMemOperand(r5, generic_offset)); __ AddSmiLiteral(r7, r7, Smi::FromInt(1), r0); __ StoreP(r7, FieldMemOperand(r5, generic_offset), r0); - __ b(&slow_start); + __ b(&call); __ bind(&uninitialized); @@ -2854,23 +2737,14 @@ void CallICStub::Generate(MacroAssembler* masm) { __ Pop(r4); } - __ b(&have_js_function); + __ b(&call); // We are here because tracing is on or we encountered a MISS case we can't // handle here. __ bind(&miss); GenerateMiss(masm); - // the slow case - __ bind(&slow_start); - // Check that the function is really a JavaScript function. - // r4: pushed function (to be verified) - __ JumpIfSmi(r4, &slow); - - // Goto slow case if we do not have a function. - __ CompareObjectType(r4, r7, r7, JS_FUNCTION_TYPE); - __ bne(&slow); - __ b(&have_js_function); + __ b(&call); } @@ -3011,7 +2885,7 @@ void StringCharFromCodeGenerator::GenerateSlow( __ bind(&slow_case_); call_helper.BeforeCall(masm); __ push(code_); - __ CallRuntime(Runtime::kCharFromCode, 1); + __ CallRuntime(Runtime::kStringCharFromCode, 1); __ Move(result_, r3); call_helper.AfterCall(masm); __ b(&exit_); @@ -3320,6 +3194,28 @@ void ToNumberStub::Generate(MacroAssembler* masm) { } +void ToLengthStub::Generate(MacroAssembler* masm) { + // The ToLength stub takes one argument in r3. + Label not_smi; + __ JumpIfNotSmi(r3, ¬_smi); + STATIC_ASSERT(kSmiTag == 0); + __ cmpi(r3, Operand::Zero()); + if (CpuFeatures::IsSupported(ISELECT)) { + __ isel(lt, r3, r0, r3); + } else { + Label positive; + __ bgt(&positive); + __ li(r3, Operand::Zero()); + __ bind(&positive); + } + __ Ret(); + __ bind(¬_smi); + + __ push(r3); // Push argument. + __ TailCallRuntime(Runtime::kToLength, 1, 1); +} + + void ToStringStub::Generate(MacroAssembler* masm) { // The ToString stub takes one argument in r3. Label is_number; diff --git a/deps/v8/src/ppc/code-stubs-ppc.h b/deps/v8/src/ppc/code-stubs-ppc.h index bc6c26b217..ef4bdce5d1 100644 --- a/deps/v8/src/ppc/code-stubs-ppc.h +++ b/deps/v8/src/ppc/code-stubs-ppc.h @@ -322,7 +322,7 @@ class NameDictionaryLookupStub : public PlatformCodeStub { DEFINE_NULL_CALL_INTERFACE_DESCRIPTOR(); DEFINE_PLATFORM_CODE_STUB(NameDictionaryLookup, PlatformCodeStub); }; -} -} // namespace v8::internal +} // namespace internal +} // namespace v8 #endif // V8_PPC_CODE_STUBS_PPC_H_ diff --git a/deps/v8/src/ppc/codegen-ppc.h b/deps/v8/src/ppc/codegen-ppc.h index f8da74eaa6..7f19beea7d 100644 --- a/deps/v8/src/ppc/codegen-ppc.h +++ b/deps/v8/src/ppc/codegen-ppc.h @@ -35,7 +35,7 @@ class MathExpGenerator : public AllStatic { private: DISALLOW_COPY_AND_ASSIGN(MathExpGenerator); }; -} -} // namespace v8::internal +} // namespace internal +} // namespace v8 #endif // V8_PPC_CODEGEN_PPC_H_ diff --git a/deps/v8/src/ppc/constants-ppc.cc b/deps/v8/src/ppc/constants-ppc.cc index 56147b3c48..e6eec643f4 100644 --- a/deps/v8/src/ppc/constants-ppc.cc +++ b/deps/v8/src/ppc/constants-ppc.cc @@ -14,45 +14,18 @@ namespace internal { // formatting. See for example the command "objdump -d <binary file>". const char* Registers::names_[kNumRegisters] = { "r0", "sp", "r2", "r3", "r4", "r5", "r6", "r7", "r8", "r9", "r10", - "r11", "r12", "r13", "r14", "r15", "r16", "r17", "r18", "r19", "r20", "r21", + "r11", "ip", "r13", "r14", "r15", "r16", "r17", "r18", "r19", "r20", "r21", "r22", "r23", "r24", "r25", "r26", "r27", "r28", "r29", "r30", "fp"}; -// List of alias names which can be used when referring to PPC registers. -const Registers::RegisterAlias Registers::aliases_[] = {{10, "sl"}, - {11, "r11"}, - {12, "r12"}, - {13, "r13"}, - {14, "r14"}, - {15, "r15"}, - {kNoRegister, NULL}}; - - -const char* Registers::Name(int reg) { - const char* result; - if ((0 <= reg) && (reg < kNumRegisters)) { - result = names_[reg]; - } else { - result = "noreg"; - } - return result; -} - - -const char* FPRegisters::names_[kNumFPRegisters] = { +const char* DoubleRegisters::names_[kNumDoubleRegisters] = { "d0", "d1", "d2", "d3", "d4", "d5", "d6", "d7", "d8", "d9", "d10", "d11", "d12", "d13", "d14", "d15", "d16", "d17", "d18", "d19", "d20", "d21", "d22", "d23", "d24", "d25", "d26", "d27", "d28", "d29", "d30", "d31"}; -const char* FPRegisters::Name(int reg) { - DCHECK((0 <= reg) && (reg < kNumFPRegisters)); - return names_[reg]; -} - - -int FPRegisters::Number(const char* name) { - for (int i = 0; i < kNumFPRegisters; i++) { +int DoubleRegisters::Number(const char* name) { + for (int i = 0; i < kNumDoubleRegisters; i++) { if (strcmp(names_[i], name) == 0) { return i; } @@ -71,15 +44,6 @@ int Registers::Number(const char* name) { } } - // Look through the alias names. - int i = 0; - while (aliases_[i].reg != kNoRegister) { - if (strcmp(aliases_[i].name, name) == 0) { - return aliases_[i].reg; - } - i++; - } - // No register with the requested name found. return kNoRegister; } diff --git a/deps/v8/src/ppc/constants-ppc.h b/deps/v8/src/ppc/constants-ppc.h index b304bad7ce..87a82719be 100644 --- a/deps/v8/src/ppc/constants-ppc.h +++ b/deps/v8/src/ppc/constants-ppc.h @@ -18,8 +18,7 @@ namespace internal { const int kNumRegisters = 32; // FP support. -const int kNumFPDoubleRegisters = 32; -const int kNumFPRegisters = kNumFPDoubleRegisters; +const int kNumDoubleRegisters = 32; const int kNoRegister = -1; @@ -229,6 +228,7 @@ enum OpcodeExt2 { LHAUX = 375 << 1, // load half-word algebraic w/ update x-form XORX = 316 << 1, // Exclusive OR MFSPR = 339 << 1, // Move from Special-Purpose-Register + POPCNTW = 378 << 1, // Population Count Words STHX = 407 << 1, // store half-word w/ x-form ORC = 412 << 1, // Or with Complement STHUX = 439 << 1, // store half-word w/ update x-form @@ -238,6 +238,7 @@ enum OpcodeExt2 { MTSPR = 467 << 1, // Move to Special-Purpose-Register DIVD = 489 << 1, // Divide Double Word DIVW = 491 << 1, // Divide Word + POPCNTD = 506 << 1, // Population Count Doubleword // Below represent bits 10-1 (any value >= 512) LFSX = 535 << 1, // load float-single w/ x-form @@ -564,35 +565,23 @@ class Instruction { // Helper functions for converting between register numbers and names. class Registers { public: - // Return the name of the register. - static const char* Name(int reg); - // Lookup the register number for the name provided. static int Number(const char* name); - struct RegisterAlias { - int reg; - const char* name; - }; - private: static const char* names_[kNumRegisters]; - static const RegisterAlias aliases_[]; }; // Helper functions for converting between FP register numbers and names. -class FPRegisters { +class DoubleRegisters { public: - // Return the name of the register. - static const char* Name(int reg); - // Lookup the register number for the name provided. static int Number(const char* name); private: - static const char* names_[kNumFPRegisters]; + static const char* names_[kNumDoubleRegisters]; }; -} -} // namespace v8::internal +} // namespace internal +} // namespace v8 #endif // V8_PPC_CONSTANTS_PPC_H_ diff --git a/deps/v8/src/ppc/deoptimizer-ppc.cc b/deps/v8/src/ppc/deoptimizer-ppc.cc index 3e4511f78f..831ccf6cdc 100644 --- a/deps/v8/src/ppc/deoptimizer-ppc.cc +++ b/deps/v8/src/ppc/deoptimizer-ppc.cc @@ -5,6 +5,7 @@ #include "src/codegen.h" #include "src/deoptimizer.h" #include "src/full-codegen/full-codegen.h" +#include "src/register-configuration.h" #include "src/safepoint-table.h" namespace v8 { @@ -99,7 +100,7 @@ void Deoptimizer::FillInputFrame(Address tos, JavaScriptFrame* frame) { } input_->SetRegister(sp.code(), reinterpret_cast<intptr_t>(frame->sp())); input_->SetRegister(fp.code(), reinterpret_cast<intptr_t>(frame->fp())); - for (int i = 0; i < DoubleRegister::NumAllocatableRegisters(); i++) { + for (int i = 0; i < DoubleRegister::kNumRegisters; i++) { input_->SetDoubleRegister(i, 0.0); } @@ -123,7 +124,7 @@ void Deoptimizer::SetPlatformCompiledStubRegisters( void Deoptimizer::CopyDoubleRegisters(FrameDescription* output_frame) { - for (int i = 0; i < DoubleRegister::kMaxNumRegisters; ++i) { + for (int i = 0; i < DoubleRegister::kNumRegisters; ++i) { double double_value = input_->GetDoubleRegister(i); output_frame->SetDoubleRegister(i, double_value); } @@ -150,15 +151,17 @@ void Deoptimizer::TableEntryGenerator::Generate() { RegList restored_regs = kJSCallerSaved | kCalleeSaved; RegList saved_regs = restored_regs | sp.bit(); - const int kDoubleRegsSize = - kDoubleSize * DoubleRegister::kMaxNumAllocatableRegisters; + const int kDoubleRegsSize = kDoubleSize * DoubleRegister::kNumRegisters; - // Save all FPU registers before messing with them. + // Save all double registers before messing with them. __ subi(sp, sp, Operand(kDoubleRegsSize)); - for (int i = 0; i < DoubleRegister::kMaxNumAllocatableRegisters; ++i) { - DoubleRegister fpu_reg = DoubleRegister::FromAllocationIndex(i); - int offset = i * kDoubleSize; - __ stfd(fpu_reg, MemOperand(sp, offset)); + const RegisterConfiguration* config = + RegisterConfiguration::ArchDefault(RegisterConfiguration::CRANKSHAFT); + for (int i = 0; i < config->num_allocatable_double_registers(); ++i) { + int code = config->GetAllocatableDoubleCode(i); + const DoubleRegister dreg = DoubleRegister::from_code(code); + int offset = code * kDoubleSize; + __ stfd(dreg, MemOperand(sp, offset)); } // Push saved_regs (needed to populate FrameDescription::registers_). @@ -215,11 +218,12 @@ void Deoptimizer::TableEntryGenerator::Generate() { } int double_regs_offset = FrameDescription::double_registers_offset(); - // Copy VFP registers to - // double_registers_[DoubleRegister::kNumAllocatableRegisters] - for (int i = 0; i < DoubleRegister::NumAllocatableRegisters(); ++i) { - int dst_offset = i * kDoubleSize + double_regs_offset; - int src_offset = i * kDoubleSize + kNumberOfRegisters * kPointerSize; + // Copy double registers to + // double_registers_[DoubleRegister::kNumRegisters] + for (int i = 0; i < config->num_allocatable_double_registers(); ++i) { + int code = config->GetAllocatableDoubleCode(i); + int dst_offset = code * kDoubleSize + double_regs_offset; + int src_offset = code * kDoubleSize + kNumberOfRegisters * kPointerSize; __ lfd(d0, MemOperand(sp, src_offset)); __ stfd(d0, MemOperand(r4, dst_offset)); } @@ -291,9 +295,10 @@ void Deoptimizer::TableEntryGenerator::Generate() { __ blt(&outer_push_loop); __ LoadP(r4, MemOperand(r3, Deoptimizer::input_offset())); - for (int i = 0; i < DoubleRegister::kMaxNumAllocatableRegisters; ++i) { - const DoubleRegister dreg = DoubleRegister::FromAllocationIndex(i); - int src_offset = i * kDoubleSize + double_regs_offset; + for (int i = 0; i < config->num_allocatable_double_registers(); ++i) { + int code = config->GetAllocatableDoubleCode(i); + const DoubleRegister dreg = DoubleRegister::from_code(code); + int src_offset = code * kDoubleSize + double_regs_offset; __ lfd(dreg, MemOperand(r4, src_offset)); } diff --git a/deps/v8/src/ppc/disasm-ppc.cc b/deps/v8/src/ppc/disasm-ppc.cc index 5d7de8a0b4..83fbc7e29c 100644 --- a/deps/v8/src/ppc/disasm-ppc.cc +++ b/deps/v8/src/ppc/disasm-ppc.cc @@ -78,6 +78,7 @@ class Decoder { void DecodeExt1(Instruction* instr); void DecodeExt2(Instruction* instr); + void DecodeExt3(Instruction* instr); void DecodeExt4(Instruction* instr); void DecodeExt5(Instruction* instr); @@ -116,7 +117,9 @@ void Decoder::PrintRegister(int reg) { // Print the double FP register name according to the active name converter. -void Decoder::PrintDRegister(int reg) { Print(FPRegisters::Name(reg)); } +void Decoder::PrintDRegister(int reg) { + Print(DoubleRegister::from_code(reg).ToString()); +} // Print SoftwareInterrupt codes. Factoring this out reduces the complexity of @@ -607,6 +610,16 @@ void Decoder::DecodeExt2(Instruction* instr) { Format(instr, "stfdux 'rs, 'ra, 'rb"); return; } + case POPCNTW: { + Format(instr, "popcntw 'ra, 'rs"); + return; + } +#if V8_TARGET_ARCH_PPC64 + case POPCNTD: { + Format(instr, "popcntd 'ra, 'rs"); + return; + } +#endif } switch (instr->Bits(10, 2) << 2) { @@ -870,6 +883,19 @@ void Decoder::DecodeExt2(Instruction* instr) { } +void Decoder::DecodeExt3(Instruction* instr) { + switch (instr->Bits(10, 1) << 1) { + case FCFID: { + Format(instr, "fcfids'. 'Dt, 'Db"); + break; + } + default: { + Unknown(instr); // not used by V8 + } + } +} + + void Decoder::DecodeExt4(Instruction* instr) { switch (instr->Bits(5, 1) << 1) { case FDIV: { @@ -1287,7 +1313,10 @@ int Decoder::InstructionDecode(byte* instr_ptr) { Format(instr, "stfdu 'Dt, 'int16('ra)"); break; } - case EXT3: + case EXT3: { + DecodeExt3(instr); + break; + } case EXT4: { DecodeExt4(instr); break; @@ -1349,7 +1378,7 @@ const char* NameConverter::NameOfConstant(byte* addr) const { const char* NameConverter::NameOfCPURegister(int reg) const { - return v8::internal::Registers::Name(reg); + return v8::internal::Register::from_code(reg).ToString(); } const char* NameConverter::NameOfByteCPURegister(int reg) const { diff --git a/deps/v8/src/ppc/frames-ppc.h b/deps/v8/src/ppc/frames-ppc.h index d5b6d3caa9..b1de9f50ff 100644 --- a/deps/v8/src/ppc/frames-ppc.h +++ b/deps/v8/src/ppc/frames-ppc.h @@ -70,6 +70,8 @@ const RegList kCallerSavedDoubles = 1 << 0 | // d0 1 << 12 | // d12 1 << 13; // d13 +const int kNumCallerSavedDoubles = 14; + const RegList kCalleeSavedDoubles = 1 << 14 | // d14 1 << 15 | // d15 1 << 16 | // d16 @@ -185,7 +187,7 @@ class JavaScriptFrameConstants : public AllStatic { }; -} -} // namespace v8::internal +} // namespace internal +} // namespace v8 #endif // V8_PPC_FRAMES_PPC_H_ diff --git a/deps/v8/src/ppc/interface-descriptors-ppc.cc b/deps/v8/src/ppc/interface-descriptors-ppc.cc index c123e7c602..b54845d4b3 100644 --- a/deps/v8/src/ppc/interface-descriptors-ppc.cc +++ b/deps/v8/src/ppc/interface-descriptors-ppc.cc @@ -78,14 +78,6 @@ const Register GrowArrayElementsDescriptor::ObjectRegister() { return r3; } const Register GrowArrayElementsDescriptor::KeyRegister() { return r6; } -void VectorStoreTransitionDescriptor::InitializePlatformSpecific( - CallInterfaceDescriptorData* data) { - Register registers[] = {ReceiverRegister(), NameRegister(), ValueRegister(), - SlotRegister(), VectorRegister(), MapRegister()}; - data->InitializePlatformSpecific(arraysize(registers), registers); -} - - void FastNewClosureDescriptor::InitializePlatformSpecific( CallInterfaceDescriptorData* data) { Register registers[] = {r5}; @@ -108,6 +100,10 @@ void ToNumberDescriptor::InitializePlatformSpecific( // static +const Register ToLengthDescriptor::ReceiverRegister() { return r3; } + + +// static const Register ToStringDescriptor::ReceiverRegister() { return r3; } @@ -228,6 +224,13 @@ void AllocateHeapNumberDescriptor::InitializePlatformSpecific( } +void AllocateInNewSpaceDescriptor::InitializePlatformSpecific( + CallInterfaceDescriptorData* data) { + Register registers[] = {r3}; + data->InitializePlatformSpecific(arraysize(registers), registers); +} + + void ArrayConstructorConstantArgCountDescriptor::InitializePlatformSpecific( CallInterfaceDescriptorData* data) { // register state @@ -391,15 +394,38 @@ void MathRoundVariantCallFromOptimizedCodeDescriptor:: } -void PushArgsAndCallDescriptor::InitializePlatformSpecific( +void InterpreterPushArgsAndCallDescriptor::InitializePlatformSpecific( CallInterfaceDescriptorData* data) { Register registers[] = { - r3, // argument count (including receiver) + r3, // argument count (not including receiver) r5, // address of first argument r4 // the target callable to be call }; data->InitializePlatformSpecific(arraysize(registers), registers); } + + +void InterpreterPushArgsAndConstructDescriptor::InitializePlatformSpecific( + CallInterfaceDescriptorData* data) { + Register registers[] = { + r3, // argument count (not including receiver) + r6, // original constructor + r4, // constructor to call + r5 // address of the first argument + }; + data->InitializePlatformSpecific(arraysize(registers), registers); +} + + +void InterpreterCEntryDescriptor::InitializePlatformSpecific( + CallInterfaceDescriptorData* data) { + Register registers[] = { + r3, // argument count (argc) + r5, // address of first argument (argv) + r4 // the runtime function to call + }; + data->InitializePlatformSpecific(arraysize(registers), registers); +} } // namespace internal } // namespace v8 diff --git a/deps/v8/src/ppc/lithium-codegen-ppc.cc b/deps/v8/src/ppc/lithium-codegen-ppc.cc deleted file mode 100644 index ad6d8db13d..0000000000 --- a/deps/v8/src/ppc/lithium-codegen-ppc.cc +++ /dev/null @@ -1,6138 +0,0 @@ -// Copyright 2014 the V8 project authors. All rights reserved. -// Use of this source code is governed by a BSD-style license that can be -// found in the LICENSE file. - -#include "src/base/bits.h" -#include "src/code-factory.h" -#include "src/code-stubs.h" -#include "src/hydrogen-osr.h" -#include "src/ic/ic.h" -#include "src/ic/stub-cache.h" -#include "src/ppc/lithium-codegen-ppc.h" -#include "src/ppc/lithium-gap-resolver-ppc.h" -#include "src/profiler/cpu-profiler.h" - -namespace v8 { -namespace internal { - - -class SafepointGenerator final : public CallWrapper { - public: - SafepointGenerator(LCodeGen* codegen, LPointerMap* pointers, - Safepoint::DeoptMode mode) - : codegen_(codegen), pointers_(pointers), deopt_mode_(mode) {} - virtual ~SafepointGenerator() {} - - void BeforeCall(int call_size) const override {} - - void AfterCall() const override { - codegen_->RecordSafepoint(pointers_, deopt_mode_); - } - - private: - LCodeGen* codegen_; - LPointerMap* pointers_; - Safepoint::DeoptMode deopt_mode_; -}; - - -#define __ masm()-> - -bool LCodeGen::GenerateCode() { - LPhase phase("Z_Code generation", chunk()); - DCHECK(is_unused()); - status_ = GENERATING; - - // Open a frame scope to indicate that there is a frame on the stack. The - // NONE indicates that the scope shouldn't actually generate code to set up - // the frame (that is done in GeneratePrologue). - FrameScope frame_scope(masm_, StackFrame::NONE); - - bool rc = GeneratePrologue() && GenerateBody() && GenerateDeferredCode() && - GenerateJumpTable() && GenerateSafepointTable(); - if (FLAG_enable_embedded_constant_pool && !rc) { - masm()->AbortConstantPoolBuilding(); - } - return rc; -} - - -void LCodeGen::FinishCode(Handle<Code> code) { - DCHECK(is_done()); - code->set_stack_slots(GetStackSlotCount()); - code->set_safepoint_table_offset(safepoints_.GetCodeOffset()); - PopulateDeoptimizationData(code); -} - - -void LCodeGen::SaveCallerDoubles() { - DCHECK(info()->saves_caller_doubles()); - DCHECK(NeedsEagerFrame()); - Comment(";;; Save clobbered callee double registers"); - int count = 0; - BitVector* doubles = chunk()->allocated_double_registers(); - BitVector::Iterator save_iterator(doubles); - while (!save_iterator.Done()) { - __ stfd(DoubleRegister::FromAllocationIndex(save_iterator.Current()), - MemOperand(sp, count * kDoubleSize)); - save_iterator.Advance(); - count++; - } -} - - -void LCodeGen::RestoreCallerDoubles() { - DCHECK(info()->saves_caller_doubles()); - DCHECK(NeedsEagerFrame()); - Comment(";;; Restore clobbered callee double registers"); - BitVector* doubles = chunk()->allocated_double_registers(); - BitVector::Iterator save_iterator(doubles); - int count = 0; - while (!save_iterator.Done()) { - __ lfd(DoubleRegister::FromAllocationIndex(save_iterator.Current()), - MemOperand(sp, count * kDoubleSize)); - save_iterator.Advance(); - count++; - } -} - - -bool LCodeGen::GeneratePrologue() { - DCHECK(is_generating()); - - if (info()->IsOptimizing()) { - ProfileEntryHookStub::MaybeCallEntryHook(masm_); - -#ifdef DEBUG - if (strlen(FLAG_stop_at) > 0 && - info_->literal()->name()->IsUtf8EqualTo(CStrVector(FLAG_stop_at))) { - __ stop("stop_at"); - } -#endif - - // r4: Callee's JS function. - // cp: Callee's context. - // pp: Callee's constant pool pointer (if enabled) - // fp: Caller's frame pointer. - // lr: Caller's pc. - // ip: Our own function entry (required by the prologue) - - // Sloppy mode functions and builtins need to replace the receiver with the - // global proxy when called as functions (without an explicit receiver - // object). - if (info()->MustReplaceUndefinedReceiverWithGlobalProxy()) { - Label ok; - int receiver_offset = info_->scope()->num_parameters() * kPointerSize; - __ LoadP(r5, MemOperand(sp, receiver_offset)); - __ CompareRoot(r5, Heap::kUndefinedValueRootIndex); - __ bne(&ok); - - __ LoadP(r5, GlobalObjectOperand()); - __ LoadP(r5, FieldMemOperand(r5, GlobalObject::kGlobalProxyOffset)); - - __ StoreP(r5, MemOperand(sp, receiver_offset)); - - __ bind(&ok); - } - } - - int prologue_offset = masm_->pc_offset(); - - if (prologue_offset) { - // Prologue logic requires it's starting address in ip and the - // corresponding offset from the function entry. - prologue_offset += Instruction::kInstrSize; - __ addi(ip, ip, Operand(prologue_offset)); - } - info()->set_prologue_offset(prologue_offset); - if (NeedsEagerFrame()) { - if (info()->IsStub()) { - __ StubPrologue(prologue_offset); - } else { - __ Prologue(info()->IsCodePreAgingActive(), prologue_offset); - } - frame_is_built_ = true; - info_->AddNoFrameRange(0, masm_->pc_offset()); - } - - // Reserve space for the stack slots needed by the code. - int slots = GetStackSlotCount(); - if (slots > 0) { - __ subi(sp, sp, Operand(slots * kPointerSize)); - if (FLAG_debug_code) { - __ Push(r3, r4); - __ li(r0, Operand(slots)); - __ mtctr(r0); - __ addi(r3, sp, Operand((slots + 2) * kPointerSize)); - __ mov(r4, Operand(kSlotsZapValue)); - Label loop; - __ bind(&loop); - __ StorePU(r4, MemOperand(r3, -kPointerSize)); - __ bdnz(&loop); - __ Pop(r3, r4); - } - } - - if (info()->saves_caller_doubles()) { - SaveCallerDoubles(); - } - return !is_aborted(); -} - - -void LCodeGen::DoPrologue(LPrologue* instr) { - Comment(";;; Prologue begin"); - - // Possibly allocate a local context. - if (info()->scope()->num_heap_slots() > 0) { - Comment(";;; Allocate local context"); - bool need_write_barrier = true; - // Argument to NewContext is the function, which is in r4. - int slots = info()->scope()->num_heap_slots() - Context::MIN_CONTEXT_SLOTS; - Safepoint::DeoptMode deopt_mode = Safepoint::kNoLazyDeopt; - if (info()->scope()->is_script_scope()) { - __ push(r4); - __ Push(info()->scope()->GetScopeInfo(info()->isolate())); - __ CallRuntime(Runtime::kNewScriptContext, 2); - deopt_mode = Safepoint::kLazyDeopt; - } else if (slots <= FastNewContextStub::kMaximumSlots) { - FastNewContextStub stub(isolate(), slots); - __ CallStub(&stub); - // Result of FastNewContextStub is always in new space. - need_write_barrier = false; - } else { - __ push(r4); - __ CallRuntime(Runtime::kNewFunctionContext, 1); - } - RecordSafepoint(deopt_mode); - - // Context is returned in both r3 and cp. It replaces the context - // passed to us. It's saved in the stack and kept live in cp. - __ mr(cp, r3); - __ StoreP(r3, MemOperand(fp, StandardFrameConstants::kContextOffset)); - // Copy any necessary parameters into the context. - int num_parameters = scope()->num_parameters(); - int first_parameter = scope()->has_this_declaration() ? -1 : 0; - for (int i = first_parameter; i < num_parameters; i++) { - Variable* var = (i == -1) ? scope()->receiver() : scope()->parameter(i); - if (var->IsContextSlot()) { - int parameter_offset = StandardFrameConstants::kCallerSPOffset + - (num_parameters - 1 - i) * kPointerSize; - // Load parameter from stack. - __ LoadP(r3, MemOperand(fp, parameter_offset)); - // Store it in the context. - MemOperand target = ContextOperand(cp, var->index()); - __ StoreP(r3, target, r0); - // Update the write barrier. This clobbers r6 and r3. - if (need_write_barrier) { - __ RecordWriteContextSlot(cp, target.offset(), r3, r6, - GetLinkRegisterState(), kSaveFPRegs); - } else if (FLAG_debug_code) { - Label done; - __ JumpIfInNewSpace(cp, r3, &done); - __ Abort(kExpectedNewSpaceObject); - __ bind(&done); - } - } - } - Comment(";;; End allocate local context"); - } - - Comment(";;; Prologue end"); -} - - -void LCodeGen::GenerateOsrPrologue() { - // Generate the OSR entry prologue at the first unknown OSR value, or if there - // are none, at the OSR entrypoint instruction. - if (osr_pc_offset_ >= 0) return; - - osr_pc_offset_ = masm()->pc_offset(); - - // Adjust the frame size, subsuming the unoptimized frame into the - // optimized frame. - int slots = GetStackSlotCount() - graph()->osr()->UnoptimizedFrameSlots(); - DCHECK(slots >= 0); - __ subi(sp, sp, Operand(slots * kPointerSize)); -} - - -void LCodeGen::GenerateBodyInstructionPre(LInstruction* instr) { - if (instr->IsCall()) { - EnsureSpaceForLazyDeopt(Deoptimizer::patch_size()); - } - if (!instr->IsLazyBailout() && !instr->IsGap()) { - safepoints_.BumpLastLazySafepointIndex(); - } -} - - -bool LCodeGen::GenerateDeferredCode() { - DCHECK(is_generating()); - if (deferred_.length() > 0) { - for (int i = 0; !is_aborted() && i < deferred_.length(); i++) { - LDeferredCode* code = deferred_[i]; - - HValue* value = - instructions_->at(code->instruction_index())->hydrogen_value(); - RecordAndWritePosition( - chunk()->graph()->SourcePositionToScriptPosition(value->position())); - - Comment( - ";;; <@%d,#%d> " - "-------------------- Deferred %s --------------------", - code->instruction_index(), code->instr()->hydrogen_value()->id(), - code->instr()->Mnemonic()); - __ bind(code->entry()); - if (NeedsDeferredFrame()) { - Comment(";;; Build frame"); - DCHECK(!frame_is_built_); - DCHECK(info()->IsStub()); - frame_is_built_ = true; - __ LoadSmiLiteral(scratch0(), Smi::FromInt(StackFrame::STUB)); - __ PushFixedFrame(scratch0()); - __ addi(fp, sp, Operand(StandardFrameConstants::kFixedFrameSizeFromFp)); - Comment(";;; Deferred code"); - } - code->Generate(); - if (NeedsDeferredFrame()) { - Comment(";;; Destroy frame"); - DCHECK(frame_is_built_); - __ PopFixedFrame(ip); - frame_is_built_ = false; - } - __ b(code->exit()); - } - } - - return !is_aborted(); -} - - -bool LCodeGen::GenerateJumpTable() { - // Check that the jump table is accessible from everywhere in the function - // code, i.e. that offsets to the table can be encoded in the 24bit signed - // immediate of a branch instruction. - // To simplify we consider the code size from the first instruction to the - // end of the jump table. We also don't consider the pc load delta. - // Each entry in the jump table generates one instruction and inlines one - // 32bit data after it. - if (!is_int24((masm()->pc_offset() / Assembler::kInstrSize) + - jump_table_.length() * 7)) { - Abort(kGeneratedCodeIsTooLarge); - } - - if (jump_table_.length() > 0) { - Label needs_frame, call_deopt_entry; - - Comment(";;; -------------------- Jump table --------------------"); - Address base = jump_table_[0].address; - - Register entry_offset = scratch0(); - - int length = jump_table_.length(); - for (int i = 0; i < length; i++) { - Deoptimizer::JumpTableEntry* table_entry = &jump_table_[i]; - __ bind(&table_entry->label); - - DCHECK_EQ(jump_table_[0].bailout_type, table_entry->bailout_type); - Address entry = table_entry->address; - DeoptComment(table_entry->deopt_info); - - // Second-level deopt table entries are contiguous and small, so instead - // of loading the full, absolute address of each one, load an immediate - // offset which will be added to the base address later. - __ mov(entry_offset, Operand(entry - base)); - - if (table_entry->needs_frame) { - DCHECK(!info()->saves_caller_doubles()); - Comment(";;; call deopt with frame"); - __ PushFixedFrame(); - __ b(&needs_frame, SetLK); - } else { - __ b(&call_deopt_entry, SetLK); - } - info()->LogDeoptCallPosition(masm()->pc_offset(), - table_entry->deopt_info.inlining_id); - } - - if (needs_frame.is_linked()) { - __ bind(&needs_frame); - // This variant of deopt can only be used with stubs. Since we don't - // have a function pointer to install in the stack frame that we're - // building, install a special marker there instead. - DCHECK(info()->IsStub()); - __ LoadSmiLiteral(ip, Smi::FromInt(StackFrame::STUB)); - __ push(ip); - __ addi(fp, sp, Operand(StandardFrameConstants::kFixedFrameSizeFromFp)); - } - - Comment(";;; call deopt"); - __ bind(&call_deopt_entry); - - if (info()->saves_caller_doubles()) { - DCHECK(info()->IsStub()); - RestoreCallerDoubles(); - } - - // Add the base address to the offset previously loaded in entry_offset. - __ mov(ip, Operand(ExternalReference::ForDeoptEntry(base))); - __ add(ip, entry_offset, ip); - __ Jump(ip); - } - - // The deoptimization jump table is the last part of the instruction - // sequence. Mark the generated code as done unless we bailed out. - if (!is_aborted()) status_ = DONE; - return !is_aborted(); -} - - -bool LCodeGen::GenerateSafepointTable() { - DCHECK(is_done()); - safepoints_.Emit(masm(), GetStackSlotCount()); - return !is_aborted(); -} - - -Register LCodeGen::ToRegister(int index) const { - return Register::FromAllocationIndex(index); -} - - -DoubleRegister LCodeGen::ToDoubleRegister(int index) const { - return DoubleRegister::FromAllocationIndex(index); -} - - -Register LCodeGen::ToRegister(LOperand* op) const { - DCHECK(op->IsRegister()); - return ToRegister(op->index()); -} - - -Register LCodeGen::EmitLoadRegister(LOperand* op, Register scratch) { - if (op->IsRegister()) { - return ToRegister(op->index()); - } else if (op->IsConstantOperand()) { - LConstantOperand* const_op = LConstantOperand::cast(op); - HConstant* constant = chunk_->LookupConstant(const_op); - Handle<Object> literal = constant->handle(isolate()); - Representation r = chunk_->LookupLiteralRepresentation(const_op); - if (r.IsInteger32()) { - AllowDeferredHandleDereference get_number; - DCHECK(literal->IsNumber()); - __ LoadIntLiteral(scratch, static_cast<int32_t>(literal->Number())); - } else if (r.IsDouble()) { - Abort(kEmitLoadRegisterUnsupportedDoubleImmediate); - } else { - DCHECK(r.IsSmiOrTagged()); - __ Move(scratch, literal); - } - return scratch; - } else if (op->IsStackSlot()) { - __ LoadP(scratch, ToMemOperand(op)); - return scratch; - } - UNREACHABLE(); - return scratch; -} - - -void LCodeGen::EmitLoadIntegerConstant(LConstantOperand* const_op, - Register dst) { - DCHECK(IsInteger32(const_op)); - HConstant* constant = chunk_->LookupConstant(const_op); - int32_t value = constant->Integer32Value(); - if (IsSmi(const_op)) { - __ LoadSmiLiteral(dst, Smi::FromInt(value)); - } else { - __ LoadIntLiteral(dst, value); - } -} - - -DoubleRegister LCodeGen::ToDoubleRegister(LOperand* op) const { - DCHECK(op->IsDoubleRegister()); - return ToDoubleRegister(op->index()); -} - - -Handle<Object> LCodeGen::ToHandle(LConstantOperand* op) const { - HConstant* constant = chunk_->LookupConstant(op); - DCHECK(chunk_->LookupLiteralRepresentation(op).IsSmiOrTagged()); - return constant->handle(isolate()); -} - - -bool LCodeGen::IsInteger32(LConstantOperand* op) const { - return chunk_->LookupLiteralRepresentation(op).IsSmiOrInteger32(); -} - - -bool LCodeGen::IsSmi(LConstantOperand* op) const { - return chunk_->LookupLiteralRepresentation(op).IsSmi(); -} - - -int32_t LCodeGen::ToInteger32(LConstantOperand* op) const { - return ToRepresentation(op, Representation::Integer32()); -} - - -intptr_t LCodeGen::ToRepresentation(LConstantOperand* op, - const Representation& r) const { - HConstant* constant = chunk_->LookupConstant(op); - int32_t value = constant->Integer32Value(); - if (r.IsInteger32()) return value; - DCHECK(r.IsSmiOrTagged()); - return reinterpret_cast<intptr_t>(Smi::FromInt(value)); -} - - -Smi* LCodeGen::ToSmi(LConstantOperand* op) const { - HConstant* constant = chunk_->LookupConstant(op); - return Smi::FromInt(constant->Integer32Value()); -} - - -double LCodeGen::ToDouble(LConstantOperand* op) const { - HConstant* constant = chunk_->LookupConstant(op); - DCHECK(constant->HasDoubleValue()); - return constant->DoubleValue(); -} - - -Operand LCodeGen::ToOperand(LOperand* op) { - if (op->IsConstantOperand()) { - LConstantOperand* const_op = LConstantOperand::cast(op); - HConstant* constant = chunk()->LookupConstant(const_op); - Representation r = chunk_->LookupLiteralRepresentation(const_op); - if (r.IsSmi()) { - DCHECK(constant->HasSmiValue()); - return Operand(Smi::FromInt(constant->Integer32Value())); - } else if (r.IsInteger32()) { - DCHECK(constant->HasInteger32Value()); - return Operand(constant->Integer32Value()); - } else if (r.IsDouble()) { - Abort(kToOperandUnsupportedDoubleImmediate); - } - DCHECK(r.IsTagged()); - return Operand(constant->handle(isolate())); - } else if (op->IsRegister()) { - return Operand(ToRegister(op)); - } else if (op->IsDoubleRegister()) { - Abort(kToOperandIsDoubleRegisterUnimplemented); - return Operand::Zero(); - } - // Stack slots not implemented, use ToMemOperand instead. - UNREACHABLE(); - return Operand::Zero(); -} - - -static int ArgumentsOffsetWithoutFrame(int index) { - DCHECK(index < 0); - return -(index + 1) * kPointerSize; -} - - -MemOperand LCodeGen::ToMemOperand(LOperand* op) const { - DCHECK(!op->IsRegister()); - DCHECK(!op->IsDoubleRegister()); - DCHECK(op->IsStackSlot() || op->IsDoubleStackSlot()); - if (NeedsEagerFrame()) { - return MemOperand(fp, StackSlotOffset(op->index())); - } else { - // Retrieve parameter without eager stack-frame relative to the - // stack-pointer. - return MemOperand(sp, ArgumentsOffsetWithoutFrame(op->index())); - } -} - - -MemOperand LCodeGen::ToHighMemOperand(LOperand* op) const { - DCHECK(op->IsDoubleStackSlot()); - if (NeedsEagerFrame()) { - return MemOperand(fp, StackSlotOffset(op->index()) + kPointerSize); - } else { - // Retrieve parameter without eager stack-frame relative to the - // stack-pointer. - return MemOperand(sp, - ArgumentsOffsetWithoutFrame(op->index()) + kPointerSize); - } -} - - -void LCodeGen::WriteTranslation(LEnvironment* environment, - Translation* translation) { - if (environment == NULL) return; - - // The translation includes one command per value in the environment. - int translation_size = environment->translation_size(); - - WriteTranslation(environment->outer(), translation); - WriteTranslationFrame(environment, translation); - - int object_index = 0; - int dematerialized_index = 0; - for (int i = 0; i < translation_size; ++i) { - LOperand* value = environment->values()->at(i); - AddToTranslation( - environment, translation, value, environment->HasTaggedValueAt(i), - environment->HasUint32ValueAt(i), &object_index, &dematerialized_index); - } -} - - -void LCodeGen::AddToTranslation(LEnvironment* environment, - Translation* translation, LOperand* op, - bool is_tagged, bool is_uint32, - int* object_index_pointer, - int* dematerialized_index_pointer) { - if (op == LEnvironment::materialization_marker()) { - int object_index = (*object_index_pointer)++; - if (environment->ObjectIsDuplicateAt(object_index)) { - int dupe_of = environment->ObjectDuplicateOfAt(object_index); - translation->DuplicateObject(dupe_of); - return; - } - int object_length = environment->ObjectLengthAt(object_index); - if (environment->ObjectIsArgumentsAt(object_index)) { - translation->BeginArgumentsObject(object_length); - } else { - translation->BeginCapturedObject(object_length); - } - int dematerialized_index = *dematerialized_index_pointer; - int env_offset = environment->translation_size() + dematerialized_index; - *dematerialized_index_pointer += object_length; - for (int i = 0; i < object_length; ++i) { - LOperand* value = environment->values()->at(env_offset + i); - AddToTranslation(environment, translation, value, - environment->HasTaggedValueAt(env_offset + i), - environment->HasUint32ValueAt(env_offset + i), - object_index_pointer, dematerialized_index_pointer); - } - return; - } - - if (op->IsStackSlot()) { - int index = op->index(); - if (index >= 0) { - index += StandardFrameConstants::kFixedFrameSize / kPointerSize; - } - if (is_tagged) { - translation->StoreStackSlot(index); - } else if (is_uint32) { - translation->StoreUint32StackSlot(index); - } else { - translation->StoreInt32StackSlot(index); - } - } else if (op->IsDoubleStackSlot()) { - int index = op->index(); - if (index >= 0) { - index += StandardFrameConstants::kFixedFrameSize / kPointerSize; - } - translation->StoreDoubleStackSlot(index); - } else if (op->IsRegister()) { - Register reg = ToRegister(op); - if (is_tagged) { - translation->StoreRegister(reg); - } else if (is_uint32) { - translation->StoreUint32Register(reg); - } else { - translation->StoreInt32Register(reg); - } - } else if (op->IsDoubleRegister()) { - DoubleRegister reg = ToDoubleRegister(op); - translation->StoreDoubleRegister(reg); - } else if (op->IsConstantOperand()) { - HConstant* constant = chunk()->LookupConstant(LConstantOperand::cast(op)); - int src_index = DefineDeoptimizationLiteral(constant->handle(isolate())); - translation->StoreLiteral(src_index); - } else { - UNREACHABLE(); - } -} - - -void LCodeGen::CallCode(Handle<Code> code, RelocInfo::Mode mode, - LInstruction* instr) { - CallCodeGeneric(code, mode, instr, RECORD_SIMPLE_SAFEPOINT); -} - - -void LCodeGen::CallCodeGeneric(Handle<Code> code, RelocInfo::Mode mode, - LInstruction* instr, - SafepointMode safepoint_mode) { - DCHECK(instr != NULL); - __ Call(code, mode); - RecordSafepointWithLazyDeopt(instr, safepoint_mode); - - // Signal that we don't inline smi code before these stubs in the - // optimizing code generator. - if (code->kind() == Code::BINARY_OP_IC || code->kind() == Code::COMPARE_IC) { - __ nop(); - } -} - - -void LCodeGen::CallRuntime(const Runtime::Function* function, int num_arguments, - LInstruction* instr, SaveFPRegsMode save_doubles) { - DCHECK(instr != NULL); - - __ CallRuntime(function, num_arguments, save_doubles); - - RecordSafepointWithLazyDeopt(instr, RECORD_SIMPLE_SAFEPOINT); -} - - -void LCodeGen::LoadContextFromDeferred(LOperand* context) { - if (context->IsRegister()) { - __ Move(cp, ToRegister(context)); - } else if (context->IsStackSlot()) { - __ LoadP(cp, ToMemOperand(context)); - } else if (context->IsConstantOperand()) { - HConstant* constant = - chunk_->LookupConstant(LConstantOperand::cast(context)); - __ Move(cp, Handle<Object>::cast(constant->handle(isolate()))); - } else { - UNREACHABLE(); - } -} - - -void LCodeGen::CallRuntimeFromDeferred(Runtime::FunctionId id, int argc, - LInstruction* instr, LOperand* context) { - LoadContextFromDeferred(context); - __ CallRuntimeSaveDoubles(id); - RecordSafepointWithRegisters(instr->pointer_map(), argc, - Safepoint::kNoLazyDeopt); -} - - -void LCodeGen::RegisterEnvironmentForDeoptimization(LEnvironment* environment, - Safepoint::DeoptMode mode) { - environment->set_has_been_used(); - if (!environment->HasBeenRegistered()) { - // Physical stack frame layout: - // -x ............. -4 0 ..................................... y - // [incoming arguments] [spill slots] [pushed outgoing arguments] - - // Layout of the environment: - // 0 ..................................................... size-1 - // [parameters] [locals] [expression stack including arguments] - - // Layout of the translation: - // 0 ........................................................ size - 1 + 4 - // [expression stack including arguments] [locals] [4 words] [parameters] - // |>------------ translation_size ------------<| - - int frame_count = 0; - int jsframe_count = 0; - for (LEnvironment* e = environment; e != NULL; e = e->outer()) { - ++frame_count; - if (e->frame_type() == JS_FUNCTION) { - ++jsframe_count; - } - } - Translation translation(&translations_, frame_count, jsframe_count, zone()); - WriteTranslation(environment, &translation); - int deoptimization_index = deoptimizations_.length(); - int pc_offset = masm()->pc_offset(); - environment->Register(deoptimization_index, translation.index(), - (mode == Safepoint::kLazyDeopt) ? pc_offset : -1); - deoptimizations_.Add(environment, zone()); - } -} - - -void LCodeGen::DeoptimizeIf(Condition cond, LInstruction* instr, - Deoptimizer::DeoptReason deopt_reason, - Deoptimizer::BailoutType bailout_type, - CRegister cr) { - LEnvironment* environment = instr->environment(); - RegisterEnvironmentForDeoptimization(environment, Safepoint::kNoLazyDeopt); - DCHECK(environment->HasBeenRegistered()); - int id = environment->deoptimization_index(); - Address entry = - Deoptimizer::GetDeoptimizationEntry(isolate(), id, bailout_type); - if (entry == NULL) { - Abort(kBailoutWasNotPrepared); - return; - } - - if (FLAG_deopt_every_n_times != 0 && !info()->IsStub()) { - CRegister alt_cr = cr6; - Register scratch = scratch0(); - ExternalReference count = ExternalReference::stress_deopt_count(isolate()); - Label no_deopt; - DCHECK(!alt_cr.is(cr)); - __ Push(r4, scratch); - __ mov(scratch, Operand(count)); - __ lwz(r4, MemOperand(scratch)); - __ subi(r4, r4, Operand(1)); - __ cmpi(r4, Operand::Zero(), alt_cr); - __ bne(&no_deopt, alt_cr); - __ li(r4, Operand(FLAG_deopt_every_n_times)); - __ stw(r4, MemOperand(scratch)); - __ Pop(r4, scratch); - - __ Call(entry, RelocInfo::RUNTIME_ENTRY); - __ bind(&no_deopt); - __ stw(r4, MemOperand(scratch)); - __ Pop(r4, scratch); - } - - if (info()->ShouldTrapOnDeopt()) { - __ stop("trap_on_deopt", cond, kDefaultStopCode, cr); - } - - Deoptimizer::DeoptInfo deopt_info = MakeDeoptInfo(instr, deopt_reason); - - DCHECK(info()->IsStub() || frame_is_built_); - // Go through jump table if we need to handle condition, build frame, or - // restore caller doubles. - if (cond == al && frame_is_built_ && !info()->saves_caller_doubles()) { - DeoptComment(deopt_info); - __ Call(entry, RelocInfo::RUNTIME_ENTRY); - info()->LogDeoptCallPosition(masm()->pc_offset(), deopt_info.inlining_id); - } else { - Deoptimizer::JumpTableEntry table_entry(entry, deopt_info, bailout_type, - !frame_is_built_); - // We often have several deopts to the same entry, reuse the last - // jump entry if this is the case. - if (FLAG_trace_deopt || isolate()->cpu_profiler()->is_profiling() || - jump_table_.is_empty() || - !table_entry.IsEquivalentTo(jump_table_.last())) { - jump_table_.Add(table_entry, zone()); - } - __ b(cond, &jump_table_.last().label, cr); - } -} - - -void LCodeGen::DeoptimizeIf(Condition condition, LInstruction* instr, - Deoptimizer::DeoptReason deopt_reason, - CRegister cr) { - Deoptimizer::BailoutType bailout_type = - info()->IsStub() ? Deoptimizer::LAZY : Deoptimizer::EAGER; - DeoptimizeIf(condition, instr, deopt_reason, bailout_type, cr); -} - - -void LCodeGen::PopulateDeoptimizationData(Handle<Code> code) { - int length = deoptimizations_.length(); - if (length == 0) return; - Handle<DeoptimizationInputData> data = - DeoptimizationInputData::New(isolate(), length, TENURED); - - Handle<ByteArray> translations = - translations_.CreateByteArray(isolate()->factory()); - data->SetTranslationByteArray(*translations); - data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); - data->SetOptimizationId(Smi::FromInt(info_->optimization_id())); - if (info_->IsOptimizing()) { - // Reference to shared function info does not change between phases. - AllowDeferredHandleDereference allow_handle_dereference; - data->SetSharedFunctionInfo(*info_->shared_info()); - } else { - data->SetSharedFunctionInfo(Smi::FromInt(0)); - } - data->SetWeakCellCache(Smi::FromInt(0)); - - Handle<FixedArray> literals = - factory()->NewFixedArray(deoptimization_literals_.length(), TENURED); - { - AllowDeferredHandleDereference copy_handles; - for (int i = 0; i < deoptimization_literals_.length(); i++) { - literals->set(i, *deoptimization_literals_[i]); - } - data->SetLiteralArray(*literals); - } - - data->SetOsrAstId(Smi::FromInt(info_->osr_ast_id().ToInt())); - data->SetOsrPcOffset(Smi::FromInt(osr_pc_offset_)); - - // Populate the deoptimization entries. - for (int i = 0; i < length; i++) { - LEnvironment* env = deoptimizations_[i]; - data->SetAstId(i, env->ast_id()); - data->SetTranslationIndex(i, Smi::FromInt(env->translation_index())); - data->SetArgumentsStackHeight(i, - Smi::FromInt(env->arguments_stack_height())); - data->SetPc(i, Smi::FromInt(env->pc_offset())); - } - code->set_deoptimization_data(*data); -} - - -void LCodeGen::PopulateDeoptimizationLiteralsWithInlinedFunctions() { - DCHECK_EQ(0, deoptimization_literals_.length()); - for (auto function : chunk()->inlined_functions()) { - DefineDeoptimizationLiteral(function); - } - inlined_function_count_ = deoptimization_literals_.length(); -} - - -void LCodeGen::RecordSafepointWithLazyDeopt(LInstruction* instr, - SafepointMode safepoint_mode) { - if (safepoint_mode == RECORD_SIMPLE_SAFEPOINT) { - RecordSafepoint(instr->pointer_map(), Safepoint::kLazyDeopt); - } else { - DCHECK(safepoint_mode == RECORD_SAFEPOINT_WITH_REGISTERS_AND_NO_ARGUMENTS); - RecordSafepointWithRegisters(instr->pointer_map(), 0, - Safepoint::kLazyDeopt); - } -} - - -void LCodeGen::RecordSafepoint(LPointerMap* pointers, Safepoint::Kind kind, - int arguments, Safepoint::DeoptMode deopt_mode) { - DCHECK(expected_safepoint_kind_ == kind); - - const ZoneList<LOperand*>* operands = pointers->GetNormalizedOperands(); - Safepoint safepoint = - safepoints_.DefineSafepoint(masm(), kind, arguments, deopt_mode); - for (int i = 0; i < operands->length(); i++) { - LOperand* pointer = operands->at(i); - if (pointer->IsStackSlot()) { - safepoint.DefinePointerSlot(pointer->index(), zone()); - } else if (pointer->IsRegister() && (kind & Safepoint::kWithRegisters)) { - safepoint.DefinePointerRegister(ToRegister(pointer), zone()); - } - } -} - - -void LCodeGen::RecordSafepoint(LPointerMap* pointers, - Safepoint::DeoptMode deopt_mode) { - RecordSafepoint(pointers, Safepoint::kSimple, 0, deopt_mode); -} - - -void LCodeGen::RecordSafepoint(Safepoint::DeoptMode deopt_mode) { - LPointerMap empty_pointers(zone()); - RecordSafepoint(&empty_pointers, deopt_mode); -} - - -void LCodeGen::RecordSafepointWithRegisters(LPointerMap* pointers, - int arguments, - Safepoint::DeoptMode deopt_mode) { - RecordSafepoint(pointers, Safepoint::kWithRegisters, arguments, deopt_mode); -} - - -void LCodeGen::RecordAndWritePosition(int position) { - if (position == RelocInfo::kNoPosition) return; - masm()->positions_recorder()->RecordPosition(position); - masm()->positions_recorder()->WriteRecordedPositions(); -} - - -static const char* LabelType(LLabel* label) { - if (label->is_loop_header()) return " (loop header)"; - if (label->is_osr_entry()) return " (OSR entry)"; - return ""; -} - - -void LCodeGen::DoLabel(LLabel* label) { - Comment(";;; <@%d,#%d> -------------------- B%d%s --------------------", - current_instruction_, label->hydrogen_value()->id(), - label->block_id(), LabelType(label)); - __ bind(label->label()); - current_block_ = label->block_id(); - DoGap(label); -} - - -void LCodeGen::DoParallelMove(LParallelMove* move) { resolver_.Resolve(move); } - - -void LCodeGen::DoGap(LGap* gap) { - for (int i = LGap::FIRST_INNER_POSITION; i <= LGap::LAST_INNER_POSITION; - i++) { - LGap::InnerPosition inner_pos = static_cast<LGap::InnerPosition>(i); - LParallelMove* move = gap->GetParallelMove(inner_pos); - if (move != NULL) DoParallelMove(move); - } -} - - -void LCodeGen::DoInstructionGap(LInstructionGap* instr) { DoGap(instr); } - - -void LCodeGen::DoParameter(LParameter* instr) { - // Nothing to do. -} - - -void LCodeGen::DoCallStub(LCallStub* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->result()).is(r3)); - switch (instr->hydrogen()->major_key()) { - case CodeStub::RegExpExec: { - RegExpExecStub stub(isolate()); - CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); - break; - } - case CodeStub::SubString: { - SubStringStub stub(isolate()); - CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); - break; - } - default: - UNREACHABLE(); - } -} - - -void LCodeGen::DoUnknownOSRValue(LUnknownOSRValue* instr) { - GenerateOsrPrologue(); -} - - -void LCodeGen::DoModByPowerOf2I(LModByPowerOf2I* instr) { - Register dividend = ToRegister(instr->dividend()); - int32_t divisor = instr->divisor(); - DCHECK(dividend.is(ToRegister(instr->result()))); - - // Theoretically, a variation of the branch-free code for integer division by - // a power of 2 (calculating the remainder via an additional multiplication - // (which gets simplified to an 'and') and subtraction) should be faster, and - // this is exactly what GCC and clang emit. Nevertheless, benchmarks seem to - // indicate that positive dividends are heavily favored, so the branching - // version performs better. - HMod* hmod = instr->hydrogen(); - int32_t shift = WhichPowerOf2Abs(divisor); - Label dividend_is_not_negative, done; - if (hmod->CheckFlag(HValue::kLeftCanBeNegative)) { - __ cmpwi(dividend, Operand::Zero()); - __ bge(÷nd_is_not_negative); - if (shift) { - // Note that this is correct even for kMinInt operands. - __ neg(dividend, dividend); - __ ExtractBitRange(dividend, dividend, shift - 1, 0); - __ neg(dividend, dividend, LeaveOE, SetRC); - if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) { - DeoptimizeIf(eq, instr, Deoptimizer::kMinusZero, cr0); - } - } else if (!hmod->CheckFlag(HValue::kBailoutOnMinusZero)) { - __ li(dividend, Operand::Zero()); - } else { - DeoptimizeIf(al, instr, Deoptimizer::kMinusZero); - } - __ b(&done); - } - - __ bind(÷nd_is_not_negative); - if (shift) { - __ ExtractBitRange(dividend, dividend, shift - 1, 0); - } else { - __ li(dividend, Operand::Zero()); - } - __ bind(&done); -} - - -void LCodeGen::DoModByConstI(LModByConstI* instr) { - Register dividend = ToRegister(instr->dividend()); - int32_t divisor = instr->divisor(); - Register result = ToRegister(instr->result()); - DCHECK(!dividend.is(result)); - - if (divisor == 0) { - DeoptimizeIf(al, instr, Deoptimizer::kDivisionByZero); - return; - } - - __ TruncatingDiv(result, dividend, Abs(divisor)); - __ mov(ip, Operand(Abs(divisor))); - __ mullw(result, result, ip); - __ sub(result, dividend, result, LeaveOE, SetRC); - - // Check for negative zero. - HMod* hmod = instr->hydrogen(); - if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) { - Label remainder_not_zero; - __ bne(&remainder_not_zero, cr0); - __ cmpwi(dividend, Operand::Zero()); - DeoptimizeIf(lt, instr, Deoptimizer::kMinusZero); - __ bind(&remainder_not_zero); - } -} - - -void LCodeGen::DoModI(LModI* instr) { - HMod* hmod = instr->hydrogen(); - Register left_reg = ToRegister(instr->left()); - Register right_reg = ToRegister(instr->right()); - Register result_reg = ToRegister(instr->result()); - Register scratch = scratch0(); - bool can_overflow = hmod->CheckFlag(HValue::kCanOverflow); - Label done; - - if (can_overflow) { - __ li(r0, Operand::Zero()); // clear xer - __ mtxer(r0); - } - - __ divw(scratch, left_reg, right_reg, SetOE, SetRC); - - // Check for x % 0. - if (hmod->CheckFlag(HValue::kCanBeDivByZero)) { - __ cmpwi(right_reg, Operand::Zero()); - DeoptimizeIf(eq, instr, Deoptimizer::kDivisionByZero); - } - - // Check for kMinInt % -1, divw will return undefined, which is not what we - // want. We have to deopt if we care about -0, because we can't return that. - if (can_overflow) { - if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) { - DeoptimizeIf(overflow, instr, Deoptimizer::kMinusZero, cr0); - } else { - if (CpuFeatures::IsSupported(ISELECT)) { - __ isel(overflow, result_reg, r0, result_reg, cr0); - __ boverflow(&done, cr0); - } else { - Label no_overflow_possible; - __ bnooverflow(&no_overflow_possible, cr0); - __ li(result_reg, Operand::Zero()); - __ b(&done); - __ bind(&no_overflow_possible); - } - } - } - - __ mullw(scratch, right_reg, scratch); - __ sub(result_reg, left_reg, scratch, LeaveOE, SetRC); - - // If we care about -0, test if the dividend is <0 and the result is 0. - if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) { - __ bne(&done, cr0); - __ cmpwi(left_reg, Operand::Zero()); - DeoptimizeIf(lt, instr, Deoptimizer::kMinusZero); - } - - __ bind(&done); -} - - -void LCodeGen::DoDivByPowerOf2I(LDivByPowerOf2I* instr) { - Register dividend = ToRegister(instr->dividend()); - int32_t divisor = instr->divisor(); - Register result = ToRegister(instr->result()); - DCHECK(divisor == kMinInt || base::bits::IsPowerOfTwo32(Abs(divisor))); - DCHECK(!result.is(dividend)); - - // Check for (0 / -x) that will produce negative zero. - HDiv* hdiv = instr->hydrogen(); - if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) { - __ cmpwi(dividend, Operand::Zero()); - DeoptimizeIf(eq, instr, Deoptimizer::kMinusZero); - } - // Check for (kMinInt / -1). - if (hdiv->CheckFlag(HValue::kCanOverflow) && divisor == -1) { - __ lis(r0, Operand(SIGN_EXT_IMM16(0x8000))); - __ cmpw(dividend, r0); - DeoptimizeIf(eq, instr, Deoptimizer::kOverflow); - } - - int32_t shift = WhichPowerOf2Abs(divisor); - - // Deoptimize if remainder will not be 0. - if (!hdiv->CheckFlag(HInstruction::kAllUsesTruncatingToInt32) && shift) { - __ TestBitRange(dividend, shift - 1, 0, r0); - DeoptimizeIf(ne, instr, Deoptimizer::kLostPrecision, cr0); - } - - if (divisor == -1) { // Nice shortcut, not needed for correctness. - __ neg(result, dividend); - return; - } - if (shift == 0) { - __ mr(result, dividend); - } else { - if (shift == 1) { - __ srwi(result, dividend, Operand(31)); - } else { - __ srawi(result, dividend, 31); - __ srwi(result, result, Operand(32 - shift)); - } - __ add(result, dividend, result); - __ srawi(result, result, shift); - } - if (divisor < 0) __ neg(result, result); -} - - -void LCodeGen::DoDivByConstI(LDivByConstI* instr) { - Register dividend = ToRegister(instr->dividend()); - int32_t divisor = instr->divisor(); - Register result = ToRegister(instr->result()); - DCHECK(!dividend.is(result)); - - if (divisor == 0) { - DeoptimizeIf(al, instr, Deoptimizer::kDivisionByZero); - return; - } - - // Check for (0 / -x) that will produce negative zero. - HDiv* hdiv = instr->hydrogen(); - if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) { - __ cmpwi(dividend, Operand::Zero()); - DeoptimizeIf(eq, instr, Deoptimizer::kMinusZero); - } - - __ TruncatingDiv(result, dividend, Abs(divisor)); - if (divisor < 0) __ neg(result, result); - - if (!hdiv->CheckFlag(HInstruction::kAllUsesTruncatingToInt32)) { - Register scratch = scratch0(); - __ mov(ip, Operand(divisor)); - __ mullw(scratch, result, ip); - __ cmpw(scratch, dividend); - DeoptimizeIf(ne, instr, Deoptimizer::kLostPrecision); - } -} - - -// TODO(svenpanne) Refactor this to avoid code duplication with DoFlooringDivI. -void LCodeGen::DoDivI(LDivI* instr) { - HBinaryOperation* hdiv = instr->hydrogen(); - const Register dividend = ToRegister(instr->dividend()); - const Register divisor = ToRegister(instr->divisor()); - Register result = ToRegister(instr->result()); - bool can_overflow = hdiv->CheckFlag(HValue::kCanOverflow); - - DCHECK(!dividend.is(result)); - DCHECK(!divisor.is(result)); - - if (can_overflow) { - __ li(r0, Operand::Zero()); // clear xer - __ mtxer(r0); - } - - __ divw(result, dividend, divisor, SetOE, SetRC); - - // Check for x / 0. - if (hdiv->CheckFlag(HValue::kCanBeDivByZero)) { - __ cmpwi(divisor, Operand::Zero()); - DeoptimizeIf(eq, instr, Deoptimizer::kDivisionByZero); - } - - // Check for (0 / -x) that will produce negative zero. - if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero)) { - Label dividend_not_zero; - __ cmpwi(dividend, Operand::Zero()); - __ bne(÷nd_not_zero); - __ cmpwi(divisor, Operand::Zero()); - DeoptimizeIf(lt, instr, Deoptimizer::kMinusZero); - __ bind(÷nd_not_zero); - } - - // Check for (kMinInt / -1). - if (can_overflow) { - if (!hdiv->CheckFlag(HValue::kAllUsesTruncatingToInt32)) { - DeoptimizeIf(overflow, instr, Deoptimizer::kOverflow, cr0); - } else { - // When truncating, we want kMinInt / -1 = kMinInt. - if (CpuFeatures::IsSupported(ISELECT)) { - __ isel(overflow, result, dividend, result, cr0); - } else { - Label no_overflow_possible; - __ bnooverflow(&no_overflow_possible, cr0); - __ mr(result, dividend); - __ bind(&no_overflow_possible); - } - } - } - - if (!hdiv->CheckFlag(HInstruction::kAllUsesTruncatingToInt32)) { - // Deoptimize if remainder is not 0. - Register scratch = scratch0(); - __ mullw(scratch, divisor, result); - __ cmpw(dividend, scratch); - DeoptimizeIf(ne, instr, Deoptimizer::kLostPrecision); - } -} - - -void LCodeGen::DoFlooringDivByPowerOf2I(LFlooringDivByPowerOf2I* instr) { - HBinaryOperation* hdiv = instr->hydrogen(); - Register dividend = ToRegister(instr->dividend()); - Register result = ToRegister(instr->result()); - int32_t divisor = instr->divisor(); - bool can_overflow = hdiv->CheckFlag(HValue::kLeftCanBeMinInt); - - // If the divisor is positive, things are easy: There can be no deopts and we - // can simply do an arithmetic right shift. - int32_t shift = WhichPowerOf2Abs(divisor); - if (divisor > 0) { - if (shift || !result.is(dividend)) { - __ srawi(result, dividend, shift); - } - return; - } - - // If the divisor is negative, we have to negate and handle edge cases. - OEBit oe = LeaveOE; -#if V8_TARGET_ARCH_PPC64 - if (divisor == -1 && can_overflow) { - __ lis(r0, Operand(SIGN_EXT_IMM16(0x8000))); - __ cmpw(dividend, r0); - DeoptimizeIf(eq, instr, Deoptimizer::kOverflow); - } -#else - if (can_overflow) { - __ li(r0, Operand::Zero()); // clear xer - __ mtxer(r0); - oe = SetOE; - } -#endif - - __ neg(result, dividend, oe, SetRC); - if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero)) { - DeoptimizeIf(eq, instr, Deoptimizer::kMinusZero, cr0); - } - -// If the negation could not overflow, simply shifting is OK. -#if !V8_TARGET_ARCH_PPC64 - if (!can_overflow) { -#endif - if (shift) { - __ ShiftRightArithImm(result, result, shift); - } - return; -#if !V8_TARGET_ARCH_PPC64 - } - - // Dividing by -1 is basically negation, unless we overflow. - if (divisor == -1) { - DeoptimizeIf(overflow, instr, Deoptimizer::kOverflow, cr0); - return; - } - - Label overflow, done; - __ boverflow(&overflow, cr0); - __ srawi(result, result, shift); - __ b(&done); - __ bind(&overflow); - __ mov(result, Operand(kMinInt / divisor)); - __ bind(&done); -#endif -} - - -void LCodeGen::DoFlooringDivByConstI(LFlooringDivByConstI* instr) { - Register dividend = ToRegister(instr->dividend()); - int32_t divisor = instr->divisor(); - Register result = ToRegister(instr->result()); - DCHECK(!dividend.is(result)); - - if (divisor == 0) { - DeoptimizeIf(al, instr, Deoptimizer::kDivisionByZero); - return; - } - - // Check for (0 / -x) that will produce negative zero. - HMathFloorOfDiv* hdiv = instr->hydrogen(); - if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) { - __ cmpwi(dividend, Operand::Zero()); - DeoptimizeIf(eq, instr, Deoptimizer::kMinusZero); - } - - // Easy case: We need no dynamic check for the dividend and the flooring - // division is the same as the truncating division. - if ((divisor > 0 && !hdiv->CheckFlag(HValue::kLeftCanBeNegative)) || - (divisor < 0 && !hdiv->CheckFlag(HValue::kLeftCanBePositive))) { - __ TruncatingDiv(result, dividend, Abs(divisor)); - if (divisor < 0) __ neg(result, result); - return; - } - - // In the general case we may need to adjust before and after the truncating - // division to get a flooring division. - Register temp = ToRegister(instr->temp()); - DCHECK(!temp.is(dividend) && !temp.is(result)); - Label needs_adjustment, done; - __ cmpwi(dividend, Operand::Zero()); - __ b(divisor > 0 ? lt : gt, &needs_adjustment); - __ TruncatingDiv(result, dividend, Abs(divisor)); - if (divisor < 0) __ neg(result, result); - __ b(&done); - __ bind(&needs_adjustment); - __ addi(temp, dividend, Operand(divisor > 0 ? 1 : -1)); - __ TruncatingDiv(result, temp, Abs(divisor)); - if (divisor < 0) __ neg(result, result); - __ subi(result, result, Operand(1)); - __ bind(&done); -} - - -// TODO(svenpanne) Refactor this to avoid code duplication with DoDivI. -void LCodeGen::DoFlooringDivI(LFlooringDivI* instr) { - HBinaryOperation* hdiv = instr->hydrogen(); - const Register dividend = ToRegister(instr->dividend()); - const Register divisor = ToRegister(instr->divisor()); - Register result = ToRegister(instr->result()); - bool can_overflow = hdiv->CheckFlag(HValue::kCanOverflow); - - DCHECK(!dividend.is(result)); - DCHECK(!divisor.is(result)); - - if (can_overflow) { - __ li(r0, Operand::Zero()); // clear xer - __ mtxer(r0); - } - - __ divw(result, dividend, divisor, SetOE, SetRC); - - // Check for x / 0. - if (hdiv->CheckFlag(HValue::kCanBeDivByZero)) { - __ cmpwi(divisor, Operand::Zero()); - DeoptimizeIf(eq, instr, Deoptimizer::kDivisionByZero); - } - - // Check for (0 / -x) that will produce negative zero. - if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero)) { - Label dividend_not_zero; - __ cmpwi(dividend, Operand::Zero()); - __ bne(÷nd_not_zero); - __ cmpwi(divisor, Operand::Zero()); - DeoptimizeIf(lt, instr, Deoptimizer::kMinusZero); - __ bind(÷nd_not_zero); - } - - // Check for (kMinInt / -1). - if (can_overflow) { - if (!hdiv->CheckFlag(HValue::kAllUsesTruncatingToInt32)) { - DeoptimizeIf(overflow, instr, Deoptimizer::kOverflow, cr0); - } else { - // When truncating, we want kMinInt / -1 = kMinInt. - if (CpuFeatures::IsSupported(ISELECT)) { - __ isel(overflow, result, dividend, result, cr0); - } else { - Label no_overflow_possible; - __ bnooverflow(&no_overflow_possible, cr0); - __ mr(result, dividend); - __ bind(&no_overflow_possible); - } - } - } - - Label done; - Register scratch = scratch0(); -// If both operands have the same sign then we are done. -#if V8_TARGET_ARCH_PPC64 - __ xor_(scratch, dividend, divisor); - __ cmpwi(scratch, Operand::Zero()); - __ bge(&done); -#else - __ xor_(scratch, dividend, divisor, SetRC); - __ bge(&done, cr0); -#endif - - // If there is no remainder then we are done. - __ mullw(scratch, divisor, result); - __ cmpw(dividend, scratch); - __ beq(&done); - - // We performed a truncating division. Correct the result. - __ subi(result, result, Operand(1)); - __ bind(&done); -} - - -void LCodeGen::DoMultiplyAddD(LMultiplyAddD* instr) { - DoubleRegister addend = ToDoubleRegister(instr->addend()); - DoubleRegister multiplier = ToDoubleRegister(instr->multiplier()); - DoubleRegister multiplicand = ToDoubleRegister(instr->multiplicand()); - DoubleRegister result = ToDoubleRegister(instr->result()); - - __ fmadd(result, multiplier, multiplicand, addend); -} - - -void LCodeGen::DoMultiplySubD(LMultiplySubD* instr) { - DoubleRegister minuend = ToDoubleRegister(instr->minuend()); - DoubleRegister multiplier = ToDoubleRegister(instr->multiplier()); - DoubleRegister multiplicand = ToDoubleRegister(instr->multiplicand()); - DoubleRegister result = ToDoubleRegister(instr->result()); - - __ fmsub(result, multiplier, multiplicand, minuend); -} - - -void LCodeGen::DoMulI(LMulI* instr) { - Register scratch = scratch0(); - Register result = ToRegister(instr->result()); - // Note that result may alias left. - Register left = ToRegister(instr->left()); - LOperand* right_op = instr->right(); - - bool bailout_on_minus_zero = - instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero); - bool can_overflow = instr->hydrogen()->CheckFlag(HValue::kCanOverflow); - - if (right_op->IsConstantOperand()) { - int32_t constant = ToInteger32(LConstantOperand::cast(right_op)); - - if (bailout_on_minus_zero && (constant < 0)) { - // The case of a null constant will be handled separately. - // If constant is negative and left is null, the result should be -0. - __ cmpi(left, Operand::Zero()); - DeoptimizeIf(eq, instr, Deoptimizer::kMinusZero); - } - - switch (constant) { - case -1: - if (can_overflow) { -#if V8_TARGET_ARCH_PPC64 - if (instr->hydrogen()->representation().IsSmi()) { -#endif - __ li(r0, Operand::Zero()); // clear xer - __ mtxer(r0); - __ neg(result, left, SetOE, SetRC); - DeoptimizeIf(overflow, instr, Deoptimizer::kOverflow, cr0); -#if V8_TARGET_ARCH_PPC64 - } else { - __ neg(result, left); - __ TestIfInt32(result, r0); - DeoptimizeIf(ne, instr, Deoptimizer::kOverflow); - } -#endif - } else { - __ neg(result, left); - } - break; - case 0: - if (bailout_on_minus_zero) { -// If left is strictly negative and the constant is null, the -// result is -0. Deoptimize if required, otherwise return 0. -#if V8_TARGET_ARCH_PPC64 - if (instr->hydrogen()->representation().IsSmi()) { -#endif - __ cmpi(left, Operand::Zero()); -#if V8_TARGET_ARCH_PPC64 - } else { - __ cmpwi(left, Operand::Zero()); - } -#endif - DeoptimizeIf(lt, instr, Deoptimizer::kMinusZero); - } - __ li(result, Operand::Zero()); - break; - case 1: - __ Move(result, left); - break; - default: - // Multiplying by powers of two and powers of two plus or minus - // one can be done faster with shifted operands. - // For other constants we emit standard code. - int32_t mask = constant >> 31; - uint32_t constant_abs = (constant + mask) ^ mask; - - if (base::bits::IsPowerOfTwo32(constant_abs)) { - int32_t shift = WhichPowerOf2(constant_abs); - __ ShiftLeftImm(result, left, Operand(shift)); - // Correct the sign of the result if the constant is negative. - if (constant < 0) __ neg(result, result); - } else if (base::bits::IsPowerOfTwo32(constant_abs - 1)) { - int32_t shift = WhichPowerOf2(constant_abs - 1); - __ ShiftLeftImm(scratch, left, Operand(shift)); - __ add(result, scratch, left); - // Correct the sign of the result if the constant is negative. - if (constant < 0) __ neg(result, result); - } else if (base::bits::IsPowerOfTwo32(constant_abs + 1)) { - int32_t shift = WhichPowerOf2(constant_abs + 1); - __ ShiftLeftImm(scratch, left, Operand(shift)); - __ sub(result, scratch, left); - // Correct the sign of the result if the constant is negative. - if (constant < 0) __ neg(result, result); - } else { - // Generate standard code. - __ mov(ip, Operand(constant)); - __ Mul(result, left, ip); - } - } - - } else { - DCHECK(right_op->IsRegister()); - Register right = ToRegister(right_op); - - if (can_overflow) { -#if V8_TARGET_ARCH_PPC64 - // result = left * right. - if (instr->hydrogen()->representation().IsSmi()) { - __ SmiUntag(result, left); - __ SmiUntag(scratch, right); - __ Mul(result, result, scratch); - } else { - __ Mul(result, left, right); - } - __ TestIfInt32(result, r0); - DeoptimizeIf(ne, instr, Deoptimizer::kOverflow); - if (instr->hydrogen()->representation().IsSmi()) { - __ SmiTag(result); - } -#else - // scratch:result = left * right. - if (instr->hydrogen()->representation().IsSmi()) { - __ SmiUntag(result, left); - __ mulhw(scratch, result, right); - __ mullw(result, result, right); - } else { - __ mulhw(scratch, left, right); - __ mullw(result, left, right); - } - __ TestIfInt32(scratch, result, r0); - DeoptimizeIf(ne, instr, Deoptimizer::kOverflow); -#endif - } else { - if (instr->hydrogen()->representation().IsSmi()) { - __ SmiUntag(result, left); - __ Mul(result, result, right); - } else { - __ Mul(result, left, right); - } - } - - if (bailout_on_minus_zero) { - Label done; -#if V8_TARGET_ARCH_PPC64 - if (instr->hydrogen()->representation().IsSmi()) { -#endif - __ xor_(r0, left, right, SetRC); - __ bge(&done, cr0); -#if V8_TARGET_ARCH_PPC64 - } else { - __ xor_(r0, left, right); - __ cmpwi(r0, Operand::Zero()); - __ bge(&done); - } -#endif - // Bail out if the result is minus zero. - __ cmpi(result, Operand::Zero()); - DeoptimizeIf(eq, instr, Deoptimizer::kMinusZero); - __ bind(&done); - } - } -} - - -void LCodeGen::DoBitI(LBitI* instr) { - LOperand* left_op = instr->left(); - LOperand* right_op = instr->right(); - DCHECK(left_op->IsRegister()); - Register left = ToRegister(left_op); - Register result = ToRegister(instr->result()); - Operand right(no_reg); - - if (right_op->IsStackSlot()) { - right = Operand(EmitLoadRegister(right_op, ip)); - } else { - DCHECK(right_op->IsRegister() || right_op->IsConstantOperand()); - right = ToOperand(right_op); - - if (right_op->IsConstantOperand() && is_uint16(right.immediate())) { - switch (instr->op()) { - case Token::BIT_AND: - __ andi(result, left, right); - break; - case Token::BIT_OR: - __ ori(result, left, right); - break; - case Token::BIT_XOR: - __ xori(result, left, right); - break; - default: - UNREACHABLE(); - break; - } - return; - } - } - - switch (instr->op()) { - case Token::BIT_AND: - __ And(result, left, right); - break; - case Token::BIT_OR: - __ Or(result, left, right); - break; - case Token::BIT_XOR: - if (right_op->IsConstantOperand() && right.immediate() == int32_t(~0)) { - __ notx(result, left); - } else { - __ Xor(result, left, right); - } - break; - default: - UNREACHABLE(); - break; - } -} - - -void LCodeGen::DoShiftI(LShiftI* instr) { - // Both 'left' and 'right' are "used at start" (see LCodeGen::DoShift), so - // result may alias either of them. - LOperand* right_op = instr->right(); - Register left = ToRegister(instr->left()); - Register result = ToRegister(instr->result()); - Register scratch = scratch0(); - if (right_op->IsRegister()) { - // Mask the right_op operand. - __ andi(scratch, ToRegister(right_op), Operand(0x1F)); - switch (instr->op()) { - case Token::ROR: - // rotate_right(a, b) == rotate_left(a, 32 - b) - __ subfic(scratch, scratch, Operand(32)); - __ rotlw(result, left, scratch); - break; - case Token::SAR: - __ sraw(result, left, scratch); - break; - case Token::SHR: - if (instr->can_deopt()) { - __ srw(result, left, scratch, SetRC); -#if V8_TARGET_ARCH_PPC64 - __ extsw(result, result, SetRC); -#endif - DeoptimizeIf(lt, instr, Deoptimizer::kNegativeValue, cr0); - } else { - __ srw(result, left, scratch); - } - break; - case Token::SHL: - __ slw(result, left, scratch); -#if V8_TARGET_ARCH_PPC64 - __ extsw(result, result); -#endif - break; - default: - UNREACHABLE(); - break; - } - } else { - // Mask the right_op operand. - int value = ToInteger32(LConstantOperand::cast(right_op)); - uint8_t shift_count = static_cast<uint8_t>(value & 0x1F); - switch (instr->op()) { - case Token::ROR: - if (shift_count != 0) { - __ rotrwi(result, left, shift_count); - } else { - __ Move(result, left); - } - break; - case Token::SAR: - if (shift_count != 0) { - __ srawi(result, left, shift_count); - } else { - __ Move(result, left); - } - break; - case Token::SHR: - if (shift_count != 0) { - __ srwi(result, left, Operand(shift_count)); - } else { - if (instr->can_deopt()) { - __ cmpwi(left, Operand::Zero()); - DeoptimizeIf(lt, instr, Deoptimizer::kNegativeValue); - } - __ Move(result, left); - } - break; - case Token::SHL: - if (shift_count != 0) { -#if V8_TARGET_ARCH_PPC64 - if (instr->hydrogen_value()->representation().IsSmi()) { - __ sldi(result, left, Operand(shift_count)); -#else - if (instr->hydrogen_value()->representation().IsSmi() && - instr->can_deopt()) { - if (shift_count != 1) { - __ slwi(result, left, Operand(shift_count - 1)); - __ SmiTagCheckOverflow(result, result, scratch); - } else { - __ SmiTagCheckOverflow(result, left, scratch); - } - DeoptimizeIf(lt, instr, Deoptimizer::kOverflow, cr0); -#endif - } else { - __ slwi(result, left, Operand(shift_count)); -#if V8_TARGET_ARCH_PPC64 - __ extsw(result, result); -#endif - } - } else { - __ Move(result, left); - } - break; - default: - UNREACHABLE(); - break; - } - } -} - - -void LCodeGen::DoSubI(LSubI* instr) { - LOperand* right = instr->right(); - Register left = ToRegister(instr->left()); - Register result = ToRegister(instr->result()); - bool can_overflow = instr->hydrogen()->CheckFlag(HValue::kCanOverflow); -#if V8_TARGET_ARCH_PPC64 - const bool isInteger = !instr->hydrogen()->representation().IsSmi(); -#else - const bool isInteger = false; -#endif - if (!can_overflow || isInteger) { - if (right->IsConstantOperand()) { - __ Add(result, left, -(ToOperand(right).immediate()), r0); - } else { - __ sub(result, left, EmitLoadRegister(right, ip)); - } -#if V8_TARGET_ARCH_PPC64 - if (can_overflow) { - __ TestIfInt32(result, r0); - DeoptimizeIf(ne, instr, Deoptimizer::kOverflow); - } -#endif - } else { - if (right->IsConstantOperand()) { - __ AddAndCheckForOverflow(result, left, -(ToOperand(right).immediate()), - scratch0(), r0); - } else { - __ SubAndCheckForOverflow(result, left, EmitLoadRegister(right, ip), - scratch0(), r0); - } - DeoptimizeIf(lt, instr, Deoptimizer::kOverflow, cr0); - } -} - - -void LCodeGen::DoRSubI(LRSubI* instr) { - LOperand* left = instr->left(); - LOperand* right = instr->right(); - LOperand* result = instr->result(); - - DCHECK(!instr->hydrogen()->CheckFlag(HValue::kCanOverflow) && - right->IsConstantOperand()); - - Operand right_operand = ToOperand(right); - if (is_int16(right_operand.immediate())) { - __ subfic(ToRegister(result), ToRegister(left), right_operand); - } else { - __ mov(r0, right_operand); - __ sub(ToRegister(result), r0, ToRegister(left)); - } -} - - -void LCodeGen::DoConstantI(LConstantI* instr) { - __ mov(ToRegister(instr->result()), Operand(instr->value())); -} - - -void LCodeGen::DoConstantS(LConstantS* instr) { - __ LoadSmiLiteral(ToRegister(instr->result()), instr->value()); -} - - -void LCodeGen::DoConstantD(LConstantD* instr) { - DCHECK(instr->result()->IsDoubleRegister()); - DoubleRegister result = ToDoubleRegister(instr->result()); -#if V8_HOST_ARCH_IA32 - // Need some crappy work-around for x87 sNaN -> qNaN breakage in simulator - // builds. - uint64_t bits = instr->bits(); - if ((bits & V8_UINT64_C(0x7FF8000000000000)) == - V8_UINT64_C(0x7FF0000000000000)) { - uint32_t lo = static_cast<uint32_t>(bits); - uint32_t hi = static_cast<uint32_t>(bits >> 32); - __ mov(ip, Operand(lo)); - __ mov(scratch0(), Operand(hi)); - __ MovInt64ToDouble(result, scratch0(), ip); - return; - } -#endif - double v = instr->value(); - __ LoadDoubleLiteral(result, v, scratch0()); -} - - -void LCodeGen::DoConstantE(LConstantE* instr) { - __ mov(ToRegister(instr->result()), Operand(instr->value())); -} - - -void LCodeGen::DoConstantT(LConstantT* instr) { - Handle<Object> object = instr->value(isolate()); - AllowDeferredHandleDereference smi_check; - __ Move(ToRegister(instr->result()), object); -} - - -void LCodeGen::DoMapEnumLength(LMapEnumLength* instr) { - Register result = ToRegister(instr->result()); - Register map = ToRegister(instr->value()); - __ EnumLength(result, map); -} - - -void LCodeGen::DoDateField(LDateField* instr) { - Register object = ToRegister(instr->date()); - Register result = ToRegister(instr->result()); - Register scratch = ToRegister(instr->temp()); - Smi* index = instr->index(); - DCHECK(object.is(result)); - DCHECK(object.is(r3)); - DCHECK(!scratch.is(scratch0())); - DCHECK(!scratch.is(object)); - - if (index->value() == 0) { - __ LoadP(result, FieldMemOperand(object, JSDate::kValueOffset)); - } else { - Label runtime, done; - if (index->value() < JSDate::kFirstUncachedField) { - ExternalReference stamp = ExternalReference::date_cache_stamp(isolate()); - __ mov(scratch, Operand(stamp)); - __ LoadP(scratch, MemOperand(scratch)); - __ LoadP(scratch0(), FieldMemOperand(object, JSDate::kCacheStampOffset)); - __ cmp(scratch, scratch0()); - __ bne(&runtime); - __ LoadP(result, - FieldMemOperand(object, JSDate::kValueOffset + - kPointerSize * index->value())); - __ b(&done); - } - __ bind(&runtime); - __ PrepareCallCFunction(2, scratch); - __ LoadSmiLiteral(r4, index); - __ CallCFunction(ExternalReference::get_date_field_function(isolate()), 2); - __ bind(&done); - } -} - - -MemOperand LCodeGen::BuildSeqStringOperand(Register string, LOperand* index, - String::Encoding encoding) { - if (index->IsConstantOperand()) { - int offset = ToInteger32(LConstantOperand::cast(index)); - if (encoding == String::TWO_BYTE_ENCODING) { - offset *= kUC16Size; - } - STATIC_ASSERT(kCharSize == 1); - return FieldMemOperand(string, SeqString::kHeaderSize + offset); - } - Register scratch = scratch0(); - DCHECK(!scratch.is(string)); - DCHECK(!scratch.is(ToRegister(index))); - if (encoding == String::ONE_BYTE_ENCODING) { - __ add(scratch, string, ToRegister(index)); - } else { - STATIC_ASSERT(kUC16Size == 2); - __ ShiftLeftImm(scratch, ToRegister(index), Operand(1)); - __ add(scratch, string, scratch); - } - return FieldMemOperand(scratch, SeqString::kHeaderSize); -} - - -void LCodeGen::DoSeqStringGetChar(LSeqStringGetChar* instr) { - String::Encoding encoding = instr->hydrogen()->encoding(); - Register string = ToRegister(instr->string()); - Register result = ToRegister(instr->result()); - - if (FLAG_debug_code) { - Register scratch = scratch0(); - __ LoadP(scratch, FieldMemOperand(string, HeapObject::kMapOffset)); - __ lbz(scratch, FieldMemOperand(scratch, Map::kInstanceTypeOffset)); - - __ andi(scratch, scratch, - Operand(kStringRepresentationMask | kStringEncodingMask)); - static const uint32_t one_byte_seq_type = kSeqStringTag | kOneByteStringTag; - static const uint32_t two_byte_seq_type = kSeqStringTag | kTwoByteStringTag; - __ cmpi(scratch, - Operand(encoding == String::ONE_BYTE_ENCODING ? one_byte_seq_type - : two_byte_seq_type)); - __ Check(eq, kUnexpectedStringType); - } - - MemOperand operand = BuildSeqStringOperand(string, instr->index(), encoding); - if (encoding == String::ONE_BYTE_ENCODING) { - __ lbz(result, operand); - } else { - __ lhz(result, operand); - } -} - - -void LCodeGen::DoSeqStringSetChar(LSeqStringSetChar* instr) { - String::Encoding encoding = instr->hydrogen()->encoding(); - Register string = ToRegister(instr->string()); - Register value = ToRegister(instr->value()); - - if (FLAG_debug_code) { - Register index = ToRegister(instr->index()); - static const uint32_t one_byte_seq_type = kSeqStringTag | kOneByteStringTag; - static const uint32_t two_byte_seq_type = kSeqStringTag | kTwoByteStringTag; - int encoding_mask = - instr->hydrogen()->encoding() == String::ONE_BYTE_ENCODING - ? one_byte_seq_type - : two_byte_seq_type; - __ EmitSeqStringSetCharCheck(string, index, value, encoding_mask); - } - - MemOperand operand = BuildSeqStringOperand(string, instr->index(), encoding); - if (encoding == String::ONE_BYTE_ENCODING) { - __ stb(value, operand); - } else { - __ sth(value, operand); - } -} - - -void LCodeGen::DoAddI(LAddI* instr) { - LOperand* right = instr->right(); - Register left = ToRegister(instr->left()); - Register result = ToRegister(instr->result()); - bool can_overflow = instr->hydrogen()->CheckFlag(HValue::kCanOverflow); -#if V8_TARGET_ARCH_PPC64 - const bool isInteger = !(instr->hydrogen()->representation().IsSmi() || - instr->hydrogen()->representation().IsExternal()); -#else - const bool isInteger = false; -#endif - - if (!can_overflow || isInteger) { - if (right->IsConstantOperand()) { - __ Add(result, left, ToOperand(right).immediate(), r0); - } else { - __ add(result, left, EmitLoadRegister(right, ip)); - } -#if V8_TARGET_ARCH_PPC64 - if (can_overflow) { - __ TestIfInt32(result, r0); - DeoptimizeIf(ne, instr, Deoptimizer::kOverflow); - } -#endif - } else { - if (right->IsConstantOperand()) { - __ AddAndCheckForOverflow(result, left, ToOperand(right).immediate(), - scratch0(), r0); - } else { - __ AddAndCheckForOverflow(result, left, EmitLoadRegister(right, ip), - scratch0(), r0); - } - DeoptimizeIf(lt, instr, Deoptimizer::kOverflow, cr0); - } -} - - -void LCodeGen::DoMathMinMax(LMathMinMax* instr) { - LOperand* left = instr->left(); - LOperand* right = instr->right(); - HMathMinMax::Operation operation = instr->hydrogen()->operation(); - Condition cond = (operation == HMathMinMax::kMathMin) ? le : ge; - if (instr->hydrogen()->representation().IsSmiOrInteger32()) { - Register left_reg = ToRegister(left); - Register right_reg = EmitLoadRegister(right, ip); - Register result_reg = ToRegister(instr->result()); - Label return_left, done; -#if V8_TARGET_ARCH_PPC64 - if (instr->hydrogen_value()->representation().IsSmi()) { -#endif - __ cmp(left_reg, right_reg); -#if V8_TARGET_ARCH_PPC64 - } else { - __ cmpw(left_reg, right_reg); - } -#endif - if (CpuFeatures::IsSupported(ISELECT)) { - __ isel(cond, result_reg, left_reg, right_reg); - } else { - __ b(cond, &return_left); - __ Move(result_reg, right_reg); - __ b(&done); - __ bind(&return_left); - __ Move(result_reg, left_reg); - __ bind(&done); - } - } else { - DCHECK(instr->hydrogen()->representation().IsDouble()); - DoubleRegister left_reg = ToDoubleRegister(left); - DoubleRegister right_reg = ToDoubleRegister(right); - DoubleRegister result_reg = ToDoubleRegister(instr->result()); - Label check_nan_left, check_zero, return_left, return_right, done; - __ fcmpu(left_reg, right_reg); - __ bunordered(&check_nan_left); - __ beq(&check_zero); - __ b(cond, &return_left); - __ b(&return_right); - - __ bind(&check_zero); - __ fcmpu(left_reg, kDoubleRegZero); - __ bne(&return_left); // left == right != 0. - - // At this point, both left and right are either 0 or -0. - // N.B. The following works because +0 + -0 == +0 - if (operation == HMathMinMax::kMathMin) { - // For min we want logical-or of sign bit: -(-L + -R) - __ fneg(left_reg, left_reg); - __ fsub(result_reg, left_reg, right_reg); - __ fneg(result_reg, result_reg); - } else { - // For max we want logical-and of sign bit: (L + R) - __ fadd(result_reg, left_reg, right_reg); - } - __ b(&done); - - __ bind(&check_nan_left); - __ fcmpu(left_reg, left_reg); - __ bunordered(&return_left); // left == NaN. - - __ bind(&return_right); - if (!right_reg.is(result_reg)) { - __ fmr(result_reg, right_reg); - } - __ b(&done); - - __ bind(&return_left); - if (!left_reg.is(result_reg)) { - __ fmr(result_reg, left_reg); - } - __ bind(&done); - } -} - - -void LCodeGen::DoArithmeticD(LArithmeticD* instr) { - DoubleRegister left = ToDoubleRegister(instr->left()); - DoubleRegister right = ToDoubleRegister(instr->right()); - DoubleRegister result = ToDoubleRegister(instr->result()); - switch (instr->op()) { - case Token::ADD: - __ fadd(result, left, right); - break; - case Token::SUB: - __ fsub(result, left, right); - break; - case Token::MUL: - __ fmul(result, left, right); - break; - case Token::DIV: - __ fdiv(result, left, right); - break; - case Token::MOD: { - __ PrepareCallCFunction(0, 2, scratch0()); - __ MovToFloatParameters(left, right); - __ CallCFunction(ExternalReference::mod_two_doubles_operation(isolate()), - 0, 2); - // Move the result in the double result register. - __ MovFromFloatResult(result); - break; - } - default: - UNREACHABLE(); - break; - } -} - - -void LCodeGen::DoArithmeticT(LArithmeticT* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->left()).is(r4)); - DCHECK(ToRegister(instr->right()).is(r3)); - DCHECK(ToRegister(instr->result()).is(r3)); - - Handle<Code> code = - CodeFactory::BinaryOpIC(isolate(), instr->op(), instr->strength()).code(); - CallCode(code, RelocInfo::CODE_TARGET, instr); -} - - -template <class InstrType> -void LCodeGen::EmitBranch(InstrType instr, Condition cond, CRegister cr) { - int left_block = instr->TrueDestination(chunk_); - int right_block = instr->FalseDestination(chunk_); - - int next_block = GetNextEmittedBlock(); - - if (right_block == left_block || cond == al) { - EmitGoto(left_block); - } else if (left_block == next_block) { - __ b(NegateCondition(cond), chunk_->GetAssemblyLabel(right_block), cr); - } else if (right_block == next_block) { - __ b(cond, chunk_->GetAssemblyLabel(left_block), cr); - } else { - __ b(cond, chunk_->GetAssemblyLabel(left_block), cr); - __ b(chunk_->GetAssemblyLabel(right_block)); - } -} - - -template <class InstrType> -void LCodeGen::EmitTrueBranch(InstrType instr, Condition cond, CRegister cr) { - int true_block = instr->TrueDestination(chunk_); - __ b(cond, chunk_->GetAssemblyLabel(true_block), cr); -} - - -template <class InstrType> -void LCodeGen::EmitFalseBranch(InstrType instr, Condition cond, CRegister cr) { - int false_block = instr->FalseDestination(chunk_); - __ b(cond, chunk_->GetAssemblyLabel(false_block), cr); -} - - -void LCodeGen::DoDebugBreak(LDebugBreak* instr) { __ stop("LBreak"); } - - -void LCodeGen::DoBranch(LBranch* instr) { - Representation r = instr->hydrogen()->value()->representation(); - DoubleRegister dbl_scratch = double_scratch0(); - const uint crZOrNaNBits = (1 << (31 - Assembler::encode_crbit(cr7, CR_EQ)) | - 1 << (31 - Assembler::encode_crbit(cr7, CR_FU))); - - if (r.IsInteger32()) { - DCHECK(!info()->IsStub()); - Register reg = ToRegister(instr->value()); - __ cmpwi(reg, Operand::Zero()); - EmitBranch(instr, ne); - } else if (r.IsSmi()) { - DCHECK(!info()->IsStub()); - Register reg = ToRegister(instr->value()); - __ cmpi(reg, Operand::Zero()); - EmitBranch(instr, ne); - } else if (r.IsDouble()) { - DCHECK(!info()->IsStub()); - DoubleRegister reg = ToDoubleRegister(instr->value()); - // Test the double value. Zero and NaN are false. - __ fcmpu(reg, kDoubleRegZero, cr7); - __ mfcr(r0); - __ andi(r0, r0, Operand(crZOrNaNBits)); - EmitBranch(instr, eq, cr0); - } else { - DCHECK(r.IsTagged()); - Register reg = ToRegister(instr->value()); - HType type = instr->hydrogen()->value()->type(); - if (type.IsBoolean()) { - DCHECK(!info()->IsStub()); - __ CompareRoot(reg, Heap::kTrueValueRootIndex); - EmitBranch(instr, eq); - } else if (type.IsSmi()) { - DCHECK(!info()->IsStub()); - __ cmpi(reg, Operand::Zero()); - EmitBranch(instr, ne); - } else if (type.IsJSArray()) { - DCHECK(!info()->IsStub()); - EmitBranch(instr, al); - } else if (type.IsHeapNumber()) { - DCHECK(!info()->IsStub()); - __ lfd(dbl_scratch, FieldMemOperand(reg, HeapNumber::kValueOffset)); - // Test the double value. Zero and NaN are false. - __ fcmpu(dbl_scratch, kDoubleRegZero, cr7); - __ mfcr(r0); - __ andi(r0, r0, Operand(crZOrNaNBits)); - EmitBranch(instr, eq, cr0); - } else if (type.IsString()) { - DCHECK(!info()->IsStub()); - __ LoadP(ip, FieldMemOperand(reg, String::kLengthOffset)); - __ cmpi(ip, Operand::Zero()); - EmitBranch(instr, ne); - } else { - ToBooleanStub::Types expected = instr->hydrogen()->expected_input_types(); - // Avoid deopts in the case where we've never executed this path before. - if (expected.IsEmpty()) expected = ToBooleanStub::Types::Generic(); - - if (expected.Contains(ToBooleanStub::UNDEFINED)) { - // undefined -> false. - __ CompareRoot(reg, Heap::kUndefinedValueRootIndex); - __ beq(instr->FalseLabel(chunk_)); - } - if (expected.Contains(ToBooleanStub::BOOLEAN)) { - // Boolean -> its value. - __ CompareRoot(reg, Heap::kTrueValueRootIndex); - __ beq(instr->TrueLabel(chunk_)); - __ CompareRoot(reg, Heap::kFalseValueRootIndex); - __ beq(instr->FalseLabel(chunk_)); - } - if (expected.Contains(ToBooleanStub::NULL_TYPE)) { - // 'null' -> false. - __ CompareRoot(reg, Heap::kNullValueRootIndex); - __ beq(instr->FalseLabel(chunk_)); - } - - if (expected.Contains(ToBooleanStub::SMI)) { - // Smis: 0 -> false, all other -> true. - __ cmpi(reg, Operand::Zero()); - __ beq(instr->FalseLabel(chunk_)); - __ JumpIfSmi(reg, instr->TrueLabel(chunk_)); - } else if (expected.NeedsMap()) { - // If we need a map later and have a Smi -> deopt. - __ TestIfSmi(reg, r0); - DeoptimizeIf(eq, instr, Deoptimizer::kSmi, cr0); - } - - const Register map = scratch0(); - if (expected.NeedsMap()) { - __ LoadP(map, FieldMemOperand(reg, HeapObject::kMapOffset)); - - if (expected.CanBeUndetectable()) { - // Undetectable -> false. - __ lbz(ip, FieldMemOperand(map, Map::kBitFieldOffset)); - __ TestBit(ip, Map::kIsUndetectable, r0); - __ bne(instr->FalseLabel(chunk_), cr0); - } - } - - if (expected.Contains(ToBooleanStub::SPEC_OBJECT)) { - // spec object -> true. - __ CompareInstanceType(map, ip, FIRST_SPEC_OBJECT_TYPE); - __ bge(instr->TrueLabel(chunk_)); - } - - if (expected.Contains(ToBooleanStub::STRING)) { - // String value -> false iff empty. - Label not_string; - __ CompareInstanceType(map, ip, FIRST_NONSTRING_TYPE); - __ bge(¬_string); - __ LoadP(ip, FieldMemOperand(reg, String::kLengthOffset)); - __ cmpi(ip, Operand::Zero()); - __ bne(instr->TrueLabel(chunk_)); - __ b(instr->FalseLabel(chunk_)); - __ bind(¬_string); - } - - if (expected.Contains(ToBooleanStub::SYMBOL)) { - // Symbol value -> true. - __ CompareInstanceType(map, ip, SYMBOL_TYPE); - __ beq(instr->TrueLabel(chunk_)); - } - - if (expected.Contains(ToBooleanStub::SIMD_VALUE)) { - // SIMD value -> true. - Label not_simd; - __ CompareInstanceType(map, ip, SIMD128_VALUE_TYPE); - __ beq(instr->TrueLabel(chunk_)); - } - - if (expected.Contains(ToBooleanStub::HEAP_NUMBER)) { - // heap number -> false iff +0, -0, or NaN. - Label not_heap_number; - __ CompareRoot(map, Heap::kHeapNumberMapRootIndex); - __ bne(¬_heap_number); - __ lfd(dbl_scratch, FieldMemOperand(reg, HeapNumber::kValueOffset)); - // Test the double value. Zero and NaN are false. - __ fcmpu(dbl_scratch, kDoubleRegZero, cr7); - __ mfcr(r0); - __ andi(r0, r0, Operand(crZOrNaNBits)); - __ bne(instr->FalseLabel(chunk_), cr0); - __ b(instr->TrueLabel(chunk_)); - __ bind(¬_heap_number); - } - - if (!expected.IsGeneric()) { - // We've seen something for the first time -> deopt. - // This can only happen if we are not generic already. - DeoptimizeIf(al, instr, Deoptimizer::kUnexpectedObject); - } - } - } -} - - -void LCodeGen::EmitGoto(int block) { - if (!IsNextEmittedBlock(block)) { - __ b(chunk_->GetAssemblyLabel(LookupDestination(block))); - } -} - - -void LCodeGen::DoGoto(LGoto* instr) { EmitGoto(instr->block_id()); } - - -Condition LCodeGen::TokenToCondition(Token::Value op) { - Condition cond = kNoCondition; - switch (op) { - case Token::EQ: - case Token::EQ_STRICT: - cond = eq; - break; - case Token::NE: - case Token::NE_STRICT: - cond = ne; - break; - case Token::LT: - cond = lt; - break; - case Token::GT: - cond = gt; - break; - case Token::LTE: - cond = le; - break; - case Token::GTE: - cond = ge; - break; - case Token::IN: - case Token::INSTANCEOF: - default: - UNREACHABLE(); - } - return cond; -} - - -void LCodeGen::DoCompareNumericAndBranch(LCompareNumericAndBranch* instr) { - LOperand* left = instr->left(); - LOperand* right = instr->right(); - bool is_unsigned = - instr->hydrogen()->left()->CheckFlag(HInstruction::kUint32) || - instr->hydrogen()->right()->CheckFlag(HInstruction::kUint32); - Condition cond = TokenToCondition(instr->op()); - - if (left->IsConstantOperand() && right->IsConstantOperand()) { - // We can statically evaluate the comparison. - double left_val = ToDouble(LConstantOperand::cast(left)); - double right_val = ToDouble(LConstantOperand::cast(right)); - int next_block = EvalComparison(instr->op(), left_val, right_val) - ? instr->TrueDestination(chunk_) - : instr->FalseDestination(chunk_); - EmitGoto(next_block); - } else { - if (instr->is_double()) { - // Compare left and right operands as doubles and load the - // resulting flags into the normal status register. - __ fcmpu(ToDoubleRegister(left), ToDoubleRegister(right)); - // If a NaN is involved, i.e. the result is unordered, - // jump to false block label. - __ bunordered(instr->FalseLabel(chunk_)); - } else { - if (right->IsConstantOperand()) { - int32_t value = ToInteger32(LConstantOperand::cast(right)); - if (instr->hydrogen_value()->representation().IsSmi()) { - if (is_unsigned) { - __ CmplSmiLiteral(ToRegister(left), Smi::FromInt(value), r0); - } else { - __ CmpSmiLiteral(ToRegister(left), Smi::FromInt(value), r0); - } - } else { - if (is_unsigned) { - __ Cmplwi(ToRegister(left), Operand(value), r0); - } else { - __ Cmpwi(ToRegister(left), Operand(value), r0); - } - } - } else if (left->IsConstantOperand()) { - int32_t value = ToInteger32(LConstantOperand::cast(left)); - if (instr->hydrogen_value()->representation().IsSmi()) { - if (is_unsigned) { - __ CmplSmiLiteral(ToRegister(right), Smi::FromInt(value), r0); - } else { - __ CmpSmiLiteral(ToRegister(right), Smi::FromInt(value), r0); - } - } else { - if (is_unsigned) { - __ Cmplwi(ToRegister(right), Operand(value), r0); - } else { - __ Cmpwi(ToRegister(right), Operand(value), r0); - } - } - // We commuted the operands, so commute the condition. - cond = CommuteCondition(cond); - } else if (instr->hydrogen_value()->representation().IsSmi()) { - if (is_unsigned) { - __ cmpl(ToRegister(left), ToRegister(right)); - } else { - __ cmp(ToRegister(left), ToRegister(right)); - } - } else { - if (is_unsigned) { - __ cmplw(ToRegister(left), ToRegister(right)); - } else { - __ cmpw(ToRegister(left), ToRegister(right)); - } - } - } - EmitBranch(instr, cond); - } -} - - -void LCodeGen::DoCmpObjectEqAndBranch(LCmpObjectEqAndBranch* instr) { - Register left = ToRegister(instr->left()); - Register right = ToRegister(instr->right()); - - __ cmp(left, right); - EmitBranch(instr, eq); -} - - -void LCodeGen::DoCmpHoleAndBranch(LCmpHoleAndBranch* instr) { - if (instr->hydrogen()->representation().IsTagged()) { - Register input_reg = ToRegister(instr->object()); - __ mov(ip, Operand(factory()->the_hole_value())); - __ cmp(input_reg, ip); - EmitBranch(instr, eq); - return; - } - - DoubleRegister input_reg = ToDoubleRegister(instr->object()); - __ fcmpu(input_reg, input_reg); - EmitFalseBranch(instr, ordered); - - Register scratch = scratch0(); - __ MovDoubleHighToInt(scratch, input_reg); - __ Cmpi(scratch, Operand(kHoleNanUpper32), r0); - EmitBranch(instr, eq); -} - - -void LCodeGen::DoCompareMinusZeroAndBranch(LCompareMinusZeroAndBranch* instr) { - Representation rep = instr->hydrogen()->value()->representation(); - DCHECK(!rep.IsInteger32()); - Register scratch = ToRegister(instr->temp()); - - if (rep.IsDouble()) { - DoubleRegister value = ToDoubleRegister(instr->value()); - __ fcmpu(value, kDoubleRegZero); - EmitFalseBranch(instr, ne); -#if V8_TARGET_ARCH_PPC64 - __ MovDoubleToInt64(scratch, value); -#else - __ MovDoubleHighToInt(scratch, value); -#endif - __ cmpi(scratch, Operand::Zero()); - EmitBranch(instr, lt); - } else { - Register value = ToRegister(instr->value()); - __ CheckMap(value, scratch, Heap::kHeapNumberMapRootIndex, - instr->FalseLabel(chunk()), DO_SMI_CHECK); -#if V8_TARGET_ARCH_PPC64 - __ LoadP(scratch, FieldMemOperand(value, HeapNumber::kValueOffset)); - __ li(ip, Operand(1)); - __ rotrdi(ip, ip, 1); // ip = 0x80000000_00000000 - __ cmp(scratch, ip); -#else - __ lwz(scratch, FieldMemOperand(value, HeapNumber::kExponentOffset)); - __ lwz(ip, FieldMemOperand(value, HeapNumber::kMantissaOffset)); - Label skip; - __ lis(r0, Operand(SIGN_EXT_IMM16(0x8000))); - __ cmp(scratch, r0); - __ bne(&skip); - __ cmpi(ip, Operand::Zero()); - __ bind(&skip); -#endif - EmitBranch(instr, eq); - } -} - - -Condition LCodeGen::EmitIsString(Register input, Register temp1, - Label* is_not_string, - SmiCheck check_needed = INLINE_SMI_CHECK) { - if (check_needed == INLINE_SMI_CHECK) { - __ JumpIfSmi(input, is_not_string); - } - __ CompareObjectType(input, temp1, temp1, FIRST_NONSTRING_TYPE); - - return lt; -} - - -void LCodeGen::DoIsStringAndBranch(LIsStringAndBranch* instr) { - Register reg = ToRegister(instr->value()); - Register temp1 = ToRegister(instr->temp()); - - SmiCheck check_needed = instr->hydrogen()->value()->type().IsHeapObject() - ? OMIT_SMI_CHECK - : INLINE_SMI_CHECK; - Condition true_cond = - EmitIsString(reg, temp1, instr->FalseLabel(chunk_), check_needed); - - EmitBranch(instr, true_cond); -} - - -void LCodeGen::DoIsSmiAndBranch(LIsSmiAndBranch* instr) { - Register input_reg = EmitLoadRegister(instr->value(), ip); - __ TestIfSmi(input_reg, r0); - EmitBranch(instr, eq, cr0); -} - - -void LCodeGen::DoIsUndetectableAndBranch(LIsUndetectableAndBranch* instr) { - Register input = ToRegister(instr->value()); - Register temp = ToRegister(instr->temp()); - - if (!instr->hydrogen()->value()->type().IsHeapObject()) { - __ JumpIfSmi(input, instr->FalseLabel(chunk_)); - } - __ LoadP(temp, FieldMemOperand(input, HeapObject::kMapOffset)); - __ lbz(temp, FieldMemOperand(temp, Map::kBitFieldOffset)); - __ TestBit(temp, Map::kIsUndetectable, r0); - EmitBranch(instr, ne, cr0); -} - - -static Condition ComputeCompareCondition(Token::Value op) { - switch (op) { - case Token::EQ_STRICT: - case Token::EQ: - return eq; - case Token::LT: - return lt; - case Token::GT: - return gt; - case Token::LTE: - return le; - case Token::GTE: - return ge; - default: - UNREACHABLE(); - return kNoCondition; - } -} - - -void LCodeGen::DoStringCompareAndBranch(LStringCompareAndBranch* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->left()).is(r4)); - DCHECK(ToRegister(instr->right()).is(r3)); - - Handle<Code> code = CodeFactory::StringCompare(isolate()).code(); - CallCode(code, RelocInfo::CODE_TARGET, instr); - __ cmpi(r3, Operand::Zero()); - - EmitBranch(instr, ComputeCompareCondition(instr->op())); -} - - -static InstanceType TestType(HHasInstanceTypeAndBranch* instr) { - InstanceType from = instr->from(); - InstanceType to = instr->to(); - if (from == FIRST_TYPE) return to; - DCHECK(from == to || to == LAST_TYPE); - return from; -} - - -static Condition BranchCondition(HHasInstanceTypeAndBranch* instr) { - InstanceType from = instr->from(); - InstanceType to = instr->to(); - if (from == to) return eq; - if (to == LAST_TYPE) return ge; - if (from == FIRST_TYPE) return le; - UNREACHABLE(); - return eq; -} - - -void LCodeGen::DoHasInstanceTypeAndBranch(LHasInstanceTypeAndBranch* instr) { - Register scratch = scratch0(); - Register input = ToRegister(instr->value()); - - if (!instr->hydrogen()->value()->type().IsHeapObject()) { - __ JumpIfSmi(input, instr->FalseLabel(chunk_)); - } - - __ CompareObjectType(input, scratch, scratch, TestType(instr->hydrogen())); - EmitBranch(instr, BranchCondition(instr->hydrogen())); -} - - -void LCodeGen::DoGetCachedArrayIndex(LGetCachedArrayIndex* instr) { - Register input = ToRegister(instr->value()); - Register result = ToRegister(instr->result()); - - __ AssertString(input); - - __ lwz(result, FieldMemOperand(input, String::kHashFieldOffset)); - __ IndexFromHash(result, result); -} - - -void LCodeGen::DoHasCachedArrayIndexAndBranch( - LHasCachedArrayIndexAndBranch* instr) { - Register input = ToRegister(instr->value()); - Register scratch = scratch0(); - - __ lwz(scratch, FieldMemOperand(input, String::kHashFieldOffset)); - __ mov(r0, Operand(String::kContainsCachedArrayIndexMask)); - __ and_(r0, scratch, r0, SetRC); - EmitBranch(instr, eq, cr0); -} - - -// Branches to a label or falls through with the answer in flags. Trashes -// the temp registers, but not the input. -void LCodeGen::EmitClassOfTest(Label* is_true, Label* is_false, - Handle<String> class_name, Register input, - Register temp, Register temp2) { - DCHECK(!input.is(temp)); - DCHECK(!input.is(temp2)); - DCHECK(!temp.is(temp2)); - - __ JumpIfSmi(input, is_false); - - if (String::Equals(isolate()->factory()->Function_string(), class_name)) { - // Assuming the following assertions, we can use the same compares to test - // for both being a function type and being in the object type range. - STATIC_ASSERT(NUM_OF_CALLABLE_SPEC_OBJECT_TYPES == 2); - STATIC_ASSERT(FIRST_NONCALLABLE_SPEC_OBJECT_TYPE == - FIRST_SPEC_OBJECT_TYPE + 1); - STATIC_ASSERT(LAST_NONCALLABLE_SPEC_OBJECT_TYPE == - LAST_SPEC_OBJECT_TYPE - 1); - STATIC_ASSERT(LAST_SPEC_OBJECT_TYPE == LAST_TYPE); - __ CompareObjectType(input, temp, temp2, FIRST_SPEC_OBJECT_TYPE); - __ blt(is_false); - __ beq(is_true); - __ cmpi(temp2, Operand(LAST_SPEC_OBJECT_TYPE)); - __ beq(is_true); - } else { - // Faster code path to avoid two compares: subtract lower bound from the - // actual type and do a signed compare with the width of the type range. - __ LoadP(temp, FieldMemOperand(input, HeapObject::kMapOffset)); - __ lbz(temp2, FieldMemOperand(temp, Map::kInstanceTypeOffset)); - __ subi(temp2, temp2, Operand(FIRST_NONCALLABLE_SPEC_OBJECT_TYPE)); - __ cmpi(temp2, Operand(LAST_NONCALLABLE_SPEC_OBJECT_TYPE - - FIRST_NONCALLABLE_SPEC_OBJECT_TYPE)); - __ bgt(is_false); - } - - // Now we are in the FIRST-LAST_NONCALLABLE_SPEC_OBJECT_TYPE range. - // Check if the constructor in the map is a function. - Register instance_type = ip; - __ GetMapConstructor(temp, temp, temp2, instance_type); - - // Objects with a non-function constructor have class 'Object'. - __ cmpi(instance_type, Operand(JS_FUNCTION_TYPE)); - if (class_name->IsOneByteEqualTo(STATIC_CHAR_VECTOR("Object"))) { - __ bne(is_true); - } else { - __ bne(is_false); - } - - // temp now contains the constructor function. Grab the - // instance class name from there. - __ LoadP(temp, FieldMemOperand(temp, JSFunction::kSharedFunctionInfoOffset)); - __ LoadP(temp, - FieldMemOperand(temp, SharedFunctionInfo::kInstanceClassNameOffset)); - // The class name we are testing against is internalized since it's a literal. - // The name in the constructor is internalized because of the way the context - // is booted. This routine isn't expected to work for random API-created - // classes and it doesn't have to because you can't access it with natives - // syntax. Since both sides are internalized it is sufficient to use an - // identity comparison. - __ Cmpi(temp, Operand(class_name), r0); - // End with the answer in flags. -} - - -void LCodeGen::DoClassOfTestAndBranch(LClassOfTestAndBranch* instr) { - Register input = ToRegister(instr->value()); - Register temp = scratch0(); - Register temp2 = ToRegister(instr->temp()); - Handle<String> class_name = instr->hydrogen()->class_name(); - - EmitClassOfTest(instr->TrueLabel(chunk_), instr->FalseLabel(chunk_), - class_name, input, temp, temp2); - - EmitBranch(instr, eq); -} - - -void LCodeGen::DoCmpMapAndBranch(LCmpMapAndBranch* instr) { - Register reg = ToRegister(instr->value()); - Register temp = ToRegister(instr->temp()); - - __ LoadP(temp, FieldMemOperand(reg, HeapObject::kMapOffset)); - __ Cmpi(temp, Operand(instr->map()), r0); - EmitBranch(instr, eq); -} - - -void LCodeGen::DoInstanceOf(LInstanceOf* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->left()).is(InstanceOfDescriptor::LeftRegister())); - DCHECK(ToRegister(instr->right()).is(InstanceOfDescriptor::RightRegister())); - DCHECK(ToRegister(instr->result()).is(r3)); - InstanceOfStub stub(isolate()); - CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); -} - - -void LCodeGen::DoHasInPrototypeChainAndBranch( - LHasInPrototypeChainAndBranch* instr) { - Register const object = ToRegister(instr->object()); - Register const object_map = scratch0(); - Register const object_prototype = object_map; - Register const prototype = ToRegister(instr->prototype()); - - // The {object} must be a spec object. It's sufficient to know that {object} - // is not a smi, since all other non-spec objects have {null} prototypes and - // will be ruled out below. - if (instr->hydrogen()->ObjectNeedsSmiCheck()) { - __ TestIfSmi(object, r0); - EmitFalseBranch(instr, eq, cr0); - } - - // Loop through the {object}s prototype chain looking for the {prototype}. - __ LoadP(object_map, FieldMemOperand(object, HeapObject::kMapOffset)); - Label loop; - __ bind(&loop); - __ LoadP(object_prototype, - FieldMemOperand(object_map, Map::kPrototypeOffset)); - __ cmp(object_prototype, prototype); - EmitTrueBranch(instr, eq); - __ CompareRoot(object_prototype, Heap::kNullValueRootIndex); - EmitFalseBranch(instr, eq); - __ LoadP(object_map, - FieldMemOperand(object_prototype, HeapObject::kMapOffset)); - __ b(&loop); -} - - -void LCodeGen::DoCmpT(LCmpT* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - Token::Value op = instr->op(); - - Handle<Code> ic = - CodeFactory::CompareIC(isolate(), op, instr->strength()).code(); - CallCode(ic, RelocInfo::CODE_TARGET, instr); - // This instruction also signals no smi code inlined - __ cmpi(r3, Operand::Zero()); - - Condition condition = ComputeCompareCondition(op); - if (CpuFeatures::IsSupported(ISELECT)) { - __ LoadRoot(r4, Heap::kTrueValueRootIndex); - __ LoadRoot(r5, Heap::kFalseValueRootIndex); - __ isel(condition, ToRegister(instr->result()), r4, r5); - } else { - Label true_value, done; - - __ b(condition, &true_value); - - __ LoadRoot(ToRegister(instr->result()), Heap::kFalseValueRootIndex); - __ b(&done); - - __ bind(&true_value); - __ LoadRoot(ToRegister(instr->result()), Heap::kTrueValueRootIndex); - - __ bind(&done); - } -} - - -void LCodeGen::DoReturn(LReturn* instr) { - if (FLAG_trace && info()->IsOptimizing()) { - // Push the return value on the stack as the parameter. - // Runtime::TraceExit returns its parameter in r3. We're leaving the code - // managed by the register allocator and tearing down the frame, it's - // safe to write to the context register. - __ push(r3); - __ LoadP(cp, MemOperand(fp, StandardFrameConstants::kContextOffset)); - __ CallRuntime(Runtime::kTraceExit, 1); - } - if (info()->saves_caller_doubles()) { - RestoreCallerDoubles(); - } - int no_frame_start = -1; - if (instr->has_constant_parameter_count()) { - int parameter_count = ToInteger32(instr->constant_parameter_count()); - int32_t sp_delta = (parameter_count + 1) * kPointerSize; - if (NeedsEagerFrame()) { - no_frame_start = masm_->LeaveFrame(StackFrame::JAVA_SCRIPT, sp_delta); - } else if (sp_delta != 0) { - __ addi(sp, sp, Operand(sp_delta)); - } - } else { - DCHECK(info()->IsStub()); // Functions would need to drop one more value. - Register reg = ToRegister(instr->parameter_count()); - // The argument count parameter is a smi - if (NeedsEagerFrame()) { - no_frame_start = masm_->LeaveFrame(StackFrame::JAVA_SCRIPT); - } - __ SmiToPtrArrayOffset(r0, reg); - __ add(sp, sp, r0); - } - - __ blr(); - - if (no_frame_start != -1) { - info_->AddNoFrameRange(no_frame_start, masm_->pc_offset()); - } -} - - -template <class T> -void LCodeGen::EmitVectorLoadICRegisters(T* instr) { - Register vector_register = ToRegister(instr->temp_vector()); - Register slot_register = LoadDescriptor::SlotRegister(); - DCHECK(vector_register.is(LoadWithVectorDescriptor::VectorRegister())); - DCHECK(slot_register.is(r3)); - - AllowDeferredHandleDereference vector_structure_check; - Handle<TypeFeedbackVector> vector = instr->hydrogen()->feedback_vector(); - __ Move(vector_register, vector); - // No need to allocate this register. - FeedbackVectorICSlot slot = instr->hydrogen()->slot(); - int index = vector->GetIndex(slot); - __ LoadSmiLiteral(slot_register, Smi::FromInt(index)); -} - - -template <class T> -void LCodeGen::EmitVectorStoreICRegisters(T* instr) { - Register vector_register = ToRegister(instr->temp_vector()); - Register slot_register = ToRegister(instr->temp_slot()); - - AllowDeferredHandleDereference vector_structure_check; - Handle<TypeFeedbackVector> vector = instr->hydrogen()->feedback_vector(); - __ Move(vector_register, vector); - FeedbackVectorICSlot slot = instr->hydrogen()->slot(); - int index = vector->GetIndex(slot); - __ LoadSmiLiteral(slot_register, Smi::FromInt(index)); -} - - -void LCodeGen::DoLoadGlobalGeneric(LLoadGlobalGeneric* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->global_object()) - .is(LoadDescriptor::ReceiverRegister())); - DCHECK(ToRegister(instr->result()).is(r3)); - - __ mov(LoadDescriptor::NameRegister(), Operand(instr->name())); - EmitVectorLoadICRegisters<LLoadGlobalGeneric>(instr); - Handle<Code> ic = - CodeFactory::LoadICInOptimizedCode(isolate(), instr->typeof_mode(), - SLOPPY, PREMONOMORPHIC).code(); - CallCode(ic, RelocInfo::CODE_TARGET, instr); -} - - -void LCodeGen::DoLoadGlobalViaContext(LLoadGlobalViaContext* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->result()).is(r3)); - - int const slot = instr->slot_index(); - int const depth = instr->depth(); - if (depth <= LoadGlobalViaContextStub::kMaximumDepth) { - __ mov(LoadGlobalViaContextDescriptor::SlotRegister(), Operand(slot)); - Handle<Code> stub = - CodeFactory::LoadGlobalViaContext(isolate(), depth).code(); - CallCode(stub, RelocInfo::CODE_TARGET, instr); - } else { - __ Push(Smi::FromInt(slot)); - __ CallRuntime(Runtime::kLoadGlobalViaContext, 1); - } -} - - -void LCodeGen::DoLoadContextSlot(LLoadContextSlot* instr) { - Register context = ToRegister(instr->context()); - Register result = ToRegister(instr->result()); - __ LoadP(result, ContextOperand(context, instr->slot_index())); - if (instr->hydrogen()->RequiresHoleCheck()) { - __ LoadRoot(ip, Heap::kTheHoleValueRootIndex); - if (instr->hydrogen()->DeoptimizesOnHole()) { - __ cmp(result, ip); - DeoptimizeIf(eq, instr, Deoptimizer::kHole); - } else { - if (CpuFeatures::IsSupported(ISELECT)) { - Register scratch = scratch0(); - __ mov(scratch, Operand(factory()->undefined_value())); - __ cmp(result, ip); - __ isel(eq, result, scratch, result); - } else { - Label skip; - __ cmp(result, ip); - __ bne(&skip); - __ mov(result, Operand(factory()->undefined_value())); - __ bind(&skip); - } - } - } -} - - -void LCodeGen::DoStoreContextSlot(LStoreContextSlot* instr) { - Register context = ToRegister(instr->context()); - Register value = ToRegister(instr->value()); - Register scratch = scratch0(); - MemOperand target = ContextOperand(context, instr->slot_index()); - - Label skip_assignment; - - if (instr->hydrogen()->RequiresHoleCheck()) { - __ LoadP(scratch, target); - __ LoadRoot(ip, Heap::kTheHoleValueRootIndex); - __ cmp(scratch, ip); - if (instr->hydrogen()->DeoptimizesOnHole()) { - DeoptimizeIf(eq, instr, Deoptimizer::kHole); - } else { - __ bne(&skip_assignment); - } - } - - __ StoreP(value, target, r0); - if (instr->hydrogen()->NeedsWriteBarrier()) { - SmiCheck check_needed = instr->hydrogen()->value()->type().IsHeapObject() - ? OMIT_SMI_CHECK - : INLINE_SMI_CHECK; - __ RecordWriteContextSlot(context, target.offset(), value, scratch, - GetLinkRegisterState(), kSaveFPRegs, - EMIT_REMEMBERED_SET, check_needed); - } - - __ bind(&skip_assignment); -} - - -void LCodeGen::DoLoadNamedField(LLoadNamedField* instr) { - HObjectAccess access = instr->hydrogen()->access(); - int offset = access.offset(); - Register object = ToRegister(instr->object()); - - if (access.IsExternalMemory()) { - Register result = ToRegister(instr->result()); - MemOperand operand = MemOperand(object, offset); - __ LoadRepresentation(result, operand, access.representation(), r0); - return; - } - - if (instr->hydrogen()->representation().IsDouble()) { - DCHECK(access.IsInobject()); - DoubleRegister result = ToDoubleRegister(instr->result()); - __ lfd(result, FieldMemOperand(object, offset)); - return; - } - - Register result = ToRegister(instr->result()); - if (!access.IsInobject()) { - __ LoadP(result, FieldMemOperand(object, JSObject::kPropertiesOffset)); - object = result; - } - - Representation representation = access.representation(); - -#if V8_TARGET_ARCH_PPC64 - // 64-bit Smi optimization - if (representation.IsSmi() && - instr->hydrogen()->representation().IsInteger32()) { - // Read int value directly from upper half of the smi. - offset = SmiWordOffset(offset); - representation = Representation::Integer32(); - } -#endif - - __ LoadRepresentation(result, FieldMemOperand(object, offset), representation, - r0); -} - - -void LCodeGen::DoLoadNamedGeneric(LLoadNamedGeneric* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->object()).is(LoadDescriptor::ReceiverRegister())); - DCHECK(ToRegister(instr->result()).is(r3)); - - // Name is always in r5. - __ mov(LoadDescriptor::NameRegister(), Operand(instr->name())); - EmitVectorLoadICRegisters<LLoadNamedGeneric>(instr); - Handle<Code> ic = - CodeFactory::LoadICInOptimizedCode( - isolate(), NOT_INSIDE_TYPEOF, instr->hydrogen()->language_mode(), - instr->hydrogen()->initialization_state()).code(); - CallCode(ic, RelocInfo::CODE_TARGET, instr); -} - - -void LCodeGen::DoLoadFunctionPrototype(LLoadFunctionPrototype* instr) { - Register scratch = scratch0(); - Register function = ToRegister(instr->function()); - Register result = ToRegister(instr->result()); - - // Get the prototype or initial map from the function. - __ LoadP(result, - FieldMemOperand(function, JSFunction::kPrototypeOrInitialMapOffset)); - - // Check that the function has a prototype or an initial map. - __ LoadRoot(ip, Heap::kTheHoleValueRootIndex); - __ cmp(result, ip); - DeoptimizeIf(eq, instr, Deoptimizer::kHole); - - // If the function does not have an initial map, we're done. - if (CpuFeatures::IsSupported(ISELECT)) { - // Get the prototype from the initial map (optimistic). - __ LoadP(ip, FieldMemOperand(result, Map::kPrototypeOffset)); - __ CompareObjectType(result, scratch, scratch, MAP_TYPE); - __ isel(eq, result, ip, result); - } else { - Label done; - __ CompareObjectType(result, scratch, scratch, MAP_TYPE); - __ bne(&done); - - // Get the prototype from the initial map. - __ LoadP(result, FieldMemOperand(result, Map::kPrototypeOffset)); - - // All done. - __ bind(&done); - } -} - - -void LCodeGen::DoLoadRoot(LLoadRoot* instr) { - Register result = ToRegister(instr->result()); - __ LoadRoot(result, instr->index()); -} - - -void LCodeGen::DoAccessArgumentsAt(LAccessArgumentsAt* instr) { - Register arguments = ToRegister(instr->arguments()); - Register result = ToRegister(instr->result()); - // There are two words between the frame pointer and the last argument. - // Subtracting from length accounts for one of them add one more. - if (instr->length()->IsConstantOperand()) { - int const_length = ToInteger32(LConstantOperand::cast(instr->length())); - if (instr->index()->IsConstantOperand()) { - int const_index = ToInteger32(LConstantOperand::cast(instr->index())); - int index = (const_length - const_index) + 1; - __ LoadP(result, MemOperand(arguments, index * kPointerSize), r0); - } else { - Register index = ToRegister(instr->index()); - __ subfic(result, index, Operand(const_length + 1)); - __ ShiftLeftImm(result, result, Operand(kPointerSizeLog2)); - __ LoadPX(result, MemOperand(arguments, result)); - } - } else if (instr->index()->IsConstantOperand()) { - Register length = ToRegister(instr->length()); - int const_index = ToInteger32(LConstantOperand::cast(instr->index())); - int loc = const_index - 1; - if (loc != 0) { - __ subi(result, length, Operand(loc)); - __ ShiftLeftImm(result, result, Operand(kPointerSizeLog2)); - __ LoadPX(result, MemOperand(arguments, result)); - } else { - __ ShiftLeftImm(result, length, Operand(kPointerSizeLog2)); - __ LoadPX(result, MemOperand(arguments, result)); - } - } else { - Register length = ToRegister(instr->length()); - Register index = ToRegister(instr->index()); - __ sub(result, length, index); - __ addi(result, result, Operand(1)); - __ ShiftLeftImm(result, result, Operand(kPointerSizeLog2)); - __ LoadPX(result, MemOperand(arguments, result)); - } -} - - -void LCodeGen::DoLoadKeyedExternalArray(LLoadKeyed* instr) { - Register external_pointer = ToRegister(instr->elements()); - Register key = no_reg; - ElementsKind elements_kind = instr->elements_kind(); - bool key_is_constant = instr->key()->IsConstantOperand(); - int constant_key = 0; - if (key_is_constant) { - constant_key = ToInteger32(LConstantOperand::cast(instr->key())); - if (constant_key & 0xF0000000) { - Abort(kArrayIndexConstantValueTooBig); - } - } else { - key = ToRegister(instr->key()); - } - int element_size_shift = ElementsKindToShiftSize(elements_kind); - bool key_is_smi = instr->hydrogen()->key()->representation().IsSmi(); - int base_offset = instr->base_offset(); - - if (elements_kind == FLOAT32_ELEMENTS || elements_kind == FLOAT64_ELEMENTS) { - DoubleRegister result = ToDoubleRegister(instr->result()); - if (key_is_constant) { - __ Add(scratch0(), external_pointer, constant_key << element_size_shift, - r0); - } else { - __ IndexToArrayOffset(r0, key, element_size_shift, key_is_smi); - __ add(scratch0(), external_pointer, r0); - } - if (elements_kind == FLOAT32_ELEMENTS) { - __ lfs(result, MemOperand(scratch0(), base_offset)); - } else { // i.e. elements_kind == EXTERNAL_DOUBLE_ELEMENTS - __ lfd(result, MemOperand(scratch0(), base_offset)); - } - } else { - Register result = ToRegister(instr->result()); - MemOperand mem_operand = - PrepareKeyedOperand(key, external_pointer, key_is_constant, key_is_smi, - constant_key, element_size_shift, base_offset); - switch (elements_kind) { - case INT8_ELEMENTS: - if (key_is_constant) { - __ LoadByte(result, mem_operand, r0); - } else { - __ lbzx(result, mem_operand); - } - __ extsb(result, result); - break; - case UINT8_ELEMENTS: - case UINT8_CLAMPED_ELEMENTS: - if (key_is_constant) { - __ LoadByte(result, mem_operand, r0); - } else { - __ lbzx(result, mem_operand); - } - break; - case INT16_ELEMENTS: - if (key_is_constant) { - __ LoadHalfWordArith(result, mem_operand, r0); - } else { - __ lhax(result, mem_operand); - } - break; - case UINT16_ELEMENTS: - if (key_is_constant) { - __ LoadHalfWord(result, mem_operand, r0); - } else { - __ lhzx(result, mem_operand); - } - break; - case INT32_ELEMENTS: - if (key_is_constant) { - __ LoadWordArith(result, mem_operand, r0); - } else { - __ lwax(result, mem_operand); - } - break; - case UINT32_ELEMENTS: - if (key_is_constant) { - __ LoadWord(result, mem_operand, r0); - } else { - __ lwzx(result, mem_operand); - } - if (!instr->hydrogen()->CheckFlag(HInstruction::kUint32)) { - __ lis(r0, Operand(SIGN_EXT_IMM16(0x8000))); - __ cmplw(result, r0); - DeoptimizeIf(ge, instr, Deoptimizer::kNegativeValue); - } - break; - case FLOAT32_ELEMENTS: - case FLOAT64_ELEMENTS: - case FAST_HOLEY_DOUBLE_ELEMENTS: - case FAST_HOLEY_ELEMENTS: - case FAST_HOLEY_SMI_ELEMENTS: - case FAST_DOUBLE_ELEMENTS: - case FAST_ELEMENTS: - case FAST_SMI_ELEMENTS: - case DICTIONARY_ELEMENTS: - case FAST_SLOPPY_ARGUMENTS_ELEMENTS: - case SLOW_SLOPPY_ARGUMENTS_ELEMENTS: - UNREACHABLE(); - break; - } - } -} - - -void LCodeGen::DoLoadKeyedFixedDoubleArray(LLoadKeyed* instr) { - Register elements = ToRegister(instr->elements()); - bool key_is_constant = instr->key()->IsConstantOperand(); - Register key = no_reg; - DoubleRegister result = ToDoubleRegister(instr->result()); - Register scratch = scratch0(); - - int element_size_shift = ElementsKindToShiftSize(FAST_DOUBLE_ELEMENTS); - bool key_is_smi = instr->hydrogen()->key()->representation().IsSmi(); - int constant_key = 0; - if (key_is_constant) { - constant_key = ToInteger32(LConstantOperand::cast(instr->key())); - if (constant_key & 0xF0000000) { - Abort(kArrayIndexConstantValueTooBig); - } - } else { - key = ToRegister(instr->key()); - } - - int base_offset = instr->base_offset() + constant_key * kDoubleSize; - if (!key_is_constant) { - __ IndexToArrayOffset(r0, key, element_size_shift, key_is_smi); - __ add(scratch, elements, r0); - elements = scratch; - } - if (!is_int16(base_offset)) { - __ Add(scratch, elements, base_offset, r0); - base_offset = 0; - elements = scratch; - } - __ lfd(result, MemOperand(elements, base_offset)); - - if (instr->hydrogen()->RequiresHoleCheck()) { - if (is_int16(base_offset + Register::kExponentOffset)) { - __ lwz(scratch, - MemOperand(elements, base_offset + Register::kExponentOffset)); - } else { - __ addi(scratch, elements, Operand(base_offset)); - __ lwz(scratch, MemOperand(scratch, Register::kExponentOffset)); - } - __ Cmpi(scratch, Operand(kHoleNanUpper32), r0); - DeoptimizeIf(eq, instr, Deoptimizer::kHole); - } -} - - -void LCodeGen::DoLoadKeyedFixedArray(LLoadKeyed* instr) { - HLoadKeyed* hinstr = instr->hydrogen(); - Register elements = ToRegister(instr->elements()); - Register result = ToRegister(instr->result()); - Register scratch = scratch0(); - Register store_base = scratch; - int offset = instr->base_offset(); - - if (instr->key()->IsConstantOperand()) { - LConstantOperand* const_operand = LConstantOperand::cast(instr->key()); - offset += ToInteger32(const_operand) * kPointerSize; - store_base = elements; - } else { - Register key = ToRegister(instr->key()); - // Even though the HLoadKeyed instruction forces the input - // representation for the key to be an integer, the input gets replaced - // during bound check elimination with the index argument to the bounds - // check, which can be tagged, so that case must be handled here, too. - if (hinstr->key()->representation().IsSmi()) { - __ SmiToPtrArrayOffset(r0, key); - } else { - __ ShiftLeftImm(r0, key, Operand(kPointerSizeLog2)); - } - __ add(scratch, elements, r0); - } - - bool requires_hole_check = hinstr->RequiresHoleCheck(); - Representation representation = hinstr->representation(); - -#if V8_TARGET_ARCH_PPC64 - // 64-bit Smi optimization - if (representation.IsInteger32() && - hinstr->elements_kind() == FAST_SMI_ELEMENTS) { - DCHECK(!requires_hole_check); - // Read int value directly from upper half of the smi. - offset = SmiWordOffset(offset); - } -#endif - - __ LoadRepresentation(result, MemOperand(store_base, offset), representation, - r0); - - // Check for the hole value. - if (requires_hole_check) { - if (IsFastSmiElementsKind(hinstr->elements_kind())) { - __ TestIfSmi(result, r0); - DeoptimizeIf(ne, instr, Deoptimizer::kNotASmi, cr0); - } else { - __ LoadRoot(scratch, Heap::kTheHoleValueRootIndex); - __ cmp(result, scratch); - DeoptimizeIf(eq, instr, Deoptimizer::kHole); - } - } else if (instr->hydrogen()->hole_mode() == CONVERT_HOLE_TO_UNDEFINED) { - DCHECK(instr->hydrogen()->elements_kind() == FAST_HOLEY_ELEMENTS); - Label done; - __ LoadRoot(scratch, Heap::kTheHoleValueRootIndex); - __ cmp(result, scratch); - __ bne(&done); - if (info()->IsStub()) { - // A stub can safely convert the hole to undefined only if the array - // protector cell contains (Smi) Isolate::kArrayProtectorValid. Otherwise - // it needs to bail out. - __ LoadRoot(result, Heap::kArrayProtectorRootIndex); - __ LoadP(result, FieldMemOperand(result, Cell::kValueOffset)); - __ CmpSmiLiteral(result, Smi::FromInt(Isolate::kArrayProtectorValid), r0); - DeoptimizeIf(ne, instr, Deoptimizer::kHole); - } - __ LoadRoot(result, Heap::kUndefinedValueRootIndex); - __ bind(&done); - } -} - - -void LCodeGen::DoLoadKeyed(LLoadKeyed* instr) { - if (instr->is_fixed_typed_array()) { - DoLoadKeyedExternalArray(instr); - } else if (instr->hydrogen()->representation().IsDouble()) { - DoLoadKeyedFixedDoubleArray(instr); - } else { - DoLoadKeyedFixedArray(instr); - } -} - - -MemOperand LCodeGen::PrepareKeyedOperand(Register key, Register base, - bool key_is_constant, bool key_is_smi, - int constant_key, - int element_size_shift, - int base_offset) { - Register scratch = scratch0(); - - if (key_is_constant) { - return MemOperand(base, (constant_key << element_size_shift) + base_offset); - } - - bool needs_shift = - (element_size_shift != (key_is_smi ? kSmiTagSize + kSmiShiftSize : 0)); - - if (!(base_offset || needs_shift)) { - return MemOperand(base, key); - } - - if (needs_shift) { - __ IndexToArrayOffset(scratch, key, element_size_shift, key_is_smi); - key = scratch; - } - - if (base_offset) { - __ Add(scratch, key, base_offset, r0); - } - - return MemOperand(base, scratch); -} - - -void LCodeGen::DoLoadKeyedGeneric(LLoadKeyedGeneric* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->object()).is(LoadDescriptor::ReceiverRegister())); - DCHECK(ToRegister(instr->key()).is(LoadDescriptor::NameRegister())); - - if (instr->hydrogen()->HasVectorAndSlot()) { - EmitVectorLoadICRegisters<LLoadKeyedGeneric>(instr); - } - - Handle<Code> ic = CodeFactory::KeyedLoadICInOptimizedCode( - isolate(), instr->hydrogen()->language_mode(), - instr->hydrogen()->initialization_state()).code(); - CallCode(ic, RelocInfo::CODE_TARGET, instr); -} - - -void LCodeGen::DoArgumentsElements(LArgumentsElements* instr) { - Register scratch = scratch0(); - Register result = ToRegister(instr->result()); - - if (instr->hydrogen()->from_inlined()) { - __ subi(result, sp, Operand(2 * kPointerSize)); - } else { - // Check if the calling frame is an arguments adaptor frame. - __ LoadP(scratch, MemOperand(fp, StandardFrameConstants::kCallerFPOffset)); - __ LoadP(result, - MemOperand(scratch, StandardFrameConstants::kContextOffset)); - __ CmpSmiLiteral(result, Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR), r0); - - // Result is the frame pointer for the frame if not adapted and for the real - // frame below the adaptor frame if adapted. - if (CpuFeatures::IsSupported(ISELECT)) { - __ isel(eq, result, scratch, fp); - } else { - Label done, adapted; - __ beq(&adapted); - __ mr(result, fp); - __ b(&done); - - __ bind(&adapted); - __ mr(result, scratch); - __ bind(&done); - } - } -} - - -void LCodeGen::DoArgumentsLength(LArgumentsLength* instr) { - Register elem = ToRegister(instr->elements()); - Register result = ToRegister(instr->result()); - - Label done; - - // If no arguments adaptor frame the number of arguments is fixed. - __ cmp(fp, elem); - __ mov(result, Operand(scope()->num_parameters())); - __ beq(&done); - - // Arguments adaptor frame present. Get argument length from there. - __ LoadP(result, MemOperand(fp, StandardFrameConstants::kCallerFPOffset)); - __ LoadP(result, - MemOperand(result, ArgumentsAdaptorFrameConstants::kLengthOffset)); - __ SmiUntag(result); - - // Argument length is in result register. - __ bind(&done); -} - - -void LCodeGen::DoWrapReceiver(LWrapReceiver* instr) { - Register receiver = ToRegister(instr->receiver()); - Register function = ToRegister(instr->function()); - Register result = ToRegister(instr->result()); - Register scratch = scratch0(); - - // If the receiver is null or undefined, we have to pass the global - // object as a receiver to normal functions. Values have to be - // passed unchanged to builtins and strict-mode functions. - Label global_object, result_in_receiver; - - if (!instr->hydrogen()->known_function()) { - // Do not transform the receiver to object for strict mode - // functions. - __ LoadP(scratch, - FieldMemOperand(function, JSFunction::kSharedFunctionInfoOffset)); - __ lwz(scratch, - FieldMemOperand(scratch, SharedFunctionInfo::kCompilerHintsOffset)); - __ TestBit(scratch, -#if V8_TARGET_ARCH_PPC64 - SharedFunctionInfo::kStrictModeFunction, -#else - SharedFunctionInfo::kStrictModeFunction + kSmiTagSize, -#endif - r0); - __ bne(&result_in_receiver, cr0); - - // Do not transform the receiver to object for builtins. - __ TestBit(scratch, -#if V8_TARGET_ARCH_PPC64 - SharedFunctionInfo::kNative, -#else - SharedFunctionInfo::kNative + kSmiTagSize, -#endif - r0); - __ bne(&result_in_receiver, cr0); - } - - // Normal function. Replace undefined or null with global receiver. - __ LoadRoot(scratch, Heap::kNullValueRootIndex); - __ cmp(receiver, scratch); - __ beq(&global_object); - __ LoadRoot(scratch, Heap::kUndefinedValueRootIndex); - __ cmp(receiver, scratch); - __ beq(&global_object); - - // Deoptimize if the receiver is not a JS object. - __ TestIfSmi(receiver, r0); - DeoptimizeIf(eq, instr, Deoptimizer::kSmi, cr0); - __ CompareObjectType(receiver, scratch, scratch, FIRST_SPEC_OBJECT_TYPE); - DeoptimizeIf(lt, instr, Deoptimizer::kNotAJavaScriptObject); - - __ b(&result_in_receiver); - __ bind(&global_object); - __ LoadP(result, FieldMemOperand(function, JSFunction::kContextOffset)); - __ LoadP(result, ContextOperand(result, Context::GLOBAL_OBJECT_INDEX)); - __ LoadP(result, FieldMemOperand(result, GlobalObject::kGlobalProxyOffset)); - if (result.is(receiver)) { - __ bind(&result_in_receiver); - } else { - Label result_ok; - __ b(&result_ok); - __ bind(&result_in_receiver); - __ mr(result, receiver); - __ bind(&result_ok); - } -} - - -void LCodeGen::DoApplyArguments(LApplyArguments* instr) { - Register receiver = ToRegister(instr->receiver()); - Register function = ToRegister(instr->function()); - Register length = ToRegister(instr->length()); - Register elements = ToRegister(instr->elements()); - Register scratch = scratch0(); - DCHECK(receiver.is(r3)); // Used for parameter count. - DCHECK(function.is(r4)); // Required by InvokeFunction. - DCHECK(ToRegister(instr->result()).is(r3)); - - // Copy the arguments to this function possibly from the - // adaptor frame below it. - const uint32_t kArgumentsLimit = 1 * KB; - __ cmpli(length, Operand(kArgumentsLimit)); - DeoptimizeIf(gt, instr, Deoptimizer::kTooManyArguments); - - // Push the receiver and use the register to keep the original - // number of arguments. - __ push(receiver); - __ mr(receiver, length); - // The arguments are at a one pointer size offset from elements. - __ addi(elements, elements, Operand(1 * kPointerSize)); - - // Loop through the arguments pushing them onto the execution - // stack. - Label invoke, loop; - // length is a small non-negative integer, due to the test above. - __ cmpi(length, Operand::Zero()); - __ beq(&invoke); - __ mtctr(length); - __ bind(&loop); - __ ShiftLeftImm(r0, length, Operand(kPointerSizeLog2)); - __ LoadPX(scratch, MemOperand(elements, r0)); - __ push(scratch); - __ addi(length, length, Operand(-1)); - __ bdnz(&loop); - - __ bind(&invoke); - DCHECK(instr->HasPointerMap()); - LPointerMap* pointers = instr->pointer_map(); - SafepointGenerator safepoint_generator(this, pointers, Safepoint::kLazyDeopt); - // The number of arguments is stored in receiver which is r3, as expected - // by InvokeFunction. - ParameterCount actual(receiver); - __ InvokeFunction(function, actual, CALL_FUNCTION, safepoint_generator); -} - - -void LCodeGen::DoPushArgument(LPushArgument* instr) { - LOperand* argument = instr->value(); - if (argument->IsDoubleRegister() || argument->IsDoubleStackSlot()) { - Abort(kDoPushArgumentNotImplementedForDoubleType); - } else { - Register argument_reg = EmitLoadRegister(argument, ip); - __ push(argument_reg); - } -} - - -void LCodeGen::DoDrop(LDrop* instr) { __ Drop(instr->count()); } - - -void LCodeGen::DoThisFunction(LThisFunction* instr) { - Register result = ToRegister(instr->result()); - __ LoadP(result, MemOperand(fp, JavaScriptFrameConstants::kFunctionOffset)); -} - - -void LCodeGen::DoContext(LContext* instr) { - // If there is a non-return use, the context must be moved to a register. - Register result = ToRegister(instr->result()); - if (info()->IsOptimizing()) { - __ LoadP(result, MemOperand(fp, StandardFrameConstants::kContextOffset)); - } else { - // If there is no frame, the context must be in cp. - DCHECK(result.is(cp)); - } -} - - -void LCodeGen::DoDeclareGlobals(LDeclareGlobals* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - __ Move(scratch0(), instr->hydrogen()->pairs()); - __ push(scratch0()); - __ LoadSmiLiteral(scratch0(), Smi::FromInt(instr->hydrogen()->flags())); - __ push(scratch0()); - CallRuntime(Runtime::kDeclareGlobals, 2, instr); -} - - -void LCodeGen::CallKnownFunction(Handle<JSFunction> function, - int formal_parameter_count, int arity, - LInstruction* instr) { - bool dont_adapt_arguments = - formal_parameter_count == SharedFunctionInfo::kDontAdaptArgumentsSentinel; - bool can_invoke_directly = - dont_adapt_arguments || formal_parameter_count == arity; - - Register function_reg = r4; - - LPointerMap* pointers = instr->pointer_map(); - - if (can_invoke_directly) { - // Change context. - __ LoadP(cp, FieldMemOperand(function_reg, JSFunction::kContextOffset)); - - // Always initialize r3 to the number of actual arguments. - __ mov(r3, Operand(arity)); - - bool is_self_call = function.is_identical_to(info()->closure()); - - // Invoke function. - if (is_self_call) { - __ CallSelf(); - } else { - __ LoadP(ip, FieldMemOperand(function_reg, JSFunction::kCodeEntryOffset)); - __ CallJSEntry(ip); - } - - // Set up deoptimization. - RecordSafepointWithLazyDeopt(instr, RECORD_SIMPLE_SAFEPOINT); - } else { - SafepointGenerator generator(this, pointers, Safepoint::kLazyDeopt); - ParameterCount count(arity); - ParameterCount expected(formal_parameter_count); - __ InvokeFunction(function_reg, expected, count, CALL_FUNCTION, generator); - } -} - - -void LCodeGen::DoDeferredMathAbsTaggedHeapNumber(LMathAbs* instr) { - DCHECK(instr->context() != NULL); - DCHECK(ToRegister(instr->context()).is(cp)); - Register input = ToRegister(instr->value()); - Register result = ToRegister(instr->result()); - Register scratch = scratch0(); - - // Deoptimize if not a heap number. - __ LoadP(scratch, FieldMemOperand(input, HeapObject::kMapOffset)); - __ LoadRoot(ip, Heap::kHeapNumberMapRootIndex); - __ cmp(scratch, ip); - DeoptimizeIf(ne, instr, Deoptimizer::kNotAHeapNumber); - - Label done; - Register exponent = scratch0(); - scratch = no_reg; - __ lwz(exponent, FieldMemOperand(input, HeapNumber::kExponentOffset)); - // Check the sign of the argument. If the argument is positive, just - // return it. - __ cmpwi(exponent, Operand::Zero()); - // Move the input to the result if necessary. - __ Move(result, input); - __ bge(&done); - - // Input is negative. Reverse its sign. - // Preserve the value of all registers. - { - PushSafepointRegistersScope scope(this); - - // Registers were saved at the safepoint, so we can use - // many scratch registers. - Register tmp1 = input.is(r4) ? r3 : r4; - Register tmp2 = input.is(r5) ? r3 : r5; - Register tmp3 = input.is(r6) ? r3 : r6; - Register tmp4 = input.is(r7) ? r3 : r7; - - // exponent: floating point exponent value. - - Label allocated, slow; - __ LoadRoot(tmp4, Heap::kHeapNumberMapRootIndex); - __ AllocateHeapNumber(tmp1, tmp2, tmp3, tmp4, &slow); - __ b(&allocated); - - // Slow case: Call the runtime system to do the number allocation. - __ bind(&slow); - - CallRuntimeFromDeferred(Runtime::kAllocateHeapNumber, 0, instr, - instr->context()); - // Set the pointer to the new heap number in tmp. - if (!tmp1.is(r3)) __ mr(tmp1, r3); - // Restore input_reg after call to runtime. - __ LoadFromSafepointRegisterSlot(input, input); - __ lwz(exponent, FieldMemOperand(input, HeapNumber::kExponentOffset)); - - __ bind(&allocated); - // exponent: floating point exponent value. - // tmp1: allocated heap number. - STATIC_ASSERT(HeapNumber::kSignMask == 0x80000000u); - __ clrlwi(exponent, exponent, Operand(1)); // clear sign bit - __ stw(exponent, FieldMemOperand(tmp1, HeapNumber::kExponentOffset)); - __ lwz(tmp2, FieldMemOperand(input, HeapNumber::kMantissaOffset)); - __ stw(tmp2, FieldMemOperand(tmp1, HeapNumber::kMantissaOffset)); - - __ StoreToSafepointRegisterSlot(tmp1, result); - } - - __ bind(&done); -} - - -void LCodeGen::EmitMathAbs(LMathAbs* instr) { - Register input = ToRegister(instr->value()); - Register result = ToRegister(instr->result()); - Label done; - __ cmpi(input, Operand::Zero()); - __ Move(result, input); - __ bge(&done); - __ li(r0, Operand::Zero()); // clear xer - __ mtxer(r0); - __ neg(result, result, SetOE, SetRC); - // Deoptimize on overflow. - DeoptimizeIf(overflow, instr, Deoptimizer::kOverflow, cr0); - __ bind(&done); -} - - -#if V8_TARGET_ARCH_PPC64 -void LCodeGen::EmitInteger32MathAbs(LMathAbs* instr) { - Register input = ToRegister(instr->value()); - Register result = ToRegister(instr->result()); - Label done; - __ cmpwi(input, Operand::Zero()); - __ Move(result, input); - __ bge(&done); - - // Deoptimize on overflow. - __ lis(r0, Operand(SIGN_EXT_IMM16(0x8000))); - __ cmpw(input, r0); - DeoptimizeIf(eq, instr, Deoptimizer::kOverflow); - - __ neg(result, result); - __ bind(&done); -} -#endif - - -void LCodeGen::DoMathAbs(LMathAbs* instr) { - // Class for deferred case. - class DeferredMathAbsTaggedHeapNumber final : public LDeferredCode { - public: - DeferredMathAbsTaggedHeapNumber(LCodeGen* codegen, LMathAbs* instr) - : LDeferredCode(codegen), instr_(instr) {} - void Generate() override { - codegen()->DoDeferredMathAbsTaggedHeapNumber(instr_); - } - LInstruction* instr() override { return instr_; } - - private: - LMathAbs* instr_; - }; - - Representation r = instr->hydrogen()->value()->representation(); - if (r.IsDouble()) { - DoubleRegister input = ToDoubleRegister(instr->value()); - DoubleRegister result = ToDoubleRegister(instr->result()); - __ fabs(result, input); -#if V8_TARGET_ARCH_PPC64 - } else if (r.IsInteger32()) { - EmitInteger32MathAbs(instr); - } else if (r.IsSmi()) { -#else - } else if (r.IsSmiOrInteger32()) { -#endif - EmitMathAbs(instr); - } else { - // Representation is tagged. - DeferredMathAbsTaggedHeapNumber* deferred = - new (zone()) DeferredMathAbsTaggedHeapNumber(this, instr); - Register input = ToRegister(instr->value()); - // Smi check. - __ JumpIfNotSmi(input, deferred->entry()); - // If smi, handle it directly. - EmitMathAbs(instr); - __ bind(deferred->exit()); - } -} - - -void LCodeGen::DoMathFloor(LMathFloor* instr) { - DoubleRegister input = ToDoubleRegister(instr->value()); - Register result = ToRegister(instr->result()); - Register input_high = scratch0(); - Register scratch = ip; - Label done, exact; - - __ TryInt32Floor(result, input, input_high, scratch, double_scratch0(), &done, - &exact); - DeoptimizeIf(al, instr, Deoptimizer::kLostPrecisionOrNaN); - - __ bind(&exact); - if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) { - // Test for -0. - __ cmpi(result, Operand::Zero()); - __ bne(&done); - __ cmpwi(input_high, Operand::Zero()); - DeoptimizeIf(lt, instr, Deoptimizer::kMinusZero); - } - __ bind(&done); -} - - -void LCodeGen::DoMathRound(LMathRound* instr) { - DoubleRegister input = ToDoubleRegister(instr->value()); - Register result = ToRegister(instr->result()); - DoubleRegister double_scratch1 = ToDoubleRegister(instr->temp()); - DoubleRegister input_plus_dot_five = double_scratch1; - Register scratch1 = scratch0(); - Register scratch2 = ip; - DoubleRegister dot_five = double_scratch0(); - Label convert, done; - - __ LoadDoubleLiteral(dot_five, 0.5, r0); - __ fabs(double_scratch1, input); - __ fcmpu(double_scratch1, dot_five); - DeoptimizeIf(unordered, instr, Deoptimizer::kLostPrecisionOrNaN); - // If input is in [-0.5, -0], the result is -0. - // If input is in [+0, +0.5[, the result is +0. - // If the input is +0.5, the result is 1. - __ bgt(&convert); // Out of [-0.5, +0.5]. - if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) { -#if V8_TARGET_ARCH_PPC64 - __ MovDoubleToInt64(scratch1, input); -#else - __ MovDoubleHighToInt(scratch1, input); -#endif - __ cmpi(scratch1, Operand::Zero()); - // [-0.5, -0]. - DeoptimizeIf(lt, instr, Deoptimizer::kMinusZero); - } - __ fcmpu(input, dot_five); - if (CpuFeatures::IsSupported(ISELECT)) { - __ li(result, Operand(1)); - __ isel(lt, result, r0, result); - __ b(&done); - } else { - Label return_zero; - __ bne(&return_zero); - __ li(result, Operand(1)); // +0.5. - __ b(&done); - // Remaining cases: [+0, +0.5[ or [-0.5, +0.5[, depending on - // flag kBailoutOnMinusZero. - __ bind(&return_zero); - __ li(result, Operand::Zero()); - __ b(&done); - } - - __ bind(&convert); - __ fadd(input_plus_dot_five, input, dot_five); - // Reuse dot_five (double_scratch0) as we no longer need this value. - __ TryInt32Floor(result, input_plus_dot_five, scratch1, scratch2, - double_scratch0(), &done, &done); - DeoptimizeIf(al, instr, Deoptimizer::kLostPrecisionOrNaN); - __ bind(&done); -} - - -void LCodeGen::DoMathFround(LMathFround* instr) { - DoubleRegister input_reg = ToDoubleRegister(instr->value()); - DoubleRegister output_reg = ToDoubleRegister(instr->result()); - __ frsp(output_reg, input_reg); -} - - -void LCodeGen::DoMathSqrt(LMathSqrt* instr) { - DoubleRegister input = ToDoubleRegister(instr->value()); - DoubleRegister result = ToDoubleRegister(instr->result()); - __ fsqrt(result, input); -} - - -void LCodeGen::DoMathPowHalf(LMathPowHalf* instr) { - DoubleRegister input = ToDoubleRegister(instr->value()); - DoubleRegister result = ToDoubleRegister(instr->result()); - DoubleRegister temp = double_scratch0(); - - // Note that according to ECMA-262 15.8.2.13: - // Math.pow(-Infinity, 0.5) == Infinity - // Math.sqrt(-Infinity) == NaN - Label skip, done; - - __ LoadDoubleLiteral(temp, -V8_INFINITY, scratch0()); - __ fcmpu(input, temp); - __ bne(&skip); - __ fneg(result, temp); - __ b(&done); - - // Add +0 to convert -0 to +0. - __ bind(&skip); - __ fadd(result, input, kDoubleRegZero); - __ fsqrt(result, result); - __ bind(&done); -} - - -void LCodeGen::DoPower(LPower* instr) { - Representation exponent_type = instr->hydrogen()->right()->representation(); -// Having marked this as a call, we can use any registers. -// Just make sure that the input/output registers are the expected ones. - Register tagged_exponent = MathPowTaggedDescriptor::exponent(); - DCHECK(!instr->right()->IsDoubleRegister() || - ToDoubleRegister(instr->right()).is(d2)); - DCHECK(!instr->right()->IsRegister() || - ToRegister(instr->right()).is(tagged_exponent)); - DCHECK(ToDoubleRegister(instr->left()).is(d1)); - DCHECK(ToDoubleRegister(instr->result()).is(d3)); - - if (exponent_type.IsSmi()) { - MathPowStub stub(isolate(), MathPowStub::TAGGED); - __ CallStub(&stub); - } else if (exponent_type.IsTagged()) { - Label no_deopt; - __ JumpIfSmi(tagged_exponent, &no_deopt); - DCHECK(!r10.is(tagged_exponent)); - __ LoadP(r10, FieldMemOperand(tagged_exponent, HeapObject::kMapOffset)); - __ LoadRoot(ip, Heap::kHeapNumberMapRootIndex); - __ cmp(r10, ip); - DeoptimizeIf(ne, instr, Deoptimizer::kNotAHeapNumber); - __ bind(&no_deopt); - MathPowStub stub(isolate(), MathPowStub::TAGGED); - __ CallStub(&stub); - } else if (exponent_type.IsInteger32()) { - MathPowStub stub(isolate(), MathPowStub::INTEGER); - __ CallStub(&stub); - } else { - DCHECK(exponent_type.IsDouble()); - MathPowStub stub(isolate(), MathPowStub::DOUBLE); - __ CallStub(&stub); - } -} - - -void LCodeGen::DoMathExp(LMathExp* instr) { - DoubleRegister input = ToDoubleRegister(instr->value()); - DoubleRegister result = ToDoubleRegister(instr->result()); - DoubleRegister double_scratch1 = ToDoubleRegister(instr->double_temp()); - DoubleRegister double_scratch2 = double_scratch0(); - Register temp1 = ToRegister(instr->temp1()); - Register temp2 = ToRegister(instr->temp2()); - - MathExpGenerator::EmitMathExp(masm(), input, result, double_scratch1, - double_scratch2, temp1, temp2, scratch0()); -} - - -void LCodeGen::DoMathLog(LMathLog* instr) { - __ PrepareCallCFunction(0, 1, scratch0()); - __ MovToFloatParameter(ToDoubleRegister(instr->value())); - __ CallCFunction(ExternalReference::math_log_double_function(isolate()), 0, - 1); - __ MovFromFloatResult(ToDoubleRegister(instr->result())); -} - - -void LCodeGen::DoMathClz32(LMathClz32* instr) { - Register input = ToRegister(instr->value()); - Register result = ToRegister(instr->result()); - __ cntlzw_(result, input); -} - - -void LCodeGen::DoInvokeFunction(LInvokeFunction* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->function()).is(r4)); - DCHECK(instr->HasPointerMap()); - - Handle<JSFunction> known_function = instr->hydrogen()->known_function(); - if (known_function.is_null()) { - LPointerMap* pointers = instr->pointer_map(); - SafepointGenerator generator(this, pointers, Safepoint::kLazyDeopt); - ParameterCount count(instr->arity()); - __ InvokeFunction(r4, count, CALL_FUNCTION, generator); - } else { - CallKnownFunction(known_function, - instr->hydrogen()->formal_parameter_count(), - instr->arity(), instr); - } -} - - -void LCodeGen::DoCallWithDescriptor(LCallWithDescriptor* instr) { - DCHECK(ToRegister(instr->result()).is(r3)); - - if (instr->hydrogen()->IsTailCall()) { - if (NeedsEagerFrame()) __ LeaveFrame(StackFrame::INTERNAL); - - if (instr->target()->IsConstantOperand()) { - LConstantOperand* target = LConstantOperand::cast(instr->target()); - Handle<Code> code = Handle<Code>::cast(ToHandle(target)); - __ Jump(code, RelocInfo::CODE_TARGET); - } else { - DCHECK(instr->target()->IsRegister()); - Register target = ToRegister(instr->target()); - __ addi(ip, target, Operand(Code::kHeaderSize - kHeapObjectTag)); - __ JumpToJSEntry(ip); - } - } else { - LPointerMap* pointers = instr->pointer_map(); - SafepointGenerator generator(this, pointers, Safepoint::kLazyDeopt); - - if (instr->target()->IsConstantOperand()) { - LConstantOperand* target = LConstantOperand::cast(instr->target()); - Handle<Code> code = Handle<Code>::cast(ToHandle(target)); - generator.BeforeCall(__ CallSize(code, RelocInfo::CODE_TARGET)); - __ Call(code, RelocInfo::CODE_TARGET); - } else { - DCHECK(instr->target()->IsRegister()); - Register target = ToRegister(instr->target()); - generator.BeforeCall(__ CallSize(target)); - __ addi(ip, target, Operand(Code::kHeaderSize - kHeapObjectTag)); - __ CallJSEntry(ip); - } - generator.AfterCall(); - } -} - - -void LCodeGen::DoCallJSFunction(LCallJSFunction* instr) { - DCHECK(ToRegister(instr->function()).is(r4)); - DCHECK(ToRegister(instr->result()).is(r3)); - - __ mov(r3, Operand(instr->arity())); - - // Change context. - __ LoadP(cp, FieldMemOperand(r4, JSFunction::kContextOffset)); - - bool is_self_call = false; - if (instr->hydrogen()->function()->IsConstant()) { - HConstant* fun_const = HConstant::cast(instr->hydrogen()->function()); - Handle<JSFunction> jsfun = - Handle<JSFunction>::cast(fun_const->handle(isolate())); - is_self_call = jsfun.is_identical_to(info()->closure()); - } - - if (is_self_call) { - __ CallSelf(); - } else { - __ LoadP(ip, FieldMemOperand(r4, JSFunction::kCodeEntryOffset)); - __ CallJSEntry(ip); - } - - RecordSafepointWithLazyDeopt(instr, RECORD_SIMPLE_SAFEPOINT); -} - - -void LCodeGen::DoCallFunction(LCallFunction* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->function()).is(r4)); - DCHECK(ToRegister(instr->result()).is(r3)); - - int arity = instr->arity(); - CallFunctionFlags flags = instr->hydrogen()->function_flags(); - if (instr->hydrogen()->HasVectorAndSlot()) { - Register slot_register = ToRegister(instr->temp_slot()); - Register vector_register = ToRegister(instr->temp_vector()); - DCHECK(slot_register.is(r6)); - DCHECK(vector_register.is(r5)); - - AllowDeferredHandleDereference vector_structure_check; - Handle<TypeFeedbackVector> vector = instr->hydrogen()->feedback_vector(); - int index = vector->GetIndex(instr->hydrogen()->slot()); - - __ Move(vector_register, vector); - __ LoadSmiLiteral(slot_register, Smi::FromInt(index)); - - CallICState::CallType call_type = - (flags & CALL_AS_METHOD) ? CallICState::METHOD : CallICState::FUNCTION; - - Handle<Code> ic = - CodeFactory::CallICInOptimizedCode(isolate(), arity, call_type).code(); - CallCode(ic, RelocInfo::CODE_TARGET, instr); - } else { - CallFunctionStub stub(isolate(), arity, flags); - CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); - } -} - - -void LCodeGen::DoCallNew(LCallNew* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->constructor()).is(r4)); - DCHECK(ToRegister(instr->result()).is(r3)); - - __ mov(r3, Operand(instr->arity())); - // No cell in r5 for construct type feedback in optimized code - __ LoadRoot(r5, Heap::kUndefinedValueRootIndex); - CallConstructStub stub(isolate(), NO_CALL_CONSTRUCTOR_FLAGS); - CallCode(stub.GetCode(), RelocInfo::CONSTRUCT_CALL, instr); -} - - -void LCodeGen::DoCallNewArray(LCallNewArray* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->constructor()).is(r4)); - DCHECK(ToRegister(instr->result()).is(r3)); - - __ mov(r3, Operand(instr->arity())); - if (instr->arity() == 1) { - // We only need the allocation site for the case we have a length argument. - // The case may bail out to the runtime, which will determine the correct - // elements kind with the site. - __ Move(r5, instr->hydrogen()->site()); - } else { - __ LoadRoot(r5, Heap::kUndefinedValueRootIndex); - } - ElementsKind kind = instr->hydrogen()->elements_kind(); - AllocationSiteOverrideMode override_mode = - (AllocationSite::GetMode(kind) == TRACK_ALLOCATION_SITE) - ? DISABLE_ALLOCATION_SITES - : DONT_OVERRIDE; - - if (instr->arity() == 0) { - ArrayNoArgumentConstructorStub stub(isolate(), kind, override_mode); - CallCode(stub.GetCode(), RelocInfo::CONSTRUCT_CALL, instr); - } else if (instr->arity() == 1) { - Label done; - if (IsFastPackedElementsKind(kind)) { - Label packed_case; - // We might need a change here - // look at the first argument - __ LoadP(r8, MemOperand(sp, 0)); - __ cmpi(r8, Operand::Zero()); - __ beq(&packed_case); - - ElementsKind holey_kind = GetHoleyElementsKind(kind); - ArraySingleArgumentConstructorStub stub(isolate(), holey_kind, - override_mode); - CallCode(stub.GetCode(), RelocInfo::CONSTRUCT_CALL, instr); - __ b(&done); - __ bind(&packed_case); - } - - ArraySingleArgumentConstructorStub stub(isolate(), kind, override_mode); - CallCode(stub.GetCode(), RelocInfo::CONSTRUCT_CALL, instr); - __ bind(&done); - } else { - ArrayNArgumentsConstructorStub stub(isolate(), kind, override_mode); - CallCode(stub.GetCode(), RelocInfo::CONSTRUCT_CALL, instr); - } -} - - -void LCodeGen::DoCallRuntime(LCallRuntime* instr) { - CallRuntime(instr->function(), instr->arity(), instr); -} - - -void LCodeGen::DoStoreCodeEntry(LStoreCodeEntry* instr) { - Register function = ToRegister(instr->function()); - Register code_object = ToRegister(instr->code_object()); - __ addi(code_object, code_object, - Operand(Code::kHeaderSize - kHeapObjectTag)); - __ StoreP(code_object, - FieldMemOperand(function, JSFunction::kCodeEntryOffset), r0); -} - - -void LCodeGen::DoInnerAllocatedObject(LInnerAllocatedObject* instr) { - Register result = ToRegister(instr->result()); - Register base = ToRegister(instr->base_object()); - if (instr->offset()->IsConstantOperand()) { - LConstantOperand* offset = LConstantOperand::cast(instr->offset()); - __ Add(result, base, ToInteger32(offset), r0); - } else { - Register offset = ToRegister(instr->offset()); - __ add(result, base, offset); - } -} - - -void LCodeGen::DoStoreNamedField(LStoreNamedField* instr) { - HStoreNamedField* hinstr = instr->hydrogen(); - Representation representation = instr->representation(); - - Register object = ToRegister(instr->object()); - Register scratch = scratch0(); - HObjectAccess access = hinstr->access(); - int offset = access.offset(); - - if (access.IsExternalMemory()) { - Register value = ToRegister(instr->value()); - MemOperand operand = MemOperand(object, offset); - __ StoreRepresentation(value, operand, representation, r0); - return; - } - - __ AssertNotSmi(object); - -#if V8_TARGET_ARCH_PPC64 - DCHECK(!representation.IsSmi() || !instr->value()->IsConstantOperand() || - IsInteger32(LConstantOperand::cast(instr->value()))); -#else - DCHECK(!representation.IsSmi() || !instr->value()->IsConstantOperand() || - IsSmi(LConstantOperand::cast(instr->value()))); -#endif - if (!FLAG_unbox_double_fields && representation.IsDouble()) { - DCHECK(access.IsInobject()); - DCHECK(!hinstr->has_transition()); - DCHECK(!hinstr->NeedsWriteBarrier()); - DoubleRegister value = ToDoubleRegister(instr->value()); - __ stfd(value, FieldMemOperand(object, offset)); - return; - } - - if (hinstr->has_transition()) { - Handle<Map> transition = hinstr->transition_map(); - AddDeprecationDependency(transition); - __ mov(scratch, Operand(transition)); - __ StoreP(scratch, FieldMemOperand(object, HeapObject::kMapOffset), r0); - if (hinstr->NeedsWriteBarrierForMap()) { - Register temp = ToRegister(instr->temp()); - // Update the write barrier for the map field. - __ RecordWriteForMap(object, scratch, temp, GetLinkRegisterState(), - kSaveFPRegs); - } - } - - // Do the store. - Register record_dest = object; - Register record_value = no_reg; - Register record_scratch = scratch; -#if V8_TARGET_ARCH_PPC64 - if (FLAG_unbox_double_fields && representation.IsDouble()) { - DCHECK(access.IsInobject()); - DoubleRegister value = ToDoubleRegister(instr->value()); - __ stfd(value, FieldMemOperand(object, offset)); - if (hinstr->NeedsWriteBarrier()) { - record_value = ToRegister(instr->value()); - } - } else { - if (representation.IsSmi() && - hinstr->value()->representation().IsInteger32()) { - DCHECK(hinstr->store_mode() == STORE_TO_INITIALIZED_ENTRY); - // 64-bit Smi optimization - // Store int value directly to upper half of the smi. - offset = SmiWordOffset(offset); - representation = Representation::Integer32(); - } -#endif - if (access.IsInobject()) { - Register value = ToRegister(instr->value()); - MemOperand operand = FieldMemOperand(object, offset); - __ StoreRepresentation(value, operand, representation, r0); - record_value = value; - } else { - Register value = ToRegister(instr->value()); - __ LoadP(scratch, FieldMemOperand(object, JSObject::kPropertiesOffset)); - MemOperand operand = FieldMemOperand(scratch, offset); - __ StoreRepresentation(value, operand, representation, r0); - record_dest = scratch; - record_value = value; - record_scratch = object; - } -#if V8_TARGET_ARCH_PPC64 - } -#endif - - if (hinstr->NeedsWriteBarrier()) { - __ RecordWriteField(record_dest, offset, record_value, record_scratch, - GetLinkRegisterState(), kSaveFPRegs, - EMIT_REMEMBERED_SET, hinstr->SmiCheckForWriteBarrier(), - hinstr->PointersToHereCheckForValue()); - } -} - - -void LCodeGen::DoStoreNamedGeneric(LStoreNamedGeneric* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->object()).is(StoreDescriptor::ReceiverRegister())); - DCHECK(ToRegister(instr->value()).is(StoreDescriptor::ValueRegister())); - - if (instr->hydrogen()->HasVectorAndSlot()) { - EmitVectorStoreICRegisters<LStoreNamedGeneric>(instr); - } - - __ mov(StoreDescriptor::NameRegister(), Operand(instr->name())); - Handle<Code> ic = CodeFactory::StoreICInOptimizedCode( - isolate(), instr->language_mode(), - instr->hydrogen()->initialization_state()).code(); - CallCode(ic, RelocInfo::CODE_TARGET, instr); -} - - -void LCodeGen::DoStoreGlobalViaContext(LStoreGlobalViaContext* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->value()) - .is(StoreGlobalViaContextDescriptor::ValueRegister())); - - int const slot = instr->slot_index(); - int const depth = instr->depth(); - if (depth <= StoreGlobalViaContextStub::kMaximumDepth) { - __ mov(StoreGlobalViaContextDescriptor::SlotRegister(), Operand(slot)); - Handle<Code> stub = CodeFactory::StoreGlobalViaContext( - isolate(), depth, instr->language_mode()).code(); - CallCode(stub, RelocInfo::CODE_TARGET, instr); - } else { - __ Push(Smi::FromInt(slot)); - __ push(StoreGlobalViaContextDescriptor::ValueRegister()); - __ CallRuntime(is_strict(instr->language_mode()) - ? Runtime::kStoreGlobalViaContext_Strict - : Runtime::kStoreGlobalViaContext_Sloppy, - 2); - } -} - - -void LCodeGen::DoBoundsCheck(LBoundsCheck* instr) { - Representation representation = instr->hydrogen()->length()->representation(); - DCHECK(representation.Equals(instr->hydrogen()->index()->representation())); - DCHECK(representation.IsSmiOrInteger32()); - - Condition cc = instr->hydrogen()->allow_equality() ? lt : le; - if (instr->length()->IsConstantOperand()) { - int32_t length = ToInteger32(LConstantOperand::cast(instr->length())); - Register index = ToRegister(instr->index()); - if (representation.IsSmi()) { - __ Cmpli(index, Operand(Smi::FromInt(length)), r0); - } else { - __ Cmplwi(index, Operand(length), r0); - } - cc = CommuteCondition(cc); - } else if (instr->index()->IsConstantOperand()) { - int32_t index = ToInteger32(LConstantOperand::cast(instr->index())); - Register length = ToRegister(instr->length()); - if (representation.IsSmi()) { - __ Cmpli(length, Operand(Smi::FromInt(index)), r0); - } else { - __ Cmplwi(length, Operand(index), r0); - } - } else { - Register index = ToRegister(instr->index()); - Register length = ToRegister(instr->length()); - if (representation.IsSmi()) { - __ cmpl(length, index); - } else { - __ cmplw(length, index); - } - } - if (FLAG_debug_code && instr->hydrogen()->skip_check()) { - Label done; - __ b(NegateCondition(cc), &done); - __ stop("eliminated bounds check failed"); - __ bind(&done); - } else { - DeoptimizeIf(cc, instr, Deoptimizer::kOutOfBounds); - } -} - - -void LCodeGen::DoStoreKeyedExternalArray(LStoreKeyed* instr) { - Register external_pointer = ToRegister(instr->elements()); - Register key = no_reg; - ElementsKind elements_kind = instr->elements_kind(); - bool key_is_constant = instr->key()->IsConstantOperand(); - int constant_key = 0; - if (key_is_constant) { - constant_key = ToInteger32(LConstantOperand::cast(instr->key())); - if (constant_key & 0xF0000000) { - Abort(kArrayIndexConstantValueTooBig); - } - } else { - key = ToRegister(instr->key()); - } - int element_size_shift = ElementsKindToShiftSize(elements_kind); - bool key_is_smi = instr->hydrogen()->key()->representation().IsSmi(); - int base_offset = instr->base_offset(); - - if (elements_kind == FLOAT32_ELEMENTS || elements_kind == FLOAT64_ELEMENTS) { - Register address = scratch0(); - DoubleRegister value(ToDoubleRegister(instr->value())); - if (key_is_constant) { - if (constant_key != 0) { - __ Add(address, external_pointer, constant_key << element_size_shift, - r0); - } else { - address = external_pointer; - } - } else { - __ IndexToArrayOffset(r0, key, element_size_shift, key_is_smi); - __ add(address, external_pointer, r0); - } - if (elements_kind == FLOAT32_ELEMENTS) { - __ frsp(double_scratch0(), value); - __ stfs(double_scratch0(), MemOperand(address, base_offset)); - } else { // Storing doubles, not floats. - __ stfd(value, MemOperand(address, base_offset)); - } - } else { - Register value(ToRegister(instr->value())); - MemOperand mem_operand = - PrepareKeyedOperand(key, external_pointer, key_is_constant, key_is_smi, - constant_key, element_size_shift, base_offset); - switch (elements_kind) { - case UINT8_ELEMENTS: - case UINT8_CLAMPED_ELEMENTS: - case INT8_ELEMENTS: - if (key_is_constant) { - __ StoreByte(value, mem_operand, r0); - } else { - __ stbx(value, mem_operand); - } - break; - case INT16_ELEMENTS: - case UINT16_ELEMENTS: - if (key_is_constant) { - __ StoreHalfWord(value, mem_operand, r0); - } else { - __ sthx(value, mem_operand); - } - break; - case INT32_ELEMENTS: - case UINT32_ELEMENTS: - if (key_is_constant) { - __ StoreWord(value, mem_operand, r0); - } else { - __ stwx(value, mem_operand); - } - break; - case FLOAT32_ELEMENTS: - case FLOAT64_ELEMENTS: - case FAST_DOUBLE_ELEMENTS: - case FAST_ELEMENTS: - case FAST_SMI_ELEMENTS: - case FAST_HOLEY_DOUBLE_ELEMENTS: - case FAST_HOLEY_ELEMENTS: - case FAST_HOLEY_SMI_ELEMENTS: - case DICTIONARY_ELEMENTS: - case FAST_SLOPPY_ARGUMENTS_ELEMENTS: - case SLOW_SLOPPY_ARGUMENTS_ELEMENTS: - UNREACHABLE(); - break; - } - } -} - - -void LCodeGen::DoStoreKeyedFixedDoubleArray(LStoreKeyed* instr) { - DoubleRegister value = ToDoubleRegister(instr->value()); - Register elements = ToRegister(instr->elements()); - Register key = no_reg; - Register scratch = scratch0(); - DoubleRegister double_scratch = double_scratch0(); - bool key_is_constant = instr->key()->IsConstantOperand(); - int constant_key = 0; - - // Calculate the effective address of the slot in the array to store the - // double value. - if (key_is_constant) { - constant_key = ToInteger32(LConstantOperand::cast(instr->key())); - if (constant_key & 0xF0000000) { - Abort(kArrayIndexConstantValueTooBig); - } - } else { - key = ToRegister(instr->key()); - } - int element_size_shift = ElementsKindToShiftSize(FAST_DOUBLE_ELEMENTS); - bool key_is_smi = instr->hydrogen()->key()->representation().IsSmi(); - int base_offset = instr->base_offset() + constant_key * kDoubleSize; - if (!key_is_constant) { - __ IndexToArrayOffset(scratch, key, element_size_shift, key_is_smi); - __ add(scratch, elements, scratch); - elements = scratch; - } - if (!is_int16(base_offset)) { - __ Add(scratch, elements, base_offset, r0); - base_offset = 0; - elements = scratch; - } - - if (instr->NeedsCanonicalization()) { - // Turn potential sNaN value into qNaN. - __ CanonicalizeNaN(double_scratch, value); - __ stfd(double_scratch, MemOperand(elements, base_offset)); - } else { - __ stfd(value, MemOperand(elements, base_offset)); - } -} - - -void LCodeGen::DoStoreKeyedFixedArray(LStoreKeyed* instr) { - HStoreKeyed* hinstr = instr->hydrogen(); - Register value = ToRegister(instr->value()); - Register elements = ToRegister(instr->elements()); - Register key = instr->key()->IsRegister() ? ToRegister(instr->key()) : no_reg; - Register scratch = scratch0(); - Register store_base = scratch; - int offset = instr->base_offset(); - - // Do the store. - if (instr->key()->IsConstantOperand()) { - DCHECK(!hinstr->NeedsWriteBarrier()); - LConstantOperand* const_operand = LConstantOperand::cast(instr->key()); - offset += ToInteger32(const_operand) * kPointerSize; - store_base = elements; - } else { - // Even though the HLoadKeyed instruction forces the input - // representation for the key to be an integer, the input gets replaced - // during bound check elimination with the index argument to the bounds - // check, which can be tagged, so that case must be handled here, too. - if (hinstr->key()->representation().IsSmi()) { - __ SmiToPtrArrayOffset(scratch, key); - } else { - __ ShiftLeftImm(scratch, key, Operand(kPointerSizeLog2)); - } - __ add(scratch, elements, scratch); - } - - Representation representation = hinstr->value()->representation(); - -#if V8_TARGET_ARCH_PPC64 - // 64-bit Smi optimization - if (representation.IsInteger32()) { - DCHECK(hinstr->store_mode() == STORE_TO_INITIALIZED_ENTRY); - DCHECK(hinstr->elements_kind() == FAST_SMI_ELEMENTS); - // Store int value directly to upper half of the smi. - offset = SmiWordOffset(offset); - } -#endif - - __ StoreRepresentation(value, MemOperand(store_base, offset), representation, - r0); - - if (hinstr->NeedsWriteBarrier()) { - SmiCheck check_needed = hinstr->value()->type().IsHeapObject() - ? OMIT_SMI_CHECK - : INLINE_SMI_CHECK; - // Compute address of modified element and store it into key register. - __ Add(key, store_base, offset, r0); - __ RecordWrite(elements, key, value, GetLinkRegisterState(), kSaveFPRegs, - EMIT_REMEMBERED_SET, check_needed, - hinstr->PointersToHereCheckForValue()); - } -} - - -void LCodeGen::DoStoreKeyed(LStoreKeyed* instr) { - // By cases: external, fast double - if (instr->is_fixed_typed_array()) { - DoStoreKeyedExternalArray(instr); - } else if (instr->hydrogen()->value()->representation().IsDouble()) { - DoStoreKeyedFixedDoubleArray(instr); - } else { - DoStoreKeyedFixedArray(instr); - } -} - - -void LCodeGen::DoStoreKeyedGeneric(LStoreKeyedGeneric* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->object()).is(StoreDescriptor::ReceiverRegister())); - DCHECK(ToRegister(instr->key()).is(StoreDescriptor::NameRegister())); - DCHECK(ToRegister(instr->value()).is(StoreDescriptor::ValueRegister())); - - if (instr->hydrogen()->HasVectorAndSlot()) { - EmitVectorStoreICRegisters<LStoreKeyedGeneric>(instr); - } - - Handle<Code> ic = CodeFactory::KeyedStoreICInOptimizedCode( - isolate(), instr->language_mode(), - instr->hydrogen()->initialization_state()).code(); - CallCode(ic, RelocInfo::CODE_TARGET, instr); -} - - -void LCodeGen::DoMaybeGrowElements(LMaybeGrowElements* instr) { - class DeferredMaybeGrowElements final : public LDeferredCode { - public: - DeferredMaybeGrowElements(LCodeGen* codegen, LMaybeGrowElements* instr) - : LDeferredCode(codegen), instr_(instr) {} - void Generate() override { codegen()->DoDeferredMaybeGrowElements(instr_); } - LInstruction* instr() override { return instr_; } - - private: - LMaybeGrowElements* instr_; - }; - - Register result = r3; - DeferredMaybeGrowElements* deferred = - new (zone()) DeferredMaybeGrowElements(this, instr); - LOperand* key = instr->key(); - LOperand* current_capacity = instr->current_capacity(); - - DCHECK(instr->hydrogen()->key()->representation().IsInteger32()); - DCHECK(instr->hydrogen()->current_capacity()->representation().IsInteger32()); - DCHECK(key->IsConstantOperand() || key->IsRegister()); - DCHECK(current_capacity->IsConstantOperand() || - current_capacity->IsRegister()); - - if (key->IsConstantOperand() && current_capacity->IsConstantOperand()) { - int32_t constant_key = ToInteger32(LConstantOperand::cast(key)); - int32_t constant_capacity = - ToInteger32(LConstantOperand::cast(current_capacity)); - if (constant_key >= constant_capacity) { - // Deferred case. - __ b(deferred->entry()); - } - } else if (key->IsConstantOperand()) { - int32_t constant_key = ToInteger32(LConstantOperand::cast(key)); - __ Cmpwi(ToRegister(current_capacity), Operand(constant_key), r0); - __ ble(deferred->entry()); - } else if (current_capacity->IsConstantOperand()) { - int32_t constant_capacity = - ToInteger32(LConstantOperand::cast(current_capacity)); - __ Cmpwi(ToRegister(key), Operand(constant_capacity), r0); - __ bge(deferred->entry()); - } else { - __ cmpw(ToRegister(key), ToRegister(current_capacity)); - __ bge(deferred->entry()); - } - - if (instr->elements()->IsRegister()) { - __ Move(result, ToRegister(instr->elements())); - } else { - __ LoadP(result, ToMemOperand(instr->elements())); - } - - __ bind(deferred->exit()); -} - - -void LCodeGen::DoDeferredMaybeGrowElements(LMaybeGrowElements* instr) { - // TODO(3095996): Get rid of this. For now, we need to make the - // result register contain a valid pointer because it is already - // contained in the register pointer map. - Register result = r3; - __ li(result, Operand::Zero()); - - // We have to call a stub. - { - PushSafepointRegistersScope scope(this); - if (instr->object()->IsRegister()) { - __ Move(result, ToRegister(instr->object())); - } else { - __ LoadP(result, ToMemOperand(instr->object())); - } - - LOperand* key = instr->key(); - if (key->IsConstantOperand()) { - __ LoadSmiLiteral(r6, ToSmi(LConstantOperand::cast(key))); - } else { - __ SmiTag(r6, ToRegister(key)); - } - - GrowArrayElementsStub stub(isolate(), instr->hydrogen()->is_js_array(), - instr->hydrogen()->kind()); - __ CallStub(&stub); - RecordSafepointWithLazyDeopt( - instr, RECORD_SAFEPOINT_WITH_REGISTERS_AND_NO_ARGUMENTS); - __ StoreToSafepointRegisterSlot(result, result); - } - - // Deopt on smi, which means the elements array changed to dictionary mode. - __ TestIfSmi(result, r0); - DeoptimizeIf(eq, instr, Deoptimizer::kSmi, cr0); -} - - -void LCodeGen::DoTransitionElementsKind(LTransitionElementsKind* instr) { - Register object_reg = ToRegister(instr->object()); - Register scratch = scratch0(); - - Handle<Map> from_map = instr->original_map(); - Handle<Map> to_map = instr->transitioned_map(); - ElementsKind from_kind = instr->from_kind(); - ElementsKind to_kind = instr->to_kind(); - - Label not_applicable; - __ LoadP(scratch, FieldMemOperand(object_reg, HeapObject::kMapOffset)); - __ Cmpi(scratch, Operand(from_map), r0); - __ bne(¬_applicable); - - if (IsSimpleMapChangeTransition(from_kind, to_kind)) { - Register new_map_reg = ToRegister(instr->new_map_temp()); - __ mov(new_map_reg, Operand(to_map)); - __ StoreP(new_map_reg, FieldMemOperand(object_reg, HeapObject::kMapOffset), - r0); - // Write barrier. - __ RecordWriteForMap(object_reg, new_map_reg, scratch, - GetLinkRegisterState(), kDontSaveFPRegs); - } else { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(object_reg.is(r3)); - PushSafepointRegistersScope scope(this); - __ Move(r4, to_map); - bool is_js_array = from_map->instance_type() == JS_ARRAY_TYPE; - TransitionElementsKindStub stub(isolate(), from_kind, to_kind, is_js_array); - __ CallStub(&stub); - RecordSafepointWithRegisters(instr->pointer_map(), 0, - Safepoint::kLazyDeopt); - } - __ bind(¬_applicable); -} - - -void LCodeGen::DoTrapAllocationMemento(LTrapAllocationMemento* instr) { - Register object = ToRegister(instr->object()); - Register temp = ToRegister(instr->temp()); - Label no_memento_found; - __ TestJSArrayForAllocationMemento(object, temp, &no_memento_found); - DeoptimizeIf(eq, instr, Deoptimizer::kMementoFound); - __ bind(&no_memento_found); -} - - -void LCodeGen::DoStringAdd(LStringAdd* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - DCHECK(ToRegister(instr->left()).is(r4)); - DCHECK(ToRegister(instr->right()).is(r3)); - StringAddStub stub(isolate(), instr->hydrogen()->flags(), - instr->hydrogen()->pretenure_flag()); - CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); -} - - -void LCodeGen::DoStringCharCodeAt(LStringCharCodeAt* instr) { - class DeferredStringCharCodeAt final : public LDeferredCode { - public: - DeferredStringCharCodeAt(LCodeGen* codegen, LStringCharCodeAt* instr) - : LDeferredCode(codegen), instr_(instr) {} - void Generate() override { codegen()->DoDeferredStringCharCodeAt(instr_); } - LInstruction* instr() override { return instr_; } - - private: - LStringCharCodeAt* instr_; - }; - - DeferredStringCharCodeAt* deferred = - new (zone()) DeferredStringCharCodeAt(this, instr); - - StringCharLoadGenerator::Generate( - masm(), ToRegister(instr->string()), ToRegister(instr->index()), - ToRegister(instr->result()), deferred->entry()); - __ bind(deferred->exit()); -} - - -void LCodeGen::DoDeferredStringCharCodeAt(LStringCharCodeAt* instr) { - Register string = ToRegister(instr->string()); - Register result = ToRegister(instr->result()); - Register scratch = scratch0(); - - // TODO(3095996): Get rid of this. For now, we need to make the - // result register contain a valid pointer because it is already - // contained in the register pointer map. - __ li(result, Operand::Zero()); - - PushSafepointRegistersScope scope(this); - __ push(string); - // Push the index as a smi. This is safe because of the checks in - // DoStringCharCodeAt above. - if (instr->index()->IsConstantOperand()) { - int const_index = ToInteger32(LConstantOperand::cast(instr->index())); - __ LoadSmiLiteral(scratch, Smi::FromInt(const_index)); - __ push(scratch); - } else { - Register index = ToRegister(instr->index()); - __ SmiTag(index); - __ push(index); - } - CallRuntimeFromDeferred(Runtime::kStringCharCodeAtRT, 2, instr, - instr->context()); - __ AssertSmi(r3); - __ SmiUntag(r3); - __ StoreToSafepointRegisterSlot(r3, result); -} - - -void LCodeGen::DoStringCharFromCode(LStringCharFromCode* instr) { - class DeferredStringCharFromCode final : public LDeferredCode { - public: - DeferredStringCharFromCode(LCodeGen* codegen, LStringCharFromCode* instr) - : LDeferredCode(codegen), instr_(instr) {} - void Generate() override { - codegen()->DoDeferredStringCharFromCode(instr_); - } - LInstruction* instr() override { return instr_; } - - private: - LStringCharFromCode* instr_; - }; - - DeferredStringCharFromCode* deferred = - new (zone()) DeferredStringCharFromCode(this, instr); - - DCHECK(instr->hydrogen()->value()->representation().IsInteger32()); - Register char_code = ToRegister(instr->char_code()); - Register result = ToRegister(instr->result()); - DCHECK(!char_code.is(result)); - - __ cmpli(char_code, Operand(String::kMaxOneByteCharCode)); - __ bgt(deferred->entry()); - __ LoadRoot(result, Heap::kSingleCharacterStringCacheRootIndex); - __ ShiftLeftImm(r0, char_code, Operand(kPointerSizeLog2)); - __ add(result, result, r0); - __ LoadP(result, FieldMemOperand(result, FixedArray::kHeaderSize)); - __ LoadRoot(ip, Heap::kUndefinedValueRootIndex); - __ cmp(result, ip); - __ beq(deferred->entry()); - __ bind(deferred->exit()); -} - - -void LCodeGen::DoDeferredStringCharFromCode(LStringCharFromCode* instr) { - Register char_code = ToRegister(instr->char_code()); - Register result = ToRegister(instr->result()); - - // TODO(3095996): Get rid of this. For now, we need to make the - // result register contain a valid pointer because it is already - // contained in the register pointer map. - __ li(result, Operand::Zero()); - - PushSafepointRegistersScope scope(this); - __ SmiTag(char_code); - __ push(char_code); - CallRuntimeFromDeferred(Runtime::kCharFromCode, 1, instr, instr->context()); - __ StoreToSafepointRegisterSlot(r3, result); -} - - -void LCodeGen::DoInteger32ToDouble(LInteger32ToDouble* instr) { - LOperand* input = instr->value(); - DCHECK(input->IsRegister() || input->IsStackSlot()); - LOperand* output = instr->result(); - DCHECK(output->IsDoubleRegister()); - if (input->IsStackSlot()) { - Register scratch = scratch0(); - __ LoadP(scratch, ToMemOperand(input)); - __ ConvertIntToDouble(scratch, ToDoubleRegister(output)); - } else { - __ ConvertIntToDouble(ToRegister(input), ToDoubleRegister(output)); - } -} - - -void LCodeGen::DoUint32ToDouble(LUint32ToDouble* instr) { - LOperand* input = instr->value(); - LOperand* output = instr->result(); - __ ConvertUnsignedIntToDouble(ToRegister(input), ToDoubleRegister(output)); -} - - -void LCodeGen::DoNumberTagI(LNumberTagI* instr) { - class DeferredNumberTagI final : public LDeferredCode { - public: - DeferredNumberTagI(LCodeGen* codegen, LNumberTagI* instr) - : LDeferredCode(codegen), instr_(instr) {} - void Generate() override { - codegen()->DoDeferredNumberTagIU(instr_, instr_->value(), instr_->temp1(), - instr_->temp2(), SIGNED_INT32); - } - LInstruction* instr() override { return instr_; } - - private: - LNumberTagI* instr_; - }; - - Register src = ToRegister(instr->value()); - Register dst = ToRegister(instr->result()); - - DeferredNumberTagI* deferred = new (zone()) DeferredNumberTagI(this, instr); -#if V8_TARGET_ARCH_PPC64 - __ SmiTag(dst, src); -#else - __ SmiTagCheckOverflow(dst, src, r0); - __ BranchOnOverflow(deferred->entry()); -#endif - __ bind(deferred->exit()); -} - - -void LCodeGen::DoNumberTagU(LNumberTagU* instr) { - class DeferredNumberTagU final : public LDeferredCode { - public: - DeferredNumberTagU(LCodeGen* codegen, LNumberTagU* instr) - : LDeferredCode(codegen), instr_(instr) {} - void Generate() override { - codegen()->DoDeferredNumberTagIU(instr_, instr_->value(), instr_->temp1(), - instr_->temp2(), UNSIGNED_INT32); - } - LInstruction* instr() override { return instr_; } - - private: - LNumberTagU* instr_; - }; - - Register input = ToRegister(instr->value()); - Register result = ToRegister(instr->result()); - - DeferredNumberTagU* deferred = new (zone()) DeferredNumberTagU(this, instr); - __ Cmpli(input, Operand(Smi::kMaxValue), r0); - __ bgt(deferred->entry()); - __ SmiTag(result, input); - __ bind(deferred->exit()); -} - - -void LCodeGen::DoDeferredNumberTagIU(LInstruction* instr, LOperand* value, - LOperand* temp1, LOperand* temp2, - IntegerSignedness signedness) { - Label done, slow; - Register src = ToRegister(value); - Register dst = ToRegister(instr->result()); - Register tmp1 = scratch0(); - Register tmp2 = ToRegister(temp1); - Register tmp3 = ToRegister(temp2); - DoubleRegister dbl_scratch = double_scratch0(); - - if (signedness == SIGNED_INT32) { - // There was overflow, so bits 30 and 31 of the original integer - // disagree. Try to allocate a heap number in new space and store - // the value in there. If that fails, call the runtime system. - if (dst.is(src)) { - __ SmiUntag(src, dst); - __ xoris(src, src, Operand(HeapNumber::kSignMask >> 16)); - } - __ ConvertIntToDouble(src, dbl_scratch); - } else { - __ ConvertUnsignedIntToDouble(src, dbl_scratch); - } - - if (FLAG_inline_new) { - __ LoadRoot(tmp3, Heap::kHeapNumberMapRootIndex); - __ AllocateHeapNumber(dst, tmp1, tmp2, tmp3, &slow); - __ b(&done); - } - - // Slow case: Call the runtime system to do the number allocation. - __ bind(&slow); - { - // TODO(3095996): Put a valid pointer value in the stack slot where the - // result register is stored, as this register is in the pointer map, but - // contains an integer value. - __ li(dst, Operand::Zero()); - - // Preserve the value of all registers. - PushSafepointRegistersScope scope(this); - - // NumberTagI and NumberTagD use the context from the frame, rather than - // the environment's HContext or HInlinedContext value. - // They only call Runtime::kAllocateHeapNumber. - // The corresponding HChange instructions are added in a phase that does - // not have easy access to the local context. - __ LoadP(cp, MemOperand(fp, StandardFrameConstants::kContextOffset)); - __ CallRuntimeSaveDoubles(Runtime::kAllocateHeapNumber); - RecordSafepointWithRegisters(instr->pointer_map(), 0, - Safepoint::kNoLazyDeopt); - __ StoreToSafepointRegisterSlot(r3, dst); - } - - // Done. Put the value in dbl_scratch into the value of the allocated heap - // number. - __ bind(&done); - __ stfd(dbl_scratch, FieldMemOperand(dst, HeapNumber::kValueOffset)); -} - - -void LCodeGen::DoNumberTagD(LNumberTagD* instr) { - class DeferredNumberTagD final : public LDeferredCode { - public: - DeferredNumberTagD(LCodeGen* codegen, LNumberTagD* instr) - : LDeferredCode(codegen), instr_(instr) {} - void Generate() override { codegen()->DoDeferredNumberTagD(instr_); } - LInstruction* instr() override { return instr_; } - - private: - LNumberTagD* instr_; - }; - - DoubleRegister input_reg = ToDoubleRegister(instr->value()); - Register scratch = scratch0(); - Register reg = ToRegister(instr->result()); - Register temp1 = ToRegister(instr->temp()); - Register temp2 = ToRegister(instr->temp2()); - - DeferredNumberTagD* deferred = new (zone()) DeferredNumberTagD(this, instr); - if (FLAG_inline_new) { - __ LoadRoot(scratch, Heap::kHeapNumberMapRootIndex); - __ AllocateHeapNumber(reg, temp1, temp2, scratch, deferred->entry()); - } else { - __ b(deferred->entry()); - } - __ bind(deferred->exit()); - __ stfd(input_reg, FieldMemOperand(reg, HeapNumber::kValueOffset)); -} - - -void LCodeGen::DoDeferredNumberTagD(LNumberTagD* instr) { - // TODO(3095996): Get rid of this. For now, we need to make the - // result register contain a valid pointer because it is already - // contained in the register pointer map. - Register reg = ToRegister(instr->result()); - __ li(reg, Operand::Zero()); - - PushSafepointRegistersScope scope(this); - // NumberTagI and NumberTagD use the context from the frame, rather than - // the environment's HContext or HInlinedContext value. - // They only call Runtime::kAllocateHeapNumber. - // The corresponding HChange instructions are added in a phase that does - // not have easy access to the local context. - __ LoadP(cp, MemOperand(fp, StandardFrameConstants::kContextOffset)); - __ CallRuntimeSaveDoubles(Runtime::kAllocateHeapNumber); - RecordSafepointWithRegisters(instr->pointer_map(), 0, - Safepoint::kNoLazyDeopt); - __ StoreToSafepointRegisterSlot(r3, reg); -} - - -void LCodeGen::DoSmiTag(LSmiTag* instr) { - HChange* hchange = instr->hydrogen(); - Register input = ToRegister(instr->value()); - Register output = ToRegister(instr->result()); - if (hchange->CheckFlag(HValue::kCanOverflow) && - hchange->value()->CheckFlag(HValue::kUint32)) { - __ TestUnsignedSmiCandidate(input, r0); - DeoptimizeIf(ne, instr, Deoptimizer::kOverflow, cr0); - } -#if !V8_TARGET_ARCH_PPC64 - if (hchange->CheckFlag(HValue::kCanOverflow) && - !hchange->value()->CheckFlag(HValue::kUint32)) { - __ SmiTagCheckOverflow(output, input, r0); - DeoptimizeIf(lt, instr, Deoptimizer::kOverflow, cr0); - } else { -#endif - __ SmiTag(output, input); -#if !V8_TARGET_ARCH_PPC64 - } -#endif -} - - -void LCodeGen::DoSmiUntag(LSmiUntag* instr) { - Register scratch = scratch0(); - Register input = ToRegister(instr->value()); - Register result = ToRegister(instr->result()); - if (instr->needs_check()) { - // If the input is a HeapObject, value of scratch won't be zero. - __ andi(scratch, input, Operand(kHeapObjectTag)); - __ SmiUntag(result, input); - DeoptimizeIf(ne, instr, Deoptimizer::kNotASmi, cr0); - } else { - __ SmiUntag(result, input); - } -} - - -void LCodeGen::EmitNumberUntagD(LNumberUntagD* instr, Register input_reg, - DoubleRegister result_reg, - NumberUntagDMode mode) { - bool can_convert_undefined_to_nan = - instr->hydrogen()->can_convert_undefined_to_nan(); - bool deoptimize_on_minus_zero = instr->hydrogen()->deoptimize_on_minus_zero(); - - Register scratch = scratch0(); - DCHECK(!result_reg.is(double_scratch0())); - - Label convert, load_smi, done; - - if (mode == NUMBER_CANDIDATE_IS_ANY_TAGGED) { - // Smi check. - __ UntagAndJumpIfSmi(scratch, input_reg, &load_smi); - - // Heap number map check. - __ LoadP(scratch, FieldMemOperand(input_reg, HeapObject::kMapOffset)); - __ LoadRoot(ip, Heap::kHeapNumberMapRootIndex); - __ cmp(scratch, ip); - if (can_convert_undefined_to_nan) { - __ bne(&convert); - } else { - DeoptimizeIf(ne, instr, Deoptimizer::kNotAHeapNumber); - } - // load heap number - __ lfd(result_reg, FieldMemOperand(input_reg, HeapNumber::kValueOffset)); - if (deoptimize_on_minus_zero) { -#if V8_TARGET_ARCH_PPC64 - __ MovDoubleToInt64(scratch, result_reg); - // rotate left by one for simple compare. - __ rldicl(scratch, scratch, 1, 0); - __ cmpi(scratch, Operand(1)); -#else - __ MovDoubleToInt64(scratch, ip, result_reg); - __ cmpi(ip, Operand::Zero()); - __ bne(&done); - __ Cmpi(scratch, Operand(HeapNumber::kSignMask), r0); -#endif - DeoptimizeIf(eq, instr, Deoptimizer::kMinusZero); - } - __ b(&done); - if (can_convert_undefined_to_nan) { - __ bind(&convert); - // Convert undefined (and hole) to NaN. - __ LoadRoot(ip, Heap::kUndefinedValueRootIndex); - __ cmp(input_reg, ip); - DeoptimizeIf(ne, instr, Deoptimizer::kNotAHeapNumberUndefined); - __ LoadRoot(scratch, Heap::kNanValueRootIndex); - __ lfd(result_reg, FieldMemOperand(scratch, HeapNumber::kValueOffset)); - __ b(&done); - } - } else { - __ SmiUntag(scratch, input_reg); - DCHECK(mode == NUMBER_CANDIDATE_IS_SMI); - } - // Smi to double register conversion - __ bind(&load_smi); - // scratch: untagged value of input_reg - __ ConvertIntToDouble(scratch, result_reg); - __ bind(&done); -} - - -void LCodeGen::DoDeferredTaggedToI(LTaggedToI* instr) { - Register input_reg = ToRegister(instr->value()); - Register scratch1 = scratch0(); - Register scratch2 = ToRegister(instr->temp()); - DoubleRegister double_scratch = double_scratch0(); - DoubleRegister double_scratch2 = ToDoubleRegister(instr->temp2()); - - DCHECK(!scratch1.is(input_reg) && !scratch1.is(scratch2)); - DCHECK(!scratch2.is(input_reg) && !scratch2.is(scratch1)); - - Label done; - - // Heap number map check. - __ LoadP(scratch1, FieldMemOperand(input_reg, HeapObject::kMapOffset)); - __ LoadRoot(ip, Heap::kHeapNumberMapRootIndex); - __ cmp(scratch1, ip); - - if (instr->truncating()) { - // Performs a truncating conversion of a floating point number as used by - // the JS bitwise operations. - Label no_heap_number, check_bools, check_false; - __ bne(&no_heap_number); - __ mr(scratch2, input_reg); - __ TruncateHeapNumberToI(input_reg, scratch2); - __ b(&done); - - // Check for Oddballs. Undefined/False is converted to zero and True to one - // for truncating conversions. - __ bind(&no_heap_number); - __ LoadRoot(ip, Heap::kUndefinedValueRootIndex); - __ cmp(input_reg, ip); - __ bne(&check_bools); - __ li(input_reg, Operand::Zero()); - __ b(&done); - - __ bind(&check_bools); - __ LoadRoot(ip, Heap::kTrueValueRootIndex); - __ cmp(input_reg, ip); - __ bne(&check_false); - __ li(input_reg, Operand(1)); - __ b(&done); - - __ bind(&check_false); - __ LoadRoot(ip, Heap::kFalseValueRootIndex); - __ cmp(input_reg, ip); - DeoptimizeIf(ne, instr, Deoptimizer::kNotAHeapNumberUndefinedBoolean); - __ li(input_reg, Operand::Zero()); - } else { - DeoptimizeIf(ne, instr, Deoptimizer::kNotAHeapNumber); - - __ lfd(double_scratch2, - FieldMemOperand(input_reg, HeapNumber::kValueOffset)); - if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) { - // preserve heap number pointer in scratch2 for minus zero check below - __ mr(scratch2, input_reg); - } - __ TryDoubleToInt32Exact(input_reg, double_scratch2, scratch1, - double_scratch); - DeoptimizeIf(ne, instr, Deoptimizer::kLostPrecisionOrNaN); - - if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) { - __ cmpi(input_reg, Operand::Zero()); - __ bne(&done); - __ lwz(scratch1, - FieldMemOperand(scratch2, HeapNumber::kValueOffset + - Register::kExponentOffset)); - __ cmpwi(scratch1, Operand::Zero()); - DeoptimizeIf(lt, instr, Deoptimizer::kMinusZero); - } - } - __ bind(&done); -} - - -void LCodeGen::DoTaggedToI(LTaggedToI* instr) { - class DeferredTaggedToI final : public LDeferredCode { - public: - DeferredTaggedToI(LCodeGen* codegen, LTaggedToI* instr) - : LDeferredCode(codegen), instr_(instr) {} - void Generate() override { codegen()->DoDeferredTaggedToI(instr_); } - LInstruction* instr() override { return instr_; } - - private: - LTaggedToI* instr_; - }; - - LOperand* input = instr->value(); - DCHECK(input->IsRegister()); - DCHECK(input->Equals(instr->result())); - - Register input_reg = ToRegister(input); - - if (instr->hydrogen()->value()->representation().IsSmi()) { - __ SmiUntag(input_reg); - } else { - DeferredTaggedToI* deferred = new (zone()) DeferredTaggedToI(this, instr); - - // Branch to deferred code if the input is a HeapObject. - __ JumpIfNotSmi(input_reg, deferred->entry()); - - __ SmiUntag(input_reg); - __ bind(deferred->exit()); - } -} - - -void LCodeGen::DoNumberUntagD(LNumberUntagD* instr) { - LOperand* input = instr->value(); - DCHECK(input->IsRegister()); - LOperand* result = instr->result(); - DCHECK(result->IsDoubleRegister()); - - Register input_reg = ToRegister(input); - DoubleRegister result_reg = ToDoubleRegister(result); - - HValue* value = instr->hydrogen()->value(); - NumberUntagDMode mode = value->representation().IsSmi() - ? NUMBER_CANDIDATE_IS_SMI - : NUMBER_CANDIDATE_IS_ANY_TAGGED; - - EmitNumberUntagD(instr, input_reg, result_reg, mode); -} - - -void LCodeGen::DoDoubleToI(LDoubleToI* instr) { - Register result_reg = ToRegister(instr->result()); - Register scratch1 = scratch0(); - DoubleRegister double_input = ToDoubleRegister(instr->value()); - DoubleRegister double_scratch = double_scratch0(); - - if (instr->truncating()) { - __ TruncateDoubleToI(result_reg, double_input); - } else { - __ TryDoubleToInt32Exact(result_reg, double_input, scratch1, - double_scratch); - // Deoptimize if the input wasn't a int32 (inside a double). - DeoptimizeIf(ne, instr, Deoptimizer::kLostPrecisionOrNaN); - if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) { - Label done; - __ cmpi(result_reg, Operand::Zero()); - __ bne(&done); -#if V8_TARGET_ARCH_PPC64 - __ MovDoubleToInt64(scratch1, double_input); -#else - __ MovDoubleHighToInt(scratch1, double_input); -#endif - __ cmpi(scratch1, Operand::Zero()); - DeoptimizeIf(lt, instr, Deoptimizer::kMinusZero); - __ bind(&done); - } - } -} - - -void LCodeGen::DoDoubleToSmi(LDoubleToSmi* instr) { - Register result_reg = ToRegister(instr->result()); - Register scratch1 = scratch0(); - DoubleRegister double_input = ToDoubleRegister(instr->value()); - DoubleRegister double_scratch = double_scratch0(); - - if (instr->truncating()) { - __ TruncateDoubleToI(result_reg, double_input); - } else { - __ TryDoubleToInt32Exact(result_reg, double_input, scratch1, - double_scratch); - // Deoptimize if the input wasn't a int32 (inside a double). - DeoptimizeIf(ne, instr, Deoptimizer::kLostPrecisionOrNaN); - if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) { - Label done; - __ cmpi(result_reg, Operand::Zero()); - __ bne(&done); -#if V8_TARGET_ARCH_PPC64 - __ MovDoubleToInt64(scratch1, double_input); -#else - __ MovDoubleHighToInt(scratch1, double_input); -#endif - __ cmpi(scratch1, Operand::Zero()); - DeoptimizeIf(lt, instr, Deoptimizer::kMinusZero); - __ bind(&done); - } - } -#if V8_TARGET_ARCH_PPC64 - __ SmiTag(result_reg); -#else - __ SmiTagCheckOverflow(result_reg, r0); - DeoptimizeIf(lt, instr, Deoptimizer::kOverflow, cr0); -#endif -} - - -void LCodeGen::DoCheckSmi(LCheckSmi* instr) { - LOperand* input = instr->value(); - __ TestIfSmi(ToRegister(input), r0); - DeoptimizeIf(ne, instr, Deoptimizer::kNotASmi, cr0); -} - - -void LCodeGen::DoCheckNonSmi(LCheckNonSmi* instr) { - if (!instr->hydrogen()->value()->type().IsHeapObject()) { - LOperand* input = instr->value(); - __ TestIfSmi(ToRegister(input), r0); - DeoptimizeIf(eq, instr, Deoptimizer::kSmi, cr0); - } -} - - -void LCodeGen::DoCheckArrayBufferNotNeutered( - LCheckArrayBufferNotNeutered* instr) { - Register view = ToRegister(instr->view()); - Register scratch = scratch0(); - - __ LoadP(scratch, FieldMemOperand(view, JSArrayBufferView::kBufferOffset)); - __ lwz(scratch, FieldMemOperand(scratch, JSArrayBuffer::kBitFieldOffset)); - __ andi(r0, scratch, Operand(1 << JSArrayBuffer::WasNeutered::kShift)); - DeoptimizeIf(ne, instr, Deoptimizer::kOutOfBounds, cr0); -} - - -void LCodeGen::DoCheckInstanceType(LCheckInstanceType* instr) { - Register input = ToRegister(instr->value()); - Register scratch = scratch0(); - - __ LoadP(scratch, FieldMemOperand(input, HeapObject::kMapOffset)); - __ lbz(scratch, FieldMemOperand(scratch, Map::kInstanceTypeOffset)); - - if (instr->hydrogen()->is_interval_check()) { - InstanceType first; - InstanceType last; - instr->hydrogen()->GetCheckInterval(&first, &last); - - __ cmpli(scratch, Operand(first)); - - // If there is only one type in the interval check for equality. - if (first == last) { - DeoptimizeIf(ne, instr, Deoptimizer::kWrongInstanceType); - } else { - DeoptimizeIf(lt, instr, Deoptimizer::kWrongInstanceType); - // Omit check for the last type. - if (last != LAST_TYPE) { - __ cmpli(scratch, Operand(last)); - DeoptimizeIf(gt, instr, Deoptimizer::kWrongInstanceType); - } - } - } else { - uint8_t mask; - uint8_t tag; - instr->hydrogen()->GetCheckMaskAndTag(&mask, &tag); - - if (base::bits::IsPowerOfTwo32(mask)) { - DCHECK(tag == 0 || base::bits::IsPowerOfTwo32(tag)); - __ andi(r0, scratch, Operand(mask)); - DeoptimizeIf(tag == 0 ? ne : eq, instr, Deoptimizer::kWrongInstanceType, - cr0); - } else { - __ andi(scratch, scratch, Operand(mask)); - __ cmpi(scratch, Operand(tag)); - DeoptimizeIf(ne, instr, Deoptimizer::kWrongInstanceType); - } - } -} - - -void LCodeGen::DoCheckValue(LCheckValue* instr) { - Register reg = ToRegister(instr->value()); - Handle<HeapObject> object = instr->hydrogen()->object().handle(); - AllowDeferredHandleDereference smi_check; - if (isolate()->heap()->InNewSpace(*object)) { - Register reg = ToRegister(instr->value()); - Handle<Cell> cell = isolate()->factory()->NewCell(object); - __ mov(ip, Operand(cell)); - __ LoadP(ip, FieldMemOperand(ip, Cell::kValueOffset)); - __ cmp(reg, ip); - } else { - __ Cmpi(reg, Operand(object), r0); - } - DeoptimizeIf(ne, instr, Deoptimizer::kValueMismatch); -} - - -void LCodeGen::DoDeferredInstanceMigration(LCheckMaps* instr, Register object) { - Register temp = ToRegister(instr->temp()); - { - PushSafepointRegistersScope scope(this); - __ push(object); - __ li(cp, Operand::Zero()); - __ CallRuntimeSaveDoubles(Runtime::kTryMigrateInstance); - RecordSafepointWithRegisters(instr->pointer_map(), 1, - Safepoint::kNoLazyDeopt); - __ StoreToSafepointRegisterSlot(r3, temp); - } - __ TestIfSmi(temp, r0); - DeoptimizeIf(eq, instr, Deoptimizer::kInstanceMigrationFailed, cr0); -} - - -void LCodeGen::DoCheckMaps(LCheckMaps* instr) { - class DeferredCheckMaps final : public LDeferredCode { - public: - DeferredCheckMaps(LCodeGen* codegen, LCheckMaps* instr, Register object) - : LDeferredCode(codegen), instr_(instr), object_(object) { - SetExit(check_maps()); - } - void Generate() override { - codegen()->DoDeferredInstanceMigration(instr_, object_); - } - Label* check_maps() { return &check_maps_; } - LInstruction* instr() override { return instr_; } - - private: - LCheckMaps* instr_; - Label check_maps_; - Register object_; - }; - - if (instr->hydrogen()->IsStabilityCheck()) { - const UniqueSet<Map>* maps = instr->hydrogen()->maps(); - for (int i = 0; i < maps->size(); ++i) { - AddStabilityDependency(maps->at(i).handle()); - } - return; - } - - Register object = ToRegister(instr->value()); - Register map_reg = ToRegister(instr->temp()); - - __ LoadP(map_reg, FieldMemOperand(object, HeapObject::kMapOffset)); - - DeferredCheckMaps* deferred = NULL; - if (instr->hydrogen()->HasMigrationTarget()) { - deferred = new (zone()) DeferredCheckMaps(this, instr, object); - __ bind(deferred->check_maps()); - } - - const UniqueSet<Map>* maps = instr->hydrogen()->maps(); - Label success; - for (int i = 0; i < maps->size() - 1; i++) { - Handle<Map> map = maps->at(i).handle(); - __ CompareMap(map_reg, map, &success); - __ beq(&success); - } - - Handle<Map> map = maps->at(maps->size() - 1).handle(); - __ CompareMap(map_reg, map, &success); - if (instr->hydrogen()->HasMigrationTarget()) { - __ bne(deferred->entry()); - } else { - DeoptimizeIf(ne, instr, Deoptimizer::kWrongMap); - } - - __ bind(&success); -} - - -void LCodeGen::DoClampDToUint8(LClampDToUint8* instr) { - DoubleRegister value_reg = ToDoubleRegister(instr->unclamped()); - Register result_reg = ToRegister(instr->result()); - __ ClampDoubleToUint8(result_reg, value_reg, double_scratch0()); -} - - -void LCodeGen::DoClampIToUint8(LClampIToUint8* instr) { - Register unclamped_reg = ToRegister(instr->unclamped()); - Register result_reg = ToRegister(instr->result()); - __ ClampUint8(result_reg, unclamped_reg); -} - - -void LCodeGen::DoClampTToUint8(LClampTToUint8* instr) { - Register scratch = scratch0(); - Register input_reg = ToRegister(instr->unclamped()); - Register result_reg = ToRegister(instr->result()); - DoubleRegister temp_reg = ToDoubleRegister(instr->temp()); - Label is_smi, done, heap_number; - - // Both smi and heap number cases are handled. - __ UntagAndJumpIfSmi(result_reg, input_reg, &is_smi); - - // Check for heap number - __ LoadP(scratch, FieldMemOperand(input_reg, HeapObject::kMapOffset)); - __ Cmpi(scratch, Operand(factory()->heap_number_map()), r0); - __ beq(&heap_number); - - // Check for undefined. Undefined is converted to zero for clamping - // conversions. - __ Cmpi(input_reg, Operand(factory()->undefined_value()), r0); - DeoptimizeIf(ne, instr, Deoptimizer::kNotAHeapNumberUndefined); - __ li(result_reg, Operand::Zero()); - __ b(&done); - - // Heap number - __ bind(&heap_number); - __ lfd(temp_reg, FieldMemOperand(input_reg, HeapNumber::kValueOffset)); - __ ClampDoubleToUint8(result_reg, temp_reg, double_scratch0()); - __ b(&done); - - // smi - __ bind(&is_smi); - __ ClampUint8(result_reg, result_reg); - - __ bind(&done); -} - - -void LCodeGen::DoDoubleBits(LDoubleBits* instr) { - DoubleRegister value_reg = ToDoubleRegister(instr->value()); - Register result_reg = ToRegister(instr->result()); - - if (instr->hydrogen()->bits() == HDoubleBits::HIGH) { - __ MovDoubleHighToInt(result_reg, value_reg); - } else { - __ MovDoubleLowToInt(result_reg, value_reg); - } -} - - -void LCodeGen::DoConstructDouble(LConstructDouble* instr) { - Register hi_reg = ToRegister(instr->hi()); - Register lo_reg = ToRegister(instr->lo()); - DoubleRegister result_reg = ToDoubleRegister(instr->result()); -#if V8_TARGET_ARCH_PPC64 - __ MovInt64ComponentsToDouble(result_reg, hi_reg, lo_reg, r0); -#else - __ MovInt64ToDouble(result_reg, hi_reg, lo_reg); -#endif -} - - -void LCodeGen::DoAllocate(LAllocate* instr) { - class DeferredAllocate final : public LDeferredCode { - public: - DeferredAllocate(LCodeGen* codegen, LAllocate* instr) - : LDeferredCode(codegen), instr_(instr) {} - void Generate() override { codegen()->DoDeferredAllocate(instr_); } - LInstruction* instr() override { return instr_; } - - private: - LAllocate* instr_; - }; - - DeferredAllocate* deferred = new (zone()) DeferredAllocate(this, instr); - - Register result = ToRegister(instr->result()); - Register scratch = ToRegister(instr->temp1()); - Register scratch2 = ToRegister(instr->temp2()); - - // Allocate memory for the object. - AllocationFlags flags = TAG_OBJECT; - if (instr->hydrogen()->MustAllocateDoubleAligned()) { - flags = static_cast<AllocationFlags>(flags | DOUBLE_ALIGNMENT); - } - if (instr->hydrogen()->IsOldSpaceAllocation()) { - DCHECK(!instr->hydrogen()->IsNewSpaceAllocation()); - flags = static_cast<AllocationFlags>(flags | PRETENURE); - } - - if (instr->size()->IsConstantOperand()) { - int32_t size = ToInteger32(LConstantOperand::cast(instr->size())); - if (size <= Page::kMaxRegularHeapObjectSize) { - __ Allocate(size, result, scratch, scratch2, deferred->entry(), flags); - } else { - __ b(deferred->entry()); - } - } else { - Register size = ToRegister(instr->size()); - __ Allocate(size, result, scratch, scratch2, deferred->entry(), flags); - } - - __ bind(deferred->exit()); - - if (instr->hydrogen()->MustPrefillWithFiller()) { - if (instr->size()->IsConstantOperand()) { - int32_t size = ToInteger32(LConstantOperand::cast(instr->size())); - __ LoadIntLiteral(scratch, size - kHeapObjectTag); - } else { - __ subi(scratch, ToRegister(instr->size()), Operand(kHeapObjectTag)); - } - __ mov(scratch2, Operand(isolate()->factory()->one_pointer_filler_map())); - Label loop; - __ bind(&loop); - __ subi(scratch, scratch, Operand(kPointerSize)); - __ StorePX(scratch2, MemOperand(result, scratch)); - __ cmpi(scratch, Operand::Zero()); - __ bge(&loop); - } -} - - -void LCodeGen::DoDeferredAllocate(LAllocate* instr) { - Register result = ToRegister(instr->result()); - - // TODO(3095996): Get rid of this. For now, we need to make the - // result register contain a valid pointer because it is already - // contained in the register pointer map. - __ LoadSmiLiteral(result, Smi::FromInt(0)); - - PushSafepointRegistersScope scope(this); - if (instr->size()->IsRegister()) { - Register size = ToRegister(instr->size()); - DCHECK(!size.is(result)); - __ SmiTag(size); - __ push(size); - } else { - int32_t size = ToInteger32(LConstantOperand::cast(instr->size())); -#if !V8_TARGET_ARCH_PPC64 - if (size >= 0 && size <= Smi::kMaxValue) { -#endif - __ Push(Smi::FromInt(size)); -#if !V8_TARGET_ARCH_PPC64 - } else { - // We should never get here at runtime => abort - __ stop("invalid allocation size"); - return; - } -#endif - } - - int flags = AllocateDoubleAlignFlag::encode( - instr->hydrogen()->MustAllocateDoubleAligned()); - if (instr->hydrogen()->IsOldSpaceAllocation()) { - DCHECK(!instr->hydrogen()->IsNewSpaceAllocation()); - flags = AllocateTargetSpace::update(flags, OLD_SPACE); - } else { - flags = AllocateTargetSpace::update(flags, NEW_SPACE); - } - __ Push(Smi::FromInt(flags)); - - CallRuntimeFromDeferred(Runtime::kAllocateInTargetSpace, 2, instr, - instr->context()); - __ StoreToSafepointRegisterSlot(r3, result); -} - - -void LCodeGen::DoToFastProperties(LToFastProperties* instr) { - DCHECK(ToRegister(instr->value()).is(r3)); - __ push(r3); - CallRuntime(Runtime::kToFastProperties, 1, instr); -} - - -void LCodeGen::DoRegExpLiteral(LRegExpLiteral* instr) { - DCHECK(ToRegister(instr->context()).is(cp)); - Label materialized; - // Registers will be used as follows: - // r10 = literals array. - // r4 = regexp literal. - // r3 = regexp literal clone. - // r5 and r7-r9 are used as temporaries. - int literal_offset = - LiteralsArray::OffsetOfLiteralAt(instr->hydrogen()->literal_index()); - __ Move(r10, instr->hydrogen()->literals()); - __ LoadP(r4, FieldMemOperand(r10, literal_offset)); - __ LoadRoot(ip, Heap::kUndefinedValueRootIndex); - __ cmp(r4, ip); - __ bne(&materialized); - - // Create regexp literal using runtime function - // Result will be in r3. - __ LoadSmiLiteral(r9, Smi::FromInt(instr->hydrogen()->literal_index())); - __ mov(r8, Operand(instr->hydrogen()->pattern())); - __ mov(r7, Operand(instr->hydrogen()->flags())); - __ Push(r10, r9, r8, r7); - CallRuntime(Runtime::kMaterializeRegExpLiteral, 4, instr); - __ mr(r4, r3); - - __ bind(&materialized); - int size = JSRegExp::kSize + JSRegExp::kInObjectFieldCount * kPointerSize; - Label allocated, runtime_allocate; - - __ Allocate(size, r3, r5, r6, &runtime_allocate, TAG_OBJECT); - __ b(&allocated); - - __ bind(&runtime_allocate); - __ LoadSmiLiteral(r3, Smi::FromInt(size)); - __ Push(r4, r3); - CallRuntime(Runtime::kAllocateInNewSpace, 1, instr); - __ pop(r4); - - __ bind(&allocated); - // Copy the content into the newly allocated memory. - __ CopyFields(r3, r4, r5.bit(), size / kPointerSize); -} - - -void LCodeGen::DoTypeof(LTypeof* instr) { - DCHECK(ToRegister(instr->value()).is(r6)); - DCHECK(ToRegister(instr->result()).is(r3)); - Label end, do_call; - Register value_register = ToRegister(instr->value()); - __ JumpIfNotSmi(value_register, &do_call); - __ mov(r3, Operand(isolate()->factory()->number_string())); - __ b(&end); - __ bind(&do_call); - TypeofStub stub(isolate()); - CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); - __ bind(&end); -} - - -void LCodeGen::DoTypeofIsAndBranch(LTypeofIsAndBranch* instr) { - Register input = ToRegister(instr->value()); - - Condition final_branch_condition = - EmitTypeofIs(instr->TrueLabel(chunk_), instr->FalseLabel(chunk_), input, - instr->type_literal()); - if (final_branch_condition != kNoCondition) { - EmitBranch(instr, final_branch_condition); - } -} - - -Condition LCodeGen::EmitTypeofIs(Label* true_label, Label* false_label, - Register input, Handle<String> type_name) { - Condition final_branch_condition = kNoCondition; - Register scratch = scratch0(); - Factory* factory = isolate()->factory(); - if (String::Equals(type_name, factory->number_string())) { - __ JumpIfSmi(input, true_label); - __ LoadP(scratch, FieldMemOperand(input, HeapObject::kMapOffset)); - __ CompareRoot(scratch, Heap::kHeapNumberMapRootIndex); - final_branch_condition = eq; - - } else if (String::Equals(type_name, factory->string_string())) { - __ JumpIfSmi(input, false_label); - __ CompareObjectType(input, scratch, no_reg, FIRST_NONSTRING_TYPE); - final_branch_condition = lt; - - } else if (String::Equals(type_name, factory->symbol_string())) { - __ JumpIfSmi(input, false_label); - __ CompareObjectType(input, scratch, no_reg, SYMBOL_TYPE); - final_branch_condition = eq; - - } else if (String::Equals(type_name, factory->boolean_string())) { - __ CompareRoot(input, Heap::kTrueValueRootIndex); - __ beq(true_label); - __ CompareRoot(input, Heap::kFalseValueRootIndex); - final_branch_condition = eq; - - } else if (String::Equals(type_name, factory->undefined_string())) { - __ CompareRoot(input, Heap::kUndefinedValueRootIndex); - __ beq(true_label); - __ JumpIfSmi(input, false_label); - // Check for undetectable objects => true. - __ LoadP(scratch, FieldMemOperand(input, HeapObject::kMapOffset)); - __ lbz(scratch, FieldMemOperand(scratch, Map::kBitFieldOffset)); - __ ExtractBit(r0, scratch, Map::kIsUndetectable); - __ cmpi(r0, Operand::Zero()); - final_branch_condition = ne; - - } else if (String::Equals(type_name, factory->function_string())) { - __ JumpIfSmi(input, false_label); - __ LoadP(scratch, FieldMemOperand(input, HeapObject::kMapOffset)); - __ lbz(scratch, FieldMemOperand(scratch, Map::kBitFieldOffset)); - __ andi(scratch, scratch, - Operand((1 << Map::kIsCallable) | (1 << Map::kIsUndetectable))); - __ cmpi(scratch, Operand(1 << Map::kIsCallable)); - final_branch_condition = eq; - - } else if (String::Equals(type_name, factory->object_string())) { - __ JumpIfSmi(input, false_label); - __ CompareRoot(input, Heap::kNullValueRootIndex); - __ beq(true_label); - STATIC_ASSERT(LAST_SPEC_OBJECT_TYPE == LAST_TYPE); - __ CompareObjectType(input, scratch, ip, FIRST_SPEC_OBJECT_TYPE); - __ blt(false_label); - // Check for callable or undetectable objects => false. - __ lbz(scratch, FieldMemOperand(scratch, Map::kBitFieldOffset)); - __ andi(r0, scratch, - Operand((1 << Map::kIsCallable) | (1 << Map::kIsUndetectable))); - __ cmpi(r0, Operand::Zero()); - final_branch_condition = eq; - -// clang-format off -#define SIMD128_TYPE(TYPE, Type, type, lane_count, lane_type) \ - } else if (String::Equals(type_name, factory->type##_string())) { \ - __ JumpIfSmi(input, false_label); \ - __ LoadP(scratch, FieldMemOperand(input, HeapObject::kMapOffset)); \ - __ CompareRoot(scratch, Heap::k##Type##MapRootIndex); \ - final_branch_condition = eq; - SIMD128_TYPES(SIMD128_TYPE) -#undef SIMD128_TYPE - // clang-format on - - } else { - __ b(false_label); - } - - return final_branch_condition; -} - - -void LCodeGen::DoIsConstructCallAndBranch(LIsConstructCallAndBranch* instr) { - Register temp1 = ToRegister(instr->temp()); - - EmitIsConstructCall(temp1, scratch0()); - EmitBranch(instr, eq); -} - - -void LCodeGen::EmitIsConstructCall(Register temp1, Register temp2) { - DCHECK(!temp1.is(temp2)); - // Get the frame pointer for the calling frame. - __ LoadP(temp1, MemOperand(fp, StandardFrameConstants::kCallerFPOffset)); - - // Skip the arguments adaptor frame if it exists. - Label check_frame_marker; - __ LoadP(temp2, MemOperand(temp1, StandardFrameConstants::kContextOffset)); - __ CmpSmiLiteral(temp2, Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR), r0); - __ bne(&check_frame_marker); - __ LoadP(temp1, MemOperand(temp1, StandardFrameConstants::kCallerFPOffset)); - - // Check the marker in the calling frame. - __ bind(&check_frame_marker); - __ LoadP(temp1, MemOperand(temp1, StandardFrameConstants::kMarkerOffset)); - __ CmpSmiLiteral(temp1, Smi::FromInt(StackFrame::CONSTRUCT), r0); -} - - -void LCodeGen::EnsureSpaceForLazyDeopt(int space_needed) { - if (info()->ShouldEnsureSpaceForLazyDeopt()) { - // Ensure that we have enough space after the previous lazy-bailout - // instruction for patching the code here. - int current_pc = masm()->pc_offset(); - if (current_pc < last_lazy_deopt_pc_ + space_needed) { - int padding_size = last_lazy_deopt_pc_ + space_needed - current_pc; - DCHECK_EQ(0, padding_size % Assembler::kInstrSize); - while (padding_size > 0) { - __ nop(); - padding_size -= Assembler::kInstrSize; - } - } - } - last_lazy_deopt_pc_ = masm()->pc_offset(); -} - - -void LCodeGen::DoLazyBailout(LLazyBailout* instr) { - last_lazy_deopt_pc_ = masm()->pc_offset(); - DCHECK(instr->HasEnvironment()); - LEnvironment* env = instr->environment(); - RegisterEnvironmentForDeoptimization(env, Safepoint::kLazyDeopt); - safepoints_.RecordLazyDeoptimizationIndex(env->deoptimization_index()); -} - - -void LCodeGen::DoDeoptimize(LDeoptimize* instr) { - Deoptimizer::BailoutType type = instr->hydrogen()->type(); - // TODO(danno): Stubs expect all deopts to be lazy for historical reasons (the - // needed return address), even though the implementation of LAZY and EAGER is - // now identical. When LAZY is eventually completely folded into EAGER, remove - // the special case below. - if (info()->IsStub() && type == Deoptimizer::EAGER) { - type = Deoptimizer::LAZY; - } - - DeoptimizeIf(al, instr, instr->hydrogen()->reason(), type); -} - - -void LCodeGen::DoDummy(LDummy* instr) { - // Nothing to see here, move on! -} - - -void LCodeGen::DoDummyUse(LDummyUse* instr) { - // Nothing to see here, move on! -} - - -void LCodeGen::DoDeferredStackCheck(LStackCheck* instr) { - PushSafepointRegistersScope scope(this); - LoadContextFromDeferred(instr->context()); - __ CallRuntimeSaveDoubles(Runtime::kStackGuard); - RecordSafepointWithLazyDeopt( - instr, RECORD_SAFEPOINT_WITH_REGISTERS_AND_NO_ARGUMENTS); - DCHECK(instr->HasEnvironment()); - LEnvironment* env = instr->environment(); - safepoints_.RecordLazyDeoptimizationIndex(env->deoptimization_index()); -} - - -void LCodeGen::DoStackCheck(LStackCheck* instr) { - class DeferredStackCheck final : public LDeferredCode { - public: - DeferredStackCheck(LCodeGen* codegen, LStackCheck* instr) - : LDeferredCode(codegen), instr_(instr) {} - void Generate() override { codegen()->DoDeferredStackCheck(instr_); } - LInstruction* instr() override { return instr_; } - - private: - LStackCheck* instr_; - }; - - DCHECK(instr->HasEnvironment()); - LEnvironment* env = instr->environment(); - // There is no LLazyBailout instruction for stack-checks. We have to - // prepare for lazy deoptimization explicitly here. - if (instr->hydrogen()->is_function_entry()) { - // Perform stack overflow check. - Label done; - __ LoadRoot(ip, Heap::kStackLimitRootIndex); - __ cmpl(sp, ip); - __ bge(&done); - DCHECK(instr->context()->IsRegister()); - DCHECK(ToRegister(instr->context()).is(cp)); - CallCode(isolate()->builtins()->StackCheck(), RelocInfo::CODE_TARGET, - instr); - __ bind(&done); - } else { - DCHECK(instr->hydrogen()->is_backwards_branch()); - // Perform stack overflow check if this goto needs it before jumping. - DeferredStackCheck* deferred_stack_check = - new (zone()) DeferredStackCheck(this, instr); - __ LoadRoot(ip, Heap::kStackLimitRootIndex); - __ cmpl(sp, ip); - __ blt(deferred_stack_check->entry()); - EnsureSpaceForLazyDeopt(Deoptimizer::patch_size()); - __ bind(instr->done_label()); - deferred_stack_check->SetExit(instr->done_label()); - RegisterEnvironmentForDeoptimization(env, Safepoint::kLazyDeopt); - // Don't record a deoptimization index for the safepoint here. - // This will be done explicitly when emitting call and the safepoint in - // the deferred code. - } -} - - -void LCodeGen::DoOsrEntry(LOsrEntry* instr) { - // This is a pseudo-instruction that ensures that the environment here is - // properly registered for deoptimization and records the assembler's PC - // offset. - LEnvironment* environment = instr->environment(); - - // If the environment were already registered, we would have no way of - // backpatching it with the spill slot operands. - DCHECK(!environment->HasBeenRegistered()); - RegisterEnvironmentForDeoptimization(environment, Safepoint::kNoLazyDeopt); - - GenerateOsrPrologue(); -} - - -void LCodeGen::DoForInPrepareMap(LForInPrepareMap* instr) { - __ TestIfSmi(r3, r0); - DeoptimizeIf(eq, instr, Deoptimizer::kSmi, cr0); - - STATIC_ASSERT(FIRST_JS_PROXY_TYPE == FIRST_SPEC_OBJECT_TYPE); - __ CompareObjectType(r3, r4, r4, LAST_JS_PROXY_TYPE); - DeoptimizeIf(le, instr, Deoptimizer::kWrongInstanceType); - - Label use_cache, call_runtime; - Register null_value = r8; - __ LoadRoot(null_value, Heap::kNullValueRootIndex); - __ CheckEnumCache(null_value, &call_runtime); - - __ LoadP(r3, FieldMemOperand(r3, HeapObject::kMapOffset)); - __ b(&use_cache); - - // Get the set of properties to enumerate. - __ bind(&call_runtime); - __ push(r3); - CallRuntime(Runtime::kGetPropertyNamesFast, 1, instr); - - __ LoadP(r4, FieldMemOperand(r3, HeapObject::kMapOffset)); - __ LoadRoot(ip, Heap::kMetaMapRootIndex); - __ cmp(r4, ip); - DeoptimizeIf(ne, instr, Deoptimizer::kWrongMap); - __ bind(&use_cache); -} - - -void LCodeGen::DoForInCacheArray(LForInCacheArray* instr) { - Register map = ToRegister(instr->map()); - Register result = ToRegister(instr->result()); - Label load_cache, done; - __ EnumLength(result, map); - __ CmpSmiLiteral(result, Smi::FromInt(0), r0); - __ bne(&load_cache); - __ mov(result, Operand(isolate()->factory()->empty_fixed_array())); - __ b(&done); - - __ bind(&load_cache); - __ LoadInstanceDescriptors(map, result); - __ LoadP(result, FieldMemOperand(result, DescriptorArray::kEnumCacheOffset)); - __ LoadP(result, FieldMemOperand(result, FixedArray::SizeFor(instr->idx()))); - __ cmpi(result, Operand::Zero()); - DeoptimizeIf(eq, instr, Deoptimizer::kNoCache); - - __ bind(&done); -} - - -void LCodeGen::DoCheckMapValue(LCheckMapValue* instr) { - Register object = ToRegister(instr->value()); - Register map = ToRegister(instr->map()); - __ LoadP(scratch0(), FieldMemOperand(object, HeapObject::kMapOffset)); - __ cmp(map, scratch0()); - DeoptimizeIf(ne, instr, Deoptimizer::kWrongMap); -} - - -void LCodeGen::DoDeferredLoadMutableDouble(LLoadFieldByIndex* instr, - Register result, Register object, - Register index) { - PushSafepointRegistersScope scope(this); - __ Push(object, index); - __ li(cp, Operand::Zero()); - __ CallRuntimeSaveDoubles(Runtime::kLoadMutableDouble); - RecordSafepointWithRegisters(instr->pointer_map(), 2, - Safepoint::kNoLazyDeopt); - __ StoreToSafepointRegisterSlot(r3, result); -} - - -void LCodeGen::DoLoadFieldByIndex(LLoadFieldByIndex* instr) { - class DeferredLoadMutableDouble final : public LDeferredCode { - public: - DeferredLoadMutableDouble(LCodeGen* codegen, LLoadFieldByIndex* instr, - Register result, Register object, Register index) - : LDeferredCode(codegen), - instr_(instr), - result_(result), - object_(object), - index_(index) {} - void Generate() override { - codegen()->DoDeferredLoadMutableDouble(instr_, result_, object_, index_); - } - LInstruction* instr() override { return instr_; } - - private: - LLoadFieldByIndex* instr_; - Register result_; - Register object_; - Register index_; - }; - - Register object = ToRegister(instr->object()); - Register index = ToRegister(instr->index()); - Register result = ToRegister(instr->result()); - Register scratch = scratch0(); - - DeferredLoadMutableDouble* deferred; - deferred = new (zone()) - DeferredLoadMutableDouble(this, instr, result, object, index); - - Label out_of_object, done; - - __ TestBitMask(index, reinterpret_cast<uintptr_t>(Smi::FromInt(1)), r0); - __ bne(deferred->entry(), cr0); - __ ShiftRightArithImm(index, index, 1); - - __ cmpi(index, Operand::Zero()); - __ blt(&out_of_object); - - __ SmiToPtrArrayOffset(r0, index); - __ add(scratch, object, r0); - __ LoadP(result, FieldMemOperand(scratch, JSObject::kHeaderSize)); - - __ b(&done); - - __ bind(&out_of_object); - __ LoadP(result, FieldMemOperand(object, JSObject::kPropertiesOffset)); - // Index is equal to negated out of object property index plus 1. - __ SmiToPtrArrayOffset(r0, index); - __ sub(scratch, result, r0); - __ LoadP(result, - FieldMemOperand(scratch, FixedArray::kHeaderSize - kPointerSize)); - __ bind(deferred->exit()); - __ bind(&done); -} - - -void LCodeGen::DoStoreFrameContext(LStoreFrameContext* instr) { - Register context = ToRegister(instr->context()); - __ StoreP(context, MemOperand(fp, StandardFrameConstants::kContextOffset)); -} - - -void LCodeGen::DoAllocateBlockContext(LAllocateBlockContext* instr) { - Handle<ScopeInfo> scope_info = instr->scope_info(); - __ Push(scope_info); - __ push(ToRegister(instr->function())); - CallRuntime(Runtime::kPushBlockContext, 2, instr); - RecordSafepoint(Safepoint::kNoLazyDeopt); -} - - -#undef __ -} // namespace internal -} // namespace v8 diff --git a/deps/v8/src/ppc/lithium-codegen-ppc.h b/deps/v8/src/ppc/lithium-codegen-ppc.h deleted file mode 100644 index 117dc574d5..0000000000 --- a/deps/v8/src/ppc/lithium-codegen-ppc.h +++ /dev/null @@ -1,364 +0,0 @@ -// Copyright 2014 the V8 project authors. All rights reserved. -// Use of this source code is governed by a BSD-style license that can be -// found in the LICENSE file. - -#ifndef V8_PPC_LITHIUM_CODEGEN_PPC_H_ -#define V8_PPC_LITHIUM_CODEGEN_PPC_H_ - -#include "src/ppc/lithium-ppc.h" - -#include "src/ppc/lithium-gap-resolver-ppc.h" -#include "src/deoptimizer.h" -#include "src/lithium-codegen.h" -#include "src/safepoint-table.h" -#include "src/scopes.h" -#include "src/utils.h" - -namespace v8 { -namespace internal { - -// Forward declarations. -class LDeferredCode; -class SafepointGenerator; - -class LCodeGen : public LCodeGenBase { - public: - LCodeGen(LChunk* chunk, MacroAssembler* assembler, CompilationInfo* info) - : LCodeGenBase(chunk, assembler, info), - deoptimizations_(4, info->zone()), - jump_table_(4, info->zone()), - inlined_function_count_(0), - scope_(info->scope()), - translations_(info->zone()), - deferred_(8, info->zone()), - osr_pc_offset_(-1), - frame_is_built_(false), - safepoints_(info->zone()), - resolver_(this), - expected_safepoint_kind_(Safepoint::kSimple) { - PopulateDeoptimizationLiteralsWithInlinedFunctions(); - } - - - int LookupDestination(int block_id) const { - return chunk()->LookupDestination(block_id); - } - - bool IsNextEmittedBlock(int block_id) const { - return LookupDestination(block_id) == GetNextEmittedBlock(); - } - - bool NeedsEagerFrame() const { - return GetStackSlotCount() > 0 || info()->is_non_deferred_calling() || - !info()->IsStub() || info()->requires_frame(); - } - bool NeedsDeferredFrame() const { - return !NeedsEagerFrame() && info()->is_deferred_calling(); - } - - LinkRegisterStatus GetLinkRegisterState() const { - return frame_is_built_ ? kLRHasBeenSaved : kLRHasNotBeenSaved; - } - - // Support for converting LOperands to assembler types. - // LOperand must be a register. - Register ToRegister(LOperand* op) const; - - // LOperand is loaded into scratch, unless already a register. - Register EmitLoadRegister(LOperand* op, Register scratch); - - // LConstantOperand must be an Integer32 or Smi - void EmitLoadIntegerConstant(LConstantOperand* const_op, Register dst); - - // LOperand must be a double register. - DoubleRegister ToDoubleRegister(LOperand* op) const; - - intptr_t ToRepresentation(LConstantOperand* op, - const Representation& r) const; - int32_t ToInteger32(LConstantOperand* op) const; - Smi* ToSmi(LConstantOperand* op) const; - double ToDouble(LConstantOperand* op) const; - Operand ToOperand(LOperand* op); - MemOperand ToMemOperand(LOperand* op) const; - // Returns a MemOperand pointing to the high word of a DoubleStackSlot. - MemOperand ToHighMemOperand(LOperand* op) const; - - bool IsInteger32(LConstantOperand* op) const; - bool IsSmi(LConstantOperand* op) const; - Handle<Object> ToHandle(LConstantOperand* op) const; - - // Try to generate code for the entire chunk, but it may fail if the - // chunk contains constructs we cannot handle. Returns true if the - // code generation attempt succeeded. - bool GenerateCode(); - - // Finish the code by setting stack height, safepoint, and bailout - // information on it. - void FinishCode(Handle<Code> code); - - // Deferred code support. - void DoDeferredNumberTagD(LNumberTagD* instr); - - enum IntegerSignedness { SIGNED_INT32, UNSIGNED_INT32 }; - void DoDeferredNumberTagIU(LInstruction* instr, LOperand* value, - LOperand* temp1, LOperand* temp2, - IntegerSignedness signedness); - - void DoDeferredTaggedToI(LTaggedToI* instr); - void DoDeferredMathAbsTaggedHeapNumber(LMathAbs* instr); - void DoDeferredStackCheck(LStackCheck* instr); - void DoDeferredMaybeGrowElements(LMaybeGrowElements* instr); - void DoDeferredStringCharCodeAt(LStringCharCodeAt* instr); - void DoDeferredStringCharFromCode(LStringCharFromCode* instr); - void DoDeferredAllocate(LAllocate* instr); - void DoDeferredInstanceMigration(LCheckMaps* instr, Register object); - void DoDeferredLoadMutableDouble(LLoadFieldByIndex* instr, Register result, - Register object, Register index); - - // Parallel move support. - void DoParallelMove(LParallelMove* move); - void DoGap(LGap* instr); - - MemOperand PrepareKeyedOperand(Register key, Register base, - bool key_is_constant, bool key_is_tagged, - int constant_key, int element_size_shift, - int base_offset); - - // Emit frame translation commands for an environment. - void WriteTranslation(LEnvironment* environment, Translation* translation); - -// Declare methods that deal with the individual node types. -#define DECLARE_DO(type) void Do##type(L##type* node); - LITHIUM_CONCRETE_INSTRUCTION_LIST(DECLARE_DO) -#undef DECLARE_DO - - private: - LanguageMode language_mode() const { return info()->language_mode(); } - - Scope* scope() const { return scope_; } - - Register scratch0() { return r11; } - DoubleRegister double_scratch0() { return kScratchDoubleReg; } - - LInstruction* GetNextInstruction(); - - void EmitClassOfTest(Label* if_true, Label* if_false, - Handle<String> class_name, Register input, - Register temporary, Register temporary2); - - int GetStackSlotCount() const { return chunk()->spill_slot_count(); } - - void AddDeferredCode(LDeferredCode* code) { deferred_.Add(code, zone()); } - - void SaveCallerDoubles(); - void RestoreCallerDoubles(); - - // Code generation passes. Returns true if code generation should - // continue. - void GenerateBodyInstructionPre(LInstruction* instr) override; - bool GeneratePrologue(); - bool GenerateDeferredCode(); - bool GenerateJumpTable(); - bool GenerateSafepointTable(); - - // Generates the custom OSR entrypoint and sets the osr_pc_offset. - void GenerateOsrPrologue(); - - enum SafepointMode { - RECORD_SIMPLE_SAFEPOINT, - RECORD_SAFEPOINT_WITH_REGISTERS_AND_NO_ARGUMENTS - }; - - void CallCode(Handle<Code> code, RelocInfo::Mode mode, LInstruction* instr); - - void CallCodeGeneric(Handle<Code> code, RelocInfo::Mode mode, - LInstruction* instr, SafepointMode safepoint_mode); - - void CallRuntime(const Runtime::Function* function, int num_arguments, - LInstruction* instr, - SaveFPRegsMode save_doubles = kDontSaveFPRegs); - - void CallRuntime(Runtime::FunctionId id, int num_arguments, - LInstruction* instr) { - const Runtime::Function* function = Runtime::FunctionForId(id); - CallRuntime(function, num_arguments, instr); - } - - void LoadContextFromDeferred(LOperand* context); - void CallRuntimeFromDeferred(Runtime::FunctionId id, int argc, - LInstruction* instr, LOperand* context); - - // Generate a direct call to a known function. Expects the function - // to be in r4. - void CallKnownFunction(Handle<JSFunction> function, - int formal_parameter_count, int arity, - LInstruction* instr); - - void RecordSafepointWithLazyDeopt(LInstruction* instr, - SafepointMode safepoint_mode); - - void RegisterEnvironmentForDeoptimization(LEnvironment* environment, - Safepoint::DeoptMode mode); - void DeoptimizeIf(Condition condition, LInstruction* instr, - Deoptimizer::DeoptReason deopt_reason, - Deoptimizer::BailoutType bailout_type, CRegister cr = cr7); - void DeoptimizeIf(Condition condition, LInstruction* instr, - Deoptimizer::DeoptReason deopt_reason, CRegister cr = cr7); - - void AddToTranslation(LEnvironment* environment, Translation* translation, - LOperand* op, bool is_tagged, bool is_uint32, - int* object_index_pointer, - int* dematerialized_index_pointer); - void PopulateDeoptimizationData(Handle<Code> code); - - void PopulateDeoptimizationLiteralsWithInlinedFunctions(); - - Register ToRegister(int index) const; - DoubleRegister ToDoubleRegister(int index) const; - - MemOperand BuildSeqStringOperand(Register string, LOperand* index, - String::Encoding encoding); - - void EmitMathAbs(LMathAbs* instr); -#if V8_TARGET_ARCH_PPC64 - void EmitInteger32MathAbs(LMathAbs* instr); -#endif - - // Support for recording safepoint and position information. - void RecordSafepoint(LPointerMap* pointers, Safepoint::Kind kind, - int arguments, Safepoint::DeoptMode mode); - void RecordSafepoint(LPointerMap* pointers, Safepoint::DeoptMode mode); - void RecordSafepoint(Safepoint::DeoptMode mode); - void RecordSafepointWithRegisters(LPointerMap* pointers, int arguments, - Safepoint::DeoptMode mode); - - void RecordAndWritePosition(int position) override; - - static Condition TokenToCondition(Token::Value op); - void EmitGoto(int block); - - // EmitBranch expects to be the last instruction of a block. - template <class InstrType> - void EmitBranch(InstrType instr, Condition condition, CRegister cr = cr7); - template <class InstrType> - void EmitTrueBranch(InstrType instr, Condition condition, CRegister cr = cr7); - template <class InstrType> - void EmitFalseBranch(InstrType instr, Condition condition, - CRegister cr = cr7); - void EmitNumberUntagD(LNumberUntagD* instr, Register input, - DoubleRegister result, NumberUntagDMode mode); - - // Emits optimized code for typeof x == "y". Modifies input register. - // Returns the condition on which a final split to - // true and false label should be made, to optimize fallthrough. - Condition EmitTypeofIs(Label* true_label, Label* false_label, Register input, - Handle<String> type_name); - - // Emits optimized code for %_IsString(x). Preserves input register. - // Returns the condition on which a final split to - // true and false label should be made, to optimize fallthrough. - Condition EmitIsString(Register input, Register temp1, Label* is_not_string, - SmiCheck check_needed); - - // Emits optimized code for %_IsConstructCall(). - // Caller should branch on equal condition. - void EmitIsConstructCall(Register temp1, Register temp2); - - // Emits optimized code to deep-copy the contents of statically known - // object graphs (e.g. object literal boilerplate). - void EmitDeepCopy(Handle<JSObject> object, Register result, Register source, - int* offset, AllocationSiteMode mode); - - void EnsureSpaceForLazyDeopt(int space_needed) override; - void DoLoadKeyedExternalArray(LLoadKeyed* instr); - void DoLoadKeyedFixedDoubleArray(LLoadKeyed* instr); - void DoLoadKeyedFixedArray(LLoadKeyed* instr); - void DoStoreKeyedExternalArray(LStoreKeyed* instr); - void DoStoreKeyedFixedDoubleArray(LStoreKeyed* instr); - void DoStoreKeyedFixedArray(LStoreKeyed* instr); - - template <class T> - void EmitVectorLoadICRegisters(T* instr); - template <class T> - void EmitVectorStoreICRegisters(T* instr); - - ZoneList<LEnvironment*> deoptimizations_; - ZoneList<Deoptimizer::JumpTableEntry> jump_table_; - int inlined_function_count_; - Scope* const scope_; - TranslationBuffer translations_; - ZoneList<LDeferredCode*> deferred_; - int osr_pc_offset_; - bool frame_is_built_; - - // Builder that keeps track of safepoints in the code. The table - // itself is emitted at the end of the generated code. - SafepointTableBuilder safepoints_; - - // Compiler from a set of parallel moves to a sequential list of moves. - LGapResolver resolver_; - - Safepoint::Kind expected_safepoint_kind_; - - class PushSafepointRegistersScope final BASE_EMBEDDED { - public: - explicit PushSafepointRegistersScope(LCodeGen* codegen) - : codegen_(codegen) { - DCHECK(codegen_->info()->is_calling()); - DCHECK(codegen_->expected_safepoint_kind_ == Safepoint::kSimple); - codegen_->expected_safepoint_kind_ = Safepoint::kWithRegisters; - StoreRegistersStateStub stub(codegen_->isolate()); - codegen_->masm_->CallStub(&stub); - } - - ~PushSafepointRegistersScope() { - DCHECK(codegen_->expected_safepoint_kind_ == Safepoint::kWithRegisters); - RestoreRegistersStateStub stub(codegen_->isolate()); - codegen_->masm_->CallStub(&stub); - codegen_->expected_safepoint_kind_ = Safepoint::kSimple; - } - - private: - LCodeGen* codegen_; - }; - - friend class LDeferredCode; - friend class LEnvironment; - friend class SafepointGenerator; - DISALLOW_COPY_AND_ASSIGN(LCodeGen); -}; - - -class LDeferredCode : public ZoneObject { - public: - explicit LDeferredCode(LCodeGen* codegen) - : codegen_(codegen), - external_exit_(NULL), - instruction_index_(codegen->current_instruction_) { - codegen->AddDeferredCode(this); - } - - virtual ~LDeferredCode() {} - virtual void Generate() = 0; - virtual LInstruction* instr() = 0; - - void SetExit(Label* exit) { external_exit_ = exit; } - Label* entry() { return &entry_; } - Label* exit() { return external_exit_ != NULL ? external_exit_ : &exit_; } - int instruction_index() const { return instruction_index_; } - - protected: - LCodeGen* codegen() const { return codegen_; } - MacroAssembler* masm() const { return codegen_->masm(); } - - private: - LCodeGen* codegen_; - Label entry_; - Label exit_; - Label* external_exit_; - int instruction_index_; -}; -} -} // namespace v8::internal - -#endif // V8_PPC_LITHIUM_CODEGEN_PPC_H_ diff --git a/deps/v8/src/ppc/lithium-gap-resolver-ppc.cc b/deps/v8/src/ppc/lithium-gap-resolver-ppc.cc deleted file mode 100644 index 16fb665dda..0000000000 --- a/deps/v8/src/ppc/lithium-gap-resolver-ppc.cc +++ /dev/null @@ -1,286 +0,0 @@ -// Copyright 2014 the V8 project authors. All rights reserved. -// Use of this source code is governed by a BSD-style license that can be -// found in the LICENSE file. - -#include "src/ppc/lithium-codegen-ppc.h" -#include "src/ppc/lithium-gap-resolver-ppc.h" - -namespace v8 { -namespace internal { - -static const Register kSavedValueRegister = {11}; - -LGapResolver::LGapResolver(LCodeGen* owner) - : cgen_(owner), - moves_(32, owner->zone()), - root_index_(0), - in_cycle_(false), - saved_destination_(NULL) {} - - -void LGapResolver::Resolve(LParallelMove* parallel_move) { - DCHECK(moves_.is_empty()); - // Build up a worklist of moves. - BuildInitialMoveList(parallel_move); - - for (int i = 0; i < moves_.length(); ++i) { - LMoveOperands move = moves_[i]; - // Skip constants to perform them last. They don't block other moves - // and skipping such moves with register destinations keeps those - // registers free for the whole algorithm. - if (!move.IsEliminated() && !move.source()->IsConstantOperand()) { - root_index_ = i; // Any cycle is found when by reaching this move again. - PerformMove(i); - if (in_cycle_) { - RestoreValue(); - } - } - } - - // Perform the moves with constant sources. - for (int i = 0; i < moves_.length(); ++i) { - if (!moves_[i].IsEliminated()) { - DCHECK(moves_[i].source()->IsConstantOperand()); - EmitMove(i); - } - } - - moves_.Rewind(0); -} - - -void LGapResolver::BuildInitialMoveList(LParallelMove* parallel_move) { - // Perform a linear sweep of the moves to add them to the initial list of - // moves to perform, ignoring any move that is redundant (the source is - // the same as the destination, the destination is ignored and - // unallocated, or the move was already eliminated). - const ZoneList<LMoveOperands>* moves = parallel_move->move_operands(); - for (int i = 0; i < moves->length(); ++i) { - LMoveOperands move = moves->at(i); - if (!move.IsRedundant()) moves_.Add(move, cgen_->zone()); - } - Verify(); -} - - -void LGapResolver::PerformMove(int index) { - // Each call to this function performs a move and deletes it from the move - // graph. We first recursively perform any move blocking this one. We - // mark a move as "pending" on entry to PerformMove in order to detect - // cycles in the move graph. - - // We can only find a cycle, when doing a depth-first traversal of moves, - // be encountering the starting move again. So by spilling the source of - // the starting move, we break the cycle. All moves are then unblocked, - // and the starting move is completed by writing the spilled value to - // its destination. All other moves from the spilled source have been - // completed prior to breaking the cycle. - // An additional complication is that moves to MemOperands with large - // offsets (more than 1K or 4K) require us to spill this spilled value to - // the stack, to free up the register. - DCHECK(!moves_[index].IsPending()); - DCHECK(!moves_[index].IsRedundant()); - - // Clear this move's destination to indicate a pending move. The actual - // destination is saved in a stack allocated local. Multiple moves can - // be pending because this function is recursive. - DCHECK(moves_[index].source() != NULL); // Or else it will look eliminated. - LOperand* destination = moves_[index].destination(); - moves_[index].set_destination(NULL); - - // Perform a depth-first traversal of the move graph to resolve - // dependencies. Any unperformed, unpending move with a source the same - // as this one's destination blocks this one so recursively perform all - // such moves. - for (int i = 0; i < moves_.length(); ++i) { - LMoveOperands other_move = moves_[i]; - if (other_move.Blocks(destination) && !other_move.IsPending()) { - PerformMove(i); - // If there is a blocking, pending move it must be moves_[root_index_] - // and all other moves with the same source as moves_[root_index_] are - // sucessfully executed (because they are cycle-free) by this loop. - } - } - - // We are about to resolve this move and don't need it marked as - // pending, so restore its destination. - moves_[index].set_destination(destination); - - // The move may be blocked on a pending move, which must be the starting move. - // In this case, we have a cycle, and we save the source of this move to - // a scratch register to break it. - LMoveOperands other_move = moves_[root_index_]; - if (other_move.Blocks(destination)) { - DCHECK(other_move.IsPending()); - BreakCycle(index); - return; - } - - // This move is no longer blocked. - EmitMove(index); -} - - -void LGapResolver::Verify() { -#ifdef ENABLE_SLOW_DCHECKS - // No operand should be the destination for more than one move. - for (int i = 0; i < moves_.length(); ++i) { - LOperand* destination = moves_[i].destination(); - for (int j = i + 1; j < moves_.length(); ++j) { - SLOW_DCHECK(!destination->Equals(moves_[j].destination())); - } - } -#endif -} - -#define __ ACCESS_MASM(cgen_->masm()) - -void LGapResolver::BreakCycle(int index) { - // We save in a register the value that should end up in the source of - // moves_[root_index]. After performing all moves in the tree rooted - // in that move, we save the value to that source. - DCHECK(moves_[index].destination()->Equals(moves_[root_index_].source())); - DCHECK(!in_cycle_); - in_cycle_ = true; - LOperand* source = moves_[index].source(); - saved_destination_ = moves_[index].destination(); - if (source->IsRegister()) { - __ mr(kSavedValueRegister, cgen_->ToRegister(source)); - } else if (source->IsStackSlot()) { - __ LoadP(kSavedValueRegister, cgen_->ToMemOperand(source)); - } else if (source->IsDoubleRegister()) { - __ fmr(kScratchDoubleReg, cgen_->ToDoubleRegister(source)); - } else if (source->IsDoubleStackSlot()) { - __ lfd(kScratchDoubleReg, cgen_->ToMemOperand(source)); - } else { - UNREACHABLE(); - } - // This move will be done by restoring the saved value to the destination. - moves_[index].Eliminate(); -} - - -void LGapResolver::RestoreValue() { - DCHECK(in_cycle_); - DCHECK(saved_destination_ != NULL); - - // Spilled value is in kSavedValueRegister or kSavedDoubleValueRegister. - if (saved_destination_->IsRegister()) { - __ mr(cgen_->ToRegister(saved_destination_), kSavedValueRegister); - } else if (saved_destination_->IsStackSlot()) { - __ StoreP(kSavedValueRegister, cgen_->ToMemOperand(saved_destination_)); - } else if (saved_destination_->IsDoubleRegister()) { - __ fmr(cgen_->ToDoubleRegister(saved_destination_), kScratchDoubleReg); - } else if (saved_destination_->IsDoubleStackSlot()) { - __ stfd(kScratchDoubleReg, cgen_->ToMemOperand(saved_destination_)); - } else { - UNREACHABLE(); - } - - in_cycle_ = false; - saved_destination_ = NULL; -} - - -void LGapResolver::EmitMove(int index) { - LOperand* source = moves_[index].source(); - LOperand* destination = moves_[index].destination(); - - // Dispatch on the source and destination operand kinds. Not all - // combinations are possible. - - if (source->IsRegister()) { - Register source_register = cgen_->ToRegister(source); - if (destination->IsRegister()) { - __ mr(cgen_->ToRegister(destination), source_register); - } else { - DCHECK(destination->IsStackSlot()); - __ StoreP(source_register, cgen_->ToMemOperand(destination)); - } - } else if (source->IsStackSlot()) { - MemOperand source_operand = cgen_->ToMemOperand(source); - if (destination->IsRegister()) { - __ LoadP(cgen_->ToRegister(destination), source_operand); - } else { - DCHECK(destination->IsStackSlot()); - MemOperand destination_operand = cgen_->ToMemOperand(destination); - if (in_cycle_) { - __ LoadP(ip, source_operand); - __ StoreP(ip, destination_operand); - } else { - __ LoadP(kSavedValueRegister, source_operand); - __ StoreP(kSavedValueRegister, destination_operand); - } - } - - } else if (source->IsConstantOperand()) { - LConstantOperand* constant_source = LConstantOperand::cast(source); - if (destination->IsRegister()) { - Register dst = cgen_->ToRegister(destination); - if (cgen_->IsInteger32(constant_source)) { - cgen_->EmitLoadIntegerConstant(constant_source, dst); - } else { - __ Move(dst, cgen_->ToHandle(constant_source)); - } - } else if (destination->IsDoubleRegister()) { - DoubleRegister result = cgen_->ToDoubleRegister(destination); - double v = cgen_->ToDouble(constant_source); - __ LoadDoubleLiteral(result, v, ip); - } else { - DCHECK(destination->IsStackSlot()); - DCHECK(!in_cycle_); // Constant moves happen after all cycles are gone. - if (cgen_->IsInteger32(constant_source)) { - cgen_->EmitLoadIntegerConstant(constant_source, kSavedValueRegister); - } else { - __ Move(kSavedValueRegister, cgen_->ToHandle(constant_source)); - } - __ StoreP(kSavedValueRegister, cgen_->ToMemOperand(destination)); - } - - } else if (source->IsDoubleRegister()) { - DoubleRegister source_register = cgen_->ToDoubleRegister(source); - if (destination->IsDoubleRegister()) { - __ fmr(cgen_->ToDoubleRegister(destination), source_register); - } else { - DCHECK(destination->IsDoubleStackSlot()); - __ stfd(source_register, cgen_->ToMemOperand(destination)); - } - - } else if (source->IsDoubleStackSlot()) { - MemOperand source_operand = cgen_->ToMemOperand(source); - if (destination->IsDoubleRegister()) { - __ lfd(cgen_->ToDoubleRegister(destination), source_operand); - } else { - DCHECK(destination->IsDoubleStackSlot()); - MemOperand destination_operand = cgen_->ToMemOperand(destination); - if (in_cycle_) { -// kSavedDoubleValueRegister was used to break the cycle, -// but kSavedValueRegister is free. -#if V8_TARGET_ARCH_PPC64 - __ ld(kSavedValueRegister, source_operand); - __ std(kSavedValueRegister, destination_operand); -#else - MemOperand source_high_operand = cgen_->ToHighMemOperand(source); - MemOperand destination_high_operand = - cgen_->ToHighMemOperand(destination); - __ lwz(kSavedValueRegister, source_operand); - __ stw(kSavedValueRegister, destination_operand); - __ lwz(kSavedValueRegister, source_high_operand); - __ stw(kSavedValueRegister, destination_high_operand); -#endif - } else { - __ lfd(kScratchDoubleReg, source_operand); - __ stfd(kScratchDoubleReg, destination_operand); - } - } - } else { - UNREACHABLE(); - } - - moves_[index].Eliminate(); -} - - -#undef __ -} // namespace internal -} // namespace v8 diff --git a/deps/v8/src/ppc/lithium-gap-resolver-ppc.h b/deps/v8/src/ppc/lithium-gap-resolver-ppc.h deleted file mode 100644 index 7741080e55..0000000000 --- a/deps/v8/src/ppc/lithium-gap-resolver-ppc.h +++ /dev/null @@ -1,58 +0,0 @@ -// Copyright 2014 the V8 project authors. All rights reserved. -// Use of this source code is governed by a BSD-style license that can be -// found in the LICENSE file. - -#ifndef V8_PPC_LITHIUM_GAP_RESOLVER_PPC_H_ -#define V8_PPC_LITHIUM_GAP_RESOLVER_PPC_H_ - -#include "src/lithium.h" - -namespace v8 { -namespace internal { - -class LCodeGen; -class LGapResolver; - -class LGapResolver final BASE_EMBEDDED { - public: - explicit LGapResolver(LCodeGen* owner); - - // Resolve a set of parallel moves, emitting assembler instructions. - void Resolve(LParallelMove* parallel_move); - - private: - // Build the initial list of moves. - void BuildInitialMoveList(LParallelMove* parallel_move); - - // Perform the move at the moves_ index in question (possibly requiring - // other moves to satisfy dependencies). - void PerformMove(int index); - - // If a cycle is found in the series of moves, save the blocking value to - // a scratch register. The cycle must be found by hitting the root of the - // depth-first search. - void BreakCycle(int index); - - // After a cycle has been resolved, restore the value from the scratch - // register to its proper destination. - void RestoreValue(); - - // Emit a move and remove it from the move graph. - void EmitMove(int index); - - // Verify the move list before performing moves. - void Verify(); - - LCodeGen* cgen_; - - // List of moves not yet resolved. - ZoneList<LMoveOperands> moves_; - - int root_index_; - bool in_cycle_; - LOperand* saved_destination_; -}; -} -} // namespace v8::internal - -#endif // V8_PPC_LITHIUM_GAP_RESOLVER_PPC_H_ diff --git a/deps/v8/src/ppc/lithium-ppc.cc b/deps/v8/src/ppc/lithium-ppc.cc deleted file mode 100644 index 767c771fb3..0000000000 --- a/deps/v8/src/ppc/lithium-ppc.cc +++ /dev/null @@ -1,2652 +0,0 @@ -// Copyright 2014 the V8 project authors. All rights reserved. -// Use of this source code is governed by a BSD-style license that can be -// found in the LICENSE file. - -#include "src/ppc/lithium-ppc.h" - -#include <sstream> - -#include "src/hydrogen-osr.h" -#include "src/lithium-inl.h" -#include "src/ppc/lithium-codegen-ppc.h" - -namespace v8 { -namespace internal { - -#define DEFINE_COMPILE(type) \ - void L##type::CompileToNative(LCodeGen* generator) { \ - generator->Do##type(this); \ - } -LITHIUM_CONCRETE_INSTRUCTION_LIST(DEFINE_COMPILE) -#undef DEFINE_COMPILE - -#ifdef DEBUG -void LInstruction::VerifyCall() { - // Call instructions can use only fixed registers as temporaries and - // outputs because all registers are blocked by the calling convention. - // Inputs operands must use a fixed register or use-at-start policy or - // a non-register policy. - DCHECK(Output() == NULL || LUnallocated::cast(Output())->HasFixedPolicy() || - !LUnallocated::cast(Output())->HasRegisterPolicy()); - for (UseIterator it(this); !it.Done(); it.Advance()) { - LUnallocated* operand = LUnallocated::cast(it.Current()); - DCHECK(operand->HasFixedPolicy() || operand->IsUsedAtStart()); - } - for (TempIterator it(this); !it.Done(); it.Advance()) { - LUnallocated* operand = LUnallocated::cast(it.Current()); - DCHECK(operand->HasFixedPolicy() || !operand->HasRegisterPolicy()); - } -} -#endif - - -void LInstruction::PrintTo(StringStream* stream) { - stream->Add("%s ", this->Mnemonic()); - - PrintOutputOperandTo(stream); - - PrintDataTo(stream); - - if (HasEnvironment()) { - stream->Add(" "); - environment()->PrintTo(stream); - } - - if (HasPointerMap()) { - stream->Add(" "); - pointer_map()->PrintTo(stream); - } -} - - -void LInstruction::PrintDataTo(StringStream* stream) { - stream->Add("= "); - for (int i = 0; i < InputCount(); i++) { - if (i > 0) stream->Add(" "); - if (InputAt(i) == NULL) { - stream->Add("NULL"); - } else { - InputAt(i)->PrintTo(stream); - } - } -} - - -void LInstruction::PrintOutputOperandTo(StringStream* stream) { - if (HasResult()) result()->PrintTo(stream); -} - - -void LLabel::PrintDataTo(StringStream* stream) { - LGap::PrintDataTo(stream); - LLabel* rep = replacement(); - if (rep != NULL) { - stream->Add(" Dead block replaced with B%d", rep->block_id()); - } -} - - -bool LGap::IsRedundant() const { - for (int i = 0; i < 4; i++) { - if (parallel_moves_[i] != NULL && !parallel_moves_[i]->IsRedundant()) { - return false; - } - } - - return true; -} - - -void LGap::PrintDataTo(StringStream* stream) { - for (int i = 0; i < 4; i++) { - stream->Add("("); - if (parallel_moves_[i] != NULL) { - parallel_moves_[i]->PrintDataTo(stream); - } - stream->Add(") "); - } -} - - -const char* LArithmeticD::Mnemonic() const { - switch (op()) { - case Token::ADD: - return "add-d"; - case Token::SUB: - return "sub-d"; - case Token::MUL: - return "mul-d"; - case Token::DIV: - return "div-d"; - case Token::MOD: - return "mod-d"; - default: - UNREACHABLE(); - return NULL; - } -} - - -const char* LArithmeticT::Mnemonic() const { - switch (op()) { - case Token::ADD: - return "add-t"; - case Token::SUB: - return "sub-t"; - case Token::MUL: - return "mul-t"; - case Token::MOD: - return "mod-t"; - case Token::DIV: - return "div-t"; - case Token::BIT_AND: - return "bit-and-t"; - case Token::BIT_OR: - return "bit-or-t"; - case Token::BIT_XOR: - return "bit-xor-t"; - case Token::ROR: - return "ror-t"; - case Token::SHL: - return "shl-t"; - case Token::SAR: - return "sar-t"; - case Token::SHR: - return "shr-t"; - default: - UNREACHABLE(); - return NULL; - } -} - - -bool LGoto::HasInterestingComment(LCodeGen* gen) const { - return !gen->IsNextEmittedBlock(block_id()); -} - - -void LGoto::PrintDataTo(StringStream* stream) { - stream->Add("B%d", block_id()); -} - - -void LBranch::PrintDataTo(StringStream* stream) { - stream->Add("B%d | B%d on ", true_block_id(), false_block_id()); - value()->PrintTo(stream); -} - - -void LCompareNumericAndBranch::PrintDataTo(StringStream* stream) { - stream->Add("if "); - left()->PrintTo(stream); - stream->Add(" %s ", Token::String(op())); - right()->PrintTo(stream); - stream->Add(" then B%d else B%d", true_block_id(), false_block_id()); -} - - -void LIsStringAndBranch::PrintDataTo(StringStream* stream) { - stream->Add("if is_string("); - value()->PrintTo(stream); - stream->Add(") then B%d else B%d", true_block_id(), false_block_id()); -} - - -void LIsSmiAndBranch::PrintDataTo(StringStream* stream) { - stream->Add("if is_smi("); - value()->PrintTo(stream); - stream->Add(") then B%d else B%d", true_block_id(), false_block_id()); -} - - -void LIsUndetectableAndBranch::PrintDataTo(StringStream* stream) { - stream->Add("if is_undetectable("); - value()->PrintTo(stream); - stream->Add(") then B%d else B%d", true_block_id(), false_block_id()); -} - - -void LStringCompareAndBranch::PrintDataTo(StringStream* stream) { - stream->Add("if string_compare("); - left()->PrintTo(stream); - right()->PrintTo(stream); - stream->Add(") then B%d else B%d", true_block_id(), false_block_id()); -} - - -void LHasInstanceTypeAndBranch::PrintDataTo(StringStream* stream) { - stream->Add("if has_instance_type("); - value()->PrintTo(stream); - stream->Add(") then B%d else B%d", true_block_id(), false_block_id()); -} - - -void LHasCachedArrayIndexAndBranch::PrintDataTo(StringStream* stream) { - stream->Add("if has_cached_array_index("); - value()->PrintTo(stream); - stream->Add(") then B%d else B%d", true_block_id(), false_block_id()); -} - - -void LClassOfTestAndBranch::PrintDataTo(StringStream* stream) { - stream->Add("if class_of_test("); - value()->PrintTo(stream); - stream->Add(", \"%o\") then B%d else B%d", *hydrogen()->class_name(), - true_block_id(), false_block_id()); -} - - -void LTypeofIsAndBranch::PrintDataTo(StringStream* stream) { - stream->Add("if typeof "); - value()->PrintTo(stream); - stream->Add(" == \"%s\" then B%d else B%d", - hydrogen()->type_literal()->ToCString().get(), true_block_id(), - false_block_id()); -} - - -void LStoreCodeEntry::PrintDataTo(StringStream* stream) { - stream->Add(" = "); - function()->PrintTo(stream); - stream->Add(".code_entry = "); - code_object()->PrintTo(stream); -} - - -void LInnerAllocatedObject::PrintDataTo(StringStream* stream) { - stream->Add(" = "); - base_object()->PrintTo(stream); - stream->Add(" + "); - offset()->PrintTo(stream); -} - - -void LCallFunction::PrintDataTo(StringStream* stream) { - context()->PrintTo(stream); - stream->Add(" "); - function()->PrintTo(stream); - if (hydrogen()->HasVectorAndSlot()) { - stream->Add(" (type-feedback-vector "); - temp_vector()->PrintTo(stream); - stream->Add(" "); - temp_slot()->PrintTo(stream); - stream->Add(")"); - } -} - - -void LCallJSFunction::PrintDataTo(StringStream* stream) { - stream->Add("= "); - function()->PrintTo(stream); - stream->Add("#%d / ", arity()); -} - - -void LCallWithDescriptor::PrintDataTo(StringStream* stream) { - for (int i = 0; i < InputCount(); i++) { - InputAt(i)->PrintTo(stream); - stream->Add(" "); - } - stream->Add("#%d / ", arity()); -} - - -void LLoadContextSlot::PrintDataTo(StringStream* stream) { - context()->PrintTo(stream); - stream->Add("[%d]", slot_index()); -} - - -void LStoreContextSlot::PrintDataTo(StringStream* stream) { - context()->PrintTo(stream); - stream->Add("[%d] <- ", slot_index()); - value()->PrintTo(stream); -} - - -void LInvokeFunction::PrintDataTo(StringStream* stream) { - stream->Add("= "); - function()->PrintTo(stream); - stream->Add(" #%d / ", arity()); -} - - -void LCallNew::PrintDataTo(StringStream* stream) { - stream->Add("= "); - constructor()->PrintTo(stream); - stream->Add(" #%d / ", arity()); -} - - -void LCallNewArray::PrintDataTo(StringStream* stream) { - stream->Add("= "); - constructor()->PrintTo(stream); - stream->Add(" #%d / ", arity()); - ElementsKind kind = hydrogen()->elements_kind(); - stream->Add(" (%s) ", ElementsKindToString(kind)); -} - - -void LAccessArgumentsAt::PrintDataTo(StringStream* stream) { - arguments()->PrintTo(stream); - stream->Add(" length "); - length()->PrintTo(stream); - stream->Add(" index "); - index()->PrintTo(stream); -} - - -void LLoadGlobalViaContext::PrintDataTo(StringStream* stream) { - stream->Add("depth:%d slot:%d", depth(), slot_index()); -} - - -void LStoreNamedField::PrintDataTo(StringStream* stream) { - object()->PrintTo(stream); - std::ostringstream os; - os << hydrogen()->access() << " <- "; - stream->Add(os.str().c_str()); - value()->PrintTo(stream); -} - - -void LStoreNamedGeneric::PrintDataTo(StringStream* stream) { - object()->PrintTo(stream); - stream->Add("."); - stream->Add(String::cast(*name())->ToCString().get()); - stream->Add(" <- "); - value()->PrintTo(stream); -} - - -void LStoreGlobalViaContext::PrintDataTo(StringStream* stream) { - stream->Add("depth:%d slot:%d <- ", depth(), slot_index()); - value()->PrintTo(stream); -} - - -void LLoadKeyed::PrintDataTo(StringStream* stream) { - elements()->PrintTo(stream); - stream->Add("["); - key()->PrintTo(stream); - if (hydrogen()->IsDehoisted()) { - stream->Add(" + %d]", base_offset()); - } else { - stream->Add("]"); - } -} - - -void LStoreKeyed::PrintDataTo(StringStream* stream) { - elements()->PrintTo(stream); - stream->Add("["); - key()->PrintTo(stream); - if (hydrogen()->IsDehoisted()) { - stream->Add(" + %d] <-", base_offset()); - } else { - stream->Add("] <- "); - } - - if (value() == NULL) { - DCHECK(hydrogen()->IsConstantHoleStore() && - hydrogen()->value()->representation().IsDouble()); - stream->Add("<the hole(nan)>"); - } else { - value()->PrintTo(stream); - } -} - - -void LStoreKeyedGeneric::PrintDataTo(StringStream* stream) { - object()->PrintTo(stream); - stream->Add("["); - key()->PrintTo(stream); - stream->Add("] <- "); - value()->PrintTo(stream); -} - - -void LTransitionElementsKind::PrintDataTo(StringStream* stream) { - object()->PrintTo(stream); - stream->Add(" %p -> %p", *original_map(), *transitioned_map()); -} - - -int LPlatformChunk::GetNextSpillIndex(RegisterKind kind) { - // Skip a slot if for a double-width slot. - if (kind == DOUBLE_REGISTERS) spill_slot_count_++; - return spill_slot_count_++; -} - - -LOperand* LPlatformChunk::GetNextSpillSlot(RegisterKind kind) { - int index = GetNextSpillIndex(kind); - if (kind == DOUBLE_REGISTERS) { - return LDoubleStackSlot::Create(index, zone()); - } else { - DCHECK(kind == GENERAL_REGISTERS); - return LStackSlot::Create(index, zone()); - } -} - - -LPlatformChunk* LChunkBuilder::Build() { - DCHECK(is_unused()); - chunk_ = new (zone()) LPlatformChunk(info(), graph()); - LPhase phase("L_Building chunk", chunk_); - status_ = BUILDING; - - // If compiling for OSR, reserve space for the unoptimized frame, - // which will be subsumed into this frame. - if (graph()->has_osr()) { - for (int i = graph()->osr()->UnoptimizedFrameSlots(); i > 0; i--) { - chunk_->GetNextSpillIndex(GENERAL_REGISTERS); - } - } - - const ZoneList<HBasicBlock*>* blocks = graph()->blocks(); - for (int i = 0; i < blocks->length(); i++) { - HBasicBlock* next = NULL; - if (i < blocks->length() - 1) next = blocks->at(i + 1); - DoBasicBlock(blocks->at(i), next); - if (is_aborted()) return NULL; - } - status_ = DONE; - return chunk_; -} - - -LUnallocated* LChunkBuilder::ToUnallocated(Register reg) { - return new (zone()) LUnallocated(LUnallocated::FIXED_REGISTER, - Register::ToAllocationIndex(reg)); -} - - -LUnallocated* LChunkBuilder::ToUnallocated(DoubleRegister reg) { - return new (zone()) LUnallocated(LUnallocated::FIXED_DOUBLE_REGISTER, - DoubleRegister::ToAllocationIndex(reg)); -} - - -LOperand* LChunkBuilder::UseFixed(HValue* value, Register fixed_register) { - return Use(value, ToUnallocated(fixed_register)); -} - - -LOperand* LChunkBuilder::UseFixedDouble(HValue* value, DoubleRegister reg) { - return Use(value, ToUnallocated(reg)); -} - - -LOperand* LChunkBuilder::UseRegister(HValue* value) { - return Use(value, - new (zone()) LUnallocated(LUnallocated::MUST_HAVE_REGISTER)); -} - - -LOperand* LChunkBuilder::UseRegisterAtStart(HValue* value) { - return Use(value, new (zone()) LUnallocated(LUnallocated::MUST_HAVE_REGISTER, - LUnallocated::USED_AT_START)); -} - - -LOperand* LChunkBuilder::UseTempRegister(HValue* value) { - return Use(value, new (zone()) LUnallocated(LUnallocated::WRITABLE_REGISTER)); -} - - -LOperand* LChunkBuilder::Use(HValue* value) { - return Use(value, new (zone()) LUnallocated(LUnallocated::NONE)); -} - - -LOperand* LChunkBuilder::UseAtStart(HValue* value) { - return Use(value, new (zone()) - LUnallocated(LUnallocated::NONE, LUnallocated::USED_AT_START)); -} - - -LOperand* LChunkBuilder::UseOrConstant(HValue* value) { - return value->IsConstant() - ? chunk_->DefineConstantOperand(HConstant::cast(value)) - : Use(value); -} - - -LOperand* LChunkBuilder::UseOrConstantAtStart(HValue* value) { - return value->IsConstant() - ? chunk_->DefineConstantOperand(HConstant::cast(value)) - : UseAtStart(value); -} - - -LOperand* LChunkBuilder::UseRegisterOrConstant(HValue* value) { - return value->IsConstant() - ? chunk_->DefineConstantOperand(HConstant::cast(value)) - : UseRegister(value); -} - - -LOperand* LChunkBuilder::UseRegisterOrConstantAtStart(HValue* value) { - return value->IsConstant() - ? chunk_->DefineConstantOperand(HConstant::cast(value)) - : UseRegisterAtStart(value); -} - - -LOperand* LChunkBuilder::UseConstant(HValue* value) { - return chunk_->DefineConstantOperand(HConstant::cast(value)); -} - - -LOperand* LChunkBuilder::UseAny(HValue* value) { - return value->IsConstant() - ? chunk_->DefineConstantOperand(HConstant::cast(value)) - : Use(value, new (zone()) LUnallocated(LUnallocated::ANY)); -} - - -LOperand* LChunkBuilder::Use(HValue* value, LUnallocated* operand) { - if (value->EmitAtUses()) { - HInstruction* instr = HInstruction::cast(value); - VisitInstruction(instr); - } - operand->set_virtual_register(value->id()); - return operand; -} - - -LInstruction* LChunkBuilder::Define(LTemplateResultInstruction<1>* instr, - LUnallocated* result) { - result->set_virtual_register(current_instruction_->id()); - instr->set_result(result); - return instr; -} - - -LInstruction* LChunkBuilder::DefineAsRegister( - LTemplateResultInstruction<1>* instr) { - return Define(instr, - new (zone()) LUnallocated(LUnallocated::MUST_HAVE_REGISTER)); -} - - -LInstruction* LChunkBuilder::DefineAsSpilled( - LTemplateResultInstruction<1>* instr, int index) { - return Define(instr, - new (zone()) LUnallocated(LUnallocated::FIXED_SLOT, index)); -} - - -LInstruction* LChunkBuilder::DefineSameAsFirst( - LTemplateResultInstruction<1>* instr) { - return Define(instr, - new (zone()) LUnallocated(LUnallocated::SAME_AS_FIRST_INPUT)); -} - - -LInstruction* LChunkBuilder::DefineFixed(LTemplateResultInstruction<1>* instr, - Register reg) { - return Define(instr, ToUnallocated(reg)); -} - - -LInstruction* LChunkBuilder::DefineFixedDouble( - LTemplateResultInstruction<1>* instr, DoubleRegister reg) { - return Define(instr, ToUnallocated(reg)); -} - - -LInstruction* LChunkBuilder::AssignEnvironment(LInstruction* instr) { - HEnvironment* hydrogen_env = current_block_->last_environment(); - int argument_index_accumulator = 0; - ZoneList<HValue*> objects_to_materialize(0, zone()); - instr->set_environment(CreateEnvironment( - hydrogen_env, &argument_index_accumulator, &objects_to_materialize)); - return instr; -} - - -LInstruction* LChunkBuilder::MarkAsCall(LInstruction* instr, - HInstruction* hinstr, - CanDeoptimize can_deoptimize) { - info()->MarkAsNonDeferredCalling(); -#ifdef DEBUG - instr->VerifyCall(); -#endif - instr->MarkAsCall(); - instr = AssignPointerMap(instr); - - // If instruction does not have side-effects lazy deoptimization - // after the call will try to deoptimize to the point before the call. - // Thus we still need to attach environment to this call even if - // call sequence can not deoptimize eagerly. - bool needs_environment = (can_deoptimize == CAN_DEOPTIMIZE_EAGERLY) || - !hinstr->HasObservableSideEffects(); - if (needs_environment && !instr->HasEnvironment()) { - instr = AssignEnvironment(instr); - // We can't really figure out if the environment is needed or not. - instr->environment()->set_has_been_used(); - } - - return instr; -} - - -LInstruction* LChunkBuilder::AssignPointerMap(LInstruction* instr) { - DCHECK(!instr->HasPointerMap()); - instr->set_pointer_map(new (zone()) LPointerMap(zone())); - return instr; -} - - -LUnallocated* LChunkBuilder::TempRegister() { - LUnallocated* operand = - new (zone()) LUnallocated(LUnallocated::MUST_HAVE_REGISTER); - int vreg = allocator_->GetVirtualRegister(); - if (!allocator_->AllocationOk()) { - Abort(kOutOfVirtualRegistersWhileTryingToAllocateTempRegister); - vreg = 0; - } - operand->set_virtual_register(vreg); - return operand; -} - - -LUnallocated* LChunkBuilder::TempDoubleRegister() { - LUnallocated* operand = - new (zone()) LUnallocated(LUnallocated::MUST_HAVE_DOUBLE_REGISTER); - int vreg = allocator_->GetVirtualRegister(); - if (!allocator_->AllocationOk()) { - Abort(kOutOfVirtualRegistersWhileTryingToAllocateTempRegister); - vreg = 0; - } - operand->set_virtual_register(vreg); - return operand; -} - - -LOperand* LChunkBuilder::FixedTemp(Register reg) { - LUnallocated* operand = ToUnallocated(reg); - DCHECK(operand->HasFixedPolicy()); - return operand; -} - - -LOperand* LChunkBuilder::FixedTemp(DoubleRegister reg) { - LUnallocated* operand = ToUnallocated(reg); - DCHECK(operand->HasFixedPolicy()); - return operand; -} - - -LInstruction* LChunkBuilder::DoBlockEntry(HBlockEntry* instr) { - return new (zone()) LLabel(instr->block()); -} - - -LInstruction* LChunkBuilder::DoDummyUse(HDummyUse* instr) { - return DefineAsRegister(new (zone()) LDummyUse(UseAny(instr->value()))); -} - - -LInstruction* LChunkBuilder::DoEnvironmentMarker(HEnvironmentMarker* instr) { - UNREACHABLE(); - return NULL; -} - - -LInstruction* LChunkBuilder::DoDeoptimize(HDeoptimize* instr) { - return AssignEnvironment(new (zone()) LDeoptimize); -} - - -LInstruction* LChunkBuilder::DoShift(Token::Value op, - HBitwiseBinaryOperation* instr) { - if (instr->representation().IsSmiOrInteger32()) { - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - LOperand* left = UseRegisterAtStart(instr->left()); - - HValue* right_value = instr->right(); - LOperand* right = NULL; - int constant_value = 0; - bool does_deopt = false; - if (right_value->IsConstant()) { - HConstant* constant = HConstant::cast(right_value); - right = chunk_->DefineConstantOperand(constant); - constant_value = constant->Integer32Value() & 0x1f; - // Left shifts can deoptimize if we shift by > 0 and the result cannot be - // truncated to smi. - if (instr->representation().IsSmi() && constant_value > 0) { - does_deopt = !instr->CheckUsesForFlag(HValue::kTruncatingToSmi); - } - } else { - right = UseRegisterAtStart(right_value); - } - - // Shift operations can only deoptimize if we do a logical shift - // by 0 and the result cannot be truncated to int32. - if (op == Token::SHR && constant_value == 0) { - does_deopt = !instr->CheckFlag(HInstruction::kUint32); - } - - LInstruction* result = - DefineAsRegister(new (zone()) LShiftI(op, left, right, does_deopt)); - return does_deopt ? AssignEnvironment(result) : result; - } else { - return DoArithmeticT(op, instr); - } -} - - -LInstruction* LChunkBuilder::DoArithmeticD(Token::Value op, - HArithmeticBinaryOperation* instr) { - DCHECK(instr->representation().IsDouble()); - DCHECK(instr->left()->representation().IsDouble()); - DCHECK(instr->right()->representation().IsDouble()); - if (op == Token::MOD) { - LOperand* left = UseFixedDouble(instr->left(), d1); - LOperand* right = UseFixedDouble(instr->right(), d2); - LArithmeticD* result = new (zone()) LArithmeticD(op, left, right); - // We call a C function for double modulo. It can't trigger a GC. We need - // to use fixed result register for the call. - // TODO(fschneider): Allow any register as input registers. - return MarkAsCall(DefineFixedDouble(result, d1), instr); - } else { - LOperand* left = UseRegisterAtStart(instr->left()); - LOperand* right = UseRegisterAtStart(instr->right()); - LArithmeticD* result = new (zone()) LArithmeticD(op, left, right); - return DefineAsRegister(result); - } -} - - -LInstruction* LChunkBuilder::DoArithmeticT(Token::Value op, - HBinaryOperation* instr) { - HValue* left = instr->left(); - HValue* right = instr->right(); - DCHECK(left->representation().IsTagged()); - DCHECK(right->representation().IsTagged()); - LOperand* context = UseFixed(instr->context(), cp); - LOperand* left_operand = UseFixed(left, r4); - LOperand* right_operand = UseFixed(right, r3); - LArithmeticT* result = - new (zone()) LArithmeticT(op, context, left_operand, right_operand); - return MarkAsCall(DefineFixed(result, r3), instr); -} - - -void LChunkBuilder::DoBasicBlock(HBasicBlock* block, HBasicBlock* next_block) { - DCHECK(is_building()); - current_block_ = block; - next_block_ = next_block; - if (block->IsStartBlock()) { - block->UpdateEnvironment(graph_->start_environment()); - argument_count_ = 0; - } else if (block->predecessors()->length() == 1) { - // We have a single predecessor => copy environment and outgoing - // argument count from the predecessor. - DCHECK(block->phis()->length() == 0); - HBasicBlock* pred = block->predecessors()->at(0); - HEnvironment* last_environment = pred->last_environment(); - DCHECK(last_environment != NULL); - // Only copy the environment, if it is later used again. - if (pred->end()->SecondSuccessor() == NULL) { - DCHECK(pred->end()->FirstSuccessor() == block); - } else { - if (pred->end()->FirstSuccessor()->block_id() > block->block_id() || - pred->end()->SecondSuccessor()->block_id() > block->block_id()) { - last_environment = last_environment->Copy(); - } - } - block->UpdateEnvironment(last_environment); - DCHECK(pred->argument_count() >= 0); - argument_count_ = pred->argument_count(); - } else { - // We are at a state join => process phis. - HBasicBlock* pred = block->predecessors()->at(0); - // No need to copy the environment, it cannot be used later. - HEnvironment* last_environment = pred->last_environment(); - for (int i = 0; i < block->phis()->length(); ++i) { - HPhi* phi = block->phis()->at(i); - if (phi->HasMergedIndex()) { - last_environment->SetValueAt(phi->merged_index(), phi); - } - } - for (int i = 0; i < block->deleted_phis()->length(); ++i) { - if (block->deleted_phis()->at(i) < last_environment->length()) { - last_environment->SetValueAt(block->deleted_phis()->at(i), - graph_->GetConstantUndefined()); - } - } - block->UpdateEnvironment(last_environment); - // Pick up the outgoing argument count of one of the predecessors. - argument_count_ = pred->argument_count(); - } - HInstruction* current = block->first(); - int start = chunk_->instructions()->length(); - while (current != NULL && !is_aborted()) { - // Code for constants in registers is generated lazily. - if (!current->EmitAtUses()) { - VisitInstruction(current); - } - current = current->next(); - } - int end = chunk_->instructions()->length() - 1; - if (end >= start) { - block->set_first_instruction_index(start); - block->set_last_instruction_index(end); - } - block->set_argument_count(argument_count_); - next_block_ = NULL; - current_block_ = NULL; -} - - -void LChunkBuilder::VisitInstruction(HInstruction* current) { - HInstruction* old_current = current_instruction_; - current_instruction_ = current; - - LInstruction* instr = NULL; - if (current->CanReplaceWithDummyUses()) { - if (current->OperandCount() == 0) { - instr = DefineAsRegister(new (zone()) LDummy()); - } else { - DCHECK(!current->OperandAt(0)->IsControlInstruction()); - instr = DefineAsRegister(new (zone()) - LDummyUse(UseAny(current->OperandAt(0)))); - } - for (int i = 1; i < current->OperandCount(); ++i) { - if (current->OperandAt(i)->IsControlInstruction()) continue; - LInstruction* dummy = - new (zone()) LDummyUse(UseAny(current->OperandAt(i))); - dummy->set_hydrogen_value(current); - chunk_->AddInstruction(dummy, current_block_); - } - } else { - HBasicBlock* successor; - if (current->IsControlInstruction() && - HControlInstruction::cast(current)->KnownSuccessorBlock(&successor) && - successor != NULL) { - instr = new (zone()) LGoto(successor); - } else { - instr = current->CompileToLithium(this); - } - } - - argument_count_ += current->argument_delta(); - DCHECK(argument_count_ >= 0); - - if (instr != NULL) { - AddInstruction(instr, current); - } - - current_instruction_ = old_current; -} - - -void LChunkBuilder::AddInstruction(LInstruction* instr, - HInstruction* hydrogen_val) { - // Associate the hydrogen instruction first, since we may need it for - // the ClobbersRegisters() or ClobbersDoubleRegisters() calls below. - instr->set_hydrogen_value(hydrogen_val); - -#if DEBUG - // Make sure that the lithium instruction has either no fixed register - // constraints in temps or the result OR no uses that are only used at - // start. If this invariant doesn't hold, the register allocator can decide - // to insert a split of a range immediately before the instruction due to an - // already allocated register needing to be used for the instruction's fixed - // register constraint. In this case, The register allocator won't see an - // interference between the split child and the use-at-start (it would if - // the it was just a plain use), so it is free to move the split child into - // the same register that is used for the use-at-start. - // See https://code.google.com/p/chromium/issues/detail?id=201590 - if (!(instr->ClobbersRegisters() && - instr->ClobbersDoubleRegisters(isolate()))) { - int fixed = 0; - int used_at_start = 0; - for (UseIterator it(instr); !it.Done(); it.Advance()) { - LUnallocated* operand = LUnallocated::cast(it.Current()); - if (operand->IsUsedAtStart()) ++used_at_start; - } - if (instr->Output() != NULL) { - if (LUnallocated::cast(instr->Output())->HasFixedPolicy()) ++fixed; - } - for (TempIterator it(instr); !it.Done(); it.Advance()) { - LUnallocated* operand = LUnallocated::cast(it.Current()); - if (operand->HasFixedPolicy()) ++fixed; - } - DCHECK(fixed == 0 || used_at_start == 0); - } -#endif - - if (FLAG_stress_pointer_maps && !instr->HasPointerMap()) { - instr = AssignPointerMap(instr); - } - if (FLAG_stress_environments && !instr->HasEnvironment()) { - instr = AssignEnvironment(instr); - } - chunk_->AddInstruction(instr, current_block_); - - if (instr->IsCall() || instr->IsPrologue()) { - HValue* hydrogen_value_for_lazy_bailout = hydrogen_val; - if (hydrogen_val->HasObservableSideEffects()) { - HSimulate* sim = HSimulate::cast(hydrogen_val->next()); - sim->ReplayEnvironment(current_block_->last_environment()); - hydrogen_value_for_lazy_bailout = sim; - } - LInstruction* bailout = AssignEnvironment(new (zone()) LLazyBailout()); - bailout->set_hydrogen_value(hydrogen_value_for_lazy_bailout); - chunk_->AddInstruction(bailout, current_block_); - } -} - - -LInstruction* LChunkBuilder::DoPrologue(HPrologue* instr) { - return new (zone()) LPrologue(); -} - - -LInstruction* LChunkBuilder::DoGoto(HGoto* instr) { - return new (zone()) LGoto(instr->FirstSuccessor()); -} - - -LInstruction* LChunkBuilder::DoBranch(HBranch* instr) { - HValue* value = instr->value(); - Representation r = value->representation(); - HType type = value->type(); - ToBooleanStub::Types expected = instr->expected_input_types(); - if (expected.IsEmpty()) expected = ToBooleanStub::Types::Generic(); - - bool easy_case = !r.IsTagged() || type.IsBoolean() || type.IsSmi() || - type.IsJSArray() || type.IsHeapNumber() || type.IsString(); - LInstruction* branch = new (zone()) LBranch(UseRegister(value)); - if (!easy_case && - ((!expected.Contains(ToBooleanStub::SMI) && expected.NeedsMap()) || - !expected.IsGeneric())) { - branch = AssignEnvironment(branch); - } - return branch; -} - - -LInstruction* LChunkBuilder::DoDebugBreak(HDebugBreak* instr) { - return new (zone()) LDebugBreak(); -} - - -LInstruction* LChunkBuilder::DoCompareMap(HCompareMap* instr) { - DCHECK(instr->value()->representation().IsTagged()); - LOperand* value = UseRegisterAtStart(instr->value()); - LOperand* temp = TempRegister(); - return new (zone()) LCmpMapAndBranch(value, temp); -} - - -LInstruction* LChunkBuilder::DoArgumentsLength(HArgumentsLength* instr) { - info()->MarkAsRequiresFrame(); - LOperand* value = UseRegister(instr->value()); - return DefineAsRegister(new (zone()) LArgumentsLength(value)); -} - - -LInstruction* LChunkBuilder::DoArgumentsElements(HArgumentsElements* elems) { - info()->MarkAsRequiresFrame(); - return DefineAsRegister(new (zone()) LArgumentsElements); -} - - -LInstruction* LChunkBuilder::DoInstanceOf(HInstanceOf* instr) { - LOperand* left = - UseFixed(instr->left(), InstanceOfDescriptor::LeftRegister()); - LOperand* right = - UseFixed(instr->right(), InstanceOfDescriptor::RightRegister()); - LOperand* context = UseFixed(instr->context(), cp); - LInstanceOf* result = new (zone()) LInstanceOf(context, left, right); - return MarkAsCall(DefineFixed(result, r3), instr); -} - - -LInstruction* LChunkBuilder::DoHasInPrototypeChainAndBranch( - HHasInPrototypeChainAndBranch* instr) { - LOperand* object = UseRegister(instr->object()); - LOperand* prototype = UseRegister(instr->prototype()); - return new (zone()) LHasInPrototypeChainAndBranch(object, prototype); -} - - -LInstruction* LChunkBuilder::DoWrapReceiver(HWrapReceiver* instr) { - LOperand* receiver = UseRegisterAtStart(instr->receiver()); - LOperand* function = UseRegisterAtStart(instr->function()); - LWrapReceiver* result = new (zone()) LWrapReceiver(receiver, function); - return AssignEnvironment(DefineAsRegister(result)); -} - - -LInstruction* LChunkBuilder::DoApplyArguments(HApplyArguments* instr) { - LOperand* function = UseFixed(instr->function(), r4); - LOperand* receiver = UseFixed(instr->receiver(), r3); - LOperand* length = UseFixed(instr->length(), r5); - LOperand* elements = UseFixed(instr->elements(), r6); - LApplyArguments* result = - new (zone()) LApplyArguments(function, receiver, length, elements); - return MarkAsCall(DefineFixed(result, r3), instr, CAN_DEOPTIMIZE_EAGERLY); -} - - -LInstruction* LChunkBuilder::DoPushArguments(HPushArguments* instr) { - int argc = instr->OperandCount(); - for (int i = 0; i < argc; ++i) { - LOperand* argument = Use(instr->argument(i)); - AddInstruction(new (zone()) LPushArgument(argument), instr); - } - return NULL; -} - - -LInstruction* LChunkBuilder::DoStoreCodeEntry( - HStoreCodeEntry* store_code_entry) { - LOperand* function = UseRegister(store_code_entry->function()); - LOperand* code_object = UseTempRegister(store_code_entry->code_object()); - return new (zone()) LStoreCodeEntry(function, code_object); -} - - -LInstruction* LChunkBuilder::DoInnerAllocatedObject( - HInnerAllocatedObject* instr) { - LOperand* base_object = UseRegisterAtStart(instr->base_object()); - LOperand* offset = UseRegisterOrConstantAtStart(instr->offset()); - return DefineAsRegister(new (zone()) - LInnerAllocatedObject(base_object, offset)); -} - - -LInstruction* LChunkBuilder::DoThisFunction(HThisFunction* instr) { - return instr->HasNoUses() ? NULL - : DefineAsRegister(new (zone()) LThisFunction); -} - - -LInstruction* LChunkBuilder::DoContext(HContext* instr) { - if (instr->HasNoUses()) return NULL; - - if (info()->IsStub()) { - return DefineFixed(new (zone()) LContext, cp); - } - - return DefineAsRegister(new (zone()) LContext); -} - - -LInstruction* LChunkBuilder::DoDeclareGlobals(HDeclareGlobals* instr) { - LOperand* context = UseFixed(instr->context(), cp); - return MarkAsCall(new (zone()) LDeclareGlobals(context), instr); -} - - -LInstruction* LChunkBuilder::DoCallJSFunction(HCallJSFunction* instr) { - LOperand* function = UseFixed(instr->function(), r4); - - LCallJSFunction* result = new (zone()) LCallJSFunction(function); - - return MarkAsCall(DefineFixed(result, r3), instr); -} - - -LInstruction* LChunkBuilder::DoCallWithDescriptor(HCallWithDescriptor* instr) { - CallInterfaceDescriptor descriptor = instr->descriptor(); - - LOperand* target = UseRegisterOrConstantAtStart(instr->target()); - ZoneList<LOperand*> ops(instr->OperandCount(), zone()); - // Target - ops.Add(target, zone()); - // Context - LOperand* op = UseFixed(instr->OperandAt(1), cp); - ops.Add(op, zone()); - // Other register parameters - for (int i = LCallWithDescriptor::kImplicitRegisterParameterCount; - i < instr->OperandCount(); i++) { - op = - UseFixed(instr->OperandAt(i), - descriptor.GetRegisterParameter( - i - LCallWithDescriptor::kImplicitRegisterParameterCount)); - ops.Add(op, zone()); - } - - LCallWithDescriptor* result = - new (zone()) LCallWithDescriptor(descriptor, ops, zone()); - return MarkAsCall(DefineFixed(result, r3), instr); -} - - -LInstruction* LChunkBuilder::DoInvokeFunction(HInvokeFunction* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* function = UseFixed(instr->function(), r4); - LInvokeFunction* result = new (zone()) LInvokeFunction(context, function); - return MarkAsCall(DefineFixed(result, r3), instr, CANNOT_DEOPTIMIZE_EAGERLY); -} - - -LInstruction* LChunkBuilder::DoUnaryMathOperation(HUnaryMathOperation* instr) { - switch (instr->op()) { - case kMathFloor: - return DoMathFloor(instr); - case kMathRound: - return DoMathRound(instr); - case kMathFround: - return DoMathFround(instr); - case kMathAbs: - return DoMathAbs(instr); - case kMathLog: - return DoMathLog(instr); - case kMathExp: - return DoMathExp(instr); - case kMathSqrt: - return DoMathSqrt(instr); - case kMathPowHalf: - return DoMathPowHalf(instr); - case kMathClz32: - return DoMathClz32(instr); - default: - UNREACHABLE(); - return NULL; - } -} - - -LInstruction* LChunkBuilder::DoMathFloor(HUnaryMathOperation* instr) { - LOperand* input = UseRegister(instr->value()); - LMathFloor* result = new (zone()) LMathFloor(input); - return AssignEnvironment(AssignPointerMap(DefineAsRegister(result))); -} - - -LInstruction* LChunkBuilder::DoMathRound(HUnaryMathOperation* instr) { - LOperand* input = UseRegister(instr->value()); - LOperand* temp = TempDoubleRegister(); - LMathRound* result = new (zone()) LMathRound(input, temp); - return AssignEnvironment(DefineAsRegister(result)); -} - - -LInstruction* LChunkBuilder::DoMathFround(HUnaryMathOperation* instr) { - LOperand* input = UseRegister(instr->value()); - LMathFround* result = new (zone()) LMathFround(input); - return DefineAsRegister(result); -} - - -LInstruction* LChunkBuilder::DoMathAbs(HUnaryMathOperation* instr) { - Representation r = instr->value()->representation(); - LOperand* context = (r.IsDouble() || r.IsSmiOrInteger32()) - ? NULL - : UseFixed(instr->context(), cp); - LOperand* input = UseRegister(instr->value()); - LInstruction* result = - DefineAsRegister(new (zone()) LMathAbs(context, input)); - if (!r.IsDouble() && !r.IsSmiOrInteger32()) result = AssignPointerMap(result); - if (!r.IsDouble()) result = AssignEnvironment(result); - return result; -} - - -LInstruction* LChunkBuilder::DoMathLog(HUnaryMathOperation* instr) { - DCHECK(instr->representation().IsDouble()); - DCHECK(instr->value()->representation().IsDouble()); - LOperand* input = UseFixedDouble(instr->value(), d1); - return MarkAsCall(DefineFixedDouble(new (zone()) LMathLog(input), d1), instr); -} - - -LInstruction* LChunkBuilder::DoMathClz32(HUnaryMathOperation* instr) { - LOperand* input = UseRegisterAtStart(instr->value()); - LMathClz32* result = new (zone()) LMathClz32(input); - return DefineAsRegister(result); -} - - -LInstruction* LChunkBuilder::DoMathExp(HUnaryMathOperation* instr) { - DCHECK(instr->representation().IsDouble()); - DCHECK(instr->value()->representation().IsDouble()); - LOperand* input = UseRegister(instr->value()); - LOperand* temp1 = TempRegister(); - LOperand* temp2 = TempRegister(); - LOperand* double_temp = TempDoubleRegister(); - LMathExp* result = new (zone()) LMathExp(input, double_temp, temp1, temp2); - return DefineAsRegister(result); -} - - -LInstruction* LChunkBuilder::DoMathSqrt(HUnaryMathOperation* instr) { - LOperand* input = UseRegisterAtStart(instr->value()); - LMathSqrt* result = new (zone()) LMathSqrt(input); - return DefineAsRegister(result); -} - - -LInstruction* LChunkBuilder::DoMathPowHalf(HUnaryMathOperation* instr) { - LOperand* input = UseRegisterAtStart(instr->value()); - LMathPowHalf* result = new (zone()) LMathPowHalf(input); - return DefineAsRegister(result); -} - - -LInstruction* LChunkBuilder::DoCallNew(HCallNew* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* constructor = UseFixed(instr->constructor(), r4); - LCallNew* result = new (zone()) LCallNew(context, constructor); - return MarkAsCall(DefineFixed(result, r3), instr); -} - - -LInstruction* LChunkBuilder::DoCallNewArray(HCallNewArray* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* constructor = UseFixed(instr->constructor(), r4); - LCallNewArray* result = new (zone()) LCallNewArray(context, constructor); - return MarkAsCall(DefineFixed(result, r3), instr); -} - - -LInstruction* LChunkBuilder::DoCallFunction(HCallFunction* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* function = UseFixed(instr->function(), r4); - LOperand* slot = NULL; - LOperand* vector = NULL; - if (instr->HasVectorAndSlot()) { - slot = FixedTemp(r6); - vector = FixedTemp(r5); - } - - LCallFunction* call = - new (zone()) LCallFunction(context, function, slot, vector); - return MarkAsCall(DefineFixed(call, r3), instr); -} - - -LInstruction* LChunkBuilder::DoCallRuntime(HCallRuntime* instr) { - LOperand* context = UseFixed(instr->context(), cp); - return MarkAsCall(DefineFixed(new (zone()) LCallRuntime(context), r3), instr); -} - - -LInstruction* LChunkBuilder::DoRor(HRor* instr) { - return DoShift(Token::ROR, instr); -} - - -LInstruction* LChunkBuilder::DoShr(HShr* instr) { - return DoShift(Token::SHR, instr); -} - - -LInstruction* LChunkBuilder::DoSar(HSar* instr) { - return DoShift(Token::SAR, instr); -} - - -LInstruction* LChunkBuilder::DoShl(HShl* instr) { - return DoShift(Token::SHL, instr); -} - - -LInstruction* LChunkBuilder::DoBitwise(HBitwise* instr) { - if (instr->representation().IsSmiOrInteger32()) { - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - DCHECK(instr->CheckFlag(HValue::kTruncatingToInt32)); - - LOperand* left = UseRegisterAtStart(instr->BetterLeftOperand()); - LOperand* right = UseOrConstantAtStart(instr->BetterRightOperand()); - return DefineAsRegister(new (zone()) LBitI(left, right)); - } else { - return DoArithmeticT(instr->op(), instr); - } -} - - -LInstruction* LChunkBuilder::DoDivByPowerOf2I(HDiv* instr) { - DCHECK(instr->representation().IsSmiOrInteger32()); - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - LOperand* dividend = UseRegister(instr->left()); - int32_t divisor = instr->right()->GetInteger32Constant(); - LInstruction* result = - DefineAsRegister(new (zone()) LDivByPowerOf2I(dividend, divisor)); - if ((instr->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) || - (instr->CheckFlag(HValue::kCanOverflow) && divisor == -1) || - (!instr->CheckFlag(HInstruction::kAllUsesTruncatingToInt32) && - divisor != 1 && divisor != -1)) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoDivByConstI(HDiv* instr) { - DCHECK(instr->representation().IsInteger32()); - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - LOperand* dividend = UseRegister(instr->left()); - int32_t divisor = instr->right()->GetInteger32Constant(); - LInstruction* result = - DefineAsRegister(new (zone()) LDivByConstI(dividend, divisor)); - if (divisor == 0 || - (instr->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) || - !instr->CheckFlag(HInstruction::kAllUsesTruncatingToInt32)) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoDivI(HDiv* instr) { - DCHECK(instr->representation().IsSmiOrInteger32()); - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - LOperand* dividend = UseRegister(instr->left()); - LOperand* divisor = UseRegister(instr->right()); - LInstruction* result = - DefineAsRegister(new (zone()) LDivI(dividend, divisor)); - if (instr->CheckFlag(HValue::kCanBeDivByZero) || - instr->CheckFlag(HValue::kBailoutOnMinusZero) || - (instr->CheckFlag(HValue::kCanOverflow) && - !instr->CheckFlag(HValue::kAllUsesTruncatingToInt32)) || - (!instr->IsMathFloorOfDiv() && - !instr->CheckFlag(HValue::kAllUsesTruncatingToInt32))) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoDiv(HDiv* instr) { - if (instr->representation().IsSmiOrInteger32()) { - if (instr->RightIsPowerOf2()) { - return DoDivByPowerOf2I(instr); - } else if (instr->right()->IsConstant()) { - return DoDivByConstI(instr); - } else { - return DoDivI(instr); - } - } else if (instr->representation().IsDouble()) { - return DoArithmeticD(Token::DIV, instr); - } else { - return DoArithmeticT(Token::DIV, instr); - } -} - - -LInstruction* LChunkBuilder::DoFlooringDivByPowerOf2I(HMathFloorOfDiv* instr) { - LOperand* dividend = UseRegisterAtStart(instr->left()); - int32_t divisor = instr->right()->GetInteger32Constant(); - LInstruction* result = - DefineAsRegister(new (zone()) LFlooringDivByPowerOf2I(dividend, divisor)); - if ((instr->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) || - (instr->CheckFlag(HValue::kLeftCanBeMinInt) && divisor == -1)) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoFlooringDivByConstI(HMathFloorOfDiv* instr) { - DCHECK(instr->representation().IsInteger32()); - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - LOperand* dividend = UseRegister(instr->left()); - int32_t divisor = instr->right()->GetInteger32Constant(); - LOperand* temp = - ((divisor > 0 && !instr->CheckFlag(HValue::kLeftCanBeNegative)) || - (divisor < 0 && !instr->CheckFlag(HValue::kLeftCanBePositive))) - ? NULL - : TempRegister(); - LInstruction* result = DefineAsRegister( - new (zone()) LFlooringDivByConstI(dividend, divisor, temp)); - if (divisor == 0 || - (instr->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0)) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoFlooringDivI(HMathFloorOfDiv* instr) { - DCHECK(instr->representation().IsSmiOrInteger32()); - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - LOperand* dividend = UseRegister(instr->left()); - LOperand* divisor = UseRegister(instr->right()); - LInstruction* result = - DefineAsRegister(new (zone()) LFlooringDivI(dividend, divisor)); - if (instr->CheckFlag(HValue::kCanBeDivByZero) || - instr->CheckFlag(HValue::kBailoutOnMinusZero) || - (instr->CheckFlag(HValue::kCanOverflow) && - !instr->CheckFlag(HValue::kAllUsesTruncatingToInt32))) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoMathFloorOfDiv(HMathFloorOfDiv* instr) { - if (instr->RightIsPowerOf2()) { - return DoFlooringDivByPowerOf2I(instr); - } else if (instr->right()->IsConstant()) { - return DoFlooringDivByConstI(instr); - } else { - return DoFlooringDivI(instr); - } -} - - -LInstruction* LChunkBuilder::DoModByPowerOf2I(HMod* instr) { - DCHECK(instr->representation().IsSmiOrInteger32()); - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - LOperand* dividend = UseRegisterAtStart(instr->left()); - int32_t divisor = instr->right()->GetInteger32Constant(); - LInstruction* result = - DefineSameAsFirst(new (zone()) LModByPowerOf2I(dividend, divisor)); - if (instr->CheckFlag(HValue::kLeftCanBeNegative) && - instr->CheckFlag(HValue::kBailoutOnMinusZero)) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoModByConstI(HMod* instr) { - DCHECK(instr->representation().IsSmiOrInteger32()); - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - LOperand* dividend = UseRegister(instr->left()); - int32_t divisor = instr->right()->GetInteger32Constant(); - LInstruction* result = - DefineAsRegister(new (zone()) LModByConstI(dividend, divisor)); - if (divisor == 0 || instr->CheckFlag(HValue::kBailoutOnMinusZero)) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoModI(HMod* instr) { - DCHECK(instr->representation().IsSmiOrInteger32()); - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - LOperand* dividend = UseRegister(instr->left()); - LOperand* divisor = UseRegister(instr->right()); - LInstruction* result = - DefineAsRegister(new (zone()) LModI(dividend, divisor)); - if (instr->CheckFlag(HValue::kCanBeDivByZero) || - instr->CheckFlag(HValue::kBailoutOnMinusZero)) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoMod(HMod* instr) { - if (instr->representation().IsSmiOrInteger32()) { - if (instr->RightIsPowerOf2()) { - return DoModByPowerOf2I(instr); - } else if (instr->right()->IsConstant()) { - return DoModByConstI(instr); - } else { - return DoModI(instr); - } - } else if (instr->representation().IsDouble()) { - return DoArithmeticD(Token::MOD, instr); - } else { - return DoArithmeticT(Token::MOD, instr); - } -} - - -LInstruction* LChunkBuilder::DoMul(HMul* instr) { - if (instr->representation().IsSmiOrInteger32()) { - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - HValue* left = instr->BetterLeftOperand(); - HValue* right = instr->BetterRightOperand(); - LOperand* left_op; - LOperand* right_op; - bool can_overflow = instr->CheckFlag(HValue::kCanOverflow); - bool bailout_on_minus_zero = instr->CheckFlag(HValue::kBailoutOnMinusZero); - - int32_t constant_value = 0; - if (right->IsConstant()) { - HConstant* constant = HConstant::cast(right); - constant_value = constant->Integer32Value(); - // Constants -1, 0 and 1 can be optimized if the result can overflow. - // For other constants, it can be optimized only without overflow. - if (!can_overflow || ((constant_value >= -1) && (constant_value <= 1))) { - left_op = UseRegisterAtStart(left); - right_op = UseConstant(right); - } else { - if (bailout_on_minus_zero) { - left_op = UseRegister(left); - } else { - left_op = UseRegisterAtStart(left); - } - right_op = UseRegister(right); - } - } else { - if (bailout_on_minus_zero) { - left_op = UseRegister(left); - } else { - left_op = UseRegisterAtStart(left); - } - right_op = UseRegister(right); - } - LMulI* mul = new (zone()) LMulI(left_op, right_op); - if (right_op->IsConstantOperand() - ? ((can_overflow && constant_value == -1) || - (bailout_on_minus_zero && constant_value <= 0)) - : (can_overflow || bailout_on_minus_zero)) { - AssignEnvironment(mul); - } - return DefineAsRegister(mul); - - } else if (instr->representation().IsDouble()) { - return DoArithmeticD(Token::MUL, instr); - } else { - return DoArithmeticT(Token::MUL, instr); - } -} - - -LInstruction* LChunkBuilder::DoSub(HSub* instr) { - if (instr->representation().IsSmiOrInteger32()) { - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - - if (instr->left()->IsConstant() && - !instr->CheckFlag(HValue::kCanOverflow)) { - // If lhs is constant, do reverse subtraction instead. - return DoRSub(instr); - } - - LOperand* left = UseRegisterAtStart(instr->left()); - LOperand* right = UseOrConstantAtStart(instr->right()); - LSubI* sub = new (zone()) LSubI(left, right); - LInstruction* result = DefineAsRegister(sub); - if (instr->CheckFlag(HValue::kCanOverflow)) { - result = AssignEnvironment(result); - } - return result; - } else if (instr->representation().IsDouble()) { - return DoArithmeticD(Token::SUB, instr); - } else { - return DoArithmeticT(Token::SUB, instr); - } -} - - -LInstruction* LChunkBuilder::DoRSub(HSub* instr) { - DCHECK(instr->representation().IsSmiOrInteger32()); - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - DCHECK(!instr->CheckFlag(HValue::kCanOverflow)); - - // Note: The lhs of the subtraction becomes the rhs of the - // reverse-subtraction. - LOperand* left = UseRegisterAtStart(instr->right()); - LOperand* right = UseOrConstantAtStart(instr->left()); - LRSubI* rsb = new (zone()) LRSubI(left, right); - LInstruction* result = DefineAsRegister(rsb); - return result; -} - - -LInstruction* LChunkBuilder::DoMultiplyAdd(HMul* mul, HValue* addend) { - LOperand* multiplier_op = UseRegisterAtStart(mul->left()); - LOperand* multiplicand_op = UseRegisterAtStart(mul->right()); - LOperand* addend_op = UseRegisterAtStart(addend); - return DefineSameAsFirst( - new (zone()) LMultiplyAddD(addend_op, multiplier_op, multiplicand_op)); -} - - -LInstruction* LChunkBuilder::DoMultiplySub(HValue* minuend, HMul* mul) { - LOperand* minuend_op = UseRegisterAtStart(minuend); - LOperand* multiplier_op = UseRegisterAtStart(mul->left()); - LOperand* multiplicand_op = UseRegisterAtStart(mul->right()); - - return DefineSameAsFirst( - new (zone()) LMultiplySubD(minuend_op, multiplier_op, multiplicand_op)); -} - - -LInstruction* LChunkBuilder::DoAdd(HAdd* instr) { - if (instr->representation().IsSmiOrInteger32()) { - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - LOperand* left = UseRegisterAtStart(instr->BetterLeftOperand()); - LOperand* right = UseOrConstantAtStart(instr->BetterRightOperand()); - LAddI* add = new (zone()) LAddI(left, right); - LInstruction* result = DefineAsRegister(add); - if (instr->CheckFlag(HValue::kCanOverflow)) { - result = AssignEnvironment(result); - } - return result; - } else if (instr->representation().IsExternal()) { - DCHECK(instr->IsConsistentExternalRepresentation()); - DCHECK(!instr->CheckFlag(HValue::kCanOverflow)); - LOperand* left = UseRegisterAtStart(instr->left()); - LOperand* right = UseOrConstantAtStart(instr->right()); - LAddI* add = new (zone()) LAddI(left, right); - LInstruction* result = DefineAsRegister(add); - return result; - } else if (instr->representation().IsDouble()) { - return DoArithmeticD(Token::ADD, instr); - } else { - return DoArithmeticT(Token::ADD, instr); - } -} - - -LInstruction* LChunkBuilder::DoMathMinMax(HMathMinMax* instr) { - LOperand* left = NULL; - LOperand* right = NULL; - if (instr->representation().IsSmiOrInteger32()) { - DCHECK(instr->left()->representation().Equals(instr->representation())); - DCHECK(instr->right()->representation().Equals(instr->representation())); - left = UseRegisterAtStart(instr->BetterLeftOperand()); - right = UseOrConstantAtStart(instr->BetterRightOperand()); - } else { - DCHECK(instr->representation().IsDouble()); - DCHECK(instr->left()->representation().IsDouble()); - DCHECK(instr->right()->representation().IsDouble()); - left = UseRegisterAtStart(instr->left()); - right = UseRegisterAtStart(instr->right()); - } - return DefineAsRegister(new (zone()) LMathMinMax(left, right)); -} - - -LInstruction* LChunkBuilder::DoPower(HPower* instr) { - DCHECK(instr->representation().IsDouble()); - // We call a C function for double power. It can't trigger a GC. - // We need to use fixed result register for the call. - Representation exponent_type = instr->right()->representation(); - DCHECK(instr->left()->representation().IsDouble()); - LOperand* left = UseFixedDouble(instr->left(), d1); - LOperand* right = - exponent_type.IsDouble() - ? UseFixedDouble(instr->right(), d2) - : UseFixed(instr->right(), MathPowTaggedDescriptor::exponent()); - LPower* result = new (zone()) LPower(left, right); - return MarkAsCall(DefineFixedDouble(result, d3), instr, - CAN_DEOPTIMIZE_EAGERLY); -} - - -LInstruction* LChunkBuilder::DoCompareGeneric(HCompareGeneric* instr) { - DCHECK(instr->left()->representation().IsTagged()); - DCHECK(instr->right()->representation().IsTagged()); - LOperand* context = UseFixed(instr->context(), cp); - LOperand* left = UseFixed(instr->left(), r4); - LOperand* right = UseFixed(instr->right(), r3); - LCmpT* result = new (zone()) LCmpT(context, left, right); - return MarkAsCall(DefineFixed(result, r3), instr); -} - - -LInstruction* LChunkBuilder::DoCompareNumericAndBranch( - HCompareNumericAndBranch* instr) { - Representation r = instr->representation(); - if (r.IsSmiOrInteger32()) { - DCHECK(instr->left()->representation().Equals(r)); - DCHECK(instr->right()->representation().Equals(r)); - LOperand* left = UseRegisterOrConstantAtStart(instr->left()); - LOperand* right = UseRegisterOrConstantAtStart(instr->right()); - return new (zone()) LCompareNumericAndBranch(left, right); - } else { - DCHECK(r.IsDouble()); - DCHECK(instr->left()->representation().IsDouble()); - DCHECK(instr->right()->representation().IsDouble()); - LOperand* left = UseRegisterAtStart(instr->left()); - LOperand* right = UseRegisterAtStart(instr->right()); - return new (zone()) LCompareNumericAndBranch(left, right); - } -} - - -LInstruction* LChunkBuilder::DoCompareObjectEqAndBranch( - HCompareObjectEqAndBranch* instr) { - LOperand* left = UseRegisterAtStart(instr->left()); - LOperand* right = UseRegisterAtStart(instr->right()); - return new (zone()) LCmpObjectEqAndBranch(left, right); -} - - -LInstruction* LChunkBuilder::DoCompareHoleAndBranch( - HCompareHoleAndBranch* instr) { - LOperand* value = UseRegisterAtStart(instr->value()); - return new (zone()) LCmpHoleAndBranch(value); -} - - -LInstruction* LChunkBuilder::DoCompareMinusZeroAndBranch( - HCompareMinusZeroAndBranch* instr) { - LOperand* value = UseRegister(instr->value()); - LOperand* scratch = TempRegister(); - return new (zone()) LCompareMinusZeroAndBranch(value, scratch); -} - - -LInstruction* LChunkBuilder::DoIsStringAndBranch(HIsStringAndBranch* instr) { - DCHECK(instr->value()->representation().IsTagged()); - LOperand* value = UseRegisterAtStart(instr->value()); - LOperand* temp = TempRegister(); - return new (zone()) LIsStringAndBranch(value, temp); -} - - -LInstruction* LChunkBuilder::DoIsSmiAndBranch(HIsSmiAndBranch* instr) { - DCHECK(instr->value()->representation().IsTagged()); - return new (zone()) LIsSmiAndBranch(Use(instr->value())); -} - - -LInstruction* LChunkBuilder::DoIsUndetectableAndBranch( - HIsUndetectableAndBranch* instr) { - DCHECK(instr->value()->representation().IsTagged()); - LOperand* value = UseRegisterAtStart(instr->value()); - return new (zone()) LIsUndetectableAndBranch(value, TempRegister()); -} - - -LInstruction* LChunkBuilder::DoStringCompareAndBranch( - HStringCompareAndBranch* instr) { - DCHECK(instr->left()->representation().IsTagged()); - DCHECK(instr->right()->representation().IsTagged()); - LOperand* context = UseFixed(instr->context(), cp); - LOperand* left = UseFixed(instr->left(), r4); - LOperand* right = UseFixed(instr->right(), r3); - LStringCompareAndBranch* result = - new (zone()) LStringCompareAndBranch(context, left, right); - return MarkAsCall(result, instr); -} - - -LInstruction* LChunkBuilder::DoHasInstanceTypeAndBranch( - HHasInstanceTypeAndBranch* instr) { - DCHECK(instr->value()->representation().IsTagged()); - LOperand* value = UseRegisterAtStart(instr->value()); - return new (zone()) LHasInstanceTypeAndBranch(value); -} - - -LInstruction* LChunkBuilder::DoGetCachedArrayIndex( - HGetCachedArrayIndex* instr) { - DCHECK(instr->value()->representation().IsTagged()); - LOperand* value = UseRegisterAtStart(instr->value()); - - return DefineAsRegister(new (zone()) LGetCachedArrayIndex(value)); -} - - -LInstruction* LChunkBuilder::DoHasCachedArrayIndexAndBranch( - HHasCachedArrayIndexAndBranch* instr) { - DCHECK(instr->value()->representation().IsTagged()); - return new (zone()) - LHasCachedArrayIndexAndBranch(UseRegisterAtStart(instr->value())); -} - - -LInstruction* LChunkBuilder::DoClassOfTestAndBranch( - HClassOfTestAndBranch* instr) { - DCHECK(instr->value()->representation().IsTagged()); - LOperand* value = UseRegister(instr->value()); - return new (zone()) LClassOfTestAndBranch(value, TempRegister()); -} - - -LInstruction* LChunkBuilder::DoMapEnumLength(HMapEnumLength* instr) { - LOperand* map = UseRegisterAtStart(instr->value()); - return DefineAsRegister(new (zone()) LMapEnumLength(map)); -} - - -LInstruction* LChunkBuilder::DoDateField(HDateField* instr) { - LOperand* object = UseFixed(instr->value(), r3); - LDateField* result = - new (zone()) LDateField(object, FixedTemp(r4), instr->index()); - return MarkAsCall(DefineFixed(result, r3), instr, CANNOT_DEOPTIMIZE_EAGERLY); -} - - -LInstruction* LChunkBuilder::DoSeqStringGetChar(HSeqStringGetChar* instr) { - LOperand* string = UseRegisterAtStart(instr->string()); - LOperand* index = UseRegisterOrConstantAtStart(instr->index()); - return DefineAsRegister(new (zone()) LSeqStringGetChar(string, index)); -} - - -LInstruction* LChunkBuilder::DoSeqStringSetChar(HSeqStringSetChar* instr) { - LOperand* string = UseRegisterAtStart(instr->string()); - LOperand* index = FLAG_debug_code - ? UseRegisterAtStart(instr->index()) - : UseRegisterOrConstantAtStart(instr->index()); - LOperand* value = UseRegisterAtStart(instr->value()); - LOperand* context = FLAG_debug_code ? UseFixed(instr->context(), cp) : NULL; - return new (zone()) LSeqStringSetChar(context, string, index, value); -} - - -LInstruction* LChunkBuilder::DoBoundsCheck(HBoundsCheck* instr) { - if (!FLAG_debug_code && instr->skip_check()) return NULL; - LOperand* index = UseRegisterOrConstantAtStart(instr->index()); - LOperand* length = !index->IsConstantOperand() - ? UseRegisterOrConstantAtStart(instr->length()) - : UseRegisterAtStart(instr->length()); - LInstruction* result = new (zone()) LBoundsCheck(index, length); - if (!FLAG_debug_code || !instr->skip_check()) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoBoundsCheckBaseIndexInformation( - HBoundsCheckBaseIndexInformation* instr) { - UNREACHABLE(); - return NULL; -} - - -LInstruction* LChunkBuilder::DoAbnormalExit(HAbnormalExit* instr) { - // The control instruction marking the end of a block that completed - // abruptly (e.g., threw an exception). There is nothing specific to do. - return NULL; -} - - -LInstruction* LChunkBuilder::DoUseConst(HUseConst* instr) { return NULL; } - - -LInstruction* LChunkBuilder::DoForceRepresentation(HForceRepresentation* bad) { - // All HForceRepresentation instructions should be eliminated in the - // representation change phase of Hydrogen. - UNREACHABLE(); - return NULL; -} - - -LInstruction* LChunkBuilder::DoChange(HChange* instr) { - Representation from = instr->from(); - Representation to = instr->to(); - HValue* val = instr->value(); - if (from.IsSmi()) { - if (to.IsTagged()) { - LOperand* value = UseRegister(val); - return DefineSameAsFirst(new (zone()) LDummyUse(value)); - } - from = Representation::Tagged(); - } - if (from.IsTagged()) { - if (to.IsDouble()) { - LOperand* value = UseRegister(val); - LInstruction* result = - DefineAsRegister(new (zone()) LNumberUntagD(value)); - if (!val->representation().IsSmi()) result = AssignEnvironment(result); - return result; - } else if (to.IsSmi()) { - LOperand* value = UseRegister(val); - if (val->type().IsSmi()) { - return DefineSameAsFirst(new (zone()) LDummyUse(value)); - } - return AssignEnvironment( - DefineSameAsFirst(new (zone()) LCheckSmi(value))); - } else { - DCHECK(to.IsInteger32()); - if (val->type().IsSmi() || val->representation().IsSmi()) { - LOperand* value = UseRegisterAtStart(val); - return DefineAsRegister(new (zone()) LSmiUntag(value, false)); - } else { - LOperand* value = UseRegister(val); - LOperand* temp1 = TempRegister(); - LOperand* temp2 = TempDoubleRegister(); - LInstruction* result = - DefineSameAsFirst(new (zone()) LTaggedToI(value, temp1, temp2)); - if (!val->representation().IsSmi()) result = AssignEnvironment(result); - return result; - } - } - } else if (from.IsDouble()) { - if (to.IsTagged()) { - info()->MarkAsDeferredCalling(); - LOperand* value = UseRegister(val); - LOperand* temp1 = TempRegister(); - LOperand* temp2 = TempRegister(); - LUnallocated* result_temp = TempRegister(); - LNumberTagD* result = new (zone()) LNumberTagD(value, temp1, temp2); - return AssignPointerMap(Define(result, result_temp)); - } else if (to.IsSmi()) { - LOperand* value = UseRegister(val); - return AssignEnvironment( - DefineAsRegister(new (zone()) LDoubleToSmi(value))); - } else { - DCHECK(to.IsInteger32()); - LOperand* value = UseRegister(val); - LInstruction* result = DefineAsRegister(new (zone()) LDoubleToI(value)); - if (!instr->CanTruncateToInt32()) result = AssignEnvironment(result); - return result; - } - } else if (from.IsInteger32()) { - info()->MarkAsDeferredCalling(); - if (to.IsTagged()) { - if (!instr->CheckFlag(HValue::kCanOverflow)) { - LOperand* value = UseRegisterAtStart(val); - return DefineAsRegister(new (zone()) LSmiTag(value)); - } else if (val->CheckFlag(HInstruction::kUint32)) { - LOperand* value = UseRegisterAtStart(val); - LOperand* temp1 = TempRegister(); - LOperand* temp2 = TempRegister(); - LNumberTagU* result = new (zone()) LNumberTagU(value, temp1, temp2); - return AssignPointerMap(DefineAsRegister(result)); - } else { - LOperand* value = UseRegisterAtStart(val); - LOperand* temp1 = TempRegister(); - LOperand* temp2 = TempRegister(); - LNumberTagI* result = new (zone()) LNumberTagI(value, temp1, temp2); - return AssignPointerMap(DefineAsRegister(result)); - } - } else if (to.IsSmi()) { - LOperand* value = UseRegister(val); - LInstruction* result = DefineAsRegister(new (zone()) LSmiTag(value)); - if (instr->CheckFlag(HValue::kCanOverflow)) { - result = AssignEnvironment(result); - } - return result; - } else { - DCHECK(to.IsDouble()); - if (val->CheckFlag(HInstruction::kUint32)) { - return DefineAsRegister(new (zone()) LUint32ToDouble(UseRegister(val))); - } else { - return DefineAsRegister(new (zone()) LInteger32ToDouble(Use(val))); - } - } - } - UNREACHABLE(); - return NULL; -} - - -LInstruction* LChunkBuilder::DoCheckHeapObject(HCheckHeapObject* instr) { - LOperand* value = UseRegisterAtStart(instr->value()); - LInstruction* result = new (zone()) LCheckNonSmi(value); - if (!instr->value()->type().IsHeapObject()) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoCheckSmi(HCheckSmi* instr) { - LOperand* value = UseRegisterAtStart(instr->value()); - return AssignEnvironment(new (zone()) LCheckSmi(value)); -} - - -LInstruction* LChunkBuilder::DoCheckArrayBufferNotNeutered( - HCheckArrayBufferNotNeutered* instr) { - LOperand* view = UseRegisterAtStart(instr->value()); - LCheckArrayBufferNotNeutered* result = - new (zone()) LCheckArrayBufferNotNeutered(view); - return AssignEnvironment(result); -} - - -LInstruction* LChunkBuilder::DoCheckInstanceType(HCheckInstanceType* instr) { - LOperand* value = UseRegisterAtStart(instr->value()); - LInstruction* result = new (zone()) LCheckInstanceType(value); - return AssignEnvironment(result); -} - - -LInstruction* LChunkBuilder::DoCheckValue(HCheckValue* instr) { - LOperand* value = UseRegisterAtStart(instr->value()); - return AssignEnvironment(new (zone()) LCheckValue(value)); -} - - -LInstruction* LChunkBuilder::DoCheckMaps(HCheckMaps* instr) { - if (instr->IsStabilityCheck()) return new (zone()) LCheckMaps; - LOperand* value = UseRegisterAtStart(instr->value()); - LOperand* temp = TempRegister(); - LInstruction* result = - AssignEnvironment(new (zone()) LCheckMaps(value, temp)); - if (instr->HasMigrationTarget()) { - info()->MarkAsDeferredCalling(); - result = AssignPointerMap(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoClampToUint8(HClampToUint8* instr) { - HValue* value = instr->value(); - Representation input_rep = value->representation(); - LOperand* reg = UseRegister(value); - if (input_rep.IsDouble()) { - return DefineAsRegister(new (zone()) LClampDToUint8(reg)); - } else if (input_rep.IsInteger32()) { - return DefineAsRegister(new (zone()) LClampIToUint8(reg)); - } else { - DCHECK(input_rep.IsSmiOrTagged()); - LClampTToUint8* result = - new (zone()) LClampTToUint8(reg, TempDoubleRegister()); - return AssignEnvironment(DefineAsRegister(result)); - } -} - - -LInstruction* LChunkBuilder::DoDoubleBits(HDoubleBits* instr) { - HValue* value = instr->value(); - DCHECK(value->representation().IsDouble()); - return DefineAsRegister(new (zone()) LDoubleBits(UseRegister(value))); -} - - -LInstruction* LChunkBuilder::DoConstructDouble(HConstructDouble* instr) { - LOperand* lo = UseRegister(instr->lo()); - LOperand* hi = UseRegister(instr->hi()); - return DefineAsRegister(new (zone()) LConstructDouble(hi, lo)); -} - - -LInstruction* LChunkBuilder::DoReturn(HReturn* instr) { - LOperand* context = info()->IsStub() ? UseFixed(instr->context(), cp) : NULL; - LOperand* parameter_count = UseRegisterOrConstant(instr->parameter_count()); - return new (zone()) - LReturn(UseFixed(instr->value(), r3), context, parameter_count); -} - - -LInstruction* LChunkBuilder::DoConstant(HConstant* instr) { - Representation r = instr->representation(); - if (r.IsSmi()) { - return DefineAsRegister(new (zone()) LConstantS); - } else if (r.IsInteger32()) { - return DefineAsRegister(new (zone()) LConstantI); - } else if (r.IsDouble()) { - return DefineAsRegister(new (zone()) LConstantD); - } else if (r.IsExternal()) { - return DefineAsRegister(new (zone()) LConstantE); - } else if (r.IsTagged()) { - return DefineAsRegister(new (zone()) LConstantT); - } else { - UNREACHABLE(); - return NULL; - } -} - - -LInstruction* LChunkBuilder::DoLoadGlobalGeneric(HLoadGlobalGeneric* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* global_object = - UseFixed(instr->global_object(), LoadDescriptor::ReceiverRegister()); - LOperand* vector = NULL; - if (instr->HasVectorAndSlot()) { - vector = FixedTemp(LoadWithVectorDescriptor::VectorRegister()); - } - LLoadGlobalGeneric* result = - new (zone()) LLoadGlobalGeneric(context, global_object, vector); - return MarkAsCall(DefineFixed(result, r3), instr); -} - - -LInstruction* LChunkBuilder::DoLoadGlobalViaContext( - HLoadGlobalViaContext* instr) { - LOperand* context = UseFixed(instr->context(), cp); - DCHECK(instr->slot_index() > 0); - LLoadGlobalViaContext* result = new (zone()) LLoadGlobalViaContext(context); - return MarkAsCall(DefineFixed(result, r3), instr); -} - - -LInstruction* LChunkBuilder::DoLoadContextSlot(HLoadContextSlot* instr) { - LOperand* context = UseRegisterAtStart(instr->value()); - LInstruction* result = - DefineAsRegister(new (zone()) LLoadContextSlot(context)); - if (instr->RequiresHoleCheck() && instr->DeoptimizesOnHole()) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoStoreContextSlot(HStoreContextSlot* instr) { - LOperand* context; - LOperand* value; - if (instr->NeedsWriteBarrier()) { - context = UseTempRegister(instr->context()); - value = UseTempRegister(instr->value()); - } else { - context = UseRegister(instr->context()); - value = UseRegister(instr->value()); - } - LInstruction* result = new (zone()) LStoreContextSlot(context, value); - if (instr->RequiresHoleCheck() && instr->DeoptimizesOnHole()) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoLoadNamedField(HLoadNamedField* instr) { - LOperand* obj = UseRegisterAtStart(instr->object()); - return DefineAsRegister(new (zone()) LLoadNamedField(obj)); -} - - -LInstruction* LChunkBuilder::DoLoadNamedGeneric(HLoadNamedGeneric* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* object = - UseFixed(instr->object(), LoadDescriptor::ReceiverRegister()); - LOperand* vector = NULL; - if (instr->HasVectorAndSlot()) { - vector = FixedTemp(LoadWithVectorDescriptor::VectorRegister()); - } - - LInstruction* result = - DefineFixed(new (zone()) LLoadNamedGeneric(context, object, vector), r3); - return MarkAsCall(result, instr); -} - - -LInstruction* LChunkBuilder::DoLoadFunctionPrototype( - HLoadFunctionPrototype* instr) { - return AssignEnvironment(DefineAsRegister( - new (zone()) LLoadFunctionPrototype(UseRegister(instr->function())))); -} - - -LInstruction* LChunkBuilder::DoLoadRoot(HLoadRoot* instr) { - return DefineAsRegister(new (zone()) LLoadRoot); -} - - -LInstruction* LChunkBuilder::DoLoadKeyed(HLoadKeyed* instr) { - DCHECK(instr->key()->representation().IsSmiOrInteger32()); - ElementsKind elements_kind = instr->elements_kind(); - LOperand* key = UseRegisterOrConstantAtStart(instr->key()); - LInstruction* result = NULL; - - if (!instr->is_fixed_typed_array()) { - LOperand* obj = NULL; - if (instr->representation().IsDouble()) { - obj = UseRegister(instr->elements()); - } else { - obj = UseRegisterAtStart(instr->elements()); - } - result = DefineAsRegister(new (zone()) LLoadKeyed(obj, key)); - } else { - DCHECK((instr->representation().IsInteger32() && - !IsDoubleOrFloatElementsKind(elements_kind)) || - (instr->representation().IsDouble() && - IsDoubleOrFloatElementsKind(elements_kind))); - LOperand* backing_store = UseRegister(instr->elements()); - result = DefineAsRegister(new (zone()) LLoadKeyed(backing_store, key)); - } - - bool needs_environment; - if (instr->is_fixed_typed_array()) { - // see LCodeGen::DoLoadKeyedExternalArray - needs_environment = elements_kind == UINT32_ELEMENTS && - !instr->CheckFlag(HInstruction::kUint32); - } else { - // see LCodeGen::DoLoadKeyedFixedDoubleArray and - // LCodeGen::DoLoadKeyedFixedArray - needs_environment = - instr->RequiresHoleCheck() || - (instr->hole_mode() == CONVERT_HOLE_TO_UNDEFINED && info()->IsStub()); - } - - if (needs_environment) { - result = AssignEnvironment(result); - } - return result; -} - - -LInstruction* LChunkBuilder::DoLoadKeyedGeneric(HLoadKeyedGeneric* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* object = - UseFixed(instr->object(), LoadDescriptor::ReceiverRegister()); - LOperand* key = UseFixed(instr->key(), LoadDescriptor::NameRegister()); - LOperand* vector = NULL; - if (instr->HasVectorAndSlot()) { - vector = FixedTemp(LoadWithVectorDescriptor::VectorRegister()); - } - - LInstruction* result = DefineFixed( - new (zone()) LLoadKeyedGeneric(context, object, key, vector), r3); - return MarkAsCall(result, instr); -} - - -LInstruction* LChunkBuilder::DoStoreKeyed(HStoreKeyed* instr) { - if (!instr->is_fixed_typed_array()) { - DCHECK(instr->elements()->representation().IsTagged()); - bool needs_write_barrier = instr->NeedsWriteBarrier(); - LOperand* object = NULL; - LOperand* key = NULL; - LOperand* val = NULL; - - if (instr->value()->representation().IsDouble()) { - object = UseRegisterAtStart(instr->elements()); - val = UseRegister(instr->value()); - key = UseRegisterOrConstantAtStart(instr->key()); - } else { - if (needs_write_barrier) { - object = UseTempRegister(instr->elements()); - val = UseTempRegister(instr->value()); - key = UseTempRegister(instr->key()); - } else { - object = UseRegisterAtStart(instr->elements()); - val = UseRegisterAtStart(instr->value()); - key = UseRegisterOrConstantAtStart(instr->key()); - } - } - - return new (zone()) LStoreKeyed(object, key, val); - } - - DCHECK((instr->value()->representation().IsInteger32() && - !IsDoubleOrFloatElementsKind(instr->elements_kind())) || - (instr->value()->representation().IsDouble() && - IsDoubleOrFloatElementsKind(instr->elements_kind()))); - DCHECK(instr->elements()->representation().IsExternal()); - LOperand* val = UseRegister(instr->value()); - LOperand* key = UseRegisterOrConstantAtStart(instr->key()); - LOperand* backing_store = UseRegister(instr->elements()); - return new (zone()) LStoreKeyed(backing_store, key, val); -} - - -LInstruction* LChunkBuilder::DoStoreKeyedGeneric(HStoreKeyedGeneric* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* obj = - UseFixed(instr->object(), StoreDescriptor::ReceiverRegister()); - LOperand* key = UseFixed(instr->key(), StoreDescriptor::NameRegister()); - LOperand* val = UseFixed(instr->value(), StoreDescriptor::ValueRegister()); - - DCHECK(instr->object()->representation().IsTagged()); - DCHECK(instr->key()->representation().IsTagged()); - DCHECK(instr->value()->representation().IsTagged()); - - LOperand* slot = NULL; - LOperand* vector = NULL; - if (instr->HasVectorAndSlot()) { - slot = FixedTemp(VectorStoreICDescriptor::SlotRegister()); - vector = FixedTemp(VectorStoreICDescriptor::VectorRegister()); - } - - LStoreKeyedGeneric* result = - new (zone()) LStoreKeyedGeneric(context, obj, key, val, slot, vector); - return MarkAsCall(result, instr); -} - - -LInstruction* LChunkBuilder::DoTransitionElementsKind( - HTransitionElementsKind* instr) { - if (IsSimpleMapChangeTransition(instr->from_kind(), instr->to_kind())) { - LOperand* object = UseRegister(instr->object()); - LOperand* new_map_reg = TempRegister(); - LTransitionElementsKind* result = - new (zone()) LTransitionElementsKind(object, NULL, new_map_reg); - return result; - } else { - LOperand* object = UseFixed(instr->object(), r3); - LOperand* context = UseFixed(instr->context(), cp); - LTransitionElementsKind* result = - new (zone()) LTransitionElementsKind(object, context, NULL); - return MarkAsCall(result, instr); - } -} - - -LInstruction* LChunkBuilder::DoTrapAllocationMemento( - HTrapAllocationMemento* instr) { - LOperand* object = UseRegister(instr->object()); - LOperand* temp = TempRegister(); - LTrapAllocationMemento* result = - new (zone()) LTrapAllocationMemento(object, temp); - return AssignEnvironment(result); -} - - -LInstruction* LChunkBuilder::DoMaybeGrowElements(HMaybeGrowElements* instr) { - info()->MarkAsDeferredCalling(); - LOperand* context = UseFixed(instr->context(), cp); - LOperand* object = Use(instr->object()); - LOperand* elements = Use(instr->elements()); - LOperand* key = UseRegisterOrConstant(instr->key()); - LOperand* current_capacity = UseRegisterOrConstant(instr->current_capacity()); - - LMaybeGrowElements* result = new (zone()) - LMaybeGrowElements(context, object, elements, key, current_capacity); - DefineFixed(result, r3); - return AssignPointerMap(AssignEnvironment(result)); -} - - -LInstruction* LChunkBuilder::DoStoreNamedField(HStoreNamedField* instr) { - bool is_in_object = instr->access().IsInobject(); - bool needs_write_barrier = instr->NeedsWriteBarrier(); - bool needs_write_barrier_for_map = - instr->has_transition() && instr->NeedsWriteBarrierForMap(); - - LOperand* obj; - if (needs_write_barrier) { - obj = is_in_object ? UseRegister(instr->object()) - : UseTempRegister(instr->object()); - } else { - obj = needs_write_barrier_for_map ? UseRegister(instr->object()) - : UseRegisterAtStart(instr->object()); - } - - LOperand* val; - if (needs_write_barrier) { - val = UseTempRegister(instr->value()); - } else if (instr->field_representation().IsDouble()) { - val = UseRegisterAtStart(instr->value()); - } else { - val = UseRegister(instr->value()); - } - - // We need a temporary register for write barrier of the map field. - LOperand* temp = needs_write_barrier_for_map ? TempRegister() : NULL; - - return new (zone()) LStoreNamedField(obj, val, temp); -} - - -LInstruction* LChunkBuilder::DoStoreNamedGeneric(HStoreNamedGeneric* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* obj = - UseFixed(instr->object(), StoreDescriptor::ReceiverRegister()); - LOperand* val = UseFixed(instr->value(), StoreDescriptor::ValueRegister()); - LOperand* slot = NULL; - LOperand* vector = NULL; - if (instr->HasVectorAndSlot()) { - slot = FixedTemp(VectorStoreICDescriptor::SlotRegister()); - vector = FixedTemp(VectorStoreICDescriptor::VectorRegister()); - } - - LStoreNamedGeneric* result = - new (zone()) LStoreNamedGeneric(context, obj, val, slot, vector); - return MarkAsCall(result, instr); -} - - -LInstruction* LChunkBuilder::DoStoreGlobalViaContext( - HStoreGlobalViaContext* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* value = UseFixed(instr->value(), - StoreGlobalViaContextDescriptor::ValueRegister()); - DCHECK(instr->slot_index() > 0); - - LStoreGlobalViaContext* result = - new (zone()) LStoreGlobalViaContext(context, value); - return MarkAsCall(result, instr); -} - - -LInstruction* LChunkBuilder::DoStringAdd(HStringAdd* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* left = UseFixed(instr->left(), r4); - LOperand* right = UseFixed(instr->right(), r3); - return MarkAsCall( - DefineFixed(new (zone()) LStringAdd(context, left, right), r3), instr); -} - - -LInstruction* LChunkBuilder::DoStringCharCodeAt(HStringCharCodeAt* instr) { - LOperand* string = UseTempRegister(instr->string()); - LOperand* index = UseTempRegister(instr->index()); - LOperand* context = UseAny(instr->context()); - LStringCharCodeAt* result = - new (zone()) LStringCharCodeAt(context, string, index); - return AssignPointerMap(DefineAsRegister(result)); -} - - -LInstruction* LChunkBuilder::DoStringCharFromCode(HStringCharFromCode* instr) { - LOperand* char_code = UseRegister(instr->value()); - LOperand* context = UseAny(instr->context()); - LStringCharFromCode* result = - new (zone()) LStringCharFromCode(context, char_code); - return AssignPointerMap(DefineAsRegister(result)); -} - - -LInstruction* LChunkBuilder::DoAllocate(HAllocate* instr) { - info()->MarkAsDeferredCalling(); - LOperand* context = UseAny(instr->context()); - LOperand* size = UseRegisterOrConstant(instr->size()); - LOperand* temp1 = TempRegister(); - LOperand* temp2 = TempRegister(); - LAllocate* result = new (zone()) LAllocate(context, size, temp1, temp2); - return AssignPointerMap(DefineAsRegister(result)); -} - - -LInstruction* LChunkBuilder::DoRegExpLiteral(HRegExpLiteral* instr) { - LOperand* context = UseFixed(instr->context(), cp); - return MarkAsCall(DefineFixed(new (zone()) LRegExpLiteral(context), r3), - instr); -} - - -LInstruction* LChunkBuilder::DoOsrEntry(HOsrEntry* instr) { - DCHECK(argument_count_ == 0); - allocator_->MarkAsOsrEntry(); - current_block_->last_environment()->set_ast_id(instr->ast_id()); - return AssignEnvironment(new (zone()) LOsrEntry); -} - - -LInstruction* LChunkBuilder::DoParameter(HParameter* instr) { - LParameter* result = new (zone()) LParameter; - if (instr->kind() == HParameter::STACK_PARAMETER) { - int spill_index = chunk()->GetParameterStackSlot(instr->index()); - return DefineAsSpilled(result, spill_index); - } else { - DCHECK(info()->IsStub()); - CallInterfaceDescriptor descriptor = - info()->code_stub()->GetCallInterfaceDescriptor(); - int index = static_cast<int>(instr->index()); - Register reg = descriptor.GetRegisterParameter(index); - return DefineFixed(result, reg); - } -} - - -LInstruction* LChunkBuilder::DoUnknownOSRValue(HUnknownOSRValue* instr) { - // Use an index that corresponds to the location in the unoptimized frame, - // which the optimized frame will subsume. - int env_index = instr->index(); - int spill_index = 0; - if (instr->environment()->is_parameter_index(env_index)) { - spill_index = chunk()->GetParameterStackSlot(env_index); - } else { - spill_index = env_index - instr->environment()->first_local_index(); - if (spill_index > LUnallocated::kMaxFixedSlotIndex) { - Retry(kTooManySpillSlotsNeededForOSR); - spill_index = 0; - } - } - return DefineAsSpilled(new (zone()) LUnknownOSRValue, spill_index); -} - - -LInstruction* LChunkBuilder::DoCallStub(HCallStub* instr) { - LOperand* context = UseFixed(instr->context(), cp); - return MarkAsCall(DefineFixed(new (zone()) LCallStub(context), r3), instr); -} - - -LInstruction* LChunkBuilder::DoArgumentsObject(HArgumentsObject* instr) { - // There are no real uses of the arguments object. - // arguments.length and element access are supported directly on - // stack arguments, and any real arguments object use causes a bailout. - // So this value is never used. - return NULL; -} - - -LInstruction* LChunkBuilder::DoCapturedObject(HCapturedObject* instr) { - instr->ReplayEnvironment(current_block_->last_environment()); - - // There are no real uses of a captured object. - return NULL; -} - - -LInstruction* LChunkBuilder::DoAccessArgumentsAt(HAccessArgumentsAt* instr) { - info()->MarkAsRequiresFrame(); - LOperand* args = UseRegister(instr->arguments()); - LOperand* length = UseRegisterOrConstantAtStart(instr->length()); - LOperand* index = UseRegisterOrConstantAtStart(instr->index()); - return DefineAsRegister(new (zone()) LAccessArgumentsAt(args, length, index)); -} - - -LInstruction* LChunkBuilder::DoToFastProperties(HToFastProperties* instr) { - LOperand* object = UseFixed(instr->value(), r3); - LToFastProperties* result = new (zone()) LToFastProperties(object); - return MarkAsCall(DefineFixed(result, r3), instr); -} - - -LInstruction* LChunkBuilder::DoTypeof(HTypeof* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* value = UseFixed(instr->value(), r6); - LTypeof* result = new (zone()) LTypeof(context, value); - return MarkAsCall(DefineFixed(result, r3), instr); -} - - -LInstruction* LChunkBuilder::DoTypeofIsAndBranch(HTypeofIsAndBranch* instr) { - return new (zone()) LTypeofIsAndBranch(UseRegister(instr->value())); -} - - -LInstruction* LChunkBuilder::DoIsConstructCallAndBranch( - HIsConstructCallAndBranch* instr) { - return new (zone()) LIsConstructCallAndBranch(TempRegister()); -} - - -LInstruction* LChunkBuilder::DoSimulate(HSimulate* instr) { - instr->ReplayEnvironment(current_block_->last_environment()); - return NULL; -} - - -LInstruction* LChunkBuilder::DoStackCheck(HStackCheck* instr) { - if (instr->is_function_entry()) { - LOperand* context = UseFixed(instr->context(), cp); - return MarkAsCall(new (zone()) LStackCheck(context), instr); - } else { - DCHECK(instr->is_backwards_branch()); - LOperand* context = UseAny(instr->context()); - return AssignEnvironment( - AssignPointerMap(new (zone()) LStackCheck(context))); - } -} - - -LInstruction* LChunkBuilder::DoEnterInlined(HEnterInlined* instr) { - HEnvironment* outer = current_block_->last_environment(); - outer->set_ast_id(instr->ReturnId()); - HConstant* undefined = graph()->GetConstantUndefined(); - HEnvironment* inner = outer->CopyForInlining( - instr->closure(), instr->arguments_count(), instr->function(), undefined, - instr->inlining_kind()); - // Only replay binding of arguments object if it wasn't removed from graph. - if (instr->arguments_var() != NULL && instr->arguments_object()->IsLinked()) { - inner->Bind(instr->arguments_var(), instr->arguments_object()); - } - inner->BindContext(instr->closure_context()); - inner->set_entry(instr); - current_block_->UpdateEnvironment(inner); - chunk_->AddInlinedFunction(instr->shared()); - return NULL; -} - - -LInstruction* LChunkBuilder::DoLeaveInlined(HLeaveInlined* instr) { - LInstruction* pop = NULL; - - HEnvironment* env = current_block_->last_environment(); - - if (env->entry()->arguments_pushed()) { - int argument_count = env->arguments_environment()->parameter_count(); - pop = new (zone()) LDrop(argument_count); - DCHECK(instr->argument_delta() == -argument_count); - } - - HEnvironment* outer = - current_block_->last_environment()->DiscardInlined(false); - current_block_->UpdateEnvironment(outer); - - return pop; -} - - -LInstruction* LChunkBuilder::DoForInPrepareMap(HForInPrepareMap* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* object = UseFixed(instr->enumerable(), r3); - LForInPrepareMap* result = new (zone()) LForInPrepareMap(context, object); - return MarkAsCall(DefineFixed(result, r3), instr, CAN_DEOPTIMIZE_EAGERLY); -} - - -LInstruction* LChunkBuilder::DoForInCacheArray(HForInCacheArray* instr) { - LOperand* map = UseRegister(instr->map()); - return AssignEnvironment( - DefineAsRegister(new (zone()) LForInCacheArray(map))); -} - - -LInstruction* LChunkBuilder::DoCheckMapValue(HCheckMapValue* instr) { - LOperand* value = UseRegisterAtStart(instr->value()); - LOperand* map = UseRegisterAtStart(instr->map()); - return AssignEnvironment(new (zone()) LCheckMapValue(value, map)); -} - - -LInstruction* LChunkBuilder::DoLoadFieldByIndex(HLoadFieldByIndex* instr) { - LOperand* object = UseRegister(instr->object()); - LOperand* index = UseTempRegister(instr->index()); - LLoadFieldByIndex* load = new (zone()) LLoadFieldByIndex(object, index); - LInstruction* result = DefineSameAsFirst(load); - return AssignPointerMap(result); -} - - -LInstruction* LChunkBuilder::DoStoreFrameContext(HStoreFrameContext* instr) { - LOperand* context = UseRegisterAtStart(instr->context()); - return new (zone()) LStoreFrameContext(context); -} - - -LInstruction* LChunkBuilder::DoAllocateBlockContext( - HAllocateBlockContext* instr) { - LOperand* context = UseFixed(instr->context(), cp); - LOperand* function = UseRegisterAtStart(instr->function()); - LAllocateBlockContext* result = - new (zone()) LAllocateBlockContext(context, function); - return MarkAsCall(DefineFixed(result, cp), instr); -} -} // namespace internal -} // namespace v8 diff --git a/deps/v8/src/ppc/lithium-ppc.h b/deps/v8/src/ppc/lithium-ppc.h deleted file mode 100644 index e862a11f63..0000000000 --- a/deps/v8/src/ppc/lithium-ppc.h +++ /dev/null @@ -1,2766 +0,0 @@ -// Copyright 2014 the V8 project authors. All rights reserved. -// Use of this source code is governed by a BSD-style license that can be -// found in the LICENSE file. - -#ifndef V8_PPC_LITHIUM_PPC_H_ -#define V8_PPC_LITHIUM_PPC_H_ - -#include "src/hydrogen.h" -#include "src/lithium.h" -#include "src/lithium-allocator.h" -#include "src/safepoint-table.h" -#include "src/utils.h" - -namespace v8 { -namespace internal { - -// Forward declarations. -class LCodeGen; - -#define LITHIUM_CONCRETE_INSTRUCTION_LIST(V) \ - V(AccessArgumentsAt) \ - V(AddI) \ - V(Allocate) \ - V(AllocateBlockContext) \ - V(ApplyArguments) \ - V(ArgumentsElements) \ - V(ArgumentsLength) \ - V(ArithmeticD) \ - V(ArithmeticT) \ - V(BitI) \ - V(BoundsCheck) \ - V(Branch) \ - V(CallJSFunction) \ - V(CallWithDescriptor) \ - V(CallFunction) \ - V(CallNew) \ - V(CallNewArray) \ - V(CallRuntime) \ - V(CallStub) \ - V(CheckArrayBufferNotNeutered) \ - V(CheckInstanceType) \ - V(CheckNonSmi) \ - V(CheckMaps) \ - V(CheckMapValue) \ - V(CheckSmi) \ - V(CheckValue) \ - V(ClampDToUint8) \ - V(ClampIToUint8) \ - V(ClampTToUint8) \ - V(ClassOfTestAndBranch) \ - V(CompareMinusZeroAndBranch) \ - V(CompareNumericAndBranch) \ - V(CmpObjectEqAndBranch) \ - V(CmpHoleAndBranch) \ - V(CmpMapAndBranch) \ - V(CmpT) \ - V(ConstantD) \ - V(ConstantE) \ - V(ConstantI) \ - V(ConstantS) \ - V(ConstantT) \ - V(ConstructDouble) \ - V(Context) \ - V(DateField) \ - V(DebugBreak) \ - V(DeclareGlobals) \ - V(Deoptimize) \ - V(DivByConstI) \ - V(DivByPowerOf2I) \ - V(DivI) \ - V(DoubleBits) \ - V(DoubleToI) \ - V(DoubleToSmi) \ - V(Drop) \ - V(Dummy) \ - V(DummyUse) \ - V(FlooringDivByConstI) \ - V(FlooringDivByPowerOf2I) \ - V(FlooringDivI) \ - V(ForInCacheArray) \ - V(ForInPrepareMap) \ - V(GetCachedArrayIndex) \ - V(Goto) \ - V(HasCachedArrayIndexAndBranch) \ - V(HasInPrototypeChainAndBranch) \ - V(HasInstanceTypeAndBranch) \ - V(InnerAllocatedObject) \ - V(InstanceOf) \ - V(InstructionGap) \ - V(Integer32ToDouble) \ - V(InvokeFunction) \ - V(IsConstructCallAndBranch) \ - V(IsStringAndBranch) \ - V(IsSmiAndBranch) \ - V(IsUndetectableAndBranch) \ - V(Label) \ - V(LazyBailout) \ - V(LoadContextSlot) \ - V(LoadRoot) \ - V(LoadFieldByIndex) \ - V(LoadFunctionPrototype) \ - V(LoadGlobalGeneric) \ - V(LoadGlobalViaContext) \ - V(LoadKeyed) \ - V(LoadKeyedGeneric) \ - V(LoadNamedField) \ - V(LoadNamedGeneric) \ - V(MapEnumLength) \ - V(MathAbs) \ - V(MathClz32) \ - V(MathExp) \ - V(MathFloor) \ - V(MathFround) \ - V(MathLog) \ - V(MathMinMax) \ - V(MathPowHalf) \ - V(MathRound) \ - V(MathSqrt) \ - V(MaybeGrowElements) \ - V(ModByConstI) \ - V(ModByPowerOf2I) \ - V(ModI) \ - V(MulI) \ - V(MultiplyAddD) \ - V(MultiplySubD) \ - V(NumberTagD) \ - V(NumberTagI) \ - V(NumberTagU) \ - V(NumberUntagD) \ - V(OsrEntry) \ - V(Parameter) \ - V(Power) \ - V(Prologue) \ - V(PushArgument) \ - V(RegExpLiteral) \ - V(Return) \ - V(SeqStringGetChar) \ - V(SeqStringSetChar) \ - V(ShiftI) \ - V(SmiTag) \ - V(SmiUntag) \ - V(StackCheck) \ - V(StoreCodeEntry) \ - V(StoreContextSlot) \ - V(StoreFrameContext) \ - V(StoreGlobalViaContext) \ - V(StoreKeyed) \ - V(StoreKeyedGeneric) \ - V(StoreNamedField) \ - V(StoreNamedGeneric) \ - V(StringAdd) \ - V(StringCharCodeAt) \ - V(StringCharFromCode) \ - V(StringCompareAndBranch) \ - V(SubI) \ - V(RSubI) \ - V(TaggedToI) \ - V(ThisFunction) \ - V(ToFastProperties) \ - V(TransitionElementsKind) \ - V(TrapAllocationMemento) \ - V(Typeof) \ - V(TypeofIsAndBranch) \ - V(Uint32ToDouble) \ - V(UnknownOSRValue) \ - V(WrapReceiver) - - -#define DECLARE_CONCRETE_INSTRUCTION(type, mnemonic) \ - Opcode opcode() const final { return LInstruction::k##type; } \ - void CompileToNative(LCodeGen* generator) final; \ - const char* Mnemonic() const final { return mnemonic; } \ - static L##type* cast(LInstruction* instr) { \ - DCHECK(instr->Is##type()); \ - return reinterpret_cast<L##type*>(instr); \ - } - - -#define DECLARE_HYDROGEN_ACCESSOR(type) \ - H##type* hydrogen() const { return H##type::cast(hydrogen_value()); } - - -class LInstruction : public ZoneObject { - public: - LInstruction() - : environment_(NULL), - hydrogen_value_(NULL), - bit_field_(IsCallBits::encode(false)) {} - - virtual ~LInstruction() {} - - virtual void CompileToNative(LCodeGen* generator) = 0; - virtual const char* Mnemonic() const = 0; - virtual void PrintTo(StringStream* stream); - virtual void PrintDataTo(StringStream* stream); - virtual void PrintOutputOperandTo(StringStream* stream); - - enum Opcode { -// Declare a unique enum value for each instruction. -#define DECLARE_OPCODE(type) k##type, - LITHIUM_CONCRETE_INSTRUCTION_LIST(DECLARE_OPCODE) kNumberOfInstructions -#undef DECLARE_OPCODE - }; - - virtual Opcode opcode() const = 0; - -// Declare non-virtual type testers for all leaf IR classes. -#define DECLARE_PREDICATE(type) \ - bool Is##type() const { return opcode() == k##type; } - LITHIUM_CONCRETE_INSTRUCTION_LIST(DECLARE_PREDICATE) -#undef DECLARE_PREDICATE - - // Declare virtual predicates for instructions that don't have - // an opcode. - virtual bool IsGap() const { return false; } - - virtual bool IsControl() const { return false; } - - // Try deleting this instruction if possible. - virtual bool TryDelete() { return false; } - - void set_environment(LEnvironment* env) { environment_ = env; } - LEnvironment* environment() const { return environment_; } - bool HasEnvironment() const { return environment_ != NULL; } - - void set_pointer_map(LPointerMap* p) { pointer_map_.set(p); } - LPointerMap* pointer_map() const { return pointer_map_.get(); } - bool HasPointerMap() const { return pointer_map_.is_set(); } - - void set_hydrogen_value(HValue* value) { hydrogen_value_ = value; } - HValue* hydrogen_value() const { return hydrogen_value_; } - - void MarkAsCall() { bit_field_ = IsCallBits::update(bit_field_, true); } - bool IsCall() const { return IsCallBits::decode(bit_field_); } - - // Interface to the register allocator and iterators. - bool ClobbersTemps() const { return IsCall(); } - bool ClobbersRegisters() const { return IsCall(); } - virtual bool ClobbersDoubleRegisters(Isolate* isolate) const { - return IsCall(); - } - - // Interface to the register allocator and iterators. - bool IsMarkedAsCall() const { return IsCall(); } - - virtual bool HasResult() const = 0; - virtual LOperand* result() const = 0; - - LOperand* FirstInput() { return InputAt(0); } - LOperand* Output() { return HasResult() ? result() : NULL; } - - virtual bool HasInterestingComment(LCodeGen* gen) const { return true; } - -#ifdef DEBUG - void VerifyCall(); -#endif - - virtual int InputCount() = 0; - virtual LOperand* InputAt(int i) = 0; - - private: - // Iterator support. - friend class InputIterator; - - friend class TempIterator; - virtual int TempCount() = 0; - virtual LOperand* TempAt(int i) = 0; - - class IsCallBits : public BitField<bool, 0, 1> {}; - - LEnvironment* environment_; - SetOncePointer<LPointerMap> pointer_map_; - HValue* hydrogen_value_; - int bit_field_; -}; - - -// R = number of result operands (0 or 1). -template <int R> -class LTemplateResultInstruction : public LInstruction { - public: - // Allow 0 or 1 output operands. - STATIC_ASSERT(R == 0 || R == 1); - bool HasResult() const final { return R != 0 && result() != NULL; } - void set_result(LOperand* operand) { results_[0] = operand; } - LOperand* result() const override { return results_[0]; } - - protected: - EmbeddedContainer<LOperand*, R> results_; -}; - - -// R = number of result operands (0 or 1). -// I = number of input operands. -// T = number of temporary operands. -template <int R, int I, int T> -class LTemplateInstruction : public LTemplateResultInstruction<R> { - protected: - EmbeddedContainer<LOperand*, I> inputs_; - EmbeddedContainer<LOperand*, T> temps_; - - private: - // Iterator support. - int InputCount() final { return I; } - LOperand* InputAt(int i) final { return inputs_[i]; } - - int TempCount() final { return T; } - LOperand* TempAt(int i) final { return temps_[i]; } -}; - - -class LGap : public LTemplateInstruction<0, 0, 0> { - public: - explicit LGap(HBasicBlock* block) : block_(block) { - parallel_moves_[BEFORE] = NULL; - parallel_moves_[START] = NULL; - parallel_moves_[END] = NULL; - parallel_moves_[AFTER] = NULL; - } - - // Can't use the DECLARE-macro here because of sub-classes. - bool IsGap() const override { return true; } - void PrintDataTo(StringStream* stream) override; - static LGap* cast(LInstruction* instr) { - DCHECK(instr->IsGap()); - return reinterpret_cast<LGap*>(instr); - } - - bool IsRedundant() const; - - HBasicBlock* block() const { return block_; } - - enum InnerPosition { - BEFORE, - START, - END, - AFTER, - FIRST_INNER_POSITION = BEFORE, - LAST_INNER_POSITION = AFTER - }; - - LParallelMove* GetOrCreateParallelMove(InnerPosition pos, Zone* zone) { - if (parallel_moves_[pos] == NULL) { - parallel_moves_[pos] = new (zone) LParallelMove(zone); - } - return parallel_moves_[pos]; - } - - LParallelMove* GetParallelMove(InnerPosition pos) { - return parallel_moves_[pos]; - } - - private: - LParallelMove* parallel_moves_[LAST_INNER_POSITION + 1]; - HBasicBlock* block_; -}; - - -class LInstructionGap final : public LGap { - public: - explicit LInstructionGap(HBasicBlock* block) : LGap(block) {} - - bool HasInterestingComment(LCodeGen* gen) const override { - return !IsRedundant(); - } - - DECLARE_CONCRETE_INSTRUCTION(InstructionGap, "gap") -}; - - -class LGoto final : public LTemplateInstruction<0, 0, 0> { - public: - explicit LGoto(HBasicBlock* block) : block_(block) {} - - bool HasInterestingComment(LCodeGen* gen) const override; - DECLARE_CONCRETE_INSTRUCTION(Goto, "goto") - void PrintDataTo(StringStream* stream) override; - bool IsControl() const override { return true; } - - int block_id() const { return block_->block_id(); } - - private: - HBasicBlock* block_; -}; - - -class LPrologue final : public LTemplateInstruction<0, 0, 0> { - public: - DECLARE_CONCRETE_INSTRUCTION(Prologue, "prologue") -}; - - -class LLazyBailout final : public LTemplateInstruction<0, 0, 0> { - public: - LLazyBailout() : gap_instructions_size_(0) {} - - DECLARE_CONCRETE_INSTRUCTION(LazyBailout, "lazy-bailout") - - void set_gap_instructions_size(int gap_instructions_size) { - gap_instructions_size_ = gap_instructions_size; - } - int gap_instructions_size() { return gap_instructions_size_; } - - private: - int gap_instructions_size_; -}; - - -class LDummy final : public LTemplateInstruction<1, 0, 0> { - public: - LDummy() {} - DECLARE_CONCRETE_INSTRUCTION(Dummy, "dummy") -}; - - -class LDummyUse final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LDummyUse(LOperand* value) { inputs_[0] = value; } - DECLARE_CONCRETE_INSTRUCTION(DummyUse, "dummy-use") -}; - - -class LDeoptimize final : public LTemplateInstruction<0, 0, 0> { - public: - bool IsControl() const override { return true; } - DECLARE_CONCRETE_INSTRUCTION(Deoptimize, "deoptimize") - DECLARE_HYDROGEN_ACCESSOR(Deoptimize) -}; - - -class LLabel final : public LGap { - public: - explicit LLabel(HBasicBlock* block) : LGap(block), replacement_(NULL) {} - - bool HasInterestingComment(LCodeGen* gen) const override { return false; } - DECLARE_CONCRETE_INSTRUCTION(Label, "label") - - void PrintDataTo(StringStream* stream) override; - - int block_id() const { return block()->block_id(); } - bool is_loop_header() const { return block()->IsLoopHeader(); } - bool is_osr_entry() const { return block()->is_osr_entry(); } - Label* label() { return &label_; } - LLabel* replacement() const { return replacement_; } - void set_replacement(LLabel* label) { replacement_ = label; } - bool HasReplacement() const { return replacement_ != NULL; } - - private: - Label label_; - LLabel* replacement_; -}; - - -class LParameter final : public LTemplateInstruction<1, 0, 0> { - public: - virtual bool HasInterestingComment(LCodeGen* gen) const { return false; } - DECLARE_CONCRETE_INSTRUCTION(Parameter, "parameter") -}; - - -class LCallStub final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LCallStub(LOperand* context) { inputs_[0] = context; } - - LOperand* context() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(CallStub, "call-stub") - DECLARE_HYDROGEN_ACCESSOR(CallStub) -}; - - -class LUnknownOSRValue final : public LTemplateInstruction<1, 0, 0> { - public: - bool HasInterestingComment(LCodeGen* gen) const override { return false; } - DECLARE_CONCRETE_INSTRUCTION(UnknownOSRValue, "unknown-osr-value") -}; - - -template <int I, int T> -class LControlInstruction : public LTemplateInstruction<0, I, T> { - public: - LControlInstruction() : false_label_(NULL), true_label_(NULL) {} - - bool IsControl() const final { return true; } - - int SuccessorCount() { return hydrogen()->SuccessorCount(); } - HBasicBlock* SuccessorAt(int i) { return hydrogen()->SuccessorAt(i); } - - int TrueDestination(LChunk* chunk) { - return chunk->LookupDestination(true_block_id()); - } - int FalseDestination(LChunk* chunk) { - return chunk->LookupDestination(false_block_id()); - } - - Label* TrueLabel(LChunk* chunk) { - if (true_label_ == NULL) { - true_label_ = chunk->GetAssemblyLabel(TrueDestination(chunk)); - } - return true_label_; - } - Label* FalseLabel(LChunk* chunk) { - if (false_label_ == NULL) { - false_label_ = chunk->GetAssemblyLabel(FalseDestination(chunk)); - } - return false_label_; - } - - protected: - int true_block_id() { return SuccessorAt(0)->block_id(); } - int false_block_id() { return SuccessorAt(1)->block_id(); } - - private: - HControlInstruction* hydrogen() { - return HControlInstruction::cast(this->hydrogen_value()); - } - - Label* false_label_; - Label* true_label_; -}; - - -class LWrapReceiver final : public LTemplateInstruction<1, 2, 0> { - public: - LWrapReceiver(LOperand* receiver, LOperand* function) { - inputs_[0] = receiver; - inputs_[1] = function; - } - - DECLARE_CONCRETE_INSTRUCTION(WrapReceiver, "wrap-receiver") - DECLARE_HYDROGEN_ACCESSOR(WrapReceiver) - - LOperand* receiver() { return inputs_[0]; } - LOperand* function() { return inputs_[1]; } -}; - - -class LApplyArguments final : public LTemplateInstruction<1, 4, 0> { - public: - LApplyArguments(LOperand* function, LOperand* receiver, LOperand* length, - LOperand* elements) { - inputs_[0] = function; - inputs_[1] = receiver; - inputs_[2] = length; - inputs_[3] = elements; - } - - DECLARE_CONCRETE_INSTRUCTION(ApplyArguments, "apply-arguments") - - LOperand* function() { return inputs_[0]; } - LOperand* receiver() { return inputs_[1]; } - LOperand* length() { return inputs_[2]; } - LOperand* elements() { return inputs_[3]; } -}; - - -class LAccessArgumentsAt final : public LTemplateInstruction<1, 3, 0> { - public: - LAccessArgumentsAt(LOperand* arguments, LOperand* length, LOperand* index) { - inputs_[0] = arguments; - inputs_[1] = length; - inputs_[2] = index; - } - - DECLARE_CONCRETE_INSTRUCTION(AccessArgumentsAt, "access-arguments-at") - - LOperand* arguments() { return inputs_[0]; } - LOperand* length() { return inputs_[1]; } - LOperand* index() { return inputs_[2]; } - - void PrintDataTo(StringStream* stream) override; -}; - - -class LArgumentsLength final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LArgumentsLength(LOperand* elements) { inputs_[0] = elements; } - - LOperand* elements() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(ArgumentsLength, "arguments-length") -}; - - -class LArgumentsElements final : public LTemplateInstruction<1, 0, 0> { - public: - DECLARE_CONCRETE_INSTRUCTION(ArgumentsElements, "arguments-elements") - DECLARE_HYDROGEN_ACCESSOR(ArgumentsElements) -}; - - -class LModByPowerOf2I final : public LTemplateInstruction<1, 1, 0> { - public: - LModByPowerOf2I(LOperand* dividend, int32_t divisor) { - inputs_[0] = dividend; - divisor_ = divisor; - } - - LOperand* dividend() { return inputs_[0]; } - int32_t divisor() const { return divisor_; } - - DECLARE_CONCRETE_INSTRUCTION(ModByPowerOf2I, "mod-by-power-of-2-i") - DECLARE_HYDROGEN_ACCESSOR(Mod) - - private: - int32_t divisor_; -}; - - -class LModByConstI final : public LTemplateInstruction<1, 1, 0> { - public: - LModByConstI(LOperand* dividend, int32_t divisor) { - inputs_[0] = dividend; - divisor_ = divisor; - } - - LOperand* dividend() { return inputs_[0]; } - int32_t divisor() const { return divisor_; } - - DECLARE_CONCRETE_INSTRUCTION(ModByConstI, "mod-by-const-i") - DECLARE_HYDROGEN_ACCESSOR(Mod) - - private: - int32_t divisor_; -}; - - -class LModI final : public LTemplateInstruction<1, 2, 0> { - public: - LModI(LOperand* left, LOperand* right) { - inputs_[0] = left; - inputs_[1] = right; - } - - LOperand* left() { return inputs_[0]; } - LOperand* right() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(ModI, "mod-i") - DECLARE_HYDROGEN_ACCESSOR(Mod) -}; - - -class LDivByPowerOf2I final : public LTemplateInstruction<1, 1, 0> { - public: - LDivByPowerOf2I(LOperand* dividend, int32_t divisor) { - inputs_[0] = dividend; - divisor_ = divisor; - } - - LOperand* dividend() { return inputs_[0]; } - int32_t divisor() const { return divisor_; } - - DECLARE_CONCRETE_INSTRUCTION(DivByPowerOf2I, "div-by-power-of-2-i") - DECLARE_HYDROGEN_ACCESSOR(Div) - - private: - int32_t divisor_; -}; - - -class LDivByConstI final : public LTemplateInstruction<1, 1, 0> { - public: - LDivByConstI(LOperand* dividend, int32_t divisor) { - inputs_[0] = dividend; - divisor_ = divisor; - } - - LOperand* dividend() { return inputs_[0]; } - int32_t divisor() const { return divisor_; } - - DECLARE_CONCRETE_INSTRUCTION(DivByConstI, "div-by-const-i") - DECLARE_HYDROGEN_ACCESSOR(Div) - - private: - int32_t divisor_; -}; - - -class LDivI final : public LTemplateInstruction<1, 2, 0> { - public: - LDivI(LOperand* dividend, LOperand* divisor) { - inputs_[0] = dividend; - inputs_[1] = divisor; - } - - LOperand* dividend() { return inputs_[0]; } - LOperand* divisor() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(DivI, "div-i") - DECLARE_HYDROGEN_ACCESSOR(BinaryOperation) -}; - - -class LFlooringDivByPowerOf2I final : public LTemplateInstruction<1, 1, 0> { - public: - LFlooringDivByPowerOf2I(LOperand* dividend, int32_t divisor) { - inputs_[0] = dividend; - divisor_ = divisor; - } - - LOperand* dividend() { return inputs_[0]; } - int32_t divisor() { return divisor_; } - - DECLARE_CONCRETE_INSTRUCTION(FlooringDivByPowerOf2I, - "flooring-div-by-power-of-2-i") - DECLARE_HYDROGEN_ACCESSOR(MathFloorOfDiv) - - private: - int32_t divisor_; -}; - - -class LFlooringDivByConstI final : public LTemplateInstruction<1, 1, 1> { - public: - LFlooringDivByConstI(LOperand* dividend, int32_t divisor, LOperand* temp) { - inputs_[0] = dividend; - divisor_ = divisor; - temps_[0] = temp; - } - - LOperand* dividend() { return inputs_[0]; } - int32_t divisor() const { return divisor_; } - LOperand* temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(FlooringDivByConstI, "flooring-div-by-const-i") - DECLARE_HYDROGEN_ACCESSOR(MathFloorOfDiv) - - private: - int32_t divisor_; -}; - - -class LFlooringDivI final : public LTemplateInstruction<1, 2, 0> { - public: - LFlooringDivI(LOperand* dividend, LOperand* divisor) { - inputs_[0] = dividend; - inputs_[1] = divisor; - } - - LOperand* dividend() { return inputs_[0]; } - LOperand* divisor() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(FlooringDivI, "flooring-div-i") - DECLARE_HYDROGEN_ACCESSOR(MathFloorOfDiv) -}; - - -class LMulI final : public LTemplateInstruction<1, 2, 0> { - public: - LMulI(LOperand* left, LOperand* right) { - inputs_[0] = left; - inputs_[1] = right; - } - - LOperand* left() { return inputs_[0]; } - LOperand* right() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(MulI, "mul-i") - DECLARE_HYDROGEN_ACCESSOR(Mul) -}; - - -// Instruction for computing multiplier * multiplicand + addend. -class LMultiplyAddD final : public LTemplateInstruction<1, 3, 0> { - public: - LMultiplyAddD(LOperand* addend, LOperand* multiplier, - LOperand* multiplicand) { - inputs_[0] = addend; - inputs_[1] = multiplier; - inputs_[2] = multiplicand; - } - - LOperand* addend() { return inputs_[0]; } - LOperand* multiplier() { return inputs_[1]; } - LOperand* multiplicand() { return inputs_[2]; } - - DECLARE_CONCRETE_INSTRUCTION(MultiplyAddD, "multiply-add-d") -}; - - -// Instruction for computing minuend - multiplier * multiplicand. -class LMultiplySubD final : public LTemplateInstruction<1, 3, 0> { - public: - LMultiplySubD(LOperand* minuend, LOperand* multiplier, - LOperand* multiplicand) { - inputs_[0] = minuend; - inputs_[1] = multiplier; - inputs_[2] = multiplicand; - } - - LOperand* minuend() { return inputs_[0]; } - LOperand* multiplier() { return inputs_[1]; } - LOperand* multiplicand() { return inputs_[2]; } - - DECLARE_CONCRETE_INSTRUCTION(MultiplySubD, "multiply-sub-d") -}; - - -class LDebugBreak final : public LTemplateInstruction<0, 0, 0> { - public: - DECLARE_CONCRETE_INSTRUCTION(DebugBreak, "break") -}; - - -class LCompareNumericAndBranch final : public LControlInstruction<2, 0> { - public: - LCompareNumericAndBranch(LOperand* left, LOperand* right) { - inputs_[0] = left; - inputs_[1] = right; - } - - LOperand* left() { return inputs_[0]; } - LOperand* right() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(CompareNumericAndBranch, - "compare-numeric-and-branch") - DECLARE_HYDROGEN_ACCESSOR(CompareNumericAndBranch) - - Token::Value op() const { return hydrogen()->token(); } - bool is_double() const { return hydrogen()->representation().IsDouble(); } - - void PrintDataTo(StringStream* stream) override; -}; - - -class LMathFloor final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LMathFloor(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(MathFloor, "math-floor") - DECLARE_HYDROGEN_ACCESSOR(UnaryMathOperation) -}; - - -class LMathRound final : public LTemplateInstruction<1, 1, 1> { - public: - LMathRound(LOperand* value, LOperand* temp) { - inputs_[0] = value; - temps_[0] = temp; - } - - LOperand* value() { return inputs_[0]; } - LOperand* temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(MathRound, "math-round") - DECLARE_HYDROGEN_ACCESSOR(UnaryMathOperation) -}; - - -class LMathFround final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LMathFround(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(MathFround, "math-fround") -}; - - -class LMathAbs final : public LTemplateInstruction<1, 2, 0> { - public: - LMathAbs(LOperand* context, LOperand* value) { - inputs_[1] = context; - inputs_[0] = value; - } - - LOperand* context() { return inputs_[1]; } - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(MathAbs, "math-abs") - DECLARE_HYDROGEN_ACCESSOR(UnaryMathOperation) -}; - - -class LMathLog final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LMathLog(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(MathLog, "math-log") -}; - - -class LMathClz32 final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LMathClz32(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(MathClz32, "math-clz32") -}; - - -class LMathExp final : public LTemplateInstruction<1, 1, 3> { - public: - LMathExp(LOperand* value, LOperand* double_temp, LOperand* temp1, - LOperand* temp2) { - inputs_[0] = value; - temps_[0] = temp1; - temps_[1] = temp2; - temps_[2] = double_temp; - ExternalReference::InitializeMathExpData(); - } - - LOperand* value() { return inputs_[0]; } - LOperand* temp1() { return temps_[0]; } - LOperand* temp2() { return temps_[1]; } - LOperand* double_temp() { return temps_[2]; } - - DECLARE_CONCRETE_INSTRUCTION(MathExp, "math-exp") -}; - - -class LMathSqrt final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LMathSqrt(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(MathSqrt, "math-sqrt") -}; - - -class LMathPowHalf final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LMathPowHalf(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(MathPowHalf, "math-pow-half") -}; - - -class LCmpObjectEqAndBranch final : public LControlInstruction<2, 0> { - public: - LCmpObjectEqAndBranch(LOperand* left, LOperand* right) { - inputs_[0] = left; - inputs_[1] = right; - } - - LOperand* left() { return inputs_[0]; } - LOperand* right() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(CmpObjectEqAndBranch, "cmp-object-eq-and-branch") - DECLARE_HYDROGEN_ACCESSOR(CompareObjectEqAndBranch) -}; - - -class LCmpHoleAndBranch final : public LControlInstruction<1, 0> { - public: - explicit LCmpHoleAndBranch(LOperand* object) { inputs_[0] = object; } - - LOperand* object() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(CmpHoleAndBranch, "cmp-hole-and-branch") - DECLARE_HYDROGEN_ACCESSOR(CompareHoleAndBranch) -}; - - -class LCompareMinusZeroAndBranch final : public LControlInstruction<1, 1> { - public: - LCompareMinusZeroAndBranch(LOperand* value, LOperand* temp) { - inputs_[0] = value; - temps_[0] = temp; - } - - LOperand* value() { return inputs_[0]; } - LOperand* temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(CompareMinusZeroAndBranch, - "cmp-minus-zero-and-branch") - DECLARE_HYDROGEN_ACCESSOR(CompareMinusZeroAndBranch) -}; - - -class LIsStringAndBranch final : public LControlInstruction<1, 1> { - public: - LIsStringAndBranch(LOperand* value, LOperand* temp) { - inputs_[0] = value; - temps_[0] = temp; - } - - LOperand* value() { return inputs_[0]; } - LOperand* temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(IsStringAndBranch, "is-string-and-branch") - DECLARE_HYDROGEN_ACCESSOR(IsStringAndBranch) - - void PrintDataTo(StringStream* stream) override; -}; - - -class LIsSmiAndBranch final : public LControlInstruction<1, 0> { - public: - explicit LIsSmiAndBranch(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(IsSmiAndBranch, "is-smi-and-branch") - DECLARE_HYDROGEN_ACCESSOR(IsSmiAndBranch) - - void PrintDataTo(StringStream* stream) override; -}; - - -class LIsUndetectableAndBranch final : public LControlInstruction<1, 1> { - public: - explicit LIsUndetectableAndBranch(LOperand* value, LOperand* temp) { - inputs_[0] = value; - temps_[0] = temp; - } - - LOperand* value() { return inputs_[0]; } - LOperand* temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(IsUndetectableAndBranch, - "is-undetectable-and-branch") - DECLARE_HYDROGEN_ACCESSOR(IsUndetectableAndBranch) - - void PrintDataTo(StringStream* stream) override; -}; - - -class LStringCompareAndBranch final : public LControlInstruction<3, 0> { - public: - LStringCompareAndBranch(LOperand* context, LOperand* left, LOperand* right) { - inputs_[0] = context; - inputs_[1] = left; - inputs_[2] = right; - } - - LOperand* context() { return inputs_[0]; } - LOperand* left() { return inputs_[1]; } - LOperand* right() { return inputs_[2]; } - - DECLARE_CONCRETE_INSTRUCTION(StringCompareAndBranch, - "string-compare-and-branch") - DECLARE_HYDROGEN_ACCESSOR(StringCompareAndBranch) - - Token::Value op() const { return hydrogen()->token(); } - - void PrintDataTo(StringStream* stream) override; -}; - - -class LHasInstanceTypeAndBranch final : public LControlInstruction<1, 0> { - public: - explicit LHasInstanceTypeAndBranch(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(HasInstanceTypeAndBranch, - "has-instance-type-and-branch") - DECLARE_HYDROGEN_ACCESSOR(HasInstanceTypeAndBranch) - - void PrintDataTo(StringStream* stream) override; -}; - - -class LGetCachedArrayIndex final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LGetCachedArrayIndex(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(GetCachedArrayIndex, "get-cached-array-index") - DECLARE_HYDROGEN_ACCESSOR(GetCachedArrayIndex) -}; - - -class LHasCachedArrayIndexAndBranch final : public LControlInstruction<1, 0> { - public: - explicit LHasCachedArrayIndexAndBranch(LOperand* value) { - inputs_[0] = value; - } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(HasCachedArrayIndexAndBranch, - "has-cached-array-index-and-branch") - DECLARE_HYDROGEN_ACCESSOR(HasCachedArrayIndexAndBranch) - - void PrintDataTo(StringStream* stream) override; -}; - - -class LClassOfTestAndBranch final : public LControlInstruction<1, 1> { - public: - LClassOfTestAndBranch(LOperand* value, LOperand* temp) { - inputs_[0] = value; - temps_[0] = temp; - } - - LOperand* value() { return inputs_[0]; } - LOperand* temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(ClassOfTestAndBranch, "class-of-test-and-branch") - DECLARE_HYDROGEN_ACCESSOR(ClassOfTestAndBranch) - - void PrintDataTo(StringStream* stream) override; -}; - - -class LCmpT final : public LTemplateInstruction<1, 3, 0> { - public: - LCmpT(LOperand* context, LOperand* left, LOperand* right) { - inputs_[0] = context; - inputs_[1] = left; - inputs_[2] = right; - } - - LOperand* context() { return inputs_[0]; } - LOperand* left() { return inputs_[1]; } - LOperand* right() { return inputs_[2]; } - - DECLARE_CONCRETE_INSTRUCTION(CmpT, "cmp-t") - DECLARE_HYDROGEN_ACCESSOR(CompareGeneric) - - Strength strength() { return hydrogen()->strength(); } - - Token::Value op() const { return hydrogen()->token(); } -}; - - -class LInstanceOf final : public LTemplateInstruction<1, 3, 0> { - public: - LInstanceOf(LOperand* context, LOperand* left, LOperand* right) { - inputs_[0] = context; - inputs_[1] = left; - inputs_[2] = right; - } - - LOperand* context() const { return inputs_[0]; } - LOperand* left() const { return inputs_[1]; } - LOperand* right() const { return inputs_[2]; } - - DECLARE_CONCRETE_INSTRUCTION(InstanceOf, "instance-of") -}; - - -class LHasInPrototypeChainAndBranch final : public LControlInstruction<2, 0> { - public: - LHasInPrototypeChainAndBranch(LOperand* object, LOperand* prototype) { - inputs_[0] = object; - inputs_[1] = prototype; - } - - LOperand* object() const { return inputs_[0]; } - LOperand* prototype() const { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(HasInPrototypeChainAndBranch, - "has-in-prototype-chain-and-branch") - DECLARE_HYDROGEN_ACCESSOR(HasInPrototypeChainAndBranch) -}; - - -class LBoundsCheck final : public LTemplateInstruction<0, 2, 0> { - public: - LBoundsCheck(LOperand* index, LOperand* length) { - inputs_[0] = index; - inputs_[1] = length; - } - - LOperand* index() { return inputs_[0]; } - LOperand* length() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(BoundsCheck, "bounds-check") - DECLARE_HYDROGEN_ACCESSOR(BoundsCheck) -}; - - -class LBitI final : public LTemplateInstruction<1, 2, 0> { - public: - LBitI(LOperand* left, LOperand* right) { - inputs_[0] = left; - inputs_[1] = right; - } - - LOperand* left() { return inputs_[0]; } - LOperand* right() { return inputs_[1]; } - - Token::Value op() const { return hydrogen()->op(); } - - DECLARE_CONCRETE_INSTRUCTION(BitI, "bit-i") - DECLARE_HYDROGEN_ACCESSOR(Bitwise) -}; - - -class LShiftI final : public LTemplateInstruction<1, 2, 0> { - public: - LShiftI(Token::Value op, LOperand* left, LOperand* right, bool can_deopt) - : op_(op), can_deopt_(can_deopt) { - inputs_[0] = left; - inputs_[1] = right; - } - - Token::Value op() const { return op_; } - LOperand* left() { return inputs_[0]; } - LOperand* right() { return inputs_[1]; } - bool can_deopt() const { return can_deopt_; } - - DECLARE_CONCRETE_INSTRUCTION(ShiftI, "shift-i") - - private: - Token::Value op_; - bool can_deopt_; -}; - - -class LSubI final : public LTemplateInstruction<1, 2, 0> { - public: - LSubI(LOperand* left, LOperand* right) { - inputs_[0] = left; - inputs_[1] = right; - } - - LOperand* left() { return inputs_[0]; } - LOperand* right() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(SubI, "sub-i") - DECLARE_HYDROGEN_ACCESSOR(Sub) -}; - - -class LRSubI final : public LTemplateInstruction<1, 2, 0> { - public: - LRSubI(LOperand* left, LOperand* right) { - inputs_[0] = left; - inputs_[1] = right; - } - - LOperand* left() { return inputs_[0]; } - LOperand* right() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(RSubI, "rsub-i") - DECLARE_HYDROGEN_ACCESSOR(Sub) -}; - - -class LConstantI final : public LTemplateInstruction<1, 0, 0> { - public: - DECLARE_CONCRETE_INSTRUCTION(ConstantI, "constant-i") - DECLARE_HYDROGEN_ACCESSOR(Constant) - - int32_t value() const { return hydrogen()->Integer32Value(); } -}; - - -class LConstantS final : public LTemplateInstruction<1, 0, 0> { - public: - DECLARE_CONCRETE_INSTRUCTION(ConstantS, "constant-s") - DECLARE_HYDROGEN_ACCESSOR(Constant) - - Smi* value() const { return Smi::FromInt(hydrogen()->Integer32Value()); } -}; - - -class LConstantD final : public LTemplateInstruction<1, 0, 0> { - public: - DECLARE_CONCRETE_INSTRUCTION(ConstantD, "constant-d") - DECLARE_HYDROGEN_ACCESSOR(Constant) - - double value() const { return hydrogen()->DoubleValue(); } - uint64_t bits() const { return hydrogen()->DoubleValueAsBits(); } -}; - - -class LConstantE final : public LTemplateInstruction<1, 0, 0> { - public: - DECLARE_CONCRETE_INSTRUCTION(ConstantE, "constant-e") - DECLARE_HYDROGEN_ACCESSOR(Constant) - - ExternalReference value() const { - return hydrogen()->ExternalReferenceValue(); - } -}; - - -class LConstantT final : public LTemplateInstruction<1, 0, 0> { - public: - DECLARE_CONCRETE_INSTRUCTION(ConstantT, "constant-t") - DECLARE_HYDROGEN_ACCESSOR(Constant) - - Handle<Object> value(Isolate* isolate) const { - return hydrogen()->handle(isolate); - } -}; - - -class LBranch final : public LControlInstruction<1, 0> { - public: - explicit LBranch(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(Branch, "branch") - DECLARE_HYDROGEN_ACCESSOR(Branch) - - void PrintDataTo(StringStream* stream) override; -}; - - -class LCmpMapAndBranch final : public LControlInstruction<1, 1> { - public: - LCmpMapAndBranch(LOperand* value, LOperand* temp) { - inputs_[0] = value; - temps_[0] = temp; - } - - LOperand* value() { return inputs_[0]; } - LOperand* temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(CmpMapAndBranch, "cmp-map-and-branch") - DECLARE_HYDROGEN_ACCESSOR(CompareMap) - - Handle<Map> map() const { return hydrogen()->map().handle(); } -}; - - -class LMapEnumLength final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LMapEnumLength(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(MapEnumLength, "map-enum-length") -}; - - -class LDateField final : public LTemplateInstruction<1, 1, 1> { - public: - LDateField(LOperand* date, LOperand* temp, Smi* index) : index_(index) { - inputs_[0] = date; - temps_[0] = temp; - } - - LOperand* date() { return inputs_[0]; } - LOperand* temp() { return temps_[0]; } - Smi* index() const { return index_; } - - DECLARE_CONCRETE_INSTRUCTION(DateField, "date-field") - DECLARE_HYDROGEN_ACCESSOR(DateField) - - private: - Smi* index_; -}; - - -class LSeqStringGetChar final : public LTemplateInstruction<1, 2, 0> { - public: - LSeqStringGetChar(LOperand* string, LOperand* index) { - inputs_[0] = string; - inputs_[1] = index; - } - - LOperand* string() const { return inputs_[0]; } - LOperand* index() const { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(SeqStringGetChar, "seq-string-get-char") - DECLARE_HYDROGEN_ACCESSOR(SeqStringGetChar) -}; - - -class LSeqStringSetChar final : public LTemplateInstruction<1, 4, 0> { - public: - LSeqStringSetChar(LOperand* context, LOperand* string, LOperand* index, - LOperand* value) { - inputs_[0] = context; - inputs_[1] = string; - inputs_[2] = index; - inputs_[3] = value; - } - - LOperand* string() { return inputs_[1]; } - LOperand* index() { return inputs_[2]; } - LOperand* value() { return inputs_[3]; } - - DECLARE_CONCRETE_INSTRUCTION(SeqStringSetChar, "seq-string-set-char") - DECLARE_HYDROGEN_ACCESSOR(SeqStringSetChar) -}; - - -class LAddI final : public LTemplateInstruction<1, 2, 0> { - public: - LAddI(LOperand* left, LOperand* right) { - inputs_[0] = left; - inputs_[1] = right; - } - - LOperand* left() { return inputs_[0]; } - LOperand* right() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(AddI, "add-i") - DECLARE_HYDROGEN_ACCESSOR(Add) -}; - - -class LMathMinMax final : public LTemplateInstruction<1, 2, 0> { - public: - LMathMinMax(LOperand* left, LOperand* right) { - inputs_[0] = left; - inputs_[1] = right; - } - - LOperand* left() { return inputs_[0]; } - LOperand* right() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(MathMinMax, "math-min-max") - DECLARE_HYDROGEN_ACCESSOR(MathMinMax) -}; - - -class LPower final : public LTemplateInstruction<1, 2, 0> { - public: - LPower(LOperand* left, LOperand* right) { - inputs_[0] = left; - inputs_[1] = right; - } - - LOperand* left() { return inputs_[0]; } - LOperand* right() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(Power, "power") - DECLARE_HYDROGEN_ACCESSOR(Power) -}; - - -class LArithmeticD final : public LTemplateInstruction<1, 2, 0> { - public: - LArithmeticD(Token::Value op, LOperand* left, LOperand* right) : op_(op) { - inputs_[0] = left; - inputs_[1] = right; - } - - Token::Value op() const { return op_; } - LOperand* left() { return inputs_[0]; } - LOperand* right() { return inputs_[1]; } - - Opcode opcode() const override { return LInstruction::kArithmeticD; } - void CompileToNative(LCodeGen* generator) override; - const char* Mnemonic() const override; - - private: - Token::Value op_; -}; - - -class LArithmeticT final : public LTemplateInstruction<1, 3, 0> { - public: - LArithmeticT(Token::Value op, LOperand* context, LOperand* left, - LOperand* right) - : op_(op) { - inputs_[0] = context; - inputs_[1] = left; - inputs_[2] = right; - } - - LOperand* context() { return inputs_[0]; } - LOperand* left() { return inputs_[1]; } - LOperand* right() { return inputs_[2]; } - Token::Value op() const { return op_; } - - Opcode opcode() const override { return LInstruction::kArithmeticT; } - void CompileToNative(LCodeGen* generator) override; - const char* Mnemonic() const override; - - DECLARE_HYDROGEN_ACCESSOR(BinaryOperation) - - Strength strength() { return hydrogen()->strength(); } - - private: - Token::Value op_; -}; - - -class LReturn final : public LTemplateInstruction<0, 3, 0> { - public: - LReturn(LOperand* value, LOperand* context, LOperand* parameter_count) { - inputs_[0] = value; - inputs_[1] = context; - inputs_[2] = parameter_count; - } - - LOperand* value() { return inputs_[0]; } - - bool has_constant_parameter_count() { - return parameter_count()->IsConstantOperand(); - } - LConstantOperand* constant_parameter_count() { - DCHECK(has_constant_parameter_count()); - return LConstantOperand::cast(parameter_count()); - } - LOperand* parameter_count() { return inputs_[2]; } - - DECLARE_CONCRETE_INSTRUCTION(Return, "return") -}; - - -class LLoadNamedField final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LLoadNamedField(LOperand* object) { inputs_[0] = object; } - - LOperand* object() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(LoadNamedField, "load-named-field") - DECLARE_HYDROGEN_ACCESSOR(LoadNamedField) -}; - - -class LLoadNamedGeneric final : public LTemplateInstruction<1, 2, 1> { - public: - LLoadNamedGeneric(LOperand* context, LOperand* object, LOperand* vector) { - inputs_[0] = context; - inputs_[1] = object; - temps_[0] = vector; - } - - LOperand* context() { return inputs_[0]; } - LOperand* object() { return inputs_[1]; } - LOperand* temp_vector() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(LoadNamedGeneric, "load-named-generic") - DECLARE_HYDROGEN_ACCESSOR(LoadNamedGeneric) - - Handle<Object> name() const { return hydrogen()->name(); } -}; - - -class LLoadFunctionPrototype final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LLoadFunctionPrototype(LOperand* function) { inputs_[0] = function; } - - LOperand* function() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(LoadFunctionPrototype, "load-function-prototype") - DECLARE_HYDROGEN_ACCESSOR(LoadFunctionPrototype) -}; - - -class LLoadRoot final : public LTemplateInstruction<1, 0, 0> { - public: - DECLARE_CONCRETE_INSTRUCTION(LoadRoot, "load-root") - DECLARE_HYDROGEN_ACCESSOR(LoadRoot) - - Heap::RootListIndex index() const { return hydrogen()->index(); } -}; - - -class LLoadKeyed final : public LTemplateInstruction<1, 2, 0> { - public: - LLoadKeyed(LOperand* elements, LOperand* key) { - inputs_[0] = elements; - inputs_[1] = key; - } - - LOperand* elements() { return inputs_[0]; } - LOperand* key() { return inputs_[1]; } - ElementsKind elements_kind() const { return hydrogen()->elements_kind(); } - bool is_fixed_typed_array() const { - return hydrogen()->is_fixed_typed_array(); - } - - DECLARE_CONCRETE_INSTRUCTION(LoadKeyed, "load-keyed") - DECLARE_HYDROGEN_ACCESSOR(LoadKeyed) - - void PrintDataTo(StringStream* stream) override; - uint32_t base_offset() const { return hydrogen()->base_offset(); } -}; - - -class LLoadKeyedGeneric final : public LTemplateInstruction<1, 3, 1> { - public: - LLoadKeyedGeneric(LOperand* context, LOperand* object, LOperand* key, - LOperand* vector) { - inputs_[0] = context; - inputs_[1] = object; - inputs_[2] = key; - temps_[0] = vector; - } - - LOperand* context() { return inputs_[0]; } - LOperand* object() { return inputs_[1]; } - LOperand* key() { return inputs_[2]; } - LOperand* temp_vector() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(LoadKeyedGeneric, "load-keyed-generic") - DECLARE_HYDROGEN_ACCESSOR(LoadKeyedGeneric) -}; - - -class LLoadGlobalGeneric final : public LTemplateInstruction<1, 2, 1> { - public: - LLoadGlobalGeneric(LOperand* context, LOperand* global_object, - LOperand* vector) { - inputs_[0] = context; - inputs_[1] = global_object; - temps_[0] = vector; - } - - LOperand* context() { return inputs_[0]; } - LOperand* global_object() { return inputs_[1]; } - LOperand* temp_vector() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(LoadGlobalGeneric, "load-global-generic") - DECLARE_HYDROGEN_ACCESSOR(LoadGlobalGeneric) - - Handle<Object> name() const { return hydrogen()->name(); } - TypeofMode typeof_mode() const { return hydrogen()->typeof_mode(); } -}; - - -class LLoadGlobalViaContext final : public LTemplateInstruction<1, 1, 1> { - public: - explicit LLoadGlobalViaContext(LOperand* context) { inputs_[0] = context; } - - DECLARE_CONCRETE_INSTRUCTION(LoadGlobalViaContext, "load-global-via-context") - DECLARE_HYDROGEN_ACCESSOR(LoadGlobalViaContext) - - void PrintDataTo(StringStream* stream) override; - - LOperand* context() { return inputs_[0]; } - - int depth() const { return hydrogen()->depth(); } - int slot_index() const { return hydrogen()->slot_index(); } -}; - - -class LLoadContextSlot final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LLoadContextSlot(LOperand* context) { inputs_[0] = context; } - - LOperand* context() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(LoadContextSlot, "load-context-slot") - DECLARE_HYDROGEN_ACCESSOR(LoadContextSlot) - - int slot_index() { return hydrogen()->slot_index(); } - - void PrintDataTo(StringStream* stream) override; -}; - - -class LStoreContextSlot final : public LTemplateInstruction<0, 2, 0> { - public: - LStoreContextSlot(LOperand* context, LOperand* value) { - inputs_[0] = context; - inputs_[1] = value; - } - - LOperand* context() { return inputs_[0]; } - LOperand* value() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(StoreContextSlot, "store-context-slot") - DECLARE_HYDROGEN_ACCESSOR(StoreContextSlot) - - int slot_index() { return hydrogen()->slot_index(); } - - void PrintDataTo(StringStream* stream) override; -}; - - -class LPushArgument final : public LTemplateInstruction<0, 1, 0> { - public: - explicit LPushArgument(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(PushArgument, "push-argument") -}; - - -class LDrop final : public LTemplateInstruction<0, 0, 0> { - public: - explicit LDrop(int count) : count_(count) {} - - int count() const { return count_; } - - DECLARE_CONCRETE_INSTRUCTION(Drop, "drop") - - private: - int count_; -}; - - -class LStoreCodeEntry final : public LTemplateInstruction<0, 2, 0> { - public: - LStoreCodeEntry(LOperand* function, LOperand* code_object) { - inputs_[0] = function; - inputs_[1] = code_object; - } - - LOperand* function() { return inputs_[0]; } - LOperand* code_object() { return inputs_[1]; } - - void PrintDataTo(StringStream* stream) override; - - DECLARE_CONCRETE_INSTRUCTION(StoreCodeEntry, "store-code-entry") - DECLARE_HYDROGEN_ACCESSOR(StoreCodeEntry) -}; - - -class LInnerAllocatedObject final : public LTemplateInstruction<1, 2, 0> { - public: - LInnerAllocatedObject(LOperand* base_object, LOperand* offset) { - inputs_[0] = base_object; - inputs_[1] = offset; - } - - LOperand* base_object() const { return inputs_[0]; } - LOperand* offset() const { return inputs_[1]; } - - void PrintDataTo(StringStream* stream) override; - - DECLARE_CONCRETE_INSTRUCTION(InnerAllocatedObject, "inner-allocated-object") -}; - - -class LThisFunction final : public LTemplateInstruction<1, 0, 0> { - public: - DECLARE_CONCRETE_INSTRUCTION(ThisFunction, "this-function") - DECLARE_HYDROGEN_ACCESSOR(ThisFunction) -}; - - -class LContext final : public LTemplateInstruction<1, 0, 0> { - public: - DECLARE_CONCRETE_INSTRUCTION(Context, "context") - DECLARE_HYDROGEN_ACCESSOR(Context) -}; - - -class LDeclareGlobals final : public LTemplateInstruction<0, 1, 0> { - public: - explicit LDeclareGlobals(LOperand* context) { inputs_[0] = context; } - - LOperand* context() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(DeclareGlobals, "declare-globals") - DECLARE_HYDROGEN_ACCESSOR(DeclareGlobals) -}; - - -class LCallJSFunction final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LCallJSFunction(LOperand* function) { inputs_[0] = function; } - - LOperand* function() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(CallJSFunction, "call-js-function") - DECLARE_HYDROGEN_ACCESSOR(CallJSFunction) - - void PrintDataTo(StringStream* stream) override; - - int arity() const { return hydrogen()->argument_count() - 1; } -}; - - -class LCallWithDescriptor final : public LTemplateResultInstruction<1> { - public: - LCallWithDescriptor(CallInterfaceDescriptor descriptor, - const ZoneList<LOperand*>& operands, Zone* zone) - : descriptor_(descriptor), - inputs_(descriptor.GetRegisterParameterCount() + - kImplicitRegisterParameterCount, - zone) { - DCHECK(descriptor.GetRegisterParameterCount() + - kImplicitRegisterParameterCount == - operands.length()); - inputs_.AddAll(operands, zone); - } - - LOperand* target() const { return inputs_[0]; } - - const CallInterfaceDescriptor descriptor() { return descriptor_; } - - DECLARE_HYDROGEN_ACCESSOR(CallWithDescriptor) - - // The target and context are passed as implicit parameters that are not - // explicitly listed in the descriptor. - static const int kImplicitRegisterParameterCount = 2; - - private: - DECLARE_CONCRETE_INSTRUCTION(CallWithDescriptor, "call-with-descriptor") - - void PrintDataTo(StringStream* stream) override; - - int arity() const { return hydrogen()->argument_count() - 1; } - - CallInterfaceDescriptor descriptor_; - ZoneList<LOperand*> inputs_; - - // Iterator support. - int InputCount() final { return inputs_.length(); } - LOperand* InputAt(int i) final { return inputs_[i]; } - - int TempCount() final { return 0; } - LOperand* TempAt(int i) final { return NULL; } -}; - - -class LInvokeFunction final : public LTemplateInstruction<1, 2, 0> { - public: - LInvokeFunction(LOperand* context, LOperand* function) { - inputs_[0] = context; - inputs_[1] = function; - } - - LOperand* context() { return inputs_[0]; } - LOperand* function() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(InvokeFunction, "invoke-function") - DECLARE_HYDROGEN_ACCESSOR(InvokeFunction) - - void PrintDataTo(StringStream* stream) override; - - int arity() const { return hydrogen()->argument_count() - 1; } -}; - - -class LCallFunction final : public LTemplateInstruction<1, 2, 2> { - public: - LCallFunction(LOperand* context, LOperand* function, LOperand* slot, - LOperand* vector) { - inputs_[0] = context; - inputs_[1] = function; - temps_[0] = slot; - temps_[1] = vector; - } - - LOperand* context() { return inputs_[0]; } - LOperand* function() { return inputs_[1]; } - LOperand* temp_slot() { return temps_[0]; } - LOperand* temp_vector() { return temps_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(CallFunction, "call-function") - DECLARE_HYDROGEN_ACCESSOR(CallFunction) - - int arity() const { return hydrogen()->argument_count() - 1; } - void PrintDataTo(StringStream* stream) override; -}; - - -class LCallNew final : public LTemplateInstruction<1, 2, 0> { - public: - LCallNew(LOperand* context, LOperand* constructor) { - inputs_[0] = context; - inputs_[1] = constructor; - } - - LOperand* context() { return inputs_[0]; } - LOperand* constructor() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(CallNew, "call-new") - DECLARE_HYDROGEN_ACCESSOR(CallNew) - - void PrintDataTo(StringStream* stream) override; - - int arity() const { return hydrogen()->argument_count() - 1; } -}; - - -class LCallNewArray final : public LTemplateInstruction<1, 2, 0> { - public: - LCallNewArray(LOperand* context, LOperand* constructor) { - inputs_[0] = context; - inputs_[1] = constructor; - } - - LOperand* context() { return inputs_[0]; } - LOperand* constructor() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(CallNewArray, "call-new-array") - DECLARE_HYDROGEN_ACCESSOR(CallNewArray) - - void PrintDataTo(StringStream* stream) override; - - int arity() const { return hydrogen()->argument_count() - 1; } -}; - - -class LCallRuntime final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LCallRuntime(LOperand* context) { inputs_[0] = context; } - - LOperand* context() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(CallRuntime, "call-runtime") - DECLARE_HYDROGEN_ACCESSOR(CallRuntime) - - bool ClobbersDoubleRegisters(Isolate* isolate) const override { - return save_doubles() == kDontSaveFPRegs; - } - - const Runtime::Function* function() const { return hydrogen()->function(); } - int arity() const { return hydrogen()->argument_count(); } - SaveFPRegsMode save_doubles() const { return hydrogen()->save_doubles(); } -}; - - -class LInteger32ToDouble final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LInteger32ToDouble(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(Integer32ToDouble, "int32-to-double") -}; - - -class LUint32ToDouble final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LUint32ToDouble(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(Uint32ToDouble, "uint32-to-double") -}; - - -class LNumberTagI final : public LTemplateInstruction<1, 1, 2> { - public: - LNumberTagI(LOperand* value, LOperand* temp1, LOperand* temp2) { - inputs_[0] = value; - temps_[0] = temp1; - temps_[1] = temp2; - } - - LOperand* value() { return inputs_[0]; } - LOperand* temp1() { return temps_[0]; } - LOperand* temp2() { return temps_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(NumberTagI, "number-tag-i") -}; - - -class LNumberTagU final : public LTemplateInstruction<1, 1, 2> { - public: - LNumberTagU(LOperand* value, LOperand* temp1, LOperand* temp2) { - inputs_[0] = value; - temps_[0] = temp1; - temps_[1] = temp2; - } - - LOperand* value() { return inputs_[0]; } - LOperand* temp1() { return temps_[0]; } - LOperand* temp2() { return temps_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(NumberTagU, "number-tag-u") -}; - - -class LNumberTagD final : public LTemplateInstruction<1, 1, 2> { - public: - LNumberTagD(LOperand* value, LOperand* temp, LOperand* temp2) { - inputs_[0] = value; - temps_[0] = temp; - temps_[1] = temp2; - } - - LOperand* value() { return inputs_[0]; } - LOperand* temp() { return temps_[0]; } - LOperand* temp2() { return temps_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(NumberTagD, "number-tag-d") - DECLARE_HYDROGEN_ACCESSOR(Change) -}; - - -class LDoubleToSmi final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LDoubleToSmi(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(DoubleToSmi, "double-to-smi") - DECLARE_HYDROGEN_ACCESSOR(UnaryOperation) - - bool truncating() { return hydrogen()->CanTruncateToInt32(); } -}; - - -// Sometimes truncating conversion from a tagged value to an int32. -class LDoubleToI final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LDoubleToI(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(DoubleToI, "double-to-i") - DECLARE_HYDROGEN_ACCESSOR(UnaryOperation) - - bool truncating() { return hydrogen()->CanTruncateToInt32(); } -}; - - -// Truncating conversion from a tagged value to an int32. -class LTaggedToI final : public LTemplateInstruction<1, 1, 2> { - public: - LTaggedToI(LOperand* value, LOperand* temp, LOperand* temp2) { - inputs_[0] = value; - temps_[0] = temp; - temps_[1] = temp2; - } - - LOperand* value() { return inputs_[0]; } - LOperand* temp() { return temps_[0]; } - LOperand* temp2() { return temps_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(TaggedToI, "tagged-to-i") - DECLARE_HYDROGEN_ACCESSOR(Change) - - bool truncating() { return hydrogen()->CanTruncateToInt32(); } -}; - - -class LSmiTag final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LSmiTag(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(SmiTag, "smi-tag") - DECLARE_HYDROGEN_ACCESSOR(Change) -}; - - -class LNumberUntagD final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LNumberUntagD(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(NumberUntagD, "double-untag") - DECLARE_HYDROGEN_ACCESSOR(Change) -}; - - -class LSmiUntag final : public LTemplateInstruction<1, 1, 0> { - public: - LSmiUntag(LOperand* value, bool needs_check) : needs_check_(needs_check) { - inputs_[0] = value; - } - - LOperand* value() { return inputs_[0]; } - bool needs_check() const { return needs_check_; } - - DECLARE_CONCRETE_INSTRUCTION(SmiUntag, "smi-untag") - - private: - bool needs_check_; -}; - - -class LStoreNamedField final : public LTemplateInstruction<0, 2, 1> { - public: - LStoreNamedField(LOperand* object, LOperand* value, LOperand* temp) { - inputs_[0] = object; - inputs_[1] = value; - temps_[0] = temp; - } - - LOperand* object() { return inputs_[0]; } - LOperand* value() { return inputs_[1]; } - LOperand* temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(StoreNamedField, "store-named-field") - DECLARE_HYDROGEN_ACCESSOR(StoreNamedField) - - void PrintDataTo(StringStream* stream) override; - - Representation representation() const { - return hydrogen()->field_representation(); - } -}; - - -class LStoreNamedGeneric final : public LTemplateInstruction<0, 3, 2> { - public: - LStoreNamedGeneric(LOperand* context, LOperand* object, LOperand* value, - LOperand* slot, LOperand* vector) { - inputs_[0] = context; - inputs_[1] = object; - inputs_[2] = value; - temps_[0] = slot; - temps_[1] = vector; - } - - LOperand* context() { return inputs_[0]; } - LOperand* object() { return inputs_[1]; } - LOperand* value() { return inputs_[2]; } - LOperand* temp_slot() { return temps_[0]; } - LOperand* temp_vector() { return temps_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(StoreNamedGeneric, "store-named-generic") - DECLARE_HYDROGEN_ACCESSOR(StoreNamedGeneric) - - void PrintDataTo(StringStream* stream) override; - - Handle<Object> name() const { return hydrogen()->name(); } - LanguageMode language_mode() { return hydrogen()->language_mode(); } -}; - - -class LStoreGlobalViaContext final : public LTemplateInstruction<0, 2, 0> { - public: - LStoreGlobalViaContext(LOperand* context, LOperand* value) { - inputs_[0] = context; - inputs_[1] = value; - } - - LOperand* context() { return inputs_[0]; } - LOperand* value() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(StoreGlobalViaContext, - "store-global-via-context") - DECLARE_HYDROGEN_ACCESSOR(StoreGlobalViaContext) - - void PrintDataTo(StringStream* stream) override; - - int depth() { return hydrogen()->depth(); } - int slot_index() { return hydrogen()->slot_index(); } - LanguageMode language_mode() { return hydrogen()->language_mode(); } -}; - - -class LStoreKeyed final : public LTemplateInstruction<0, 3, 0> { - public: - LStoreKeyed(LOperand* object, LOperand* key, LOperand* value) { - inputs_[0] = object; - inputs_[1] = key; - inputs_[2] = value; - } - - bool is_fixed_typed_array() const { - return hydrogen()->is_fixed_typed_array(); - } - LOperand* elements() { return inputs_[0]; } - LOperand* key() { return inputs_[1]; } - LOperand* value() { return inputs_[2]; } - ElementsKind elements_kind() const { return hydrogen()->elements_kind(); } - - DECLARE_CONCRETE_INSTRUCTION(StoreKeyed, "store-keyed") - DECLARE_HYDROGEN_ACCESSOR(StoreKeyed) - - void PrintDataTo(StringStream* stream) override; - bool NeedsCanonicalization() { - if (hydrogen()->value()->IsAdd() || hydrogen()->value()->IsSub() || - hydrogen()->value()->IsMul() || hydrogen()->value()->IsDiv()) { - return false; - } - return hydrogen()->NeedsCanonicalization(); - } - uint32_t base_offset() const { return hydrogen()->base_offset(); } -}; - - -class LStoreKeyedGeneric final : public LTemplateInstruction<0, 4, 2> { - public: - LStoreKeyedGeneric(LOperand* context, LOperand* object, LOperand* key, - LOperand* value, LOperand* slot, LOperand* vector) { - inputs_[0] = context; - inputs_[1] = object; - inputs_[2] = key; - inputs_[3] = value; - temps_[0] = slot; - temps_[1] = vector; - } - - LOperand* context() { return inputs_[0]; } - LOperand* object() { return inputs_[1]; } - LOperand* key() { return inputs_[2]; } - LOperand* value() { return inputs_[3]; } - LOperand* temp_slot() { return temps_[0]; } - LOperand* temp_vector() { return temps_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(StoreKeyedGeneric, "store-keyed-generic") - DECLARE_HYDROGEN_ACCESSOR(StoreKeyedGeneric) - - void PrintDataTo(StringStream* stream) override; - - LanguageMode language_mode() { return hydrogen()->language_mode(); } -}; - - -class LTransitionElementsKind final : public LTemplateInstruction<0, 2, 1> { - public: - LTransitionElementsKind(LOperand* object, LOperand* context, - LOperand* new_map_temp) { - inputs_[0] = object; - inputs_[1] = context; - temps_[0] = new_map_temp; - } - - LOperand* context() { return inputs_[1]; } - LOperand* object() { return inputs_[0]; } - LOperand* new_map_temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(TransitionElementsKind, - "transition-elements-kind") - DECLARE_HYDROGEN_ACCESSOR(TransitionElementsKind) - - void PrintDataTo(StringStream* stream) override; - - Handle<Map> original_map() { return hydrogen()->original_map().handle(); } - Handle<Map> transitioned_map() { - return hydrogen()->transitioned_map().handle(); - } - ElementsKind from_kind() { return hydrogen()->from_kind(); } - ElementsKind to_kind() { return hydrogen()->to_kind(); } -}; - - -class LTrapAllocationMemento final : public LTemplateInstruction<0, 1, 1> { - public: - LTrapAllocationMemento(LOperand* object, LOperand* temp) { - inputs_[0] = object; - temps_[0] = temp; - } - - LOperand* object() { return inputs_[0]; } - LOperand* temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(TrapAllocationMemento, "trap-allocation-memento") -}; - - -class LMaybeGrowElements final : public LTemplateInstruction<1, 5, 0> { - public: - LMaybeGrowElements(LOperand* context, LOperand* object, LOperand* elements, - LOperand* key, LOperand* current_capacity) { - inputs_[0] = context; - inputs_[1] = object; - inputs_[2] = elements; - inputs_[3] = key; - inputs_[4] = current_capacity; - } - - LOperand* context() { return inputs_[0]; } - LOperand* object() { return inputs_[1]; } - LOperand* elements() { return inputs_[2]; } - LOperand* key() { return inputs_[3]; } - LOperand* current_capacity() { return inputs_[4]; } - - DECLARE_HYDROGEN_ACCESSOR(MaybeGrowElements) - DECLARE_CONCRETE_INSTRUCTION(MaybeGrowElements, "maybe-grow-elements") -}; - - -class LStringAdd final : public LTemplateInstruction<1, 3, 0> { - public: - LStringAdd(LOperand* context, LOperand* left, LOperand* right) { - inputs_[0] = context; - inputs_[1] = left; - inputs_[2] = right; - } - - LOperand* context() { return inputs_[0]; } - LOperand* left() { return inputs_[1]; } - LOperand* right() { return inputs_[2]; } - - DECLARE_CONCRETE_INSTRUCTION(StringAdd, "string-add") - DECLARE_HYDROGEN_ACCESSOR(StringAdd) -}; - - -class LStringCharCodeAt final : public LTemplateInstruction<1, 3, 0> { - public: - LStringCharCodeAt(LOperand* context, LOperand* string, LOperand* index) { - inputs_[0] = context; - inputs_[1] = string; - inputs_[2] = index; - } - - LOperand* context() { return inputs_[0]; } - LOperand* string() { return inputs_[1]; } - LOperand* index() { return inputs_[2]; } - - DECLARE_CONCRETE_INSTRUCTION(StringCharCodeAt, "string-char-code-at") - DECLARE_HYDROGEN_ACCESSOR(StringCharCodeAt) -}; - - -class LStringCharFromCode final : public LTemplateInstruction<1, 2, 0> { - public: - explicit LStringCharFromCode(LOperand* context, LOperand* char_code) { - inputs_[0] = context; - inputs_[1] = char_code; - } - - LOperand* context() { return inputs_[0]; } - LOperand* char_code() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(StringCharFromCode, "string-char-from-code") - DECLARE_HYDROGEN_ACCESSOR(StringCharFromCode) -}; - - -class LCheckValue final : public LTemplateInstruction<0, 1, 0> { - public: - explicit LCheckValue(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(CheckValue, "check-value") - DECLARE_HYDROGEN_ACCESSOR(CheckValue) -}; - - -class LCheckArrayBufferNotNeutered final - : public LTemplateInstruction<0, 1, 0> { - public: - explicit LCheckArrayBufferNotNeutered(LOperand* view) { inputs_[0] = view; } - - LOperand* view() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(CheckArrayBufferNotNeutered, - "check-array-buffer-not-neutered") - DECLARE_HYDROGEN_ACCESSOR(CheckArrayBufferNotNeutered) -}; - - -class LCheckInstanceType final : public LTemplateInstruction<0, 1, 0> { - public: - explicit LCheckInstanceType(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(CheckInstanceType, "check-instance-type") - DECLARE_HYDROGEN_ACCESSOR(CheckInstanceType) -}; - - -class LCheckMaps final : public LTemplateInstruction<0, 1, 1> { - public: - explicit LCheckMaps(LOperand* value = NULL, LOperand* temp = NULL) { - inputs_[0] = value; - temps_[0] = temp; - } - - LOperand* value() { return inputs_[0]; } - LOperand* temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(CheckMaps, "check-maps") - DECLARE_HYDROGEN_ACCESSOR(CheckMaps) -}; - - -class LCheckSmi final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LCheckSmi(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(CheckSmi, "check-smi") -}; - - -class LCheckNonSmi final : public LTemplateInstruction<0, 1, 0> { - public: - explicit LCheckNonSmi(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(CheckNonSmi, "check-non-smi") - DECLARE_HYDROGEN_ACCESSOR(CheckHeapObject) -}; - - -class LClampDToUint8 final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LClampDToUint8(LOperand* unclamped) { inputs_[0] = unclamped; } - - LOperand* unclamped() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(ClampDToUint8, "clamp-d-to-uint8") -}; - - -class LClampIToUint8 final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LClampIToUint8(LOperand* unclamped) { inputs_[0] = unclamped; } - - LOperand* unclamped() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(ClampIToUint8, "clamp-i-to-uint8") -}; - - -class LClampTToUint8 final : public LTemplateInstruction<1, 1, 1> { - public: - LClampTToUint8(LOperand* unclamped, LOperand* temp) { - inputs_[0] = unclamped; - temps_[0] = temp; - } - - LOperand* unclamped() { return inputs_[0]; } - LOperand* temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(ClampTToUint8, "clamp-t-to-uint8") -}; - - -class LDoubleBits final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LDoubleBits(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(DoubleBits, "double-bits") - DECLARE_HYDROGEN_ACCESSOR(DoubleBits) -}; - - -class LConstructDouble final : public LTemplateInstruction<1, 2, 0> { - public: - LConstructDouble(LOperand* hi, LOperand* lo) { - inputs_[0] = hi; - inputs_[1] = lo; - } - - LOperand* hi() { return inputs_[0]; } - LOperand* lo() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(ConstructDouble, "construct-double") -}; - - -class LAllocate final : public LTemplateInstruction<1, 2, 2> { - public: - LAllocate(LOperand* context, LOperand* size, LOperand* temp1, - LOperand* temp2) { - inputs_[0] = context; - inputs_[1] = size; - temps_[0] = temp1; - temps_[1] = temp2; - } - - LOperand* context() { return inputs_[0]; } - LOperand* size() { return inputs_[1]; } - LOperand* temp1() { return temps_[0]; } - LOperand* temp2() { return temps_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(Allocate, "allocate") - DECLARE_HYDROGEN_ACCESSOR(Allocate) -}; - - -class LRegExpLiteral final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LRegExpLiteral(LOperand* context) { inputs_[0] = context; } - - LOperand* context() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(RegExpLiteral, "regexp-literal") - DECLARE_HYDROGEN_ACCESSOR(RegExpLiteral) -}; - - -class LToFastProperties final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LToFastProperties(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(ToFastProperties, "to-fast-properties") - DECLARE_HYDROGEN_ACCESSOR(ToFastProperties) -}; - - -class LTypeof final : public LTemplateInstruction<1, 2, 0> { - public: - LTypeof(LOperand* context, LOperand* value) { - inputs_[0] = context; - inputs_[1] = value; - } - - LOperand* context() { return inputs_[0]; } - LOperand* value() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(Typeof, "typeof") -}; - - -class LTypeofIsAndBranch final : public LControlInstruction<1, 0> { - public: - explicit LTypeofIsAndBranch(LOperand* value) { inputs_[0] = value; } - - LOperand* value() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(TypeofIsAndBranch, "typeof-is-and-branch") - DECLARE_HYDROGEN_ACCESSOR(TypeofIsAndBranch) - - Handle<String> type_literal() { return hydrogen()->type_literal(); } - - void PrintDataTo(StringStream* stream) override; -}; - - -class LIsConstructCallAndBranch final : public LControlInstruction<0, 1> { - public: - explicit LIsConstructCallAndBranch(LOperand* temp) { temps_[0] = temp; } - - LOperand* temp() { return temps_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(IsConstructCallAndBranch, - "is-construct-call-and-branch") -}; - - -class LOsrEntry final : public LTemplateInstruction<0, 0, 0> { - public: - LOsrEntry() {} - - bool HasInterestingComment(LCodeGen* gen) const override { return false; } - DECLARE_CONCRETE_INSTRUCTION(OsrEntry, "osr-entry") -}; - - -class LStackCheck final : public LTemplateInstruction<0, 1, 0> { - public: - explicit LStackCheck(LOperand* context) { inputs_[0] = context; } - - LOperand* context() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(StackCheck, "stack-check") - DECLARE_HYDROGEN_ACCESSOR(StackCheck) - - Label* done_label() { return &done_label_; } - - private: - Label done_label_; -}; - - -class LForInPrepareMap final : public LTemplateInstruction<1, 2, 0> { - public: - LForInPrepareMap(LOperand* context, LOperand* object) { - inputs_[0] = context; - inputs_[1] = object; - } - - LOperand* context() { return inputs_[0]; } - LOperand* object() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(ForInPrepareMap, "for-in-prepare-map") -}; - - -class LForInCacheArray final : public LTemplateInstruction<1, 1, 0> { - public: - explicit LForInCacheArray(LOperand* map) { inputs_[0] = map; } - - LOperand* map() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(ForInCacheArray, "for-in-cache-array") - - int idx() { return HForInCacheArray::cast(this->hydrogen_value())->idx(); } -}; - - -class LCheckMapValue final : public LTemplateInstruction<0, 2, 0> { - public: - LCheckMapValue(LOperand* value, LOperand* map) { - inputs_[0] = value; - inputs_[1] = map; - } - - LOperand* value() { return inputs_[0]; } - LOperand* map() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(CheckMapValue, "check-map-value") -}; - - -class LLoadFieldByIndex final : public LTemplateInstruction<1, 2, 0> { - public: - LLoadFieldByIndex(LOperand* object, LOperand* index) { - inputs_[0] = object; - inputs_[1] = index; - } - - LOperand* object() { return inputs_[0]; } - LOperand* index() { return inputs_[1]; } - - DECLARE_CONCRETE_INSTRUCTION(LoadFieldByIndex, "load-field-by-index") -}; - - -class LStoreFrameContext : public LTemplateInstruction<0, 1, 0> { - public: - explicit LStoreFrameContext(LOperand* context) { inputs_[0] = context; } - - LOperand* context() { return inputs_[0]; } - - DECLARE_CONCRETE_INSTRUCTION(StoreFrameContext, "store-frame-context") -}; - - -class LAllocateBlockContext : public LTemplateInstruction<1, 2, 0> { - public: - LAllocateBlockContext(LOperand* context, LOperand* function) { - inputs_[0] = context; - inputs_[1] = function; - } - - LOperand* context() { return inputs_[0]; } - LOperand* function() { return inputs_[1]; } - - Handle<ScopeInfo> scope_info() { return hydrogen()->scope_info(); } - - DECLARE_CONCRETE_INSTRUCTION(AllocateBlockContext, "allocate-block-context") - DECLARE_HYDROGEN_ACCESSOR(AllocateBlockContext) -}; - - -class LChunkBuilder; -class LPlatformChunk final : public LChunk { - public: - LPlatformChunk(CompilationInfo* info, HGraph* graph) : LChunk(info, graph) {} - - int GetNextSpillIndex(RegisterKind kind); - LOperand* GetNextSpillSlot(RegisterKind kind); -}; - - -class LChunkBuilder final : public LChunkBuilderBase { - public: - LChunkBuilder(CompilationInfo* info, HGraph* graph, LAllocator* allocator) - : LChunkBuilderBase(info, graph), - current_instruction_(NULL), - current_block_(NULL), - next_block_(NULL), - allocator_(allocator) {} - - // Build the sequence for the graph. - LPlatformChunk* Build(); - -// Declare methods that deal with the individual node types. -#define DECLARE_DO(type) LInstruction* Do##type(H##type* node); - HYDROGEN_CONCRETE_INSTRUCTION_LIST(DECLARE_DO) -#undef DECLARE_DO - - LInstruction* DoMultiplyAdd(HMul* mul, HValue* addend); - LInstruction* DoMultiplySub(HValue* minuend, HMul* mul); - LInstruction* DoRSub(HSub* instr); - - static bool HasMagicNumberForDivisor(int32_t divisor); - - LInstruction* DoMathFloor(HUnaryMathOperation* instr); - LInstruction* DoMathRound(HUnaryMathOperation* instr); - LInstruction* DoMathFround(HUnaryMathOperation* instr); - LInstruction* DoMathAbs(HUnaryMathOperation* instr); - LInstruction* DoMathLog(HUnaryMathOperation* instr); - LInstruction* DoMathExp(HUnaryMathOperation* instr); - LInstruction* DoMathSqrt(HUnaryMathOperation* instr); - LInstruction* DoMathPowHalf(HUnaryMathOperation* instr); - LInstruction* DoMathClz32(HUnaryMathOperation* instr); - LInstruction* DoDivByPowerOf2I(HDiv* instr); - LInstruction* DoDivByConstI(HDiv* instr); - LInstruction* DoDivI(HDiv* instr); - LInstruction* DoModByPowerOf2I(HMod* instr); - LInstruction* DoModByConstI(HMod* instr); - LInstruction* DoModI(HMod* instr); - LInstruction* DoFlooringDivByPowerOf2I(HMathFloorOfDiv* instr); - LInstruction* DoFlooringDivByConstI(HMathFloorOfDiv* instr); - LInstruction* DoFlooringDivI(HMathFloorOfDiv* instr); - - private: - // Methods for getting operands for Use / Define / Temp. - LUnallocated* ToUnallocated(Register reg); - LUnallocated* ToUnallocated(DoubleRegister reg); - - // Methods for setting up define-use relationships. - MUST_USE_RESULT LOperand* Use(HValue* value, LUnallocated* operand); - MUST_USE_RESULT LOperand* UseFixed(HValue* value, Register fixed_register); - MUST_USE_RESULT LOperand* UseFixedDouble(HValue* value, - DoubleRegister fixed_register); - - // A value that is guaranteed to be allocated to a register. - // Operand created by UseRegister is guaranteed to be live until the end of - // instruction. This means that register allocator will not reuse it's - // register for any other operand inside instruction. - // Operand created by UseRegisterAtStart is guaranteed to be live only at - // instruction start. Register allocator is free to assign the same register - // to some other operand used inside instruction (i.e. temporary or - // output). - MUST_USE_RESULT LOperand* UseRegister(HValue* value); - MUST_USE_RESULT LOperand* UseRegisterAtStart(HValue* value); - - // An input operand in a register that may be trashed. - MUST_USE_RESULT LOperand* UseTempRegister(HValue* value); - - // An input operand in a register or stack slot. - MUST_USE_RESULT LOperand* Use(HValue* value); - MUST_USE_RESULT LOperand* UseAtStart(HValue* value); - - // An input operand in a register, stack slot or a constant operand. - MUST_USE_RESULT LOperand* UseOrConstant(HValue* value); - MUST_USE_RESULT LOperand* UseOrConstantAtStart(HValue* value); - - // An input operand in a register or a constant operand. - MUST_USE_RESULT LOperand* UseRegisterOrConstant(HValue* value); - MUST_USE_RESULT LOperand* UseRegisterOrConstantAtStart(HValue* value); - - // An input operand in a constant operand. - MUST_USE_RESULT LOperand* UseConstant(HValue* value); - - // An input operand in register, stack slot or a constant operand. - // Will not be moved to a register even if one is freely available. - MUST_USE_RESULT LOperand* UseAny(HValue* value) override; - - // Temporary operand that must be in a register. - MUST_USE_RESULT LUnallocated* TempRegister(); - MUST_USE_RESULT LUnallocated* TempDoubleRegister(); - MUST_USE_RESULT LOperand* FixedTemp(Register reg); - MUST_USE_RESULT LOperand* FixedTemp(DoubleRegister reg); - - // Methods for setting up define-use relationships. - // Return the same instruction that they are passed. - LInstruction* Define(LTemplateResultInstruction<1>* instr, - LUnallocated* result); - LInstruction* DefineAsRegister(LTemplateResultInstruction<1>* instr); - LInstruction* DefineAsSpilled(LTemplateResultInstruction<1>* instr, - int index); - LInstruction* DefineSameAsFirst(LTemplateResultInstruction<1>* instr); - LInstruction* DefineFixed(LTemplateResultInstruction<1>* instr, Register reg); - LInstruction* DefineFixedDouble(LTemplateResultInstruction<1>* instr, - DoubleRegister reg); - LInstruction* AssignEnvironment(LInstruction* instr); - LInstruction* AssignPointerMap(LInstruction* instr); - - enum CanDeoptimize { CAN_DEOPTIMIZE_EAGERLY, CANNOT_DEOPTIMIZE_EAGERLY }; - - // By default we assume that instruction sequences generated for calls - // cannot deoptimize eagerly and we do not attach environment to this - // instruction. - LInstruction* MarkAsCall( - LInstruction* instr, HInstruction* hinstr, - CanDeoptimize can_deoptimize = CANNOT_DEOPTIMIZE_EAGERLY); - - void VisitInstruction(HInstruction* current); - void AddInstruction(LInstruction* instr, HInstruction* current); - - void DoBasicBlock(HBasicBlock* block, HBasicBlock* next_block); - LInstruction* DoShift(Token::Value op, HBitwiseBinaryOperation* instr); - LInstruction* DoArithmeticD(Token::Value op, - HArithmeticBinaryOperation* instr); - LInstruction* DoArithmeticT(Token::Value op, HBinaryOperation* instr); - - HInstruction* current_instruction_; - HBasicBlock* current_block_; - HBasicBlock* next_block_; - LAllocator* allocator_; - - DISALLOW_COPY_AND_ASSIGN(LChunkBuilder); -}; - -#undef DECLARE_HYDROGEN_ACCESSOR -#undef DECLARE_CONCRETE_INSTRUCTION -} -} // namespace v8::internal - -#endif // V8_PPC_LITHIUM_PPC_H_ diff --git a/deps/v8/src/ppc/macro-assembler-ppc.cc b/deps/v8/src/ppc/macro-assembler-ppc.cc index e973471572..e543ba853b 100644 --- a/deps/v8/src/ppc/macro-assembler-ppc.cc +++ b/deps/v8/src/ppc/macro-assembler-ppc.cc @@ -12,9 +12,11 @@ #include "src/bootstrapper.h" #include "src/codegen.h" #include "src/debug/debug.h" -#include "src/ppc/macro-assembler-ppc.h" +#include "src/register-configuration.h" #include "src/runtime/runtime.h" +#include "src/ppc/macro-assembler-ppc.h" + namespace v8 { namespace internal { @@ -24,7 +26,7 @@ MacroAssembler::MacroAssembler(Isolate* arg_isolate, void* buffer, int size) has_frame_(false) { if (isolate() != NULL) { code_object_ = - Handle<Object>(isolate()->heap()->undefined_value(), isolate()); + Handle<Object>::New(isolate()->heap()->undefined_value(), isolate()); } } @@ -47,7 +49,8 @@ void MacroAssembler::Jump(intptr_t target, RelocInfo::Mode rmode, if (cond != al) b(NegateCondition(cond), &skip, cr); - DCHECK(rmode == RelocInfo::CODE_TARGET || rmode == RelocInfo::RUNTIME_ENTRY); + DCHECK(rmode == RelocInfo::CODE_TARGET || rmode == RelocInfo::RUNTIME_ENTRY || + rmode == RelocInfo::CONSTRUCT_CALL); mov(ip, Operand(target, rmode)); mtctr(ip); @@ -564,7 +567,7 @@ void MacroAssembler::PopFixedFrame(Register marker_reg) { const RegList MacroAssembler::kSafepointSavedRegisters = Register::kAllocatable; const int MacroAssembler::kNumSafepointSavedRegisters = - Register::kMaxNumAllocatableRegisters; + Register::kNumAllocatable; // Push and pop all registers that can hold pointers. void MacroAssembler::PushSafepointRegisters() { @@ -623,7 +626,9 @@ MemOperand MacroAssembler::SafepointRegisterSlot(Register reg) { MemOperand MacroAssembler::SafepointRegistersAndDoublesSlot(Register reg) { // General purpose registers are pushed last on the stack. - int doubles_size = DoubleRegister::NumAllocatableRegisters() * kDoubleSize; + const RegisterConfiguration* config = + RegisterConfiguration::ArchDefault(RegisterConfiguration::CRANKSHAFT); + int doubles_size = config->num_allocatable_double_registers() * kDoubleSize; int register_offset = SafepointRegisterStackIndex(reg.code()) * kPointerSize; return MemOperand(sp, doubles_size + register_offset); } @@ -654,11 +659,26 @@ void MacroAssembler::ConvertIntToFloat(const DoubleRegister dst, const Register src, const Register int_scratch) { MovIntToDouble(dst, src, int_scratch); - fcfid(dst, dst); - frsp(dst, dst); + fcfids(dst, dst); +} + + +#if V8_TARGET_ARCH_PPC64 +void MacroAssembler::ConvertInt64ToDouble(Register src, + DoubleRegister double_dst) { + MovInt64ToDouble(double_dst, src); + fcfid(double_dst, double_dst); } +void MacroAssembler::ConvertInt64ToFloat(Register src, + DoubleRegister double_dst) { + MovInt64ToDouble(double_dst, src); + fcfids(double_dst, double_dst); +} +#endif + + void MacroAssembler::ConvertDoubleToInt64(const DoubleRegister double_input, #if !V8_TARGET_ARCH_PPC64 const Register dst_hi, @@ -863,7 +883,7 @@ void MacroAssembler::EnterExitFrame(bool save_doubles, int stack_space) { MultiPushDoubles(kCallerSavedDoubles); // Note that d0 will be accessible at // fp - ExitFrameConstants::kFrameSize - - // kNumVolatileRegisters * kDoubleSize, + // kNumCallerSavedDoubles * kDoubleSize, // since the sp slot and code slot were pushed after the fp. } @@ -922,7 +942,7 @@ void MacroAssembler::LeaveExitFrame(bool save_doubles, Register argument_count, // Optionally restore all double registers. if (save_doubles) { // Calculate the stack location of the saved doubles and restore them. - const int kNumRegs = DoubleRegister::kNumVolatileRegisters; + const int kNumRegs = kNumCallerSavedDoubles; const int offset = (ExitFrameConstants::kFrameSize + kNumRegs * kDoubleSize); addi(r6, fp, Operand(-offset)); @@ -1206,7 +1226,8 @@ void MacroAssembler::CheckAccessGlobalProxy(Register holder_reg, int offset = Context::kHeaderSize + Context::GLOBAL_OBJECT_INDEX * kPointerSize; LoadP(scratch, FieldMemOperand(scratch, offset)); - LoadP(scratch, FieldMemOperand(scratch, GlobalObject::kNativeContextOffset)); + LoadP(scratch, + FieldMemOperand(scratch, JSGlobalObject::kNativeContextOffset)); // Check the context is a native context. if (emit_debug_code()) { @@ -2273,7 +2294,7 @@ void MacroAssembler::GetBuiltinFunction(Register target, // Load the builtins object into target register. LoadP(target, MemOperand(cp, Context::SlotOffset(Context::GLOBAL_OBJECT_INDEX))); - LoadP(target, FieldMemOperand(target, GlobalObject::kNativeContextOffset)); + LoadP(target, FieldMemOperand(target, JSGlobalObject::kNativeContextOffset)); // Load the JavaScript builtin function from the builtins object. LoadP(target, ContextOperand(target, native_context_index), r0); } @@ -2408,7 +2429,7 @@ void MacroAssembler::LoadContext(Register dst, int context_chain_length) { void MacroAssembler::LoadGlobalProxy(Register dst) { LoadP(dst, GlobalObjectOperand()); - LoadP(dst, FieldMemOperand(dst, GlobalObject::kGlobalProxyOffset)); + LoadP(dst, FieldMemOperand(dst, JSGlobalObject::kGlobalProxyOffset)); } @@ -2418,7 +2439,8 @@ void MacroAssembler::LoadTransitionedArrayMapConditional( // Load the global or builtins object from the current context. LoadP(scratch, MemOperand(cp, Context::SlotOffset(Context::GLOBAL_OBJECT_INDEX))); - LoadP(scratch, FieldMemOperand(scratch, GlobalObject::kNativeContextOffset)); + LoadP(scratch, + FieldMemOperand(scratch, JSGlobalObject::kNativeContextOffset)); // Check that the function's map is the same as the expected cached map. LoadP(scratch, @@ -2440,7 +2462,7 @@ void MacroAssembler::LoadGlobalFunction(int index, Register function) { MemOperand(cp, Context::SlotOffset(Context::GLOBAL_OBJECT_INDEX))); // Load the native context from the global or builtins object. LoadP(function, - FieldMemOperand(function, GlobalObject::kNativeContextOffset)); + FieldMemOperand(function, JSGlobalObject::kNativeContextOffset)); // Load the function from the native context. LoadP(function, MemOperand(function, Context::SlotOffset(index)), r0); } @@ -4250,8 +4272,11 @@ Register GetRegisterThatIsNotOneOf(Register reg1, Register reg2, Register reg3, if (reg5.is_valid()) regs |= reg5.bit(); if (reg6.is_valid()) regs |= reg6.bit(); - for (int i = 0; i < Register::NumAllocatableRegisters(); i++) { - Register candidate = Register::FromAllocationIndex(i); + const RegisterConfiguration* config = + RegisterConfiguration::ArchDefault(RegisterConfiguration::CRANKSHAFT); + for (int i = 0; i < config->num_allocatable_general_registers(); ++i) { + int code = config->GetAllocatableGeneralCode(i); + Register candidate = Register::from_code(code); if (regs & candidate.bit()) continue; return candidate; } diff --git a/deps/v8/src/ppc/macro-assembler-ppc.h b/deps/v8/src/ppc/macro-assembler-ppc.h index f87c563e72..d4660d9207 100644 --- a/deps/v8/src/ppc/macro-assembler-ppc.h +++ b/deps/v8/src/ppc/macro-assembler-ppc.h @@ -14,17 +14,18 @@ namespace v8 { namespace internal { // Give alias names to registers for calling conventions. -const Register kReturnRegister0 = {kRegister_r3_Code}; -const Register kReturnRegister1 = {kRegister_r4_Code}; -const Register kJSFunctionRegister = {kRegister_r4_Code}; -const Register kContextRegister = {kRegister_r30_Code}; -const Register kInterpreterAccumulatorRegister = {kRegister_r3_Code}; -const Register kInterpreterRegisterFileRegister = {kRegister_r14_Code}; -const Register kInterpreterBytecodeOffsetRegister = {kRegister_r15_Code}; -const Register kInterpreterBytecodeArrayRegister = {kRegister_r16_Code}; -const Register kInterpreterDispatchTableRegister = {kRegister_r17_Code}; -const Register kRuntimeCallFunctionRegister = {kRegister_r4_Code}; -const Register kRuntimeCallArgCountRegister = {kRegister_r3_Code}; +const Register kReturnRegister0 = {Register::kCode_r3}; +const Register kReturnRegister1 = {Register::kCode_r4}; +const Register kJSFunctionRegister = {Register::kCode_r4}; +const Register kContextRegister = {Register::kCode_r30}; +const Register kInterpreterAccumulatorRegister = {Register::kCode_r3}; +const Register kInterpreterRegisterFileRegister = {Register::kCode_r14}; +const Register kInterpreterBytecodeOffsetRegister = {Register::kCode_r15}; +const Register kInterpreterBytecodeArrayRegister = {Register::kCode_r16}; +const Register kInterpreterDispatchTableRegister = {Register::kCode_r17}; +const Register kJavaScriptCallArgCountRegister = {Register::kCode_r3}; +const Register kRuntimeCallFunctionRegister = {Register::kCode_r4}; +const Register kRuntimeCallArgCountRegister = {Register::kCode_r3}; // ---------------------------------------------------------------------------- // Static helper functions @@ -385,6 +386,11 @@ class MacroAssembler : public Assembler { void ConvertIntToFloat(const DoubleRegister dst, const Register src, const Register int_scratch); +#if V8_TARGET_ARCH_PPC64 + void ConvertInt64ToDouble(Register src, DoubleRegister double_dst); + void ConvertInt64ToFloat(Register src, DoubleRegister double_dst); +#endif + // Converts the double_input to an integer. Note that, upon return, // the contents of double_dst will also hold the fixed point representation. void ConvertDoubleToInt64(const DoubleRegister double_input, @@ -1569,7 +1575,7 @@ inline MemOperand GlobalObjectOperand() { #else #define ACCESS_MASM(masm) masm-> #endif -} -} // namespace v8::internal +} // namespace internal +} // namespace v8 #endif // V8_PPC_MACRO_ASSEMBLER_PPC_H_ diff --git a/deps/v8/src/ppc/simulator-ppc.cc b/deps/v8/src/ppc/simulator-ppc.cc index 518f8fae75..fa088a2c30 100644 --- a/deps/v8/src/ppc/simulator-ppc.cc +++ b/deps/v8/src/ppc/simulator-ppc.cc @@ -164,7 +164,7 @@ bool PPCDebugger::GetValue(const char* desc, intptr_t* value) { bool PPCDebugger::GetFPDoubleValue(const char* desc, double* value) { - int regnum = FPRegisters::Number(desc); + int regnum = DoubleRegisters::Number(desc); if (regnum != kNoRegister) { *value = sim_->get_double_from_d_register(regnum); return true; @@ -313,7 +313,8 @@ void PPCDebugger::Debug() { if (strcmp(arg1, "all") == 0) { for (int i = 0; i < kNumRegisters; i++) { value = GetRegisterValue(i); - PrintF(" %3s: %08" V8PRIxPTR, Registers::Name(i), value); + PrintF(" %3s: %08" V8PRIxPTR, + Register::from_code(i).ToString(), value); if ((argc == 3 && strcmp(arg2, "fp") == 0) && i < 8 && (i % 2) == 0) { dvalue = GetRegisterPairDoubleValue(i); @@ -332,7 +333,7 @@ void PPCDebugger::Debug() { for (int i = 0; i < kNumRegisters; i++) { value = GetRegisterValue(i); PrintF(" %3s: %08" V8PRIxPTR " %11" V8PRIdPTR, - Registers::Name(i), value, value); + Register::from_code(i).ToString(), value, value); if ((argc == 3 && strcmp(arg2, "fp") == 0) && i < 8 && (i % 2) == 0) { dvalue = GetRegisterPairDoubleValue(i); @@ -351,7 +352,8 @@ void PPCDebugger::Debug() { for (int i = 0; i < DoubleRegister::kNumRegisters; i++) { dvalue = GetFPDoubleRegisterValue(i); uint64_t as_words = bit_cast<uint64_t>(dvalue); - PrintF("%3s: %f 0x%08x %08x\n", FPRegisters::Name(i), dvalue, + PrintF("%3s: %f 0x%08x %08x\n", + DoubleRegister::from_code(i).ToString(), dvalue, static_cast<uint32_t>(as_words >> 32), static_cast<uint32_t>(as_words & 0xffffffff)); } @@ -1847,6 +1849,36 @@ bool Simulator::ExecuteExt2_10bit(Instruction* instr) { } break; } + case POPCNTW: { + int rs = instr->RSValue(); + int ra = instr->RAValue(); + uintptr_t rs_val = get_register(rs); + uintptr_t count = 0; + int n = 0; + uintptr_t bit = 0x80000000; + for (; n < 32; n++) { + if (bit & rs_val) count++; + bit >>= 1; + } + set_register(ra, count); + break; + } +#if V8_TARGET_ARCH_PPC64 + case POPCNTD: { + int rs = instr->RSValue(); + int ra = instr->RAValue(); + uintptr_t rs_val = get_register(rs); + uintptr_t count = 0; + int n = 0; + uintptr_t bit = 0x8000000000000000UL; + for (; n < 64; n++) { + if (bit & rs_val) count++; + bit >>= 1; + } + set_register(ra, count); + break; + } +#endif case SYNC: { // todo - simulate sync break; @@ -2663,6 +2695,24 @@ void Simulator::ExecuteExt2(Instruction* instr) { } +void Simulator::ExecuteExt3(Instruction* instr) { + int opcode = instr->Bits(10, 1) << 1; + switch (opcode) { + case FCFID: { + // fcfids + int frt = instr->RTValue(); + int frb = instr->RBValue(); + double t_val = get_double_from_d_register(frb); + int64_t* frb_val_p = reinterpret_cast<int64_t*>(&t_val); + double frt_val = static_cast<float>(*frb_val_p); + set_d_register_from_double(frt, frt_val); + return; + } + } + UNIMPLEMENTED(); // Not used by V8. +} + + void Simulator::ExecuteExt4(Instruction* instr) { switch (instr->Bits(5, 1) << 1) { case FDIV: { @@ -3578,8 +3628,10 @@ void Simulator::ExecuteGeneric(Instruction* instr) { break; } - case EXT3: - UNIMPLEMENTED(); + case EXT3: { + ExecuteExt3(instr); + break; + } case EXT4: { ExecuteExt4(instr); break; diff --git a/deps/v8/src/ppc/simulator-ppc.h b/deps/v8/src/ppc/simulator-ppc.h index 042b2ada2c..bdf50ba474 100644 --- a/deps/v8/src/ppc/simulator-ppc.h +++ b/deps/v8/src/ppc/simulator-ppc.h @@ -54,8 +54,8 @@ class SimulatorStack : public v8::internal::AllStatic { static inline void UnregisterCTryCatch() {} }; -} -} // namespace v8::internal +} // namespace internal +} // namespace v8 #else // !defined(USE_SIMULATOR) // Running with a simulator. @@ -311,6 +311,7 @@ class Simulator { bool ExecuteExt2_9bit_part2(Instruction* instr); void ExecuteExt2_5bit(Instruction* instr); void ExecuteExt2(Instruction* instr); + void ExecuteExt3(Instruction* instr); void ExecuteExt4(Instruction* instr); #if V8_TARGET_ARCH_PPC64 void ExecuteExt5(Instruction* instr); @@ -422,8 +423,8 @@ class SimulatorStack : public v8::internal::AllStatic { Simulator::current(Isolate::Current())->PopAddress(); } }; -} -} // namespace v8::internal +} // namespace internal +} // namespace v8 #endif // !defined(USE_SIMULATOR) #endif // V8_PPC_SIMULATOR_PPC_H_ |