| /art/compiler/optimizing/ |
| graph_checker.cc | 66 block->GetBlockId(), p_count_in_block_predecessors, p->GetBlockId(),
67 p->GetBlockId(), block_count_in_p_successors, block->GetBlockId()));
89 block->GetBlockId(), s_count_in_block_successors, s->GetBlockId(),
90 s->GetBlockId(), block_count_in_s_predecessors, block->GetBlockId()));
100 block->GetBlockId()));
124 current_block_->GetBlockId()));
[all...] |
| pretty_printer.h | 73 PrintInt(block->GetBlockId());
78 PrintInt(predecessors[i]->GetBlockId());
81 PrintInt(predecessors.back()->GetBlockId());
87 PrintInt(successors[i]->GetBlockId());
90 PrintInt(successors.back()->GetBlockId());
134 PrintInt(current_block_->GetSuccessors()[0]->GetBlockId());
|
| side_effects_analysis.cc | 57 block_effects_[block->GetBlockId()] = effects;
79 return loop_effects_[block->GetBlockId()];
83 return block_effects_[block->GetBlockId()];
87 uint32_t id = info->GetHeader()->GetBlockId();
|
| dead_code_elimination.cc | 29 visited->SetBit(graph->GetEntryBlock()->GetBlockId());
35 int block_id = block->GetBlockId();
76 if (!visited->IsBitSet(successor->GetBlockId())) {
77 visited->SetBit(successor->GetBlockId());
111 int id = block->GetBlockId();
|
| gvn.cc | 375 ValueSet* result = sets_[block->GetBlockId()];
376 DCHECK(result != nullptr) << "Could not find set for block B" << block->GetBlockId();
381 DCHECK(sets_[block->GetBlockId()] != nullptr)
382 << "Block B" << block->GetBlockId() << " expected to have a set";
383 sets_[block->GetBlockId()] = nullptr;
410 sets_[graph_->GetEntryBlock()->GetBlockId()] = new (allocator_) ValueSet(allocator_);
481 sets_[block->GetBlockId()] = set;
513 visited_blocks_.SetBit(block->GetBlockId());
517 DCHECK(visited_blocks_.IsBitSet(block->GetBlockId()));
520 if (!visited_blocks_.IsBitSet(dominated_block->GetBlockId())) {
[all...] |
| licm.cc | 109 DCHECK(visited->IsBitSet(inner->GetBlockId()));
113 visited->SetBit(inner->GetBlockId());
|
| load_store_elimination.cc | 598 int block_id = block->GetBlockId();
614 heap_values_for_[pre_header->GetBlockId()];
645 ArenaVector<HInstruction*>& heap_values = heap_values_for_[block->GetBlockId()];
647 HInstruction* pred0_value = heap_values_for_[predecessors[0]->GetBlockId()][i];
651 HInstruction* pred_value = heap_values_for_[predecessors[j]->GetBlockId()][i];
662 ArenaVector<HInstruction*>& pred_values = heap_values_for_[predecessors[j]->GetBlockId()];
720 heap_values_for_[instruction->GetBlock()->GetBlockId()];
784 heap_values_for_[instruction->GetBlock()->GetBlockId()];
[all...] |
| nodes.cc | 66 visited->SetBit(entry_block_->GetBlockId());
67 visiting.SetBit(entry_block_->GetBlockId());
72 uint32_t current_id = current->GetBlockId();
78 uint32_t successor_id = successor->GetBlockId();
246 uint32_t current_id = current->GetBlockId();
255 if (++visits[successor->GetBlockId()] ==
467 os << "header: " << header_->GetBlockId() << std::endl;
468 os << "pre header: " << GetPreHeader()->GetBlockId() << std::endl;
470 os << "back edge: " << block->GetBlockId() << std::endl;
473 os << "predecessor: " << block->GetBlockId() << std::endl
[all...] |
| block_builder.cc | 194 auto iterator = try_block_info.find(block->GetBlockId());
265 try_block_info.Put(block->GetBlockId(), DexFile::GetTryItems(code_item_, try_item_idx));
293 bool is_try_block = (try_block_info.find(catch_block->GetBlockId()) != try_block_info.end());
|
| graph_visualizer.cc | 258 output_ << " \"B" << predecessor->GetBlockId() << "\" ";
270 output_ << " \"B" << successor->GetBlockId() << "\" ";
279 output_ << " \"B" << handler->GetBlockId() << "\" ";
556 StartAttributeStream("loop") << "B" << loop_info->GetHeader()->GetBlockId();
559 StartAttributeStream("outer_loop") << "B" << outer->GetHeader()->GetBlockId();
654 GetGraph()->GetEntryBlock()->GetBlockId());
674 GetGraph()->HasExitBlock() ? GetGraph()->GetExitBlock()->GetBlockId() : -1,
705 PrintProperty("name", "B", block->GetBlockId());
725 PrintProperty("dominator", "B", block->GetDominator()->GetBlockId());
|
| linearize_test.cc | 51 ASSERT_EQ(graph->GetLinearOrder()[i]->GetBlockId(), expected_order[i]);
|
| ssa_liveness_analysis.cc | 80 forward_predecessors[block->GetBlockId()] = number_of_forward_predecessors;
95 int block_id = successor->GetBlockId();
162 block_infos_[block->GetBlockId()] =
|
| dominator_test.cc | 45 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId());
|
| liveness_test.cc | 61 buffer << "Block " << block->GetBlockId() << std::endl;
|
| bounds_check_elimination.cc | 521 return block->GetBlockId() >= initial_block_size_;
589 return &maps_[basic_block->GetBlockId()];
[all...] |
| ssa_liveness_analysis.h | [all...] |
| find_loops_test.cc | 118 ASSERT_EQ(block->GetLoopInformation()->GetHeader()->GetBlockId(), parent_loop_header_id);
|
| code_generator.h | 575 return raw_pointer_to_labels_array + block->GetBlockId();
|
| code_generator_arm64.h | 357 return &(block_labels_[block->GetBlockId()]);
|
| induction_var_range.cc | 111 DCHECK(block->GetLastInstruction() != nullptr) << block->GetBlockId();
[all...] |
| register_allocator.cc | [all...] |
| nodes.h | 881 uint32_t GetBlockId() const { return block_id_; }
[all...] |
| instruction_builder.cc | 37 ArenaVector<HInstruction*>* locals = &locals_for_[block->GetBlockId()];
[all...] |
