Home | History | Annotate | Download | only in optimizing

Lines Matching refs:HBasicBlock

23 HBasicBlock* HBasicBlockBuilder::MaybeCreateBlockAt(uint32_t dex_pc) {
27 HBasicBlock* HBasicBlockBuilder::MaybeCreateBlockAt(uint32_t semantic_dex_pc,
29 HBasicBlock* block = branch_targets_[store_dex_pc];
31 block = new (arena_) HBasicBlock(graph_, semantic_dex_pc);
121 HBasicBlock* block = graph_->GetEntryBlock();
129 HBasicBlock* next_block = GetBlockAt(dex_pc);
167 HBasicBlock* next_case_block = GetBlockAt(next_case_dex_pc);
192 HBasicBlock* block,
205 const ArenaSafeMap<uint32_t, HBasicBlock*>& catch_blocks) {
211 bool HBasicBlockBuilder::MightHaveLiveNormalPredecessors(HBasicBlock* catch_block) {
216 for (HBasicBlock* predecessor : catch_block->GetPredecessors()) {
251 for (HBasicBlock* block : graph_->GetBlocks()) {
271 ArenaSafeMap<uint32_t, HBasicBlock*> catch_blocks(
292 HBasicBlock* catch_block = GetBlockAt(address);
295 HBasicBlock* new_catch_block = new (arena_) HBasicBlock(graph_, address);
314 HBasicBlock* try_block = graph_->GetBlocks()[entry.first];
315 for (HBasicBlock* predecessor : try_block->GetPredecessors()) {
331 HBasicBlock* try_block = graph_->GetBlocks()[entry.first];
334 HBasicBlock* successor = try_block->GetSuccessors()[i];
356 graph_->SetEntryBlock(new (arena_) HBasicBlock(graph_, kNoDexPc));
357 graph_->SetExitBlock(new (arena_) HBasicBlock(graph_, kNoDexPc));