Index: src/mips/lithium-mips.cc |
diff --git a/src/mips/lithium-mips.cc b/src/mips/lithium-mips.cc |
index 38134f4691c73bda88a81c916c1047265221bf9a..f8091206a6051a4961162c74e8638fb3ef0d6ed2 100644 |
--- a/src/mips/lithium-mips.cc |
+++ b/src/mips/lithium-mips.cc |
@@ -715,51 +715,44 @@ 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()); |
- |
- LOperand* left = UseFixed(instr->left(), a1); |
- LOperand* right = UseFixed(instr->right(), a0); |
- LArithmeticT* result = new(zone()) LArithmeticT(op, left, right); |
- return MarkAsCall(DefineFixed(result, v0), instr); |
- } |
- |
- ASSERT(instr->representation().IsSmiOrInteger32()); |
- ASSERT(instr->left()->representation().Equals(instr->representation())); |
- ASSERT(instr->right()->representation().Equals(instr->representation())); |
- LOperand* left = UseRegisterAtStart(instr->left()); |
+ if (instr->representation().IsSmiOrInteger32()) { |
+ ASSERT(instr->left()->representation().Equals(instr->representation())); |
+ ASSERT(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); |
+ 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); |
} |
- } else { |
- right = UseRegisterAtStart(right_value); |
- } |
- // Shift operations can deoptimize if we do a logical shift |
- // by 0 and the result cannot be truncated to int32. |
- 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); |
+ // 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) { |
+ if (FLAG_opt_safe_uint32_operations) { |
+ does_deopt = !instr->CheckFlag(HInstruction::kUint32); |
+ } else { |
+ does_deopt = !instr->CheckUsesForFlag(HValue::kTruncatingToInt32); |
+ } |
} |
- } |
- LInstruction* result = |
- DefineAsRegister(new(zone()) LShiftI(op, left, right, does_deopt)); |
- return does_deopt ? AssignEnvironment(result) : result; |
+ LInstruction* result = |
+ DefineAsRegister(new(zone()) LShiftI(op, left, right, does_deopt)); |
+ return does_deopt ? AssignEnvironment(result) : result; |
+ } else { |
+ return DoArithmeticT(op, instr); |
+ } |
} |
@@ -768,21 +761,26 @@ 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->left()); |
- LOperand* right = UseRegisterAtStart(instr->right()); |
+ LOperand* left = NULL; |
+ LOperand* right = NULL; |
+ if (op == Token::MOD) { |
+ left = UseFixedDouble(instr->left(), f2); |
+ right = UseFixedDouble(instr->right(), f4); |
+ 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, f2), instr); |
+ } |
+ left = UseRegisterAtStart(instr->left()); |
+ right = UseRegisterAtStart(instr->right()); |
LArithmeticD* result = new(zone()) LArithmeticD(op, left, right); |
return DefineAsRegister(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()); |
@@ -1349,33 +1347,27 @@ 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 DefineAsRegister(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(), a1); |
- LOperand* right = UseFixed(instr->right(), a0); |
- LArithmeticT* result = new(zone()) LArithmeticT(instr->op(), left, right); |
- return MarkAsCall(DefineFixed(result, v0), 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())); |
LOperand* dividend = UseRegister(instr->left()); |
LOperand* divisor = UseRegister(instr->right()); |
LDivI* div = new(zone()) LDivI(dividend, divisor); |
return AssignEnvironment(DefineAsRegister(div)); |
+ } else if (instr->representation().IsDouble()) { |
+ return DoArithmeticD(Token::DIV, instr); |
} else { |
return DoArithmeticT(Token::DIV, instr); |
} |
@@ -1466,17 +1458,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, f2), |
- UseFixedDouble(right, f4)); |
- return MarkAsCall(DefineFixedDouble(mod, f2), instr); |
+ return DoArithmeticT(Token::MOD, instr); |
} |
} |
@@ -1579,7 +1564,6 @@ LInstruction* LChunkBuilder::DoAdd(HAdd* instr) { |
} |
return DoArithmeticD(Token::ADD, instr); |
} else { |
- ASSERT(instr->representation().IsTagged()); |
return DoArithmeticT(Token::ADD, instr); |
} |
} |