Home
last modified time | relevance | path

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

12

/art/compiler/optimizing/
Dlive_ranges_test.cc80 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
124 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
170 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
181 range = range->GetNext(); in TEST_F()
185 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
193 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
245 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
253 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
261 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
269 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
232 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in CloneBucket()
269 node = (previous == nullptr) ? buckets_[i] : previous->GetNext(); in DeleteAllImpureWhich()
273 node = node->GetNext(); in DeleteAllImpureWhich()
284 Node* next = node->GetNext(); in DeleteAllImpureWhich()
491 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()
179 if (condition->GetNext() != user) { in CanEmitConditionAt()
300 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()
607 HFloatConstant* result = constant->GetNext()->AsFloatConstant(); in GetFloatEquivalent()
611 constant->GetBlock()->InsertInstructionBefore(result, constant->GetNext()); in GetFloatEquivalent()
629 HDoubleConstant* result = constant->GetNext()->AsDoubleConstant(); in GetDoubleEquivalent()
633 constant->GetBlock()->InsertInstructionBefore(result, constant->GetNext()); in GetDoubleEquivalent()
654 HInstruction* next = phi->GetNext(); in GetFloatDoubleOrReferenceEquivalentOfPhi()
659 next = next->GetNext(); in GetFloatDoubleOrReferenceEquivalentOfPhi()
Dgraph_test.cc292 ASSERT_EQ(first_instruction->GetNext(), got); in TEST_F()
294 ASSERT_EQ(got->GetNext(), nullptr); in TEST_F()
305 ASSERT_EQ(first_instruction->GetNext(), second_instruction); in TEST_F()
307 ASSERT_EQ(second_instruction->GetNext(), got); in TEST_F()
309 ASSERT_EQ(got->GetNext(), nullptr); in TEST_F()
Dlive_interval_test.cc175 ++i, current = current->GetNext()) { in RangesEquals()
292 ASSERT_TRUE(range->GetNext() == nullptr); in TEST()
303 ASSERT_TRUE(range->GetNext() == nullptr); in TEST()
314 ASSERT_TRUE(range->GetNext() == nullptr); in TEST()
327 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()
580 at = at->GetNext(); in InsertParallelMoveAt()
596 move = at->GetNext()->AsParallelMove(); in InsertParallelMoveAt()
602 at->GetBlock()->InsertInstructionBefore(move, at->GetNext()); in InsertParallelMoveAt()
689 HParallelMove* move = instruction->GetNext()->AsParallelMove(); in InsertMoveAfter()
696 instruction->GetBlock()->InsertInstructionBefore(move, instruction->GetNext()); in InsertMoveAfter()
Dssa_liveness_analysis.h73 LiveRange* GetNext() const { return next_; } in GetNext() function
255 SafepointPosition* GetNext() const { in GetNext() function
434 after_loop = after_loop->GetNext(); in AddLoopRange()
527 my_range = my_range->GetNext(); in FirstIntersectionWith()
532 other_range = other_range->GetNext(); in FirstIntersectionWith()
633 safepoint = safepoint->GetNext()) { in HasWillCallSafepoint()
642 previous = safepoint, safepoint = safepoint->GetNext()) { in FindSafepointJustBefore()
673 new_interval->first_safepoint_ = new_last_safepoint->GetNext(); in SplitAt()
751 current = current->GetNext(); in Dump()
1028 range = range->GetNext()) { in FindRangeAtOrAfter()
Dscheduler.cc323 for (HInstruction* other = instruction->GetNext(); other != nullptr; other = other->GetNext()) { in AddDependencies()
362 for (HInstruction* other = instruction->GetNext(); other != nullptr; other = other->GetNext()) { in AddDependencies()
662 instruction->MoveBefore(cursor->GetNext(), /* do_checks= */ false); in MoveAfterInBlock()
Dinduction_var_analysis_test.cc1222 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); in TEST_F()
1248 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); in TEST_F()
1274 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); in TEST_F()
1300 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); in TEST_F()
1325 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); in TEST_F()
1350 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); in TEST_F()
Dssa_phi_elimination.cc101 next = current->GetNext(); in EliminateDeadPhis()
Dgraph_checker.cc270 if (current->GetNext() == nullptr && current != block->GetLastPhi()) { in VisitBasicBlock()
287 if (current->GetNext() == nullptr && current != block->GetLastInstruction()) { in VisitBasicBlock()
486 } else if (load->GetBlock()->GetFirstInstruction()->GetNext() != load) { in VisitLoadException()
1015 HInstruction* next_phi = phi->GetNext(); in VisitPhi()
1061 HInstruction* next_phi = phi->GetNext(); in VisitPhi()
Dregister_allocator.cc82 current_range_ = current_range_->GetNext(); in Advance()
Dscheduler_arm64.cc191 block->IsEntryBlock() && instruction->GetNext()->IsGoto()); in VisitSuspendCheck()
Ddead_code_elimination.cc295 HBasicBlock* new_block = block->SplitBefore(throwing_invoke->GetNext(), in SimplifyAlwaysThrows()
366 (first->GetNext() == last) && in SimplifyIfs()
Dnodes.cc280 instruction = instruction->GetNext(); in GetFirstInstructionDisregardMoves()
1408 HInstruction* next = GetNext(); in GetNextDisregardingMoves()
1410 next = next->GetNext(); in GetNextDisregardingMoves()
2245 new_block->instructions_.first_instruction_ = cursor->GetNext(); in SplitAfterForInlining()
2334 return !GetPhis().IsEmpty() && GetFirstPhi()->GetNext() == nullptr; in HasSinglePhi()
2378 for (; current != nullptr; current = current->GetNext()) { in CountSize()
2387 current = current->GetNext()) { in SetBlockOfInstructions()
3276 for (; current != other && current != nullptr; current = current->GetNext()) { in HasAnyEnvironmentUseBefore()
Dreference_type_propagation.cc217 ? start_instruction->GetNext() in BoundTypeIn()
707 HBoundType* bound_type = check_cast->GetNext()->AsBoundType(); in VisitCheckCast()
Dbounds_check_elimination.cc541 next_ = instruction->GetNext(); in VisitBasicBlock()
547 next_ = instruction->GetNext(); in VisitBasicBlock()
2024 next_ = next_->GetNext(); in ReplaceInstruction()
Dscheduler_arm.cc1054 block->IsEntryBlock() && instruction->GetNext()->IsGoto()); in VisitSuspendCheck()
Dinstruction_simplifier.cc219 binop->GetBlock()->InsertInstructionBefore(neg, binop->GetNext()); in TryMoveNegOnInputsAfterBinop()
2506 invoke->GetBlock()->InsertInstructionBefore(condition, invoke->GetNext()); in SimplifyFP2Int()
2509 invoke->GetBlock()->InsertInstructionBefore(select, condition->GetNext()); in SimplifyFP2Int()
Dgraph_visualizer.cc79 for (T* current = first_entry; current != nullptr; current = current->GetNext()) { in StringList()
/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_IMPLIES(HasNext(), GetNext() != 0u) in GetState()
284 << "Expected (Assigned|Initialized) state to have >0 Next value: " << GetNext() 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()
Dthread.cc477 FrameIdToShadowFrame* GetNext() const { return next_; } in GetNext() function in art::FrameIdToShadowFrame
502 for (FrameIdToShadowFrame* record = head; record != nullptr; record = record->GetNext()) { in FindFrameIdToShadowFrame()
576 tlsPtr_.frame_id_to_shadow_frame = head->GetNext(); in RemoveDebuggerShadowFrameMapping()
581 for (FrameIdToShadowFrame* record = head->GetNext(); in RemoveDebuggerShadowFrameMapping()
583 prev = record, record = record->GetNext()) { in RemoveDebuggerShadowFrameMapping()
585 prev->SetNext(record->GetNext()); in RemoveDebuggerShadowFrameMapping()
4440 record = record->GetNext()) { in VisitRoots()

12