Home
last modified time | relevance | path

Searched defs:pred_bb (Results 1 – 11 of 11) sorted by relevance

/art/compiler/dex/
Dglobal_value_numbering.cc174 const BasicBlock* pred_bb = mir_graph_->GetBasicBlock(pred_lvn->Id()); in NullCheckedInAllPredecessors() local
209 BasicBlock* pred_bb = mir_graph_->GetBasicBlock(pred_id); in IsBlockEnteredOnTrue() local
Dssa_transformation.cc301 BasicBlock* pred_bb = GetBasicBlock(*it); in ComputeblockIDom() local
311 BasicBlock* pred_bb = GetBasicBlock(*it); in ComputeblockIDom() local
523 BasicBlock* pred_bb = GetBasicBlock(pred_id); in InsertPhiNodeOperands() local
Dtype_inference.cc240 BasicBlock* pred_bb = FindTopologicallyEarliestPredecessor(bb); in AddPseudoPhis() local
343 BasicBlock* pred_bb = FindTopologicallyEarliestPredecessor(bb); in FindDefBlock() local
382 BasicBlock* pred_bb = mir_graph_->GetBasicBlock(pred_id); in IsSRegLiveAtStart() local
Dmir_dataflow.cc1417 BasicBlock* pred_bb = GetBasicBlock(pred_id); in VerifyPredInfo() local
Dglobal_value_numbering.h197 static bool HasNullCheckLastInsn(const BasicBlock* pred_bb, BasicBlockId succ_id) { in HasNullCheckLastInsn()
Dmir_graph.cc1925 BasicBlock* pred_bb = mir_graph->GetBasicBlock(pred_id); in ComputeUnvisitedReachableFrom() local
2035 BasicBlock* pred_bb = GetBasicBlock(pred_id); in ComputeTopologicalSortOrder() local
2328 BasicBlock* pred_bb = mir_graph->GetBasicBlock(pred_id); in Kill() local
Dgvn_dead_code_elimination.cc539 BasicBlock* pred_bb = mir_graph_->GetBasicBlock(pred_id); in CreatePhi() local
Dmir_optimization.cc978 BasicBlock* pred_bb = GetBasicBlock(pred_id); in EliminateNullChecks() local
Dlocal_value_numbering.cc386 const BasicBlock* pred_bb = gvn_->GetBasicBlock(other.Id()); in MergeOne() local
Dgvn_dead_code_elimination_test.cc400 BasicBlock* pred_bb = cu_.mir_graph->GetBasicBlock(bb->predecessors[0]); in FillVregToSsaRegExitMaps() local
/art/compiler/dex/quick/
Dcodegen_util.cc1382 BasicBlock* pred_bb = mir_graph_->GetBasicBlock(bb->predecessors[i]); in InitReferenceVRegs() local