| /art/compiler/optimizing/ |
| side_effects_analysis.cc | 58 UpdateLoopEffects(block->GetLoopInformation(), effects);
59 HBasicBlock* pre_header = block->GetLoopInformation()->GetPreHeader();
64 UpdateLoopEffects(pre_header->GetLoopInformation(), GetLoopEffects(block));
68 UpdateLoopEffects(block->GetLoopInformation(), effects);
|
| find_loops_test.cc | 42 ASSERT_EQ(block->GetLoopInformation(), nullptr);
55 ASSERT_EQ(block->GetLoopInformation(), nullptr);
71 ASSERT_EQ(block->GetLoopInformation(), nullptr);
88 ASSERT_EQ(block->GetLoopInformation(), nullptr);
103 ASSERT_EQ(block->GetLoopInformation(), nullptr);
116 ASSERT_EQ(block->GetLoopInformation(), nullptr);
118 ASSERT_EQ(block->GetLoopInformation()->GetHeader()->GetBlockId(), parent_loop_header_id);
122 HLoopInformation* info = block->GetLoopInformation();
291 ASSERT_TRUE(graph->GetBlocks()[3]->GetLoopInformation()->IsIn(
292 *graph->GetBlocks()[2]->GetLoopInformation()));
[all...] |
| linear_order.cc | 38 HLoopInformation* block_loop = block->GetLoopInformation();
42 HLoopInformation* current_loop = current->GetLoopInformation();
59 HLoopInformation* loop = header->GetLoopInformation();
100 number_of_forward_predecessors -= block->GetLoopInformation()->NumberOfBackEdges();
|
| licm.cc | 33 HLoopInformation* info = instruction->GetBlock()->GetLoopInformation();
35 HLoopInformation* input_loop = input->GetBlock()->GetLoopInformation();
49 HLoopInformation* input_loop = input->GetBlock()->GetLoopInformation();
100 HLoopInformation* loop_info = block->GetLoopInformation();
107 if (inner->GetLoopInformation() != loop_info) {
|
| optimizing_unit_test.h | 67 if (block->GetLoopInformation() != nullptr) {
68 block->GetLoopInformation()->SetSuspendCheck(nullptr);
|
| suspend_check_test.cc | 38 ASSERT_EQ(loop_header->GetLoopInformation()->GetPreHeader(), first_block);
|
| induction_var_analysis_test.cc | 174 iva_->LookupInfo(loop_body_[d]->GetLoopInformation(), instruction));
187 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction1),
188 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction2));
194 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction));
246 ASSERT_EQ(entry_->GetLoopInformation(), nullptr);
248 ASSERT_EQ(loop_preheader_[d]->GetLoopInformation(),
250 : loop_header_[d - 1]->GetLoopInformation());
251 ASSERT_NE(loop_header_[d]->GetLoopInformation(), nullptr);
252 ASSERT_NE(loop_body_[d]->GetLoopInformation(), nullptr);
253 ASSERT_EQ(loop_header_[d]->GetLoopInformation(),
[all...] |
| gvn.cc | 457 if (block->GetLoopInformation()->ContainsIrreducibleLoop()) {
466 DCHECK(!block->GetLoopInformation()->IsIrreducible());
467 DCHECK_EQ(block->GetDominator(), block->GetLoopInformation()->GetPreHeader());
|
| cha_guard_optimization.cc | 182 HLoopInformation* loop_info = block->GetLoopInformation();
|
| nodes.cc | 271 block->GetLoopInformation()->HasBackEdgeNotDominatedByHeader()) {
323 HLoopInformation* info = successor->GetLoopInformation();
332 HLoopInformation* info = header->GetLoopInformation();
388 DCHECK(!block->IsLoopHeader() || !block->GetLoopInformation()->IsBackEdge(*first_predecessor));
454 block->GetLoopInformation()->Populate();
591 DCHECK(block->GetLoopInformation()->IsPopulated());
592 if (block->GetLoopInformation()->IsIrreducible()) {
625 HLoopInformation* info = block->GetLoopInformation();
[all...] |
| load_store_elimination.cc | 146 if (block->GetLoopInformation()->IsIrreducible()) {
155 HBasicBlock* pre_header = block->GetLoopInformation()->GetPreHeader();
389 HLoopInformation* loop_info = instruction->GetBlock()->GetLoopInformation();
|
| graph_test.cc | 245 loop_block->GetLoopInformation()->GetPreHeader());
283 loop_block->GetLoopInformation()->GetPreHeader());
|
| gvn_test.cc | 367 ASSERT_TRUE(inner_loop_header->GetLoopInformation()->IsIn(
368 *outer_loop_header->GetLoopInformation()));
|
| induction_var_analysis.cc | 116 if (graph_block->IsLoopHeader() && !graph_block->GetLoopInformation()->IsIrreducible()) {
117 VisitLoop(graph_block->GetLoopInformation());
132 if (loop_block->GetLoopInformation() != loop) {
204 HLoopInformation* otherLoop = instruction->GetBlock()->GetLoopInformation();
769 } else if (if_true->GetLoopInformation() != loop && if_false->GetLoopInformation() == loop) {
771 } else if (if_true->GetLoopInformation() == loop && if_false->GetLoopInformation() != loop) {
[all...] |
| induction_var_range_test.cc | [all...] |
| ssa_liveness_analysis.h | 134 HLoopInformation* GetLoopInformation() const {
135 return user_->GetBlock()->GetLoopInformation();
[all...] |
| bounds_check_elimination.cc | [all...] |
| loop_optimization.cc | 328 AddLoop(block->GetLoopInformation());
736 HLoopInformation* vloop = vector_header_->GetLoopInformation();
761 header->SetLoopInformation(preheader->GetLoopInformation()); // outward
[all...] |
| scheduler_arm64.cc | 188 DCHECK((block->GetLoopInformation() != nullptr) ||
|
| graph_checker.cc | 565 HLoopInformation* loop_information = loop_header->GetLoopInformation();
628 } else if (back_edge->GetLoopInformation() != loop_information) {
634 back_edge->GetLoopInformation()->GetHeader()->GetBlockId()));
[all...] |
| induction_var_range.cc | 354 for (HLoopInformation* lp = instruction->GetBlock()->GetLoopInformation(); // closest enveloping loop
356 lp = lp->GetPreHeader()->GetLoopInformation()) {
467 HLoopInformation* lp = context->GetBlock()->GetLoopInformation(); // closest enveloping loop
499 return info->fetch->GetBlock()->GetLoopInformation() != nullptr;
[all...] |
| load_store_analysis.h | 421 HLoopInformation* loop_info = instruction->GetBlock()->GetLoopInformation();
|
| graph_visualizer.cc | 626 HLoopInformation* loop_info = instruction->GetBlock()->GetLoopInformation();
631 HLoopInformation* outer = loop_info->GetPreHeader()->GetLoopInformation();
[all...] |
| code_generator.cc | 722 HSuspendCheck* suspend_check = block->GetLoopInformation()->GetSuspendCheck();
[all...] |
| register_allocator_graph_color.cc | 66 HLoopInformation* loop_info = block->GetLoopInformation();
70 loop_info = loop_info->GetPreHeader()->GetLoopInformation();
[all...] |
