| /art/compiler/optimizing/ |
| builder.h | 46 entry_block_(nullptr),
64 entry_block_(nullptr),
246 HBasicBlock* entry_block_; member in class:art::HGraphBuilder
|
| nodes.cc | 34 VisitBlockForBackEdges(entry_block_, visited, &visiting);
139 reverse_post_order_.Add(entry_block_);
140 for (size_t i = 0; i < entry_block_->GetSuccessors().Size(); i++) {
141 VisitBlockForDominatorTree(entry_block_->GetSuccessors().Get(i), entry_block_, &visits);
298 if (entry_block_->EndsWithControlFlowInstruction()) {
299 entry_block_->InsertInstructionBefore(constant, entry_block_->GetLastInstruction());
301 entry_block_->AddInstruction(constant);
[all...] |
| builder.cc | 145 entry_block_->AddInstruction(local);
165 entry_block_->AddInstruction(parameter);
167 entry_block_->AddInstruction(new (arena_) HStoreLocal(local, parameter));
175 entry_block_->AddInstruction(parameter);
179 entry_block_->AddInstruction(new (arena_) HStoreLocal(local, parameter));
270 entry_block_ = new (arena_) HBasicBlock(graph_, 0);
271 graph_->AddBlock(entry_block_);
273 graph_->SetEntryBlock(entry_block_);
332 entry_block_->AddInstruction(new (arena_) HSuspendCheck(0));
333 entry_block_->AddInstruction(new (arena_) HGoto())
[all...] |
| nodes.h | 130 entry_block_(nullptr),
152 HBasicBlock* GetEntryBlock() const { return entry_block_; }
155 void SetEntryBlock(HBasicBlock* block) { entry_block_ = block; }
339 HBasicBlock* entry_block_; member in class:art::HGraph
[all...] |
| /art/compiler/dex/ |
| mir_graph_test.cc | 95 cu_.mir_graph->entry_block_ = cu_.mir_graph->block_list_[1];
96 ASSERT_EQ(kEntryBlock, cu_.mir_graph->entry_block_->block_type);
|
| mir_graph.h | 623 return entry_block_;
1434 BasicBlock* entry_block_; member in class:art::MIRGraph
[all...] |
| mir_graph.cc | 113 entry_block_(nullptr),
731 DCHECK(entry_block_ == nullptr);
738 entry_block_ = CreateNewBB(kEntryBlock);
753 entry_block_->fall_through = cur_block->id;
754 cur_block->predecessors.push_back(entry_block_->id);
[all...] |
| mir_optimization_test.cc | 134 cu_.mir_graph->entry_block_ = cu_.mir_graph->block_list_[1];
135 ASSERT_EQ(kEntryBlock, cu_.mir_graph->entry_block_->block_type);
[all...] |
| global_value_numbering_test.cc | 219 cu_.mir_graph->entry_block_ = cu_.mir_graph->block_list_[1];
220 ASSERT_EQ(kEntryBlock, cu_.mir_graph->entry_block_->block_type);
[all...] |
| gvn_dead_code_elimination_test.cc | 227 cu_.mir_graph->entry_block_ = cu_.mir_graph->block_list_[1];
228 ASSERT_EQ(kEntryBlock, cu_.mir_graph->entry_block_->block_type);
[all...] |
| type_inference_test.cc | 338 cu_.mir_graph->entry_block_ = cu_.mir_graph->block_list_[1];
339 ASSERT_EQ(kEntryBlock, cu_.mir_graph->entry_block_->block_type);
[all...] |
| /external/v8/src/ |
| hydrogen.h | 314 HBasicBlock* entry_block() const { return entry_block_; }
486 HBasicBlock* entry_block_; member in class:v8::internal::FINAL
[all...] |
| hydrogen.cc | 625 ReachabilityAnalyzer analyzer(entry_block_, blocks_.length(), NULL);
629 DCHECK(entry_block_->dominator() == NULL);
639 ReachabilityAnalyzer dominator_analyzer(entry_block_,
[all...] |
