/art/compiler/ |
H A D | Android.mk | 69 dex/mir_graph.cc \
|
/art/compiler/dex/ |
H A D | bb_optimizations.cc | 33 c_unit->mir_graph->LayoutBlocks(bb); 48 c_unit->mir_graph->CombineBlocks(bb); 62 c_unit->mir_graph->InitializeMethodUses(); 77 c_unit->mir_graph->CountUses(bb);
|
H A D | bb_optimizations.h | 24 #include "mir_graph.h" 41 c_unit->mir_graph->StringChange(); 48 return c_unit->mir_graph->HasInvokes(); 65 c_unit->mir_graph->DoCacheFieldLoweringInfo(); 72 return c_unit->mir_graph->HasFieldAccess(); 89 c_unit->mir_graph->DoCacheMethodLoweringInfo(); 96 return c_unit->mir_graph->HasInvokes(); 115 return c_unit->mir_graph->InlineSpecialMethodsGate(); 122 c_unit->mir_graph->InlineSpecialMethodsStart(); 132 c_unit->mir_graph [all...] |
H A D | compiler_ir.cc | 24 #include "mir_graph.h" 47 mir_graph(nullptr),
|
H A D | compiler_ir.h | 189 // TODO: move memory management to mir_graph, or just switch to using standard containers. 193 std::unique_ptr<MIRGraph> mir_graph; // MIR container. member in struct:art::CompilationUnit
|
H A D | dataflow_iterator.h | 21 #include "mir_graph.h" 67 * @param mir_graph the MIRGraph we are interested in. 71 DataflowIterator(MIRGraph* mir_graph, int32_t start_idx, int32_t end_idx) argument 72 : mir_graph_(mir_graph), 121 * @param mir_graph The MIRGraph considered. 123 explicit PreOrderDfsIterator(MIRGraph* mir_graph) argument 124 : DataflowIterator(mir_graph, 0, mir_graph->GetNumReachableBlocks()) { 127 block_id_list_ = &mir_graph->GetDfsOrder(); 152 * @param mir_graph Th 154 RepeatingPreOrderDfsIterator(MIRGraph* mir_graph) argument 185 RepeatingPostOrderDfsIterator(MIRGraph* mir_graph) argument 215 ReversePostOrderDfsIterator(MIRGraph* mir_graph) argument 246 RepeatingReversePostOrderDfsIterator(MIRGraph* mir_graph) argument 276 PostOrderDOMIterator(MIRGraph* mir_graph) argument 306 AllNodesIterator(MIRGraph* mir_graph) argument 335 TopologicalSortIterator(MIRGraph* mir_graph) argument 375 LoopRepeatingTopologicalSortIterator(MIRGraph* mir_graph) argument [all...] |
H A D | global_value_numbering.cc | 28 mir_graph_(cu->mir_graph.get()),
|
H A D | global_value_numbering.h | 23 #include "mir_graph.h" 45 cu->mir_graph->GetMaxNestedLoops() > kMaxAllowedNestedLoops;
|
H A D | global_value_numbering_test.cc | 141 cu_.mir_graph->ifield_lowering_infos_.clear(); 142 cu_.mir_graph->ifield_lowering_infos_.reserve(count); 151 cu_.mir_graph->ifield_lowering_infos_.push_back(field_info); 161 cu_.mir_graph->sfield_lowering_infos_.clear(); 162 cu_.mir_graph->sfield_lowering_infos_.reserve(count); 174 cu_.mir_graph->sfield_lowering_infos_.push_back(field_info); 184 cu_.mir_graph->block_id_map_.clear(); 185 cu_.mir_graph->block_list_.clear(); 192 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); 218 ASSERT_EQ(count, cu_.mir_graph [all...] |
H A D | gvn_dead_code_elimination.cc | 27 #include "dex/mir_graph.h" 376 int v_reg, MIRGraph* mir_graph) const { 382 if (mir_graph->SRegToVReg(ssa_rep->uses[i]) == v_reg) {
|
H A D | gvn_dead_code_elimination.h | 115 MIRGraph* mir_graph) const;
|
H A D | gvn_dead_code_elimination_test.cc | 144 cu_.mir_graph->ifield_lowering_infos_.clear(); 145 cu_.mir_graph->ifield_lowering_infos_.reserve(count); 156 cu_.mir_graph->ifield_lowering_infos_.push_back(field_info); 166 cu_.mir_graph->sfield_lowering_infos_.clear(); 167 cu_.mir_graph->sfield_lowering_infos_.reserve(count); 181 cu_.mir_graph->sfield_lowering_infos_.push_back(field_info); 191 cu_.mir_graph->block_id_map_.clear(); 192 cu_.mir_graph->block_list_.clear(); 199 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); 226 ASSERT_EQ(count, cu_.mir_graph [all...] |
H A D | local_value_numbering_test.cc | 95 cu_.mir_graph->ifield_lowering_infos_.clear(); 96 cu_.mir_graph->ifield_lowering_infos_.reserve(count); 105 cu_.mir_graph->ifield_lowering_infos_.push_back(field_info); 115 cu_.mir_graph->sfield_lowering_infos_.clear(); 116 cu_.mir_graph->sfield_lowering_infos_.reserve(count); 128 cu_.mir_graph->sfield_lowering_infos_.push_back(field_info); 148 ASSERT_LT(def->field_info, cu_.mir_graph->ifield_lowering_infos_.size()); 150 ASSERT_EQ(cu_.mir_graph->ifield_lowering_infos_[def->field_info].MemAccessType(), 153 ASSERT_LT(def->field_info, cu_.mir_graph->sfield_lowering_infos_.size()); 155 ASSERT_EQ(cu_.mir_graph [all...] |
H A D | mir_graph.cc | 17 #include "mir_graph.h" 1266 MIR* BasicBlock::GetNextUnconditionalMir(MIRGraph* mir_graph, MIR* current) { argument 1276 next_mir = mir_graph->GetBasicBlock(fall_through)->first_mir_insn; 1859 MIRGraph* mir_graph, const ArenaBitVector* current_loop, 1868 ArenaBitVector candidate_reachable(allocator, mir_graph->GetNumBlocks(), false, kBitMapMisc); 1869 AllNodesIterator iter(mir_graph); 1885 BasicBlock* current_bb = mir_graph->GetBasicBlock(current_id); 1887 ChildBlockIterator child_iter(current_bb, mir_graph); 1912 static void ComputeUnvisitedReachableFrom(MIRGraph* mir_graph, BasicBlockId bb_id, argument 1922 BasicBlock* current_bb = mir_graph 1858 SelectTopologicalSortOrderFallBack( MIRGraph* mir_graph, const ArenaBitVector* current_loop, const ScopedArenaVector<size_t>* visited_cnt_values, ScopedArenaAllocator* allocator, ScopedArenaVector<BasicBlockId>* tmp_stack) argument 2104 ChildBlockIterator(BasicBlock* bb, MIRGraph* mir_graph) argument 2159 MIRGraph* mir_graph = c_unit->mir_graph.get(); local 2163 Copy(MIRGraph* mir_graph) argument 2201 Copy(MIRGraph* mir_graph) argument 2326 Kill(MIRGraph* mir_graph) argument [all...] |
H A D | mir_graph.h | 425 BasicBlock* Copy(MIRGraph* mir_graph); 437 void Kill(MIRGraph* mir_graph); 483 * @param mir_graph the MIRGraph. 487 MIR* GetNextUnconditionalMir(MIRGraph* mir_graph, MIR* current); 513 * @param mir_graph The MIRGraph used to get the basic block during iteration. 515 ChildBlockIterator(BasicBlock* bb, MIRGraph* mir_graph);
|
H A D | mir_graph_test.cc | 19 #include "mir_graph.h" 61 cu_.mir_graph->block_id_map_.clear(); 62 cu_.mir_graph->block_list_.clear(); 69 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); 94 ASSERT_EQ(count, cu_.mir_graph->block_list_.size()); 95 cu_.mir_graph->entry_block_ = cu_.mir_graph->block_list_[1]; 96 ASSERT_EQ(kEntryBlock, cu_.mir_graph->entry_block_->block_type); 97 cu_.mir_graph->exit_block_ = cu_.mir_graph [all...] |
H A D | mir_optimization_test.cc | 100 cu_.mir_graph->block_id_map_.clear(); 101 cu_.mir_graph->block_list_.clear(); 108 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); 133 ASSERT_EQ(count, cu_.mir_graph->block_list_.size()); 134 cu_.mir_graph->entry_block_ = cu_.mir_graph->block_list_[1]; 135 ASSERT_EQ(kEntryBlock, cu_.mir_graph->entry_block_->block_type); 136 cu_.mir_graph->exit_block_ = cu_.mir_graph->block_list_[2]; 137 ASSERT_EQ(kExitBlock, cu_.mir_graph [all...] |
H A D | pass_driver_me.h | 150 c_unit->mir_graph->DumpCFG(prefix.c_str(), false); 203 Iterator iterator(c_unit->mir_graph.get());
|
H A D | pass_driver_me_opts.cc | 71 c_unit->mir_graph.get()->CalculateBasicBlockInformation(post_opt_pass_manager_);
|
H A D | post_opt_passes.cc | 53 MIRGraph *mir_graph = c_unit->mir_graph.get(); local 56 AllNodesIterator first(mir_graph); 62 AllNodesIterator second(mir_graph); 70 ChildBlockIterator child_iter(bb, mir_graph);
|
H A D | post_opt_passes.h | 24 #include "mir_graph.h" 43 return !c_unit->mir_graph->MirSsaRepUpToDate(); 63 c_unit->mir_graph->SSATransformationStart(); 64 c_unit->mir_graph->CompilerInitializeSSAConversion(); 105 return !c_unit->mir_graph->DfsOrdersUpToDate(); 112 c_unit->mir_graph.get()->ComputeDFSOrders(); 129 return !c_unit->mir_graph->DominationUpToDate(); 136 c_unit->mir_graph->ComputeDominators(); 145 c_unit->mir_graph->VerifyDataflow(); 163 return !c_unit->mir_graph 221 MIRGraph *mir_graph = c_unit->mir_graph.get(); local [all...] |
/art/compiler/dex/quick/arm/ |
H A D | backend_arm.h | 27 Mir2Lir* ArmCodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
|
H A D | codegen_arm.h | 59 ArmMir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena);
|
H A D | target_arm.cc | 26 #include "dex/mir_graph.h" 576 ArmMir2Lir::ArmMir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena) argument 577 : Mir2Lir(cu, mir_graph, arena), 591 Mir2Lir* ArmCodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph, argument 593 return new ArmMir2Lir(cu, mir_graph, arena);
|
/art/compiler/dex/quick/arm64/ |
H A D | backend_arm64.h | 27 Mir2Lir* Arm64CodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
|