| /art/compiler/optimizing/ |
| graph_test.cc | 82 entry_block->AddSuccessor(if_block);
83 if_block->AddSuccessor(if_true);
84 if_true->AddSuccessor(return_block);
85 if_block->AddSuccessor(return_block);
86 return_block->AddSuccessor(exit_block);
117 entry_block->AddSuccessor(if_block);
118 if_block->AddSuccessor(return_block);
119 if_false->AddSuccessor(return_block);
120 if_block->AddSuccessor(if_false);
121 return_block->AddSuccessor(exit_block)
[all...] |
| gvn_test.cc | 44 entry->AddSuccessor(block);
128 entry->AddSuccessor(block);
147 block->AddSuccessor(then);
148 block->AddSuccessor(else_);
149 then->AddSuccessor(join);
150 else_->AddSuccessor(join);
211 entry->AddSuccessor(block);
230 block->AddSuccessor(loop_header);
231 loop_header->AddSuccessor(loop_body);
232 loop_header->AddSuccessor(exit)
[all...] |
| bounds_check_elimination_test.cc | 88 entry->AddSuccessor(block1);
142 block2->AddSuccessor(exit);
143 block4->AddSuccessor(exit);
144 block5->AddSuccessor(exit);
147 block1->AddSuccessor(block3); // True successor
148 block1->AddSuccessor(block2); // False successor
150 block3->AddSuccessor(block5); // True successor
151 block3->AddSuccessor(block4); // False successor
186 entry->AddSuccessor(block1);
213 block1->AddSuccessor(exit); // true successo
[all...] |
| loop_optimization_test.cc | 58 entry_block_->AddSuccessor(return_block_);
59 return_block_->AddSuccessor(exit_block_);
70 header->AddSuccessor(body);
71 header->AddSuccessor(successor);
73 body->AddSuccessor(header);
|
| licm_test.cc | 69 entry_->AddSuccessor(loop_preheader_);
70 loop_preheader_->AddSuccessor(loop_header_);
71 loop_header_->AddSuccessor(loop_body_);
72 loop_header_->AddSuccessor(return_);
73 loop_body_->AddSuccessor(loop_header_);
74 return_->AddSuccessor(exit_);
|
| block_builder.cc | 140 block->AddSuccessor(next_block);
166 block->AddSuccessor(GetBlockAt(target_dex_pc));
168 block->AddSuccessor(graph_->GetExitBlock());
173 block->AddSuccessor(GetBlockAt(target_dex_pc));
178 block->AddSuccessor(next_case_block);
190 block->AddSuccessor(GetBlockAt(next_dex_pc));
307 new_catch_block->AddSuccessor(catch_block);
|
| codegen_test.cc | 427 entry->AddSuccessor(first_block);
442 first_block->AddSuccessor(then_block);
443 first_block->AddSuccessor(else_block);
444 then_block->AddSuccessor(exit_block);
445 else_block->AddSuccessor(exit_block);
492 entry_block->AddSuccessor(code_block);
493 code_block->AddSuccessor(exit_block);
546 entry_block->AddSuccessor(if_block);
547 if_block->AddSuccessor(if_true_block);
548 if_block->AddSuccessor(if_false_block)
[all...] |
| register_allocator_test.cc | 503 entry->AddSuccessor(block);
523 block->AddSuccessor(then);
524 block->AddSuccessor(else_);
525 then->AddSuccessor(join);
526 else_->AddSuccessor(join);
665 entry->AddSuccessor(block);
682 block->AddSuccessor(exit);
752 entry->AddSuccessor(block);
831 entry->AddSuccessor(block);
[all...] |
| induction_var_analysis_test.cc | 59 loop_preheader_[d]->AddSuccessor(loop_header_[d]);
65 loop_body_[d]->AddSuccessor(loop_header_[d]);
67 loop_header_[d]->AddSuccessor(loop_preheader_[d + 1]);
68 loop_header_[d + 1]->AddSuccessor(loop_body_[d]);
70 loop_header_[d]->AddSuccessor(loop_body_[d]);
89 entry_->AddSuccessor(loop_preheader_[0]);
90 loop_header_[0]->AddSuccessor(return_);
91 return_->AddSuccessor(exit_);
136 cond->AddSuccessor(ifTrue);
137 cond->AddSuccessor(ifFalse)
[all...] |
| graph_checker_test.cc | 40 entry_block->AddSuccessor(exit_block);
|
| nodes_test.cc | 44 entry->AddSuccessor(first_block);
51 first_block->AddSuccessor(exit_block);
|
| ssa_liveness_analysis_test.cc | 56 block->AddSuccessor(successor);
|
| induction_var_range_test.cc | 95 entry_block_->AddSuccessor(loop_preheader_);
96 loop_preheader_->AddSuccessor(loop_header_);
97 loop_header_->AddSuccessor(loop_body_);
98 loop_header_->AddSuccessor(return_block);
99 loop_body_->AddSuccessor(loop_header_);
100 return_block->AddSuccessor(exit_block_);
[all...] |
| constant_folding_test.cc | 754 entry_block->AddSuccessor(block);
755 block->AddSuccessor(exit_block);
|
| nodes.cc | 351 pre_header->AddSuccessor(header);
[all...] |
| inliner.cc | [all...] |
| loop_optimization.cc | 544 preheader->AddSuccessor(exit);
[all...] |
| nodes.h | [all...] |
| /external/v8/src/compiler/ |
| instruction-scheduler.cc | 74 void InstructionScheduler::ScheduleGraphNode::AddSuccessor(
127 node->AddSuccessor(new_node);
131 last_live_in_reg_marker_->AddSuccessor(new_node);
136 last_live_in_reg_marker_->AddSuccessor(new_node);
142 last_deopt_->AddSuccessor(new_node);
149 last_side_effect_instr_->AddSuccessor(new_node);
152 load->AddSuccessor(new_node);
160 last_side_effect_instr_->AddSuccessor(new_node);
167 last_side_effect_instr_->AddSuccessor(new_node);
179 it->second->AddSuccessor(new_node)
[all...] |
| schedule.cc | 43 void BasicBlock::AddSuccessor(BasicBlock* successor) {
199 AddSuccessor(block, succ);
225 AddSuccessor(block, success_block);
226 AddSuccessor(block, exception_block);
236 AddSuccessor(block, tblock);
237 AddSuccessor(block, fblock);
248 AddSuccessor(block, succ_blocks[index]);
258 if (block != end()) AddSuccessor(block, end());
266 if (block != end()) AddSuccessor(block, end());
274 if (block != end()) AddSuccessor(block, end())
[all...] |
| schedule.h | 78 void AddSuccessor(BasicBlock* successor);
246 return AddSuccessor(block, succ);
272 void AddSuccessor(BasicBlock* block, BasicBlock* succ);
|
| instruction-scheduler.h | 51 void AddSuccessor(ScheduleGraphNode* node);
|
