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: InstructionSimplifierArm64Visitor(HGraph * graph,OptimizingCompilerStats * stats)28 InstructionSimplifierArm64Visitor(HGraph* graph, OptimizingCompilerStats* stats) 29 : HGraphVisitor(graph), stats_(stats) {} 30 31 private: RecordSimplification()32 void RecordSimplification() { 33 if (stats_ != nullptr) { 34 stats_->RecordStat(kInstructionSimplificationsArch); 35 } 36 } 37 38 void TryExtractArrayAccessAddress(HInstruction* access, 39 HInstruction* array, 40 HInstruction* index, 41 int access_size); 42 bool TryMergeIntoUsersShifterOperand(HInstruction* instruction); 43 bool TryMergeIntoShifterOperand(HInstruction* use, 44 HInstruction* bitfield_op, 45 bool do_merge); CanMergeIntoShifterOperand(HInstruction * use,HInstruction * bitfield_op)46 bool CanMergeIntoShifterOperand(HInstruction* use, HInstruction* bitfield_op) { 47 return TryMergeIntoShifterOperand(use, bitfield_op, false); 48 } MergeIntoShifterOperand(HInstruction * use,HInstruction * bitfield_op)49 bool MergeIntoShifterOperand(HInstruction* use, HInstruction* bitfield_op) { 50 DCHECK(CanMergeIntoShifterOperand(use, bitfield_op)); 51 return TryMergeIntoShifterOperand(use, bitfield_op, true); 52 } 53 54 /** 55 * This simplifier uses a special-purpose BB visitor. 56 * (1) No need to visit Phi nodes. 57 * (2) Since statements can be removed in a "forward" fashion, 58 * the visitor should test if each statement is still there. 59 */ VisitBasicBlock(HBasicBlock * block)60 void VisitBasicBlock(HBasicBlock* block) OVERRIDE { 61 // TODO: fragile iteration, provide more robust iterators? 62 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { 63 HInstruction* instruction = it.Current(); 64 if (instruction->IsInBlock()) { 65 instruction->Accept(this); 66 } 67 } 68 } 69 70 // HInstruction visitors, sorted alphabetically. 71 void VisitAnd(HAnd* instruction) OVERRIDE; 72 void VisitArrayGet(HArrayGet* instruction) OVERRIDE; 73 void VisitArraySet(HArraySet* instruction) OVERRIDE; 74 void VisitMul(HMul* instruction) OVERRIDE; 75 void VisitOr(HOr* instruction) OVERRIDE; 76 void VisitShl(HShl* instruction) OVERRIDE; 77 void VisitShr(HShr* instruction) OVERRIDE; 78 void VisitTypeConversion(HTypeConversion* instruction) OVERRIDE; 79 void VisitUShr(HUShr* instruction) OVERRIDE; 80 void VisitXor(HXor* instruction) OVERRIDE; 81 82 OptimizingCompilerStats* stats_; 83 }; 84 85 86 class InstructionSimplifierArm64 : public HOptimization { 87 public: InstructionSimplifierArm64(HGraph * graph,OptimizingCompilerStats * stats)88 InstructionSimplifierArm64(HGraph* graph, OptimizingCompilerStats* stats) 89 : HOptimization(graph, "instruction_simplifier_arm64", stats) {} 90 Run()91 void Run() OVERRIDE { 92 InstructionSimplifierArm64Visitor visitor(graph_, stats_); 93 visitor.VisitReversePostOrder(); 94 } 95 }; 96 97 } // namespace arm64 98 } // namespace art 99 100 #endif // ART_COMPILER_OPTIMIZING_INSTRUCTION_SIMPLIFIER_ARM64_H_ 101