Alexandre Rames | 44b9cf9 | 2015-08-19 15:39:06 +0100 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2015 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
| 16 | |
| 17 | #ifndef ART_COMPILER_OPTIMIZING_INSTRUCTION_SIMPLIFIER_ARM64_H_ |
| 18 | #define ART_COMPILER_OPTIMIZING_INSTRUCTION_SIMPLIFIER_ARM64_H_ |
| 19 | |
| 20 | #include "nodes.h" |
| 21 | #include "optimization.h" |
| 22 | |
| 23 | namespace art { |
| 24 | namespace arm64 { |
| 25 | |
| 26 | class InstructionSimplifierArm64Visitor : public HGraphVisitor { |
| 27 | public: |
| 28 | InstructionSimplifierArm64Visitor(HGraph* graph, OptimizingCompilerStats* stats) |
| 29 | : HGraphVisitor(graph), stats_(stats) {} |
| 30 | |
| 31 | private: |
| 32 | void RecordSimplification() { |
| 33 | if (stats_ != nullptr) { |
| 34 | stats_->RecordStat(kInstructionSimplificationsArch); |
| 35 | } |
| 36 | } |
| 37 | |
Alexandre Rames | 8626b74 | 2015-11-25 16:28:08 +0000 | [diff] [blame] | 38 | bool TryMergeIntoUsersShifterOperand(HInstruction* instruction); |
| 39 | bool TryMergeIntoShifterOperand(HInstruction* use, |
| 40 | HInstruction* bitfield_op, |
| 41 | bool do_merge); |
| 42 | bool CanMergeIntoShifterOperand(HInstruction* use, HInstruction* bitfield_op) { |
Anton Kirilov | 74234da | 2017-01-13 14:42:47 +0000 | [diff] [blame] | 43 | return TryMergeIntoShifterOperand(use, bitfield_op, /* do_merge */ false); |
Alexandre Rames | 8626b74 | 2015-11-25 16:28:08 +0000 | [diff] [blame] | 44 | } |
| 45 | bool MergeIntoShifterOperand(HInstruction* use, HInstruction* bitfield_op) { |
| 46 | DCHECK(CanMergeIntoShifterOperand(use, bitfield_op)); |
Anton Kirilov | 74234da | 2017-01-13 14:42:47 +0000 | [diff] [blame] | 47 | return TryMergeIntoShifterOperand(use, bitfield_op, /* do_merge */ true); |
Alexandre Rames | 8626b74 | 2015-11-25 16:28:08 +0000 | [diff] [blame] | 48 | } |
Alexandre Rames | e6dbf48 | 2015-10-19 10:10:41 +0100 | [diff] [blame] | 49 | |
Aart Bik | 968056f | 2016-03-29 13:54:53 -0700 | [diff] [blame] | 50 | /** |
| 51 | * This simplifier uses a special-purpose BB visitor. |
| 52 | * (1) No need to visit Phi nodes. |
| 53 | * (2) Since statements can be removed in a "forward" fashion, |
| 54 | * the visitor should test if each statement is still there. |
| 55 | */ |
| 56 | void VisitBasicBlock(HBasicBlock* block) OVERRIDE { |
| 57 | // TODO: fragile iteration, provide more robust iterators? |
| 58 | for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { |
| 59 | HInstruction* instruction = it.Current(); |
| 60 | if (instruction->IsInBlock()) { |
| 61 | instruction->Accept(this); |
| 62 | } |
| 63 | } |
| 64 | } |
| 65 | |
Alexandre Rames | 418318f | 2015-11-20 15:55:47 +0000 | [diff] [blame] | 66 | // HInstruction visitors, sorted alphabetically. |
Kevin Brodsky | 9ff0d20 | 2016-01-11 13:43:31 +0000 | [diff] [blame] | 67 | void VisitAnd(HAnd* instruction) OVERRIDE; |
Alexandre Rames | e6dbf48 | 2015-10-19 10:10:41 +0100 | [diff] [blame] | 68 | void VisitArrayGet(HArrayGet* instruction) OVERRIDE; |
| 69 | void VisitArraySet(HArraySet* instruction) OVERRIDE; |
Alexandre Rames | 418318f | 2015-11-20 15:55:47 +0000 | [diff] [blame] | 70 | void VisitMul(HMul* instruction) OVERRIDE; |
Kevin Brodsky | 9ff0d20 | 2016-01-11 13:43:31 +0000 | [diff] [blame] | 71 | void VisitOr(HOr* instruction) OVERRIDE; |
Alexandre Rames | 8626b74 | 2015-11-25 16:28:08 +0000 | [diff] [blame] | 72 | void VisitShl(HShl* instruction) OVERRIDE; |
| 73 | void VisitShr(HShr* instruction) OVERRIDE; |
| 74 | void VisitTypeConversion(HTypeConversion* instruction) OVERRIDE; |
| 75 | void VisitUShr(HUShr* instruction) OVERRIDE; |
Kevin Brodsky | 9ff0d20 | 2016-01-11 13:43:31 +0000 | [diff] [blame] | 76 | void VisitXor(HXor* instruction) OVERRIDE; |
Alexandre Rames | e6dbf48 | 2015-10-19 10:10:41 +0100 | [diff] [blame] | 77 | |
Alexandre Rames | 44b9cf9 | 2015-08-19 15:39:06 +0100 | [diff] [blame] | 78 | OptimizingCompilerStats* stats_; |
| 79 | }; |
| 80 | |
| 81 | |
| 82 | class InstructionSimplifierArm64 : public HOptimization { |
| 83 | public: |
| 84 | InstructionSimplifierArm64(HGraph* graph, OptimizingCompilerStats* stats) |
Roland Levillain | 7fa7cf5 | 2016-11-04 14:10:29 +0000 | [diff] [blame] | 85 | : HOptimization(graph, kInstructionSimplifierArm64PassName, stats) {} |
| 86 | |
| 87 | static constexpr const char* kInstructionSimplifierArm64PassName = "instruction_simplifier_arm64"; |
| 88 | |
Alexandre Rames | 44b9cf9 | 2015-08-19 15:39:06 +0100 | [diff] [blame] | 89 | void Run() OVERRIDE { |
| 90 | InstructionSimplifierArm64Visitor visitor(graph_, stats_); |
| 91 | visitor.VisitReversePostOrder(); |
| 92 | } |
| 93 | }; |
| 94 | |
| 95 | } // namespace arm64 |
| 96 | } // namespace art |
| 97 | |
| 98 | #endif // ART_COMPILER_OPTIMIZING_INSTRUCTION_SIMPLIFIER_ARM64_H_ |