Home
last modified time | relevance | path

Searched refs: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
175 if (!HasNullCheckLastInsn(pred_bb, work_lvn_->Id())) { in NullCheckedInAllPredecessors()
179 int s_reg = pred_bb->last_mir_insn->ssa_rep->uses[0]; in NullCheckedInAllPredecessors()
209 BasicBlock* pred_bb = mir_graph_->GetBasicBlock(pred_id); in IsBlockEnteredOnTrue() local
210 if (pred_bb->BranchesToSuccessorOnlyIfNotZero(bb_id)) { in IsBlockEnteredOnTrue()
212 uint16_t operand = lvns_[pred_id]->GetSregValue(pred_bb->last_mir_insn->ssa_rep->uses[0]); in IsBlockEnteredOnTrue()
Dssa_transformation.cc301 BasicBlock* pred_bb = GetBasicBlock(*it); in ComputeblockIDom() local
302 DCHECK(pred_bb != nullptr); in ComputeblockIDom()
303 if (i_dom_list_[pred_bb->dfs_id] != NOTVISITED) { in ComputeblockIDom()
304 idom = pred_bb->dfs_id; in ComputeblockIDom()
311 BasicBlock* pred_bb = GetBasicBlock(*it); in ComputeblockIDom() local
312 DCHECK(pred_bb != nullptr); in ComputeblockIDom()
313 if (i_dom_list_[pred_bb->dfs_id] == NOTVISITED) { in ComputeblockIDom()
316 idom = FindCommonParent(pred_bb->dfs_id, idom); in ComputeblockIDom()
523 BasicBlock* pred_bb = GetBasicBlock(pred_id); in InsertPhiNodeOperands() local
524 DCHECK(pred_bb != nullptr); in InsertPhiNodeOperands()
[all …]
Dtype_inference.cc240 BasicBlock* pred_bb = FindTopologicallyEarliestPredecessor(bb); in AddPseudoPhis() local
241 int32_t mod_s_reg = data.ending_mod_s_reg[pred_bb->id]; in AddPseudoPhis()
343 BasicBlock* pred_bb = FindTopologicallyEarliestPredecessor(bb); in FindDefBlock() local
344 DCHECK(pred_bb != nullptr); in FindDefBlock()
345 DCHECK(pred_bb->data_flow_info != nullptr); in FindDefBlock()
346 DCHECK(pred_bb->data_flow_info->vreg_to_ssa_map_exit != nullptr); in FindDefBlock()
347 if (pred_bb->data_flow_info->vreg_to_ssa_map_exit[v_reg] != s_reg) { in FindDefBlock()
351 bb = pred_bb; in FindDefBlock()
382 BasicBlock* pred_bb = mir_graph_->GetBasicBlock(pred_id); in IsSRegLiveAtStart() local
383 DCHECK(pred_bb != nullptr); in IsSRegLiveAtStart()
[all …]
Dglobal_value_numbering.h197 static bool HasNullCheckLastInsn(const BasicBlock* pred_bb, BasicBlockId succ_id) { in HasNullCheckLastInsn() argument
198 return pred_bb->BranchesToSuccessorOnlyIfNotZero(succ_id); in HasNullCheckLastInsn()
Dmir_graph.cc1925 BasicBlock* pred_bb = mir_graph->GetBasicBlock(pred_id); in ComputeUnvisitedReachableFrom() local
1926 DCHECK(pred_bb != nullptr); in ComputeUnvisitedReachableFrom()
1927 if (!pred_bb->visited && !reachable->IsBitSet(pred_bb->id)) { in ComputeUnvisitedReachableFrom()
1928 reachable->SetBit(pred_bb->id); in ComputeUnvisitedReachableFrom()
1929 tmp_stack->push_back(pred_bb->id); in ComputeUnvisitedReachableFrom()
2035 BasicBlock* pred_bb = GetBasicBlock(pred_id); in ComputeTopologicalSortOrder() local
2036 DCHECK(pred_bb != nullptr); in ComputeTopologicalSortOrder()
2037 if (pred_bb != candidate && !pred_bb->visited && in ComputeTopologicalSortOrder()
2038 !pred_bb->dominators->IsBitSet(candidate->id)) { in ComputeTopologicalSortOrder()
2328 BasicBlock* pred_bb = mir_graph->GetBasicBlock(pred_id); in Kill() local
[all …]
Dmir_dataflow.cc1417 BasicBlock* pred_bb = GetBasicBlock(pred_id); in VerifyPredInfo() local
1418 DCHECK(pred_bb != nullptr); in VerifyPredInfo()
1420 if (pred_bb->taken == bb->id) { in VerifyPredInfo()
1422 } else if (pred_bb->fall_through == bb->id) { in VerifyPredInfo()
1424 } else if (pred_bb->successor_block_list_type != kNotUsed) { in VerifyPredInfo()
1425 for (SuccessorBlockInfo* successor_block_info : pred_bb->successor_blocks) { in VerifyPredInfo()
1436 GetBlockName(pred_bb, block_name2); in VerifyPredInfo()
Dmir_optimization.cc978 BasicBlock* pred_bb = GetBasicBlock(pred_id); in EliminateNullChecks() local
979 DCHECK(pred_bb != nullptr); in EliminateNullChecks()
982 if (pred_bb->BranchesToSuccessorOnlyIfNotZero(bb->id)) { in EliminateNullChecks()
984 if (!copied_first || !vregs_to_check->IsBitSet(pred_bb->last_mir_insn->dalvikInsn.vA)) { in EliminateNullChecks()
985 null_check_insn = pred_bb->last_mir_insn; in EliminateNullChecks()
Dgvn_dead_code_elimination.cc539 BasicBlock* pred_bb = mir_graph_->GetBasicBlock(pred_id); in CreatePhi() local
540 DCHECK(pred_bb != nullptr); in CreatePhi()
541 phi->ssa_rep->uses[idx] = pred_bb->data_flow_info->vreg_to_ssa_map_exit[v_reg]; in CreatePhi()
Dlocal_value_numbering.cc386 const BasicBlock* pred_bb = gvn_->GetBasicBlock(other.Id()); in MergeOne() local
387 if (GlobalValueNumbering::HasNullCheckLastInsn(pred_bb, Id())) { in MergeOne()
388 int s_reg = pred_bb->last_mir_insn->ssa_rep->uses[0]; in MergeOne()
Dgvn_dead_code_elimination_test.cc400 BasicBlock* pred_bb = cu_.mir_graph->GetBasicBlock(bb->predecessors[0]); in FillVregToSsaRegExitMaps() local
404 pred_bb->data_flow_info->vreg_to_ssa_map_exit[v_reg]; in FillVregToSsaRegExitMaps()
/art/compiler/dex/quick/
Dcodegen_util.cc1382 BasicBlock* pred_bb = mir_graph_->GetBasicBlock(bb->predecessors[i]); in InitReferenceVRegs() local
1383 DCHECK(pred_bb != nullptr); in InitReferenceVRegs()
1384 DCHECK(pred_bb->data_flow_info != nullptr); in InitReferenceVRegs()
1385 DCHECK(pred_bb->data_flow_info->vreg_to_ssa_map_exit != nullptr); in InitReferenceVRegs()
1386 const int32_t* pred_vreg_to_ssa_map = pred_bb->data_flow_info->vreg_to_ssa_map_exit; in InitReferenceVRegs()