Home
last modified time | relevance | path

Searched refs:GetNext (Results 1 – 25 of 31) sorted by relevance

12

/art/compiler/optimizing/
Dlive_ranges_test.cc76 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
120 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
166 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
177 range = range->GetNext(); in TEST_F()
181 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
189 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
241 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
249 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
257 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
265 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
[all …]
Dgvn.cc102 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Lookup()
118 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Contains()
175 for (Node* node = other.buckets_[i]; node != nullptr; node = node->GetNext()) { in PopulateFromInternal()
193 Node* GetNext() const { return next_; } in GetNext() function in art::ValueSet::Node
217 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in CloneBucket()
254 node = (previous == nullptr) ? buckets_[i] : previous->GetNext(); in DeleteAllImpureWhich()
258 node = node->GetNext(); in DeleteAllImpureWhich()
269 Node* next = node->GetNext(); in DeleteAllImpureWhich()
476 HInstruction* next = current->GetNext(); in VisitBasicBlock()
Dcha_guard_optimization.cc90 HInstruction* compare = flag->GetNext(); in RemoveGuard()
92 HInstruction* deopt = compare->GetNext(); in RemoveGuard()
186 HInstruction* compare = flag->GetNext(); in HoistGuard()
188 HInstruction* deopt = compare->GetNext(); in HoistGuard()
Dprepare_for_register_allocation.cc55 HInstruction* next = check->GetNext(); in VisitNullCheck()
60 next = next->GetNext(); in VisitNullCheck()
180 if (condition->GetNext() != user) { in CanEmitConditionAt()
298 for (HInstruction* between = input->GetNext(); between != user; between = between->GetNext()) { in CanMoveClinitCheck()
Dssa_builder.cc94 HInstruction* next = phi->GetNext(); in FixEnvironmentPhis()
98 next = next->GetNext(); in FixEnvironmentPhis()
101 DCHECK(!phi->IsVRegEquivalentOf(next->GetNext())); in FixEnvironmentPhis()
284 HInstruction* next = aget->GetNext(); in FindFloatOrDoubleEquivalentOfArrayGet()
589 HFloatConstant* result = constant->GetNext()->AsFloatConstant(); in GetFloatEquivalent()
593 constant->GetBlock()->InsertInstructionBefore(result, constant->GetNext()); in GetFloatEquivalent()
611 HDoubleConstant* result = constant->GetNext()->AsDoubleConstant(); in GetDoubleEquivalent()
615 constant->GetBlock()->InsertInstructionBefore(result, constant->GetNext()); in GetDoubleEquivalent()
636 HInstruction* next = phi->GetNext(); in GetFloatDoubleOrReferenceEquivalentOfPhi()
641 next = next->GetNext(); in GetFloatDoubleOrReferenceEquivalentOfPhi()
Dgraph_test.cc291 ASSERT_EQ(first_instruction->GetNext(), got); in TEST_F()
293 ASSERT_EQ(got->GetNext(), nullptr); in TEST_F()
304 ASSERT_EQ(first_instruction->GetNext(), second_instruction); in TEST_F()
306 ASSERT_EQ(second_instruction->GetNext(), got); in TEST_F()
308 ASSERT_EQ(got->GetNext(), nullptr); in TEST_F()
Dlive_interval_test.cc174 ++i, current = current->GetNext()) { in RangesEquals()
291 ASSERT_TRUE(range->GetNext() == nullptr); in TEST()
302 ASSERT_TRUE(range->GetNext() == nullptr); in TEST()
313 ASSERT_TRUE(range->GetNext() == nullptr); in TEST()
326 range = range->GetNext(); in TEST()
Dregister_allocation_resolver.cc244 safepoint_position = safepoint_position->GetNext()) { in UpdateSafepointLiveRegisters()
371 range = range->GetNext(); in ConnectSiblings()
386 safepoint_position = safepoint_position->GetNext()) { in ConnectSiblings()
581 at = at->GetNext(); in InsertParallelMoveAt()
597 move = at->GetNext()->AsParallelMove(); in InsertParallelMoveAt()
603 at->GetBlock()->InsertInstructionBefore(move, at->GetNext()); in InsertParallelMoveAt()
690 HParallelMove* move = instruction->GetNext()->AsParallelMove(); in InsertMoveAfter()
697 instruction->GetBlock()->InsertInstructionBefore(move, instruction->GetNext()); in InsertMoveAfter()
Dssa_liveness_analysis.h72 LiveRange* GetNext() const { return next_; } in GetNext() function
254 SafepointPosition* GetNext() const { in GetNext() function
433 after_loop = after_loop->GetNext(); in AddLoopRange()
526 my_range = my_range->GetNext(); in FirstIntersectionWith()
531 other_range = other_range->GetNext(); in FirstIntersectionWith()
632 safepoint = safepoint->GetNext()) { in HasWillCallSafepoint()
641 previous = safepoint, safepoint = safepoint->GetNext()) { in FindSafepointJustBefore()
672 new_interval->first_safepoint_ = new_last_safepoint->GetNext(); in SplitAt()
750 current = current->GetNext(); in Dump()
1027 range = range->GetNext()) { in FindRangeAtOrAfter()
Dscheduler.cc313 for (HInstruction* other = instruction->GetNext(); other != nullptr; other = other->GetNext()) { in AddDependencies()
352 for (HInstruction* other = instruction->GetNext(); other != nullptr; other = other->GetNext()) { in AddDependencies()
683 instruction->MoveBefore(cursor->GetNext(), /* do_checks= */ false); in MoveAfterInBlock()
Dssa_phi_elimination.cc101 next = current->GetNext(); in EliminateDeadPhis()
Ddead_code_elimination.cc247 first->GetNext() == last && in SimplifyAlwaysThrows()
337 (first->GetNext() == last) && in SimplifyIfs()
Dinduction_var_analysis_test.cc1221 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); in TEST_F()
1247 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); in TEST_F()
1273 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); in TEST_F()
1299 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); in TEST_F()
1324 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); in TEST_F()
1349 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); in TEST_F()
Dgraph_checker.cc169 if (current->GetNext() == nullptr && current != block->GetLastPhi()) { in VisitBasicBlock()
186 if (current->GetNext() == nullptr && current != block->GetLastInstruction()) { in VisitBasicBlock()
847 HInstruction* next_phi = phi->GetNext(); in VisitPhi()
893 HInstruction* next_phi = phi->GetNext(); in VisitPhi()
Dscheduler_arm64.cc191 (block->IsEntryBlock() && instruction->GetNext()->IsGoto())); in VisitSuspendCheck()
Dregister_allocator.cc93 current_range_ = current_range_->GetNext(); in Advance()
Dreference_type_propagation.cc276 ? start_instruction->GetNext() in BoundTypeIn()
756 HBoundType* bound_type = check_cast->GetNext()->AsBoundType(); in VisitCheckCast()
Dbounds_check_elimination.cc541 next_ = instruction->GetNext(); in VisitBasicBlock()
547 next_ = instruction->GetNext(); in VisitBasicBlock()
1899 next_ = next_->GetNext(); in ReplaceInstruction()
Dscheduler_arm.cc1047 (block->IsEntryBlock() && instruction->GetNext()->IsGoto())); in VisitSuspendCheck()
Dgraph_visualizer.cc70 for (T* current = first_entry; current != nullptr; current = current->GetNext()) { in StringList()
Dinstruction_simplifier.cc206 binop->GetBlock()->InsertInstructionBefore(neg, binop->GetNext()); in TryMoveNegOnInputsAfterBinop()
2338 invoke->GetBlock()->InsertInstructionBefore(condition, invoke->GetNext()); in SimplifyFP2Int()
2341 invoke->GetBlock()->InsertInstructionBefore(select, condition->GetNext()); in SimplifyFP2Int()
Dregister_allocator_linear_scan.cc411 current_range_ = current_range_->GetNext(); in Advance()
Dloop_optimization.cc2379 HInstruction* c = s->GetNext(); in TrySetSimpleLoopHeader()
2384 HInstruction* i = c->GetNext(); in TrySetSimpleLoopHeader()
/art/runtime/
Dsubtype_check_info_test.cc232 /*depth=*/0u).GetNext()); in TEST_F()
235 /*depth=*/1u).GetNext()); in TEST_F()
238 /*depth=*/2u).GetNext()); in TEST_F()
241 /*depth=*/2u).GetNext()); in TEST_F()
316 EXPECT_EQ(MakeBitStringChar(1u), sci.GetNext()); // Next>=1 to disambiguate from Uninitialized. in TEST_F()
321 EXPECT_EQ(MakeBitStringChar(1u), root.GetNext()); in TEST_F()
325 EXPECT_EQ(MakeBitStringChar(2u), root.GetNext()); // Next incremented for Assign. in TEST_F()
341 EXPECT_EQ(MakeBitStringChar(1u), root.GetNext()); in TEST_F()
345 EXPECT_EQ(MakeBitStringChar(2u), root.GetNext()); // Next incremented for Assign. in TEST_F()
351 EXPECT_EQ(MakeBitStringChar(1u), root.GetNext()); in TEST_F()
[all …]
Dsubtype_check_info.h201 io.SetNext(io.GetNext() + 1u); in CreateRoot()
246 BitStringChar next = GetNext(); in CreateChild()
283 DCHECK(!HasNext() || GetNext() != 0u) in GetState()
285 << GetNext() << " path: " << path_to_root; in GetState()
311 BitStringChar GetNext() const { in GetNext() function
345 did_overlap = (GetNext() != 0u); in SubtypeCheckInfo()
350 DCHECK_EQ(next, GetNext()); in SubtypeCheckInfo()
392 SetNextUnchecked(GetNext()+1u); in MaybeInitNext()

12