| Index: src/x64/lithium-x64.cc
|
| diff --git a/src/x64/lithium-x64.cc b/src/x64/lithium-x64.cc
|
| index d9daaacca0bbbdbb29f79756ebb330d1ddf5524e..662cfce6a037ff77b3b7d58c695ded2b24923524 100644
|
| --- a/src/x64/lithium-x64.cc
|
| +++ b/src/x64/lithium-x64.cc
|
| @@ -719,46 +719,39 @@ LInstruction* LChunkBuilder::DoDeoptimize(HDeoptimize* instr) {
|
|
|
| LInstruction* LChunkBuilder::DoShift(Token::Value op,
|
| HBitwiseBinaryOperation* instr) {
|
| - if (instr->representation().IsTagged()) {
|
| - ASSERT(instr->left()->representation().IsTagged());
|
| - ASSERT(instr->right()->representation().IsTagged());
|
| + if (instr->representation().IsSmiOrInteger32()) {
|
| + ASSERT(instr->left()->representation().Equals(instr->representation()));
|
| + ASSERT(instr->right()->representation().Equals(instr->representation()));
|
| + LOperand* left = UseRegisterAtStart(instr->left());
|
|
|
| - LOperand* left = UseFixed(instr->left(), rdx);
|
| - LOperand* right = UseFixed(instr->right(), rax);
|
| - LArithmeticT* result = new(zone()) LArithmeticT(op, left, right);
|
| - return MarkAsCall(DefineFixed(result, rax), instr);
|
| - }
|
| + HValue* right_value = instr->right();
|
| + LOperand* right = NULL;
|
| + int constant_value = 0;
|
| + if (right_value->IsConstant()) {
|
| + HConstant* constant = HConstant::cast(right_value);
|
| + right = chunk_->DefineConstantOperand(constant);
|
| + constant_value = constant->Integer32Value() & 0x1f;
|
| + } else {
|
| + right = UseFixed(right_value, rcx);
|
| + }
|
|
|
| - ASSERT(instr->representation().IsSmiOrInteger32());
|
| - ASSERT(instr->left()->representation().Equals(instr->representation()));
|
| - ASSERT(instr->right()->representation().Equals(instr->representation()));
|
| - LOperand* left = UseRegisterAtStart(instr->left());
|
| + // Shift operations can only deoptimize if we do a logical shift by 0 and
|
| + // the result cannot be truncated to int32.
|
| + bool does_deopt = false;
|
| + if (op == Token::SHR && constant_value == 0) {
|
| + if (FLAG_opt_safe_uint32_operations) {
|
| + does_deopt = !instr->CheckFlag(HInstruction::kUint32);
|
| + } else {
|
| + does_deopt = !instr->CheckUsesForFlag(HValue::kTruncatingToInt32);
|
| + }
|
| + }
|
|
|
| - HValue* right_value = instr->right();
|
| - LOperand* right = NULL;
|
| - int constant_value = 0;
|
| - if (right_value->IsConstant()) {
|
| - HConstant* constant = HConstant::cast(right_value);
|
| - right = chunk_->DefineConstantOperand(constant);
|
| - constant_value = constant->Integer32Value() & 0x1f;
|
| + LInstruction* result =
|
| + DefineSameAsFirst(new(zone()) LShiftI(op, left, right, does_deopt));
|
| + return does_deopt ? AssignEnvironment(result) : result;
|
| } else {
|
| - right = UseFixed(right_value, rcx);
|
| - }
|
| -
|
| - // Shift operations can only deoptimize if we do a logical shift by 0 and
|
| - // the result cannot be truncated to int32.
|
| - bool does_deopt = false;
|
| - if (op == Token::SHR && constant_value == 0) {
|
| - if (FLAG_opt_safe_uint32_operations) {
|
| - does_deopt = !instr->CheckFlag(HInstruction::kUint32);
|
| - } else {
|
| - does_deopt = !instr->CheckUsesForFlag(HValue::kTruncatingToInt32);
|
| - }
|
| + return DoArithmeticT(op, instr);
|
| }
|
| -
|
| - LInstruction* result =
|
| - DefineSameAsFirst(new(zone()) LShiftI(op, left, right, does_deopt));
|
| - return does_deopt ? AssignEnvironment(result) : result;
|
| }
|
|
|
|
|
| @@ -767,21 +760,21 @@ LInstruction* LChunkBuilder::DoArithmeticD(Token::Value op,
|
| ASSERT(instr->representation().IsDouble());
|
| ASSERT(instr->left()->representation().IsDouble());
|
| ASSERT(instr->right()->representation().IsDouble());
|
| - ASSERT(op != Token::MOD);
|
| LOperand* left = UseRegisterAtStart(instr->BetterLeftOperand());
|
| - LOperand* right = UseRegisterAtStart(instr->BetterRightOperand());
|
| + LOperand* right = NULL;
|
| + if (op == Token::MOD) {
|
| + right = UseFixedDouble(instr->BetterRightOperand(), xmm1);
|
| + LArithmeticD* result = new(zone()) LArithmeticD(op, left, right);
|
| + return MarkAsCall(DefineSameAsFirst(result), instr);
|
| + }
|
| + right = UseRegisterAtStart(instr->BetterRightOperand());
|
| LArithmeticD* result = new(zone()) LArithmeticD(op, left, right);
|
| return DefineSameAsFirst(result);
|
| }
|
|
|
|
|
| LInstruction* LChunkBuilder::DoArithmeticT(Token::Value op,
|
| - HArithmeticBinaryOperation* instr) {
|
| - ASSERT(op == Token::ADD ||
|
| - op == Token::DIV ||
|
| - op == Token::MOD ||
|
| - op == Token::MUL ||
|
| - op == Token::SUB);
|
| + HBinaryOperation* instr) {
|
| HValue* left = instr->left();
|
| HValue* right = instr->right();
|
| ASSERT(left->representation().IsTagged());
|
| @@ -1348,27 +1341,19 @@ LInstruction* LChunkBuilder::DoBitwise(HBitwise* instr) {
|
| if (instr->representation().IsSmiOrInteger32()) {
|
| ASSERT(instr->left()->representation().Equals(instr->representation()));
|
| ASSERT(instr->right()->representation().Equals(instr->representation()));
|
| + ASSERT(instr->CheckFlag(HValue::kTruncatingToInt32));
|
|
|
| LOperand* left = UseRegisterAtStart(instr->BetterLeftOperand());
|
| LOperand* right = UseOrConstantAtStart(instr->BetterRightOperand());
|
| return DefineSameAsFirst(new(zone()) LBitI(left, right));
|
| } else {
|
| - ASSERT(instr->representation().IsTagged());
|
| - ASSERT(instr->left()->representation().IsTagged());
|
| - ASSERT(instr->right()->representation().IsTagged());
|
| -
|
| - LOperand* left = UseFixed(instr->left(), rdx);
|
| - LOperand* right = UseFixed(instr->right(), rax);
|
| - LArithmeticT* result = new(zone()) LArithmeticT(instr->op(), left, right);
|
| - return MarkAsCall(DefineFixed(result, rax), instr);
|
| + return DoArithmeticT(instr->op(), instr);
|
| }
|
| }
|
|
|
|
|
| LInstruction* LChunkBuilder::DoDiv(HDiv* instr) {
|
| - if (instr->representation().IsDouble()) {
|
| - return DoArithmeticD(Token::DIV, instr);
|
| - } else if (instr->representation().IsSmiOrInteger32()) {
|
| + if (instr->representation().IsSmiOrInteger32()) {
|
| ASSERT(instr->left()->representation().Equals(instr->representation()));
|
| ASSERT(instr->right()->representation().Equals(instr->representation()));
|
| if (instr->HasPowerOf2Divisor()) {
|
| @@ -1385,8 +1370,9 @@ LInstruction* LChunkBuilder::DoDiv(HDiv* instr) {
|
| LOperand* divisor = UseRegister(instr->right());
|
| LDivI* result = new(zone()) LDivI(dividend, divisor, temp);
|
| return AssignEnvironment(DefineFixed(result, rax));
|
| + } else if (instr->representation().IsDouble()) {
|
| + return DoArithmeticD(Token::DIV, instr);
|
| } else {
|
| - ASSERT(instr->representation().IsTagged());
|
| return DoArithmeticT(Token::DIV, instr);
|
| }
|
| }
|
| @@ -1485,17 +1471,10 @@ LInstruction* LChunkBuilder::DoMod(HMod* instr) {
|
| ? AssignEnvironment(result)
|
| : result;
|
| }
|
| - } else if (instr->representation().IsTagged()) {
|
| - return DoArithmeticT(Token::MOD, instr);
|
| + } else if (instr->representation().IsDouble()) {
|
| + return DoArithmeticD(Token::MOD, instr);
|
| } else {
|
| - ASSERT(instr->representation().IsDouble());
|
| - // 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.
|
| - LArithmeticD* mod = new(zone()) LArithmeticD(Token::MOD,
|
| - UseFixedDouble(left, xmm2),
|
| - UseFixedDouble(right, xmm1));
|
| - return MarkAsCall(DefineFixedDouble(mod, xmm1), instr);
|
| + return DoArithmeticT(Token::MOD, instr);
|
| }
|
| }
|
|
|
| @@ -1515,7 +1494,6 @@ LInstruction* LChunkBuilder::DoMul(HMul* instr) {
|
| } else if (instr->representation().IsDouble()) {
|
| return DoArithmeticD(Token::MUL, instr);
|
| } else {
|
| - ASSERT(instr->representation().IsTagged());
|
| return DoArithmeticT(Token::MUL, instr);
|
| }
|
| }
|
| @@ -1536,7 +1514,6 @@ LInstruction* LChunkBuilder::DoSub(HSub* instr) {
|
| } else if (instr->representation().IsDouble()) {
|
| return DoArithmeticD(Token::SUB, instr);
|
| } else {
|
| - ASSERT(instr->representation().IsTagged());
|
| return DoArithmeticT(Token::SUB, instr);
|
| }
|
| }
|
| @@ -1568,7 +1545,6 @@ LInstruction* LChunkBuilder::DoAdd(HAdd* instr) {
|
| } else if (instr->representation().IsDouble()) {
|
| return DoArithmeticD(Token::ADD, instr);
|
| } else {
|
| - ASSERT(instr->representation().IsTagged());
|
| return DoArithmeticT(Token::ADD, instr);
|
| }
|
| return NULL;
|
|
|