| /art/compiler/optimizing/ |
| side_effects_analysis.h | 31 block_effects_(graph->GetBlocks().size(),
33 loop_effects_(graph->GetBlocks().size(),
|
| 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()[2]->GetLoopInformation()->IsIn
[all...] |
| side_effects_analysis.cc | 24 block_effects_.resize(graph_->GetBlocks().size());
25 loop_effects_.resize(graph_->GetBlocks().size());
|
| linear_order.cc | 55 for (HBasicBlock* header : graph->GetBlocks()) {
60 size_t num_blocks = loop->GetBlocks().NumSetBits();
95 ArenaVector<uint32_t> forward_predecessors(graph->GetBlocks().size(),
|
| 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());
|
| builder.cc | 74 DCHECK(graph_->GetBlocks().empty());
|
| 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);
|
| block_builder.cc | 261 for (HBasicBlock* block : graph_->GetBlocks()) {
326 HBasicBlock* try_block = graph_->GetBlocks()[block_id];
345 HBasicBlock* try_block = graph_->GetBlocks()[block_id];
368 DCHECK(graph_->GetBlocks().empty());
|
| code_sinking.cc | 247 ArenaBitVector post_dominated(&allocator, graph_->GetBlocks().size(), /* expandable */ false);
286 for (size_t i = 0, e = graph_->GetBlocks().size(); i < e; ++i) {
288 finder.Update(graph_->GetBlocks()[i]);
289 AddInputs(graph_->GetBlocks()[i], processed_instructions, post_dominated, &worklist);
|
| optimizing_unit_test.h | 65 for (HBasicBlock* block : graph->GetBlocks()) {
|
| ssa_test.cc | 70 for (HBasicBlock* block : graph->GetBlocks()) {
90 for (HBasicBlock* block : graph->GetBlocks()) {
|
| 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];
|
| cha_guard_optimization.cc | 37 block_has_cha_guard_(GetGraph()->GetBlocks().size(),
|
| licm.cc | 88 graph_->GetBlocks().size(),
|
| live_ranges_test.cc | 76 HBasicBlock* block = graph->GetBlocks()[1];
124 HBasicBlock* block = graph->GetBlocks()[3];
|
| liveness_test.cc | 59 for (HBasicBlock* block : graph->GetBlocks()) {
|
| register_allocator_test.cc | 329 HBasicBlock* loop_header = graph->GetBlocks()[2];
338 HBasicBlock* return_block = graph->GetBlocks()[3];
362 HXor* first_xor = graph->GetBlocks()[1]->GetFirstInstruction()->AsXor();
363 HXor* last_xor = graph->GetBlocks()[1]->GetLastInstruction()->GetPrevious()->AsXor();
[all...] |
| dead_code_elimination.cc | 310 ArenaBitVector live_blocks(allocator, graph_->GetBlocks().size(), false, kArenaAllocDCE);
|
| graph_checker.cc | 613 const ArenaBitVector& loop_blocks = loop_information->GetBlocks();
642 if (!loop_blocks.IsSubsetOf(&outer_info->GetBlocks())) {
661 HBasicBlock* loop_block = GetGraph()->GetBlocks()[i];
[all...] |
| nodes.cc | 665 graph->GetBlocks().size(),
[all...] |
| graph_visualizer.cc | 864 if (!graph_->GetBlocks().empty()) {
877 if (!graph_->GetBlocks().empty()) {
[all...] |
| load_store_elimination.cc | 47 heap_values_for_(graph->GetBlocks().size(),
|
| bounds_check_elimination.cc | 513 maps_(graph->GetBlocks().size(),
529 initial_block_size_(graph->GetBlocks().size()),
[all...] |
| code_generator.h | 659 size_t size = GetGraph()->GetBlocks().size();
[all...] |
| code_generator_arm64.h | 484 block_labels_.resize(GetGraph()->GetBlocks().size());
[all...] |
