HomeSort by relevance Sort by last modified time
    Searched refs:AddSuccessor (Results 1 - 12 of 12) sorted by null

  /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 41 entry->AddSuccessor(block);
90 entry->AddSuccessor(block);
103 block->AddSuccessor(then);
104 block->AddSuccessor(else_);
105 then->AddSuccessor(join);
106 else_->AddSuccessor(join);
146 entry->AddSuccessor(block);
159 block->AddSuccessor(loop_header);
160 loop_header->AddSuccessor(loop_body);
161 loop_header->AddSuccessor(exit)
    [all...]
bounds_check_elimination_test.cc 67 entry->AddSuccessor(block1);
121 block2->AddSuccessor(exit);
122 block4->AddSuccessor(exit);
123 block5->AddSuccessor(exit);
126 block1->AddSuccessor(block3); // True successor
127 block1->AddSuccessor(block2); // False successor
129 block3->AddSuccessor(block5); // True successor
130 block3->AddSuccessor(block4); // False successor
173 entry->AddSuccessor(block1);
200 block1->AddSuccessor(exit); // true successo
    [all...]
codegen_test.cc 535 entry->AddSuccessor(first_block);
549 first_block->AddSuccessor(then);
550 first_block->AddSuccessor(else_);
551 then->AddSuccessor(exit);
552 else_->AddSuccessor(exit);
658 entry_block->AddSuccessor(code_block);
659 code_block->AddSuccessor(exit_block);
710 entry_block->AddSuccessor(if_block);
711 if_block->AddSuccessor(if_true_block);
712 if_block->AddSuccessor(if_false_block)
    [all...]
register_allocator_test.cc 475 entry->AddSuccessor(block);
488 block->AddSuccessor(then);
489 block->AddSuccessor(else_);
490 then->AddSuccessor(join);
491 else_->AddSuccessor(join);
605 entry->AddSuccessor(block);
615 block->AddSuccessor(exit);
676 entry->AddSuccessor(block);
745 entry->AddSuccessor(block);
801 entry->AddSuccessor(block)
    [all...]
nodes_test.cc 43 entry->AddSuccessor(first_block);
50 first_block->AddSuccessor(exit_block);
graph_checker_test.cc 42 entry_block->AddSuccessor(exit_block);
builder.cc 204 current_block_->AddSuccessor(branch_target);
205 current_block_->AddSuccessor(fallthrough_target);
222 current_block_->AddSuccessor(branch_target);
223 current_block_->AddSuccessor(fallthrough_target);
349 current_block_->AddSuccessor(block);
363 entry_block_->AddSuccessor(block);
565 current_block_->AddSuccessor(exit_block_);
    [all...]
nodes.cc 229 pre_header->AddSuccessor(header);
    [all...]
nodes.h 566 void AddSuccessor(HBasicBlock* block) {
    [all...]
  /external/v8/test/cctest/compiler/
test-scheduler.cc 40 if (i > 0) schedule->AddSuccessor(loop->nodes[i - 1], loop->nodes[i]);
42 schedule->AddSuccessor(loop->nodes[count - 1], loop->nodes[0]);
158 schedule.AddSuccessor(schedule.start(), schedule.start());
169 schedule.AddSuccessor(schedule.start(), schedule.end());
170 schedule.AddSuccessor(schedule.end(), schedule.start());
182 schedule.AddSuccessor(schedule.start(), loop1->header());
193 schedule.AddSuccessor(schedule.start(), loop1->header());
194 schedule.AddSuccessor(loop1->last(), schedule.start());
210 schedule.AddSuccessor(A, B);
211 schedule.AddSuccessor(A, C)
    [all...]
  /external/v8/src/compiler/
schedule.h 232 AddSuccessor(block, succ);
241 AddSuccessor(block, tblock);
242 AddSuccessor(block, fblock);
255 if (block != end()) AddSuccessor(block, end());
267 if (block != end()) AddSuccessor(block, end());
273 void AddSuccessor(BasicBlock* block, BasicBlock* succ) {

Completed in 316 milliseconds