| Index: src/compiler/x64/instruction-selector-x64.cc
|
| diff --git a/src/compiler/x64/instruction-selector-x64.cc b/src/compiler/x64/instruction-selector-x64.cc
|
| index 7327bce4b8735cd74787c1a63242a256fd99268b..47deb026a8ca377fd9a75321eca5cf6006791106 100644
|
| --- a/src/compiler/x64/instruction-selector-x64.cc
|
| +++ b/src/compiler/x64/instruction-selector-x64.cc
|
| @@ -37,11 +37,15 @@ class X64OperandGenerator final : public OperandGenerator {
|
| }
|
| }
|
|
|
| - bool CanBeMemoryOperand(InstructionCode opcode, Node* node, Node* input) {
|
| + bool CanBeMemoryOperand(InstructionCode opcode, Node* node, Node* input,
|
| + int effect_level) {
|
| if (input->opcode() != IrOpcode::kLoad ||
|
| !selector()->CanCover(node, input)) {
|
| return false;
|
| }
|
| + if (effect_level != selector()->GetEffectLevel(input)) {
|
| + return false;
|
| + }
|
| MachineRepresentation rep =
|
| LoadRepresentationOf(input->op()).representation();
|
| switch (opcode) {
|
| @@ -1506,35 +1510,6 @@ void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
|
| VisitCompare(selector, opcode, g.UseRegister(left), g.Use(right), cont);
|
| }
|
|
|
| -bool InferMachineRepresentation(Node* node,
|
| - MachineRepresentation* representation) {
|
| - if (node->opcode() == IrOpcode::kLoad) {
|
| - *representation = LoadRepresentationOf(node->op()).representation();
|
| - return true;
|
| - }
|
| - int64_t value = 0;
|
| - switch (node->opcode()) {
|
| - case IrOpcode::kInt32Constant:
|
| - value = OpParameter<int32_t>(node->op());
|
| - break;
|
| - case IrOpcode::kInt64Constant:
|
| - value = OpParameter<int64_t>(node->op());
|
| - break;
|
| - default:
|
| - return false;
|
| - }
|
| - if (is_int8(value)) {
|
| - *representation = MachineRepresentation::kWord8;
|
| - } else if (is_int16(value)) {
|
| - *representation = MachineRepresentation::kWord16;
|
| - } else if (is_int32(value)) {
|
| - *representation = MachineRepresentation::kWord32;
|
| - } else {
|
| - return false;
|
| - }
|
| - return true;
|
| -}
|
| -
|
| // Tries to match the size of the given opcode to that of the operands, if
|
| // possible.
|
| InstructionCode TryNarrowOpcodeSize(InstructionCode opcode, Node* left,
|
| @@ -1542,22 +1517,20 @@ InstructionCode TryNarrowOpcodeSize(InstructionCode opcode, Node* left,
|
| if (opcode != kX64Cmp32 && opcode != kX64Test32) {
|
| return opcode;
|
| }
|
| - // We only do this if at least one of the two operands is a load.
|
| - // TODO(epertoso): we can probably get some size information out of phi nodes.
|
| - if (left->opcode() != IrOpcode::kLoad && right->opcode() != IrOpcode::kLoad) {
|
| + // Currently, if one of the two operands is not a Load, we don't know what its
|
| + // machine representation is, so we bail out.
|
| + // TODO(epertoso): we can probably get some size information out of immediates
|
| + // and phi nodes.
|
| + if (left->opcode() != IrOpcode::kLoad || right->opcode() != IrOpcode::kLoad) {
|
| return opcode;
|
| }
|
| - MachineRepresentation left_representation, right_representation;
|
| - if (!InferMachineRepresentation(left, &left_representation) ||
|
| - !InferMachineRepresentation(right, &right_representation)) {
|
| - return opcode;
|
| - }
|
| - // If the representations don't match, both operands will be
|
| + // If the load representations don't match, both operands will be
|
| // zero/sign-extended to 32bit.
|
| - if (left_representation != right_representation) {
|
| + LoadRepresentation left_representation = LoadRepresentationOf(left->op());
|
| + if (left_representation != LoadRepresentationOf(right->op())) {
|
| return opcode;
|
| }
|
| - switch (left_representation) {
|
| + switch (left_representation.representation()) {
|
| case MachineRepresentation::kBit:
|
| case MachineRepresentation::kWord8:
|
| return opcode == kX64Cmp32 ? kX64Cmp8 : kX64Test8;
|
| @@ -1575,46 +1548,27 @@ void VisitWordCompare(InstructionSelector* selector, Node* node,
|
| Node* left = node->InputAt(0);
|
| Node* right = node->InputAt(1);
|
|
|
| - InstructionCode narrowed_opcode = TryNarrowOpcodeSize(opcode, left, right);
|
| + opcode = TryNarrowOpcodeSize(opcode, left, right);
|
|
|
| // If one of the two inputs is an immediate, make sure it's on the right, or
|
| // if one of the two inputs is a memory operand, make sure it's on the left.
|
| + int effect_level = selector->GetEffectLevel(node);
|
| + if (cont->IsBranch()) {
|
| + effect_level = selector->GetEffectLevel(
|
| + cont->true_block()->PredecessorAt(0)->control_input());
|
| + }
|
| +
|
| if ((!g.CanBeImmediate(right) && g.CanBeImmediate(left)) ||
|
| - (g.CanBeMemoryOperand(narrowed_opcode, node, right) &&
|
| - !g.CanBeMemoryOperand(narrowed_opcode, node, left))) {
|
| + (g.CanBeMemoryOperand(opcode, node, right, effect_level) &&
|
| + !g.CanBeMemoryOperand(opcode, node, left, effect_level))) {
|
| if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute();
|
| std::swap(left, right);
|
| }
|
|
|
| // Match immediates on right side of comparison.
|
| if (g.CanBeImmediate(right)) {
|
| - if (g.CanBeMemoryOperand(narrowed_opcode, node, left)) {
|
| - // If we're truncating the immediate (32 bits to 16 or 8), comparison
|
| - // semantics should take the signedness/unsignedness of the op into
|
| - // account.
|
| - if (narrowed_opcode != opcode &&
|
| - LoadRepresentationOf(left->op()).IsUnsigned()) {
|
| - switch (cont->condition()) {
|
| - case FlagsCondition::kSignedLessThan:
|
| - cont->OverwriteAndNegateIfEqual(FlagsCondition::kUnsignedLessThan);
|
| - break;
|
| - case FlagsCondition::kSignedGreaterThan:
|
| - cont->OverwriteAndNegateIfEqual(
|
| - FlagsCondition::kUnsignedGreaterThan);
|
| - break;
|
| - case FlagsCondition::kSignedLessThanOrEqual:
|
| - cont->OverwriteAndNegateIfEqual(
|
| - FlagsCondition::kUnsignedLessThanOrEqual);
|
| - break;
|
| - case FlagsCondition::kSignedGreaterThanOrEqual:
|
| - cont->OverwriteAndNegateIfEqual(
|
| - FlagsCondition::kUnsignedGreaterThanOrEqual);
|
| - break;
|
| - default:
|
| - break;
|
| - }
|
| - }
|
| - return VisitCompareWithMemoryOperand(selector, narrowed_opcode, left,
|
| + if (g.CanBeMemoryOperand(opcode, node, left, effect_level)) {
|
| + return VisitCompareWithMemoryOperand(selector, opcode, left,
|
| g.UseImmediate(right), cont);
|
| }
|
| return VisitCompare(selector, opcode, g.Use(left), g.UseImmediate(right),
|
| @@ -1622,8 +1576,8 @@ void VisitWordCompare(InstructionSelector* selector, Node* node,
|
| }
|
|
|
| // Match memory operands on left side of comparison.
|
| - if (g.CanBeMemoryOperand(narrowed_opcode, node, left)) {
|
| - return VisitCompareWithMemoryOperand(selector, narrowed_opcode, left,
|
| + if (g.CanBeMemoryOperand(opcode, node, left, effect_level)) {
|
| + return VisitCompareWithMemoryOperand(selector, opcode, left,
|
| g.UseRegister(right), cont);
|
| }
|
|
|
|
|