Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1 | // Copyright 2014 the V8 project authors. All rights reserved. |
| 2 | // Use of this source code is governed by a BSD-style license that can be |
| 3 | // found in the LICENSE file. |
| 4 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 5 | #include <algorithm> |
| 6 | |
| 7 | #include "src/base/adapters.h" |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 8 | #include "src/compiler/instruction-selector-impl.h" |
| 9 | #include "src/compiler/node-matchers.h" |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 10 | #include "src/compiler/node-properties.h" |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 11 | |
| 12 | namespace v8 { |
| 13 | namespace internal { |
| 14 | namespace compiler { |
| 15 | |
| 16 | // Adds X64-specific methods for generating operands. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 17 | class X64OperandGenerator final : public OperandGenerator { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 18 | public: |
| 19 | explicit X64OperandGenerator(InstructionSelector* selector) |
| 20 | : OperandGenerator(selector) {} |
| 21 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 22 | bool CanBeImmediate(Node* node) { |
| 23 | switch (node->opcode()) { |
| 24 | case IrOpcode::kInt32Constant: |
| 25 | return true; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 26 | case IrOpcode::kInt64Constant: { |
| 27 | const int64_t value = OpParameter<int64_t>(node); |
| 28 | return value == static_cast<int64_t>(static_cast<int32_t>(value)); |
| 29 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 30 | case IrOpcode::kNumberConstant: { |
| 31 | const double value = OpParameter<double>(node); |
| 32 | return bit_cast<int64_t>(value) == 0; |
| 33 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 34 | default: |
| 35 | return false; |
| 36 | } |
| 37 | } |
| 38 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 39 | bool CanBeMemoryOperand(InstructionCode opcode, Node* node, Node* input) { |
| 40 | if (input->opcode() != IrOpcode::kLoad || |
| 41 | !selector()->CanCover(node, input)) { |
| 42 | return false; |
| 43 | } |
| 44 | MachineRepresentation rep = |
| 45 | LoadRepresentationOf(input->op()).representation(); |
| 46 | switch (opcode) { |
| 47 | case kX64Cmp: |
| 48 | case kX64Test: |
| 49 | return rep == MachineRepresentation::kWord64 || |
| 50 | rep == MachineRepresentation::kTagged; |
| 51 | case kX64Cmp32: |
| 52 | case kX64Test32: |
| 53 | return rep == MachineRepresentation::kWord32; |
| 54 | case kX64Cmp16: |
| 55 | case kX64Test16: |
| 56 | return rep == MachineRepresentation::kWord16; |
| 57 | case kX64Cmp8: |
| 58 | case kX64Test8: |
| 59 | return rep == MachineRepresentation::kWord8; |
| 60 | default: |
| 61 | break; |
| 62 | } |
| 63 | return false; |
| 64 | } |
| 65 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 66 | AddressingMode GenerateMemoryOperandInputs(Node* index, int scale_exponent, |
| 67 | Node* base, Node* displacement, |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 68 | InstructionOperand inputs[], |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 69 | size_t* input_count) { |
| 70 | AddressingMode mode = kMode_MRI; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 71 | if (base != nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 72 | inputs[(*input_count)++] = UseRegister(base); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 73 | if (index != nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 74 | DCHECK(scale_exponent >= 0 && scale_exponent <= 3); |
| 75 | inputs[(*input_count)++] = UseRegister(index); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 76 | if (displacement != nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 77 | inputs[(*input_count)++] = UseImmediate(displacement); |
| 78 | static const AddressingMode kMRnI_modes[] = {kMode_MR1I, kMode_MR2I, |
| 79 | kMode_MR4I, kMode_MR8I}; |
| 80 | mode = kMRnI_modes[scale_exponent]; |
| 81 | } else { |
| 82 | static const AddressingMode kMRn_modes[] = {kMode_MR1, kMode_MR2, |
| 83 | kMode_MR4, kMode_MR8}; |
| 84 | mode = kMRn_modes[scale_exponent]; |
| 85 | } |
| 86 | } else { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 87 | if (displacement == nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 88 | mode = kMode_MR; |
| 89 | } else { |
| 90 | inputs[(*input_count)++] = UseImmediate(displacement); |
| 91 | mode = kMode_MRI; |
| 92 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 93 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 94 | } else { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 95 | DCHECK_NOT_NULL(index); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 96 | DCHECK(scale_exponent >= 0 && scale_exponent <= 3); |
| 97 | inputs[(*input_count)++] = UseRegister(index); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 98 | if (displacement != nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 99 | inputs[(*input_count)++] = UseImmediate(displacement); |
| 100 | static const AddressingMode kMnI_modes[] = {kMode_MRI, kMode_M2I, |
| 101 | kMode_M4I, kMode_M8I}; |
| 102 | mode = kMnI_modes[scale_exponent]; |
| 103 | } else { |
| 104 | static const AddressingMode kMn_modes[] = {kMode_MR, kMode_MR1, |
| 105 | kMode_M4, kMode_M8}; |
| 106 | mode = kMn_modes[scale_exponent]; |
| 107 | if (mode == kMode_MR1) { |
| 108 | // [%r1 + %r1*1] has a smaller encoding than [%r1*2+0] |
| 109 | inputs[(*input_count)++] = UseRegister(index); |
| 110 | } |
| 111 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 112 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 113 | return mode; |
| 114 | } |
| 115 | |
| 116 | AddressingMode GetEffectiveAddressMemoryOperand(Node* operand, |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 117 | InstructionOperand inputs[], |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 118 | size_t* input_count) { |
| 119 | BaseWithIndexAndDisplacement64Matcher m(operand, true); |
| 120 | DCHECK(m.matches()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 121 | if ((m.displacement() == nullptr || CanBeImmediate(m.displacement()))) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 122 | return GenerateMemoryOperandInputs(m.index(), m.scale(), m.base(), |
| 123 | m.displacement(), inputs, input_count); |
| 124 | } else { |
| 125 | inputs[(*input_count)++] = UseRegister(operand->InputAt(0)); |
| 126 | inputs[(*input_count)++] = UseRegister(operand->InputAt(1)); |
| 127 | return kMode_MR1; |
| 128 | } |
| 129 | } |
| 130 | |
| 131 | bool CanBeBetterLeftOperand(Node* node) const { |
| 132 | return !selector()->IsLive(node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 133 | } |
| 134 | }; |
| 135 | |
| 136 | |
| 137 | void InstructionSelector::VisitLoad(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 138 | LoadRepresentation load_rep = LoadRepresentationOf(node->op()); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 139 | X64OperandGenerator g(this); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 140 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 141 | ArchOpcode opcode = kArchNop; |
| 142 | switch (load_rep.representation()) { |
| 143 | case MachineRepresentation::kFloat32: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 144 | opcode = kX64Movss; |
| 145 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 146 | case MachineRepresentation::kFloat64: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 147 | opcode = kX64Movsd; |
| 148 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 149 | case MachineRepresentation::kBit: // Fall through. |
| 150 | case MachineRepresentation::kWord8: |
| 151 | opcode = load_rep.IsSigned() ? kX64Movsxbl : kX64Movzxbl; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 152 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 153 | case MachineRepresentation::kWord16: |
| 154 | opcode = load_rep.IsSigned() ? kX64Movsxwl : kX64Movzxwl; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 155 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 156 | case MachineRepresentation::kWord32: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 157 | opcode = kX64Movl; |
| 158 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 159 | case MachineRepresentation::kTagged: // Fall through. |
| 160 | case MachineRepresentation::kWord64: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 161 | opcode = kX64Movq; |
| 162 | break; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 163 | case MachineRepresentation::kSimd128: // Fall through. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 164 | case MachineRepresentation::kNone: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 165 | UNREACHABLE(); |
| 166 | return; |
| 167 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 168 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 169 | InstructionOperand outputs[1]; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 170 | outputs[0] = g.DefineAsRegister(node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 171 | InstructionOperand inputs[3]; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 172 | size_t input_count = 0; |
| 173 | AddressingMode mode = |
| 174 | g.GetEffectiveAddressMemoryOperand(node, inputs, &input_count); |
| 175 | InstructionCode code = opcode | AddressingModeField::encode(mode); |
| 176 | Emit(code, 1, outputs, input_count, inputs); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 177 | } |
| 178 | |
| 179 | |
| 180 | void InstructionSelector::VisitStore(Node* node) { |
| 181 | X64OperandGenerator g(this); |
| 182 | Node* base = node->InputAt(0); |
| 183 | Node* index = node->InputAt(1); |
| 184 | Node* value = node->InputAt(2); |
| 185 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 186 | StoreRepresentation store_rep = StoreRepresentationOf(node->op()); |
| 187 | WriteBarrierKind write_barrier_kind = store_rep.write_barrier_kind(); |
| 188 | MachineRepresentation rep = store_rep.representation(); |
| 189 | |
| 190 | if (write_barrier_kind != kNoWriteBarrier) { |
| 191 | DCHECK_EQ(MachineRepresentation::kTagged, rep); |
| 192 | AddressingMode addressing_mode; |
| 193 | InstructionOperand inputs[3]; |
| 194 | size_t input_count = 0; |
| 195 | inputs[input_count++] = g.UseUniqueRegister(base); |
| 196 | if (g.CanBeImmediate(index)) { |
| 197 | inputs[input_count++] = g.UseImmediate(index); |
| 198 | addressing_mode = kMode_MRI; |
| 199 | } else { |
| 200 | inputs[input_count++] = g.UseUniqueRegister(index); |
| 201 | addressing_mode = kMode_MR1; |
| 202 | } |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 203 | inputs[input_count++] = g.UseUniqueRegister(value); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 204 | RecordWriteMode record_write_mode = RecordWriteMode::kValueIsAny; |
| 205 | switch (write_barrier_kind) { |
| 206 | case kNoWriteBarrier: |
| 207 | UNREACHABLE(); |
| 208 | break; |
| 209 | case kMapWriteBarrier: |
| 210 | record_write_mode = RecordWriteMode::kValueIsMap; |
| 211 | break; |
| 212 | case kPointerWriteBarrier: |
| 213 | record_write_mode = RecordWriteMode::kValueIsPointer; |
| 214 | break; |
| 215 | case kFullWriteBarrier: |
| 216 | record_write_mode = RecordWriteMode::kValueIsAny; |
| 217 | break; |
| 218 | } |
| 219 | InstructionOperand temps[] = {g.TempRegister(), g.TempRegister()}; |
| 220 | size_t const temp_count = arraysize(temps); |
| 221 | InstructionCode code = kArchStoreWithWriteBarrier; |
| 222 | code |= AddressingModeField::encode(addressing_mode); |
| 223 | code |= MiscField::encode(static_cast<int>(record_write_mode)); |
| 224 | Emit(code, 0, nullptr, input_count, inputs, temp_count, temps); |
| 225 | } else { |
| 226 | ArchOpcode opcode = kArchNop; |
| 227 | switch (rep) { |
| 228 | case MachineRepresentation::kFloat32: |
| 229 | opcode = kX64Movss; |
| 230 | break; |
| 231 | case MachineRepresentation::kFloat64: |
| 232 | opcode = kX64Movsd; |
| 233 | break; |
| 234 | case MachineRepresentation::kBit: // Fall through. |
| 235 | case MachineRepresentation::kWord8: |
| 236 | opcode = kX64Movb; |
| 237 | break; |
| 238 | case MachineRepresentation::kWord16: |
| 239 | opcode = kX64Movw; |
| 240 | break; |
| 241 | case MachineRepresentation::kWord32: |
| 242 | opcode = kX64Movl; |
| 243 | break; |
| 244 | case MachineRepresentation::kTagged: // Fall through. |
| 245 | case MachineRepresentation::kWord64: |
| 246 | opcode = kX64Movq; |
| 247 | break; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 248 | case MachineRepresentation::kSimd128: // Fall through. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 249 | case MachineRepresentation::kNone: |
| 250 | UNREACHABLE(); |
| 251 | return; |
| 252 | } |
| 253 | InstructionOperand inputs[4]; |
| 254 | size_t input_count = 0; |
| 255 | AddressingMode addressing_mode = |
| 256 | g.GetEffectiveAddressMemoryOperand(node, inputs, &input_count); |
| 257 | InstructionCode code = |
| 258 | opcode | AddressingModeField::encode(addressing_mode); |
| 259 | InstructionOperand value_operand = |
| 260 | g.CanBeImmediate(value) ? g.UseImmediate(value) : g.UseRegister(value); |
| 261 | inputs[input_count++] = value_operand; |
| 262 | Emit(code, 0, static_cast<InstructionOperand*>(nullptr), input_count, |
| 263 | inputs); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 264 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 265 | } |
| 266 | |
| 267 | |
| 268 | void InstructionSelector::VisitCheckedLoad(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 269 | CheckedLoadRepresentation load_rep = CheckedLoadRepresentationOf(node->op()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 270 | X64OperandGenerator g(this); |
| 271 | Node* const buffer = node->InputAt(0); |
| 272 | Node* const offset = node->InputAt(1); |
| 273 | Node* const length = node->InputAt(2); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 274 | ArchOpcode opcode = kArchNop; |
| 275 | switch (load_rep.representation()) { |
| 276 | case MachineRepresentation::kWord8: |
| 277 | opcode = load_rep.IsSigned() ? kCheckedLoadInt8 : kCheckedLoadUint8; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 278 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 279 | case MachineRepresentation::kWord16: |
| 280 | opcode = load_rep.IsSigned() ? kCheckedLoadInt16 : kCheckedLoadUint16; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 281 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 282 | case MachineRepresentation::kWord32: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 283 | opcode = kCheckedLoadWord32; |
| 284 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 285 | case MachineRepresentation::kWord64: |
| 286 | opcode = kCheckedLoadWord64; |
| 287 | break; |
| 288 | case MachineRepresentation::kFloat32: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 289 | opcode = kCheckedLoadFloat32; |
| 290 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 291 | case MachineRepresentation::kFloat64: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 292 | opcode = kCheckedLoadFloat64; |
| 293 | break; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 294 | case MachineRepresentation::kBit: // Fall through. |
| 295 | case MachineRepresentation::kSimd128: // Fall through. |
| 296 | case MachineRepresentation::kTagged: // Fall through. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 297 | case MachineRepresentation::kNone: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 298 | UNREACHABLE(); |
| 299 | return; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 300 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 301 | if (offset->opcode() == IrOpcode::kInt32Add && CanCover(node, offset)) { |
| 302 | Int32Matcher mlength(length); |
| 303 | Int32BinopMatcher moffset(offset); |
| 304 | if (mlength.HasValue() && moffset.right().HasValue() && |
| 305 | moffset.right().Value() >= 0 && |
| 306 | mlength.Value() >= moffset.right().Value()) { |
| 307 | Emit(opcode, g.DefineAsRegister(node), g.UseRegister(buffer), |
| 308 | g.UseRegister(moffset.left().node()), |
| 309 | g.UseImmediate(moffset.right().node()), g.UseImmediate(length)); |
| 310 | return; |
| 311 | } |
| 312 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 313 | InstructionOperand length_operand = |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 314 | g.CanBeImmediate(length) ? g.UseImmediate(length) : g.UseRegister(length); |
| 315 | Emit(opcode, g.DefineAsRegister(node), g.UseRegister(buffer), |
| 316 | g.UseRegister(offset), g.TempImmediate(0), length_operand); |
| 317 | } |
| 318 | |
| 319 | |
| 320 | void InstructionSelector::VisitCheckedStore(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 321 | MachineRepresentation rep = CheckedStoreRepresentationOf(node->op()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 322 | X64OperandGenerator g(this); |
| 323 | Node* const buffer = node->InputAt(0); |
| 324 | Node* const offset = node->InputAt(1); |
| 325 | Node* const length = node->InputAt(2); |
| 326 | Node* const value = node->InputAt(3); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 327 | ArchOpcode opcode = kArchNop; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 328 | switch (rep) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 329 | case MachineRepresentation::kWord8: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 330 | opcode = kCheckedStoreWord8; |
| 331 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 332 | case MachineRepresentation::kWord16: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 333 | opcode = kCheckedStoreWord16; |
| 334 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 335 | case MachineRepresentation::kWord32: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 336 | opcode = kCheckedStoreWord32; |
| 337 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 338 | case MachineRepresentation::kWord64: |
| 339 | opcode = kCheckedStoreWord64; |
| 340 | break; |
| 341 | case MachineRepresentation::kFloat32: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 342 | opcode = kCheckedStoreFloat32; |
| 343 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 344 | case MachineRepresentation::kFloat64: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 345 | opcode = kCheckedStoreFloat64; |
| 346 | break; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 347 | case MachineRepresentation::kBit: // Fall through. |
| 348 | case MachineRepresentation::kSimd128: // Fall through. |
| 349 | case MachineRepresentation::kTagged: // Fall through. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 350 | case MachineRepresentation::kNone: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 351 | UNREACHABLE(); |
| 352 | return; |
| 353 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 354 | InstructionOperand value_operand = |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 355 | g.CanBeImmediate(value) ? g.UseImmediate(value) : g.UseRegister(value); |
| 356 | if (offset->opcode() == IrOpcode::kInt32Add && CanCover(node, offset)) { |
| 357 | Int32Matcher mlength(length); |
| 358 | Int32BinopMatcher moffset(offset); |
| 359 | if (mlength.HasValue() && moffset.right().HasValue() && |
| 360 | moffset.right().Value() >= 0 && |
| 361 | mlength.Value() >= moffset.right().Value()) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 362 | Emit(opcode, g.NoOutput(), g.UseRegister(buffer), |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 363 | g.UseRegister(moffset.left().node()), |
| 364 | g.UseImmediate(moffset.right().node()), g.UseImmediate(length), |
| 365 | value_operand); |
| 366 | return; |
| 367 | } |
| 368 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 369 | InstructionOperand length_operand = |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 370 | g.CanBeImmediate(length) ? g.UseImmediate(length) : g.UseRegister(length); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 371 | Emit(opcode, g.NoOutput(), g.UseRegister(buffer), g.UseRegister(offset), |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 372 | g.TempImmediate(0), length_operand, value_operand); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 373 | } |
| 374 | |
| 375 | |
| 376 | // Shared routine for multiple binary operations. |
| 377 | static void VisitBinop(InstructionSelector* selector, Node* node, |
| 378 | InstructionCode opcode, FlagsContinuation* cont) { |
| 379 | X64OperandGenerator g(selector); |
| 380 | Int32BinopMatcher m(node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 381 | Node* left = m.left().node(); |
| 382 | Node* right = m.right().node(); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 383 | InstructionOperand inputs[4]; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 384 | size_t input_count = 0; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 385 | InstructionOperand outputs[2]; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 386 | size_t output_count = 0; |
| 387 | |
| 388 | // TODO(turbofan): match complex addressing modes. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 389 | if (left == right) { |
| 390 | // If both inputs refer to the same operand, enforce allocating a register |
| 391 | // for both of them to ensure that we don't end up generating code like |
| 392 | // this: |
| 393 | // |
| 394 | // mov rax, [rbp-0x10] |
| 395 | // add rax, [rbp-0x10] |
| 396 | // jo label |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 397 | InstructionOperand const input = g.UseRegister(left); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 398 | inputs[input_count++] = input; |
| 399 | inputs[input_count++] = input; |
| 400 | } else if (g.CanBeImmediate(right)) { |
| 401 | inputs[input_count++] = g.UseRegister(left); |
| 402 | inputs[input_count++] = g.UseImmediate(right); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 403 | } else { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 404 | if (node->op()->HasProperty(Operator::kCommutative) && |
| 405 | g.CanBeBetterLeftOperand(right)) { |
| 406 | std::swap(left, right); |
| 407 | } |
| 408 | inputs[input_count++] = g.UseRegister(left); |
| 409 | inputs[input_count++] = g.Use(right); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 410 | } |
| 411 | |
| 412 | if (cont->IsBranch()) { |
| 413 | inputs[input_count++] = g.Label(cont->true_block()); |
| 414 | inputs[input_count++] = g.Label(cont->false_block()); |
| 415 | } |
| 416 | |
| 417 | outputs[output_count++] = g.DefineSameAsFirst(node); |
| 418 | if (cont->IsSet()) { |
| 419 | outputs[output_count++] = g.DefineAsRegister(cont->result()); |
| 420 | } |
| 421 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 422 | DCHECK_NE(0u, input_count); |
| 423 | DCHECK_NE(0u, output_count); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 424 | DCHECK_GE(arraysize(inputs), input_count); |
| 425 | DCHECK_GE(arraysize(outputs), output_count); |
| 426 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 427 | opcode = cont->Encode(opcode); |
| 428 | if (cont->IsDeoptimize()) { |
| 429 | selector->EmitDeoptimize(opcode, output_count, outputs, input_count, inputs, |
| 430 | cont->frame_state()); |
| 431 | } else { |
| 432 | selector->Emit(opcode, output_count, outputs, input_count, inputs); |
| 433 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 434 | } |
| 435 | |
| 436 | |
| 437 | // Shared routine for multiple binary operations. |
| 438 | static void VisitBinop(InstructionSelector* selector, Node* node, |
| 439 | InstructionCode opcode) { |
| 440 | FlagsContinuation cont; |
| 441 | VisitBinop(selector, node, opcode, &cont); |
| 442 | } |
| 443 | |
| 444 | |
| 445 | void InstructionSelector::VisitWord32And(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 446 | X64OperandGenerator g(this); |
| 447 | Uint32BinopMatcher m(node); |
| 448 | if (m.right().Is(0xff)) { |
| 449 | Emit(kX64Movzxbl, g.DefineAsRegister(node), g.Use(m.left().node())); |
| 450 | } else if (m.right().Is(0xffff)) { |
| 451 | Emit(kX64Movzxwl, g.DefineAsRegister(node), g.Use(m.left().node())); |
| 452 | } else { |
| 453 | VisitBinop(this, node, kX64And32); |
| 454 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 455 | } |
| 456 | |
| 457 | |
| 458 | void InstructionSelector::VisitWord64And(Node* node) { |
| 459 | VisitBinop(this, node, kX64And); |
| 460 | } |
| 461 | |
| 462 | |
| 463 | void InstructionSelector::VisitWord32Or(Node* node) { |
| 464 | VisitBinop(this, node, kX64Or32); |
| 465 | } |
| 466 | |
| 467 | |
| 468 | void InstructionSelector::VisitWord64Or(Node* node) { |
| 469 | VisitBinop(this, node, kX64Or); |
| 470 | } |
| 471 | |
| 472 | |
| 473 | void InstructionSelector::VisitWord32Xor(Node* node) { |
| 474 | X64OperandGenerator g(this); |
| 475 | Uint32BinopMatcher m(node); |
| 476 | if (m.right().Is(-1)) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 477 | Emit(kX64Not32, g.DefineSameAsFirst(node), g.UseRegister(m.left().node())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 478 | } else { |
| 479 | VisitBinop(this, node, kX64Xor32); |
| 480 | } |
| 481 | } |
| 482 | |
| 483 | |
| 484 | void InstructionSelector::VisitWord64Xor(Node* node) { |
| 485 | X64OperandGenerator g(this); |
| 486 | Uint64BinopMatcher m(node); |
| 487 | if (m.right().Is(-1)) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 488 | Emit(kX64Not, g.DefineSameAsFirst(node), g.UseRegister(m.left().node())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 489 | } else { |
| 490 | VisitBinop(this, node, kX64Xor); |
| 491 | } |
| 492 | } |
| 493 | |
| 494 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 495 | namespace { |
| 496 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 497 | // Shared routine for multiple 32-bit shift operations. |
| 498 | // TODO(bmeurer): Merge this with VisitWord64Shift using template magic? |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 499 | void VisitWord32Shift(InstructionSelector* selector, Node* node, |
| 500 | ArchOpcode opcode) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 501 | X64OperandGenerator g(selector); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 502 | Int32BinopMatcher m(node); |
| 503 | Node* left = m.left().node(); |
| 504 | Node* right = m.right().node(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 505 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 506 | if (g.CanBeImmediate(right)) { |
| 507 | selector->Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(left), |
| 508 | g.UseImmediate(right)); |
| 509 | } else { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 510 | selector->Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(left), |
| 511 | g.UseFixed(right, rcx)); |
| 512 | } |
| 513 | } |
| 514 | |
| 515 | |
| 516 | // Shared routine for multiple 64-bit shift operations. |
| 517 | // TODO(bmeurer): Merge this with VisitWord32Shift using template magic? |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 518 | void VisitWord64Shift(InstructionSelector* selector, Node* node, |
| 519 | ArchOpcode opcode) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 520 | X64OperandGenerator g(selector); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 521 | Int64BinopMatcher m(node); |
| 522 | Node* left = m.left().node(); |
| 523 | Node* right = m.right().node(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 524 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 525 | if (g.CanBeImmediate(right)) { |
| 526 | selector->Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(left), |
| 527 | g.UseImmediate(right)); |
| 528 | } else { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 529 | if (m.right().IsWord64And()) { |
| 530 | Int64BinopMatcher mright(right); |
| 531 | if (mright.right().Is(0x3F)) { |
| 532 | right = mright.left().node(); |
| 533 | } |
| 534 | } |
| 535 | selector->Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(left), |
| 536 | g.UseFixed(right, rcx)); |
| 537 | } |
| 538 | } |
| 539 | |
| 540 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 541 | void EmitLea(InstructionSelector* selector, InstructionCode opcode, |
| 542 | Node* result, Node* index, int scale, Node* base, |
| 543 | Node* displacement) { |
| 544 | X64OperandGenerator g(selector); |
| 545 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 546 | InstructionOperand inputs[4]; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 547 | size_t input_count = 0; |
| 548 | AddressingMode mode = g.GenerateMemoryOperandInputs( |
| 549 | index, scale, base, displacement, inputs, &input_count); |
| 550 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 551 | DCHECK_NE(0u, input_count); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 552 | DCHECK_GE(arraysize(inputs), input_count); |
| 553 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 554 | InstructionOperand outputs[1]; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 555 | outputs[0] = g.DefineAsRegister(result); |
| 556 | |
| 557 | opcode = AddressingModeField::encode(mode) | opcode; |
| 558 | |
| 559 | selector->Emit(opcode, 1, outputs, input_count, inputs); |
| 560 | } |
| 561 | |
| 562 | } // namespace |
| 563 | |
| 564 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 565 | void InstructionSelector::VisitWord32Shl(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 566 | Int32ScaleMatcher m(node, true); |
| 567 | if (m.matches()) { |
| 568 | Node* index = node->InputAt(0); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 569 | Node* base = m.power_of_two_plus_one() ? index : nullptr; |
| 570 | EmitLea(this, kX64Lea32, node, index, m.scale(), base, nullptr); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 571 | return; |
| 572 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 573 | VisitWord32Shift(this, node, kX64Shl32); |
| 574 | } |
| 575 | |
| 576 | |
| 577 | void InstructionSelector::VisitWord64Shl(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 578 | X64OperandGenerator g(this); |
| 579 | Int64BinopMatcher m(node); |
| 580 | if ((m.left().IsChangeInt32ToInt64() || m.left().IsChangeUint32ToUint64()) && |
| 581 | m.right().IsInRange(32, 63)) { |
| 582 | // There's no need to sign/zero-extend to 64-bit if we shift out the upper |
| 583 | // 32 bits anyway. |
| 584 | Emit(kX64Shl, g.DefineSameAsFirst(node), |
| 585 | g.UseRegister(m.left().node()->InputAt(0)), |
| 586 | g.UseImmediate(m.right().node())); |
| 587 | return; |
| 588 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 589 | VisitWord64Shift(this, node, kX64Shl); |
| 590 | } |
| 591 | |
| 592 | |
| 593 | void InstructionSelector::VisitWord32Shr(Node* node) { |
| 594 | VisitWord32Shift(this, node, kX64Shr32); |
| 595 | } |
| 596 | |
| 597 | |
| 598 | void InstructionSelector::VisitWord64Shr(Node* node) { |
| 599 | VisitWord64Shift(this, node, kX64Shr); |
| 600 | } |
| 601 | |
| 602 | |
| 603 | void InstructionSelector::VisitWord32Sar(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 604 | X64OperandGenerator g(this); |
| 605 | Int32BinopMatcher m(node); |
| 606 | if (CanCover(m.node(), m.left().node()) && m.left().IsWord32Shl()) { |
| 607 | Int32BinopMatcher mleft(m.left().node()); |
| 608 | if (mleft.right().Is(16) && m.right().Is(16)) { |
| 609 | Emit(kX64Movsxwl, g.DefineAsRegister(node), g.Use(mleft.left().node())); |
| 610 | return; |
| 611 | } else if (mleft.right().Is(24) && m.right().Is(24)) { |
| 612 | Emit(kX64Movsxbl, g.DefineAsRegister(node), g.Use(mleft.left().node())); |
| 613 | return; |
| 614 | } |
| 615 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 616 | VisitWord32Shift(this, node, kX64Sar32); |
| 617 | } |
| 618 | |
| 619 | |
| 620 | void InstructionSelector::VisitWord64Sar(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 621 | X64OperandGenerator g(this); |
| 622 | Int64BinopMatcher m(node); |
| 623 | if (CanCover(m.node(), m.left().node()) && m.left().IsLoad() && |
| 624 | m.right().Is(32)) { |
| 625 | // Just load and sign-extend the interesting 4 bytes instead. This happens, |
| 626 | // for example, when we're loading and untagging SMIs. |
| 627 | BaseWithIndexAndDisplacement64Matcher mleft(m.left().node(), true); |
| 628 | if (mleft.matches() && (mleft.displacement() == nullptr || |
| 629 | g.CanBeImmediate(mleft.displacement()))) { |
| 630 | size_t input_count = 0; |
| 631 | InstructionOperand inputs[3]; |
| 632 | AddressingMode mode = g.GetEffectiveAddressMemoryOperand( |
| 633 | m.left().node(), inputs, &input_count); |
| 634 | if (mleft.displacement() == nullptr) { |
| 635 | // Make sure that the addressing mode indicates the presence of an |
| 636 | // immediate displacement. It seems that we never use M1 and M2, but we |
| 637 | // handle them here anyways. |
| 638 | switch (mode) { |
| 639 | case kMode_MR: |
| 640 | mode = kMode_MRI; |
| 641 | break; |
| 642 | case kMode_MR1: |
| 643 | mode = kMode_MR1I; |
| 644 | break; |
| 645 | case kMode_MR2: |
| 646 | mode = kMode_MR2I; |
| 647 | break; |
| 648 | case kMode_MR4: |
| 649 | mode = kMode_MR4I; |
| 650 | break; |
| 651 | case kMode_MR8: |
| 652 | mode = kMode_MR8I; |
| 653 | break; |
| 654 | case kMode_M1: |
| 655 | mode = kMode_M1I; |
| 656 | break; |
| 657 | case kMode_M2: |
| 658 | mode = kMode_M2I; |
| 659 | break; |
| 660 | case kMode_M4: |
| 661 | mode = kMode_M4I; |
| 662 | break; |
| 663 | case kMode_M8: |
| 664 | mode = kMode_M8I; |
| 665 | break; |
| 666 | case kMode_None: |
| 667 | case kMode_MRI: |
| 668 | case kMode_MR1I: |
| 669 | case kMode_MR2I: |
| 670 | case kMode_MR4I: |
| 671 | case kMode_MR8I: |
| 672 | case kMode_M1I: |
| 673 | case kMode_M2I: |
| 674 | case kMode_M4I: |
| 675 | case kMode_M8I: |
| 676 | UNREACHABLE(); |
| 677 | } |
| 678 | inputs[input_count++] = ImmediateOperand(ImmediateOperand::INLINE, 4); |
| 679 | } else { |
| 680 | ImmediateOperand* op = ImmediateOperand::cast(&inputs[input_count - 1]); |
| 681 | int32_t displacement = sequence()->GetImmediate(op).ToInt32(); |
| 682 | *op = ImmediateOperand(ImmediateOperand::INLINE, displacement + 4); |
| 683 | } |
| 684 | InstructionOperand outputs[] = {g.DefineAsRegister(node)}; |
| 685 | InstructionCode code = kX64Movsxlq | AddressingModeField::encode(mode); |
| 686 | Emit(code, 1, outputs, input_count, inputs); |
| 687 | return; |
| 688 | } |
| 689 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 690 | VisitWord64Shift(this, node, kX64Sar); |
| 691 | } |
| 692 | |
| 693 | |
| 694 | void InstructionSelector::VisitWord32Ror(Node* node) { |
| 695 | VisitWord32Shift(this, node, kX64Ror32); |
| 696 | } |
| 697 | |
| 698 | |
| 699 | void InstructionSelector::VisitWord64Ror(Node* node) { |
| 700 | VisitWord64Shift(this, node, kX64Ror); |
| 701 | } |
| 702 | |
| 703 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 704 | void InstructionSelector::VisitWord64Clz(Node* node) { |
| 705 | X64OperandGenerator g(this); |
| 706 | Emit(kX64Lzcnt, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 707 | } |
| 708 | |
| 709 | |
| 710 | void InstructionSelector::VisitWord32Clz(Node* node) { |
| 711 | X64OperandGenerator g(this); |
| 712 | Emit(kX64Lzcnt32, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 713 | } |
| 714 | |
| 715 | |
| 716 | void InstructionSelector::VisitWord64Ctz(Node* node) { |
| 717 | X64OperandGenerator g(this); |
| 718 | Emit(kX64Tzcnt, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 719 | } |
| 720 | |
| 721 | |
| 722 | void InstructionSelector::VisitWord32Ctz(Node* node) { |
| 723 | X64OperandGenerator g(this); |
| 724 | Emit(kX64Tzcnt32, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 725 | } |
| 726 | |
| 727 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 728 | void InstructionSelector::VisitWord32ReverseBits(Node* node) { UNREACHABLE(); } |
| 729 | |
| 730 | |
| 731 | void InstructionSelector::VisitWord64ReverseBits(Node* node) { UNREACHABLE(); } |
| 732 | |
| 733 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 734 | void InstructionSelector::VisitWord32Popcnt(Node* node) { |
| 735 | X64OperandGenerator g(this); |
| 736 | Emit(kX64Popcnt32, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 737 | } |
| 738 | |
| 739 | |
| 740 | void InstructionSelector::VisitWord64Popcnt(Node* node) { |
| 741 | X64OperandGenerator g(this); |
| 742 | Emit(kX64Popcnt, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 743 | } |
| 744 | |
| 745 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 746 | void InstructionSelector::VisitInt32Add(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 747 | X64OperandGenerator g(this); |
| 748 | |
| 749 | // Try to match the Add to a leal pattern |
| 750 | BaseWithIndexAndDisplacement32Matcher m(node); |
| 751 | if (m.matches() && |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 752 | (m.displacement() == nullptr || g.CanBeImmediate(m.displacement()))) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 753 | EmitLea(this, kX64Lea32, node, m.index(), m.scale(), m.base(), |
| 754 | m.displacement()); |
| 755 | return; |
| 756 | } |
| 757 | |
| 758 | // No leal pattern match, use addl |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 759 | VisitBinop(this, node, kX64Add32); |
| 760 | } |
| 761 | |
| 762 | |
| 763 | void InstructionSelector::VisitInt64Add(Node* node) { |
| 764 | VisitBinop(this, node, kX64Add); |
| 765 | } |
| 766 | |
| 767 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 768 | void InstructionSelector::VisitInt64AddWithOverflow(Node* node) { |
| 769 | if (Node* ovf = NodeProperties::FindProjection(node, 1)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 770 | FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); |
| 771 | return VisitBinop(this, node, kX64Add, &cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 772 | } |
| 773 | FlagsContinuation cont; |
| 774 | VisitBinop(this, node, kX64Add, &cont); |
| 775 | } |
| 776 | |
| 777 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 778 | void InstructionSelector::VisitInt32Sub(Node* node) { |
| 779 | X64OperandGenerator g(this); |
| 780 | Int32BinopMatcher m(node); |
| 781 | if (m.left().Is(0)) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 782 | Emit(kX64Neg32, g.DefineSameAsFirst(node), g.UseRegister(m.right().node())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 783 | } else { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 784 | if (m.right().HasValue() && g.CanBeImmediate(m.right().node())) { |
| 785 | // Turn subtractions of constant values into immediate "leal" instructions |
| 786 | // by negating the value. |
| 787 | Emit(kX64Lea32 | AddressingModeField::encode(kMode_MRI), |
| 788 | g.DefineAsRegister(node), g.UseRegister(m.left().node()), |
| 789 | g.TempImmediate(-m.right().Value())); |
| 790 | return; |
| 791 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 792 | VisitBinop(this, node, kX64Sub32); |
| 793 | } |
| 794 | } |
| 795 | |
| 796 | |
| 797 | void InstructionSelector::VisitInt64Sub(Node* node) { |
| 798 | X64OperandGenerator g(this); |
| 799 | Int64BinopMatcher m(node); |
| 800 | if (m.left().Is(0)) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 801 | Emit(kX64Neg, g.DefineSameAsFirst(node), g.UseRegister(m.right().node())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 802 | } else { |
| 803 | VisitBinop(this, node, kX64Sub); |
| 804 | } |
| 805 | } |
| 806 | |
| 807 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 808 | void InstructionSelector::VisitInt64SubWithOverflow(Node* node) { |
| 809 | if (Node* ovf = NodeProperties::FindProjection(node, 1)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 810 | FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 811 | return VisitBinop(this, node, kX64Sub, &cont); |
| 812 | } |
| 813 | FlagsContinuation cont; |
| 814 | VisitBinop(this, node, kX64Sub, &cont); |
| 815 | } |
| 816 | |
| 817 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 818 | namespace { |
| 819 | |
| 820 | void VisitMul(InstructionSelector* selector, Node* node, ArchOpcode opcode) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 821 | X64OperandGenerator g(selector); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 822 | Int32BinopMatcher m(node); |
| 823 | Node* left = m.left().node(); |
| 824 | Node* right = m.right().node(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 825 | if (g.CanBeImmediate(right)) { |
| 826 | selector->Emit(opcode, g.DefineAsRegister(node), g.Use(left), |
| 827 | g.UseImmediate(right)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 828 | } else { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 829 | if (g.CanBeBetterLeftOperand(right)) { |
| 830 | std::swap(left, right); |
| 831 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 832 | selector->Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(left), |
| 833 | g.Use(right)); |
| 834 | } |
| 835 | } |
| 836 | |
| 837 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 838 | void VisitMulHigh(InstructionSelector* selector, Node* node, |
| 839 | ArchOpcode opcode) { |
| 840 | X64OperandGenerator g(selector); |
| 841 | Node* left = node->InputAt(0); |
| 842 | Node* right = node->InputAt(1); |
| 843 | if (selector->IsLive(left) && !selector->IsLive(right)) { |
| 844 | std::swap(left, right); |
| 845 | } |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 846 | InstructionOperand temps[] = {g.TempRegister(rax)}; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 847 | // TODO(turbofan): We use UseUniqueRegister here to improve register |
| 848 | // allocation. |
| 849 | selector->Emit(opcode, g.DefineAsFixed(node, rdx), g.UseFixed(left, rax), |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 850 | g.UseUniqueRegister(right), arraysize(temps), temps); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 851 | } |
| 852 | |
| 853 | |
| 854 | void VisitDiv(InstructionSelector* selector, Node* node, ArchOpcode opcode) { |
| 855 | X64OperandGenerator g(selector); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 856 | InstructionOperand temps[] = {g.TempRegister(rdx)}; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 857 | selector->Emit( |
| 858 | opcode, g.DefineAsFixed(node, rax), g.UseFixed(node->InputAt(0), rax), |
| 859 | g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps); |
| 860 | } |
| 861 | |
| 862 | |
| 863 | void VisitMod(InstructionSelector* selector, Node* node, ArchOpcode opcode) { |
| 864 | X64OperandGenerator g(selector); |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 865 | InstructionOperand temps[] = {g.TempRegister(rax)}; |
| 866 | selector->Emit( |
| 867 | opcode, g.DefineAsFixed(node, rdx), g.UseFixed(node->InputAt(0), rax), |
| 868 | g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 869 | } |
| 870 | |
| 871 | } // namespace |
| 872 | |
| 873 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 874 | void InstructionSelector::VisitInt32Mul(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 875 | Int32ScaleMatcher m(node, true); |
| 876 | if (m.matches()) { |
| 877 | Node* index = node->InputAt(0); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 878 | Node* base = m.power_of_two_plus_one() ? index : nullptr; |
| 879 | EmitLea(this, kX64Lea32, node, index, m.scale(), base, nullptr); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 880 | return; |
| 881 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 882 | VisitMul(this, node, kX64Imul32); |
| 883 | } |
| 884 | |
| 885 | |
| 886 | void InstructionSelector::VisitInt64Mul(Node* node) { |
| 887 | VisitMul(this, node, kX64Imul); |
| 888 | } |
| 889 | |
| 890 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 891 | void InstructionSelector::VisitInt32MulHigh(Node* node) { |
| 892 | VisitMulHigh(this, node, kX64ImulHigh32); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 893 | } |
| 894 | |
| 895 | |
| 896 | void InstructionSelector::VisitInt32Div(Node* node) { |
| 897 | VisitDiv(this, node, kX64Idiv32); |
| 898 | } |
| 899 | |
| 900 | |
| 901 | void InstructionSelector::VisitInt64Div(Node* node) { |
| 902 | VisitDiv(this, node, kX64Idiv); |
| 903 | } |
| 904 | |
| 905 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 906 | void InstructionSelector::VisitUint32Div(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 907 | VisitDiv(this, node, kX64Udiv32); |
| 908 | } |
| 909 | |
| 910 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 911 | void InstructionSelector::VisitUint64Div(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 912 | VisitDiv(this, node, kX64Udiv); |
| 913 | } |
| 914 | |
| 915 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 916 | void InstructionSelector::VisitInt32Mod(Node* node) { |
| 917 | VisitMod(this, node, kX64Idiv32); |
| 918 | } |
| 919 | |
| 920 | |
| 921 | void InstructionSelector::VisitInt64Mod(Node* node) { |
| 922 | VisitMod(this, node, kX64Idiv); |
| 923 | } |
| 924 | |
| 925 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 926 | void InstructionSelector::VisitUint32Mod(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 927 | VisitMod(this, node, kX64Udiv32); |
| 928 | } |
| 929 | |
| 930 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 931 | void InstructionSelector::VisitUint64Mod(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 932 | VisitMod(this, node, kX64Udiv); |
| 933 | } |
| 934 | |
| 935 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 936 | void InstructionSelector::VisitUint32MulHigh(Node* node) { |
| 937 | VisitMulHigh(this, node, kX64UmulHigh32); |
| 938 | } |
| 939 | |
| 940 | |
| 941 | void InstructionSelector::VisitChangeFloat32ToFloat64(Node* node) { |
| 942 | X64OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 943 | Emit(kSSEFloat32ToFloat64, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 944 | } |
| 945 | |
| 946 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 947 | void InstructionSelector::VisitChangeInt32ToFloat64(Node* node) { |
| 948 | X64OperandGenerator g(this); |
| 949 | Emit(kSSEInt32ToFloat64, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 950 | } |
| 951 | |
| 952 | |
| 953 | void InstructionSelector::VisitChangeUint32ToFloat64(Node* node) { |
| 954 | X64OperandGenerator g(this); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 955 | Emit(kSSEUint32ToFloat64, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 956 | } |
| 957 | |
| 958 | |
| 959 | void InstructionSelector::VisitChangeFloat64ToInt32(Node* node) { |
| 960 | X64OperandGenerator g(this); |
| 961 | Emit(kSSEFloat64ToInt32, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 962 | } |
| 963 | |
| 964 | |
| 965 | void InstructionSelector::VisitChangeFloat64ToUint32(Node* node) { |
| 966 | X64OperandGenerator g(this); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 967 | Emit(kSSEFloat64ToUint32 | MiscField::encode(1), g.DefineAsRegister(node), |
| 968 | g.Use(node->InputAt(0))); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 969 | } |
| 970 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 971 | void InstructionSelector::VisitTruncateFloat64ToUint32(Node* node) { |
| 972 | X64OperandGenerator g(this); |
| 973 | Emit(kSSEFloat64ToUint32 | MiscField::encode(0), g.DefineAsRegister(node), |
| 974 | g.Use(node->InputAt(0))); |
| 975 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 976 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 977 | void InstructionSelector::VisitTruncateFloat32ToInt32(Node* node) { |
| 978 | X64OperandGenerator g(this); |
| 979 | Emit(kSSEFloat32ToInt32, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 980 | } |
| 981 | |
| 982 | |
| 983 | void InstructionSelector::VisitTruncateFloat32ToUint32(Node* node) { |
| 984 | X64OperandGenerator g(this); |
| 985 | Emit(kSSEFloat32ToUint32, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 986 | } |
| 987 | |
| 988 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 989 | void InstructionSelector::VisitTryTruncateFloat32ToInt64(Node* node) { |
| 990 | X64OperandGenerator g(this); |
| 991 | InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; |
| 992 | InstructionOperand outputs[2]; |
| 993 | size_t output_count = 0; |
| 994 | outputs[output_count++] = g.DefineAsRegister(node); |
| 995 | |
| 996 | Node* success_output = NodeProperties::FindProjection(node, 1); |
| 997 | if (success_output) { |
| 998 | outputs[output_count++] = g.DefineAsRegister(success_output); |
| 999 | } |
| 1000 | |
| 1001 | Emit(kSSEFloat32ToInt64, output_count, outputs, 1, inputs); |
| 1002 | } |
| 1003 | |
| 1004 | |
| 1005 | void InstructionSelector::VisitTryTruncateFloat64ToInt64(Node* node) { |
| 1006 | X64OperandGenerator g(this); |
| 1007 | InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; |
| 1008 | InstructionOperand outputs[2]; |
| 1009 | size_t output_count = 0; |
| 1010 | outputs[output_count++] = g.DefineAsRegister(node); |
| 1011 | |
| 1012 | Node* success_output = NodeProperties::FindProjection(node, 1); |
| 1013 | if (success_output) { |
| 1014 | outputs[output_count++] = g.DefineAsRegister(success_output); |
| 1015 | } |
| 1016 | |
| 1017 | Emit(kSSEFloat64ToInt64, output_count, outputs, 1, inputs); |
| 1018 | } |
| 1019 | |
| 1020 | |
| 1021 | void InstructionSelector::VisitTryTruncateFloat32ToUint64(Node* node) { |
| 1022 | X64OperandGenerator g(this); |
| 1023 | InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; |
| 1024 | InstructionOperand outputs[2]; |
| 1025 | size_t output_count = 0; |
| 1026 | outputs[output_count++] = g.DefineAsRegister(node); |
| 1027 | |
| 1028 | Node* success_output = NodeProperties::FindProjection(node, 1); |
| 1029 | if (success_output) { |
| 1030 | outputs[output_count++] = g.DefineAsRegister(success_output); |
| 1031 | } |
| 1032 | |
| 1033 | Emit(kSSEFloat32ToUint64, output_count, outputs, 1, inputs); |
| 1034 | } |
| 1035 | |
| 1036 | |
| 1037 | void InstructionSelector::VisitTryTruncateFloat64ToUint64(Node* node) { |
| 1038 | X64OperandGenerator g(this); |
| 1039 | InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; |
| 1040 | InstructionOperand outputs[2]; |
| 1041 | size_t output_count = 0; |
| 1042 | outputs[output_count++] = g.DefineAsRegister(node); |
| 1043 | |
| 1044 | Node* success_output = NodeProperties::FindProjection(node, 1); |
| 1045 | if (success_output) { |
| 1046 | outputs[output_count++] = g.DefineAsRegister(success_output); |
| 1047 | } |
| 1048 | |
| 1049 | Emit(kSSEFloat64ToUint64, output_count, outputs, 1, inputs); |
| 1050 | } |
| 1051 | |
| 1052 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1053 | void InstructionSelector::VisitChangeInt32ToInt64(Node* node) { |
| 1054 | X64OperandGenerator g(this); |
| 1055 | Emit(kX64Movsxlq, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 1056 | } |
| 1057 | |
| 1058 | |
| 1059 | void InstructionSelector::VisitChangeUint32ToUint64(Node* node) { |
| 1060 | X64OperandGenerator g(this); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1061 | Node* value = node->InputAt(0); |
| 1062 | switch (value->opcode()) { |
| 1063 | case IrOpcode::kWord32And: |
| 1064 | case IrOpcode::kWord32Or: |
| 1065 | case IrOpcode::kWord32Xor: |
| 1066 | case IrOpcode::kWord32Shl: |
| 1067 | case IrOpcode::kWord32Shr: |
| 1068 | case IrOpcode::kWord32Sar: |
| 1069 | case IrOpcode::kWord32Ror: |
| 1070 | case IrOpcode::kWord32Equal: |
| 1071 | case IrOpcode::kInt32Add: |
| 1072 | case IrOpcode::kInt32Sub: |
| 1073 | case IrOpcode::kInt32Mul: |
| 1074 | case IrOpcode::kInt32MulHigh: |
| 1075 | case IrOpcode::kInt32Div: |
| 1076 | case IrOpcode::kInt32LessThan: |
| 1077 | case IrOpcode::kInt32LessThanOrEqual: |
| 1078 | case IrOpcode::kInt32Mod: |
| 1079 | case IrOpcode::kUint32Div: |
| 1080 | case IrOpcode::kUint32LessThan: |
| 1081 | case IrOpcode::kUint32LessThanOrEqual: |
| 1082 | case IrOpcode::kUint32Mod: |
| 1083 | case IrOpcode::kUint32MulHigh: { |
| 1084 | // These 32-bit operations implicitly zero-extend to 64-bit on x64, so the |
| 1085 | // zero-extension is a no-op. |
| 1086 | Emit(kArchNop, g.DefineSameAsFirst(node), g.Use(value)); |
| 1087 | return; |
| 1088 | } |
| 1089 | default: |
| 1090 | break; |
| 1091 | } |
| 1092 | Emit(kX64Movl, g.DefineAsRegister(node), g.Use(value)); |
| 1093 | } |
| 1094 | |
| 1095 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1096 | namespace { |
| 1097 | |
| 1098 | void VisitRO(InstructionSelector* selector, Node* node, |
| 1099 | InstructionCode opcode) { |
| 1100 | X64OperandGenerator g(selector); |
| 1101 | selector->Emit(opcode, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 1102 | } |
| 1103 | |
| 1104 | |
| 1105 | void VisitRR(InstructionSelector* selector, Node* node, |
| 1106 | InstructionCode opcode) { |
| 1107 | X64OperandGenerator g(selector); |
| 1108 | selector->Emit(opcode, g.DefineAsRegister(node), |
| 1109 | g.UseRegister(node->InputAt(0))); |
| 1110 | } |
| 1111 | |
| 1112 | |
| 1113 | void VisitFloatBinop(InstructionSelector* selector, Node* node, |
| 1114 | ArchOpcode avx_opcode, ArchOpcode sse_opcode) { |
| 1115 | X64OperandGenerator g(selector); |
| 1116 | InstructionOperand operand0 = g.UseRegister(node->InputAt(0)); |
| 1117 | InstructionOperand operand1 = g.Use(node->InputAt(1)); |
| 1118 | if (selector->IsSupported(AVX)) { |
| 1119 | selector->Emit(avx_opcode, g.DefineAsRegister(node), operand0, operand1); |
| 1120 | } else { |
| 1121 | selector->Emit(sse_opcode, g.DefineSameAsFirst(node), operand0, operand1); |
| 1122 | } |
| 1123 | } |
| 1124 | |
| 1125 | |
| 1126 | void VisitFloatUnop(InstructionSelector* selector, Node* node, Node* input, |
| 1127 | ArchOpcode avx_opcode, ArchOpcode sse_opcode) { |
| 1128 | X64OperandGenerator g(selector); |
| 1129 | if (selector->IsSupported(AVX)) { |
| 1130 | selector->Emit(avx_opcode, g.DefineAsRegister(node), g.Use(input)); |
| 1131 | } else { |
| 1132 | selector->Emit(sse_opcode, g.DefineSameAsFirst(node), g.UseRegister(input)); |
| 1133 | } |
| 1134 | } |
| 1135 | |
| 1136 | } // namespace |
| 1137 | |
| 1138 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1139 | void InstructionSelector::VisitTruncateFloat64ToFloat32(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1140 | VisitRO(this, node, kSSEFloat64ToFloat32); |
| 1141 | } |
| 1142 | |
| 1143 | |
| 1144 | void InstructionSelector::VisitTruncateFloat64ToInt32(Node* node) { |
| 1145 | switch (TruncationModeOf(node->op())) { |
| 1146 | case TruncationMode::kJavaScript: |
| 1147 | return VisitRR(this, node, kArchTruncateDoubleToI); |
| 1148 | case TruncationMode::kRoundToZero: |
| 1149 | return VisitRO(this, node, kSSEFloat64ToInt32); |
| 1150 | } |
| 1151 | UNREACHABLE(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1152 | } |
| 1153 | |
| 1154 | |
| 1155 | void InstructionSelector::VisitTruncateInt64ToInt32(Node* node) { |
| 1156 | X64OperandGenerator g(this); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1157 | Node* value = node->InputAt(0); |
| 1158 | if (CanCover(node, value)) { |
| 1159 | switch (value->opcode()) { |
| 1160 | case IrOpcode::kWord64Sar: |
| 1161 | case IrOpcode::kWord64Shr: { |
| 1162 | Int64BinopMatcher m(value); |
| 1163 | if (m.right().Is(32)) { |
| 1164 | Emit(kX64Shr, g.DefineSameAsFirst(node), |
| 1165 | g.UseRegister(m.left().node()), g.TempImmediate(32)); |
| 1166 | return; |
| 1167 | } |
| 1168 | break; |
| 1169 | } |
| 1170 | default: |
| 1171 | break; |
| 1172 | } |
| 1173 | } |
| 1174 | Emit(kX64Movl, g.DefineAsRegister(node), g.Use(value)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1175 | } |
| 1176 | |
| 1177 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1178 | void InstructionSelector::VisitRoundInt32ToFloat32(Node* node) { |
| 1179 | X64OperandGenerator g(this); |
| 1180 | Emit(kSSEInt32ToFloat32, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 1181 | } |
| 1182 | |
| 1183 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1184 | void InstructionSelector::VisitRoundInt64ToFloat32(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1185 | X64OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1186 | Emit(kSSEInt64ToFloat32, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 1187 | } |
| 1188 | |
| 1189 | |
| 1190 | void InstructionSelector::VisitRoundInt64ToFloat64(Node* node) { |
| 1191 | X64OperandGenerator g(this); |
| 1192 | Emit(kSSEInt64ToFloat64, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 1193 | } |
| 1194 | |
| 1195 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1196 | void InstructionSelector::VisitRoundUint32ToFloat32(Node* node) { |
| 1197 | X64OperandGenerator g(this); |
| 1198 | Emit(kSSEUint32ToFloat32, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 1199 | } |
| 1200 | |
| 1201 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1202 | void InstructionSelector::VisitRoundUint64ToFloat32(Node* node) { |
| 1203 | X64OperandGenerator g(this); |
| 1204 | InstructionOperand temps[] = {g.TempRegister()}; |
| 1205 | Emit(kSSEUint64ToFloat32, g.DefineAsRegister(node), g.Use(node->InputAt(0)), |
| 1206 | arraysize(temps), temps); |
| 1207 | } |
| 1208 | |
| 1209 | |
| 1210 | void InstructionSelector::VisitRoundUint64ToFloat64(Node* node) { |
| 1211 | X64OperandGenerator g(this); |
| 1212 | InstructionOperand temps[] = {g.TempRegister()}; |
| 1213 | Emit(kSSEUint64ToFloat64, g.DefineAsRegister(node), g.Use(node->InputAt(0)), |
| 1214 | arraysize(temps), temps); |
| 1215 | } |
| 1216 | |
| 1217 | |
| 1218 | void InstructionSelector::VisitBitcastFloat32ToInt32(Node* node) { |
| 1219 | X64OperandGenerator g(this); |
| 1220 | Emit(kX64BitcastFI, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 1221 | } |
| 1222 | |
| 1223 | |
| 1224 | void InstructionSelector::VisitBitcastFloat64ToInt64(Node* node) { |
| 1225 | X64OperandGenerator g(this); |
| 1226 | Emit(kX64BitcastDL, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 1227 | } |
| 1228 | |
| 1229 | |
| 1230 | void InstructionSelector::VisitBitcastInt32ToFloat32(Node* node) { |
| 1231 | X64OperandGenerator g(this); |
| 1232 | Emit(kX64BitcastIF, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 1233 | } |
| 1234 | |
| 1235 | |
| 1236 | void InstructionSelector::VisitBitcastInt64ToFloat64(Node* node) { |
| 1237 | X64OperandGenerator g(this); |
| 1238 | Emit(kX64BitcastLD, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 1239 | } |
| 1240 | |
| 1241 | |
| 1242 | void InstructionSelector::VisitFloat32Add(Node* node) { |
| 1243 | VisitFloatBinop(this, node, kAVXFloat32Add, kSSEFloat32Add); |
| 1244 | } |
| 1245 | |
| 1246 | |
| 1247 | void InstructionSelector::VisitFloat32Sub(Node* node) { |
| 1248 | X64OperandGenerator g(this); |
| 1249 | Float32BinopMatcher m(node); |
| 1250 | if (m.left().IsMinusZero()) { |
| 1251 | VisitFloatUnop(this, node, m.right().node(), kAVXFloat32Neg, |
| 1252 | kSSEFloat32Neg); |
| 1253 | return; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1254 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1255 | VisitFloatBinop(this, node, kAVXFloat32Sub, kSSEFloat32Sub); |
| 1256 | } |
| 1257 | |
| 1258 | |
| 1259 | void InstructionSelector::VisitFloat32Mul(Node* node) { |
| 1260 | VisitFloatBinop(this, node, kAVXFloat32Mul, kSSEFloat32Mul); |
| 1261 | } |
| 1262 | |
| 1263 | |
| 1264 | void InstructionSelector::VisitFloat32Div(Node* node) { |
| 1265 | VisitFloatBinop(this, node, kAVXFloat32Div, kSSEFloat32Div); |
| 1266 | } |
| 1267 | |
| 1268 | |
| 1269 | void InstructionSelector::VisitFloat32Max(Node* node) { |
| 1270 | VisitFloatBinop(this, node, kAVXFloat32Max, kSSEFloat32Max); |
| 1271 | } |
| 1272 | |
| 1273 | |
| 1274 | void InstructionSelector::VisitFloat32Min(Node* node) { |
| 1275 | VisitFloatBinop(this, node, kAVXFloat32Min, kSSEFloat32Min); |
| 1276 | } |
| 1277 | |
| 1278 | |
| 1279 | void InstructionSelector::VisitFloat32Abs(Node* node) { |
| 1280 | VisitFloatUnop(this, node, node->InputAt(0), kAVXFloat32Abs, kSSEFloat32Abs); |
| 1281 | } |
| 1282 | |
| 1283 | |
| 1284 | void InstructionSelector::VisitFloat32Sqrt(Node* node) { |
| 1285 | VisitRO(this, node, kSSEFloat32Sqrt); |
| 1286 | } |
| 1287 | |
| 1288 | |
| 1289 | void InstructionSelector::VisitFloat64Add(Node* node) { |
| 1290 | VisitFloatBinop(this, node, kAVXFloat64Add, kSSEFloat64Add); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1291 | } |
| 1292 | |
| 1293 | |
| 1294 | void InstructionSelector::VisitFloat64Sub(Node* node) { |
| 1295 | X64OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1296 | Float64BinopMatcher m(node); |
| 1297 | if (m.left().IsMinusZero()) { |
| 1298 | if (m.right().IsFloat64RoundDown() && |
| 1299 | CanCover(m.node(), m.right().node())) { |
| 1300 | if (m.right().InputAt(0)->opcode() == IrOpcode::kFloat64Sub && |
| 1301 | CanCover(m.right().node(), m.right().InputAt(0))) { |
| 1302 | Float64BinopMatcher mright0(m.right().InputAt(0)); |
| 1303 | if (mright0.left().IsMinusZero()) { |
| 1304 | Emit(kSSEFloat64Round | MiscField::encode(kRoundUp), |
| 1305 | g.DefineAsRegister(node), g.UseRegister(mright0.right().node())); |
| 1306 | return; |
| 1307 | } |
| 1308 | } |
| 1309 | } |
| 1310 | VisitFloatUnop(this, node, m.right().node(), kAVXFloat64Neg, |
| 1311 | kSSEFloat64Neg); |
| 1312 | return; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1313 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1314 | VisitFloatBinop(this, node, kAVXFloat64Sub, kSSEFloat64Sub); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1315 | } |
| 1316 | |
| 1317 | |
| 1318 | void InstructionSelector::VisitFloat64Mul(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1319 | VisitFloatBinop(this, node, kAVXFloat64Mul, kSSEFloat64Mul); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1320 | } |
| 1321 | |
| 1322 | |
| 1323 | void InstructionSelector::VisitFloat64Div(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1324 | VisitFloatBinop(this, node, kAVXFloat64Div, kSSEFloat64Div); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1325 | } |
| 1326 | |
| 1327 | |
| 1328 | void InstructionSelector::VisitFloat64Mod(Node* node) { |
| 1329 | X64OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1330 | InstructionOperand temps[] = {g.TempRegister(rax)}; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1331 | Emit(kSSEFloat64Mod, g.DefineSameAsFirst(node), |
| 1332 | g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)), 1, |
| 1333 | temps); |
| 1334 | } |
| 1335 | |
| 1336 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1337 | void InstructionSelector::VisitFloat64Max(Node* node) { |
| 1338 | VisitFloatBinop(this, node, kAVXFloat64Max, kSSEFloat64Max); |
| 1339 | } |
| 1340 | |
| 1341 | |
| 1342 | void InstructionSelector::VisitFloat64Min(Node* node) { |
| 1343 | VisitFloatBinop(this, node, kAVXFloat64Min, kSSEFloat64Min); |
| 1344 | } |
| 1345 | |
| 1346 | |
| 1347 | void InstructionSelector::VisitFloat64Abs(Node* node) { |
| 1348 | VisitFloatUnop(this, node, node->InputAt(0), kAVXFloat64Abs, kSSEFloat64Abs); |
| 1349 | } |
| 1350 | |
| 1351 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1352 | void InstructionSelector::VisitFloat64Sqrt(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1353 | VisitRO(this, node, kSSEFloat64Sqrt); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1354 | } |
| 1355 | |
| 1356 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1357 | void InstructionSelector::VisitFloat32RoundDown(Node* node) { |
| 1358 | VisitRR(this, node, kSSEFloat32Round | MiscField::encode(kRoundDown)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1359 | } |
| 1360 | |
| 1361 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1362 | void InstructionSelector::VisitFloat64RoundDown(Node* node) { |
| 1363 | VisitRR(this, node, kSSEFloat64Round | MiscField::encode(kRoundDown)); |
| 1364 | } |
| 1365 | |
| 1366 | |
| 1367 | void InstructionSelector::VisitFloat32RoundUp(Node* node) { |
| 1368 | VisitRR(this, node, kSSEFloat32Round | MiscField::encode(kRoundUp)); |
| 1369 | } |
| 1370 | |
| 1371 | |
| 1372 | void InstructionSelector::VisitFloat64RoundUp(Node* node) { |
| 1373 | VisitRR(this, node, kSSEFloat64Round | MiscField::encode(kRoundUp)); |
| 1374 | } |
| 1375 | |
| 1376 | |
| 1377 | void InstructionSelector::VisitFloat32RoundTruncate(Node* node) { |
| 1378 | VisitRR(this, node, kSSEFloat32Round | MiscField::encode(kRoundToZero)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1379 | } |
| 1380 | |
| 1381 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1382 | void InstructionSelector::VisitFloat64RoundTruncate(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1383 | VisitRR(this, node, kSSEFloat64Round | MiscField::encode(kRoundToZero)); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1384 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1385 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1386 | |
| 1387 | void InstructionSelector::VisitFloat64RoundTiesAway(Node* node) { |
| 1388 | UNREACHABLE(); |
| 1389 | } |
| 1390 | |
| 1391 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1392 | void InstructionSelector::VisitFloat32RoundTiesEven(Node* node) { |
| 1393 | VisitRR(this, node, kSSEFloat32Round | MiscField::encode(kRoundToNearest)); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1394 | } |
| 1395 | |
| 1396 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1397 | void InstructionSelector::VisitFloat64RoundTiesEven(Node* node) { |
| 1398 | VisitRR(this, node, kSSEFloat64Round | MiscField::encode(kRoundToNearest)); |
| 1399 | } |
| 1400 | |
| 1401 | |
| 1402 | void InstructionSelector::EmitPrepareArguments( |
| 1403 | ZoneVector<PushParameter>* arguments, const CallDescriptor* descriptor, |
| 1404 | Node* node) { |
| 1405 | X64OperandGenerator g(this); |
| 1406 | |
| 1407 | // Prepare for C function call. |
| 1408 | if (descriptor->IsCFunctionCall()) { |
| 1409 | Emit(kArchPrepareCallCFunction | |
| 1410 | MiscField::encode(static_cast<int>(descriptor->CParameterCount())), |
| 1411 | 0, nullptr, 0, nullptr); |
| 1412 | |
| 1413 | // Poke any stack arguments. |
| 1414 | for (size_t n = 0; n < arguments->size(); ++n) { |
| 1415 | PushParameter input = (*arguments)[n]; |
| 1416 | if (input.node()) { |
| 1417 | int slot = static_cast<int>(n); |
| 1418 | InstructionOperand value = g.CanBeImmediate(input.node()) |
| 1419 | ? g.UseImmediate(input.node()) |
| 1420 | : g.UseRegister(input.node()); |
| 1421 | Emit(kX64Poke | MiscField::encode(slot), g.NoOutput(), value); |
| 1422 | } |
| 1423 | } |
| 1424 | } else { |
| 1425 | // Push any stack arguments. |
| 1426 | for (PushParameter input : base::Reversed(*arguments)) { |
| 1427 | // TODO(titzer): X64Push cannot handle stack->stack double moves |
| 1428 | // because there is no way to encode fixed double slots. |
| 1429 | InstructionOperand value = |
| 1430 | g.CanBeImmediate(input.node()) |
| 1431 | ? g.UseImmediate(input.node()) |
| 1432 | : IsSupported(ATOM) || |
| 1433 | sequence()->IsFloat(GetVirtualRegister(input.node())) |
| 1434 | ? g.UseRegister(input.node()) |
| 1435 | : g.Use(input.node()); |
| 1436 | Emit(kX64Push, g.NoOutput(), value); |
| 1437 | } |
| 1438 | } |
| 1439 | } |
| 1440 | |
| 1441 | |
| 1442 | bool InstructionSelector::IsTailCallAddressImmediate() { return true; } |
| 1443 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1444 | int InstructionSelector::GetTempsCountForTailCallFromJSFunction() { return 3; } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1445 | |
| 1446 | namespace { |
| 1447 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1448 | void VisitCompareWithMemoryOperand(InstructionSelector* selector, |
| 1449 | InstructionCode opcode, Node* left, |
| 1450 | InstructionOperand right, |
| 1451 | FlagsContinuation* cont) { |
| 1452 | DCHECK(left->opcode() == IrOpcode::kLoad); |
| 1453 | X64OperandGenerator g(selector); |
| 1454 | size_t input_count = 0; |
| 1455 | InstructionOperand inputs[6]; |
| 1456 | AddressingMode addressing_mode = |
| 1457 | g.GetEffectiveAddressMemoryOperand(left, inputs, &input_count); |
| 1458 | opcode |= AddressingModeField::encode(addressing_mode); |
| 1459 | opcode = cont->Encode(opcode); |
| 1460 | inputs[input_count++] = right; |
| 1461 | |
| 1462 | if (cont->IsBranch()) { |
| 1463 | inputs[input_count++] = g.Label(cont->true_block()); |
| 1464 | inputs[input_count++] = g.Label(cont->false_block()); |
| 1465 | selector->Emit(opcode, 0, nullptr, input_count, inputs); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1466 | } else if (cont->IsDeoptimize()) { |
| 1467 | selector->EmitDeoptimize(opcode, 0, nullptr, input_count, inputs, |
| 1468 | cont->frame_state()); |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1469 | } else { |
| 1470 | DCHECK(cont->IsSet()); |
| 1471 | InstructionOperand output = g.DefineAsRegister(cont->result()); |
| 1472 | selector->Emit(opcode, 1, &output, input_count, inputs); |
| 1473 | } |
| 1474 | } |
| 1475 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1476 | // Shared routine for multiple compare operations. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1477 | void VisitCompare(InstructionSelector* selector, InstructionCode opcode, |
| 1478 | InstructionOperand left, InstructionOperand right, |
| 1479 | FlagsContinuation* cont) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1480 | X64OperandGenerator g(selector); |
| 1481 | opcode = cont->Encode(opcode); |
| 1482 | if (cont->IsBranch()) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1483 | selector->Emit(opcode, g.NoOutput(), left, right, |
| 1484 | g.Label(cont->true_block()), g.Label(cont->false_block())); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1485 | } else if (cont->IsDeoptimize()) { |
| 1486 | selector->EmitDeoptimize(opcode, g.NoOutput(), left, right, |
| 1487 | cont->frame_state()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1488 | } else { |
| 1489 | DCHECK(cont->IsSet()); |
| 1490 | selector->Emit(opcode, g.DefineAsRegister(cont->result()), left, right); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1491 | } |
| 1492 | } |
| 1493 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1494 | |
| 1495 | // Shared routine for multiple compare operations. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1496 | void VisitCompare(InstructionSelector* selector, InstructionCode opcode, |
| 1497 | Node* left, Node* right, FlagsContinuation* cont, |
| 1498 | bool commutative) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1499 | X64OperandGenerator g(selector); |
| 1500 | if (commutative && g.CanBeBetterLeftOperand(right)) { |
| 1501 | std::swap(left, right); |
| 1502 | } |
| 1503 | VisitCompare(selector, opcode, g.UseRegister(left), g.Use(right), cont); |
| 1504 | } |
| 1505 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1506 | // Tries to match the size of the given opcode to that of the operands, if |
| 1507 | // possible. |
| 1508 | InstructionCode TryNarrowOpcodeSize(InstructionCode opcode, Node* left, |
| 1509 | Node* right) { |
| 1510 | if (opcode != kX64Cmp32 && opcode != kX64Test32) { |
| 1511 | return opcode; |
| 1512 | } |
| 1513 | // Currently, if one of the two operands is not a Load, we don't know what its |
| 1514 | // machine representation is, so we bail out. |
| 1515 | // TODO(epertoso): we can probably get some size information out of immediates |
| 1516 | // and phi nodes. |
| 1517 | if (left->opcode() != IrOpcode::kLoad || right->opcode() != IrOpcode::kLoad) { |
| 1518 | return opcode; |
| 1519 | } |
| 1520 | // If the load representations don't match, both operands will be |
| 1521 | // zero/sign-extended to 32bit. |
| 1522 | LoadRepresentation left_representation = LoadRepresentationOf(left->op()); |
| 1523 | if (left_representation != LoadRepresentationOf(right->op())) { |
| 1524 | return opcode; |
| 1525 | } |
| 1526 | switch (left_representation.representation()) { |
| 1527 | case MachineRepresentation::kBit: |
| 1528 | case MachineRepresentation::kWord8: |
| 1529 | return opcode == kX64Cmp32 ? kX64Cmp8 : kX64Test8; |
| 1530 | case MachineRepresentation::kWord16: |
| 1531 | return opcode == kX64Cmp32 ? kX64Cmp16 : kX64Test16; |
| 1532 | default: |
| 1533 | return opcode; |
| 1534 | } |
| 1535 | } |
| 1536 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1537 | // Shared routine for multiple word compare operations. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1538 | void VisitWordCompare(InstructionSelector* selector, Node* node, |
| 1539 | InstructionCode opcode, FlagsContinuation* cont) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1540 | X64OperandGenerator g(selector); |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1541 | Node* left = node->InputAt(0); |
| 1542 | Node* right = node->InputAt(1); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1543 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1544 | opcode = TryNarrowOpcodeSize(opcode, left, right); |
| 1545 | |
| 1546 | // If one of the two inputs is an immediate, make sure it's on the right, or |
| 1547 | // if one of the two inputs is a memory operand, make sure it's on the left. |
| 1548 | if ((!g.CanBeImmediate(right) && g.CanBeImmediate(left)) || |
| 1549 | (g.CanBeMemoryOperand(opcode, node, right) && |
| 1550 | !g.CanBeMemoryOperand(opcode, node, left))) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1551 | if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute(); |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1552 | std::swap(left, right); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1553 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1554 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1555 | // Match immediates on right side of comparison. |
| 1556 | if (g.CanBeImmediate(right)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1557 | if (g.CanBeMemoryOperand(opcode, node, left)) { |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1558 | return VisitCompareWithMemoryOperand(selector, opcode, left, |
| 1559 | g.UseImmediate(right), cont); |
| 1560 | } |
| 1561 | return VisitCompare(selector, opcode, g.Use(left), g.UseImmediate(right), |
| 1562 | cont); |
| 1563 | } |
| 1564 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1565 | // Match memory operands on left side of comparison. |
| 1566 | if (g.CanBeMemoryOperand(opcode, node, left)) { |
| 1567 | return VisitCompareWithMemoryOperand(selector, opcode, left, |
| 1568 | g.UseRegister(right), cont); |
| 1569 | } |
| 1570 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1571 | if (g.CanBeBetterLeftOperand(right)) { |
| 1572 | if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute(); |
| 1573 | std::swap(left, right); |
| 1574 | } |
| 1575 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1576 | return VisitCompare(selector, opcode, left, right, cont, |
| 1577 | node->op()->HasProperty(Operator::kCommutative)); |
| 1578 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1579 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1580 | // Shared routine for 64-bit word comparison operations. |
| 1581 | void VisitWord64Compare(InstructionSelector* selector, Node* node, |
| 1582 | FlagsContinuation* cont) { |
| 1583 | X64OperandGenerator g(selector); |
| 1584 | Int64BinopMatcher m(node); |
| 1585 | if (m.left().IsLoad() && m.right().IsLoadStackPointer()) { |
| 1586 | LoadMatcher<ExternalReferenceMatcher> mleft(m.left().node()); |
| 1587 | ExternalReference js_stack_limit = |
| 1588 | ExternalReference::address_of_stack_limit(selector->isolate()); |
| 1589 | if (mleft.object().Is(js_stack_limit) && mleft.index().Is(0)) { |
| 1590 | // Compare(Load(js_stack_limit), LoadStackPointer) |
| 1591 | if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute(); |
| 1592 | InstructionCode opcode = cont->Encode(kX64StackCheck); |
| 1593 | if (cont->IsBranch()) { |
| 1594 | selector->Emit(opcode, g.NoOutput(), g.Label(cont->true_block()), |
| 1595 | g.Label(cont->false_block())); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1596 | } else if (cont->IsDeoptimize()) { |
| 1597 | selector->EmitDeoptimize(opcode, 0, nullptr, 0, nullptr, |
| 1598 | cont->frame_state()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1599 | } else { |
| 1600 | DCHECK(cont->IsSet()); |
| 1601 | selector->Emit(opcode, g.DefineAsRegister(cont->result())); |
| 1602 | } |
| 1603 | return; |
| 1604 | } |
| 1605 | } |
| 1606 | VisitWordCompare(selector, node, kX64Cmp, cont); |
| 1607 | } |
| 1608 | |
| 1609 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1610 | // Shared routine for comparison with zero. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1611 | void VisitCompareZero(InstructionSelector* selector, Node* node, |
| 1612 | InstructionCode opcode, FlagsContinuation* cont) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1613 | X64OperandGenerator g(selector); |
| 1614 | VisitCompare(selector, opcode, g.Use(node), g.TempImmediate(0), cont); |
| 1615 | } |
| 1616 | |
| 1617 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1618 | // Shared routine for multiple float32 compare operations (inputs commuted). |
| 1619 | void VisitFloat32Compare(InstructionSelector* selector, Node* node, |
| 1620 | FlagsContinuation* cont) { |
| 1621 | Node* const left = node->InputAt(0); |
| 1622 | Node* const right = node->InputAt(1); |
| 1623 | InstructionCode const opcode = |
| 1624 | selector->IsSupported(AVX) ? kAVXFloat32Cmp : kSSEFloat32Cmp; |
| 1625 | VisitCompare(selector, opcode, right, left, cont, false); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1626 | } |
| 1627 | |
| 1628 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1629 | // Shared routine for multiple float64 compare operations (inputs commuted). |
| 1630 | void VisitFloat64Compare(InstructionSelector* selector, Node* node, |
| 1631 | FlagsContinuation* cont) { |
| 1632 | Node* const left = node->InputAt(0); |
| 1633 | Node* const right = node->InputAt(1); |
| 1634 | InstructionCode const opcode = |
| 1635 | selector->IsSupported(AVX) ? kAVXFloat64Cmp : kSSEFloat64Cmp; |
| 1636 | VisitCompare(selector, opcode, right, left, cont, false); |
| 1637 | } |
| 1638 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1639 | // Shared routine for word comparison against zero. |
| 1640 | void VisitWordCompareZero(InstructionSelector* selector, Node* user, |
| 1641 | Node* value, FlagsContinuation* cont) { |
| 1642 | while (selector->CanCover(user, value)) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1643 | switch (value->opcode()) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1644 | case IrOpcode::kWord32Equal: { |
| 1645 | // Combine with comparisons against 0 by simply inverting the |
| 1646 | // continuation. |
| 1647 | Int32BinopMatcher m(value); |
| 1648 | if (m.right().Is(0)) { |
| 1649 | user = value; |
| 1650 | value = m.left().node(); |
| 1651 | cont->Negate(); |
| 1652 | continue; |
| 1653 | } |
| 1654 | cont->OverwriteAndNegateIfEqual(kEqual); |
| 1655 | return VisitWordCompare(selector, value, kX64Cmp32, cont); |
| 1656 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1657 | case IrOpcode::kInt32LessThan: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1658 | cont->OverwriteAndNegateIfEqual(kSignedLessThan); |
| 1659 | return VisitWordCompare(selector, value, kX64Cmp32, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1660 | case IrOpcode::kInt32LessThanOrEqual: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1661 | cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual); |
| 1662 | return VisitWordCompare(selector, value, kX64Cmp32, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1663 | case IrOpcode::kUint32LessThan: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1664 | cont->OverwriteAndNegateIfEqual(kUnsignedLessThan); |
| 1665 | return VisitWordCompare(selector, value, kX64Cmp32, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1666 | case IrOpcode::kUint32LessThanOrEqual: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1667 | cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual); |
| 1668 | return VisitWordCompare(selector, value, kX64Cmp32, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1669 | case IrOpcode::kWord64Equal: { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1670 | cont->OverwriteAndNegateIfEqual(kEqual); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1671 | Int64BinopMatcher m(value); |
| 1672 | if (m.right().Is(0)) { |
| 1673 | // Try to combine the branch with a comparison. |
| 1674 | Node* const user = m.node(); |
| 1675 | Node* const value = m.left().node(); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1676 | if (selector->CanCover(user, value)) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1677 | switch (value->opcode()) { |
| 1678 | case IrOpcode::kInt64Sub: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1679 | return VisitWord64Compare(selector, value, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1680 | case IrOpcode::kWord64And: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1681 | return VisitWordCompare(selector, value, kX64Test, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1682 | default: |
| 1683 | break; |
| 1684 | } |
| 1685 | } |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1686 | return VisitCompareZero(selector, value, kX64Cmp, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1687 | } |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1688 | return VisitWord64Compare(selector, value, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1689 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1690 | case IrOpcode::kInt64LessThan: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1691 | cont->OverwriteAndNegateIfEqual(kSignedLessThan); |
| 1692 | return VisitWord64Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1693 | case IrOpcode::kInt64LessThanOrEqual: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1694 | cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual); |
| 1695 | return VisitWord64Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1696 | case IrOpcode::kUint64LessThan: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1697 | cont->OverwriteAndNegateIfEqual(kUnsignedLessThan); |
| 1698 | return VisitWord64Compare(selector, value, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1699 | case IrOpcode::kUint64LessThanOrEqual: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1700 | cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual); |
| 1701 | return VisitWord64Compare(selector, value, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1702 | case IrOpcode::kFloat32Equal: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1703 | cont->OverwriteAndNegateIfEqual(kUnorderedEqual); |
| 1704 | return VisitFloat32Compare(selector, value, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1705 | case IrOpcode::kFloat32LessThan: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1706 | cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThan); |
| 1707 | return VisitFloat32Compare(selector, value, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1708 | case IrOpcode::kFloat32LessThanOrEqual: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1709 | cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThanOrEqual); |
| 1710 | return VisitFloat32Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1711 | case IrOpcode::kFloat64Equal: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1712 | cont->OverwriteAndNegateIfEqual(kUnorderedEqual); |
| 1713 | return VisitFloat64Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1714 | case IrOpcode::kFloat64LessThan: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1715 | cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThan); |
| 1716 | return VisitFloat64Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1717 | case IrOpcode::kFloat64LessThanOrEqual: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1718 | cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThanOrEqual); |
| 1719 | return VisitFloat64Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1720 | case IrOpcode::kProjection: |
| 1721 | // Check if this is the overflow output projection of an |
| 1722 | // <Operation>WithOverflow node. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1723 | if (ProjectionIndexOf(value->op()) == 1u) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1724 | // We cannot combine the <Operation>WithOverflow with this branch |
| 1725 | // unless the 0th projection (the use of the actual value of the |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1726 | // <Operation> is either nullptr, which means there's no use of the |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1727 | // actual value, or was already defined, which means it is scheduled |
| 1728 | // *AFTER* this branch). |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1729 | Node* const node = value->InputAt(0); |
| 1730 | Node* const result = NodeProperties::FindProjection(node, 0); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1731 | if (result == nullptr || selector->IsDefined(result)) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1732 | switch (node->opcode()) { |
| 1733 | case IrOpcode::kInt32AddWithOverflow: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1734 | cont->OverwriteAndNegateIfEqual(kOverflow); |
| 1735 | return VisitBinop(selector, node, kX64Add32, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1736 | case IrOpcode::kInt32SubWithOverflow: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1737 | cont->OverwriteAndNegateIfEqual(kOverflow); |
| 1738 | return VisitBinop(selector, node, kX64Sub32, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1739 | case IrOpcode::kInt64AddWithOverflow: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1740 | cont->OverwriteAndNegateIfEqual(kOverflow); |
| 1741 | return VisitBinop(selector, node, kX64Add, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1742 | case IrOpcode::kInt64SubWithOverflow: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1743 | cont->OverwriteAndNegateIfEqual(kOverflow); |
| 1744 | return VisitBinop(selector, node, kX64Sub, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1745 | default: |
| 1746 | break; |
| 1747 | } |
| 1748 | } |
| 1749 | } |
| 1750 | break; |
| 1751 | case IrOpcode::kInt32Sub: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1752 | return VisitWordCompare(selector, value, kX64Cmp32, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1753 | case IrOpcode::kInt64Sub: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1754 | return VisitWord64Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1755 | case IrOpcode::kWord32And: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1756 | return VisitWordCompare(selector, value, kX64Test32, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1757 | case IrOpcode::kWord64And: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1758 | return VisitWordCompare(selector, value, kX64Test, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1759 | default: |
| 1760 | break; |
| 1761 | } |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1762 | break; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1763 | } |
| 1764 | |
| 1765 | // Branch could not be combined with a compare, emit compare against 0. |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1766 | VisitCompareZero(selector, value, kX64Cmp32, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1767 | } |
| 1768 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1769 | } // namespace |
| 1770 | |
| 1771 | void InstructionSelector::VisitBranch(Node* branch, BasicBlock* tbranch, |
| 1772 | BasicBlock* fbranch) { |
| 1773 | FlagsContinuation cont(kNotEqual, tbranch, fbranch); |
| 1774 | VisitWordCompareZero(this, branch, branch->InputAt(0), &cont); |
| 1775 | } |
| 1776 | |
| 1777 | void InstructionSelector::VisitDeoptimizeIf(Node* node) { |
| 1778 | FlagsContinuation cont = |
| 1779 | FlagsContinuation::ForDeoptimize(kNotEqual, node->InputAt(1)); |
| 1780 | VisitWordCompareZero(this, node, node->InputAt(0), &cont); |
| 1781 | } |
| 1782 | |
| 1783 | void InstructionSelector::VisitDeoptimizeUnless(Node* node) { |
| 1784 | FlagsContinuation cont = |
| 1785 | FlagsContinuation::ForDeoptimize(kEqual, node->InputAt(1)); |
| 1786 | VisitWordCompareZero(this, node, node->InputAt(0), &cont); |
| 1787 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1788 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1789 | void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) { |
| 1790 | X64OperandGenerator g(this); |
| 1791 | InstructionOperand value_operand = g.UseRegister(node->InputAt(0)); |
| 1792 | |
| 1793 | // Emit either ArchTableSwitch or ArchLookupSwitch. |
| 1794 | size_t table_space_cost = 4 + sw.value_range; |
| 1795 | size_t table_time_cost = 3; |
| 1796 | size_t lookup_space_cost = 3 + 2 * sw.case_count; |
| 1797 | size_t lookup_time_cost = sw.case_count; |
| 1798 | if (sw.case_count > 4 && |
| 1799 | table_space_cost + 3 * table_time_cost <= |
| 1800 | lookup_space_cost + 3 * lookup_time_cost && |
| 1801 | sw.min_value > std::numeric_limits<int32_t>::min()) { |
| 1802 | InstructionOperand index_operand = g.TempRegister(); |
| 1803 | if (sw.min_value) { |
| 1804 | // The leal automatically zero extends, so result is a valid 64-bit index. |
| 1805 | Emit(kX64Lea32 | AddressingModeField::encode(kMode_MRI), index_operand, |
| 1806 | value_operand, g.TempImmediate(-sw.min_value)); |
| 1807 | } else { |
| 1808 | // Zero extend, because we use it as 64-bit index into the jump table. |
| 1809 | Emit(kX64Movl, index_operand, value_operand); |
| 1810 | } |
| 1811 | // Generate a table lookup. |
| 1812 | return EmitTableSwitch(sw, index_operand); |
| 1813 | } |
| 1814 | |
| 1815 | // Generate a sequence of conditional jumps. |
| 1816 | return EmitLookupSwitch(sw, value_operand); |
| 1817 | } |
| 1818 | |
| 1819 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1820 | void InstructionSelector::VisitWord32Equal(Node* const node) { |
| 1821 | Node* user = node; |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1822 | FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1823 | Int32BinopMatcher m(user); |
| 1824 | if (m.right().Is(0)) { |
| 1825 | Node* value = m.left().node(); |
| 1826 | |
| 1827 | // Try to combine with comparisons against 0 by simply inverting the branch. |
| 1828 | while (CanCover(user, value) && value->opcode() == IrOpcode::kWord32Equal) { |
| 1829 | Int32BinopMatcher m(value); |
| 1830 | if (m.right().Is(0)) { |
| 1831 | user = value; |
| 1832 | value = m.left().node(); |
| 1833 | cont.Negate(); |
| 1834 | } else { |
| 1835 | break; |
| 1836 | } |
| 1837 | } |
| 1838 | |
| 1839 | // Try to combine the branch with a comparison. |
| 1840 | if (CanCover(user, value)) { |
| 1841 | switch (value->opcode()) { |
| 1842 | case IrOpcode::kInt32Sub: |
| 1843 | return VisitWordCompare(this, value, kX64Cmp32, &cont); |
| 1844 | case IrOpcode::kWord32And: |
| 1845 | return VisitWordCompare(this, value, kX64Test32, &cont); |
| 1846 | default: |
| 1847 | break; |
| 1848 | } |
| 1849 | } |
| 1850 | return VisitCompareZero(this, value, kX64Cmp32, &cont); |
| 1851 | } |
| 1852 | VisitWordCompare(this, node, kX64Cmp32, &cont); |
| 1853 | } |
| 1854 | |
| 1855 | |
| 1856 | void InstructionSelector::VisitInt32LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1857 | FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1858 | VisitWordCompare(this, node, kX64Cmp32, &cont); |
| 1859 | } |
| 1860 | |
| 1861 | |
| 1862 | void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1863 | FlagsContinuation cont = |
| 1864 | FlagsContinuation::ForSet(kSignedLessThanOrEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1865 | VisitWordCompare(this, node, kX64Cmp32, &cont); |
| 1866 | } |
| 1867 | |
| 1868 | |
| 1869 | void InstructionSelector::VisitUint32LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1870 | FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1871 | VisitWordCompare(this, node, kX64Cmp32, &cont); |
| 1872 | } |
| 1873 | |
| 1874 | |
| 1875 | void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1876 | FlagsContinuation cont = |
| 1877 | FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1878 | VisitWordCompare(this, node, kX64Cmp32, &cont); |
| 1879 | } |
| 1880 | |
| 1881 | |
| 1882 | void InstructionSelector::VisitWord64Equal(Node* const node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1883 | FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1884 | Int64BinopMatcher m(node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1885 | if (m.right().Is(0)) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1886 | // Try to combine the equality check with a comparison. |
| 1887 | Node* const user = m.node(); |
| 1888 | Node* const value = m.left().node(); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1889 | if (CanCover(user, value)) { |
| 1890 | switch (value->opcode()) { |
| 1891 | case IrOpcode::kInt64Sub: |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1892 | return VisitWord64Compare(this, value, &cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1893 | case IrOpcode::kWord64And: |
| 1894 | return VisitWordCompare(this, value, kX64Test, &cont); |
| 1895 | default: |
| 1896 | break; |
| 1897 | } |
| 1898 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1899 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1900 | VisitWord64Compare(this, node, &cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1901 | } |
| 1902 | |
| 1903 | |
| 1904 | void InstructionSelector::VisitInt32AddWithOverflow(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1905 | if (Node* ovf = NodeProperties::FindProjection(node, 1)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1906 | FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); |
| 1907 | return VisitBinop(this, node, kX64Add32, &cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1908 | } |
| 1909 | FlagsContinuation cont; |
| 1910 | VisitBinop(this, node, kX64Add32, &cont); |
| 1911 | } |
| 1912 | |
| 1913 | |
| 1914 | void InstructionSelector::VisitInt32SubWithOverflow(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1915 | if (Node* ovf = NodeProperties::FindProjection(node, 1)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1916 | FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1917 | return VisitBinop(this, node, kX64Sub32, &cont); |
| 1918 | } |
| 1919 | FlagsContinuation cont; |
| 1920 | VisitBinop(this, node, kX64Sub32, &cont); |
| 1921 | } |
| 1922 | |
| 1923 | |
| 1924 | void InstructionSelector::VisitInt64LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1925 | FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1926 | VisitWord64Compare(this, node, &cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1927 | } |
| 1928 | |
| 1929 | |
| 1930 | void InstructionSelector::VisitInt64LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1931 | FlagsContinuation cont = |
| 1932 | FlagsContinuation::ForSet(kSignedLessThanOrEqual, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1933 | VisitWord64Compare(this, node, &cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1934 | } |
| 1935 | |
| 1936 | |
| 1937 | void InstructionSelector::VisitUint64LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1938 | FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1939 | VisitWord64Compare(this, node, &cont); |
| 1940 | } |
| 1941 | |
| 1942 | |
| 1943 | void InstructionSelector::VisitUint64LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1944 | FlagsContinuation cont = |
| 1945 | FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1946 | VisitWord64Compare(this, node, &cont); |
| 1947 | } |
| 1948 | |
| 1949 | |
| 1950 | void InstructionSelector::VisitFloat32Equal(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1951 | FlagsContinuation cont = FlagsContinuation::ForSet(kUnorderedEqual, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1952 | VisitFloat32Compare(this, node, &cont); |
| 1953 | } |
| 1954 | |
| 1955 | |
| 1956 | void InstructionSelector::VisitFloat32LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1957 | FlagsContinuation cont = |
| 1958 | FlagsContinuation::ForSet(kUnsignedGreaterThan, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1959 | VisitFloat32Compare(this, node, &cont); |
| 1960 | } |
| 1961 | |
| 1962 | |
| 1963 | void InstructionSelector::VisitFloat32LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1964 | FlagsContinuation cont = |
| 1965 | FlagsContinuation::ForSet(kUnsignedGreaterThanOrEqual, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1966 | VisitFloat32Compare(this, node, &cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1967 | } |
| 1968 | |
| 1969 | |
| 1970 | void InstructionSelector::VisitFloat64Equal(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1971 | FlagsContinuation cont = FlagsContinuation::ForSet(kUnorderedEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1972 | VisitFloat64Compare(this, node, &cont); |
| 1973 | } |
| 1974 | |
| 1975 | |
| 1976 | void InstructionSelector::VisitFloat64LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1977 | FlagsContinuation cont = |
| 1978 | FlagsContinuation::ForSet(kUnsignedGreaterThan, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1979 | VisitFloat64Compare(this, node, &cont); |
| 1980 | } |
| 1981 | |
| 1982 | |
| 1983 | void InstructionSelector::VisitFloat64LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1984 | FlagsContinuation cont = |
| 1985 | FlagsContinuation::ForSet(kUnsignedGreaterThanOrEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1986 | VisitFloat64Compare(this, node, &cont); |
| 1987 | } |
| 1988 | |
| 1989 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1990 | void InstructionSelector::VisitFloat64ExtractLowWord32(Node* node) { |
| 1991 | X64OperandGenerator g(this); |
| 1992 | Emit(kSSEFloat64ExtractLowWord32, g.DefineAsRegister(node), |
| 1993 | g.Use(node->InputAt(0))); |
| 1994 | } |
| 1995 | |
| 1996 | |
| 1997 | void InstructionSelector::VisitFloat64ExtractHighWord32(Node* node) { |
| 1998 | X64OperandGenerator g(this); |
| 1999 | Emit(kSSEFloat64ExtractHighWord32, g.DefineAsRegister(node), |
| 2000 | g.Use(node->InputAt(0))); |
| 2001 | } |
| 2002 | |
| 2003 | |
| 2004 | void InstructionSelector::VisitFloat64InsertLowWord32(Node* node) { |
| 2005 | X64OperandGenerator g(this); |
| 2006 | Node* left = node->InputAt(0); |
| 2007 | Node* right = node->InputAt(1); |
| 2008 | Float64Matcher mleft(left); |
| 2009 | if (mleft.HasValue() && (bit_cast<uint64_t>(mleft.Value()) >> 32) == 0u) { |
| 2010 | Emit(kSSEFloat64LoadLowWord32, g.DefineAsRegister(node), g.Use(right)); |
| 2011 | return; |
| 2012 | } |
| 2013 | Emit(kSSEFloat64InsertLowWord32, g.DefineSameAsFirst(node), |
| 2014 | g.UseRegister(left), g.Use(right)); |
| 2015 | } |
| 2016 | |
| 2017 | |
| 2018 | void InstructionSelector::VisitFloat64InsertHighWord32(Node* node) { |
| 2019 | X64OperandGenerator g(this); |
| 2020 | Node* left = node->InputAt(0); |
| 2021 | Node* right = node->InputAt(1); |
| 2022 | Emit(kSSEFloat64InsertHighWord32, g.DefineSameAsFirst(node), |
| 2023 | g.UseRegister(left), g.Use(right)); |
| 2024 | } |
| 2025 | |
| 2026 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2027 | // static |
| 2028 | MachineOperatorBuilder::Flags |
| 2029 | InstructionSelector::SupportedMachineOperatorFlags() { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2030 | MachineOperatorBuilder::Flags flags = |
| 2031 | MachineOperatorBuilder::kFloat32Max | |
| 2032 | MachineOperatorBuilder::kFloat32Min | |
| 2033 | MachineOperatorBuilder::kFloat64Max | |
| 2034 | MachineOperatorBuilder::kFloat64Min | |
| 2035 | MachineOperatorBuilder::kWord32ShiftIsSafe | |
| 2036 | MachineOperatorBuilder::kWord32Ctz | MachineOperatorBuilder::kWord64Ctz; |
| 2037 | if (CpuFeatures::IsSupported(POPCNT)) { |
| 2038 | flags |= MachineOperatorBuilder::kWord32Popcnt | |
| 2039 | MachineOperatorBuilder::kWord64Popcnt; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2040 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2041 | if (CpuFeatures::IsSupported(SSE4_1)) { |
| 2042 | flags |= MachineOperatorBuilder::kFloat32RoundDown | |
| 2043 | MachineOperatorBuilder::kFloat64RoundDown | |
| 2044 | MachineOperatorBuilder::kFloat32RoundUp | |
| 2045 | MachineOperatorBuilder::kFloat64RoundUp | |
| 2046 | MachineOperatorBuilder::kFloat32RoundTruncate | |
| 2047 | MachineOperatorBuilder::kFloat64RoundTruncate | |
| 2048 | MachineOperatorBuilder::kFloat32RoundTiesEven | |
| 2049 | MachineOperatorBuilder::kFloat64RoundTiesEven; |
| 2050 | } |
| 2051 | return flags; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2052 | } |
| 2053 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 2054 | } // namespace compiler |
| 2055 | } // namespace internal |
| 2056 | } // namespace v8 |