| /art/compiler/optimizing/ |
| pretty_printer.h | 83 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors();
134 PrintInt(current_block_->GetSuccessors()[0]->GetBlockId());
|
| nodes_x86.h | 105 return GetBlock()->GetSuccessors()[num_entries_];
|
| graph_test.cc | 102 ASSERT_EQ(false_block->GetSuccessors()[0], return_block);
137 ASSERT_EQ(true_block->GetSuccessors()[0], return_block);
244 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors().size(), 1u);
245 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors()[0],
282 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors().size(), 1u);
283 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors()[0],
|
| dead_code_elimination.cc | 38 ArrayRef<HBasicBlock* const> live_successors(block->GetSuccessors());
66 DCHECK_EQ(live_successors[0], block->GetSuccessors()[switch_index]);
|
| block_builder.cc | 214 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty())
333 for (size_t i = 0, e = try_block->GetSuccessors().size(); i < e; ++i) {
334 HBasicBlock* successor = try_block->GetSuccessors()[i];
|
| graph_checker.cc | 61 std::count(p->GetSuccessors().begin(), p->GetSuccessors().end(), block);
75 sorted_successors.assign(block->GetSuccessors().begin(), block->GetSuccessors().end());
182 if (block->GetSuccessors().size() > 1) {
561 if (loop_information->GetPreHeader()->GetSuccessors().size() != 1) {
566 loop_information->GetPreHeader()->GetSuccessors().size()));
[all...] |
| nodes.cc | 73 if (successors_visited[current_id] == current->GetSuccessors().size()) {
77 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++];
130 for (HBasicBlock* successor : block->GetSuccessors()) {
212 DCHECK(ContainsElement(block->GetSuccessors(), successor));
247 if (successors_visited[current_id] == current->GetSuccessors().size()) {
250 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++];
283 for (HBasicBlock* successor : block->GetSuccessors()) {
295 for (HBasicBlock* successor : block->GetSuccessors()) {
414 if (block->GetSuccessors().size() > 1) {
[all...] |
| ssa_liveness_analysis.cc | 94 for (HBasicBlock* successor : current->GetSuccessors()) {
220 for (HBasicBlock* successor : block->GetSuccessors()) {
351 for (HBasicBlock* successor : block.GetSuccessors()) {
|
| gvn.cc | 432 if (dominator->GetSuccessors().size() == 1) {
525 for (auto successor : block->GetSuccessors()) {
|
| codegen_test.cc | 674 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0];
722 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0];
790 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0];
[all...] |
| bounds_check_elimination.cc | [all...] |
| nodes.h | 836 const ArenaVector<HBasicBlock*>& GetSuccessors() const {
[all...] |
| code_generator.cc | 159 block = block->GetSuccessors()[0];
[all...] |
| instruction_builder.cc | 335 DCHECK_EQ(current_block_->GetSuccessors().size(), 1u);
[all...] |
| code_generator_arm64.cc | 564 const ArenaVector<HBasicBlock*>& successors = switch_instr_->GetBlock()->GetSuccessors();
[all...] |
| code_generator_arm.cc | [all...] |
| code_generator_x86.cc | [all...] |
| code_generator_x86_64.cc | [all...] |
| code_generator_mips64.cc | [all...] |
| code_generator_mips.cc | [all...] |
