Index: src/compiler/ia32/instruction-selector-ia32.cc |
diff --git a/src/compiler/ia32/instruction-selector-ia32.cc b/src/compiler/ia32/instruction-selector-ia32.cc |
index 17577f70da5b8d8974f870fcd3c1ca545e67cc15..14cf752565ce1db38b9902620bfa6dc5b524dc43 100644 |
--- a/src/compiler/ia32/instruction-selector-ia32.cc |
+++ b/src/compiler/ia32/instruction-selector-ia32.cc |
@@ -984,29 +984,66 @@ namespace { |
// Shared routine for multiple compare operations. |
void VisitCompare(InstructionSelector* selector, InstructionCode opcode, |
- InstructionOperand left, InstructionOperand right, |
- FlagsContinuation* cont) { |
+ size_t left_operands_count, InstructionOperand* left_operands, |
+ InstructionOperand right, FlagsContinuation* cont) { |
+ DCHECK(left_operands_count > 0 && left_operands_count <= 4); |
IA32OperandGenerator g(selector); |
+ opcode = cont->Encode(opcode); |
+ int input_count = 0; |
+ InstructionOperand inputs[6]; |
+ do { |
+ inputs[input_count] = left_operands[input_count]; |
+ } while (++input_count < left_operands_count); |
+ inputs[input_count++] = right; |
+ |
if (cont->IsBranch()) { |
- selector->Emit(cont->Encode(opcode), g.NoOutput(), left, right, |
- g.Label(cont->true_block()), g.Label(cont->false_block())); |
+ inputs[input_count++] = g.Label(cont->true_block()); |
+ inputs[input_count++] = g.Label(cont->false_block()); |
+ selector->Emit(opcode, 0, nullptr, input_count, inputs); |
} else { |
DCHECK(cont->IsSet()); |
- selector->Emit(cont->Encode(opcode), g.DefineAsByteRegister(cont->result()), |
- left, right); |
+ InstructionOperand output = g.DefineAsRegister(cont->result()); |
+ selector->Emit(opcode, 1, &output, input_count, inputs); |
+ } |
+} |
+ |
+// Determines if `input' of `node' can be replaced by a memory operand. |
+bool CanUseMemOp(InstructionCode opcode, Node* node, Node* input) { |
Benedikt Meurer
2016/02/18 05:02:53
Nit: Please use complete workds as in the rest of
epertoso
2016/02/18 10:58:29
Done.
|
+ if (input->opcode() == IrOpcode::kLoad && input->OwnedBy(node)) { |
Benedikt Meurer
2016/02/18 05:02:53
OwnedBy is not enough here. You need to use CanCov
epertoso
2016/02/18 10:58:29
Done. Also added the effect level check.
|
+ if (LoadRepresentationOf(input->op()).representation() == |
+ MachineRepresentation::kWord32) { |
+ return (opcode == kIA32Cmp || opcode == kIA32Test); |
+ } |
} |
+ return false; |
+} |
+ |
+// Shared routine for multiple compare operations. |
+void VisitCompare(InstructionSelector* selector, InstructionCode opcode, |
+ InstructionOperand left, InstructionOperand right, |
+ FlagsContinuation* cont) { |
+ VisitCompare(selector, opcode, 1, &left, right, cont); |
} |
// Shared routine for multiple compare operations. |
void VisitCompare(InstructionSelector* selector, InstructionCode opcode, |
Node* left, Node* right, FlagsContinuation* cont, |
- bool commutative) { |
+ bool commutative, Node* node = nullptr) { |
IA32OperandGenerator g(selector); |
if (commutative && g.CanBeBetterLeftOperand(right)) { |
std::swap(left, right); |
} |
- VisitCompare(selector, opcode, g.UseRegister(left), g.Use(right), cont); |
+ if (node && CanUseMemOp(opcode, node, left)) { |
Benedikt Meurer
2016/02/18 05:02:53
This is not safe unless you also know that there's
epertoso
2016/02/18 10:58:29
Done in CanUseMemoryOperand.
|
+ size_t input_count = 0; |
+ InstructionOperand inputs[4]; |
+ AddressingMode addressing_mode = |
+ g.GetEffectiveAddressMemoryOperand(left, inputs, &input_count); |
+ opcode |= AddressingModeField::encode(addressing_mode); |
+ VisitCompare(selector, opcode, input_count, inputs, g.Use(right), cont); |
+ } else { |
+ VisitCompare(selector, opcode, g.UseRegister(left), g.Use(right), cont); |
+ } |
} |
@@ -1032,18 +1069,30 @@ void VisitFloat64Compare(InstructionSelector* selector, Node* node, |
void VisitWordCompare(InstructionSelector* selector, Node* node, |
InstructionCode opcode, FlagsContinuation* cont) { |
IA32OperandGenerator g(selector); |
- Node* const left = node->InputAt(0); |
- Node* const right = node->InputAt(1); |
+ Node* left = node->InputAt(0); |
+ Node* right = node->InputAt(1); |
- // Match immediates on left or right side of comparison. |
- if (g.CanBeImmediate(right)) { |
- VisitCompare(selector, opcode, g.Use(left), g.UseImmediate(right), cont); |
- } else if (g.CanBeImmediate(left)) { |
+ if (!g.CanBeImmediate(right) && g.CanBeImmediate(left)) { |
if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute(); |
- VisitCompare(selector, opcode, g.Use(right), g.UseImmediate(left), cont); |
+ std::swap(left, right); |
+ } |
+ |
+ // Match immediates on right side of comparison. |
+ if (g.CanBeImmediate(right)) { |
+ if (CanUseMemOp(opcode, node, left)) { |
+ size_t left_operands_count = 0; |
+ InstructionOperand left_operands[4]; |
+ AddressingMode addressing_mode = g.GetEffectiveAddressMemoryOperand( |
+ left, left_operands, &left_operands_count); |
+ opcode |= AddressingModeField::encode(addressing_mode); |
+ VisitCompare(selector, opcode, left_operands_count, left_operands, |
+ g.UseImmediate(right), cont); |
+ } else { |
+ VisitCompare(selector, opcode, g.Use(left), g.UseImmediate(right), cont); |
+ } |
} else { |
VisitCompare(selector, opcode, left, right, cont, |
- node->op()->HasProperty(Operator::kCommutative)); |
+ node->op()->HasProperty(Operator::kCommutative), node); |
} |
} |