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 "src/base/adapters.h" |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 6 | #include "src/compiler/instruction-selector-impl.h" |
| 7 | #include "src/compiler/node-matchers.h" |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 8 | #include "src/compiler/node-properties.h" |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 9 | |
| 10 | namespace v8 { |
| 11 | namespace internal { |
| 12 | namespace compiler { |
| 13 | |
| 14 | // Adds IA32-specific methods for generating operands. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 15 | class IA32OperandGenerator final : public OperandGenerator { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 16 | public: |
| 17 | explicit IA32OperandGenerator(InstructionSelector* selector) |
| 18 | : OperandGenerator(selector) {} |
| 19 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 20 | InstructionOperand UseByteRegister(Node* node) { |
| 21 | // TODO(titzer): encode byte register use constraints. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 22 | return UseFixed(node, edx); |
| 23 | } |
| 24 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 25 | InstructionOperand DefineAsByteRegister(Node* node) { |
| 26 | // TODO(titzer): encode byte register def constraints. |
| 27 | return DefineAsRegister(node); |
| 28 | } |
| 29 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 30 | bool CanBeMemoryOperand(InstructionCode opcode, Node* node, Node* input, |
| 31 | int effect_level) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 32 | if (input->opcode() != IrOpcode::kLoad || |
| 33 | !selector()->CanCover(node, input)) { |
| 34 | return false; |
| 35 | } |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 36 | if (effect_level != selector()->GetEffectLevel(input)) { |
| 37 | return false; |
| 38 | } |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 39 | MachineRepresentation rep = |
| 40 | LoadRepresentationOf(input->op()).representation(); |
| 41 | switch (opcode) { |
| 42 | case kIA32Cmp: |
| 43 | case kIA32Test: |
| 44 | return rep == MachineRepresentation::kWord32 || |
| 45 | rep == MachineRepresentation::kTagged; |
| 46 | case kIA32Cmp16: |
| 47 | case kIA32Test16: |
| 48 | return rep == MachineRepresentation::kWord16; |
| 49 | case kIA32Cmp8: |
| 50 | case kIA32Test8: |
| 51 | return rep == MachineRepresentation::kWord8; |
| 52 | default: |
| 53 | break; |
| 54 | } |
| 55 | return false; |
| 56 | } |
| 57 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 58 | bool CanBeImmediate(Node* node) { |
| 59 | switch (node->opcode()) { |
| 60 | case IrOpcode::kInt32Constant: |
| 61 | case IrOpcode::kNumberConstant: |
| 62 | case IrOpcode::kExternalConstant: |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 63 | case IrOpcode::kRelocatableInt32Constant: |
| 64 | case IrOpcode::kRelocatableInt64Constant: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 65 | return true; |
| 66 | case IrOpcode::kHeapConstant: { |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 67 | // TODO(bmeurer): We must not dereference handles concurrently. If we |
| 68 | // really have to this here, then we need to find a way to put this |
| 69 | // information on the HeapConstant node already. |
| 70 | #if 0 |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 71 | // Constants in new space cannot be used as immediates in V8 because |
| 72 | // the GC does not scan code objects when collecting the new generation. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 73 | Handle<HeapObject> value = OpParameter<Handle<HeapObject>>(node); |
| 74 | Isolate* isolate = value->GetIsolate(); |
| 75 | return !isolate->heap()->InNewSpace(*value); |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 76 | #endif |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 77 | } |
| 78 | default: |
| 79 | return false; |
| 80 | } |
| 81 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 82 | |
| 83 | AddressingMode GenerateMemoryOperandInputs(Node* index, int scale, Node* base, |
| 84 | Node* displacement_node, |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 85 | InstructionOperand inputs[], |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 86 | size_t* input_count) { |
| 87 | AddressingMode mode = kMode_MRI; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 88 | int32_t displacement = (displacement_node == nullptr) |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 89 | ? 0 |
| 90 | : OpParameter<int32_t>(displacement_node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 91 | if (base != nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 92 | if (base->opcode() == IrOpcode::kInt32Constant) { |
| 93 | displacement += OpParameter<int32_t>(base); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 94 | base = nullptr; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 95 | } |
| 96 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 97 | if (base != nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 98 | inputs[(*input_count)++] = UseRegister(base); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 99 | if (index != nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 100 | DCHECK(scale >= 0 && scale <= 3); |
| 101 | inputs[(*input_count)++] = UseRegister(index); |
| 102 | if (displacement != 0) { |
| 103 | inputs[(*input_count)++] = TempImmediate(displacement); |
| 104 | static const AddressingMode kMRnI_modes[] = {kMode_MR1I, kMode_MR2I, |
| 105 | kMode_MR4I, kMode_MR8I}; |
| 106 | mode = kMRnI_modes[scale]; |
| 107 | } else { |
| 108 | static const AddressingMode kMRn_modes[] = {kMode_MR1, kMode_MR2, |
| 109 | kMode_MR4, kMode_MR8}; |
| 110 | mode = kMRn_modes[scale]; |
| 111 | } |
| 112 | } else { |
| 113 | if (displacement == 0) { |
| 114 | mode = kMode_MR; |
| 115 | } else { |
| 116 | inputs[(*input_count)++] = TempImmediate(displacement); |
| 117 | mode = kMode_MRI; |
| 118 | } |
| 119 | } |
| 120 | } else { |
| 121 | DCHECK(scale >= 0 && scale <= 3); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 122 | if (index != nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 123 | inputs[(*input_count)++] = UseRegister(index); |
| 124 | if (displacement != 0) { |
| 125 | inputs[(*input_count)++] = TempImmediate(displacement); |
| 126 | static const AddressingMode kMnI_modes[] = {kMode_MRI, kMode_M2I, |
| 127 | kMode_M4I, kMode_M8I}; |
| 128 | mode = kMnI_modes[scale]; |
| 129 | } else { |
| 130 | static const AddressingMode kMn_modes[] = {kMode_MR, kMode_M2, |
| 131 | kMode_M4, kMode_M8}; |
| 132 | mode = kMn_modes[scale]; |
| 133 | } |
| 134 | } else { |
| 135 | inputs[(*input_count)++] = TempImmediate(displacement); |
| 136 | return kMode_MI; |
| 137 | } |
| 138 | } |
| 139 | return mode; |
| 140 | } |
| 141 | |
| 142 | AddressingMode GetEffectiveAddressMemoryOperand(Node* node, |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 143 | InstructionOperand inputs[], |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 144 | size_t* input_count) { |
| 145 | BaseWithIndexAndDisplacement32Matcher m(node, true); |
| 146 | DCHECK(m.matches()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 147 | if ((m.displacement() == nullptr || CanBeImmediate(m.displacement()))) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 148 | return GenerateMemoryOperandInputs(m.index(), m.scale(), m.base(), |
| 149 | m.displacement(), inputs, input_count); |
| 150 | } else { |
| 151 | inputs[(*input_count)++] = UseRegister(node->InputAt(0)); |
| 152 | inputs[(*input_count)++] = UseRegister(node->InputAt(1)); |
| 153 | return kMode_MR1; |
| 154 | } |
| 155 | } |
| 156 | |
| 157 | bool CanBeBetterLeftOperand(Node* node) const { |
| 158 | return !selector()->IsLive(node); |
| 159 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 160 | }; |
| 161 | |
| 162 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 163 | namespace { |
| 164 | |
| 165 | void VisitRO(InstructionSelector* selector, Node* node, ArchOpcode opcode) { |
| 166 | IA32OperandGenerator g(selector); |
| 167 | selector->Emit(opcode, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 168 | } |
| 169 | |
| 170 | |
| 171 | void VisitRR(InstructionSelector* selector, Node* node, |
| 172 | InstructionCode opcode) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 173 | IA32OperandGenerator g(selector); |
| 174 | selector->Emit(opcode, g.DefineAsRegister(node), |
| 175 | g.UseRegister(node->InputAt(0))); |
| 176 | } |
| 177 | |
| 178 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 179 | void VisitRROFloat(InstructionSelector* selector, Node* node, |
| 180 | ArchOpcode avx_opcode, ArchOpcode sse_opcode) { |
| 181 | IA32OperandGenerator g(selector); |
| 182 | InstructionOperand operand0 = g.UseRegister(node->InputAt(0)); |
| 183 | InstructionOperand operand1 = g.Use(node->InputAt(1)); |
| 184 | if (selector->IsSupported(AVX)) { |
| 185 | selector->Emit(avx_opcode, g.DefineAsRegister(node), operand0, operand1); |
| 186 | } else { |
| 187 | selector->Emit(sse_opcode, g.DefineSameAsFirst(node), operand0, operand1); |
| 188 | } |
| 189 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 190 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 191 | |
| 192 | void VisitFloatUnop(InstructionSelector* selector, Node* node, Node* input, |
| 193 | ArchOpcode avx_opcode, ArchOpcode sse_opcode) { |
| 194 | IA32OperandGenerator g(selector); |
| 195 | if (selector->IsSupported(AVX)) { |
| 196 | selector->Emit(avx_opcode, g.DefineAsRegister(node), g.Use(input)); |
| 197 | } else { |
| 198 | selector->Emit(sse_opcode, g.DefineSameAsFirst(node), g.UseRegister(input)); |
| 199 | } |
| 200 | } |
| 201 | |
| 202 | |
| 203 | } // namespace |
| 204 | |
| 205 | |
| 206 | void InstructionSelector::VisitLoad(Node* node) { |
| 207 | LoadRepresentation load_rep = LoadRepresentationOf(node->op()); |
| 208 | |
| 209 | ArchOpcode opcode = kArchNop; |
| 210 | switch (load_rep.representation()) { |
| 211 | case MachineRepresentation::kFloat32: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 212 | opcode = kIA32Movss; |
| 213 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 214 | case MachineRepresentation::kFloat64: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 215 | opcode = kIA32Movsd; |
| 216 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 217 | case MachineRepresentation::kBit: // Fall through. |
| 218 | case MachineRepresentation::kWord8: |
| 219 | opcode = load_rep.IsSigned() ? kIA32Movsxbl : kIA32Movzxbl; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 220 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 221 | case MachineRepresentation::kWord16: |
| 222 | opcode = load_rep.IsSigned() ? kIA32Movsxwl : kIA32Movzxwl; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 223 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 224 | case MachineRepresentation::kTagged: // Fall through. |
| 225 | case MachineRepresentation::kWord32: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 226 | opcode = kIA32Movl; |
| 227 | break; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 228 | case MachineRepresentation::kWord64: // Fall through. |
| 229 | case MachineRepresentation::kSimd128: // Fall through. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 230 | case MachineRepresentation::kNone: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 231 | UNREACHABLE(); |
| 232 | return; |
| 233 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 234 | |
| 235 | IA32OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 236 | InstructionOperand outputs[1]; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 237 | outputs[0] = g.DefineAsRegister(node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 238 | InstructionOperand inputs[3]; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 239 | size_t input_count = 0; |
| 240 | AddressingMode mode = |
| 241 | g.GetEffectiveAddressMemoryOperand(node, inputs, &input_count); |
| 242 | InstructionCode code = opcode | AddressingModeField::encode(mode); |
| 243 | Emit(code, 1, outputs, input_count, inputs); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 244 | } |
| 245 | |
| 246 | |
| 247 | void InstructionSelector::VisitStore(Node* node) { |
| 248 | IA32OperandGenerator g(this); |
| 249 | Node* base = node->InputAt(0); |
| 250 | Node* index = node->InputAt(1); |
| 251 | Node* value = node->InputAt(2); |
| 252 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 253 | StoreRepresentation store_rep = StoreRepresentationOf(node->op()); |
| 254 | WriteBarrierKind write_barrier_kind = store_rep.write_barrier_kind(); |
| 255 | MachineRepresentation rep = store_rep.representation(); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 256 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 257 | if (write_barrier_kind != kNoWriteBarrier) { |
| 258 | DCHECK_EQ(MachineRepresentation::kTagged, rep); |
| 259 | AddressingMode addressing_mode; |
| 260 | InstructionOperand inputs[3]; |
| 261 | size_t input_count = 0; |
| 262 | inputs[input_count++] = g.UseUniqueRegister(base); |
| 263 | if (g.CanBeImmediate(index)) { |
| 264 | inputs[input_count++] = g.UseImmediate(index); |
| 265 | addressing_mode = kMode_MRI; |
| 266 | } else { |
| 267 | inputs[input_count++] = g.UseUniqueRegister(index); |
| 268 | addressing_mode = kMode_MR1; |
| 269 | } |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 270 | inputs[input_count++] = g.UseUniqueRegister(value); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 271 | RecordWriteMode record_write_mode = RecordWriteMode::kValueIsAny; |
| 272 | switch (write_barrier_kind) { |
| 273 | case kNoWriteBarrier: |
| 274 | UNREACHABLE(); |
| 275 | break; |
| 276 | case kMapWriteBarrier: |
| 277 | record_write_mode = RecordWriteMode::kValueIsMap; |
| 278 | break; |
| 279 | case kPointerWriteBarrier: |
| 280 | record_write_mode = RecordWriteMode::kValueIsPointer; |
| 281 | break; |
| 282 | case kFullWriteBarrier: |
| 283 | record_write_mode = RecordWriteMode::kValueIsAny; |
| 284 | break; |
| 285 | } |
| 286 | InstructionOperand temps[] = {g.TempRegister(), g.TempRegister()}; |
| 287 | size_t const temp_count = arraysize(temps); |
| 288 | InstructionCode code = kArchStoreWithWriteBarrier; |
| 289 | code |= AddressingModeField::encode(addressing_mode); |
| 290 | code |= MiscField::encode(static_cast<int>(record_write_mode)); |
| 291 | Emit(code, 0, nullptr, input_count, inputs, temp_count, temps); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 292 | } else { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 293 | ArchOpcode opcode = kArchNop; |
| 294 | switch (rep) { |
| 295 | case MachineRepresentation::kFloat32: |
| 296 | opcode = kIA32Movss; |
| 297 | break; |
| 298 | case MachineRepresentation::kFloat64: |
| 299 | opcode = kIA32Movsd; |
| 300 | break; |
| 301 | case MachineRepresentation::kBit: // Fall through. |
| 302 | case MachineRepresentation::kWord8: |
| 303 | opcode = kIA32Movb; |
| 304 | break; |
| 305 | case MachineRepresentation::kWord16: |
| 306 | opcode = kIA32Movw; |
| 307 | break; |
| 308 | case MachineRepresentation::kTagged: // Fall through. |
| 309 | case MachineRepresentation::kWord32: |
| 310 | opcode = kIA32Movl; |
| 311 | break; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 312 | case MachineRepresentation::kWord64: // Fall through. |
| 313 | case MachineRepresentation::kSimd128: // Fall through. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 314 | case MachineRepresentation::kNone: |
| 315 | UNREACHABLE(); |
| 316 | return; |
| 317 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 318 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 319 | InstructionOperand val; |
| 320 | if (g.CanBeImmediate(value)) { |
| 321 | val = g.UseImmediate(value); |
| 322 | } else if (rep == MachineRepresentation::kWord8 || |
| 323 | rep == MachineRepresentation::kBit) { |
| 324 | val = g.UseByteRegister(value); |
| 325 | } else { |
| 326 | val = g.UseRegister(value); |
| 327 | } |
| 328 | |
| 329 | InstructionOperand inputs[4]; |
| 330 | size_t input_count = 0; |
| 331 | AddressingMode addressing_mode = |
| 332 | g.GetEffectiveAddressMemoryOperand(node, inputs, &input_count); |
| 333 | InstructionCode code = |
| 334 | opcode | AddressingModeField::encode(addressing_mode); |
| 335 | inputs[input_count++] = val; |
| 336 | Emit(code, 0, static_cast<InstructionOperand*>(nullptr), input_count, |
| 337 | inputs); |
| 338 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 339 | } |
| 340 | |
| 341 | |
| 342 | void InstructionSelector::VisitCheckedLoad(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 343 | CheckedLoadRepresentation load_rep = CheckedLoadRepresentationOf(node->op()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 344 | IA32OperandGenerator g(this); |
| 345 | Node* const buffer = node->InputAt(0); |
| 346 | Node* const offset = node->InputAt(1); |
| 347 | Node* const length = node->InputAt(2); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 348 | ArchOpcode opcode = kArchNop; |
| 349 | switch (load_rep.representation()) { |
| 350 | case MachineRepresentation::kWord8: |
| 351 | opcode = load_rep.IsSigned() ? kCheckedLoadInt8 : kCheckedLoadUint8; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 352 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 353 | case MachineRepresentation::kWord16: |
| 354 | opcode = load_rep.IsSigned() ? kCheckedLoadInt16 : kCheckedLoadUint16; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 355 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 356 | case MachineRepresentation::kWord32: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 357 | opcode = kCheckedLoadWord32; |
| 358 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 359 | case MachineRepresentation::kFloat32: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 360 | opcode = kCheckedLoadFloat32; |
| 361 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 362 | case MachineRepresentation::kFloat64: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 363 | opcode = kCheckedLoadFloat64; |
| 364 | break; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 365 | case MachineRepresentation::kBit: // Fall through. |
| 366 | case MachineRepresentation::kTagged: // Fall through. |
| 367 | case MachineRepresentation::kWord64: // Fall through. |
| 368 | case MachineRepresentation::kSimd128: // Fall through. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 369 | case MachineRepresentation::kNone: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 370 | UNREACHABLE(); |
| 371 | return; |
| 372 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 373 | InstructionOperand offset_operand = g.UseRegister(offset); |
| 374 | InstructionOperand length_operand = |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 375 | g.CanBeImmediate(length) ? g.UseImmediate(length) : g.UseRegister(length); |
| 376 | if (g.CanBeImmediate(buffer)) { |
| 377 | Emit(opcode | AddressingModeField::encode(kMode_MRI), |
| 378 | g.DefineAsRegister(node), offset_operand, length_operand, |
| 379 | offset_operand, g.UseImmediate(buffer)); |
| 380 | } else { |
| 381 | Emit(opcode | AddressingModeField::encode(kMode_MR1), |
| 382 | g.DefineAsRegister(node), offset_operand, length_operand, |
| 383 | g.UseRegister(buffer), offset_operand); |
| 384 | } |
| 385 | } |
| 386 | |
| 387 | |
| 388 | void InstructionSelector::VisitCheckedStore(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 389 | MachineRepresentation rep = CheckedStoreRepresentationOf(node->op()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 390 | IA32OperandGenerator g(this); |
| 391 | Node* const buffer = node->InputAt(0); |
| 392 | Node* const offset = node->InputAt(1); |
| 393 | Node* const length = node->InputAt(2); |
| 394 | Node* const value = node->InputAt(3); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 395 | ArchOpcode opcode = kArchNop; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 396 | switch (rep) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 397 | case MachineRepresentation::kWord8: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 398 | opcode = kCheckedStoreWord8; |
| 399 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 400 | case MachineRepresentation::kWord16: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 401 | opcode = kCheckedStoreWord16; |
| 402 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 403 | case MachineRepresentation::kWord32: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 404 | opcode = kCheckedStoreWord32; |
| 405 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 406 | case MachineRepresentation::kFloat32: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 407 | opcode = kCheckedStoreFloat32; |
| 408 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 409 | case MachineRepresentation::kFloat64: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 410 | opcode = kCheckedStoreFloat64; |
| 411 | break; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 412 | case MachineRepresentation::kBit: // Fall through. |
| 413 | case MachineRepresentation::kTagged: // Fall through. |
| 414 | case MachineRepresentation::kWord64: // Fall through. |
| 415 | case MachineRepresentation::kSimd128: // Fall through. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 416 | case MachineRepresentation::kNone: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 417 | UNREACHABLE(); |
| 418 | return; |
| 419 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 420 | InstructionOperand value_operand = |
| 421 | g.CanBeImmediate(value) ? g.UseImmediate(value) |
| 422 | : ((rep == MachineRepresentation::kWord8 || |
| 423 | rep == MachineRepresentation::kBit) |
| 424 | ? g.UseByteRegister(value) |
| 425 | : g.UseRegister(value)); |
| 426 | InstructionOperand offset_operand = g.UseRegister(offset); |
| 427 | InstructionOperand length_operand = |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 428 | g.CanBeImmediate(length) ? g.UseImmediate(length) : g.UseRegister(length); |
| 429 | if (g.CanBeImmediate(buffer)) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 430 | Emit(opcode | AddressingModeField::encode(kMode_MRI), g.NoOutput(), |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 431 | offset_operand, length_operand, value_operand, offset_operand, |
| 432 | g.UseImmediate(buffer)); |
| 433 | } else { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 434 | Emit(opcode | AddressingModeField::encode(kMode_MR1), g.NoOutput(), |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 435 | offset_operand, length_operand, value_operand, g.UseRegister(buffer), |
| 436 | offset_operand); |
| 437 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 438 | } |
| 439 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 440 | namespace { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 441 | |
| 442 | // Shared routine for multiple binary operations. |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 443 | void VisitBinop(InstructionSelector* selector, Node* node, |
| 444 | InstructionCode opcode, FlagsContinuation* cont) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 445 | IA32OperandGenerator g(selector); |
| 446 | Int32BinopMatcher m(node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 447 | Node* left = m.left().node(); |
| 448 | Node* right = m.right().node(); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 449 | InstructionOperand inputs[4]; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 450 | size_t input_count = 0; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 451 | InstructionOperand outputs[2]; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 452 | size_t output_count = 0; |
| 453 | |
| 454 | // TODO(turbofan): match complex addressing modes. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 455 | if (left == right) { |
| 456 | // If both inputs refer to the same operand, enforce allocating a register |
| 457 | // for both of them to ensure that we don't end up generating code like |
| 458 | // this: |
| 459 | // |
| 460 | // mov eax, [ebp-0x10] |
| 461 | // add eax, [ebp-0x10] |
| 462 | // jo label |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 463 | InstructionOperand const input = g.UseRegister(left); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 464 | inputs[input_count++] = input; |
| 465 | inputs[input_count++] = input; |
| 466 | } else if (g.CanBeImmediate(right)) { |
| 467 | inputs[input_count++] = g.UseRegister(left); |
| 468 | inputs[input_count++] = g.UseImmediate(right); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 469 | } else { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 470 | if (node->op()->HasProperty(Operator::kCommutative) && |
| 471 | g.CanBeBetterLeftOperand(right)) { |
| 472 | std::swap(left, right); |
| 473 | } |
| 474 | inputs[input_count++] = g.UseRegister(left); |
| 475 | inputs[input_count++] = g.Use(right); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 476 | } |
| 477 | |
| 478 | if (cont->IsBranch()) { |
| 479 | inputs[input_count++] = g.Label(cont->true_block()); |
| 480 | inputs[input_count++] = g.Label(cont->false_block()); |
| 481 | } |
| 482 | |
| 483 | outputs[output_count++] = g.DefineSameAsFirst(node); |
| 484 | if (cont->IsSet()) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 485 | outputs[output_count++] = g.DefineAsByteRegister(cont->result()); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 486 | } |
| 487 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 488 | DCHECK_NE(0u, input_count); |
| 489 | DCHECK_NE(0u, output_count); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 490 | DCHECK_GE(arraysize(inputs), input_count); |
| 491 | DCHECK_GE(arraysize(outputs), output_count); |
| 492 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 493 | opcode = cont->Encode(opcode); |
| 494 | if (cont->IsDeoptimize()) { |
| 495 | selector->EmitDeoptimize(opcode, output_count, outputs, input_count, inputs, |
| 496 | cont->frame_state()); |
| 497 | } else { |
| 498 | selector->Emit(opcode, output_count, outputs, input_count, inputs); |
| 499 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 500 | } |
| 501 | |
| 502 | |
| 503 | // Shared routine for multiple binary operations. |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 504 | void VisitBinop(InstructionSelector* selector, Node* node, |
| 505 | InstructionCode opcode) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 506 | FlagsContinuation cont; |
| 507 | VisitBinop(selector, node, opcode, &cont); |
| 508 | } |
| 509 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 510 | } // namespace |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 511 | |
| 512 | void InstructionSelector::VisitWord32And(Node* node) { |
| 513 | VisitBinop(this, node, kIA32And); |
| 514 | } |
| 515 | |
| 516 | |
| 517 | void InstructionSelector::VisitWord32Or(Node* node) { |
| 518 | VisitBinop(this, node, kIA32Or); |
| 519 | } |
| 520 | |
| 521 | |
| 522 | void InstructionSelector::VisitWord32Xor(Node* node) { |
| 523 | IA32OperandGenerator g(this); |
| 524 | Int32BinopMatcher m(node); |
| 525 | if (m.right().Is(-1)) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 526 | Emit(kIA32Not, g.DefineSameAsFirst(node), g.UseRegister(m.left().node())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 527 | } else { |
| 528 | VisitBinop(this, node, kIA32Xor); |
| 529 | } |
| 530 | } |
| 531 | |
| 532 | |
| 533 | // Shared routine for multiple shift operations. |
| 534 | static inline void VisitShift(InstructionSelector* selector, Node* node, |
| 535 | ArchOpcode opcode) { |
| 536 | IA32OperandGenerator g(selector); |
| 537 | Node* left = node->InputAt(0); |
| 538 | Node* right = node->InputAt(1); |
| 539 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 540 | if (g.CanBeImmediate(right)) { |
| 541 | selector->Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(left), |
| 542 | g.UseImmediate(right)); |
| 543 | } else { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 544 | selector->Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(left), |
| 545 | g.UseFixed(right, ecx)); |
| 546 | } |
| 547 | } |
| 548 | |
| 549 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 550 | namespace { |
| 551 | |
| 552 | void VisitMulHigh(InstructionSelector* selector, Node* node, |
| 553 | ArchOpcode opcode) { |
| 554 | IA32OperandGenerator g(selector); |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 555 | InstructionOperand temps[] = {g.TempRegister(eax)}; |
| 556 | selector->Emit( |
| 557 | opcode, g.DefineAsFixed(node, edx), g.UseFixed(node->InputAt(0), eax), |
| 558 | g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 559 | } |
| 560 | |
| 561 | |
| 562 | void VisitDiv(InstructionSelector* selector, Node* node, ArchOpcode opcode) { |
| 563 | IA32OperandGenerator g(selector); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 564 | InstructionOperand temps[] = {g.TempRegister(edx)}; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 565 | selector->Emit(opcode, g.DefineAsFixed(node, eax), |
| 566 | g.UseFixed(node->InputAt(0), eax), |
| 567 | g.UseUnique(node->InputAt(1)), arraysize(temps), temps); |
| 568 | } |
| 569 | |
| 570 | |
| 571 | void VisitMod(InstructionSelector* selector, Node* node, ArchOpcode opcode) { |
| 572 | IA32OperandGenerator g(selector); |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 573 | InstructionOperand temps[] = {g.TempRegister(eax)}; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 574 | selector->Emit(opcode, g.DefineAsFixed(node, edx), |
| 575 | g.UseFixed(node->InputAt(0), eax), |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 576 | g.UseUnique(node->InputAt(1)), arraysize(temps), temps); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 577 | } |
| 578 | |
| 579 | void EmitLea(InstructionSelector* selector, Node* result, Node* index, |
| 580 | int scale, Node* base, Node* displacement) { |
| 581 | IA32OperandGenerator g(selector); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 582 | InstructionOperand inputs[4]; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 583 | size_t input_count = 0; |
| 584 | AddressingMode mode = g.GenerateMemoryOperandInputs( |
| 585 | index, scale, base, displacement, inputs, &input_count); |
| 586 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 587 | DCHECK_NE(0u, input_count); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 588 | DCHECK_GE(arraysize(inputs), input_count); |
| 589 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 590 | InstructionOperand outputs[1]; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 591 | outputs[0] = g.DefineAsRegister(result); |
| 592 | |
| 593 | InstructionCode opcode = AddressingModeField::encode(mode) | kIA32Lea; |
| 594 | |
| 595 | selector->Emit(opcode, 1, outputs, input_count, inputs); |
| 596 | } |
| 597 | |
| 598 | } // namespace |
| 599 | |
| 600 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 601 | void InstructionSelector::VisitWord32Shl(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 602 | Int32ScaleMatcher m(node, true); |
| 603 | if (m.matches()) { |
| 604 | Node* index = node->InputAt(0); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 605 | Node* base = m.power_of_two_plus_one() ? index : nullptr; |
| 606 | EmitLea(this, node, index, m.scale(), base, nullptr); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 607 | return; |
| 608 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 609 | VisitShift(this, node, kIA32Shl); |
| 610 | } |
| 611 | |
| 612 | |
| 613 | void InstructionSelector::VisitWord32Shr(Node* node) { |
| 614 | VisitShift(this, node, kIA32Shr); |
| 615 | } |
| 616 | |
| 617 | |
| 618 | void InstructionSelector::VisitWord32Sar(Node* node) { |
| 619 | VisitShift(this, node, kIA32Sar); |
| 620 | } |
| 621 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 622 | void InstructionSelector::VisitInt32PairAdd(Node* node) { |
| 623 | IA32OperandGenerator g(this); |
| 624 | |
| 625 | // We use UseUniqueRegister here to avoid register sharing with the temp |
| 626 | // register. |
| 627 | InstructionOperand inputs[] = { |
| 628 | g.UseRegister(node->InputAt(0)), g.UseUniqueRegister(node->InputAt(1)), |
| 629 | g.UseRegister(node->InputAt(2)), g.UseUniqueRegister(node->InputAt(3))}; |
| 630 | |
| 631 | InstructionOperand outputs[] = { |
| 632 | g.DefineSameAsFirst(node), |
| 633 | g.DefineAsRegister(NodeProperties::FindProjection(node, 1))}; |
| 634 | |
| 635 | InstructionOperand temps[] = {g.TempRegister()}; |
| 636 | |
| 637 | Emit(kIA32AddPair, 2, outputs, 4, inputs, 1, temps); |
| 638 | } |
| 639 | |
| 640 | void InstructionSelector::VisitInt32PairSub(Node* node) { |
| 641 | IA32OperandGenerator g(this); |
| 642 | |
| 643 | // We use UseUniqueRegister here to avoid register sharing with the temp |
| 644 | // register. |
| 645 | InstructionOperand inputs[] = { |
| 646 | g.UseRegister(node->InputAt(0)), g.UseUniqueRegister(node->InputAt(1)), |
| 647 | g.UseRegister(node->InputAt(2)), g.UseUniqueRegister(node->InputAt(3))}; |
| 648 | |
| 649 | InstructionOperand outputs[] = { |
| 650 | g.DefineSameAsFirst(node), |
| 651 | g.DefineAsRegister(NodeProperties::FindProjection(node, 1))}; |
| 652 | |
| 653 | InstructionOperand temps[] = {g.TempRegister()}; |
| 654 | |
| 655 | Emit(kIA32SubPair, 2, outputs, 4, inputs, 1, temps); |
| 656 | } |
| 657 | |
| 658 | void InstructionSelector::VisitInt32PairMul(Node* node) { |
| 659 | IA32OperandGenerator g(this); |
| 660 | |
| 661 | // InputAt(3) explicitly shares ecx with OutputRegister(1) to save one |
| 662 | // register and one mov instruction. |
| 663 | InstructionOperand inputs[] = { |
| 664 | g.UseUnique(node->InputAt(0)), g.UseUnique(node->InputAt(1)), |
| 665 | g.UseUniqueRegister(node->InputAt(2)), g.UseFixed(node->InputAt(3), ecx)}; |
| 666 | |
| 667 | InstructionOperand outputs[] = { |
| 668 | g.DefineAsFixed(node, eax), |
| 669 | g.DefineAsFixed(NodeProperties::FindProjection(node, 1), ecx)}; |
| 670 | |
| 671 | InstructionOperand temps[] = {g.TempRegister(edx)}; |
| 672 | |
| 673 | Emit(kIA32MulPair, 2, outputs, 4, inputs, 1, temps); |
| 674 | } |
| 675 | |
| 676 | void VisitWord32PairShift(InstructionSelector* selector, InstructionCode opcode, |
| 677 | Node* node) { |
| 678 | IA32OperandGenerator g(selector); |
| 679 | |
| 680 | Node* shift = node->InputAt(2); |
| 681 | InstructionOperand shift_operand; |
| 682 | if (g.CanBeImmediate(shift)) { |
| 683 | shift_operand = g.UseImmediate(shift); |
| 684 | } else { |
| 685 | shift_operand = g.UseFixed(shift, ecx); |
| 686 | } |
| 687 | InstructionOperand inputs[] = {g.UseFixed(node->InputAt(0), eax), |
| 688 | g.UseFixed(node->InputAt(1), edx), |
| 689 | shift_operand}; |
| 690 | |
| 691 | InstructionOperand outputs[] = { |
| 692 | g.DefineAsFixed(node, eax), |
| 693 | g.DefineAsFixed(NodeProperties::FindProjection(node, 1), edx)}; |
| 694 | |
| 695 | selector->Emit(opcode, 2, outputs, 3, inputs); |
| 696 | } |
| 697 | |
| 698 | void InstructionSelector::VisitWord32PairShl(Node* node) { |
| 699 | VisitWord32PairShift(this, kIA32ShlPair, node); |
| 700 | } |
| 701 | |
| 702 | void InstructionSelector::VisitWord32PairShr(Node* node) { |
| 703 | VisitWord32PairShift(this, kIA32ShrPair, node); |
| 704 | } |
| 705 | |
| 706 | void InstructionSelector::VisitWord32PairSar(Node* node) { |
| 707 | VisitWord32PairShift(this, kIA32SarPair, node); |
| 708 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 709 | |
| 710 | void InstructionSelector::VisitWord32Ror(Node* node) { |
| 711 | VisitShift(this, node, kIA32Ror); |
| 712 | } |
| 713 | |
| 714 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 715 | void InstructionSelector::VisitWord32Clz(Node* node) { |
| 716 | IA32OperandGenerator g(this); |
| 717 | Emit(kIA32Lzcnt, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 718 | } |
| 719 | |
| 720 | |
| 721 | void InstructionSelector::VisitWord32Ctz(Node* node) { |
| 722 | IA32OperandGenerator g(this); |
| 723 | Emit(kIA32Tzcnt, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 724 | } |
| 725 | |
| 726 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 727 | void InstructionSelector::VisitWord32ReverseBits(Node* node) { UNREACHABLE(); } |
| 728 | |
| 729 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 730 | void InstructionSelector::VisitWord32Popcnt(Node* node) { |
| 731 | IA32OperandGenerator g(this); |
| 732 | Emit(kIA32Popcnt, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 733 | } |
| 734 | |
| 735 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 736 | void InstructionSelector::VisitInt32Add(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 737 | IA32OperandGenerator g(this); |
| 738 | |
| 739 | // Try to match the Add to a lea pattern |
| 740 | BaseWithIndexAndDisplacement32Matcher m(node); |
| 741 | if (m.matches() && |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 742 | (m.displacement() == nullptr || g.CanBeImmediate(m.displacement()))) { |
| 743 | InstructionOperand inputs[4]; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 744 | size_t input_count = 0; |
| 745 | AddressingMode mode = g.GenerateMemoryOperandInputs( |
| 746 | m.index(), m.scale(), m.base(), m.displacement(), inputs, &input_count); |
| 747 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 748 | DCHECK_NE(0u, input_count); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 749 | DCHECK_GE(arraysize(inputs), input_count); |
| 750 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 751 | InstructionOperand outputs[1]; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 752 | outputs[0] = g.DefineAsRegister(node); |
| 753 | |
| 754 | InstructionCode opcode = AddressingModeField::encode(mode) | kIA32Lea; |
| 755 | Emit(opcode, 1, outputs, input_count, inputs); |
| 756 | return; |
| 757 | } |
| 758 | |
| 759 | // No lea pattern match, use add |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 760 | VisitBinop(this, node, kIA32Add); |
| 761 | } |
| 762 | |
| 763 | |
| 764 | void InstructionSelector::VisitInt32Sub(Node* node) { |
| 765 | IA32OperandGenerator g(this); |
| 766 | Int32BinopMatcher m(node); |
| 767 | if (m.left().Is(0)) { |
| 768 | Emit(kIA32Neg, g.DefineSameAsFirst(node), g.Use(m.right().node())); |
| 769 | } else { |
| 770 | VisitBinop(this, node, kIA32Sub); |
| 771 | } |
| 772 | } |
| 773 | |
| 774 | |
| 775 | void InstructionSelector::VisitInt32Mul(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 776 | Int32ScaleMatcher m(node, true); |
| 777 | if (m.matches()) { |
| 778 | Node* index = node->InputAt(0); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 779 | Node* base = m.power_of_two_plus_one() ? index : nullptr; |
| 780 | EmitLea(this, node, index, m.scale(), base, nullptr); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 781 | return; |
| 782 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 783 | IA32OperandGenerator g(this); |
| 784 | Node* left = node->InputAt(0); |
| 785 | Node* right = node->InputAt(1); |
| 786 | if (g.CanBeImmediate(right)) { |
| 787 | Emit(kIA32Imul, g.DefineAsRegister(node), g.Use(left), |
| 788 | g.UseImmediate(right)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 789 | } else { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 790 | if (g.CanBeBetterLeftOperand(right)) { |
| 791 | std::swap(left, right); |
| 792 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 793 | Emit(kIA32Imul, g.DefineSameAsFirst(node), g.UseRegister(left), |
| 794 | g.Use(right)); |
| 795 | } |
| 796 | } |
| 797 | |
| 798 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 799 | void InstructionSelector::VisitInt32MulHigh(Node* node) { |
| 800 | VisitMulHigh(this, node, kIA32ImulHigh); |
| 801 | } |
| 802 | |
| 803 | |
| 804 | void InstructionSelector::VisitUint32MulHigh(Node* node) { |
| 805 | VisitMulHigh(this, node, kIA32UmulHigh); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 806 | } |
| 807 | |
| 808 | |
| 809 | void InstructionSelector::VisitInt32Div(Node* node) { |
| 810 | VisitDiv(this, node, kIA32Idiv); |
| 811 | } |
| 812 | |
| 813 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 814 | void InstructionSelector::VisitUint32Div(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 815 | VisitDiv(this, node, kIA32Udiv); |
| 816 | } |
| 817 | |
| 818 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 819 | void InstructionSelector::VisitInt32Mod(Node* node) { |
| 820 | VisitMod(this, node, kIA32Idiv); |
| 821 | } |
| 822 | |
| 823 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 824 | void InstructionSelector::VisitUint32Mod(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 825 | VisitMod(this, node, kIA32Udiv); |
| 826 | } |
| 827 | |
| 828 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 829 | void InstructionSelector::VisitChangeFloat32ToFloat64(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 830 | VisitRO(this, node, kSSEFloat32ToFloat64); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 831 | } |
| 832 | |
| 833 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 834 | void InstructionSelector::VisitRoundInt32ToFloat32(Node* node) { |
| 835 | VisitRO(this, node, kSSEInt32ToFloat32); |
| 836 | } |
| 837 | |
| 838 | |
| 839 | void InstructionSelector::VisitRoundUint32ToFloat32(Node* node) { |
| 840 | IA32OperandGenerator g(this); |
| 841 | InstructionOperand temps[] = {g.TempRegister(), g.TempRegister()}; |
| 842 | Emit(kSSEUint32ToFloat32, g.DefineAsRegister(node), g.Use(node->InputAt(0)), |
| 843 | arraysize(temps), temps); |
| 844 | } |
| 845 | |
| 846 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 847 | void InstructionSelector::VisitChangeInt32ToFloat64(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 848 | VisitRO(this, node, kSSEInt32ToFloat64); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 849 | } |
| 850 | |
| 851 | |
| 852 | void InstructionSelector::VisitChangeUint32ToFloat64(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 853 | VisitRO(this, node, kSSEUint32ToFloat64); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 854 | } |
| 855 | |
| 856 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 857 | void InstructionSelector::VisitTruncateFloat32ToInt32(Node* node) { |
| 858 | VisitRO(this, node, kSSEFloat32ToInt32); |
| 859 | } |
| 860 | |
| 861 | |
| 862 | void InstructionSelector::VisitTruncateFloat32ToUint32(Node* node) { |
| 863 | VisitRO(this, node, kSSEFloat32ToUint32); |
| 864 | } |
| 865 | |
| 866 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 867 | void InstructionSelector::VisitChangeFloat64ToInt32(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 868 | VisitRO(this, node, kSSEFloat64ToInt32); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 869 | } |
| 870 | |
| 871 | |
| 872 | void InstructionSelector::VisitChangeFloat64ToUint32(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 873 | VisitRO(this, node, kSSEFloat64ToUint32); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 874 | } |
| 875 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 876 | void InstructionSelector::VisitTruncateFloat64ToUint32(Node* node) { |
| 877 | VisitRO(this, node, kSSEFloat64ToUint32); |
| 878 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 879 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 880 | void InstructionSelector::VisitTruncateFloat64ToFloat32(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 881 | VisitRO(this, node, kSSEFloat64ToFloat32); |
| 882 | } |
| 883 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 884 | void InstructionSelector::VisitTruncateFloat64ToWord32(Node* node) { |
| 885 | VisitRR(this, node, kArchTruncateDoubleToI); |
| 886 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 887 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 888 | void InstructionSelector::VisitRoundFloat64ToInt32(Node* node) { |
| 889 | VisitRO(this, node, kSSEFloat64ToInt32); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 890 | } |
| 891 | |
| 892 | |
| 893 | void InstructionSelector::VisitBitcastFloat32ToInt32(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 894 | IA32OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 895 | Emit(kIA32BitcastFI, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 896 | } |
| 897 | |
| 898 | |
| 899 | void InstructionSelector::VisitBitcastInt32ToFloat32(Node* node) { |
| 900 | IA32OperandGenerator g(this); |
| 901 | Emit(kIA32BitcastIF, g.DefineAsRegister(node), g.Use(node->InputAt(0))); |
| 902 | } |
| 903 | |
| 904 | |
| 905 | void InstructionSelector::VisitFloat32Add(Node* node) { |
| 906 | VisitRROFloat(this, node, kAVXFloat32Add, kSSEFloat32Add); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 907 | } |
| 908 | |
| 909 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 910 | void InstructionSelector::VisitFloat64Add(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 911 | VisitRROFloat(this, node, kAVXFloat64Add, kSSEFloat64Add); |
| 912 | } |
| 913 | |
| 914 | |
| 915 | void InstructionSelector::VisitFloat32Sub(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 916 | IA32OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 917 | Float32BinopMatcher m(node); |
| 918 | if (m.left().IsMinusZero()) { |
| 919 | VisitFloatUnop(this, node, m.right().node(), kAVXFloat32Neg, |
| 920 | kSSEFloat32Neg); |
| 921 | return; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 922 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 923 | VisitRROFloat(this, node, kAVXFloat32Sub, kSSEFloat32Sub); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 924 | } |
| 925 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 926 | void InstructionSelector::VisitFloat32SubPreserveNan(Node* node) { |
| 927 | VisitRROFloat(this, node, kAVXFloat32Sub, kSSEFloat32Sub); |
| 928 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 929 | |
| 930 | void InstructionSelector::VisitFloat64Sub(Node* node) { |
| 931 | IA32OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 932 | Float64BinopMatcher m(node); |
| 933 | if (m.left().IsMinusZero()) { |
| 934 | if (m.right().IsFloat64RoundDown() && |
| 935 | CanCover(m.node(), m.right().node())) { |
| 936 | if (m.right().InputAt(0)->opcode() == IrOpcode::kFloat64Sub && |
| 937 | CanCover(m.right().node(), m.right().InputAt(0))) { |
| 938 | Float64BinopMatcher mright0(m.right().InputAt(0)); |
| 939 | if (mright0.left().IsMinusZero()) { |
| 940 | Emit(kSSEFloat64Round | MiscField::encode(kRoundUp), |
| 941 | g.DefineAsRegister(node), g.UseRegister(mright0.right().node())); |
| 942 | return; |
| 943 | } |
| 944 | } |
| 945 | } |
| 946 | VisitFloatUnop(this, node, m.right().node(), kAVXFloat64Neg, |
| 947 | kSSEFloat64Neg); |
| 948 | return; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 949 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 950 | VisitRROFloat(this, node, kAVXFloat64Sub, kSSEFloat64Sub); |
| 951 | } |
| 952 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 953 | void InstructionSelector::VisitFloat64SubPreserveNan(Node* node) { |
| 954 | VisitRROFloat(this, node, kAVXFloat64Sub, kSSEFloat64Sub); |
| 955 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 956 | |
| 957 | void InstructionSelector::VisitFloat32Mul(Node* node) { |
| 958 | VisitRROFloat(this, node, kAVXFloat32Mul, kSSEFloat32Mul); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 959 | } |
| 960 | |
| 961 | |
| 962 | void InstructionSelector::VisitFloat64Mul(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 963 | VisitRROFloat(this, node, kAVXFloat64Mul, kSSEFloat64Mul); |
| 964 | } |
| 965 | |
| 966 | |
| 967 | void InstructionSelector::VisitFloat32Div(Node* node) { |
| 968 | VisitRROFloat(this, node, kAVXFloat32Div, kSSEFloat32Div); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 969 | } |
| 970 | |
| 971 | |
| 972 | void InstructionSelector::VisitFloat64Div(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 973 | VisitRROFloat(this, node, kAVXFloat64Div, kSSEFloat64Div); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 974 | } |
| 975 | |
| 976 | |
| 977 | void InstructionSelector::VisitFloat64Mod(Node* node) { |
| 978 | IA32OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 979 | InstructionOperand temps[] = {g.TempRegister(eax)}; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 980 | Emit(kSSEFloat64Mod, g.DefineSameAsFirst(node), |
| 981 | g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)), 1, |
| 982 | temps); |
| 983 | } |
| 984 | |
| 985 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 986 | void InstructionSelector::VisitFloat32Max(Node* node) { |
| 987 | VisitRROFloat(this, node, kAVXFloat32Max, kSSEFloat32Max); |
| 988 | } |
| 989 | |
| 990 | |
| 991 | void InstructionSelector::VisitFloat64Max(Node* node) { |
| 992 | VisitRROFloat(this, node, kAVXFloat64Max, kSSEFloat64Max); |
| 993 | } |
| 994 | |
| 995 | |
| 996 | void InstructionSelector::VisitFloat32Min(Node* node) { |
| 997 | VisitRROFloat(this, node, kAVXFloat32Min, kSSEFloat32Min); |
| 998 | } |
| 999 | |
| 1000 | |
| 1001 | void InstructionSelector::VisitFloat64Min(Node* node) { |
| 1002 | VisitRROFloat(this, node, kAVXFloat64Min, kSSEFloat64Min); |
| 1003 | } |
| 1004 | |
| 1005 | |
| 1006 | void InstructionSelector::VisitFloat32Abs(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1007 | IA32OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1008 | VisitFloatUnop(this, node, node->InputAt(0), kAVXFloat32Abs, kSSEFloat32Abs); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1009 | } |
| 1010 | |
| 1011 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1012 | void InstructionSelector::VisitFloat64Abs(Node* node) { |
| 1013 | IA32OperandGenerator g(this); |
| 1014 | VisitFloatUnop(this, node, node->InputAt(0), kAVXFloat64Abs, kSSEFloat64Abs); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1015 | } |
| 1016 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1017 | void InstructionSelector::VisitFloat32Sqrt(Node* node) { |
| 1018 | VisitRO(this, node, kSSEFloat32Sqrt); |
| 1019 | } |
| 1020 | |
| 1021 | |
| 1022 | void InstructionSelector::VisitFloat64Sqrt(Node* node) { |
| 1023 | VisitRO(this, node, kSSEFloat64Sqrt); |
| 1024 | } |
| 1025 | |
| 1026 | |
| 1027 | void InstructionSelector::VisitFloat32RoundDown(Node* node) { |
| 1028 | VisitRR(this, node, kSSEFloat32Round | MiscField::encode(kRoundDown)); |
| 1029 | } |
| 1030 | |
| 1031 | |
| 1032 | void InstructionSelector::VisitFloat64RoundDown(Node* node) { |
| 1033 | VisitRR(this, node, kSSEFloat64Round | MiscField::encode(kRoundDown)); |
| 1034 | } |
| 1035 | |
| 1036 | |
| 1037 | void InstructionSelector::VisitFloat32RoundUp(Node* node) { |
| 1038 | VisitRR(this, node, kSSEFloat32Round | MiscField::encode(kRoundUp)); |
| 1039 | } |
| 1040 | |
| 1041 | |
| 1042 | void InstructionSelector::VisitFloat64RoundUp(Node* node) { |
| 1043 | VisitRR(this, node, kSSEFloat64Round | MiscField::encode(kRoundUp)); |
| 1044 | } |
| 1045 | |
| 1046 | |
| 1047 | void InstructionSelector::VisitFloat32RoundTruncate(Node* node) { |
| 1048 | VisitRR(this, node, kSSEFloat32Round | MiscField::encode(kRoundToZero)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1049 | } |
| 1050 | |
| 1051 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1052 | void InstructionSelector::VisitFloat64RoundTruncate(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1053 | VisitRR(this, node, kSSEFloat64Round | MiscField::encode(kRoundToZero)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1054 | } |
| 1055 | |
| 1056 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1057 | void InstructionSelector::VisitFloat64RoundTiesAway(Node* node) { |
| 1058 | UNREACHABLE(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1059 | } |
| 1060 | |
| 1061 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1062 | void InstructionSelector::VisitFloat32RoundTiesEven(Node* node) { |
| 1063 | VisitRR(this, node, kSSEFloat32Round | MiscField::encode(kRoundToNearest)); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1064 | } |
| 1065 | |
| 1066 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1067 | void InstructionSelector::VisitFloat64RoundTiesEven(Node* node) { |
| 1068 | VisitRR(this, node, kSSEFloat64Round | MiscField::encode(kRoundToNearest)); |
| 1069 | } |
| 1070 | |
Ben Murdoch | 61f157c | 2016-09-16 13:49:30 +0100 | [diff] [blame] | 1071 | void InstructionSelector::VisitFloat32Neg(Node* node) { UNREACHABLE(); } |
| 1072 | |
| 1073 | void InstructionSelector::VisitFloat64Neg(Node* node) { UNREACHABLE(); } |
| 1074 | |
| 1075 | void InstructionSelector::VisitFloat64Ieee754Binop(Node* node, |
| 1076 | InstructionCode opcode) { |
| 1077 | IA32OperandGenerator g(this); |
| 1078 | Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)), |
| 1079 | g.UseRegister(node->InputAt(1))) |
| 1080 | ->MarkAsCall(); |
| 1081 | } |
| 1082 | |
| 1083 | void InstructionSelector::VisitFloat64Ieee754Unop(Node* node, |
| 1084 | InstructionCode opcode) { |
| 1085 | IA32OperandGenerator g(this); |
| 1086 | Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0))) |
| 1087 | ->MarkAsCall(); |
| 1088 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1089 | |
| 1090 | void InstructionSelector::EmitPrepareArguments( |
| 1091 | ZoneVector<PushParameter>* arguments, const CallDescriptor* descriptor, |
| 1092 | Node* node) { |
| 1093 | IA32OperandGenerator g(this); |
| 1094 | |
| 1095 | // Prepare for C function call. |
| 1096 | if (descriptor->IsCFunctionCall()) { |
| 1097 | InstructionOperand temps[] = {g.TempRegister()}; |
| 1098 | size_t const temp_count = arraysize(temps); |
| 1099 | Emit(kArchPrepareCallCFunction | |
| 1100 | MiscField::encode(static_cast<int>(descriptor->CParameterCount())), |
| 1101 | 0, nullptr, 0, nullptr, temp_count, temps); |
| 1102 | |
| 1103 | // Poke any stack arguments. |
| 1104 | for (size_t n = 0; n < arguments->size(); ++n) { |
| 1105 | PushParameter input = (*arguments)[n]; |
| 1106 | if (input.node()) { |
| 1107 | int const slot = static_cast<int>(n); |
| 1108 | InstructionOperand value = g.CanBeImmediate(node) |
| 1109 | ? g.UseImmediate(input.node()) |
| 1110 | : g.UseRegister(input.node()); |
| 1111 | Emit(kIA32Poke | MiscField::encode(slot), g.NoOutput(), value); |
| 1112 | } |
| 1113 | } |
| 1114 | } else { |
| 1115 | // Push any stack arguments. |
| 1116 | for (PushParameter input : base::Reversed(*arguments)) { |
| 1117 | // Skip any alignment holes in pushed nodes. |
| 1118 | if (input.node() == nullptr) continue; |
| 1119 | InstructionOperand value = |
| 1120 | g.CanBeImmediate(input.node()) |
| 1121 | ? g.UseImmediate(input.node()) |
| 1122 | : IsSupported(ATOM) || |
Ben Murdoch | 61f157c | 2016-09-16 13:49:30 +0100 | [diff] [blame] | 1123 | sequence()->IsFP(GetVirtualRegister(input.node())) |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1124 | ? g.UseRegister(input.node()) |
| 1125 | : g.Use(input.node()); |
| 1126 | if (input.type() == MachineType::Float32()) { |
| 1127 | Emit(kIA32PushFloat32, g.NoOutput(), value); |
| 1128 | } else if (input.type() == MachineType::Float64()) { |
| 1129 | Emit(kIA32PushFloat64, g.NoOutput(), value); |
| 1130 | } else { |
| 1131 | Emit(kIA32Push, g.NoOutput(), value); |
| 1132 | } |
| 1133 | } |
| 1134 | } |
| 1135 | } |
| 1136 | |
| 1137 | |
| 1138 | bool InstructionSelector::IsTailCallAddressImmediate() { return true; } |
| 1139 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1140 | int InstructionSelector::GetTempsCountForTailCallFromJSFunction() { return 0; } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1141 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1142 | namespace { |
| 1143 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1144 | void VisitCompareWithMemoryOperand(InstructionSelector* selector, |
| 1145 | InstructionCode opcode, Node* left, |
| 1146 | InstructionOperand right, |
| 1147 | FlagsContinuation* cont) { |
| 1148 | DCHECK(left->opcode() == IrOpcode::kLoad); |
| 1149 | IA32OperandGenerator g(selector); |
| 1150 | size_t input_count = 0; |
| 1151 | InstructionOperand inputs[6]; |
| 1152 | AddressingMode addressing_mode = |
| 1153 | g.GetEffectiveAddressMemoryOperand(left, inputs, &input_count); |
| 1154 | opcode |= AddressingModeField::encode(addressing_mode); |
| 1155 | opcode = cont->Encode(opcode); |
| 1156 | inputs[input_count++] = right; |
| 1157 | |
| 1158 | if (cont->IsBranch()) { |
| 1159 | inputs[input_count++] = g.Label(cont->true_block()); |
| 1160 | inputs[input_count++] = g.Label(cont->false_block()); |
| 1161 | selector->Emit(opcode, 0, nullptr, input_count, inputs); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1162 | } else if (cont->IsDeoptimize()) { |
| 1163 | selector->EmitDeoptimize(opcode, 0, nullptr, input_count, inputs, |
| 1164 | cont->frame_state()); |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1165 | } else { |
| 1166 | DCHECK(cont->IsSet()); |
| 1167 | InstructionOperand output = g.DefineAsRegister(cont->result()); |
| 1168 | selector->Emit(opcode, 1, &output, input_count, inputs); |
| 1169 | } |
| 1170 | } |
| 1171 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1172 | // Shared routine for multiple compare operations. |
| 1173 | void VisitCompare(InstructionSelector* selector, InstructionCode opcode, |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1174 | InstructionOperand left, InstructionOperand right, |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1175 | FlagsContinuation* cont) { |
| 1176 | IA32OperandGenerator g(selector); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1177 | opcode = cont->Encode(opcode); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1178 | if (cont->IsBranch()) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1179 | selector->Emit(opcode, g.NoOutput(), left, right, |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1180 | g.Label(cont->true_block()), g.Label(cont->false_block())); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1181 | } else if (cont->IsDeoptimize()) { |
| 1182 | selector->EmitDeoptimize(opcode, g.NoOutput(), left, right, |
| 1183 | cont->frame_state()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1184 | } else { |
| 1185 | DCHECK(cont->IsSet()); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1186 | selector->Emit(opcode, g.DefineAsByteRegister(cont->result()), left, right); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1187 | } |
| 1188 | } |
| 1189 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1190 | |
| 1191 | // Shared routine for multiple compare operations. |
| 1192 | void VisitCompare(InstructionSelector* selector, InstructionCode opcode, |
| 1193 | Node* left, Node* right, FlagsContinuation* cont, |
| 1194 | bool commutative) { |
| 1195 | IA32OperandGenerator g(selector); |
| 1196 | if (commutative && g.CanBeBetterLeftOperand(right)) { |
| 1197 | std::swap(left, right); |
| 1198 | } |
| 1199 | VisitCompare(selector, opcode, g.UseRegister(left), g.Use(right), cont); |
| 1200 | } |
| 1201 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1202 | // Tries to match the size of the given opcode to that of the operands, if |
| 1203 | // possible. |
| 1204 | InstructionCode TryNarrowOpcodeSize(InstructionCode opcode, Node* left, |
| 1205 | Node* right) { |
| 1206 | if (opcode != kIA32Cmp && opcode != kIA32Test) { |
| 1207 | return opcode; |
| 1208 | } |
| 1209 | // Currently, if one of the two operands is not a Load, we don't know what its |
| 1210 | // machine representation is, so we bail out. |
| 1211 | // TODO(epertoso): we can probably get some size information out of immediates |
| 1212 | // and phi nodes. |
| 1213 | if (left->opcode() != IrOpcode::kLoad || right->opcode() != IrOpcode::kLoad) { |
| 1214 | return opcode; |
| 1215 | } |
| 1216 | // If the load representations don't match, both operands will be |
| 1217 | // zero/sign-extended to 32bit. |
| 1218 | LoadRepresentation left_representation = LoadRepresentationOf(left->op()); |
| 1219 | if (left_representation != LoadRepresentationOf(right->op())) { |
| 1220 | return opcode; |
| 1221 | } |
| 1222 | switch (left_representation.representation()) { |
| 1223 | case MachineRepresentation::kBit: |
| 1224 | case MachineRepresentation::kWord8: |
| 1225 | return opcode == kIA32Cmp ? kIA32Cmp8 : kIA32Test8; |
| 1226 | case MachineRepresentation::kWord16: |
| 1227 | return opcode == kIA32Cmp ? kIA32Cmp16 : kIA32Test16; |
| 1228 | default: |
| 1229 | return opcode; |
| 1230 | } |
| 1231 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1232 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1233 | // Shared routine for multiple float32 compare operations (inputs commuted). |
| 1234 | void VisitFloat32Compare(InstructionSelector* selector, Node* node, |
| 1235 | FlagsContinuation* cont) { |
| 1236 | Node* const left = node->InputAt(0); |
| 1237 | Node* const right = node->InputAt(1); |
| 1238 | VisitCompare(selector, kSSEFloat32Cmp, right, left, cont, false); |
| 1239 | } |
| 1240 | |
| 1241 | |
| 1242 | // Shared routine for multiple float64 compare operations (inputs commuted). |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1243 | void VisitFloat64Compare(InstructionSelector* selector, Node* node, |
| 1244 | FlagsContinuation* cont) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1245 | Node* const left = node->InputAt(0); |
| 1246 | Node* const right = node->InputAt(1); |
| 1247 | VisitCompare(selector, kSSEFloat64Cmp, right, left, cont, false); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1248 | } |
| 1249 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1250 | // Shared routine for multiple word compare operations. |
| 1251 | void VisitWordCompare(InstructionSelector* selector, Node* node, |
| 1252 | InstructionCode opcode, FlagsContinuation* cont) { |
| 1253 | IA32OperandGenerator g(selector); |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1254 | Node* left = node->InputAt(0); |
| 1255 | Node* right = node->InputAt(1); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1256 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1257 | InstructionCode narrowed_opcode = TryNarrowOpcodeSize(opcode, left, right); |
| 1258 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 1259 | int effect_level = selector->GetEffectLevel(node); |
| 1260 | if (cont->IsBranch()) { |
| 1261 | effect_level = selector->GetEffectLevel( |
| 1262 | cont->true_block()->PredecessorAt(0)->control_input()); |
| 1263 | } |
| 1264 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1265 | // If one of the two inputs is an immediate, make sure it's on the right, or |
| 1266 | // if one of the two inputs is a memory operand, make sure it's on the left. |
| 1267 | if ((!g.CanBeImmediate(right) && g.CanBeImmediate(left)) || |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 1268 | (g.CanBeMemoryOperand(narrowed_opcode, node, right, effect_level) && |
| 1269 | !g.CanBeMemoryOperand(narrowed_opcode, node, left, effect_level))) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1270 | if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute(); |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1271 | std::swap(left, right); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1272 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1273 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1274 | // Match immediates on right side of comparison. |
| 1275 | if (g.CanBeImmediate(right)) { |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 1276 | if (g.CanBeMemoryOperand(opcode, node, left, effect_level)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1277 | // TODO(epertoso): we should use `narrowed_opcode' here once we match |
| 1278 | // immediates too. |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1279 | return VisitCompareWithMemoryOperand(selector, opcode, left, |
| 1280 | g.UseImmediate(right), cont); |
| 1281 | } |
| 1282 | return VisitCompare(selector, opcode, g.Use(left), g.UseImmediate(right), |
| 1283 | cont); |
| 1284 | } |
| 1285 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1286 | // Match memory operands on left side of comparison. |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 1287 | if (g.CanBeMemoryOperand(narrowed_opcode, node, left, effect_level)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1288 | bool needs_byte_register = |
| 1289 | narrowed_opcode == kIA32Test8 || narrowed_opcode == kIA32Cmp8; |
| 1290 | return VisitCompareWithMemoryOperand( |
| 1291 | selector, narrowed_opcode, left, |
| 1292 | needs_byte_register ? g.UseByteRegister(right) : g.UseRegister(right), |
| 1293 | cont); |
| 1294 | } |
| 1295 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1296 | if (g.CanBeBetterLeftOperand(right)) { |
| 1297 | if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute(); |
| 1298 | std::swap(left, right); |
| 1299 | } |
| 1300 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1301 | return VisitCompare(selector, opcode, left, right, cont, |
| 1302 | node->op()->HasProperty(Operator::kCommutative)); |
| 1303 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1304 | |
| 1305 | void VisitWordCompare(InstructionSelector* selector, Node* node, |
| 1306 | FlagsContinuation* cont) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1307 | IA32OperandGenerator g(selector); |
| 1308 | Int32BinopMatcher m(node); |
| 1309 | if (m.left().IsLoad() && m.right().IsLoadStackPointer()) { |
| 1310 | LoadMatcher<ExternalReferenceMatcher> mleft(m.left().node()); |
| 1311 | ExternalReference js_stack_limit = |
| 1312 | ExternalReference::address_of_stack_limit(selector->isolate()); |
| 1313 | if (mleft.object().Is(js_stack_limit) && mleft.index().Is(0)) { |
| 1314 | // Compare(Load(js_stack_limit), LoadStackPointer) |
| 1315 | if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute(); |
| 1316 | InstructionCode opcode = cont->Encode(kIA32StackCheck); |
| 1317 | if (cont->IsBranch()) { |
| 1318 | selector->Emit(opcode, g.NoOutput(), g.Label(cont->true_block()), |
| 1319 | g.Label(cont->false_block())); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1320 | } else if (cont->IsDeoptimize()) { |
| 1321 | selector->EmitDeoptimize(opcode, 0, nullptr, 0, nullptr, |
| 1322 | cont->frame_state()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1323 | } else { |
| 1324 | DCHECK(cont->IsSet()); |
| 1325 | selector->Emit(opcode, g.DefineAsRegister(cont->result())); |
| 1326 | } |
| 1327 | return; |
| 1328 | } |
| 1329 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1330 | VisitWordCompare(selector, node, kIA32Cmp, cont); |
| 1331 | } |
| 1332 | |
| 1333 | |
| 1334 | // Shared routine for word comparison with zero. |
| 1335 | void VisitWordCompareZero(InstructionSelector* selector, Node* user, |
| 1336 | Node* value, FlagsContinuation* cont) { |
| 1337 | // Try to combine the branch with a comparison. |
| 1338 | while (selector->CanCover(user, value)) { |
| 1339 | switch (value->opcode()) { |
| 1340 | case IrOpcode::kWord32Equal: { |
| 1341 | // Try to combine with comparisons against 0 by simply inverting the |
| 1342 | // continuation. |
| 1343 | Int32BinopMatcher m(value); |
| 1344 | if (m.right().Is(0)) { |
| 1345 | user = value; |
| 1346 | value = m.left().node(); |
| 1347 | cont->Negate(); |
| 1348 | continue; |
| 1349 | } |
| 1350 | cont->OverwriteAndNegateIfEqual(kEqual); |
| 1351 | return VisitWordCompare(selector, value, cont); |
| 1352 | } |
| 1353 | case IrOpcode::kInt32LessThan: |
| 1354 | cont->OverwriteAndNegateIfEqual(kSignedLessThan); |
| 1355 | return VisitWordCompare(selector, value, cont); |
| 1356 | case IrOpcode::kInt32LessThanOrEqual: |
| 1357 | cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual); |
| 1358 | return VisitWordCompare(selector, value, cont); |
| 1359 | case IrOpcode::kUint32LessThan: |
| 1360 | cont->OverwriteAndNegateIfEqual(kUnsignedLessThan); |
| 1361 | return VisitWordCompare(selector, value, cont); |
| 1362 | case IrOpcode::kUint32LessThanOrEqual: |
| 1363 | cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual); |
| 1364 | return VisitWordCompare(selector, value, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1365 | case IrOpcode::kFloat32Equal: |
| 1366 | cont->OverwriteAndNegateIfEqual(kUnorderedEqual); |
| 1367 | return VisitFloat32Compare(selector, value, cont); |
| 1368 | case IrOpcode::kFloat32LessThan: |
| 1369 | cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThan); |
| 1370 | return VisitFloat32Compare(selector, value, cont); |
| 1371 | case IrOpcode::kFloat32LessThanOrEqual: |
| 1372 | cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThanOrEqual); |
| 1373 | return VisitFloat32Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1374 | case IrOpcode::kFloat64Equal: |
| 1375 | cont->OverwriteAndNegateIfEqual(kUnorderedEqual); |
| 1376 | return VisitFloat64Compare(selector, value, cont); |
| 1377 | case IrOpcode::kFloat64LessThan: |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1378 | cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThan); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1379 | return VisitFloat64Compare(selector, value, cont); |
| 1380 | case IrOpcode::kFloat64LessThanOrEqual: |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1381 | cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThanOrEqual); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1382 | return VisitFloat64Compare(selector, value, cont); |
| 1383 | case IrOpcode::kProjection: |
| 1384 | // Check if this is the overflow output projection of an |
| 1385 | // <Operation>WithOverflow node. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1386 | if (ProjectionIndexOf(value->op()) == 1u) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1387 | // We cannot combine the <Operation>WithOverflow with this branch |
| 1388 | // unless the 0th projection (the use of the actual value of the |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1389 | // <Operation> is either nullptr, which means there's no use of the |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1390 | // actual value, or was already defined, which means it is scheduled |
| 1391 | // *AFTER* this branch). |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1392 | Node* const node = value->InputAt(0); |
| 1393 | Node* const result = NodeProperties::FindProjection(node, 0); |
| 1394 | if (result == nullptr || selector->IsDefined(result)) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1395 | switch (node->opcode()) { |
| 1396 | case IrOpcode::kInt32AddWithOverflow: |
| 1397 | cont->OverwriteAndNegateIfEqual(kOverflow); |
| 1398 | return VisitBinop(selector, node, kIA32Add, cont); |
| 1399 | case IrOpcode::kInt32SubWithOverflow: |
| 1400 | cont->OverwriteAndNegateIfEqual(kOverflow); |
| 1401 | return VisitBinop(selector, node, kIA32Sub, cont); |
| 1402 | default: |
| 1403 | break; |
| 1404 | } |
| 1405 | } |
| 1406 | } |
| 1407 | break; |
| 1408 | case IrOpcode::kInt32Sub: |
| 1409 | return VisitWordCompare(selector, value, cont); |
| 1410 | case IrOpcode::kWord32And: |
| 1411 | return VisitWordCompare(selector, value, kIA32Test, cont); |
| 1412 | default: |
| 1413 | break; |
| 1414 | } |
| 1415 | break; |
| 1416 | } |
| 1417 | |
| 1418 | // Continuation could not be combined with a compare, emit compare against 0. |
| 1419 | IA32OperandGenerator g(selector); |
| 1420 | VisitCompare(selector, kIA32Cmp, g.Use(value), g.TempImmediate(0), cont); |
| 1421 | } |
| 1422 | |
| 1423 | } // namespace |
| 1424 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1425 | void InstructionSelector::VisitBranch(Node* branch, BasicBlock* tbranch, |
| 1426 | BasicBlock* fbranch) { |
| 1427 | FlagsContinuation cont(kNotEqual, tbranch, fbranch); |
| 1428 | VisitWordCompareZero(this, branch, branch->InputAt(0), &cont); |
| 1429 | } |
| 1430 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1431 | void InstructionSelector::VisitDeoptimizeIf(Node* node) { |
| 1432 | FlagsContinuation cont = |
| 1433 | FlagsContinuation::ForDeoptimize(kNotEqual, node->InputAt(1)); |
| 1434 | VisitWordCompareZero(this, node, node->InputAt(0), &cont); |
| 1435 | } |
| 1436 | |
| 1437 | void InstructionSelector::VisitDeoptimizeUnless(Node* node) { |
| 1438 | FlagsContinuation cont = |
| 1439 | FlagsContinuation::ForDeoptimize(kEqual, node->InputAt(1)); |
| 1440 | VisitWordCompareZero(this, node, node->InputAt(0), &cont); |
| 1441 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1442 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1443 | void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) { |
| 1444 | IA32OperandGenerator g(this); |
| 1445 | InstructionOperand value_operand = g.UseRegister(node->InputAt(0)); |
| 1446 | |
| 1447 | // Emit either ArchTableSwitch or ArchLookupSwitch. |
| 1448 | size_t table_space_cost = 4 + sw.value_range; |
| 1449 | size_t table_time_cost = 3; |
| 1450 | size_t lookup_space_cost = 3 + 2 * sw.case_count; |
| 1451 | size_t lookup_time_cost = sw.case_count; |
| 1452 | if (sw.case_count > 4 && |
| 1453 | table_space_cost + 3 * table_time_cost <= |
| 1454 | lookup_space_cost + 3 * lookup_time_cost && |
| 1455 | sw.min_value > std::numeric_limits<int32_t>::min()) { |
| 1456 | InstructionOperand index_operand = value_operand; |
| 1457 | if (sw.min_value) { |
| 1458 | index_operand = g.TempRegister(); |
| 1459 | Emit(kIA32Lea | AddressingModeField::encode(kMode_MRI), index_operand, |
| 1460 | value_operand, g.TempImmediate(-sw.min_value)); |
| 1461 | } |
| 1462 | // Generate a table lookup. |
| 1463 | return EmitTableSwitch(sw, index_operand); |
| 1464 | } |
| 1465 | |
| 1466 | // Generate a sequence of conditional jumps. |
| 1467 | return EmitLookupSwitch(sw, value_operand); |
| 1468 | } |
| 1469 | |
| 1470 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1471 | void InstructionSelector::VisitWord32Equal(Node* const node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1472 | FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1473 | Int32BinopMatcher m(node); |
| 1474 | if (m.right().Is(0)) { |
| 1475 | return VisitWordCompareZero(this, m.node(), m.left().node(), &cont); |
| 1476 | } |
| 1477 | VisitWordCompare(this, node, &cont); |
| 1478 | } |
| 1479 | |
| 1480 | |
| 1481 | void InstructionSelector::VisitInt32LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1482 | FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1483 | VisitWordCompare(this, node, &cont); |
| 1484 | } |
| 1485 | |
| 1486 | |
| 1487 | void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1488 | FlagsContinuation cont = |
| 1489 | FlagsContinuation::ForSet(kSignedLessThanOrEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1490 | VisitWordCompare(this, node, &cont); |
| 1491 | } |
| 1492 | |
| 1493 | |
| 1494 | void InstructionSelector::VisitUint32LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1495 | FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1496 | VisitWordCompare(this, node, &cont); |
| 1497 | } |
| 1498 | |
| 1499 | |
| 1500 | void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1501 | FlagsContinuation cont = |
| 1502 | FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1503 | VisitWordCompare(this, node, &cont); |
| 1504 | } |
| 1505 | |
| 1506 | |
| 1507 | void InstructionSelector::VisitInt32AddWithOverflow(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1508 | if (Node* ovf = NodeProperties::FindProjection(node, 1)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1509 | FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1510 | return VisitBinop(this, node, kIA32Add, &cont); |
| 1511 | } |
| 1512 | FlagsContinuation cont; |
| 1513 | VisitBinop(this, node, kIA32Add, &cont); |
| 1514 | } |
| 1515 | |
| 1516 | |
| 1517 | void InstructionSelector::VisitInt32SubWithOverflow(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1518 | if (Node* ovf = NodeProperties::FindProjection(node, 1)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1519 | FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1520 | return VisitBinop(this, node, kIA32Sub, &cont); |
| 1521 | } |
| 1522 | FlagsContinuation cont; |
| 1523 | VisitBinop(this, node, kIA32Sub, &cont); |
| 1524 | } |
| 1525 | |
| 1526 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1527 | void InstructionSelector::VisitFloat32Equal(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1528 | FlagsContinuation cont = FlagsContinuation::ForSet(kUnorderedEqual, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1529 | VisitFloat32Compare(this, node, &cont); |
| 1530 | } |
| 1531 | |
| 1532 | |
| 1533 | void InstructionSelector::VisitFloat32LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1534 | FlagsContinuation cont = |
| 1535 | FlagsContinuation::ForSet(kUnsignedGreaterThan, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1536 | VisitFloat32Compare(this, node, &cont); |
| 1537 | } |
| 1538 | |
| 1539 | |
| 1540 | void InstructionSelector::VisitFloat32LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1541 | FlagsContinuation cont = |
| 1542 | FlagsContinuation::ForSet(kUnsignedGreaterThanOrEqual, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1543 | VisitFloat32Compare(this, node, &cont); |
| 1544 | } |
| 1545 | |
| 1546 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1547 | void InstructionSelector::VisitFloat64Equal(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1548 | FlagsContinuation cont = FlagsContinuation::ForSet(kUnorderedEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1549 | VisitFloat64Compare(this, node, &cont); |
| 1550 | } |
| 1551 | |
| 1552 | |
| 1553 | void InstructionSelector::VisitFloat64LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1554 | FlagsContinuation cont = |
| 1555 | FlagsContinuation::ForSet(kUnsignedGreaterThan, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1556 | VisitFloat64Compare(this, node, &cont); |
| 1557 | } |
| 1558 | |
| 1559 | |
| 1560 | void InstructionSelector::VisitFloat64LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1561 | FlagsContinuation cont = |
| 1562 | FlagsContinuation::ForSet(kUnsignedGreaterThanOrEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1563 | VisitFloat64Compare(this, node, &cont); |
| 1564 | } |
| 1565 | |
| 1566 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1567 | void InstructionSelector::VisitFloat64ExtractLowWord32(Node* node) { |
| 1568 | IA32OperandGenerator g(this); |
| 1569 | Emit(kSSEFloat64ExtractLowWord32, g.DefineAsRegister(node), |
| 1570 | g.Use(node->InputAt(0))); |
| 1571 | } |
| 1572 | |
| 1573 | |
| 1574 | void InstructionSelector::VisitFloat64ExtractHighWord32(Node* node) { |
| 1575 | IA32OperandGenerator g(this); |
| 1576 | Emit(kSSEFloat64ExtractHighWord32, g.DefineAsRegister(node), |
| 1577 | g.Use(node->InputAt(0))); |
| 1578 | } |
| 1579 | |
| 1580 | |
| 1581 | void InstructionSelector::VisitFloat64InsertLowWord32(Node* node) { |
| 1582 | IA32OperandGenerator g(this); |
| 1583 | Node* left = node->InputAt(0); |
| 1584 | Node* right = node->InputAt(1); |
| 1585 | Float64Matcher mleft(left); |
| 1586 | if (mleft.HasValue() && (bit_cast<uint64_t>(mleft.Value()) >> 32) == 0u) { |
| 1587 | Emit(kSSEFloat64LoadLowWord32, g.DefineAsRegister(node), g.Use(right)); |
| 1588 | return; |
| 1589 | } |
| 1590 | Emit(kSSEFloat64InsertLowWord32, g.DefineSameAsFirst(node), |
| 1591 | g.UseRegister(left), g.Use(right)); |
| 1592 | } |
| 1593 | |
| 1594 | |
| 1595 | void InstructionSelector::VisitFloat64InsertHighWord32(Node* node) { |
| 1596 | IA32OperandGenerator g(this); |
| 1597 | Node* left = node->InputAt(0); |
| 1598 | Node* right = node->InputAt(1); |
| 1599 | Emit(kSSEFloat64InsertHighWord32, g.DefineSameAsFirst(node), |
| 1600 | g.UseRegister(left), g.Use(right)); |
| 1601 | } |
| 1602 | |
Ben Murdoch | 61f157c | 2016-09-16 13:49:30 +0100 | [diff] [blame] | 1603 | void InstructionSelector::VisitFloat64SilenceNaN(Node* node) { |
| 1604 | IA32OperandGenerator g(this); |
| 1605 | Emit(kSSEFloat64SilenceNaN, g.DefineSameAsFirst(node), |
| 1606 | g.UseRegister(node->InputAt(0))); |
| 1607 | } |
| 1608 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 1609 | void InstructionSelector::VisitAtomicLoad(Node* node) { |
| 1610 | LoadRepresentation load_rep = LoadRepresentationOf(node->op()); |
| 1611 | DCHECK(load_rep.representation() == MachineRepresentation::kWord8 || |
| 1612 | load_rep.representation() == MachineRepresentation::kWord16 || |
| 1613 | load_rep.representation() == MachineRepresentation::kWord32); |
| 1614 | USE(load_rep); |
| 1615 | VisitLoad(node); |
| 1616 | } |
| 1617 | |
| 1618 | void InstructionSelector::VisitAtomicStore(Node* node) { |
| 1619 | IA32OperandGenerator g(this); |
| 1620 | Node* base = node->InputAt(0); |
| 1621 | Node* index = node->InputAt(1); |
| 1622 | Node* value = node->InputAt(2); |
| 1623 | |
| 1624 | MachineRepresentation rep = AtomicStoreRepresentationOf(node->op()); |
| 1625 | ArchOpcode opcode = kArchNop; |
| 1626 | switch (rep) { |
| 1627 | case MachineRepresentation::kWord8: |
| 1628 | opcode = kIA32Xchgb; |
| 1629 | break; |
| 1630 | case MachineRepresentation::kWord16: |
| 1631 | opcode = kIA32Xchgw; |
| 1632 | break; |
| 1633 | case MachineRepresentation::kWord32: |
| 1634 | opcode = kIA32Xchgl; |
| 1635 | break; |
| 1636 | default: |
| 1637 | UNREACHABLE(); |
| 1638 | break; |
| 1639 | } |
| 1640 | AddressingMode addressing_mode; |
| 1641 | InstructionOperand inputs[4]; |
| 1642 | size_t input_count = 0; |
| 1643 | inputs[input_count++] = g.UseUniqueRegister(base); |
| 1644 | if (g.CanBeImmediate(index)) { |
| 1645 | inputs[input_count++] = g.UseImmediate(index); |
| 1646 | addressing_mode = kMode_MRI; |
| 1647 | } else { |
| 1648 | inputs[input_count++] = g.UseUniqueRegister(index); |
| 1649 | addressing_mode = kMode_MR1; |
| 1650 | } |
| 1651 | inputs[input_count++] = g.UseUniqueRegister(value); |
| 1652 | InstructionCode code = opcode | AddressingModeField::encode(addressing_mode); |
| 1653 | Emit(code, 0, nullptr, input_count, inputs); |
| 1654 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1655 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1656 | // static |
| 1657 | MachineOperatorBuilder::Flags |
| 1658 | InstructionSelector::SupportedMachineOperatorFlags() { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1659 | MachineOperatorBuilder::Flags flags = |
| 1660 | MachineOperatorBuilder::kFloat32Max | |
| 1661 | MachineOperatorBuilder::kFloat32Min | |
| 1662 | MachineOperatorBuilder::kFloat64Max | |
| 1663 | MachineOperatorBuilder::kFloat64Min | |
| 1664 | MachineOperatorBuilder::kWord32ShiftIsSafe | |
| 1665 | MachineOperatorBuilder::kWord32Ctz; |
| 1666 | if (CpuFeatures::IsSupported(POPCNT)) { |
| 1667 | flags |= MachineOperatorBuilder::kWord32Popcnt; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1668 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1669 | if (CpuFeatures::IsSupported(SSE4_1)) { |
| 1670 | flags |= MachineOperatorBuilder::kFloat32RoundDown | |
| 1671 | MachineOperatorBuilder::kFloat64RoundDown | |
| 1672 | MachineOperatorBuilder::kFloat32RoundUp | |
| 1673 | MachineOperatorBuilder::kFloat64RoundUp | |
| 1674 | MachineOperatorBuilder::kFloat32RoundTruncate | |
| 1675 | MachineOperatorBuilder::kFloat64RoundTruncate | |
| 1676 | MachineOperatorBuilder::kFloat32RoundTiesEven | |
| 1677 | MachineOperatorBuilder::kFloat64RoundTiesEven; |
| 1678 | } |
| 1679 | return flags; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1680 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1681 | |
Ben Murdoch | 61f157c | 2016-09-16 13:49:30 +0100 | [diff] [blame] | 1682 | // static |
| 1683 | MachineOperatorBuilder::AlignmentRequirements |
| 1684 | InstructionSelector::AlignmentRequirements() { |
| 1685 | return MachineOperatorBuilder::AlignmentRequirements:: |
| 1686 | FullUnalignedAccessSupport(); |
| 1687 | } |
| 1688 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1689 | } // namespace compiler |
| 1690 | } // namespace internal |
| 1691 | } // namespace v8 |