| /art/compiler/optimizing/ |
| D | graph_test.cc | 94 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfTrueSuccessor(), if_true); in TEST_F()
95 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfFalseSuccessor(), return_block); in TEST_F()
100 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfTrueSuccessor(), if_true); in TEST_F()
103 HBasicBlock* false_block = if_block->GetLastInstruction()->AsIf()->IfFalseSuccessor(); in TEST_F()
126 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfTrueSuccessor(), return_block); in TEST_F()
127 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfFalseSuccessor(), if_false); in TEST_F()
132 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfFalseSuccessor(), if_false); in TEST_F()
135 HBasicBlock* true_block = if_block->GetLastInstruction()->AsIf()->IfTrueSuccessor(); in TEST_F()
156 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfTrueSuccessor(), if_block); in TEST_F()
157 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfFalseSuccessor(), return_block); in TEST_F()
[all …]
|
| D | licm_test.cc | 131 loop_body_->InsertInstructionBefore(get_field, loop_body_->GetLastInstruction()); in TEST_F()
135 loop_body_->InsertInstructionBefore(set_field, loop_body_->GetLastInstruction()); in TEST_F()
158 loop_body_->InsertInstructionBefore(get_field, loop_body_->GetLastInstruction()); in TEST_F()
169 loop_body_->InsertInstructionBefore(set_field, loop_body_->GetLastInstruction()); in TEST_F()
184 loop_body_->InsertInstructionBefore(get_array, loop_body_->GetLastInstruction()); in TEST_F()
187 loop_body_->InsertInstructionBefore(set_array, loop_body_->GetLastInstruction()); in TEST_F()
202 loop_body_->InsertInstructionBefore(get_array, loop_body_->GetLastInstruction()); in TEST_F()
205 loop_body_->InsertInstructionBefore(set_array, loop_body_->GetLastInstruction()); in TEST_F()
|
| D | gvn_test.cc | 62 HInstruction* to_remove = block->GetLastInstruction(); in TEST_F()
72 HInstruction* different_offset = block->GetLastInstruction(); in TEST_F()
93 HInstruction* use_after_kill = block->GetLastInstruction(); in TEST_F()
134 block->AddInstruction(new (GetAllocator()) HIf(block->GetLastInstruction())); in TEST_F()
236 HInstruction* field_get_in_loop_header = loop_header->GetLastInstruction(); in TEST_F()
237 loop_header->AddInstruction(new (GetAllocator()) HIf(block->GetLastInstruction())); in TEST_F()
251 HInstruction* field_set = loop_body->GetLastInstruction(); in TEST_F()
261 HInstruction* field_get_in_loop_body = loop_body->GetLastInstruction(); in TEST_F()
273 HInstruction* field_get_in_exit = exit->GetLastInstruction(); in TEST_F()
397 outer_loop_body->GetLastInstruction()); in TEST_F()
[all …]
|
| D | cha_guard_optimization.cc | 156 instruction = dominator->GetLastInstruction(); in OptimizeWithDominatingGuard()
198 flag->MoveBefore(pre_header->GetLastInstruction()); in HoistGuard()
199 compare->MoveBefore(pre_header->GetLastInstruction()); in HoistGuard()
207 pre_header->InsertInstructionBefore(deoptimize, pre_header->GetLastInstruction()); in HoistGuard()
|
| D | live_ranges_test.cc | 77 ASSERT_TRUE(block->GetLastInstruction()->IsReturn()); in TEST_F()
78 ASSERT_EQ(8u, block->GetLastInstruction()->GetLifetimePosition()); in TEST_F()
121 ASSERT_TRUE(block->GetLastInstruction()->IsReturn()); in TEST_F()
122 ASSERT_EQ(22u, block->GetLastInstruction()->GetLifetimePosition()); in TEST_F()
|
| D | dead_code_elimination.cc | 45 HInstruction* last_instruction = block->GetLastInstruction(); in MarkReachableBlocks()
154 HIf* ifs = block->GetLastInstruction()->AsIf(); in RemoveNonNullControlDependences()
244 HInstruction* last = block->GetLastInstruction(); in SimplifyAlwaysThrows()
326 HInstruction* last = block->GetLastInstruction(); in SimplifyIfs()
432 while (block->GetLastInstruction()->IsGoto()) { in ConnectSuccessiveBlocks()
|
| D | code_generator_utils.cc | 137 cond->GetBlock()->GetLastInstruction()->InputAt(0) != cond) { in IsComparedValueNonNegativeInBlock()
143 HIf* if_instr = cond->GetBlock()->GetLastInstruction()->AsIf(); in IsComparedValueNonNegativeInBlock()
|
| D | instruction_builder.cc | 344 return block->GetFirstInstruction() != block->GetLastInstruction(); in IsBlockPopulated()
670 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction()); in Unop_12x()
679 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction()); in Conversion_12x()
689 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction()); in Binop_23x()
699 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction()); in Binop_23x_shift()
709 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction()); in Binop_23x_cmp()
719 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction()); in Binop_12x_shift()
729 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction()); in Binop_12x()
740 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction()); in Binop_22s()
751 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction()); in Binop_22b()
[all …]
|
| D | nodes.cc | 815 HInstruction* gota = entry_block_->GetLastInstruction(); in InsertConstant()
2096 insert_pos = target_block->GetLastInstruction(); in MoveBeforeFirstUserAndOutOfLoops()
2216 HTryBoundary* try_boundary = GetLastInstruction()->AsTryBoundary(); in ComputeTryEntryOfSuccessors()
2244 && block.GetFirstInstruction() == block.GetLastInstruction(); in HasOnlyOneInstruction()
2248 return HasOnlyOneInstruction(*this) && GetLastInstruction()->IsGoto(); in IsSingleGoto()
2252 return HasOnlyOneInstruction(*this) && GetLastInstruction()->IsReturn(); in IsSingleReturn()
2256 return (GetFirstInstruction() == GetLastInstruction()) && in IsSingleReturnOrReturnVoidAllowingPhis()
2257 (GetLastInstruction()->IsReturn() || GetLastInstruction()->IsReturnVoid()); in IsSingleReturnOrReturnVoidAllowingPhis()
2261 return HasOnlyOneInstruction(*this) && GetLastInstruction()->IsTryBoundary(); in IsSingleTryBoundary()
2265 return !GetInstructions().IsEmpty() && GetLastInstruction()->IsControlFlow(); in EndsWithControlFlowInstruction()
[all …]
|
| D | graph_checker_test.cc | 122 HInstruction* last_inst = exit_block->GetLastInstruction(); in TEST_F()
|
| D | code_sinking.cc | 37 HInstruction* last = exit_predecessor->GetLastInstruction(); in Run()
242 insert_pos = target_block->GetLastInstruction(); in FindIdealPosition()
|
| D | licm.cc | 159 instruction->MoveBefore(pre_header->GetLastInstruction()); in Run()
|
| D | induction_var_analysis_test.cc | 177 HInstruction* control = loop_header_[d]->GetLastInstruction(); in GetTripCount()
1217 HInstruction* ifs = loop_header_[0]->GetLastInstruction()->GetPrevious(); in TEST_F()
1243 HInstruction* ifs = loop_header_[0]->GetLastInstruction()->GetPrevious(); in TEST_F()
1269 HInstruction* ifs = loop_header_[0]->GetLastInstruction()->GetPrevious(); in TEST_F()
1295 HInstruction* ifs = loop_header_[0]->GetLastInstruction()->GetPrevious(); in TEST_F()
1320 HInstruction* ifs = loop_header_[0]->GetLastInstruction()->GetPrevious(); in TEST_F()
1345 HInstruction* ifs = loop_header_[0]->GetLastInstruction()->GetPrevious(); in TEST_F()
|
| D | select_generator.cc | 106 HIf* if_instruction = block->GetLastInstruction()->AsIf(); in Run()
|
| D | bounds_check_elimination.cc | 1668 if (loop->GetPreHeader()->GetLastInstruction()->IsTryBoundary()) { in DynamicBCESeemsProfitable()
1766 HInstruction* control = loop->GetHeader()->GetLastInstruction(); in CanHandleInfiniteLoop()
1811 block->InsertInstructionBefore(condition, block->GetLastInstruction()); in InsertDeoptInLoop()
1816 block->InsertInstructionBefore(deoptimize, block->GetLastInstruction()); in InsertDeoptInLoop()
1840 instruction->MoveBefore(block->GetLastInstruction()); in HoistToPreHeaderOrDeoptBlock()
1903 header->GetLastInstruction(), GetGraph(), if_block); in TransformLoopForDeoptimizationIfNeeded()
1905 if_block->RemoveInstruction(if_block->GetLastInstruction()); in TransformLoopForDeoptimizationIfNeeded()
|
| D | graph_checker.cc | 56 HTryBoundary* boundary = block->GetLastInstruction()->AsTryBoundary(); in IsExitTryBoundaryIntoExitBlock()
152 predecessor->GetSinglePredecessor()->GetLastInstruction() : in VisitBasicBlock()
153 predecessor->GetLastInstruction(); in VisitBasicBlock()
187 if (current->GetNext() == nullptr && current != block->GetLastInstruction()) { in VisitBasicBlock()
|
| D | codegen_test.cc | 458 block->InsertInstructionBefore(move, block->GetLastInstruction()); in TEST_F()
505 block->InsertInstructionBefore(move, block->GetLastInstruction()); in TEST_F()
574 block->InsertInstructionBefore(move, block->GetLastInstruction()); in TEST_F()
|
| D | scheduler.cc | 592 cursor_ = block->GetLastInstruction(); in Schedule()
659 DCHECK_NE(cursor, cursor->GetBlock()->GetLastInstruction()); in MoveAfterInBlock()
|
| D | reference_type_propagation.cc | 381 BoundTypeForClassCheck(block->GetLastInstruction()); in VisitBasicBlock()
385 HIf* ifInstruction = block->GetLastInstruction()->AsIf(); in BoundTypeForIfNotNull()
497 HIf* ifInstruction = block->GetLastInstruction()->AsIf(); in BoundTypeForIfInstanceOf()
|
| D | loop_analysis.cc | 45 HIf* hif = block->GetLastInstruction()->AsIf(); in CalculateLoopBasicProperties()
|
| D | induction_var_range_test.cc | 763 HInstruction* exit = exit_block_->GetLastInstruction(); in TEST_F()
815 HInstruction* exit = exit_block_->GetLastInstruction(); in TEST_F()
925 range_.Replace(loop_header_->GetLastInstruction(), x_, y_); in TEST_F()
1011 range_.Replace(loop_header_->GetLastInstruction(), x_, y_); in TEST_F()
|
| D | loop_optimization_test.cc | 268 new (GetAllocator()) HSuspendCheck(), header->GetLastInstruction()); in TEST_F()
|
| D | induction_var_analysis.cc | 120 HInstruction* control = guard->GetLastInstruction(); in IsGuardedBy()
893 HInstruction* control = loop->GetHeader()->GetLastInstruction(); in VisitControl()
1047 HInstruction* control = loop->GetHeader()->GetLastInstruction(); in VisitTripCount()
1138 HIf* ifs = loop->GetHeader()->GetLastInstruction()->AsIf(); in RewriteBreakLoop()
|
| D | load_store_elimination_test.cc | 191 block->InsertInstructionBefore(vload, block->GetLastInstruction()); in AddVecLoad()
210 block->InsertInstructionBefore(vdata, block->GetLastInstruction()); in AddVecStore()
221 block->InsertInstructionBefore(vstore, block->GetLastInstruction()); in AddVecStore()
233 block->InsertInstructionBefore(get, block->GetLastInstruction()); in AddArrayGet()
253 block->InsertInstructionBefore(store, block->GetLastInstruction()); in AddArraySet()
654 pre_header_->InsertInstructionBefore(array_b, pre_header_->GetLastInstruction()); in TEST_F()
692 pre_header_->InsertInstructionBefore(array_b, pre_header_->GetLastInstruction()); in TEST_F()
817 pre_header_->InsertInstructionBefore(array_a, pre_header_->GetLastInstruction()); in TEST_F()
820 ASSERT_TRUE(return_block_->GetLastInstruction()->IsReturnVoid()); in TEST_F()
822 return_block_->ReplaceAndRemoveInstructionWith(return_block_->GetLastInstruction(), ret); in TEST_F()
[all …]
|
| D | register_allocator_test.cc | 349 HReturn* ret = return_block->GetLastInstruction()->AsReturn(); in Loop3()
369 HXor* last_xor = graph->GetBlocks()[1]->GetLastInstruction()->GetPrevious()->AsXor(); in TEST_F()
|