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 | |
| 5 | #include "src/compiler/instruction-selector-impl.h" |
| 6 | #include "src/compiler/node-matchers.h" |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 7 | #include "src/compiler/node-properties.h" |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 8 | |
| 9 | namespace v8 { |
| 10 | namespace internal { |
| 11 | namespace compiler { |
| 12 | |
| 13 | enum ImmediateMode { |
| 14 | kArithmeticImm, // 12 bit unsigned immediate shifted left 0 or 12 bits |
| 15 | kShift32Imm, // 0 - 31 |
| 16 | kShift64Imm, // 0 - 63 |
| 17 | kLogical32Imm, |
| 18 | kLogical64Imm, |
| 19 | kLoadStoreImm8, // signed 8 bit or 12 bit unsigned scaled by access size |
| 20 | kLoadStoreImm16, |
| 21 | kLoadStoreImm32, |
| 22 | kLoadStoreImm64, |
| 23 | kNoImmediate |
| 24 | }; |
| 25 | |
| 26 | |
| 27 | // Adds Arm64-specific methods for generating operands. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 28 | class Arm64OperandGenerator final : public OperandGenerator { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 29 | public: |
| 30 | explicit Arm64OperandGenerator(InstructionSelector* selector) |
| 31 | : OperandGenerator(selector) {} |
| 32 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 33 | InstructionOperand UseOperand(Node* node, ImmediateMode mode) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 34 | if (CanBeImmediate(node, mode)) { |
| 35 | return UseImmediate(node); |
| 36 | } |
| 37 | return UseRegister(node); |
| 38 | } |
| 39 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 40 | // Use the zero register if the node has the immediate value zero, otherwise |
| 41 | // assign a register. |
| 42 | InstructionOperand UseRegisterOrImmediateZero(Node* node) { |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 43 | if ((IsIntegerConstant(node) && (GetIntegerConstantValue(node) == 0)) || |
| 44 | (IsFloatConstant(node) && |
| 45 | (bit_cast<int64_t>(GetFloatConstantValue(node)) == V8_INT64_C(0)))) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 46 | return UseImmediate(node); |
| 47 | } |
| 48 | return UseRegister(node); |
| 49 | } |
| 50 | |
| 51 | // Use the provided node if it has the required value, or create a |
| 52 | // TempImmediate otherwise. |
| 53 | InstructionOperand UseImmediateOrTemp(Node* node, int32_t value) { |
| 54 | if (GetIntegerConstantValue(node) == value) { |
| 55 | return UseImmediate(node); |
| 56 | } |
| 57 | return TempImmediate(value); |
| 58 | } |
| 59 | |
| 60 | bool IsIntegerConstant(Node* node) { |
| 61 | return (node->opcode() == IrOpcode::kInt32Constant) || |
| 62 | (node->opcode() == IrOpcode::kInt64Constant); |
| 63 | } |
| 64 | |
| 65 | int64_t GetIntegerConstantValue(Node* node) { |
| 66 | if (node->opcode() == IrOpcode::kInt32Constant) { |
| 67 | return OpParameter<int32_t>(node); |
| 68 | } |
| 69 | DCHECK(node->opcode() == IrOpcode::kInt64Constant); |
| 70 | return OpParameter<int64_t>(node); |
| 71 | } |
| 72 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 73 | bool IsFloatConstant(Node* node) { |
| 74 | return (node->opcode() == IrOpcode::kFloat32Constant) || |
| 75 | (node->opcode() == IrOpcode::kFloat64Constant); |
| 76 | } |
| 77 | |
| 78 | double GetFloatConstantValue(Node* node) { |
| 79 | if (node->opcode() == IrOpcode::kFloat32Constant) { |
| 80 | return OpParameter<float>(node); |
| 81 | } |
| 82 | DCHECK_EQ(IrOpcode::kFloat64Constant, node->opcode()); |
| 83 | return OpParameter<double>(node); |
| 84 | } |
| 85 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 86 | bool CanBeImmediate(Node* node, ImmediateMode mode) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 87 | return IsIntegerConstant(node) && |
| 88 | CanBeImmediate(GetIntegerConstantValue(node), mode); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 89 | } |
| 90 | |
| 91 | bool CanBeImmediate(int64_t value, ImmediateMode mode) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 92 | unsigned ignored; |
| 93 | switch (mode) { |
| 94 | case kLogical32Imm: |
| 95 | // TODO(dcarney): some unencodable values can be handled by |
| 96 | // switching instructions. |
| 97 | return Assembler::IsImmLogical(static_cast<uint64_t>(value), 32, |
| 98 | &ignored, &ignored, &ignored); |
| 99 | case kLogical64Imm: |
| 100 | return Assembler::IsImmLogical(static_cast<uint64_t>(value), 64, |
| 101 | &ignored, &ignored, &ignored); |
| 102 | case kArithmeticImm: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 103 | return Assembler::IsImmAddSub(value); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 104 | case kLoadStoreImm8: |
| 105 | return IsLoadStoreImmediate(value, LSByte); |
| 106 | case kLoadStoreImm16: |
| 107 | return IsLoadStoreImmediate(value, LSHalfword); |
| 108 | case kLoadStoreImm32: |
| 109 | return IsLoadStoreImmediate(value, LSWord); |
| 110 | case kLoadStoreImm64: |
| 111 | return IsLoadStoreImmediate(value, LSDoubleWord); |
| 112 | case kNoImmediate: |
| 113 | return false; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 114 | case kShift32Imm: // Fall through. |
| 115 | case kShift64Imm: |
| 116 | // Shift operations only observe the bottom 5 or 6 bits of the value. |
| 117 | // All possible shifts can be encoded by discarding bits which have no |
| 118 | // effect. |
| 119 | return true; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 120 | } |
| 121 | return false; |
| 122 | } |
| 123 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 124 | bool CanBeLoadStoreShiftImmediate(Node* node, MachineRepresentation rep) { |
| 125 | // TODO(arm64): Load and Store on 128 bit Q registers is not supported yet. |
| 126 | DCHECK_NE(MachineRepresentation::kSimd128, rep); |
| 127 | return IsIntegerConstant(node) && |
| 128 | (GetIntegerConstantValue(node) == ElementSizeLog2Of(rep)); |
| 129 | } |
| 130 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 131 | private: |
| 132 | bool IsLoadStoreImmediate(int64_t value, LSDataSize size) { |
| 133 | return Assembler::IsImmLSScaled(value, size) || |
| 134 | Assembler::IsImmLSUnscaled(value); |
| 135 | } |
| 136 | }; |
| 137 | |
| 138 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 139 | namespace { |
| 140 | |
| 141 | void VisitRR(InstructionSelector* selector, ArchOpcode opcode, Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 142 | Arm64OperandGenerator g(selector); |
| 143 | selector->Emit(opcode, g.DefineAsRegister(node), |
| 144 | g.UseRegister(node->InputAt(0))); |
| 145 | } |
| 146 | |
| 147 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 148 | void VisitRRR(InstructionSelector* selector, ArchOpcode opcode, Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 149 | Arm64OperandGenerator g(selector); |
| 150 | selector->Emit(opcode, g.DefineAsRegister(node), |
| 151 | g.UseRegister(node->InputAt(0)), |
| 152 | g.UseRegister(node->InputAt(1))); |
| 153 | } |
| 154 | |
| 155 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 156 | void VisitRRO(InstructionSelector* selector, ArchOpcode opcode, Node* node, |
| 157 | ImmediateMode operand_mode) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 158 | Arm64OperandGenerator g(selector); |
| 159 | selector->Emit(opcode, g.DefineAsRegister(node), |
| 160 | g.UseRegister(node->InputAt(0)), |
| 161 | g.UseOperand(node->InputAt(1), operand_mode)); |
| 162 | } |
| 163 | |
| 164 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 165 | bool TryMatchAnyShift(InstructionSelector* selector, Node* node, |
| 166 | Node* input_node, InstructionCode* opcode, bool try_ror) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 167 | Arm64OperandGenerator g(selector); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 168 | |
| 169 | if (!selector->CanCover(node, input_node)) return false; |
| 170 | if (input_node->InputCount() != 2) return false; |
| 171 | if (!g.IsIntegerConstant(input_node->InputAt(1))) return false; |
| 172 | |
| 173 | switch (input_node->opcode()) { |
| 174 | case IrOpcode::kWord32Shl: |
| 175 | case IrOpcode::kWord64Shl: |
| 176 | *opcode |= AddressingModeField::encode(kMode_Operand2_R_LSL_I); |
| 177 | return true; |
| 178 | case IrOpcode::kWord32Shr: |
| 179 | case IrOpcode::kWord64Shr: |
| 180 | *opcode |= AddressingModeField::encode(kMode_Operand2_R_LSR_I); |
| 181 | return true; |
| 182 | case IrOpcode::kWord32Sar: |
| 183 | case IrOpcode::kWord64Sar: |
| 184 | *opcode |= AddressingModeField::encode(kMode_Operand2_R_ASR_I); |
| 185 | return true; |
| 186 | case IrOpcode::kWord32Ror: |
| 187 | case IrOpcode::kWord64Ror: |
| 188 | if (try_ror) { |
| 189 | *opcode |= AddressingModeField::encode(kMode_Operand2_R_ROR_I); |
| 190 | return true; |
| 191 | } |
| 192 | return false; |
| 193 | default: |
| 194 | return false; |
| 195 | } |
| 196 | } |
| 197 | |
| 198 | |
| 199 | bool TryMatchAnyExtend(Arm64OperandGenerator* g, InstructionSelector* selector, |
| 200 | Node* node, Node* left_node, Node* right_node, |
| 201 | InstructionOperand* left_op, |
| 202 | InstructionOperand* right_op, InstructionCode* opcode) { |
| 203 | if (!selector->CanCover(node, right_node)) return false; |
| 204 | |
| 205 | NodeMatcher nm(right_node); |
| 206 | |
| 207 | if (nm.IsWord32And()) { |
| 208 | Int32BinopMatcher mright(right_node); |
| 209 | if (mright.right().Is(0xff) || mright.right().Is(0xffff)) { |
| 210 | int32_t mask = mright.right().Value(); |
| 211 | *left_op = g->UseRegister(left_node); |
| 212 | *right_op = g->UseRegister(mright.left().node()); |
| 213 | *opcode |= AddressingModeField::encode( |
| 214 | (mask == 0xff) ? kMode_Operand2_R_UXTB : kMode_Operand2_R_UXTH); |
| 215 | return true; |
| 216 | } |
| 217 | } else if (nm.IsWord32Sar()) { |
| 218 | Int32BinopMatcher mright(right_node); |
| 219 | if (selector->CanCover(mright.node(), mright.left().node()) && |
| 220 | mright.left().IsWord32Shl()) { |
| 221 | Int32BinopMatcher mleft_of_right(mright.left().node()); |
| 222 | if ((mright.right().Is(16) && mleft_of_right.right().Is(16)) || |
| 223 | (mright.right().Is(24) && mleft_of_right.right().Is(24))) { |
| 224 | int32_t shift = mright.right().Value(); |
| 225 | *left_op = g->UseRegister(left_node); |
| 226 | *right_op = g->UseRegister(mleft_of_right.left().node()); |
| 227 | *opcode |= AddressingModeField::encode( |
| 228 | (shift == 24) ? kMode_Operand2_R_SXTB : kMode_Operand2_R_SXTH); |
| 229 | return true; |
| 230 | } |
| 231 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 232 | } |
| 233 | return false; |
| 234 | } |
| 235 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 236 | bool TryMatchLoadStoreShift(Arm64OperandGenerator* g, |
| 237 | InstructionSelector* selector, |
| 238 | MachineRepresentation rep, Node* node, Node* index, |
| 239 | InstructionOperand* index_op, |
| 240 | InstructionOperand* shift_immediate_op) { |
| 241 | if (!selector->CanCover(node, index)) return false; |
| 242 | if (index->InputCount() != 2) return false; |
| 243 | Node* left = index->InputAt(0); |
| 244 | Node* right = index->InputAt(1); |
| 245 | switch (index->opcode()) { |
| 246 | case IrOpcode::kWord32Shl: |
| 247 | case IrOpcode::kWord64Shl: |
| 248 | if (!g->CanBeLoadStoreShiftImmediate(right, rep)) { |
| 249 | return false; |
| 250 | } |
| 251 | *index_op = g->UseRegister(left); |
| 252 | *shift_immediate_op = g->UseImmediate(right); |
| 253 | return true; |
| 254 | default: |
| 255 | return false; |
| 256 | } |
| 257 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 258 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 259 | // Shared routine for multiple binary operations. |
| 260 | template <typename Matcher> |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 261 | void VisitBinop(InstructionSelector* selector, Node* node, |
| 262 | InstructionCode opcode, ImmediateMode operand_mode, |
| 263 | FlagsContinuation* cont) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 264 | Arm64OperandGenerator g(selector); |
| 265 | Matcher m(node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 266 | InstructionOperand inputs[5]; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 267 | size_t input_count = 0; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 268 | InstructionOperand outputs[2]; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 269 | size_t output_count = 0; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 270 | bool is_cmp = (opcode == kArm64Cmp32) || (opcode == kArm64Cmn32); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 271 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 272 | // We can commute cmp by switching the inputs and commuting the flags |
| 273 | // continuation. |
| 274 | bool can_commute = m.HasProperty(Operator::kCommutative) || is_cmp; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 275 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 276 | // The cmp and cmn instructions are encoded as sub or add with zero output |
| 277 | // register, and therefore support the same operand modes. |
| 278 | bool is_add_sub = m.IsInt32Add() || m.IsInt64Add() || m.IsInt32Sub() || |
| 279 | m.IsInt64Sub() || is_cmp; |
| 280 | |
| 281 | Node* left_node = m.left().node(); |
| 282 | Node* right_node = m.right().node(); |
| 283 | |
| 284 | if (g.CanBeImmediate(right_node, operand_mode)) { |
| 285 | inputs[input_count++] = g.UseRegister(left_node); |
| 286 | inputs[input_count++] = g.UseImmediate(right_node); |
| 287 | } else if (is_cmp && g.CanBeImmediate(left_node, operand_mode)) { |
| 288 | cont->Commute(); |
| 289 | inputs[input_count++] = g.UseRegister(right_node); |
| 290 | inputs[input_count++] = g.UseImmediate(left_node); |
| 291 | } else if (is_add_sub && |
| 292 | TryMatchAnyExtend(&g, selector, node, left_node, right_node, |
| 293 | &inputs[0], &inputs[1], &opcode)) { |
| 294 | input_count += 2; |
| 295 | } else if (is_add_sub && can_commute && |
| 296 | TryMatchAnyExtend(&g, selector, node, right_node, left_node, |
| 297 | &inputs[0], &inputs[1], &opcode)) { |
| 298 | if (is_cmp) cont->Commute(); |
| 299 | input_count += 2; |
| 300 | } else if (TryMatchAnyShift(selector, node, right_node, &opcode, |
| 301 | !is_add_sub)) { |
| 302 | Matcher m_shift(right_node); |
| 303 | inputs[input_count++] = g.UseRegisterOrImmediateZero(left_node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 304 | inputs[input_count++] = g.UseRegister(m_shift.left().node()); |
| 305 | inputs[input_count++] = g.UseImmediate(m_shift.right().node()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 306 | } else if (can_commute && TryMatchAnyShift(selector, node, left_node, &opcode, |
| 307 | !is_add_sub)) { |
| 308 | if (is_cmp) cont->Commute(); |
| 309 | Matcher m_shift(left_node); |
| 310 | inputs[input_count++] = g.UseRegisterOrImmediateZero(right_node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 311 | inputs[input_count++] = g.UseRegister(m_shift.left().node()); |
| 312 | inputs[input_count++] = g.UseImmediate(m_shift.right().node()); |
| 313 | } else { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 314 | inputs[input_count++] = g.UseRegisterOrImmediateZero(left_node); |
| 315 | inputs[input_count++] = g.UseRegister(right_node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 316 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 317 | |
| 318 | if (cont->IsBranch()) { |
| 319 | inputs[input_count++] = g.Label(cont->true_block()); |
| 320 | inputs[input_count++] = g.Label(cont->false_block()); |
| 321 | } |
| 322 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 323 | if (!is_cmp) { |
| 324 | outputs[output_count++] = g.DefineAsRegister(node); |
| 325 | } |
| 326 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 327 | if (cont->IsSet()) { |
| 328 | outputs[output_count++] = g.DefineAsRegister(cont->result()); |
| 329 | } |
| 330 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 331 | DCHECK_NE(0u, input_count); |
| 332 | DCHECK((output_count != 0) || is_cmp); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 333 | DCHECK_GE(arraysize(inputs), input_count); |
| 334 | DCHECK_GE(arraysize(outputs), output_count); |
| 335 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 336 | opcode = cont->Encode(opcode); |
| 337 | if (cont->IsDeoptimize()) { |
| 338 | selector->EmitDeoptimize(opcode, output_count, outputs, input_count, inputs, |
| 339 | cont->frame_state()); |
| 340 | } else { |
| 341 | selector->Emit(opcode, output_count, outputs, input_count, inputs); |
| 342 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 343 | } |
| 344 | |
| 345 | |
| 346 | // Shared routine for multiple binary operations. |
| 347 | template <typename Matcher> |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 348 | void VisitBinop(InstructionSelector* selector, Node* node, ArchOpcode opcode, |
| 349 | ImmediateMode operand_mode) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 350 | FlagsContinuation cont; |
| 351 | VisitBinop<Matcher>(selector, node, opcode, operand_mode, &cont); |
| 352 | } |
| 353 | |
| 354 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 355 | template <typename Matcher> |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 356 | void VisitAddSub(InstructionSelector* selector, Node* node, ArchOpcode opcode, |
| 357 | ArchOpcode negate_opcode) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 358 | Arm64OperandGenerator g(selector); |
| 359 | Matcher m(node); |
| 360 | if (m.right().HasValue() && (m.right().Value() < 0) && |
| 361 | g.CanBeImmediate(-m.right().Value(), kArithmeticImm)) { |
| 362 | selector->Emit(negate_opcode, g.DefineAsRegister(node), |
| 363 | g.UseRegister(m.left().node()), |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 364 | g.TempImmediate(static_cast<int32_t>(-m.right().Value()))); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 365 | } else { |
| 366 | VisitBinop<Matcher>(selector, node, opcode, kArithmeticImm); |
| 367 | } |
| 368 | } |
| 369 | |
| 370 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 371 | // For multiplications by immediate of the form x * (2^k + 1), where k > 0, |
| 372 | // return the value of k, otherwise return zero. This is used to reduce the |
| 373 | // multiplication to addition with left shift: x + (x << k). |
| 374 | template <typename Matcher> |
| 375 | int32_t LeftShiftForReducedMultiply(Matcher* m) { |
| 376 | DCHECK(m->IsInt32Mul() || m->IsInt64Mul()); |
| 377 | if (m->right().HasValue() && m->right().Value() >= 3) { |
| 378 | uint64_t value_minus_one = m->right().Value() - 1; |
| 379 | if (base::bits::IsPowerOfTwo64(value_minus_one)) { |
| 380 | return WhichPowerOf2_64(value_minus_one); |
| 381 | } |
| 382 | } |
| 383 | return 0; |
| 384 | } |
| 385 | |
| 386 | } // namespace |
| 387 | |
| 388 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 389 | void InstructionSelector::VisitLoad(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 390 | LoadRepresentation load_rep = LoadRepresentationOf(node->op()); |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 391 | MachineRepresentation rep = load_rep.representation(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 392 | Arm64OperandGenerator g(this); |
| 393 | Node* base = node->InputAt(0); |
| 394 | Node* index = node->InputAt(1); |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 395 | InstructionCode opcode = kArchNop; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 396 | ImmediateMode immediate_mode = kNoImmediate; |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 397 | InstructionOperand inputs[3]; |
| 398 | size_t input_count = 0; |
| 399 | InstructionOperand outputs[1]; |
| 400 | switch (rep) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 401 | case MachineRepresentation::kFloat32: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 402 | opcode = kArm64LdrS; |
| 403 | immediate_mode = kLoadStoreImm32; |
| 404 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 405 | case MachineRepresentation::kFloat64: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 406 | opcode = kArm64LdrD; |
| 407 | immediate_mode = kLoadStoreImm64; |
| 408 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 409 | case MachineRepresentation::kBit: // Fall through. |
| 410 | case MachineRepresentation::kWord8: |
| 411 | opcode = load_rep.IsSigned() ? kArm64Ldrsb : kArm64Ldrb; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 412 | immediate_mode = kLoadStoreImm8; |
| 413 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 414 | case MachineRepresentation::kWord16: |
| 415 | opcode = load_rep.IsSigned() ? kArm64Ldrsh : kArm64Ldrh; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 416 | immediate_mode = kLoadStoreImm16; |
| 417 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 418 | case MachineRepresentation::kWord32: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 419 | opcode = kArm64LdrW; |
| 420 | immediate_mode = kLoadStoreImm32; |
| 421 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 422 | case MachineRepresentation::kTagged: // Fall through. |
| 423 | case MachineRepresentation::kWord64: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 424 | opcode = kArm64Ldr; |
| 425 | immediate_mode = kLoadStoreImm64; |
| 426 | break; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 427 | case MachineRepresentation::kSimd128: // Fall through. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 428 | case MachineRepresentation::kNone: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 429 | UNREACHABLE(); |
| 430 | return; |
| 431 | } |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 432 | |
| 433 | outputs[0] = g.DefineAsRegister(node); |
| 434 | inputs[0] = g.UseRegister(base); |
| 435 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 436 | if (g.CanBeImmediate(index, immediate_mode)) { |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 437 | input_count = 2; |
| 438 | inputs[1] = g.UseImmediate(index); |
| 439 | opcode |= AddressingModeField::encode(kMode_MRI); |
| 440 | } else if (TryMatchLoadStoreShift(&g, this, rep, node, index, &inputs[1], |
| 441 | &inputs[2])) { |
| 442 | input_count = 3; |
| 443 | opcode |= AddressingModeField::encode(kMode_Operand2_R_LSL_I); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 444 | } else { |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 445 | input_count = 2; |
| 446 | inputs[1] = g.UseRegister(index); |
| 447 | opcode |= AddressingModeField::encode(kMode_MRR); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 448 | } |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 449 | |
| 450 | Emit(opcode, arraysize(outputs), outputs, input_count, inputs); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 451 | } |
| 452 | |
| 453 | |
| 454 | void InstructionSelector::VisitStore(Node* node) { |
| 455 | Arm64OperandGenerator g(this); |
| 456 | Node* base = node->InputAt(0); |
| 457 | Node* index = node->InputAt(1); |
| 458 | Node* value = node->InputAt(2); |
| 459 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 460 | StoreRepresentation store_rep = StoreRepresentationOf(node->op()); |
| 461 | WriteBarrierKind write_barrier_kind = store_rep.write_barrier_kind(); |
| 462 | MachineRepresentation rep = store_rep.representation(); |
| 463 | |
| 464 | // TODO(arm64): I guess this could be done in a better way. |
| 465 | if (write_barrier_kind != kNoWriteBarrier) { |
| 466 | DCHECK_EQ(MachineRepresentation::kTagged, rep); |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 467 | AddressingMode addressing_mode; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 468 | InstructionOperand inputs[3]; |
| 469 | size_t input_count = 0; |
| 470 | inputs[input_count++] = g.UseUniqueRegister(base); |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 471 | // OutOfLineRecordWrite uses the index in an arithmetic instruction, so we |
| 472 | // must check kArithmeticImm as well as kLoadStoreImm64. |
| 473 | if (g.CanBeImmediate(index, kArithmeticImm) && |
| 474 | g.CanBeImmediate(index, kLoadStoreImm64)) { |
| 475 | inputs[input_count++] = g.UseImmediate(index); |
| 476 | addressing_mode = kMode_MRI; |
| 477 | } else { |
| 478 | inputs[input_count++] = g.UseUniqueRegister(index); |
| 479 | addressing_mode = kMode_MRR; |
| 480 | } |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 481 | inputs[input_count++] = g.UseUniqueRegister(value); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 482 | RecordWriteMode record_write_mode = RecordWriteMode::kValueIsAny; |
| 483 | switch (write_barrier_kind) { |
| 484 | case kNoWriteBarrier: |
| 485 | UNREACHABLE(); |
| 486 | break; |
| 487 | case kMapWriteBarrier: |
| 488 | record_write_mode = RecordWriteMode::kValueIsMap; |
| 489 | break; |
| 490 | case kPointerWriteBarrier: |
| 491 | record_write_mode = RecordWriteMode::kValueIsPointer; |
| 492 | break; |
| 493 | case kFullWriteBarrier: |
| 494 | record_write_mode = RecordWriteMode::kValueIsAny; |
| 495 | break; |
| 496 | } |
| 497 | InstructionOperand temps[] = {g.TempRegister(), g.TempRegister()}; |
| 498 | size_t const temp_count = arraysize(temps); |
| 499 | InstructionCode code = kArchStoreWithWriteBarrier; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 500 | code |= AddressingModeField::encode(addressing_mode); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 501 | code |= MiscField::encode(static_cast<int>(record_write_mode)); |
| 502 | Emit(code, 0, nullptr, input_count, inputs, temp_count, temps); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 503 | } else { |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 504 | InstructionOperand inputs[4]; |
| 505 | size_t input_count = 0; |
| 506 | InstructionCode opcode = kArchNop; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 507 | ImmediateMode immediate_mode = kNoImmediate; |
| 508 | switch (rep) { |
| 509 | case MachineRepresentation::kFloat32: |
| 510 | opcode = kArm64StrS; |
| 511 | immediate_mode = kLoadStoreImm32; |
| 512 | break; |
| 513 | case MachineRepresentation::kFloat64: |
| 514 | opcode = kArm64StrD; |
| 515 | immediate_mode = kLoadStoreImm64; |
| 516 | break; |
| 517 | case MachineRepresentation::kBit: // Fall through. |
| 518 | case MachineRepresentation::kWord8: |
| 519 | opcode = kArm64Strb; |
| 520 | immediate_mode = kLoadStoreImm8; |
| 521 | break; |
| 522 | case MachineRepresentation::kWord16: |
| 523 | opcode = kArm64Strh; |
| 524 | immediate_mode = kLoadStoreImm16; |
| 525 | break; |
| 526 | case MachineRepresentation::kWord32: |
| 527 | opcode = kArm64StrW; |
| 528 | immediate_mode = kLoadStoreImm32; |
| 529 | break; |
| 530 | case MachineRepresentation::kTagged: // Fall through. |
| 531 | case MachineRepresentation::kWord64: |
| 532 | opcode = kArm64Str; |
| 533 | immediate_mode = kLoadStoreImm64; |
| 534 | break; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 535 | case MachineRepresentation::kSimd128: // Fall through. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 536 | case MachineRepresentation::kNone: |
| 537 | UNREACHABLE(); |
| 538 | return; |
| 539 | } |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 540 | |
| 541 | inputs[0] = g.UseRegisterOrImmediateZero(value); |
| 542 | inputs[1] = g.UseRegister(base); |
| 543 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 544 | if (g.CanBeImmediate(index, immediate_mode)) { |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 545 | input_count = 3; |
| 546 | inputs[2] = g.UseImmediate(index); |
| 547 | opcode |= AddressingModeField::encode(kMode_MRI); |
| 548 | } else if (TryMatchLoadStoreShift(&g, this, rep, node, index, &inputs[2], |
| 549 | &inputs[3])) { |
| 550 | input_count = 4; |
| 551 | opcode |= AddressingModeField::encode(kMode_Operand2_R_LSL_I); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 552 | } else { |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 553 | input_count = 3; |
| 554 | inputs[2] = g.UseRegister(index); |
| 555 | opcode |= AddressingModeField::encode(kMode_MRR); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 556 | } |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 557 | |
| 558 | Emit(opcode, 0, nullptr, input_count, inputs); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 559 | } |
| 560 | } |
| 561 | |
| 562 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 563 | void InstructionSelector::VisitCheckedLoad(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 564 | CheckedLoadRepresentation load_rep = CheckedLoadRepresentationOf(node->op()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 565 | Arm64OperandGenerator g(this); |
| 566 | Node* const buffer = node->InputAt(0); |
| 567 | Node* const offset = node->InputAt(1); |
| 568 | Node* const length = node->InputAt(2); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 569 | ArchOpcode opcode = kArchNop; |
| 570 | switch (load_rep.representation()) { |
| 571 | case MachineRepresentation::kWord8: |
| 572 | opcode = load_rep.IsSigned() ? kCheckedLoadInt8 : kCheckedLoadUint8; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 573 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 574 | case MachineRepresentation::kWord16: |
| 575 | opcode = load_rep.IsSigned() ? kCheckedLoadInt16 : kCheckedLoadUint16; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 576 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 577 | case MachineRepresentation::kWord32: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 578 | opcode = kCheckedLoadWord32; |
| 579 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 580 | case MachineRepresentation::kWord64: |
| 581 | opcode = kCheckedLoadWord64; |
| 582 | break; |
| 583 | case MachineRepresentation::kFloat32: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 584 | opcode = kCheckedLoadFloat32; |
| 585 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 586 | case MachineRepresentation::kFloat64: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 587 | opcode = kCheckedLoadFloat64; |
| 588 | break; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 589 | case MachineRepresentation::kBit: // Fall through. |
| 590 | case MachineRepresentation::kTagged: // Fall through. |
| 591 | case MachineRepresentation::kSimd128: // Fall through. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 592 | case MachineRepresentation::kNone: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 593 | UNREACHABLE(); |
| 594 | return; |
| 595 | } |
| 596 | Emit(opcode, g.DefineAsRegister(node), g.UseRegister(buffer), |
| 597 | g.UseRegister(offset), g.UseOperand(length, kArithmeticImm)); |
| 598 | } |
| 599 | |
| 600 | |
| 601 | void InstructionSelector::VisitCheckedStore(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 602 | MachineRepresentation rep = CheckedStoreRepresentationOf(node->op()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 603 | Arm64OperandGenerator g(this); |
| 604 | Node* const buffer = node->InputAt(0); |
| 605 | Node* const offset = node->InputAt(1); |
| 606 | Node* const length = node->InputAt(2); |
| 607 | Node* const value = node->InputAt(3); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 608 | ArchOpcode opcode = kArchNop; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 609 | switch (rep) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 610 | case MachineRepresentation::kWord8: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 611 | opcode = kCheckedStoreWord8; |
| 612 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 613 | case MachineRepresentation::kWord16: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 614 | opcode = kCheckedStoreWord16; |
| 615 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 616 | case MachineRepresentation::kWord32: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 617 | opcode = kCheckedStoreWord32; |
| 618 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 619 | case MachineRepresentation::kWord64: |
| 620 | opcode = kCheckedStoreWord64; |
| 621 | break; |
| 622 | case MachineRepresentation::kFloat32: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 623 | opcode = kCheckedStoreFloat32; |
| 624 | break; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 625 | case MachineRepresentation::kFloat64: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 626 | opcode = kCheckedStoreFloat64; |
| 627 | break; |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 628 | case MachineRepresentation::kBit: // Fall through. |
| 629 | case MachineRepresentation::kTagged: // Fall through. |
| 630 | case MachineRepresentation::kSimd128: // Fall through. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 631 | case MachineRepresentation::kNone: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 632 | UNREACHABLE(); |
| 633 | return; |
| 634 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 635 | Emit(opcode, g.NoOutput(), g.UseRegister(buffer), g.UseRegister(offset), |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 636 | g.UseOperand(length, kArithmeticImm), |
| 637 | g.UseRegisterOrImmediateZero(value)); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 638 | } |
| 639 | |
| 640 | |
| 641 | template <typename Matcher> |
| 642 | static void VisitLogical(InstructionSelector* selector, Node* node, Matcher* m, |
| 643 | ArchOpcode opcode, bool left_can_cover, |
| 644 | bool right_can_cover, ImmediateMode imm_mode) { |
| 645 | Arm64OperandGenerator g(selector); |
| 646 | |
| 647 | // Map instruction to equivalent operation with inverted right input. |
| 648 | ArchOpcode inv_opcode = opcode; |
| 649 | switch (opcode) { |
| 650 | case kArm64And32: |
| 651 | inv_opcode = kArm64Bic32; |
| 652 | break; |
| 653 | case kArm64And: |
| 654 | inv_opcode = kArm64Bic; |
| 655 | break; |
| 656 | case kArm64Or32: |
| 657 | inv_opcode = kArm64Orn32; |
| 658 | break; |
| 659 | case kArm64Or: |
| 660 | inv_opcode = kArm64Orn; |
| 661 | break; |
| 662 | case kArm64Eor32: |
| 663 | inv_opcode = kArm64Eon32; |
| 664 | break; |
| 665 | case kArm64Eor: |
| 666 | inv_opcode = kArm64Eon; |
| 667 | break; |
| 668 | default: |
| 669 | UNREACHABLE(); |
| 670 | } |
| 671 | |
| 672 | // Select Logical(y, ~x) for Logical(Xor(x, -1), y). |
| 673 | if ((m->left().IsWord32Xor() || m->left().IsWord64Xor()) && left_can_cover) { |
| 674 | Matcher mleft(m->left().node()); |
| 675 | if (mleft.right().Is(-1)) { |
| 676 | // TODO(all): support shifted operand on right. |
| 677 | selector->Emit(inv_opcode, g.DefineAsRegister(node), |
| 678 | g.UseRegister(m->right().node()), |
| 679 | g.UseRegister(mleft.left().node())); |
| 680 | return; |
| 681 | } |
| 682 | } |
| 683 | |
| 684 | // Select Logical(x, ~y) for Logical(x, Xor(y, -1)). |
| 685 | if ((m->right().IsWord32Xor() || m->right().IsWord64Xor()) && |
| 686 | right_can_cover) { |
| 687 | Matcher mright(m->right().node()); |
| 688 | if (mright.right().Is(-1)) { |
| 689 | // TODO(all): support shifted operand on right. |
| 690 | selector->Emit(inv_opcode, g.DefineAsRegister(node), |
| 691 | g.UseRegister(m->left().node()), |
| 692 | g.UseRegister(mright.left().node())); |
| 693 | return; |
| 694 | } |
| 695 | } |
| 696 | |
| 697 | if (m->IsWord32Xor() && m->right().Is(-1)) { |
| 698 | selector->Emit(kArm64Not32, g.DefineAsRegister(node), |
| 699 | g.UseRegister(m->left().node())); |
| 700 | } else if (m->IsWord64Xor() && m->right().Is(-1)) { |
| 701 | selector->Emit(kArm64Not, g.DefineAsRegister(node), |
| 702 | g.UseRegister(m->left().node())); |
| 703 | } else { |
| 704 | VisitBinop<Matcher>(selector, node, opcode, imm_mode); |
| 705 | } |
| 706 | } |
| 707 | |
| 708 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 709 | void InstructionSelector::VisitWord32And(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 710 | Arm64OperandGenerator g(this); |
| 711 | Int32BinopMatcher m(node); |
| 712 | if (m.left().IsWord32Shr() && CanCover(node, m.left().node()) && |
| 713 | m.right().HasValue()) { |
| 714 | uint32_t mask = m.right().Value(); |
| 715 | uint32_t mask_width = base::bits::CountPopulation32(mask); |
| 716 | uint32_t mask_msb = base::bits::CountLeadingZeros32(mask); |
| 717 | if ((mask_width != 0) && (mask_msb + mask_width == 32)) { |
| 718 | // The mask must be contiguous, and occupy the least-significant bits. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 719 | DCHECK_EQ(0u, base::bits::CountTrailingZeros32(mask)); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 720 | |
| 721 | // Select Ubfx for And(Shr(x, imm), mask) where the mask is in the least |
| 722 | // significant bits. |
| 723 | Int32BinopMatcher mleft(m.left().node()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 724 | if (mleft.right().HasValue()) { |
| 725 | // Any shift value can match; int32 shifts use `value % 32`. |
| 726 | uint32_t lsb = mleft.right().Value() & 0x1f; |
| 727 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 728 | // Ubfx cannot extract bits past the register size, however since |
| 729 | // shifting the original value would have introduced some zeros we can |
| 730 | // still use ubfx with a smaller mask and the remaining bits will be |
| 731 | // zeros. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 732 | if (lsb + mask_width > 32) mask_width = 32 - lsb; |
| 733 | |
| 734 | Emit(kArm64Ubfx32, g.DefineAsRegister(node), |
| 735 | g.UseRegister(mleft.left().node()), |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 736 | g.UseImmediateOrTemp(mleft.right().node(), lsb), |
| 737 | g.TempImmediate(mask_width)); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 738 | return; |
| 739 | } |
| 740 | // Other cases fall through to the normal And operation. |
| 741 | } |
| 742 | } |
| 743 | VisitLogical<Int32BinopMatcher>( |
| 744 | this, node, &m, kArm64And32, CanCover(node, m.left().node()), |
| 745 | CanCover(node, m.right().node()), kLogical32Imm); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 746 | } |
| 747 | |
| 748 | |
| 749 | void InstructionSelector::VisitWord64And(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 750 | Arm64OperandGenerator g(this); |
| 751 | Int64BinopMatcher m(node); |
| 752 | if (m.left().IsWord64Shr() && CanCover(node, m.left().node()) && |
| 753 | m.right().HasValue()) { |
| 754 | uint64_t mask = m.right().Value(); |
| 755 | uint64_t mask_width = base::bits::CountPopulation64(mask); |
| 756 | uint64_t mask_msb = base::bits::CountLeadingZeros64(mask); |
| 757 | if ((mask_width != 0) && (mask_msb + mask_width == 64)) { |
| 758 | // The mask must be contiguous, and occupy the least-significant bits. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 759 | DCHECK_EQ(0u, base::bits::CountTrailingZeros64(mask)); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 760 | |
| 761 | // Select Ubfx for And(Shr(x, imm), mask) where the mask is in the least |
| 762 | // significant bits. |
| 763 | Int64BinopMatcher mleft(m.left().node()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 764 | if (mleft.right().HasValue()) { |
| 765 | // Any shift value can match; int64 shifts use `value % 64`. |
| 766 | uint32_t lsb = static_cast<uint32_t>(mleft.right().Value() & 0x3f); |
| 767 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 768 | // Ubfx cannot extract bits past the register size, however since |
| 769 | // shifting the original value would have introduced some zeros we can |
| 770 | // still use ubfx with a smaller mask and the remaining bits will be |
| 771 | // zeros. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 772 | if (lsb + mask_width > 64) mask_width = 64 - lsb; |
| 773 | |
| 774 | Emit(kArm64Ubfx, g.DefineAsRegister(node), |
| 775 | g.UseRegister(mleft.left().node()), |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 776 | g.UseImmediateOrTemp(mleft.right().node(), lsb), |
| 777 | g.TempImmediate(static_cast<int32_t>(mask_width))); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 778 | return; |
| 779 | } |
| 780 | // Other cases fall through to the normal And operation. |
| 781 | } |
| 782 | } |
| 783 | VisitLogical<Int64BinopMatcher>( |
| 784 | this, node, &m, kArm64And, CanCover(node, m.left().node()), |
| 785 | CanCover(node, m.right().node()), kLogical64Imm); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 786 | } |
| 787 | |
| 788 | |
| 789 | void InstructionSelector::VisitWord32Or(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 790 | Int32BinopMatcher m(node); |
| 791 | VisitLogical<Int32BinopMatcher>( |
| 792 | this, node, &m, kArm64Or32, CanCover(node, m.left().node()), |
| 793 | CanCover(node, m.right().node()), kLogical32Imm); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 794 | } |
| 795 | |
| 796 | |
| 797 | void InstructionSelector::VisitWord64Or(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 798 | Int64BinopMatcher m(node); |
| 799 | VisitLogical<Int64BinopMatcher>( |
| 800 | this, node, &m, kArm64Or, CanCover(node, m.left().node()), |
| 801 | CanCover(node, m.right().node()), kLogical64Imm); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 802 | } |
| 803 | |
| 804 | |
| 805 | void InstructionSelector::VisitWord32Xor(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 806 | Int32BinopMatcher m(node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 807 | VisitLogical<Int32BinopMatcher>( |
| 808 | this, node, &m, kArm64Eor32, CanCover(node, m.left().node()), |
| 809 | CanCover(node, m.right().node()), kLogical32Imm); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 810 | } |
| 811 | |
| 812 | |
| 813 | void InstructionSelector::VisitWord64Xor(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 814 | Int64BinopMatcher m(node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 815 | VisitLogical<Int64BinopMatcher>( |
| 816 | this, node, &m, kArm64Eor, CanCover(node, m.left().node()), |
| 817 | CanCover(node, m.right().node()), kLogical64Imm); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 818 | } |
| 819 | |
| 820 | |
| 821 | void InstructionSelector::VisitWord32Shl(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 822 | Int32BinopMatcher m(node); |
| 823 | if (m.left().IsWord32And() && CanCover(node, m.left().node()) && |
| 824 | m.right().IsInRange(1, 31)) { |
| 825 | Arm64OperandGenerator g(this); |
| 826 | Int32BinopMatcher mleft(m.left().node()); |
| 827 | if (mleft.right().HasValue()) { |
| 828 | uint32_t mask = mleft.right().Value(); |
| 829 | uint32_t mask_width = base::bits::CountPopulation32(mask); |
| 830 | uint32_t mask_msb = base::bits::CountLeadingZeros32(mask); |
| 831 | if ((mask_width != 0) && (mask_msb + mask_width == 32)) { |
| 832 | uint32_t shift = m.right().Value(); |
| 833 | DCHECK_EQ(0u, base::bits::CountTrailingZeros32(mask)); |
| 834 | DCHECK_NE(0u, shift); |
| 835 | |
| 836 | if ((shift + mask_width) >= 32) { |
| 837 | // If the mask is contiguous and reaches or extends beyond the top |
| 838 | // bit, only the shift is needed. |
| 839 | Emit(kArm64Lsl32, g.DefineAsRegister(node), |
| 840 | g.UseRegister(mleft.left().node()), |
| 841 | g.UseImmediate(m.right().node())); |
| 842 | return; |
| 843 | } else { |
| 844 | // Select Ubfiz for Shl(And(x, mask), imm) where the mask is |
| 845 | // contiguous, and the shift immediate non-zero. |
| 846 | Emit(kArm64Ubfiz32, g.DefineAsRegister(node), |
| 847 | g.UseRegister(mleft.left().node()), |
| 848 | g.UseImmediate(m.right().node()), g.TempImmediate(mask_width)); |
| 849 | return; |
| 850 | } |
| 851 | } |
| 852 | } |
| 853 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 854 | VisitRRO(this, kArm64Lsl32, node, kShift32Imm); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 855 | } |
| 856 | |
| 857 | |
| 858 | void InstructionSelector::VisitWord64Shl(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 859 | Arm64OperandGenerator g(this); |
| 860 | Int64BinopMatcher m(node); |
| 861 | if ((m.left().IsChangeInt32ToInt64() || m.left().IsChangeUint32ToUint64()) && |
| 862 | m.right().IsInRange(32, 63)) { |
| 863 | // There's no need to sign/zero-extend to 64-bit if we shift out the upper |
| 864 | // 32 bits anyway. |
| 865 | Emit(kArm64Lsl, g.DefineAsRegister(node), |
| 866 | g.UseRegister(m.left().node()->InputAt(0)), |
| 867 | g.UseImmediate(m.right().node())); |
| 868 | return; |
| 869 | } |
| 870 | VisitRRO(this, kArm64Lsl, node, kShift64Imm); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 871 | } |
| 872 | |
| 873 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 874 | namespace { |
| 875 | |
| 876 | bool TryEmitBitfieldExtract32(InstructionSelector* selector, Node* node) { |
| 877 | Arm64OperandGenerator g(selector); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 878 | Int32BinopMatcher m(node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 879 | if (selector->CanCover(node, m.left().node()) && m.left().IsWord32Shl()) { |
| 880 | // Select Ubfx or Sbfx for (x << (K & 0x1f)) OP (K & 0x1f), where |
| 881 | // OP is >>> or >> and (K & 0x1f) != 0. |
| 882 | Int32BinopMatcher mleft(m.left().node()); |
| 883 | if (mleft.right().HasValue() && m.right().HasValue() && |
| 884 | (mleft.right().Value() & 0x1f) == (m.right().Value() & 0x1f)) { |
| 885 | DCHECK(m.IsWord32Shr() || m.IsWord32Sar()); |
| 886 | ArchOpcode opcode = m.IsWord32Sar() ? kArm64Sbfx32 : kArm64Ubfx32; |
| 887 | |
| 888 | int right_val = m.right().Value() & 0x1f; |
| 889 | DCHECK_NE(right_val, 0); |
| 890 | |
| 891 | selector->Emit(opcode, g.DefineAsRegister(node), |
| 892 | g.UseRegister(mleft.left().node()), g.TempImmediate(0), |
| 893 | g.TempImmediate(32 - right_val)); |
| 894 | return true; |
| 895 | } |
| 896 | } |
| 897 | return false; |
| 898 | } |
| 899 | |
| 900 | } // namespace |
| 901 | |
| 902 | |
| 903 | void InstructionSelector::VisitWord32Shr(Node* node) { |
| 904 | Int32BinopMatcher m(node); |
| 905 | if (m.left().IsWord32And() && m.right().HasValue()) { |
| 906 | uint32_t lsb = m.right().Value() & 0x1f; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 907 | Int32BinopMatcher mleft(m.left().node()); |
| 908 | if (mleft.right().HasValue()) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 909 | // Select Ubfx for Shr(And(x, mask), imm) where the result of the mask is |
| 910 | // shifted into the least-significant bits. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 911 | uint32_t mask = (mleft.right().Value() >> lsb) << lsb; |
| 912 | unsigned mask_width = base::bits::CountPopulation32(mask); |
| 913 | unsigned mask_msb = base::bits::CountLeadingZeros32(mask); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 914 | if ((mask_msb + mask_width + lsb) == 32) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 915 | Arm64OperandGenerator g(this); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 916 | DCHECK_EQ(lsb, base::bits::CountTrailingZeros32(mask)); |
| 917 | Emit(kArm64Ubfx32, g.DefineAsRegister(node), |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 918 | g.UseRegister(mleft.left().node()), |
| 919 | g.UseImmediateOrTemp(m.right().node(), lsb), |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 920 | g.TempImmediate(mask_width)); |
| 921 | return; |
| 922 | } |
| 923 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 924 | } else if (TryEmitBitfieldExtract32(this, node)) { |
| 925 | return; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 926 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 927 | |
| 928 | if (m.left().IsUint32MulHigh() && m.right().HasValue() && |
| 929 | CanCover(node, node->InputAt(0))) { |
| 930 | // Combine this shift with the multiply and shift that would be generated |
| 931 | // by Uint32MulHigh. |
| 932 | Arm64OperandGenerator g(this); |
| 933 | Node* left = m.left().node(); |
| 934 | int shift = m.right().Value() & 0x1f; |
| 935 | InstructionOperand const smull_operand = g.TempRegister(); |
| 936 | Emit(kArm64Umull, smull_operand, g.UseRegister(left->InputAt(0)), |
| 937 | g.UseRegister(left->InputAt(1))); |
| 938 | Emit(kArm64Lsr, g.DefineAsRegister(node), smull_operand, |
| 939 | g.TempImmediate(32 + shift)); |
| 940 | return; |
| 941 | } |
| 942 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 943 | VisitRRO(this, kArm64Lsr32, node, kShift32Imm); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 944 | } |
| 945 | |
| 946 | |
| 947 | void InstructionSelector::VisitWord64Shr(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 948 | Int64BinopMatcher m(node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 949 | if (m.left().IsWord64And() && m.right().HasValue()) { |
| 950 | uint32_t lsb = m.right().Value() & 0x3f; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 951 | Int64BinopMatcher mleft(m.left().node()); |
| 952 | if (mleft.right().HasValue()) { |
| 953 | // Select Ubfx for Shr(And(x, mask), imm) where the result of the mask is |
| 954 | // shifted into the least-significant bits. |
| 955 | uint64_t mask = (mleft.right().Value() >> lsb) << lsb; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 956 | unsigned mask_width = base::bits::CountPopulation64(mask); |
| 957 | unsigned mask_msb = base::bits::CountLeadingZeros64(mask); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 958 | if ((mask_msb + mask_width + lsb) == 64) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 959 | Arm64OperandGenerator g(this); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 960 | DCHECK_EQ(lsb, base::bits::CountTrailingZeros64(mask)); |
| 961 | Emit(kArm64Ubfx, g.DefineAsRegister(node), |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 962 | g.UseRegister(mleft.left().node()), |
| 963 | g.UseImmediateOrTemp(m.right().node(), lsb), |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 964 | g.TempImmediate(mask_width)); |
| 965 | return; |
| 966 | } |
| 967 | } |
| 968 | } |
| 969 | VisitRRO(this, kArm64Lsr, node, kShift64Imm); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 970 | } |
| 971 | |
| 972 | |
| 973 | void InstructionSelector::VisitWord32Sar(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 974 | if (TryEmitBitfieldExtract32(this, node)) { |
| 975 | return; |
| 976 | } |
| 977 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 978 | Int32BinopMatcher m(node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 979 | if (m.left().IsInt32MulHigh() && m.right().HasValue() && |
| 980 | CanCover(node, node->InputAt(0))) { |
| 981 | // Combine this shift with the multiply and shift that would be generated |
| 982 | // by Int32MulHigh. |
| 983 | Arm64OperandGenerator g(this); |
| 984 | Node* left = m.left().node(); |
| 985 | int shift = m.right().Value() & 0x1f; |
| 986 | InstructionOperand const smull_operand = g.TempRegister(); |
| 987 | Emit(kArm64Smull, smull_operand, g.UseRegister(left->InputAt(0)), |
| 988 | g.UseRegister(left->InputAt(1))); |
| 989 | Emit(kArm64Asr, g.DefineAsRegister(node), smull_operand, |
| 990 | g.TempImmediate(32 + shift)); |
| 991 | return; |
| 992 | } |
| 993 | |
| 994 | if (m.left().IsInt32Add() && m.right().HasValue() && |
| 995 | CanCover(node, node->InputAt(0))) { |
| 996 | Node* add_node = m.left().node(); |
| 997 | Int32BinopMatcher madd_node(add_node); |
| 998 | if (madd_node.left().IsInt32MulHigh() && |
| 999 | CanCover(add_node, madd_node.left().node())) { |
| 1000 | // Combine the shift that would be generated by Int32MulHigh with the add |
| 1001 | // on the left of this Sar operation. We do it here, as the result of the |
| 1002 | // add potentially has 33 bits, so we have to ensure the result is |
| 1003 | // truncated by being the input to this 32-bit Sar operation. |
| 1004 | Arm64OperandGenerator g(this); |
| 1005 | Node* mul_node = madd_node.left().node(); |
| 1006 | |
| 1007 | InstructionOperand const smull_operand = g.TempRegister(); |
| 1008 | Emit(kArm64Smull, smull_operand, g.UseRegister(mul_node->InputAt(0)), |
| 1009 | g.UseRegister(mul_node->InputAt(1))); |
| 1010 | |
| 1011 | InstructionOperand const add_operand = g.TempRegister(); |
| 1012 | Emit(kArm64Add | AddressingModeField::encode(kMode_Operand2_R_ASR_I), |
| 1013 | add_operand, g.UseRegister(add_node->InputAt(1)), smull_operand, |
| 1014 | g.TempImmediate(32)); |
| 1015 | |
| 1016 | Emit(kArm64Asr32, g.DefineAsRegister(node), add_operand, |
| 1017 | g.UseImmediate(node->InputAt(1))); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1018 | return; |
| 1019 | } |
| 1020 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1021 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1022 | VisitRRO(this, kArm64Asr32, node, kShift32Imm); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1023 | } |
| 1024 | |
| 1025 | |
| 1026 | void InstructionSelector::VisitWord64Sar(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1027 | VisitRRO(this, kArm64Asr, node, kShift64Imm); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1028 | } |
| 1029 | |
| 1030 | |
| 1031 | void InstructionSelector::VisitWord32Ror(Node* node) { |
| 1032 | VisitRRO(this, kArm64Ror32, node, kShift32Imm); |
| 1033 | } |
| 1034 | |
| 1035 | |
| 1036 | void InstructionSelector::VisitWord64Ror(Node* node) { |
| 1037 | VisitRRO(this, kArm64Ror, node, kShift64Imm); |
| 1038 | } |
| 1039 | |
| 1040 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1041 | void InstructionSelector::VisitWord64Clz(Node* node) { |
| 1042 | Arm64OperandGenerator g(this); |
| 1043 | Emit(kArm64Clz, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0))); |
| 1044 | } |
| 1045 | |
| 1046 | |
| 1047 | void InstructionSelector::VisitWord32Clz(Node* node) { |
| 1048 | Arm64OperandGenerator g(this); |
| 1049 | Emit(kArm64Clz32, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0))); |
| 1050 | } |
| 1051 | |
| 1052 | |
| 1053 | void InstructionSelector::VisitWord32Ctz(Node* node) { UNREACHABLE(); } |
| 1054 | |
| 1055 | |
| 1056 | void InstructionSelector::VisitWord64Ctz(Node* node) { UNREACHABLE(); } |
| 1057 | |
| 1058 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1059 | void InstructionSelector::VisitWord32ReverseBits(Node* node) { |
| 1060 | VisitRR(this, kArm64Rbit32, node); |
| 1061 | } |
| 1062 | |
| 1063 | |
| 1064 | void InstructionSelector::VisitWord64ReverseBits(Node* node) { |
| 1065 | VisitRR(this, kArm64Rbit, node); |
| 1066 | } |
| 1067 | |
| 1068 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1069 | void InstructionSelector::VisitWord32Popcnt(Node* node) { UNREACHABLE(); } |
| 1070 | |
| 1071 | |
| 1072 | void InstructionSelector::VisitWord64Popcnt(Node* node) { UNREACHABLE(); } |
| 1073 | |
| 1074 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1075 | void InstructionSelector::VisitInt32Add(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1076 | Arm64OperandGenerator g(this); |
| 1077 | Int32BinopMatcher m(node); |
| 1078 | // Select Madd(x, y, z) for Add(Mul(x, y), z). |
| 1079 | if (m.left().IsInt32Mul() && CanCover(node, m.left().node())) { |
| 1080 | Int32BinopMatcher mleft(m.left().node()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1081 | // Check multiply can't be later reduced to addition with shift. |
| 1082 | if (LeftShiftForReducedMultiply(&mleft) == 0) { |
| 1083 | Emit(kArm64Madd32, g.DefineAsRegister(node), |
| 1084 | g.UseRegister(mleft.left().node()), |
| 1085 | g.UseRegister(mleft.right().node()), |
| 1086 | g.UseRegister(m.right().node())); |
| 1087 | return; |
| 1088 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1089 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1090 | // Select Madd(x, y, z) for Add(z, Mul(x, y)). |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1091 | if (m.right().IsInt32Mul() && CanCover(node, m.right().node())) { |
| 1092 | Int32BinopMatcher mright(m.right().node()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1093 | // Check multiply can't be later reduced to addition with shift. |
| 1094 | if (LeftShiftForReducedMultiply(&mright) == 0) { |
| 1095 | Emit(kArm64Madd32, g.DefineAsRegister(node), |
| 1096 | g.UseRegister(mright.left().node()), |
| 1097 | g.UseRegister(mright.right().node()), |
| 1098 | g.UseRegister(m.left().node())); |
| 1099 | return; |
| 1100 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1101 | } |
| 1102 | VisitAddSub<Int32BinopMatcher>(this, node, kArm64Add32, kArm64Sub32); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1103 | } |
| 1104 | |
| 1105 | |
| 1106 | void InstructionSelector::VisitInt64Add(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1107 | Arm64OperandGenerator g(this); |
| 1108 | Int64BinopMatcher m(node); |
| 1109 | // Select Madd(x, y, z) for Add(Mul(x, y), z). |
| 1110 | if (m.left().IsInt64Mul() && CanCover(node, m.left().node())) { |
| 1111 | Int64BinopMatcher mleft(m.left().node()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1112 | // Check multiply can't be later reduced to addition with shift. |
| 1113 | if (LeftShiftForReducedMultiply(&mleft) == 0) { |
| 1114 | Emit(kArm64Madd, g.DefineAsRegister(node), |
| 1115 | g.UseRegister(mleft.left().node()), |
| 1116 | g.UseRegister(mleft.right().node()), |
| 1117 | g.UseRegister(m.right().node())); |
| 1118 | return; |
| 1119 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1120 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1121 | // Select Madd(x, y, z) for Add(z, Mul(x, y)). |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1122 | if (m.right().IsInt64Mul() && CanCover(node, m.right().node())) { |
| 1123 | Int64BinopMatcher mright(m.right().node()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1124 | // Check multiply can't be later reduced to addition with shift. |
| 1125 | if (LeftShiftForReducedMultiply(&mright) == 0) { |
| 1126 | Emit(kArm64Madd, g.DefineAsRegister(node), |
| 1127 | g.UseRegister(mright.left().node()), |
| 1128 | g.UseRegister(mright.right().node()), |
| 1129 | g.UseRegister(m.left().node())); |
| 1130 | return; |
| 1131 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1132 | } |
| 1133 | VisitAddSub<Int64BinopMatcher>(this, node, kArm64Add, kArm64Sub); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1134 | } |
| 1135 | |
| 1136 | |
| 1137 | void InstructionSelector::VisitInt32Sub(Node* node) { |
| 1138 | Arm64OperandGenerator g(this); |
| 1139 | Int32BinopMatcher m(node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1140 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1141 | // Select Msub(x, y, a) for Sub(a, Mul(x, y)). |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1142 | if (m.right().IsInt32Mul() && CanCover(node, m.right().node())) { |
| 1143 | Int32BinopMatcher mright(m.right().node()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1144 | // Check multiply can't be later reduced to addition with shift. |
| 1145 | if (LeftShiftForReducedMultiply(&mright) == 0) { |
| 1146 | Emit(kArm64Msub32, g.DefineAsRegister(node), |
| 1147 | g.UseRegister(mright.left().node()), |
| 1148 | g.UseRegister(mright.right().node()), |
| 1149 | g.UseRegister(m.left().node())); |
| 1150 | return; |
| 1151 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1152 | } |
| 1153 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1154 | VisitAddSub<Int32BinopMatcher>(this, node, kArm64Sub32, kArm64Add32); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1155 | } |
| 1156 | |
| 1157 | |
| 1158 | void InstructionSelector::VisitInt64Sub(Node* node) { |
| 1159 | Arm64OperandGenerator g(this); |
| 1160 | Int64BinopMatcher m(node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1161 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1162 | // Select Msub(x, y, a) for Sub(a, Mul(x, y)). |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1163 | if (m.right().IsInt64Mul() && CanCover(node, m.right().node())) { |
| 1164 | Int64BinopMatcher mright(m.right().node()); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1165 | // Check multiply can't be later reduced to addition with shift. |
| 1166 | if (LeftShiftForReducedMultiply(&mright) == 0) { |
| 1167 | Emit(kArm64Msub, g.DefineAsRegister(node), |
| 1168 | g.UseRegister(mright.left().node()), |
| 1169 | g.UseRegister(mright.right().node()), |
| 1170 | g.UseRegister(m.left().node())); |
| 1171 | return; |
| 1172 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1173 | } |
| 1174 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1175 | VisitAddSub<Int64BinopMatcher>(this, node, kArm64Sub, kArm64Add); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1176 | } |
| 1177 | |
| 1178 | |
| 1179 | void InstructionSelector::VisitInt32Mul(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1180 | Arm64OperandGenerator g(this); |
| 1181 | Int32BinopMatcher m(node); |
| 1182 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1183 | // First, try to reduce the multiplication to addition with left shift. |
| 1184 | // x * (2^k + 1) -> x + (x << k) |
| 1185 | int32_t shift = LeftShiftForReducedMultiply(&m); |
| 1186 | if (shift > 0) { |
| 1187 | Emit(kArm64Add32 | AddressingModeField::encode(kMode_Operand2_R_LSL_I), |
| 1188 | g.DefineAsRegister(node), g.UseRegister(m.left().node()), |
| 1189 | g.UseRegister(m.left().node()), g.TempImmediate(shift)); |
| 1190 | return; |
| 1191 | } |
| 1192 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1193 | if (m.left().IsInt32Sub() && CanCover(node, m.left().node())) { |
| 1194 | Int32BinopMatcher mleft(m.left().node()); |
| 1195 | |
| 1196 | // Select Mneg(x, y) for Mul(Sub(0, x), y). |
| 1197 | if (mleft.left().Is(0)) { |
| 1198 | Emit(kArm64Mneg32, g.DefineAsRegister(node), |
| 1199 | g.UseRegister(mleft.right().node()), |
| 1200 | g.UseRegister(m.right().node())); |
| 1201 | return; |
| 1202 | } |
| 1203 | } |
| 1204 | |
| 1205 | if (m.right().IsInt32Sub() && CanCover(node, m.right().node())) { |
| 1206 | Int32BinopMatcher mright(m.right().node()); |
| 1207 | |
| 1208 | // Select Mneg(x, y) for Mul(x, Sub(0, y)). |
| 1209 | if (mright.left().Is(0)) { |
| 1210 | Emit(kArm64Mneg32, g.DefineAsRegister(node), |
| 1211 | g.UseRegister(m.left().node()), |
| 1212 | g.UseRegister(mright.right().node())); |
| 1213 | return; |
| 1214 | } |
| 1215 | } |
| 1216 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1217 | VisitRRR(this, kArm64Mul32, node); |
| 1218 | } |
| 1219 | |
| 1220 | |
| 1221 | void InstructionSelector::VisitInt64Mul(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1222 | Arm64OperandGenerator g(this); |
| 1223 | Int64BinopMatcher m(node); |
| 1224 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1225 | // First, try to reduce the multiplication to addition with left shift. |
| 1226 | // x * (2^k + 1) -> x + (x << k) |
| 1227 | int32_t shift = LeftShiftForReducedMultiply(&m); |
| 1228 | if (shift > 0) { |
| 1229 | Emit(kArm64Add | AddressingModeField::encode(kMode_Operand2_R_LSL_I), |
| 1230 | g.DefineAsRegister(node), g.UseRegister(m.left().node()), |
| 1231 | g.UseRegister(m.left().node()), g.TempImmediate(shift)); |
| 1232 | return; |
| 1233 | } |
| 1234 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1235 | if (m.left().IsInt64Sub() && CanCover(node, m.left().node())) { |
| 1236 | Int64BinopMatcher mleft(m.left().node()); |
| 1237 | |
| 1238 | // Select Mneg(x, y) for Mul(Sub(0, x), y). |
| 1239 | if (mleft.left().Is(0)) { |
| 1240 | Emit(kArm64Mneg, g.DefineAsRegister(node), |
| 1241 | g.UseRegister(mleft.right().node()), |
| 1242 | g.UseRegister(m.right().node())); |
| 1243 | return; |
| 1244 | } |
| 1245 | } |
| 1246 | |
| 1247 | if (m.right().IsInt64Sub() && CanCover(node, m.right().node())) { |
| 1248 | Int64BinopMatcher mright(m.right().node()); |
| 1249 | |
| 1250 | // Select Mneg(x, y) for Mul(x, Sub(0, y)). |
| 1251 | if (mright.left().Is(0)) { |
| 1252 | Emit(kArm64Mneg, g.DefineAsRegister(node), g.UseRegister(m.left().node()), |
| 1253 | g.UseRegister(mright.right().node())); |
| 1254 | return; |
| 1255 | } |
| 1256 | } |
| 1257 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1258 | VisitRRR(this, kArm64Mul, node); |
| 1259 | } |
| 1260 | |
| 1261 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1262 | void InstructionSelector::VisitInt32MulHigh(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1263 | Arm64OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1264 | InstructionOperand const smull_operand = g.TempRegister(); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1265 | Emit(kArm64Smull, smull_operand, g.UseRegister(node->InputAt(0)), |
| 1266 | g.UseRegister(node->InputAt(1))); |
| 1267 | Emit(kArm64Asr, g.DefineAsRegister(node), smull_operand, g.TempImmediate(32)); |
| 1268 | } |
| 1269 | |
| 1270 | |
| 1271 | void InstructionSelector::VisitUint32MulHigh(Node* node) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1272 | Arm64OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1273 | InstructionOperand const smull_operand = g.TempRegister(); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1274 | Emit(kArm64Umull, smull_operand, g.UseRegister(node->InputAt(0)), |
| 1275 | g.UseRegister(node->InputAt(1))); |
| 1276 | Emit(kArm64Lsr, g.DefineAsRegister(node), smull_operand, g.TempImmediate(32)); |
| 1277 | } |
| 1278 | |
| 1279 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1280 | void InstructionSelector::VisitInt32Div(Node* node) { |
| 1281 | VisitRRR(this, kArm64Idiv32, node); |
| 1282 | } |
| 1283 | |
| 1284 | |
| 1285 | void InstructionSelector::VisitInt64Div(Node* node) { |
| 1286 | VisitRRR(this, kArm64Idiv, node); |
| 1287 | } |
| 1288 | |
| 1289 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1290 | void InstructionSelector::VisitUint32Div(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1291 | VisitRRR(this, kArm64Udiv32, node); |
| 1292 | } |
| 1293 | |
| 1294 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1295 | void InstructionSelector::VisitUint64Div(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1296 | VisitRRR(this, kArm64Udiv, node); |
| 1297 | } |
| 1298 | |
| 1299 | |
| 1300 | void InstructionSelector::VisitInt32Mod(Node* node) { |
| 1301 | VisitRRR(this, kArm64Imod32, node); |
| 1302 | } |
| 1303 | |
| 1304 | |
| 1305 | void InstructionSelector::VisitInt64Mod(Node* node) { |
| 1306 | VisitRRR(this, kArm64Imod, node); |
| 1307 | } |
| 1308 | |
| 1309 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1310 | void InstructionSelector::VisitUint32Mod(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1311 | VisitRRR(this, kArm64Umod32, node); |
| 1312 | } |
| 1313 | |
| 1314 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1315 | void InstructionSelector::VisitUint64Mod(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1316 | VisitRRR(this, kArm64Umod, node); |
| 1317 | } |
| 1318 | |
| 1319 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1320 | void InstructionSelector::VisitChangeFloat32ToFloat64(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1321 | VisitRR(this, kArm64Float32ToFloat64, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1322 | } |
| 1323 | |
| 1324 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1325 | void InstructionSelector::VisitRoundInt32ToFloat32(Node* node) { |
| 1326 | VisitRR(this, kArm64Int32ToFloat32, node); |
| 1327 | } |
| 1328 | |
| 1329 | |
| 1330 | void InstructionSelector::VisitRoundUint32ToFloat32(Node* node) { |
| 1331 | VisitRR(this, kArm64Uint32ToFloat32, node); |
| 1332 | } |
| 1333 | |
| 1334 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1335 | void InstructionSelector::VisitChangeInt32ToFloat64(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1336 | VisitRR(this, kArm64Int32ToFloat64, node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1337 | } |
| 1338 | |
| 1339 | |
| 1340 | void InstructionSelector::VisitChangeUint32ToFloat64(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1341 | VisitRR(this, kArm64Uint32ToFloat64, node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1342 | } |
| 1343 | |
| 1344 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1345 | void InstructionSelector::VisitTruncateFloat32ToInt32(Node* node) { |
| 1346 | VisitRR(this, kArm64Float32ToInt32, node); |
| 1347 | } |
| 1348 | |
| 1349 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1350 | void InstructionSelector::VisitChangeFloat64ToInt32(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1351 | VisitRR(this, kArm64Float64ToInt32, node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1352 | } |
| 1353 | |
| 1354 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1355 | void InstructionSelector::VisitTruncateFloat32ToUint32(Node* node) { |
| 1356 | VisitRR(this, kArm64Float32ToUint32, node); |
| 1357 | } |
| 1358 | |
| 1359 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1360 | void InstructionSelector::VisitChangeFloat64ToUint32(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1361 | VisitRR(this, kArm64Float64ToUint32, node); |
| 1362 | } |
| 1363 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1364 | void InstructionSelector::VisitTruncateFloat64ToUint32(Node* node) { |
| 1365 | VisitRR(this, kArm64Float64ToUint32, node); |
| 1366 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1367 | |
| 1368 | void InstructionSelector::VisitTryTruncateFloat32ToInt64(Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1369 | Arm64OperandGenerator g(this); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1370 | |
| 1371 | InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; |
| 1372 | InstructionOperand outputs[2]; |
| 1373 | size_t output_count = 0; |
| 1374 | outputs[output_count++] = g.DefineAsRegister(node); |
| 1375 | |
| 1376 | Node* success_output = NodeProperties::FindProjection(node, 1); |
| 1377 | if (success_output) { |
| 1378 | outputs[output_count++] = g.DefineAsRegister(success_output); |
| 1379 | } |
| 1380 | |
| 1381 | Emit(kArm64Float32ToInt64, output_count, outputs, 1, inputs); |
| 1382 | } |
| 1383 | |
| 1384 | |
| 1385 | void InstructionSelector::VisitTryTruncateFloat64ToInt64(Node* node) { |
| 1386 | Arm64OperandGenerator g(this); |
| 1387 | |
| 1388 | InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; |
| 1389 | InstructionOperand outputs[2]; |
| 1390 | size_t output_count = 0; |
| 1391 | outputs[output_count++] = g.DefineAsRegister(node); |
| 1392 | |
| 1393 | Node* success_output = NodeProperties::FindProjection(node, 1); |
| 1394 | if (success_output) { |
| 1395 | outputs[output_count++] = g.DefineAsRegister(success_output); |
| 1396 | } |
| 1397 | |
| 1398 | Emit(kArm64Float64ToInt64, output_count, outputs, 1, inputs); |
| 1399 | } |
| 1400 | |
| 1401 | |
| 1402 | void InstructionSelector::VisitTryTruncateFloat32ToUint64(Node* node) { |
| 1403 | Arm64OperandGenerator g(this); |
| 1404 | |
| 1405 | InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; |
| 1406 | InstructionOperand outputs[2]; |
| 1407 | size_t output_count = 0; |
| 1408 | outputs[output_count++] = g.DefineAsRegister(node); |
| 1409 | |
| 1410 | Node* success_output = NodeProperties::FindProjection(node, 1); |
| 1411 | if (success_output) { |
| 1412 | outputs[output_count++] = g.DefineAsRegister(success_output); |
| 1413 | } |
| 1414 | |
| 1415 | Emit(kArm64Float32ToUint64, output_count, outputs, 1, inputs); |
| 1416 | } |
| 1417 | |
| 1418 | |
| 1419 | void InstructionSelector::VisitTryTruncateFloat64ToUint64(Node* node) { |
| 1420 | Arm64OperandGenerator g(this); |
| 1421 | |
| 1422 | InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; |
| 1423 | InstructionOperand outputs[2]; |
| 1424 | size_t output_count = 0; |
| 1425 | outputs[output_count++] = g.DefineAsRegister(node); |
| 1426 | |
| 1427 | Node* success_output = NodeProperties::FindProjection(node, 1); |
| 1428 | if (success_output) { |
| 1429 | outputs[output_count++] = g.DefineAsRegister(success_output); |
| 1430 | } |
| 1431 | |
| 1432 | Emit(kArm64Float64ToUint64, output_count, outputs, 1, inputs); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1433 | } |
| 1434 | |
| 1435 | |
| 1436 | void InstructionSelector::VisitChangeInt32ToInt64(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1437 | VisitRR(this, kArm64Sxtw, node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1438 | } |
| 1439 | |
| 1440 | |
| 1441 | void InstructionSelector::VisitChangeUint32ToUint64(Node* node) { |
| 1442 | Arm64OperandGenerator g(this); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1443 | Node* value = node->InputAt(0); |
| 1444 | switch (value->opcode()) { |
| 1445 | case IrOpcode::kWord32And: |
| 1446 | case IrOpcode::kWord32Or: |
| 1447 | case IrOpcode::kWord32Xor: |
| 1448 | case IrOpcode::kWord32Shl: |
| 1449 | case IrOpcode::kWord32Shr: |
| 1450 | case IrOpcode::kWord32Sar: |
| 1451 | case IrOpcode::kWord32Ror: |
| 1452 | case IrOpcode::kWord32Equal: |
| 1453 | case IrOpcode::kInt32Add: |
| 1454 | case IrOpcode::kInt32AddWithOverflow: |
| 1455 | case IrOpcode::kInt32Sub: |
| 1456 | case IrOpcode::kInt32SubWithOverflow: |
| 1457 | case IrOpcode::kInt32Mul: |
| 1458 | case IrOpcode::kInt32MulHigh: |
| 1459 | case IrOpcode::kInt32Div: |
| 1460 | case IrOpcode::kInt32Mod: |
| 1461 | case IrOpcode::kInt32LessThan: |
| 1462 | case IrOpcode::kInt32LessThanOrEqual: |
| 1463 | case IrOpcode::kUint32Div: |
| 1464 | case IrOpcode::kUint32LessThan: |
| 1465 | case IrOpcode::kUint32LessThanOrEqual: |
| 1466 | case IrOpcode::kUint32Mod: |
| 1467 | case IrOpcode::kUint32MulHigh: { |
| 1468 | // 32-bit operations will write their result in a W register (implicitly |
| 1469 | // clearing the top 32-bit of the corresponding X register) so the |
| 1470 | // zero-extension is a no-op. |
| 1471 | Emit(kArchNop, g.DefineSameAsFirst(node), g.Use(value)); |
| 1472 | return; |
| 1473 | } |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 1474 | case IrOpcode::kLoad: { |
| 1475 | // As for the operations above, a 32-bit load will implicitly clear the |
| 1476 | // top 32 bits of the destination register. |
| 1477 | LoadRepresentation load_rep = LoadRepresentationOf(value->op()); |
| 1478 | switch (load_rep.representation()) { |
| 1479 | case MachineRepresentation::kWord8: |
| 1480 | case MachineRepresentation::kWord16: |
| 1481 | case MachineRepresentation::kWord32: |
| 1482 | Emit(kArchNop, g.DefineSameAsFirst(node), g.Use(value)); |
| 1483 | return; |
| 1484 | default: |
| 1485 | break; |
| 1486 | } |
| 1487 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1488 | default: |
| 1489 | break; |
| 1490 | } |
| 1491 | Emit(kArm64Mov32, g.DefineAsRegister(node), g.UseRegister(value)); |
| 1492 | } |
| 1493 | |
| 1494 | |
| 1495 | void InstructionSelector::VisitTruncateFloat64ToFloat32(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1496 | VisitRR(this, kArm64Float64ToFloat32, node); |
| 1497 | } |
| 1498 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 1499 | void InstructionSelector::VisitTruncateFloat64ToWord32(Node* node) { |
| 1500 | VisitRR(this, kArchTruncateDoubleToI, node); |
| 1501 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1502 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 1503 | void InstructionSelector::VisitRoundFloat64ToInt32(Node* node) { |
| 1504 | VisitRR(this, kArm64Float64ToInt32, node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1505 | } |
| 1506 | |
| 1507 | |
| 1508 | void InstructionSelector::VisitTruncateInt64ToInt32(Node* node) { |
| 1509 | Arm64OperandGenerator g(this); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1510 | Node* value = node->InputAt(0); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1511 | if (CanCover(node, value) && value->InputCount() >= 2) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1512 | Int64BinopMatcher m(value); |
| 1513 | if ((m.IsWord64Sar() && m.right().HasValue() && |
| 1514 | (m.right().Value() == 32)) || |
| 1515 | (m.IsWord64Shr() && m.right().IsInRange(32, 63))) { |
| 1516 | Emit(kArm64Lsr, g.DefineAsRegister(node), g.UseRegister(m.left().node()), |
| 1517 | g.UseImmediate(m.right().node())); |
| 1518 | return; |
| 1519 | } |
| 1520 | } |
| 1521 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1522 | Emit(kArm64Mov32, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0))); |
| 1523 | } |
| 1524 | |
| 1525 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1526 | void InstructionSelector::VisitRoundInt64ToFloat32(Node* node) { |
| 1527 | VisitRR(this, kArm64Int64ToFloat32, node); |
| 1528 | } |
| 1529 | |
| 1530 | |
| 1531 | void InstructionSelector::VisitRoundInt64ToFloat64(Node* node) { |
| 1532 | VisitRR(this, kArm64Int64ToFloat64, node); |
| 1533 | } |
| 1534 | |
| 1535 | |
| 1536 | void InstructionSelector::VisitRoundUint64ToFloat32(Node* node) { |
| 1537 | VisitRR(this, kArm64Uint64ToFloat32, node); |
| 1538 | } |
| 1539 | |
| 1540 | |
| 1541 | void InstructionSelector::VisitRoundUint64ToFloat64(Node* node) { |
| 1542 | VisitRR(this, kArm64Uint64ToFloat64, node); |
| 1543 | } |
| 1544 | |
| 1545 | |
| 1546 | void InstructionSelector::VisitBitcastFloat32ToInt32(Node* node) { |
| 1547 | VisitRR(this, kArm64Float64ExtractLowWord32, node); |
| 1548 | } |
| 1549 | |
| 1550 | |
| 1551 | void InstructionSelector::VisitBitcastFloat64ToInt64(Node* node) { |
| 1552 | VisitRR(this, kArm64U64MoveFloat64, node); |
| 1553 | } |
| 1554 | |
| 1555 | |
| 1556 | void InstructionSelector::VisitBitcastInt32ToFloat32(Node* node) { |
| 1557 | VisitRR(this, kArm64Float64MoveU64, node); |
| 1558 | } |
| 1559 | |
| 1560 | |
| 1561 | void InstructionSelector::VisitBitcastInt64ToFloat64(Node* node) { |
| 1562 | VisitRR(this, kArm64Float64MoveU64, node); |
| 1563 | } |
| 1564 | |
| 1565 | |
| 1566 | void InstructionSelector::VisitFloat32Add(Node* node) { |
| 1567 | VisitRRR(this, kArm64Float32Add, node); |
| 1568 | } |
| 1569 | |
| 1570 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1571 | void InstructionSelector::VisitFloat64Add(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1572 | VisitRRR(this, kArm64Float64Add, node); |
| 1573 | } |
| 1574 | |
| 1575 | |
| 1576 | void InstructionSelector::VisitFloat32Sub(Node* node) { |
| 1577 | VisitRRR(this, kArm64Float32Sub, node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1578 | } |
| 1579 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 1580 | void InstructionSelector::VisitFloat32SubPreserveNan(Node* node) { |
| 1581 | VisitRRR(this, kArm64Float32Sub, node); |
| 1582 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1583 | |
| 1584 | void InstructionSelector::VisitFloat64Sub(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1585 | Arm64OperandGenerator g(this); |
| 1586 | Float64BinopMatcher m(node); |
| 1587 | if (m.left().IsMinusZero()) { |
| 1588 | if (m.right().IsFloat64RoundDown() && |
| 1589 | CanCover(m.node(), m.right().node())) { |
| 1590 | if (m.right().InputAt(0)->opcode() == IrOpcode::kFloat64Sub && |
| 1591 | CanCover(m.right().node(), m.right().InputAt(0))) { |
| 1592 | Float64BinopMatcher mright0(m.right().InputAt(0)); |
| 1593 | if (mright0.left().IsMinusZero()) { |
| 1594 | Emit(kArm64Float64RoundUp, g.DefineAsRegister(node), |
| 1595 | g.UseRegister(mright0.right().node())); |
| 1596 | return; |
| 1597 | } |
| 1598 | } |
| 1599 | } |
| 1600 | Emit(kArm64Float64Neg, g.DefineAsRegister(node), |
| 1601 | g.UseRegister(m.right().node())); |
| 1602 | return; |
| 1603 | } |
| 1604 | VisitRRR(this, kArm64Float64Sub, node); |
| 1605 | } |
| 1606 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 1607 | void InstructionSelector::VisitFloat64SubPreserveNan(Node* node) { |
| 1608 | VisitRRR(this, kArm64Float64Sub, node); |
| 1609 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1610 | |
| 1611 | void InstructionSelector::VisitFloat32Mul(Node* node) { |
| 1612 | VisitRRR(this, kArm64Float32Mul, node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1613 | } |
| 1614 | |
| 1615 | |
| 1616 | void InstructionSelector::VisitFloat64Mul(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1617 | VisitRRR(this, kArm64Float64Mul, node); |
| 1618 | } |
| 1619 | |
| 1620 | |
| 1621 | void InstructionSelector::VisitFloat32Div(Node* node) { |
| 1622 | VisitRRR(this, kArm64Float32Div, node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1623 | } |
| 1624 | |
| 1625 | |
| 1626 | void InstructionSelector::VisitFloat64Div(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1627 | VisitRRR(this, kArm64Float64Div, node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1628 | } |
| 1629 | |
| 1630 | |
| 1631 | void InstructionSelector::VisitFloat64Mod(Node* node) { |
| 1632 | Arm64OperandGenerator g(this); |
| 1633 | Emit(kArm64Float64Mod, g.DefineAsFixed(node, d0), |
| 1634 | g.UseFixed(node->InputAt(0), d0), |
| 1635 | g.UseFixed(node->InputAt(1), d1))->MarkAsCall(); |
| 1636 | } |
| 1637 | |
| 1638 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1639 | void InstructionSelector::VisitFloat32Max(Node* node) { |
| 1640 | VisitRRR(this, kArm64Float32Max, node); |
| 1641 | } |
| 1642 | |
| 1643 | |
| 1644 | void InstructionSelector::VisitFloat64Max(Node* node) { |
| 1645 | VisitRRR(this, kArm64Float64Max, node); |
| 1646 | } |
| 1647 | |
| 1648 | |
| 1649 | void InstructionSelector::VisitFloat32Min(Node* node) { |
| 1650 | VisitRRR(this, kArm64Float32Min, node); |
| 1651 | } |
| 1652 | |
| 1653 | |
| 1654 | void InstructionSelector::VisitFloat64Min(Node* node) { |
| 1655 | VisitRRR(this, kArm64Float64Min, node); |
| 1656 | } |
| 1657 | |
| 1658 | |
| 1659 | void InstructionSelector::VisitFloat32Abs(Node* node) { |
| 1660 | VisitRR(this, kArm64Float32Abs, node); |
| 1661 | } |
| 1662 | |
| 1663 | |
| 1664 | void InstructionSelector::VisitFloat64Abs(Node* node) { |
| 1665 | VisitRR(this, kArm64Float64Abs, node); |
| 1666 | } |
| 1667 | |
| 1668 | |
| 1669 | void InstructionSelector::VisitFloat32Sqrt(Node* node) { |
| 1670 | VisitRR(this, kArm64Float32Sqrt, node); |
| 1671 | } |
| 1672 | |
| 1673 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1674 | void InstructionSelector::VisitFloat64Sqrt(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1675 | VisitRR(this, kArm64Float64Sqrt, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1676 | } |
| 1677 | |
| 1678 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1679 | void InstructionSelector::VisitFloat32RoundDown(Node* node) { |
| 1680 | VisitRR(this, kArm64Float32RoundDown, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1681 | } |
| 1682 | |
| 1683 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1684 | void InstructionSelector::VisitFloat64RoundDown(Node* node) { |
| 1685 | VisitRR(this, kArm64Float64RoundDown, node); |
| 1686 | } |
| 1687 | |
| 1688 | |
| 1689 | void InstructionSelector::VisitFloat32RoundUp(Node* node) { |
| 1690 | VisitRR(this, kArm64Float32RoundUp, node); |
| 1691 | } |
| 1692 | |
| 1693 | |
| 1694 | void InstructionSelector::VisitFloat64RoundUp(Node* node) { |
| 1695 | VisitRR(this, kArm64Float64RoundUp, node); |
| 1696 | } |
| 1697 | |
| 1698 | |
| 1699 | void InstructionSelector::VisitFloat32RoundTruncate(Node* node) { |
| 1700 | VisitRR(this, kArm64Float32RoundTruncate, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1701 | } |
| 1702 | |
| 1703 | |
| 1704 | void InstructionSelector::VisitFloat64RoundTruncate(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1705 | VisitRR(this, kArm64Float64RoundTruncate, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1706 | } |
| 1707 | |
| 1708 | |
| 1709 | void InstructionSelector::VisitFloat64RoundTiesAway(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1710 | VisitRR(this, kArm64Float64RoundTiesAway, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1711 | } |
| 1712 | |
| 1713 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1714 | void InstructionSelector::VisitFloat32RoundTiesEven(Node* node) { |
| 1715 | VisitRR(this, kArm64Float32RoundTiesEven, node); |
| 1716 | } |
| 1717 | |
| 1718 | |
| 1719 | void InstructionSelector::VisitFloat64RoundTiesEven(Node* node) { |
| 1720 | VisitRR(this, kArm64Float64RoundTiesEven, node); |
| 1721 | } |
| 1722 | |
| 1723 | |
| 1724 | void InstructionSelector::EmitPrepareArguments( |
| 1725 | ZoneVector<PushParameter>* arguments, const CallDescriptor* descriptor, |
| 1726 | Node* node) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1727 | Arm64OperandGenerator g(this); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1728 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1729 | bool from_native_stack = linkage()->GetIncomingDescriptor()->UseNativeStack(); |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1730 | bool to_native_stack = descriptor->UseNativeStack(); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1731 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1732 | bool always_claim = to_native_stack != from_native_stack; |
| 1733 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1734 | int claim_count = static_cast<int>(arguments->size()); |
| 1735 | int slot = claim_count - 1; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1736 | // Bump the stack pointer(s). |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1737 | if (claim_count > 0 || always_claim) { |
| 1738 | // TODO(titzer): claim and poke probably take small immediates. |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1739 | // TODO(titzer): it would be better to bump the csp here only |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1740 | // and emit paired stores with increment for non c frames. |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1741 | ArchOpcode claim = to_native_stack ? kArm64ClaimCSP : kArm64ClaimJSSP; |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1742 | // Claim(0) isn't a nop if there is a mismatch between CSP and JSSP. |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1743 | Emit(claim, g.NoOutput(), g.TempImmediate(claim_count)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1744 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1745 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1746 | // Poke the arguments into the stack. |
| 1747 | ArchOpcode poke = to_native_stack ? kArm64PokeCSP : kArm64PokeJSSP; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1748 | while (slot >= 0) { |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1749 | Emit(poke, g.NoOutput(), g.UseRegister((*arguments)[slot].node()), |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1750 | g.TempImmediate(slot)); |
| 1751 | slot--; |
| 1752 | // TODO(ahaas): Poke arguments in pairs if two subsequent arguments have the |
| 1753 | // same type. |
| 1754 | // Emit(kArm64PokePair, g.NoOutput(), g.UseRegister((*arguments)[slot]), |
| 1755 | // g.UseRegister((*arguments)[slot - 1]), g.TempImmediate(slot)); |
| 1756 | // slot -= 2; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1757 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1758 | } |
| 1759 | |
| 1760 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1761 | bool InstructionSelector::IsTailCallAddressImmediate() { return false; } |
| 1762 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1763 | int InstructionSelector::GetTempsCountForTailCallFromJSFunction() { return 3; } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1764 | |
| 1765 | namespace { |
| 1766 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1767 | // Shared routine for multiple compare operations. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1768 | void VisitCompare(InstructionSelector* selector, InstructionCode opcode, |
| 1769 | InstructionOperand left, InstructionOperand right, |
| 1770 | FlagsContinuation* cont) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1771 | Arm64OperandGenerator g(selector); |
| 1772 | opcode = cont->Encode(opcode); |
| 1773 | if (cont->IsBranch()) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1774 | selector->Emit(opcode, g.NoOutput(), left, right, |
| 1775 | g.Label(cont->true_block()), g.Label(cont->false_block())); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1776 | } else if (cont->IsDeoptimize()) { |
| 1777 | selector->EmitDeoptimize(opcode, g.NoOutput(), left, right, |
| 1778 | cont->frame_state()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1779 | } else { |
| 1780 | DCHECK(cont->IsSet()); |
| 1781 | selector->Emit(opcode, g.DefineAsRegister(cont->result()), left, right); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1782 | } |
| 1783 | } |
| 1784 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1785 | |
| 1786 | // Shared routine for multiple word compare operations. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1787 | void VisitWordCompare(InstructionSelector* selector, Node* node, |
| 1788 | InstructionCode opcode, FlagsContinuation* cont, |
| 1789 | bool commutative, ImmediateMode immediate_mode) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1790 | Arm64OperandGenerator g(selector); |
| 1791 | Node* left = node->InputAt(0); |
| 1792 | Node* right = node->InputAt(1); |
| 1793 | |
| 1794 | // Match immediates on left or right side of comparison. |
| 1795 | if (g.CanBeImmediate(right, immediate_mode)) { |
| 1796 | VisitCompare(selector, opcode, g.UseRegister(left), g.UseImmediate(right), |
| 1797 | cont); |
| 1798 | } else if (g.CanBeImmediate(left, immediate_mode)) { |
| 1799 | if (!commutative) cont->Commute(); |
| 1800 | VisitCompare(selector, opcode, g.UseRegister(right), g.UseImmediate(left), |
| 1801 | cont); |
| 1802 | } else { |
| 1803 | VisitCompare(selector, opcode, g.UseRegister(left), g.UseRegister(right), |
| 1804 | cont); |
| 1805 | } |
| 1806 | } |
| 1807 | |
| 1808 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1809 | void VisitWord32Compare(InstructionSelector* selector, Node* node, |
| 1810 | FlagsContinuation* cont) { |
| 1811 | Int32BinopMatcher m(node); |
| 1812 | ArchOpcode opcode = kArm64Cmp32; |
| 1813 | |
| 1814 | // Select negated compare for comparisons with negated right input. |
| 1815 | if (m.right().IsInt32Sub()) { |
| 1816 | Node* sub = m.right().node(); |
| 1817 | Int32BinopMatcher msub(sub); |
| 1818 | if (msub.left().Is(0)) { |
| 1819 | bool can_cover = selector->CanCover(node, sub); |
| 1820 | node->ReplaceInput(1, msub.right().node()); |
| 1821 | // Even if the comparison node covers the subtraction, after the input |
| 1822 | // replacement above, the node still won't cover the input to the |
| 1823 | // subtraction; the subtraction still uses it. |
| 1824 | // In order to get shifted operations to work, we must remove the rhs |
| 1825 | // input to the subtraction, as TryMatchAnyShift requires this node to |
| 1826 | // cover the input shift. We do this by setting it to the lhs input, |
| 1827 | // as we know it's zero, and the result of the subtraction isn't used by |
| 1828 | // any other node. |
| 1829 | if (can_cover) sub->ReplaceInput(1, msub.left().node()); |
| 1830 | opcode = kArm64Cmn32; |
| 1831 | } |
| 1832 | } |
| 1833 | VisitBinop<Int32BinopMatcher>(selector, node, opcode, kArithmeticImm, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1834 | } |
| 1835 | |
| 1836 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1837 | void VisitWordTest(InstructionSelector* selector, Node* node, |
| 1838 | InstructionCode opcode, FlagsContinuation* cont) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1839 | Arm64OperandGenerator g(selector); |
| 1840 | VisitCompare(selector, opcode, g.UseRegister(node), g.UseRegister(node), |
| 1841 | cont); |
| 1842 | } |
| 1843 | |
| 1844 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1845 | void VisitWord32Test(InstructionSelector* selector, Node* node, |
| 1846 | FlagsContinuation* cont) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1847 | VisitWordTest(selector, node, kArm64Tst32, cont); |
| 1848 | } |
| 1849 | |
| 1850 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1851 | void VisitWord64Test(InstructionSelector* selector, Node* node, |
| 1852 | FlagsContinuation* cont) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1853 | VisitWordTest(selector, node, kArm64Tst, cont); |
| 1854 | } |
| 1855 | |
| 1856 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1857 | // Shared routine for multiple float32 compare operations. |
| 1858 | void VisitFloat32Compare(InstructionSelector* selector, Node* node, |
| 1859 | FlagsContinuation* cont) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1860 | Arm64OperandGenerator g(selector); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1861 | Float32BinopMatcher m(node); |
| 1862 | if (m.right().Is(0.0f)) { |
| 1863 | VisitCompare(selector, kArm64Float32Cmp, g.UseRegister(m.left().node()), |
| 1864 | g.UseImmediate(m.right().node()), cont); |
| 1865 | } else if (m.left().Is(0.0f)) { |
| 1866 | cont->Commute(); |
| 1867 | VisitCompare(selector, kArm64Float32Cmp, g.UseRegister(m.right().node()), |
| 1868 | g.UseImmediate(m.left().node()), cont); |
| 1869 | } else { |
| 1870 | VisitCompare(selector, kArm64Float32Cmp, g.UseRegister(m.left().node()), |
| 1871 | g.UseRegister(m.right().node()), cont); |
| 1872 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1873 | } |
| 1874 | |
| 1875 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1876 | // Shared routine for multiple float64 compare operations. |
| 1877 | void VisitFloat64Compare(InstructionSelector* selector, Node* node, |
| 1878 | FlagsContinuation* cont) { |
| 1879 | Arm64OperandGenerator g(selector); |
| 1880 | Float64BinopMatcher m(node); |
| 1881 | if (m.right().Is(0.0)) { |
| 1882 | VisitCompare(selector, kArm64Float64Cmp, g.UseRegister(m.left().node()), |
| 1883 | g.UseImmediate(m.right().node()), cont); |
| 1884 | } else if (m.left().Is(0.0)) { |
| 1885 | cont->Commute(); |
| 1886 | VisitCompare(selector, kArm64Float64Cmp, g.UseRegister(m.right().node()), |
| 1887 | g.UseImmediate(m.left().node()), cont); |
| 1888 | } else { |
| 1889 | VisitCompare(selector, kArm64Float64Cmp, g.UseRegister(m.left().node()), |
| 1890 | g.UseRegister(m.right().node()), cont); |
| 1891 | } |
| 1892 | } |
| 1893 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1894 | void VisitWordCompareZero(InstructionSelector* selector, Node* user, |
| 1895 | Node* value, FlagsContinuation* cont) { |
| 1896 | Arm64OperandGenerator g(selector); |
| 1897 | while (selector->CanCover(user, value)) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1898 | switch (value->opcode()) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1899 | case IrOpcode::kWord32Equal: { |
| 1900 | Int32BinopMatcher m(value); |
| 1901 | if (m.right().Is(0)) { |
| 1902 | user = value; |
| 1903 | value = m.left().node(); |
| 1904 | cont->Negate(); |
| 1905 | continue; |
| 1906 | } |
| 1907 | cont->OverwriteAndNegateIfEqual(kEqual); |
| 1908 | return VisitWord32Compare(selector, value, cont); |
| 1909 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1910 | case IrOpcode::kInt32LessThan: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1911 | cont->OverwriteAndNegateIfEqual(kSignedLessThan); |
| 1912 | return VisitWord32Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1913 | case IrOpcode::kInt32LessThanOrEqual: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1914 | cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual); |
| 1915 | return VisitWord32Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1916 | case IrOpcode::kUint32LessThan: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1917 | cont->OverwriteAndNegateIfEqual(kUnsignedLessThan); |
| 1918 | return VisitWord32Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1919 | case IrOpcode::kUint32LessThanOrEqual: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1920 | cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual); |
| 1921 | return VisitWord32Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1922 | case IrOpcode::kWord64Equal: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1923 | cont->OverwriteAndNegateIfEqual(kEqual); |
| 1924 | return VisitWordCompare(selector, value, kArm64Cmp, cont, false, |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1925 | kArithmeticImm); |
| 1926 | case IrOpcode::kInt64LessThan: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1927 | cont->OverwriteAndNegateIfEqual(kSignedLessThan); |
| 1928 | return VisitWordCompare(selector, value, kArm64Cmp, cont, false, |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1929 | kArithmeticImm); |
| 1930 | case IrOpcode::kInt64LessThanOrEqual: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1931 | cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual); |
| 1932 | return VisitWordCompare(selector, value, kArm64Cmp, cont, false, |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1933 | kArithmeticImm); |
| 1934 | case IrOpcode::kUint64LessThan: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1935 | cont->OverwriteAndNegateIfEqual(kUnsignedLessThan); |
| 1936 | return VisitWordCompare(selector, value, kArm64Cmp, cont, false, |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1937 | kArithmeticImm); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1938 | case IrOpcode::kUint64LessThanOrEqual: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1939 | cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual); |
| 1940 | return VisitWordCompare(selector, value, kArm64Cmp, cont, false, |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1941 | kArithmeticImm); |
| 1942 | case IrOpcode::kFloat32Equal: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1943 | cont->OverwriteAndNegateIfEqual(kEqual); |
| 1944 | return VisitFloat32Compare(selector, value, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1945 | case IrOpcode::kFloat32LessThan: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1946 | cont->OverwriteAndNegateIfEqual(kFloatLessThan); |
| 1947 | return VisitFloat32Compare(selector, value, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1948 | case IrOpcode::kFloat32LessThanOrEqual: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1949 | cont->OverwriteAndNegateIfEqual(kFloatLessThanOrEqual); |
| 1950 | return VisitFloat32Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1951 | case IrOpcode::kFloat64Equal: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1952 | cont->OverwriteAndNegateIfEqual(kEqual); |
| 1953 | return VisitFloat64Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1954 | case IrOpcode::kFloat64LessThan: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1955 | cont->OverwriteAndNegateIfEqual(kFloatLessThan); |
| 1956 | return VisitFloat64Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1957 | case IrOpcode::kFloat64LessThanOrEqual: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1958 | cont->OverwriteAndNegateIfEqual(kFloatLessThanOrEqual); |
| 1959 | return VisitFloat64Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1960 | case IrOpcode::kProjection: |
| 1961 | // Check if this is the overflow output projection of an |
| 1962 | // <Operation>WithOverflow node. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1963 | if (ProjectionIndexOf(value->op()) == 1u) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1964 | // We cannot combine the <Operation>WithOverflow with this branch |
| 1965 | // unless the 0th projection (the use of the actual value of the |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1966 | // <Operation> is either nullptr, which means there's no use of the |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1967 | // actual value, or was already defined, which means it is scheduled |
| 1968 | // *AFTER* this branch). |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1969 | Node* const node = value->InputAt(0); |
| 1970 | Node* const result = NodeProperties::FindProjection(node, 0); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1971 | if (result == nullptr || selector->IsDefined(result)) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1972 | switch (node->opcode()) { |
| 1973 | case IrOpcode::kInt32AddWithOverflow: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1974 | cont->OverwriteAndNegateIfEqual(kOverflow); |
| 1975 | return VisitBinop<Int32BinopMatcher>( |
| 1976 | selector, node, kArm64Add32, kArithmeticImm, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1977 | case IrOpcode::kInt32SubWithOverflow: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1978 | cont->OverwriteAndNegateIfEqual(kOverflow); |
| 1979 | return VisitBinop<Int32BinopMatcher>( |
| 1980 | selector, node, kArm64Sub32, kArithmeticImm, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1981 | case IrOpcode::kInt64AddWithOverflow: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1982 | cont->OverwriteAndNegateIfEqual(kOverflow); |
| 1983 | return VisitBinop<Int64BinopMatcher>(selector, node, kArm64Add, |
| 1984 | kArithmeticImm, cont); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 1985 | case IrOpcode::kInt64SubWithOverflow: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1986 | cont->OverwriteAndNegateIfEqual(kOverflow); |
| 1987 | return VisitBinop<Int64BinopMatcher>(selector, node, kArm64Sub, |
| 1988 | kArithmeticImm, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1989 | default: |
| 1990 | break; |
| 1991 | } |
| 1992 | } |
| 1993 | } |
| 1994 | break; |
| 1995 | case IrOpcode::kInt32Add: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1996 | return VisitWordCompare(selector, value, kArm64Cmn32, cont, true, |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1997 | kArithmeticImm); |
| 1998 | case IrOpcode::kInt32Sub: |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 1999 | return VisitWord32Compare(selector, value, cont); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2000 | case IrOpcode::kWord32And: { |
| 2001 | Int32BinopMatcher m(value); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2002 | if (cont->IsBranch() && m.right().HasValue() && |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2003 | (base::bits::CountPopulation32(m.right().Value()) == 1)) { |
| 2004 | // If the mask has only one bit set, we can use tbz/tbnz. |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2005 | DCHECK((cont->condition() == kEqual) || |
| 2006 | (cont->condition() == kNotEqual)); |
| 2007 | selector->Emit( |
| 2008 | cont->Encode(kArm64TestAndBranch32), g.NoOutput(), |
| 2009 | g.UseRegister(m.left().node()), |
| 2010 | g.TempImmediate( |
| 2011 | base::bits::CountTrailingZeros32(m.right().Value())), |
| 2012 | g.Label(cont->true_block()), g.Label(cont->false_block())); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2013 | return; |
| 2014 | } |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2015 | return VisitWordCompare(selector, value, kArm64Tst32, cont, true, |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2016 | kLogical32Imm); |
| 2017 | } |
| 2018 | case IrOpcode::kWord64And: { |
| 2019 | Int64BinopMatcher m(value); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2020 | if (cont->IsBranch() && m.right().HasValue() && |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2021 | (base::bits::CountPopulation64(m.right().Value()) == 1)) { |
| 2022 | // If the mask has only one bit set, we can use tbz/tbnz. |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2023 | DCHECK((cont->condition() == kEqual) || |
| 2024 | (cont->condition() == kNotEqual)); |
| 2025 | selector->Emit( |
| 2026 | cont->Encode(kArm64TestAndBranch), g.NoOutput(), |
| 2027 | g.UseRegister(m.left().node()), |
| 2028 | g.TempImmediate( |
| 2029 | base::bits::CountTrailingZeros64(m.right().Value())), |
| 2030 | g.Label(cont->true_block()), g.Label(cont->false_block())); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2031 | return; |
| 2032 | } |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2033 | return VisitWordCompare(selector, value, kArm64Tst, cont, true, |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2034 | kLogical64Imm); |
| 2035 | } |
| 2036 | default: |
| 2037 | break; |
| 2038 | } |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2039 | break; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2040 | } |
| 2041 | |
| 2042 | // Branch could not be combined with a compare, compare against 0 and branch. |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2043 | if (cont->IsBranch()) { |
| 2044 | selector->Emit(cont->Encode(kArm64CompareAndBranch32), g.NoOutput(), |
| 2045 | g.UseRegister(value), g.Label(cont->true_block()), |
| 2046 | g.Label(cont->false_block())); |
| 2047 | } else { |
| 2048 | DCHECK(cont->IsDeoptimize()); |
| 2049 | selector->EmitDeoptimize(cont->Encode(kArm64Tst32), g.NoOutput(), |
| 2050 | g.UseRegister(value), g.UseRegister(value), |
| 2051 | cont->frame_state()); |
| 2052 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2053 | } |
| 2054 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2055 | } // namespace |
| 2056 | |
| 2057 | void InstructionSelector::VisitBranch(Node* branch, BasicBlock* tbranch, |
| 2058 | BasicBlock* fbranch) { |
| 2059 | FlagsContinuation cont(kNotEqual, tbranch, fbranch); |
| 2060 | VisitWordCompareZero(this, branch, branch->InputAt(0), &cont); |
| 2061 | } |
| 2062 | |
| 2063 | void InstructionSelector::VisitDeoptimizeIf(Node* node) { |
| 2064 | FlagsContinuation cont = |
| 2065 | FlagsContinuation::ForDeoptimize(kNotEqual, node->InputAt(1)); |
| 2066 | VisitWordCompareZero(this, node, node->InputAt(0), &cont); |
| 2067 | } |
| 2068 | |
| 2069 | void InstructionSelector::VisitDeoptimizeUnless(Node* node) { |
| 2070 | FlagsContinuation cont = |
| 2071 | FlagsContinuation::ForDeoptimize(kEqual, node->InputAt(1)); |
| 2072 | VisitWordCompareZero(this, node, node->InputAt(0), &cont); |
| 2073 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2074 | |
| 2075 | void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) { |
| 2076 | Arm64OperandGenerator g(this); |
| 2077 | InstructionOperand value_operand = g.UseRegister(node->InputAt(0)); |
| 2078 | |
| 2079 | // Emit either ArchTableSwitch or ArchLookupSwitch. |
| 2080 | size_t table_space_cost = 4 + sw.value_range; |
| 2081 | size_t table_time_cost = 3; |
| 2082 | size_t lookup_space_cost = 3 + 2 * sw.case_count; |
| 2083 | size_t lookup_time_cost = sw.case_count; |
| 2084 | if (sw.case_count > 0 && |
| 2085 | table_space_cost + 3 * table_time_cost <= |
| 2086 | lookup_space_cost + 3 * lookup_time_cost && |
| 2087 | sw.min_value > std::numeric_limits<int32_t>::min()) { |
| 2088 | InstructionOperand index_operand = value_operand; |
| 2089 | if (sw.min_value) { |
| 2090 | index_operand = g.TempRegister(); |
| 2091 | Emit(kArm64Sub32, index_operand, value_operand, |
| 2092 | g.TempImmediate(sw.min_value)); |
| 2093 | } |
| 2094 | // Generate a table lookup. |
| 2095 | return EmitTableSwitch(sw, index_operand); |
| 2096 | } |
| 2097 | |
| 2098 | // Generate a sequence of conditional jumps. |
| 2099 | return EmitLookupSwitch(sw, value_operand); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2100 | } |
| 2101 | |
| 2102 | |
| 2103 | void InstructionSelector::VisitWord32Equal(Node* const node) { |
| 2104 | Node* const user = node; |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2105 | FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2106 | Int32BinopMatcher m(user); |
| 2107 | if (m.right().Is(0)) { |
| 2108 | Node* const value = m.left().node(); |
| 2109 | if (CanCover(user, value)) { |
| 2110 | switch (value->opcode()) { |
| 2111 | case IrOpcode::kInt32Add: |
| 2112 | return VisitWordCompare(this, value, kArm64Cmn32, &cont, true, |
| 2113 | kArithmeticImm); |
| 2114 | case IrOpcode::kInt32Sub: |
| 2115 | return VisitWordCompare(this, value, kArm64Cmp32, &cont, false, |
| 2116 | kArithmeticImm); |
| 2117 | case IrOpcode::kWord32And: |
| 2118 | return VisitWordCompare(this, value, kArm64Tst32, &cont, true, |
| 2119 | kLogical32Imm); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2120 | case IrOpcode::kWord32Equal: { |
| 2121 | // Word32Equal(Word32Equal(x, y), 0) => Word32Compare(x, y, ne). |
| 2122 | Int32BinopMatcher mequal(value); |
| 2123 | node->ReplaceInput(0, mequal.left().node()); |
| 2124 | node->ReplaceInput(1, mequal.right().node()); |
| 2125 | cont.Negate(); |
| 2126 | return VisitWord32Compare(this, node, &cont); |
| 2127 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2128 | default: |
| 2129 | break; |
| 2130 | } |
| 2131 | return VisitWord32Test(this, value, &cont); |
| 2132 | } |
| 2133 | } |
| 2134 | VisitWord32Compare(this, node, &cont); |
| 2135 | } |
| 2136 | |
| 2137 | |
| 2138 | void InstructionSelector::VisitInt32LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2139 | FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2140 | VisitWord32Compare(this, node, &cont); |
| 2141 | } |
| 2142 | |
| 2143 | |
| 2144 | void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2145 | FlagsContinuation cont = |
| 2146 | FlagsContinuation::ForSet(kSignedLessThanOrEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2147 | VisitWord32Compare(this, node, &cont); |
| 2148 | } |
| 2149 | |
| 2150 | |
| 2151 | void InstructionSelector::VisitUint32LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2152 | FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2153 | VisitWord32Compare(this, node, &cont); |
| 2154 | } |
| 2155 | |
| 2156 | |
| 2157 | void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2158 | FlagsContinuation cont = |
| 2159 | FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2160 | VisitWord32Compare(this, node, &cont); |
| 2161 | } |
| 2162 | |
| 2163 | |
| 2164 | void InstructionSelector::VisitWord64Equal(Node* const node) { |
| 2165 | Node* const user = node; |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2166 | FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2167 | Int64BinopMatcher m(user); |
| 2168 | if (m.right().Is(0)) { |
| 2169 | Node* const value = m.left().node(); |
| 2170 | if (CanCover(user, value)) { |
| 2171 | switch (value->opcode()) { |
| 2172 | case IrOpcode::kWord64And: |
| 2173 | return VisitWordCompare(this, value, kArm64Tst, &cont, true, |
| 2174 | kLogical64Imm); |
| 2175 | default: |
| 2176 | break; |
| 2177 | } |
| 2178 | return VisitWord64Test(this, value, &cont); |
| 2179 | } |
| 2180 | } |
| 2181 | VisitWordCompare(this, node, kArm64Cmp, &cont, false, kArithmeticImm); |
| 2182 | } |
| 2183 | |
| 2184 | |
| 2185 | void InstructionSelector::VisitInt32AddWithOverflow(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2186 | if (Node* ovf = NodeProperties::FindProjection(node, 1)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2187 | FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2188 | return VisitBinop<Int32BinopMatcher>(this, node, kArm64Add32, |
| 2189 | kArithmeticImm, &cont); |
| 2190 | } |
| 2191 | FlagsContinuation cont; |
| 2192 | VisitBinop<Int32BinopMatcher>(this, node, kArm64Add32, kArithmeticImm, &cont); |
| 2193 | } |
| 2194 | |
| 2195 | |
| 2196 | void InstructionSelector::VisitInt32SubWithOverflow(Node* node) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2197 | if (Node* ovf = NodeProperties::FindProjection(node, 1)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2198 | FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2199 | return VisitBinop<Int32BinopMatcher>(this, node, kArm64Sub32, |
| 2200 | kArithmeticImm, &cont); |
| 2201 | } |
| 2202 | FlagsContinuation cont; |
| 2203 | VisitBinop<Int32BinopMatcher>(this, node, kArm64Sub32, kArithmeticImm, &cont); |
| 2204 | } |
| 2205 | |
| 2206 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2207 | void InstructionSelector::VisitInt64AddWithOverflow(Node* node) { |
| 2208 | if (Node* ovf = NodeProperties::FindProjection(node, 1)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2209 | FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2210 | return VisitBinop<Int64BinopMatcher>(this, node, kArm64Add, kArithmeticImm, |
| 2211 | &cont); |
| 2212 | } |
| 2213 | FlagsContinuation cont; |
| 2214 | VisitBinop<Int64BinopMatcher>(this, node, kArm64Add, kArithmeticImm, &cont); |
| 2215 | } |
| 2216 | |
| 2217 | |
| 2218 | void InstructionSelector::VisitInt64SubWithOverflow(Node* node) { |
| 2219 | if (Node* ovf = NodeProperties::FindProjection(node, 1)) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2220 | FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2221 | return VisitBinop<Int64BinopMatcher>(this, node, kArm64Sub, kArithmeticImm, |
| 2222 | &cont); |
| 2223 | } |
| 2224 | FlagsContinuation cont; |
| 2225 | VisitBinop<Int64BinopMatcher>(this, node, kArm64Sub, kArithmeticImm, &cont); |
| 2226 | } |
| 2227 | |
| 2228 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2229 | void InstructionSelector::VisitInt64LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2230 | FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2231 | VisitWordCompare(this, node, kArm64Cmp, &cont, false, kArithmeticImm); |
| 2232 | } |
| 2233 | |
| 2234 | |
| 2235 | void InstructionSelector::VisitInt64LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2236 | FlagsContinuation cont = |
| 2237 | FlagsContinuation::ForSet(kSignedLessThanOrEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2238 | VisitWordCompare(this, node, kArm64Cmp, &cont, false, kArithmeticImm); |
| 2239 | } |
| 2240 | |
| 2241 | |
| 2242 | void InstructionSelector::VisitUint64LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2243 | FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2244 | VisitWordCompare(this, node, kArm64Cmp, &cont, false, kArithmeticImm); |
| 2245 | } |
| 2246 | |
| 2247 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2248 | void InstructionSelector::VisitUint64LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2249 | FlagsContinuation cont = |
| 2250 | FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2251 | VisitWordCompare(this, node, kArm64Cmp, &cont, false, kArithmeticImm); |
| 2252 | } |
| 2253 | |
| 2254 | |
| 2255 | void InstructionSelector::VisitFloat32Equal(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2256 | FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2257 | VisitFloat32Compare(this, node, &cont); |
| 2258 | } |
| 2259 | |
| 2260 | |
| 2261 | void InstructionSelector::VisitFloat32LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2262 | FlagsContinuation cont = FlagsContinuation::ForSet(kFloatLessThan, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2263 | VisitFloat32Compare(this, node, &cont); |
| 2264 | } |
| 2265 | |
| 2266 | |
| 2267 | void InstructionSelector::VisitFloat32LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2268 | FlagsContinuation cont = |
| 2269 | FlagsContinuation::ForSet(kFloatLessThanOrEqual, node); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2270 | VisitFloat32Compare(this, node, &cont); |
| 2271 | } |
| 2272 | |
| 2273 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2274 | void InstructionSelector::VisitFloat64Equal(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2275 | FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2276 | VisitFloat64Compare(this, node, &cont); |
| 2277 | } |
| 2278 | |
| 2279 | |
| 2280 | void InstructionSelector::VisitFloat64LessThan(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2281 | FlagsContinuation cont = FlagsContinuation::ForSet(kFloatLessThan, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2282 | VisitFloat64Compare(this, node, &cont); |
| 2283 | } |
| 2284 | |
| 2285 | |
| 2286 | void InstructionSelector::VisitFloat64LessThanOrEqual(Node* node) { |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 2287 | FlagsContinuation cont = |
| 2288 | FlagsContinuation::ForSet(kFloatLessThanOrEqual, node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2289 | VisitFloat64Compare(this, node, &cont); |
| 2290 | } |
| 2291 | |
| 2292 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2293 | void InstructionSelector::VisitFloat64ExtractLowWord32(Node* node) { |
| 2294 | Arm64OperandGenerator g(this); |
| 2295 | Emit(kArm64Float64ExtractLowWord32, g.DefineAsRegister(node), |
| 2296 | g.UseRegister(node->InputAt(0))); |
| 2297 | } |
| 2298 | |
| 2299 | |
| 2300 | void InstructionSelector::VisitFloat64ExtractHighWord32(Node* node) { |
| 2301 | Arm64OperandGenerator g(this); |
| 2302 | Emit(kArm64Float64ExtractHighWord32, g.DefineAsRegister(node), |
| 2303 | g.UseRegister(node->InputAt(0))); |
| 2304 | } |
| 2305 | |
| 2306 | |
| 2307 | void InstructionSelector::VisitFloat64InsertLowWord32(Node* node) { |
| 2308 | Arm64OperandGenerator g(this); |
| 2309 | Node* left = node->InputAt(0); |
| 2310 | Node* right = node->InputAt(1); |
| 2311 | if (left->opcode() == IrOpcode::kFloat64InsertHighWord32 && |
| 2312 | CanCover(node, left)) { |
| 2313 | Node* right_of_left = left->InputAt(1); |
| 2314 | Emit(kArm64Bfi, g.DefineSameAsFirst(right), g.UseRegister(right), |
| 2315 | g.UseRegister(right_of_left), g.TempImmediate(32), |
| 2316 | g.TempImmediate(32)); |
| 2317 | Emit(kArm64Float64MoveU64, g.DefineAsRegister(node), g.UseRegister(right)); |
| 2318 | return; |
| 2319 | } |
| 2320 | Emit(kArm64Float64InsertLowWord32, g.DefineAsRegister(node), |
| 2321 | g.UseRegister(left), g.UseRegister(right)); |
| 2322 | } |
| 2323 | |
| 2324 | |
| 2325 | void InstructionSelector::VisitFloat64InsertHighWord32(Node* node) { |
| 2326 | Arm64OperandGenerator g(this); |
| 2327 | Node* left = node->InputAt(0); |
| 2328 | Node* right = node->InputAt(1); |
| 2329 | if (left->opcode() == IrOpcode::kFloat64InsertLowWord32 && |
| 2330 | CanCover(node, left)) { |
| 2331 | Node* right_of_left = left->InputAt(1); |
| 2332 | Emit(kArm64Bfi, g.DefineSameAsFirst(left), g.UseRegister(right_of_left), |
| 2333 | g.UseRegister(right), g.TempImmediate(32), g.TempImmediate(32)); |
| 2334 | Emit(kArm64Float64MoveU64, g.DefineAsRegister(node), g.UseRegister(left)); |
| 2335 | return; |
| 2336 | } |
| 2337 | Emit(kArm64Float64InsertHighWord32, g.DefineAsRegister(node), |
| 2338 | g.UseRegister(left), g.UseRegister(right)); |
| 2339 | } |
| 2340 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 2341 | void InstructionSelector::VisitAtomicLoad(Node* node) { |
| 2342 | LoadRepresentation load_rep = LoadRepresentationOf(node->op()); |
| 2343 | Arm64OperandGenerator g(this); |
| 2344 | Node* base = node->InputAt(0); |
| 2345 | Node* index = node->InputAt(1); |
| 2346 | ArchOpcode opcode = kArchNop; |
| 2347 | switch (load_rep.representation()) { |
| 2348 | case MachineRepresentation::kWord8: |
| 2349 | opcode = load_rep.IsSigned() ? kAtomicLoadInt8 : kAtomicLoadUint8; |
| 2350 | break; |
| 2351 | case MachineRepresentation::kWord16: |
| 2352 | opcode = load_rep.IsSigned() ? kAtomicLoadInt16 : kAtomicLoadUint16; |
| 2353 | break; |
| 2354 | case MachineRepresentation::kWord32: |
| 2355 | opcode = kAtomicLoadWord32; |
| 2356 | break; |
| 2357 | default: |
| 2358 | UNREACHABLE(); |
| 2359 | return; |
| 2360 | } |
| 2361 | Emit(opcode | AddressingModeField::encode(kMode_MRR), |
| 2362 | g.DefineAsRegister(node), g.UseRegister(base), g.UseRegister(index)); |
| 2363 | } |
| 2364 | |
| 2365 | void InstructionSelector::VisitAtomicStore(Node* node) { |
| 2366 | MachineRepresentation rep = AtomicStoreRepresentationOf(node->op()); |
| 2367 | Arm64OperandGenerator g(this); |
| 2368 | Node* base = node->InputAt(0); |
| 2369 | Node* index = node->InputAt(1); |
| 2370 | Node* value = node->InputAt(2); |
| 2371 | ArchOpcode opcode = kArchNop; |
| 2372 | switch (rep) { |
| 2373 | case MachineRepresentation::kWord8: |
| 2374 | opcode = kAtomicStoreWord8; |
| 2375 | break; |
| 2376 | case MachineRepresentation::kWord16: |
| 2377 | opcode = kAtomicStoreWord16; |
| 2378 | break; |
| 2379 | case MachineRepresentation::kWord32: |
| 2380 | opcode = kAtomicStoreWord32; |
| 2381 | break; |
| 2382 | default: |
| 2383 | UNREACHABLE(); |
| 2384 | return; |
| 2385 | } |
| 2386 | |
| 2387 | AddressingMode addressing_mode = kMode_MRR; |
| 2388 | InstructionOperand inputs[3]; |
| 2389 | size_t input_count = 0; |
| 2390 | inputs[input_count++] = g.UseUniqueRegister(base); |
| 2391 | inputs[input_count++] = g.UseUniqueRegister(index); |
| 2392 | inputs[input_count++] = g.UseUniqueRegister(value); |
| 2393 | InstructionCode code = opcode | AddressingModeField::encode(addressing_mode); |
| 2394 | Emit(code, 0, nullptr, input_count, inputs); |
| 2395 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2396 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2397 | // static |
| 2398 | MachineOperatorBuilder::Flags |
| 2399 | InstructionSelector::SupportedMachineOperatorFlags() { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2400 | return MachineOperatorBuilder::kFloat32Max | |
| 2401 | MachineOperatorBuilder::kFloat32Min | |
| 2402 | MachineOperatorBuilder::kFloat32RoundDown | |
| 2403 | MachineOperatorBuilder::kFloat64Max | |
| 2404 | MachineOperatorBuilder::kFloat64Min | |
| 2405 | MachineOperatorBuilder::kFloat64RoundDown | |
| 2406 | MachineOperatorBuilder::kFloat32RoundUp | |
| 2407 | MachineOperatorBuilder::kFloat64RoundUp | |
| 2408 | MachineOperatorBuilder::kFloat32RoundTruncate | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2409 | MachineOperatorBuilder::kFloat64RoundTruncate | |
| 2410 | MachineOperatorBuilder::kFloat64RoundTiesAway | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2411 | MachineOperatorBuilder::kFloat32RoundTiesEven | |
| 2412 | MachineOperatorBuilder::kFloat64RoundTiesEven | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2413 | MachineOperatorBuilder::kWord32ShiftIsSafe | |
| 2414 | MachineOperatorBuilder::kInt32DivIsSafe | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 2415 | MachineOperatorBuilder::kUint32DivIsSafe | |
| 2416 | MachineOperatorBuilder::kWord32ReverseBits | |
| 2417 | MachineOperatorBuilder::kWord64ReverseBits; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 2418 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 2419 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 2420 | } // namespace compiler |
| 2421 | } // namespace internal |
| 2422 | } // namespace v8 |