Searched refs:entry_block_ (Results 1 - 9 of 9) sorted by relevance
| /art/compiler/optimizing/ |
| H A D | builder.h | 41 entry_block_(nullptr),
119 HBasicBlock* entry_block_; member in class:art::HGraphBuilder
|
| H A D | builder.cc | 77 entry_block_->AddInstruction(local);
97 entry_block_->AddInstruction(parameter);
99 entry_block_->AddInstruction(new (arena_) HStoreLocal(local, parameter));
115 entry_block_->AddInstruction(parameter);
119 entry_block_->AddInstruction(new (arena_) HStoreLocal(local, parameter));
182 entry_block_ = new (arena_) HBasicBlock(graph_);
183 graph_->AddBlock(entry_block_);
185 graph_->SetEntryBlock(entry_block_);
212 entry_block_->AddInstruction(new (arena_) HGoto());
240 entry_block_
[all...] |
| H A D | nodes.cc | 30 VisitBlockForBackEdges(entry_block_, visited, &visiting);
89 reverse_post_order_.Add(entry_block_);
90 for (size_t i = 0; i < entry_block_->GetSuccessors().Size(); i++) {
91 VisitBlockForDominatorTree(entry_block_->GetSuccessors().Get(i), entry_block_, &visits);
|
| H A D | nodes.h | 86 HBasicBlock* GetEntryBlock() const { return entry_block_; }
89 void SetEntryBlock(HBasicBlock* block) { entry_block_ = block; }
169 HBasicBlock* entry_block_; member in class:art::HGraph
|
| /art/compiler/dex/ |
| H A D | mir_graph_test.cc | 102 cu_.mir_graph->entry_block_ = cu_.mir_graph->block_list_.Get(1);
103 ASSERT_EQ(kEntryBlock, cu_.mir_graph->entry_block_->block_type);
|
| H A D | mir_optimization_test.cc | 145 cu_.mir_graph->entry_block_ = cu_.mir_graph->block_list_.Get(1);
146 ASSERT_EQ(kEntryBlock, cu_.mir_graph->entry_block_->block_type);
|
| H A D | mir_graph.cc | 100 entry_block_(NULL),
675 DCHECK(entry_block_ == NULL);
683 entry_block_ = NewMemBB(kEntryBlock, num_blocks_++);
684 block_list_.Insert(entry_block_);
714 entry_block_->fall_through = cur_block->id;
715 cur_block->predecessors->Insert(entry_block_->id);
|
| H A D | mir_graph.h | 589 return entry_block_;
1172 BasicBlock* entry_block_; member in class:art::MIRGraph
|
| H A D | global_value_numbering_test.cc | 220 cu_.mir_graph->entry_block_ = cu_.mir_graph->block_list_.Get(1);
221 ASSERT_EQ(kEntryBlock, cu_.mir_graph->entry_block_->block_type);
|
Completed in 188 milliseconds