HomeSort by relevance Sort by last modified time
    Searched refs:GetEntryBlock (Results 1 - 16 of 16) sorted by null

  /art/compiler/optimizing/
suspend_check_test.cc 35 HBasicBlock* first_block = graph->GetEntryBlock()->GetSingleSuccessor();
pc_relative_fixups_mips.cc 56 HBasicBlock* entry_block = GetGraph()->GetEntryBlock();
graph_checker_test.cc 106 graph->GetExitBlock()->RemovePredecessor(graph->GetEntryBlock());
linear_order.cc 110 worklist.push_back(graph->GetEntryBlock());
block_builder.cc 122 HBasicBlock* block = graph_->GetEntryBlock();
224 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty())
dead_code_elimination.cc 30 visited->SetBit(graph->GetEntryBlock()->GetBlockId());
31 worklist.push_back(graph->GetEntryBlock());
pc_relative_fixups_x86.cc 181 HBasicBlock* entry_block = GetGraph()->GetEntryBlock();
code_sinking.cc 41 if (instruction->GetBlock() == instruction->GetBlock()->GetGraph()->GetEntryBlock()) {
codegen_test.cc 457 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0];
505 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0];
573 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0];
gvn.cc 410 sets_[graph_->GetEntryBlock()->GetBlockId()] = new (allocator_) ValueSet(allocator_);
register_allocator_test.cc 447 LiveInterval* unhandled = graph->GetEntryBlock()->GetFirstInstruction()->GetLiveInterval();
453 graph->GetEntryBlock()->GetFirstInstruction());
    [all...]
graph_visualizer.cc 729 GetGraph()->GetEntryBlock()->GetBlockId());
    [all...]
code_generator.cc 301 DCHECK(block_order[0] == GetGraph()->GetEntryBlock());
    [all...]
inliner.cc     [all...]
nodes.h 361 HBasicBlock* GetEntryBlock() const { return entry_block_; }
    [all...]
nodes.cc 339 if (number_of_incomings != 1 || (GetEntryBlock()->GetSingleSuccessor() == header)) {
    [all...]

Completed in 695 milliseconds