HomeSort by relevance Sort by last modified time
    Searched refs:MIRGraph (Results 1 - 25 of 34) sorted by null

1 2

  /art/compiler/dex/
dataflow_iterator.h 67 * @param mir_graph the MIRGraph we are interested in.
71 DataflowIterator(MIRGraph* mir_graph, int32_t start_idx, int32_t end_idx)
104 MIRGraph* const mir_graph_; /**< @brief the MIRGraph */
115 * @brief Used to perform a Pre-order Depth-First-Search Iteration of a MIRGraph.
120 * @brief The constructor, using all of the reachable blocks of the MIRGraph.
121 * @param mir_graph The MIRGraph considered.
123 explicit PreOrderDfsIterator(MIRGraph* mir_graph)
145 * @brief Used to perform a Repeating Pre-order Depth-First-Search Iteration of a MIRGraph.
151 * @brief The constructor, using all of the reachable blocks of the MIRGraph
    [all...]
ssa_transformation.cc 25 void MIRGraph::ClearAllVisitedFlags() {
32 BasicBlock* MIRGraph::NeedsVisit(BasicBlock* bb) {
41 BasicBlock* MIRGraph::NextUnvisitedSuccessor(BasicBlock* bb) {
64 void MIRGraph::MarkPreOrder(BasicBlock* block) {
72 void MIRGraph::RecordDFSOrders(BasicBlock* block) {
94 void MIRGraph::ComputeDFSOrders() {
136 bool MIRGraph::FillDefBlockMatrix(BasicBlock* bb) {
148 void MIRGraph::ComputeDefBlockMatrix() {
181 void MIRGraph::ComputeDomPostOrderTraversal(BasicBlock* bb) {
225 void MIRGraph::CheckForDominanceFrontier(BasicBlock* dom_bb
    [all...]
compiler_ir.h 37 class MIRGraph;
88 std::unique_ptr<MIRGraph> mir_graph; // MIR container.
vreg_analysis.cc 22 bool MIRGraph::SetFp(int index, bool is_fp) {
32 bool MIRGraph::SetFp(int index) {
42 bool MIRGraph::SetCore(int index, bool is_core) {
52 bool MIRGraph::SetCore(int index) {
62 bool MIRGraph::SetRef(int index, bool is_ref) {
72 bool MIRGraph::SetRef(int index) {
82 bool MIRGraph::SetWide(int index, bool is_wide) {
91 bool MIRGraph::SetWide(int index) {
100 bool MIRGraph::SetHigh(int index, bool is_high) {
109 bool MIRGraph::SetHigh(int index)
    [all...]
mir_graph.cc 37 const char* MIRGraph::extended_mir_op_names_[kMirOpLast - kMirOpFirst] = {
70 MIRGraph::MIRGraph(CompilationUnit* cu, ArenaAllocator* arena)
133 MIRGraph::~MIRGraph() {
140 int MIRGraph::ParseInsn(const uint16_t* code_ptr, MIR::DecodedInstruction* decoded_instruction) {
155 BasicBlock* MIRGraph::SplitBlock(DexOffset code_offset,
266 BasicBlock* MIRGraph::FindBlock(DexOffset code_offset, bool split, bool create,
300 void MIRGraph::ProcessTryCatchBlocks() {
332 bool MIRGraph::IsBadMonitorExitCatch(NarrowDexOffset monitor_exit_offset
    [all...]
mir_optimization.cc 33 void MIRGraph::SetConstant(int32_t ssa_reg, int value) {
38 void MIRGraph::SetConstantWide(int ssa_reg, int64_t value) {
45 void MIRGraph::DoConstantPropagation(BasicBlock* bb) {
107 MIR* MIRGraph::AdvanceMIR(BasicBlock** p_bb, MIR* mir) {
131 MIR* MIRGraph::FindMoveResult(BasicBlock* bb, MIR* mir) {
150 BasicBlock* MIRGraph::NextDominatedBlock(BasicBlock* bb) {
230 int MIRGraph::GetSSAUseCount(int s_reg) {
234 size_t MIRGraph::GetNumAvailableNonSpecialCompilerTemps() {
248 CompilerTemp* MIRGraph::GetNewCompilerTemp(CompilerTempType ct_type, bool wide) {
320 bool MIRGraph::BasicBlockOpt(BasicBlock* bb)
    [all...]
mir_dataflow.cc 32 const uint64_t MIRGraph::oat_data_flow_attributes_[kMirOpLast] = {
894 int MIRGraph::SRegToVReg(int ssa_reg) const {
899 void MIRGraph::HandleLiveInUse(ArenaBitVector* use_v, ArenaBitVector* def_v,
908 void MIRGraph::HandleDef(ArenaBitVector* def_v, int dalvik_reg_id) {
912 void MIRGraph::HandleExtended(ArenaBitVector* use_v, ArenaBitVector* def_v,
926 bool MIRGraph::FindLocalLiveIn(BasicBlock* bb) {
986 int MIRGraph::AddNewSReg(int v_reg) {
1004 void MIRGraph::HandleSSAUse(int* uses, int dalvik_reg, int reg_index) {
1010 void MIRGraph::HandleSSADef(int* defs, int dalvik_reg, int reg_index) {
1017 void MIRGraph::AllocateSSAUseData(MIR *mir, int num_uses)
    [all...]
mir_analysis.cc 33 const uint32_t MIRGraph::analysis_attributes_[kMirOpLast] = {
862 void MIRGraph::AnalyzeBlock(BasicBlock* bb, MethodStats* stats) {
944 bool MIRGraph::ComputeSkipCompilation(MethodStats* stats, bool skip_default,
1009 bool MIRGraph::SkipCompilation(std::string* skip_message) {
1109 void MIRGraph::DoCacheFieldLoweringInfo() {
1185 void MIRGraph::DoCacheMethodLoweringInfo() {
1299 bool MIRGraph::SkipCompilationByName(const std::string& methodname) {
post_opt_passes.cc 81 // First get the MIRGraph here to factorize a bit the code.
82 MIRGraph *mir_graph = c_unit->mir_graph.get();
global_value_numbering.h 199 MIRGraph* GetMirGraph() const {
208 MIRGraph* mir_graph_;
mir_graph.h 361 // IGET/IPUT lowering info index, points to MIRGraph::ifield_lowering_infos_. Due to limit on
364 // SGET/SPUT lowering info index, points to MIRGraph::sfield_lowering_infos_. Due to limit on
367 // INVOKE data index, points to MIRGraph::method_lowering_infos_.
381 MIR* Copy(MIRGraph* mir_Graph);
433 BasicBlock* Copy(MIRGraph* mir_graph);
467 * @param mir_graph the MIRGraph.
471 MIR* GetNextUnconditionalMir(MIRGraph* mir_graph, MIR* current);
499 * @param mir_graph The MIRGraph used to get the basic block during iteration.
501 ChildBlockIterator(BasicBlock* bb, MIRGraph* mir_graph);
506 MIRGraph* mir_graph_
    [all...]
post_opt_passes.h 211 MIRGraph *mir_graph = c_unit->mir_graph.get();
mir_optimization_test.cc 174 merged_df_flags |= MIRGraph::GetDataFlowAttributes(def->opcode);
212 cu_.mir_graph.reset(new MIRGraph(&cu_, &cu_.arena));
mir_graph_test.cc 157 cu_.mir_graph.reset(new MIRGraph(&cu_, &cu_.arena));
frontend.cc 557 // This is a limitation in mir_graph. See MirGraph::SetNumSSARegs.
593 << MIRGraph::extended_mir_op_names_[opcode - kMirOpFirst];
705 cu.mir_graph.reset(new MIRGraph(&cu, &cu.arena));
  /art/compiler/dex/quick/
dex_file_method_inliner.h 37 class MIRGraph;
90 bool GenInline(MIRGraph* mir_graph, BasicBlock* bb, MIR* invoke, uint32_t method_idx)
313 static bool GenInlineConst(MIRGraph* mir_graph, BasicBlock* bb, MIR* invoke,
315 static bool GenInlineReturnArg(MIRGraph* mir_graph, BasicBlock* bb, MIR* invoke,
317 static bool GenInlineIGet(MIRGraph* mir_graph, BasicBlock* bb, MIR* invoke,
319 static bool GenInlineIPut(MIRGraph* mir_graph, BasicBlock* bb, MIR* invoke,
dex_file_method_inliner.cc 102 MIR* AllocReplacementMIR(MIRGraph* mir_graph, MIR* invoke, MIR* move_return) {
529 bool DexFileMethodInliner::GenInline(MIRGraph* mir_graph, BasicBlock* bb, MIR* invoke,
    [all...]
mir_to_lir.h 149 class MIRGraph;
191 Mir2Lir* ArmCodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
193 Mir2Lir* Arm64CodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
195 Mir2Lir* MipsCodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
197 Mir2Lir* X86CodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
    [all...]
  /art/compiler/
compiler.h 29 class MIRGraph;
  /art/compiler/dex/portable/
mir_to_gbc.h 43 class MIRGraph;
46 Backend* PortableCodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
53 MirConverter(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena,
180 MIRGraph* mir_graph_;
  /art/compiler/dex/quick/mips/
target_mips.cc 574 MipsMir2Lir::MipsMir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena)
585 Mir2Lir* MipsCodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
codegen_mips.h 27 MipsMir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena);
  /art/compiler/dex/quick/arm/
codegen_arm.h 27 ArmMir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena);
target_arm.cc 552 ArmMir2Lir::ArmMir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena)
564 Mir2Lir* ArmCodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
  /art/compiler/dex/quick/arm64/
codegen_arm64.h 63 Arm64Mir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena);

Completed in 88 milliseconds

1 2