| /art/compiler/optimizing/ |
| side_effects_analysis.cc | 61 UpdateLoopEffects(block->GetLoopInformation(), effects);
62 HBasicBlock* pre_header = block->GetLoopInformation()->GetPreHeader();
67 UpdateLoopEffects(pre_header->GetLoopInformation(), GetLoopEffects(block));
71 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...] |
| licm.cc | 32 HLoopInformation* info = instruction->GetBlock()->GetLoopInformation();
34 HLoopInformation* input_loop = it.Current()->GetBlock()->GetLoopInformation();
48 HLoopInformation* input_loop = input->GetBlock()->GetLoopInformation();
100 HLoopInformation* loop_info = block->GetLoopInformation();
107 if (inner->GetLoopInformation() != loop_info) {
|
| suspend_check_test.cc | 38 ASSERT_EQ(loop_header->GetLoopInformation()->GetPreHeader(), first_block);
|
| induction_var_analysis_test.cc | 157 iva_->LookupInfo(loop_body_[d]->GetLoopInformation(), instruction));
163 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction1),
164 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction2));
213 ASSERT_EQ(entry_->GetLoopInformation(), nullptr);
215 ASSERT_EQ(loop_preheader_[d]->GetLoopInformation(),
217 : loop_header_[d - 1]->GetLoopInformation());
218 ASSERT_NE(loop_header_[d]->GetLoopInformation(), nullptr);
219 ASSERT_NE(loop_body_[d]->GetLoopInformation(), nullptr);
220 ASSERT_EQ(loop_header_[d]->GetLoopInformation(),
221 loop_body_[d]->GetLoopInformation());
[all...] |
| gvn.cc | 457 if (block->GetLoopInformation()->ContainsIrreducibleLoop()) {
466 DCHECK(!block->GetLoopInformation()->IsIrreducible());
467 DCHECK_EQ(block->GetDominator(), block->GetLoopInformation()->GetPreHeader());
|
| ssa_liveness_analysis.cc | 47 HLoopInformation* block_loop = block->GetLoopInformation();
51 HLoopInformation* current_loop = current->GetLoopInformation();
78 number_of_forward_predecessors -= block->GetLoopInformation()->NumberOfBackEdges();
315 size_t last_position = block->GetLoopInformation()->GetLifetimeEnd();
|
| induction_var_analysis.cc | 107 if (graph_block->IsLoopHeader() && !graph_block->GetLoopInformation()->IsIrreducible()) {
108 VisitLoop(graph_block->GetLoopInformation());
123 if (loop_block->GetLoopInformation() != loop) {
195 HLoopInformation* otherLoop = instruction->GetBlock()->GetLoopInformation();
590 } else if (if_true->GetLoopInformation() != loop && if_false->GetLoopInformation() == loop) {
592 } else if (if_true->GetLoopInformation() == loop && if_false->GetLoopInformation() != loop) {
[all...] |
| nodes.cc | 272 block->GetLoopInformation()->HasBackEdgeNotDominatedByHeader()) {
327 HLoopInformation* info = successor->GetLoopInformation();
336 HLoopInformation* info = header->GetLoopInformation();
393 DCHECK(!block->IsLoopHeader() || !block->GetLoopInformation()->IsBackEdge(*first_predecessor));
460 block->GetLoopInformation()->Populate();
588 DCHECK(block->GetLoopInformation()->IsPopulated());
589 if (block->GetLoopInformation()->IsIrreducible()) {
622 HLoopInformation* info = block->GetLoopInformation();
[all...] |
| ssa_liveness_analysis.h | 139 HLoopInformation* GetLoopInformation() const {
140 return user_->GetBlock()->GetLoopInformation();
[all...] |
| graph_test.cc | 246 loop_block->GetLoopInformation()->GetPreHeader());
284 loop_block->GetLoopInformation()->GetPreHeader());
|
| gvn_test.cc | 371 ASSERT_TRUE(inner_loop_header->GetLoopInformation()->IsIn(
372 *outer_loop_header->GetLoopInformation()));
|
| load_store_elimination.cc | 423 if (instruction->GetBlock()->GetLoopInformation() != nullptr) {
603 if (block->GetLoopInformation()->IsIrreducible()) {
612 HBasicBlock* pre_header = block->GetLoopInformation()->GetPreHeader();
808 HLoopInformation* loop_info = instruction->GetBlock()->GetLoopInformation();
[all...] |
| bounds_check_elimination.cc | [all...] |
| graph_checker.cc | 559 HLoopInformation* loop_information = loop_header->GetLoopInformation();
622 } else if (back_edge->GetLoopInformation() != loop_information) {
628 back_edge->GetLoopInformation()->GetHeader()->GetBlockId()));
[all...] |
| induction_var_range.cc | 131 HLoopInformation* loop = context->GetBlock()->GetLoopInformation(); // closest enveloping loop
588 v.instruction->GetBlock()->GetLoopInformation(); // closest enveloping loop
614 HLoopInformation* loop = context->GetBlock()->GetLoopInformation(); // closest enveloping loop
[all...] |
| code_generator.cc | 655 HSuspendCheck* suspend_check = it.Current()->GetLoopInformation()->GetSuspendCheck();
773 HLoopInformation* info = instruction->GetBlock()->GetLoopInformation();
[all...] |
| graph_visualizer.cc | 552 HLoopInformation* loop_info = instruction->GetBlock()->GetLoopInformation();
557 HLoopInformation* outer = loop_info->GetPreHeader()->GetLoopInformation();
|
| nodes.h | 864 HLoopInformation* loop_info = GetLoopInformation();
[all...] |
| instruction_builder.cc | 102 ValueOfLocalAt(current_block_->GetLoopInformation()->GetPreHeader(), local);
292 current_block_->GetLoopInformation()->SetSuspendCheck(suspend_check);
[all...] |
| register_allocator.cc | 182 (block->IsLoopHeader() && block->GetLoopInformation()->IsIrreducible())) {
[all...] |
| inliner.cc | [all...] |
| code_generator_mips64.cc | [all...] |
| code_generator_arm64.cc | [all...] |
| code_generator_mips.cc | [all...] |
