| /art/compiler/optimizing/ |
| graph_test.cc | 165 ASSERT_EQ(if_block->GetPredecessors().size(), 2u);
166 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor());
167 ASSERT_NE(if_block->GetPredecessors()[1], if_block);
170 ASSERT_EQ(if_block->GetPredecessors()[1],
200 ASSERT_EQ(if_block->GetPredecessors().size(), 2u);
201 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor());
202 ASSERT_NE(if_block->GetPredecessors()[1], if_block);
205 ASSERT_EQ(if_block->GetPredecessors()[1],
240 ASSERT_EQ(loop_block->GetPredecessors().size(), 2u);
278 ASSERT_EQ(loop_block->GetPredecessors().size(), 2u)
[all...] |
| graph_checker.cc | 42 return block->GetPredecessors().size() == 1u &&
54 sorted_predecessors.assign(block->GetPredecessors().begin(), block->GetPredecessors().end());
86 std::count(s->GetPredecessors().begin(), s->GetPredecessors().end(), block);
108 for (HBasicBlock* predecessor : block->GetPredecessors()) {
189 if (successor->GetPredecessors().size() > 1) {
214 for (HBasicBlock* predecessor : block->GetPredecessors()) {
589 size_t num_preds = loop_header->GetPredecessors().size();
596 HBasicBlock* first_predecessor = loop_header->GetPredecessors()[0]
[all...] |
| select_generator.cc | 27 if (block->GetPredecessors().size() != 1u) {
131 bool only_two_predecessors = (merge_block->GetPredecessors().size() == 2u);
|
| block_builder.cc | 226 for (HBasicBlock* predecessor : catch_block->GetPredecessors()) {
237 } else if (catch_block->GetPredecessors().empty()) {
327 for (HBasicBlock* predecessor : try_block->GetPredecessors()) {
|
| dead_code_elimination.cc | 228 HBasicBlock* predecessor_to_update = block->GetPredecessors()[i];
250 if (block->GetPredecessors().size() == 1) {
294 if (successor->IsExitBlock() || successor->GetPredecessors().size() != 1u) {
|
| linear_order.cc | 98 size_t number_of_forward_predecessors = block->GetPredecessors().size();
|
| pretty_printer.h | 76 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors();
|
| ssa_liveness_analysis.cc | 343 for (HBasicBlock* predecessor : block->GetPredecessors()) {
381 if (end == user->GetBlock()->GetPredecessors()[input_index]->GetLifetimeEnd()) {
388 user->GetBlock()->GetPredecessors()[i]->GetLifetimeEnd() - 1);
421 const ArenaVector<HBasicBlock*>& predecessors = defined_by_->GetBlock()->GetPredecessors();
|
| code_sinking.cc | 32 for (HBasicBlock* exit_predecessor : exit->GetPredecessors()) {
181 : block->GetPredecessors()[use.GetIndex()];
|
| nodes.cc | 255 successor->GetPredecessors().size() - successor->NumberOfBackEdges()) {
338 size_t number_of_incomings = header->GetPredecessors().size() - info->NumberOfBackEdges();
344 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) {
345 HBasicBlock* predecessor = header->GetPredecessors()[pred];
355 if (info->IsBackEdge(*header->GetPredecessors()[0])) {
356 HBasicBlock* to_swap = header->GetPredecessors()[0];
357 for (size_t pred = 1, e = header->GetPredecessors().size(); pred < e; ++pred) {
358 HBasicBlock* predecessor = header->GetPredecessors()[pred];
387 HBasicBlock* first_predecessor = block->GetPredecessors()[0];
421 } else if (successor->GetPredecessors().size() > 1)
[all...] |
| register_allocation_resolver.cc | 171 for (HBasicBlock* predecessor : block->GetPredecessors()) {
185 for (size_t i = 0, e = block->GetPredecessors().size(); i < e; ++i) {
186 HBasicBlock* predecessor = block->GetPredecessors()[i];
488 DCHECK_EQ(to->GetPredecessors().size(), 1u);
|
| bounds_check_elimination.cc | 697 DCHECK_EQ(true_successor->GetPredecessors().size(), 1u);
701 DCHECK_EQ(false_successor->GetPredecessors().size(), 1u);
[all...] |
| gvn.cc | 422 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors();
|
| loop_optimization.cc | 47 if (block->GetPredecessors().size() == 1 &&
465 if (block->GetPredecessors().size() == 1 &&
467 block->GetSingleSuccessor()->GetPredecessors().size() == 1) {
522 if (exit->GetPredecessors().size() != 1) {
[all...] |
| instruction_builder.cc | 129 } else if (current_block_->GetPredecessors().size() > 0) {
135 HInstruction* value = ValueOfLocalAt(current_block_->GetPredecessors()[0], local);
137 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) {
154 HInstruction* first_input = ValueOfLocalAt(current_block_->GetPredecessors()[0], local);
158 current_block_->GetPredecessors().size(),
160 for (size_t i = 0; i < current_block_->GetPredecessors().size(); i++) {
161 HInstruction* pred_value = ValueOfLocalAt(current_block_->GetPredecessors()[i], local);
245 for (HBasicBlock* predecessor : block->GetPredecessors()) {
[all...] |
| load_store_elimination.cc | 187 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors();
|
| register_allocator_graph_color.cc | [all...] |
| graph_visualizer.cc | 268 for (HBasicBlock* predecessor : block->GetPredecessors()) {
[all...] |
| nodes.h | 933 const ArenaVector<HBasicBlock*>& GetPredecessors() const {
[all...] |
| inliner.cc | [all...] |
