Cross Reference: /art/compiler/dex/mir

Lines Matching refs:mir_graph
17 #include "mir_graph.h"
1198 MIR* BasicBlock::GetNextUnconditionalMir(MIRGraph* mir_graph, MIR* current) {
1208       next_mir = mir_graph->GetBasicBlock(fall_through)->first_mir_insn;
1540     MIRGraph* mir_graph, const ArenaBitVector* current_loop,
1549   ArenaBitVector candidate_reachable(allocator, mir_graph->GetNumBlocks(), false, kBitMapMisc);
1550   AllNodesIterator iter(mir_graph);
1566       BasicBlock* current_bb = mir_graph->GetBasicBlock(current_id);
1568       ChildBlockIterator child_iter(current_bb, mir_graph);
1593 static void ComputeUnvisitedReachableFrom(MIRGraph* mir_graph, BasicBlockId bb_id,
1603     BasicBlock* current_bb = mir_graph->GetBasicBlock(current_id);
1606     BasicBlock* pred_bb = mir_graph->GetBasicBlock(iter.Next());
1607     for ( ; pred_bb != nullptr; pred_bb = mir_graph->GetBasicBlock(iter.Next())) {
1808 ChildBlockIterator::ChildBlockIterator(BasicBlock* bb, MIRGraph* mir_graph)
1809     : basic_block_(bb), mir_graph_(mir_graph), visited_fallthrough_(false),
1862   MIRGraph* mir_graph = c_unit->mir_graph.get();
1863   return Copy(mir_graph);
1866 BasicBlock* BasicBlock::Copy(MIRGraph* mir_graph) {
1867   BasicBlock* result_bb = mir_graph->CreateNewBB(block_type);
1876   ArenaAllocator* arena = mir_graph->GetArena();
1900     MIR* copy = mir->Copy(mir_graph);
1909 MIR* MIR::Copy(MIRGraph* mir_graph) {
1910   MIR* res = mir_graph->NewMIR();
1922   return Copy(c_unit->mir_graph.get());
2047   MIRGraph* mir_graph = c_unit->mir_graph.get();
2049     BasicBlock* pred_bb = mir_graph->GetBasicBlock(iterator.Next());
2059   ChildBlockIterator successorChildIter(this, mir_graph);
2071   int dalvik_reg = c_unit->mir_graph->SRegToVReg(ssa_reg);
2088       int def_dalvik_reg = c_unit->mir_graph->SRegToVReg(def_ssa_reg);