| OLD | NEW |
| 1 // Copyright 2014 the V8 project authors. All rights reserved. | 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 | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "src/compiler/instruction-selector-impl.h" | 5 #include "src/compiler/instruction-selector-impl.h" |
| 6 #include "src/compiler/node-matchers.h" | 6 #include "src/compiler/node-matchers.h" |
| 7 | 7 |
| 8 namespace v8 { | 8 namespace v8 { |
| 9 namespace internal { | 9 namespace internal { |
| 10 namespace compiler { | 10 namespace compiler { |
| (...skipping 330 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 341 void InstructionSelector::VisitWord32Sar(Node* node) { | 341 void InstructionSelector::VisitWord32Sar(Node* node) { |
| 342 VisitWord32Shift(this, node, kX64Sar32); | 342 VisitWord32Shift(this, node, kX64Sar32); |
| 343 } | 343 } |
| 344 | 344 |
| 345 | 345 |
| 346 void InstructionSelector::VisitWord64Sar(Node* node) { | 346 void InstructionSelector::VisitWord64Sar(Node* node) { |
| 347 VisitWord64Shift(this, node, kX64Sar); | 347 VisitWord64Shift(this, node, kX64Sar); |
| 348 } | 348 } |
| 349 | 349 |
| 350 | 350 |
| 351 void InstructionSelector::VisitWord32Ror(Node* node) { |
| 352 VisitWord32Shift(this, node, kX64Ror32); |
| 353 } |
| 354 |
| 355 |
| 356 void InstructionSelector::VisitWord64Ror(Node* node) { |
| 357 VisitWord64Shift(this, node, kX64Ror); |
| 358 } |
| 359 |
| 360 |
| 351 void InstructionSelector::VisitInt32Add(Node* node) { | 361 void InstructionSelector::VisitInt32Add(Node* node) { |
| 352 VisitBinop(this, node, kX64Add32); | 362 VisitBinop(this, node, kX64Add32); |
| 353 } | 363 } |
| 354 | 364 |
| 355 | 365 |
| 356 void InstructionSelector::VisitInt64Add(Node* node) { | 366 void InstructionSelector::VisitInt64Add(Node* node) { |
| 357 VisitBinop(this, node, kX64Add); | 367 VisitBinop(this, node, kX64Add); |
| 358 } | 368 } |
| 359 | 369 |
| 360 | 370 |
| (...skipping 352 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 713 if (descriptor->kind() == CallDescriptor::kCallAddress && | 723 if (descriptor->kind() == CallDescriptor::kCallAddress && |
| 714 buffer.pushed_count > 0) { | 724 buffer.pushed_count > 0) { |
| 715 DCHECK(deoptimization == NULL && continuation == NULL); | 725 DCHECK(deoptimization == NULL && continuation == NULL); |
| 716 Emit(kPopStack | MiscField::encode(buffer.pushed_count), NULL); | 726 Emit(kPopStack | MiscField::encode(buffer.pushed_count), NULL); |
| 717 } | 727 } |
| 718 } | 728 } |
| 719 | 729 |
| 720 } // namespace compiler | 730 } // namespace compiler |
| 721 } // namespace internal | 731 } // namespace internal |
| 722 } // namespace v8 | 732 } // namespace v8 |
| OLD | NEW |