| /art/compiler/optimizing/ |
| graph_test.cc | 83 entry_block->AddSuccessor(if_block);
84 if_block->AddSuccessor(if_true);
85 if_true->AddSuccessor(return_block);
86 if_block->AddSuccessor(return_block);
87 return_block->AddSuccessor(exit_block);
118 entry_block->AddSuccessor(if_block);
119 if_block->AddSuccessor(return_block);
120 if_false->AddSuccessor(return_block);
121 if_block->AddSuccessor(if_false);
122 return_block->AddSuccessor(exit_block)
[all...] |
| gvn_test.cc | 45 entry->AddSuccessor(block);
130 entry->AddSuccessor(block);
149 block->AddSuccessor(then);
150 block->AddSuccessor(else_);
151 then->AddSuccessor(join);
152 else_->AddSuccessor(join);
214 entry->AddSuccessor(block);
233 block->AddSuccessor(loop_header);
234 loop_header->AddSuccessor(loop_body);
235 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...] |
| licm_test.cc | 58 entry_->AddSuccessor(loop_preheader_);
59 loop_preheader_->AddSuccessor(loop_header_);
60 loop_header_->AddSuccessor(loop_body_);
61 loop_header_->AddSuccessor(return_);
62 loop_body_->AddSuccessor(loop_header_);
63 return_->AddSuccessor(exit_);
|
| block_builder.cc | 134 block->AddSuccessor(next_block);
156 block->AddSuccessor(GetBlockAt(target_dex_pc));
158 block->AddSuccessor(graph_->GetExitBlock());
163 block->AddSuccessor(GetBlockAt(target_dex_pc));
168 block->AddSuccessor(next_case_block);
180 block->AddSuccessor(GetBlockAt(next_dex_pc));
297 new_catch_block->AddSuccessor(catch_block);
|
| codegen_test.cc | 644 entry->AddSuccessor(first_block);
659 first_block->AddSuccessor(then_block);
660 first_block->AddSuccessor(else_block);
661 then_block->AddSuccessor(exit_block);
662 else_block->AddSuccessor(exit_block);
709 entry_block->AddSuccessor(code_block);
710 code_block->AddSuccessor(exit_block);
763 entry_block->AddSuccessor(if_block);
764 if_block->AddSuccessor(if_true_block);
765 if_block->AddSuccessor(if_false_block)
[all...] |
| induction_var_analysis_test.cc | 45 loop_preheader_[d]->AddSuccessor(loop_header_[d]);
51 loop_body_[d]->AddSuccessor(loop_header_[d]);
53 loop_header_[d]->AddSuccessor(loop_preheader_[d + 1]);
54 loop_header_[d + 1]->AddSuccessor(loop_body_[d]);
56 loop_header_[d]->AddSuccessor(loop_body_[d]);
75 entry_->AddSuccessor(loop_preheader_[0]);
76 loop_header_[0]->AddSuccessor(return_);
77 return_->AddSuccessor(exit_);
119 cond->AddSuccessor(ifTrue);
120 cond->AddSuccessor(ifFalse)
[all...] |
| register_allocator_test.cc | 471 entry->AddSuccessor(block);
491 block->AddSuccessor(then);
492 block->AddSuccessor(else_);
493 then->AddSuccessor(join);
494 else_->AddSuccessor(join);
624 entry->AddSuccessor(block);
641 block->AddSuccessor(exit);
703 entry->AddSuccessor(block);
774 entry->AddSuccessor(block);
834 entry->AddSuccessor(block)
[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);
|
| induction_var_range_test.cc | 82 entry_block_->AddSuccessor(loop_preheader_);
83 loop_preheader_->AddSuccessor(loop_header);
84 loop_header->AddSuccessor(loop_body);
85 loop_header->AddSuccessor(return_block);
86 loop_body->AddSuccessor(loop_header);
87 return_block->AddSuccessor(exit_block_);
[all...] |
| constant_folding_test.cc | 754 entry_block->AddSuccessor(block);
755 block->AddSuccessor(exit_block);
|
| inliner.cc | 592 cursor_block->AddSuccessor(otherwise);
593 cursor_block->AddSuccessor(then);
594 end_then->AddSuccessor(merge);
595 otherwise->AddSuccessor(merge);
[all...] |
| nodes.cc | 355 pre_header->AddSuccessor(header);
[all...] |
| nodes.h | 912 void AddSuccessor(HBasicBlock* block) {
[all...] |
| /external/v8/src/compiler/ |
| schedule.cc | 43 void BasicBlock::AddSuccessor(BasicBlock* successor) {
199 AddSuccessor(block, succ);
208 AddSuccessor(block, success_block);
209 AddSuccessor(block, exception_block);
219 AddSuccessor(block, tblock);
220 AddSuccessor(block, fblock);
231 AddSuccessor(block, succ_blocks[index]);
241 if (block != end()) AddSuccessor(block, end());
249 if (block != end()) AddSuccessor(block, end());
257 if (block != end()) AddSuccessor(block, end())
[all...] |
| instruction-scheduler.cc | 25 void InstructionScheduler::ScheduleGraphNode::AddSuccessor(
69 node->AddSuccessor(new_node);
73 last_live_in_reg_marker_->AddSuccessor(new_node);
78 last_live_in_reg_marker_->AddSuccessor(new_node);
85 last_side_effect_instr_->AddSuccessor(new_node);
88 load->AddSuccessor(new_node);
96 last_side_effect_instr_->AddSuccessor(new_node);
104 node->AddSuccessor(new_node);
|
| instruction-scheduler.h | 48 void AddSuccessor(ScheduleGraphNode* node);
|
| schedule.h | 75 void AddSuccessor(BasicBlock* successor);
243 return AddSuccessor(block, succ);
258 void AddSuccessor(BasicBlock* block, BasicBlock* succ);
|
