| /art/compiler/optimizing/ |
| find_loops_test.cc | 39 for (HBasicBlock* block : graph->GetBlocks()) {
50 for (HBasicBlock* block : graph->GetBlocks()) {
64 for (HBasicBlock* block : graph->GetBlocks()) {
79 for (HBasicBlock* block : graph->GetBlocks()) {
92 for (HBasicBlock* block : graph->GetBlocks()) {
103 HBasicBlock* block = graph->GetBlocks()[block_id];
113 const BitVector& blocks = info->GetBlocks();
269 ASSERT_TRUE(graph->GetBlocks()[3]->GetLoopInformation()->IsIn(
270 *graph->GetBlocks()[2]->GetLoopInformation()));
271 ASSERT_FALSE(graph->GetBlocks()[2]->GetLoopInformation()->IsIn
[all...] |
| side_effects_analysis.h | 31 block_effects_(graph->GetBlocks().size(),
33 loop_effects_(graph->GetBlocks().size(),
|
| superblock_cloner.h | 73 if (from >= graph->GetBlocks().size() || to >= graph->GetBlocks().size()) {
77 HBasicBlock* block_from = graph->GetBlocks()[from];
78 HBasicBlock* block_to = graph->GetBlocks()[to];
277 DCHECK(block_id < graph_->GetBlocks().size());
278 HBasicBlock* block = graph_->GetBlocks()[block_id];
|
| side_effects_analysis.cc | 24 block_effects_.resize(graph_->GetBlocks().size());
25 loop_effects_.resize(graph_->GetBlocks().size());
|
| linear_order.cc | 59 for (HBasicBlock* header : graph->GetBlocks()) {
64 size_t num_blocks = loop->GetBlocks().NumSetBits();
98 ScopedArenaVector<uint32_t> forward_predecessors(graph->GetBlocks().size(),
|
| dominator_test.cc | 36 ASSERT_EQ(graph->GetBlocks().size(), blocks_length);
39 if (graph->GetBlocks()[i] == nullptr) {
43 ASSERT_EQ(nullptr, graph->GetBlocks()[i]->GetDominator());
44 ASSERT_TRUE(graph->GetBlocks()[i]->IsEntryBlock());
47 ASSERT_NE(nullptr, graph->GetBlocks()[i]->GetDominator());
48 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId());
|
| constant_folding_test.cc | 130 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
191 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
252 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
331 HInstruction* inst1 = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
402 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
465 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
529 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
629 HInstruction* inst1 = graph->GetBlocks()[4]->GetFirstInstruction()->InputAt(0);
714 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0);
|
| builder.cc | 111 DCHECK(graph_->GetBlocks().empty());
170 DCHECK(graph_->GetBlocks().empty());
|
| code_sinking.cc | 263 ArenaBitVector post_dominated(&allocator, graph_->GetBlocks().size(), /* expandable */ false);
304 for (size_t i = 0, e = graph_->GetBlocks().size(); i < e; ++i) {
306 finder.Update(graph_->GetBlocks()[i]);
307 AddInputs(graph_->GetBlocks()[i], processed_instructions, post_dominated, &worklist);
|
| superblock_cloner_test.cc | 202 arena, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner);
207 orig_bb_set.Union(&loop_info->GetBlocks());
281 arena, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner);
284 orig_bb_set.Union(&loop_info->GetBlocks());
|
| block_builder.cc | 287 for (HBasicBlock* block : graph_->GetBlocks()) {
352 HBasicBlock* try_block = graph_->GetBlocks()[block_id];
371 HBasicBlock* try_block = graph_->GetBlocks()[block_id];
395 DCHECK(graph_->GetBlocks().empty());
413 DCHECK(graph_->GetBlocks().empty());
|
| superblock_cloner.cc | 226 ArenaBitVector visited(arena_, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner);
231 ArenaBitVector visiting(arena_, graph_->GetBlocks().size(), false, kArenaAllocGraphBuilder);
233 ArenaVector<size_t> successors_visited(graph_->GetBlocks().size(),
275 for (auto block : graph_->GetBlocks()) {
357 arena_, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner);
432 outer_loop_bb_set_.Copy(&outer_loop_->GetBlocks());
477 arena_, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner);
|
| ssa_test.cc | 73 for (HBasicBlock* block : graph->GetBlocks()) {
91 for (HBasicBlock* block : graph->GetBlocks()) {
|
| gvn.cc | 349 sets_(graph->GetBlocks().size(), nullptr, allocator_.Adapter(kArenaAllocGvn)),
351 &allocator_, graph->GetBlocks().size(), /* expandable */ false, kArenaAllocGvn) {
537 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 | 77 HBasicBlock* block = graph->GetBlocks()[1];
123 HBasicBlock* block = graph->GetBlocks()[3];
|
| liveness_test.cc | 60 for (HBasicBlock* block : graph->GetBlocks()) {
|
| optimizing_unit_test.h | 75 for (HBasicBlock* block : graph->GetBlocks()) {
|
| register_allocator_test.cc | 337 HBasicBlock* loop_header = graph->GetBlocks()[2];
346 HBasicBlock* return_block = graph->GetBlocks()[3];
368 HXor* first_xor = graph->GetBlocks()[1]->GetFirstInstruction()->AsXor();
369 HXor* last_xor = graph->GetBlocks()[1]->GetLastInstruction()->GetPrevious()->AsXor();
[all...] |
| graph_checker.cc | 625 const ArenaBitVector& loop_blocks = loop_information->GetBlocks();
654 if (!loop_blocks.IsSubsetOf(&outer_info->GetBlocks())) {
673 HBasicBlock* loop_block = GetGraph()->GetBlocks()[i];
[all...] |
| dead_code_elimination.cc | 452 ArenaBitVector live_blocks(&allocator, graph_->GetBlocks().size(), false, kArenaAllocDCE);
|
| nodes.cc | [all...] |
| graph_visualizer.cc | 867 if (!graph_->GetBlocks().empty()) {
[all...] |
| bounds_check_elimination.cc | 515 maps_(graph->GetBlocks().size(),
528 initial_block_size_(graph->GetBlocks().size()),
[all...] |
