Home
last modified time | relevance | path

Searched refs:dalvik_reg (Results 1 – 4 of 4) sorted by relevance

/art/compiler/dex/
Dssa_transformation.cc497 int dalvik_reg; in InsertPhiNodes() local
510 for (dalvik_reg = cu_->num_dalvik_registers - 1; dalvik_reg >= 0; dalvik_reg--) { in InsertPhiNodes()
511 input_blocks->Copy(def_block_matrix_[dalvik_reg]); in InsertPhiNodes()
530 if (!phi_bb->data_flow_info->live_in_v->IsBitSet(dalvik_reg)) { in InsertPhiNodes()
535 phi->dalvikInsn.vA = dalvik_reg; in InsertPhiNodes()
Dmir_dataflow.cc1004 void MIRGraph::HandleSSAUse(int* uses, int dalvik_reg, int reg_index) { in HandleSSAUse() argument
1005 DCHECK((dalvik_reg >= 0) && (dalvik_reg < cu_->num_dalvik_registers)); in HandleSSAUse()
1006 uses[reg_index] = vreg_to_ssa_map_[dalvik_reg]; in HandleSSAUse()
1010 void MIRGraph::HandleSSADef(int* defs, int dalvik_reg, int reg_index) { in HandleSSADef() argument
1011 DCHECK((dalvik_reg >= 0) && (dalvik_reg < cu_->num_dalvik_registers)); in HandleSSADef()
1012 int ssa_reg = AddNewSReg(dalvik_reg); in HandleSSADef()
1013 vreg_to_ssa_map_[dalvik_reg] = ssa_reg; in HandleSSADef()
Dmir_graph.h1063 void HandleSSADef(int* defs, int dalvik_reg, int reg_index);
1108 void HandleSSAUse(int* uses, int dalvik_reg, int reg_index);
Dmir_graph.cc2071 int dalvik_reg = c_unit->mir_graph->SRegToVReg(ssa_reg); in IsSSALiveOut() local
2091 if (dalvik_reg == def_dalvik_reg) { in IsSSALiveOut()