| /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 | 40 ASSERT_EQ(block->GetLoopInformation(), nullptr);
51 ASSERT_EQ(block->GetLoopInformation(), nullptr);
65 ASSERT_EQ(block->GetLoopInformation(), nullptr);
80 ASSERT_EQ(block->GetLoopInformation(), nullptr);
93 ASSERT_EQ(block->GetLoopInformation(), nullptr);
106 ASSERT_EQ(block->GetLoopInformation(), nullptr);
108 ASSERT_EQ(block->GetLoopInformation()->GetHeader()->GetBlockId(), parent_loop_header_id);
112 HLoopInformation* info = block->GetLoopInformation();
269 ASSERT_TRUE(graph->GetBlocks()[3]->GetLoopInformation()->IsIn(
270 *graph->GetBlocks()[2]->GetLoopInformation()));
[all...] |
| linear_order.cc | 42 HLoopInformation* block_loop = block->GetLoopInformation();
46 HLoopInformation* current_loop = current->GetLoopInformation();
63 HLoopInformation* loop = header->GetLoopInformation();
103 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) {
|
| superblock_cloner_test.cc | 170 HSuspendCheck* old_suspend_check = header->GetLoopInformation()->GetSuspendCheck();
184 HSuspendCheck* new_suspend_check = header->GetLoopInformation()->GetSuspendCheck();
206 HLoopInformation* loop_info = header->GetLoopInformation();
283 HLoopInformation* loop_info = header->GetLoopInformation();
300 EXPECT_EQ(header->GetLoopInformation(), loop_info);
|
| superblock_cloner.cc | 86 return block->GetLoopInformation();
278 HLoopInformation* info = block->GetLoopInformation();
297 HLoopInformation* info = block->GetLoopInformation();
308 HLoopInformation* info = block->GetLoopInformation();
332 block->GetLoopInformation()->Populate();
341 HLoopInformation* cur_loop = block->GetLoopInformation();
342 HLoopInformation* outer_loop = cur_loop->GetPreHeader()->GetLoopInformation();
422 HLoopInformation* loop_exit_loop_info = exit->GetLoopInformation();
|
| suspend_check_test.cc | 41 ASSERT_EQ(loop_header->GetLoopInformation()->GetPreHeader(), first_block);
|
| optimizing_unit_test.h | 77 if (block->GetLoopInformation() != nullptr) {
78 block->GetLoopInformation()->SetSuspendCheck(nullptr);
|
| gvn.cc | 449 if (block->GetLoopInformation()->ContainsIrreducibleLoop()) {
458 DCHECK(!block->GetLoopInformation()->IsIrreducible());
459 DCHECK_EQ(block->GetDominator(), block->GetLoopInformation()->GetPreHeader());
|
| induction_var_analysis_test.cc | 172 iva_->LookupInfo(loop_body_[d]->GetLoopInformation(), instruction));
185 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction1),
186 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction2));
192 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction));
242 ASSERT_EQ(entry_->GetLoopInformation(), nullptr);
244 ASSERT_EQ(loop_preheader_[d]->GetLoopInformation(),
246 : loop_header_[d - 1]->GetLoopInformation());
247 ASSERT_NE(loop_header_[d]->GetLoopInformation(), nullptr);
248 ASSERT_NE(loop_body_[d]->GetLoopInformation(), nullptr);
249 ASSERT_EQ(loop_header_[d]->GetLoopInformation(),
[all...] |
| nodes.cc | 311 block->GetLoopInformation()->HasBackEdgeNotDominatedByHeader()) {
363 HLoopInformation* info = successor->GetLoopInformation();
385 HLoopInformation* info = header->GetLoopInformation();
404 HLoopInformation* loop_info = header->GetLoopInformation();
444 HLoopInformation* loop_info = header->GetLoopInformation();
512 HLoopInformation* info = header->GetLoopInformation();
546 DCHECK(!block->IsLoopHeader() || !block->GetLoopInformation()->IsBackEdge(*first_predecessor));
613 block->GetLoopInformation()->Populate();
751 DCHECK(block->GetLoopInformation()->IsPopulated());
752 if (block->GetLoopInformation()->IsIrreducible())
[all...] |
| cha_guard_optimization.cc | 182 HLoopInformation* loop_info = block->GetLoopInformation();
|
| induction_var_analysis.cc | 170 if (user->GetBlock()->GetLoopInformation() != loop) {
184 if (user->GetHolder()->GetBlock()->GetLoopInformation() != loop) {
252 if (graph_block->IsLoopHeader() && !graph_block->GetLoopInformation()->IsIrreducible()) {
253 VisitLoop(graph_block->GetLoopInformation());
268 if (loop_block->GetLoopInformation() != loop) {
340 HLoopInformation* otherLoop = instruction->GetBlock()->GetLoopInformation();
[all...] |
| graph_test.cc | 239 loop_block->GetLoopInformation()->GetPreHeader());
274 loop_block->GetLoopInformation()->GetPreHeader());
|
| gvn_test.cc | 356 ASSERT_TRUE(inner_loop_header->GetLoopInformation()->IsIn(
357 *outer_loop_header->GetLoopInformation()));
|
| induction_var_range_test.cc | [all...] |
| induction_var_range.h | 159 HLoopInformation* lp = phi->GetBlock()->GetLoopInformation(); // closest enveloping loop
|
| ssa_liveness_analysis.h | 136 HLoopInformation* GetLoopInformation() const {
137 return user_->GetBlock()->GetLoopInformation();
[all...] |
| bounds_check_elimination.cc | [all...] |
| loop_optimization.cc | 473 AddLoop(block->GetLoopInformation());
[all...] |
| loop_optimization_test.cc | 301 HBasicBlock* new_preheader = header->GetLoopInformation()->GetPreHeader();
|
| scheduler_arm64.cc | 190 DCHECK((block->GetLoopInformation() != nullptr) ||
|
| graph_checker.cc | 577 HLoopInformation* loop_information = loop_header->GetLoopInformation();
640 } else if (back_edge->GetLoopInformation() != loop_information) {
646 back_edge->GetLoopInformation()->GetHeader()->GetBlockId()));
[all...] |
| load_store_elimination.cc | 341 HBasicBlock* pre_header = block->GetLoopInformation()->GetPreHeader();
347 if (block->GetLoopInformation()->IsIrreducible()) {
639 HLoopInformation* loop_info = instruction->GetBlock()->GetLoopInformation();
[all...] |
| induction_var_range.cc | 358 for (HLoopInformation* lp = instruction->GetBlock()->GetLoopInformation(); // closest enveloping loop
360 lp = lp->GetPreHeader()->GetLoopInformation()) {
472 HLoopInformation* lp = context->GetBlock()->GetLoopInformation(); // closest enveloping loop
504 return info->fetch->GetBlock()->GetLoopInformation() != nullptr;
[all...] |
