| /art/compiler/optimizing/ |
| H A D | block_builder.cc | 251 for (HBasicBlock* block : graph_->GetBlocks()) {
314 HBasicBlock* try_block = graph_->GetBlocks()[entry.first];
331 HBasicBlock* try_block = graph_->GetBlocks()[entry.first];
354 DCHECK(graph_->GetBlocks().empty());
|
| H A D | bounds_check_elimination.cc | 528 maps_(graph->GetBlocks().size(),
547 initial_block_size_(graph->GetBlocks().size()),
|
| H A D | builder.cc | 74 DCHECK(graph_->GetBlocks().empty());
|
| H A D | code_generator.h | 563 size_t size = GetGraph()->GetBlocks().size();
|
| H A D | code_generator_arm64.h | 417 block_labels_.resize(GetGraph()->GetBlocks().size());
|
| H A D | constant_folding_test.cc | 134 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
195 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
256 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
335 HInstruction* inst1 = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
406 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
469 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
533 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
633 HInstruction* inst1 = graph->GetBlocks()[4]->GetFirstInstruction()->InputAt(0);
718 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
|
| H A D | dead_code_elimination.cc | 100 ArenaBitVector live_blocks(allocator, graph_->GetBlocks().size(), false, kArenaAllocDCE);
|
| H A D | dominator_test.cc | 33 ASSERT_EQ(graph->GetBlocks().size(), blocks_length);
36 if (graph->GetBlocks()[i] == nullptr) {
40 ASSERT_EQ(nullptr, graph->GetBlocks()[i]->GetDominator());
41 ASSERT_TRUE(graph->GetBlocks()[i]->IsEntryBlock());
44 ASSERT_NE(nullptr, graph->GetBlocks()[i]->GetDominator());
45 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId());
|
| H A D | find_loops_test.cc | 41 for (HBasicBlock* block : graph->GetBlocks()) {
54 for (HBasicBlock* block : graph->GetBlocks()) {
70 for (HBasicBlock* block : graph->GetBlocks()) {
87 for (HBasicBlock* block : graph->GetBlocks()) {
102 for (HBasicBlock* block : graph->GetBlocks()) {
113 HBasicBlock* block = graph->GetBlocks()[block_id];
123 const BitVector& blocks = info->GetBlocks();
291 ASSERT_TRUE(graph->GetBlocks()[3]->GetLoopInformation()->IsIn(
292 *graph->GetBlocks()[2]->GetLoopInformation()));
293 ASSERT_FALSE(graph->GetBlocks()[
[all...] |
| H A D | graph_checker.cc | 607 const ArenaBitVector& loop_blocks = loop_information->GetBlocks();
636 if (!loop_blocks.IsSubsetOf(&outer_info->GetBlocks())) {
655 HBasicBlock* loop_block = GetGraph()->GetBlocks()[i];
|
| H A D | graph_visualizer.cc | 789 if (!graph_->GetBlocks().empty()) {
802 if (!graph_->GetBlocks().empty()) {
|
| H A D | gvn.cc | 359 sets_(graph->GetBlocks().size(), nullptr, allocator->Adapter(kArenaAllocGvn)),
361 allocator, graph->GetBlocks().size(), /* expandable */ false, kArenaAllocGvn) {}
545 HBasicBlock* current_block = block->GetGraph()->GetBlocks()[block_id];
|
| H A D | instruction_builder.cc | 261 locals_for_.resize(graph_->GetBlocks().size(),
|
| H A D | licm.cc | 87 graph_->GetBlocks().size(),
|
| H A D | live_ranges_test.cc | 76 HBasicBlock* block = graph->GetBlocks()[1];
124 HBasicBlock* block = graph->GetBlocks()[3];
|
| H A D | load_store_elimination.cc | 516 heap_values_for_(graph->GetBlocks().size(),
|
| H A D | nodes.cc | 662 graph->GetBlocks().size(),
1145 const ArenaVector<HBasicBlock*>& blocks = graph_->GetBlocks();
1720 DCHECK_EQ(loop_info->GetBlocks().NumSetBits(), 1u);
1721 DCHECK_EQ(static_cast<uint32_t>(loop_info->GetBlocks().GetHighestBitSet()), GetBlockId());
2021 if (GetBlocks().size() == 3) {
2024 HBasicBlock* body = GetBlocks()[1];
2025 DCHECK(GetBlocks()[0]->IsEntryBlock());
2026 DCHECK(GetBlocks()[2]->IsExitBlock());
|
| H A D | nodes.h | 323 const ArenaVector<HBasicBlock*>& GetBlocks() const { return blocks_; } function in class:art::HGraph
656 blocks_(graph->GetArena(), graph->GetBlocks().size(), true, kArenaAllocLoopInfoBackEdges) {
721 const ArenaBitVector& GetBlocks() const { return blocks_; } function in class:art::HLoopInformation
6404 bool Done() const { return index_ == graph_.GetBlocks().size(); }
6405 HBasicBlock* Current() const { return graph_.GetBlocks()[index_]; }
6495 : blocks_in_loop_(info.GetBlocks()),
6496 blocks_(info.GetHeader()->GetGraph()->GetBlocks()),
6528 : blocks_in_loop_(info.GetBlocks()),
|
| H A D | optimizing_unit_test.h | 65 for (HBasicBlock* block : graph->GetBlocks()) {
|
| H A D | register_allocator_test.cc | 302 HBasicBlock* loop_header = graph->GetBlocks()[2];
311 HBasicBlock* return_block = graph->GetBlocks()[3];
333 HXor* first_xor = graph->GetBlocks()[1]->GetFirstInstruction()->AsXor();
334 HXor* last_xor = graph->GetBlocks()[1]->GetLastInstruction()->GetPrevious()->AsXor();
|
| H A D | side_effects_analysis.cc | 24 block_effects_.resize(graph_->GetBlocks().size());
25 loop_effects_.resize(graph_->GetBlocks().size());
|
| H A D | side_effects_analysis.h | 31 block_effects_(graph->GetBlocks().size(),
33 loop_effects_(graph->GetBlocks().size(),
|
| H A D | ssa_liveness_analysis.cc | 72 ArenaVector<uint32_t> forward_predecessors(graph_->GetBlocks().size(),
|
| H A D | ssa_liveness_analysis.h | 973 for (HBasicBlock* header : graph.GetBlocks()) {
979 size_t num_blocks = loop->GetBlocks().NumSetBits();
1152 block_infos_(graph->GetBlocks().size(),
|
| H A D | ssa_test.cc | 69 for (HBasicBlock* block : graph->GetBlocks()) {
89 for (HBasicBlock* block : graph->GetBlocks()) {
|