Searched refs:GetNext (Results 1 - 25 of 38) sorted by relevance

12

/art/compiler/optimizing/
H A Dlive_ranges_test.cc80 ASSERT_TRUE(range->GetNext() == nullptr);
126 ASSERT_TRUE(range->GetNext() == nullptr);
174 ASSERT_TRUE(range->GetNext() == nullptr);
185 range = range->GetNext();
189 ASSERT_TRUE(range->GetNext() == nullptr);
197 ASSERT_TRUE(range->GetNext() == nullptr);
251 ASSERT_TRUE(range->GetNext() == nullptr);
259 ASSERT_TRUE(range->GetNext() == nullptr);
267 ASSERT_TRUE(range->GetNext() == nullptr);
275 ASSERT_TRUE(range->GetNext()
[all...]
H A Dcha_guard_optimization.cc90 HInstruction* compare = flag->GetNext();
92 HInstruction* deopt = compare->GetNext();
186 HInstruction* compare = flag->GetNext();
188 HInstruction* deopt = compare->GetNext();
H A Dgvn.cc105 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {
121 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {
178 for (Node* node = other.buckets_[i]; node != nullptr; node = node->GetNext()) {
196 Node* GetNext() const { return next_; } function in class:art::ValueSet::Node
220 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {
257 node = (previous == nullptr) ? buckets_[i] : previous->GetNext();
261 node = node->GetNext();
272 Node* next = node->GetNext();
478 HInstruction* next = current->GetNext();
H A Dssa_builder.cc91 HInstruction* next = phi->GetNext();
95 next = next->GetNext();
98 DCHECK(!phi->IsVRegEquivalentOf(next->GetNext()));
281 HInstruction* next = aget->GetNext();
570 HFloatConstant* result = constant->GetNext()->AsFloatConstant();
574 constant->GetBlock()->InsertInstructionBefore(result, constant->GetNext());
592 HDoubleConstant* result = constant->GetNext()->AsDoubleConstant();
596 constant->GetBlock()->InsertInstructionBefore(result, constant->GetNext());
617 HInstruction* next = phi->GetNext();
622 next = next->GetNext();
[all...]
H A Dprepare_for_register_allocation.cc150 if (condition->GetNext() != user) {
268 for (HInstruction* between = input->GetNext(); between != user; between = between->GetNext()) {
H A Dgraph_test.cc291 ASSERT_EQ(first_instruction->GetNext(), got);
293 ASSERT_EQ(got->GetNext(), nullptr);
304 ASSERT_EQ(first_instruction->GetNext(), second_instruction);
306 ASSERT_EQ(second_instruction->GetNext(), got);
308 ASSERT_EQ(got->GetNext(), nullptr);
H A Dlive_interval_test.cc174 ++i, current = current->GetNext()) {
291 ASSERT_TRUE(range->GetNext() == nullptr);
302 ASSERT_TRUE(range->GetNext() == nullptr);
313 ASSERT_TRUE(range->GetNext() == nullptr);
326 range = range->GetNext();
H A Dregister_allocation_resolver.cc244 safepoint_position = safepoint_position->GetNext()) {
371 range = range->GetNext();
386 safepoint_position = safepoint_position->GetNext()) {
581 at = at->GetNext();
597 move = at->GetNext()->AsParallelMove();
603 at->GetBlock()->InsertInstructionBefore(move, at->GetNext());
690 HParallelMove* move = instruction->GetNext()->AsParallelMove();
697 instruction->GetBlock()->InsertInstructionBefore(move, instruction->GetNext());
H A Dscheduler.cc296 for (HInstruction* other = instruction->GetNext(); other != nullptr; other = other->GetNext()) {
334 for (HInstruction* other = instruction->GetNext(); other != nullptr; other = other->GetNext()) {
646 instruction->MoveBefore(cursor->GetNext(), /* do_checks */ false);
H A Dssa_liveness_analysis.h72 LiveRange* GetNext() const { return next_; } function in class:art::FINAL
241 SafepointPosition* GetNext() const { function in class:art::SafepointPosition
427 after_loop = after_loop->GetNext();
520 my_range = my_range->GetNext();
525 other_range = other_range->GetNext();
626 safepoint = safepoint->GetNext()) {
635 previous = safepoint, safepoint = safepoint->GetNext()) {
666 new_interval->first_safepoint_ = new_last_safepoint->GetNext();
744 current = current->GetNext();
1021 range = range->GetNext()) {
[all...]
H A Ddead_code_elimination.cc247 first->GetNext() == last &&
337 (first->GetNext() == last) &&
H A Dgraph_checker.cc140 if (current->GetNext() == nullptr && current != block->GetLastPhi()) {
157 if (current->GetNext() == nullptr && current != block->GetLastInstruction()) {
763 HInstruction* next_phi = phi->GetNext();
809 HInstruction* next_phi = phi->GetNext();
H A Dssa_phi_elimination.cc100 next = current->GetNext();
H A Dinduction_var_analysis_test.cc1221 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
1247 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
1273 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
1299 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
1324 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
1349 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
H A Dregister_allocator.cc93 current_range_ = current_range_->GetNext();
H A Dscheduler_arm64.cc191 (block->IsEntryBlock() && instruction->GetNext()->IsGoto()));
H A Dnodes.cc243 instruction = instruction->GetNext();
1125 HInstruction* next = GetNext();
1127 next = next->GetNext();
1880 new_block->instructions_.first_instruction_ = cursor->GetNext();
1964 return !GetPhis().IsEmpty() && GetFirstPhi()->GetNext() == nullptr;
2008 for (; current != nullptr; current = current->GetNext()) {
2017 current = current->GetNext()) {
2812 for (; current != other && current != nullptr; current = current->GetNext()) {
H A Dreference_type_propagation.cc257 ? start_instruction->GetNext()
724 HBoundType* bound_type = check_cast->GetNext()->AsBoundType();
H A Dbounds_check_elimination.cc541 next_ = instruction->GetNext();
547 next_ = instruction->GetNext();
1897 next_ = next_->GetNext();
H A Dinstruction_simplifier.cc199 binop->GetBlock()->InsertInstructionBefore(neg, binop->GetNext());
2313 invoke->GetBlock()->InsertInstructionBefore(condition, invoke->GetNext());
2316 invoke->GetBlock()->InsertInstructionBefore(select, condition->GetNext());
H A Dnodes.h1983 HInstruction* GetNext() const { return next_; } function in class:art::HInstruction
2508 next_ = Done() ? nullptr : instruction_->GetNext();
2515 next_ = Done() ? nullptr : instruction_->GetNext();
2537 instruction_ = instruction_->GetNext();
2768 if (GetNext() != nullptr && GetNext()->AsPhi()->GetRegNumber() == GetRegNumber()) {
2778 HInstruction* next = GetNext();
2783 next = next->GetNext();
H A Dgraph_visualizer.cc67 // must provide methods `GetNext` and `Dump`.
70 for (T* current = first_entry; current != nullptr; current = current->GetNext()) {
/art/runtime/
H A Dsubtype_check_info_test.cc232 /*depth*/0u).GetNext());
235 /*depth*/1u).GetNext());
238 /*depth*/2u).GetNext());
241 /*depth*/2u).GetNext());
316 EXPECT_EQ(MakeBitStringChar(1u), sci.GetNext()); // Next>=1 to disambiguate from Uninitialized.
321 EXPECT_EQ(MakeBitStringChar(1u), root.GetNext());
325 EXPECT_EQ(MakeBitStringChar(2u), root.GetNext()); // Next incremented for Assign.
341 EXPECT_EQ(MakeBitStringChar(1u), root.GetNext());
345 EXPECT_EQ(MakeBitStringChar(2u), root.GetNext()); // Next incremented for Assign.
351 EXPECT_EQ(MakeBitStringChar(1u), root.GetNext());
[all...]
H A Dsubtype_check_info.h201 io.SetNext(io.GetNext() + 1u);
246 BitStringChar next = GetNext();
283 DCHECK(!HasNext() || GetNext() != 0u)
285 << GetNext() << " path: " << path_to_root;
311 BitStringChar GetNext() const { function in struct:art::SubtypeCheckInfo
345 did_overlap = (GetNext() != 0u);
350 DCHECK_EQ(next, GetNext());
392 SetNextUnchecked(GetNext()+1u);
H A Dthread.cc315 FrameIdToShadowFrame* GetNext() const { return next_; } function in class:art::FrameIdToShadowFrame
340 for (FrameIdToShadowFrame* record = head; record != nullptr; record = record->GetNext()) {
398 tlsPtr_.frame_id_to_shadow_frame = head->GetNext();
403 for (FrameIdToShadowFrame* record = head->GetNext();
405 prev = record, record = record->GetNext()) {
407 prev->SetNext(record->GetNext());
3793 record = record->GetNext()) {

Completed in 4355 milliseconds

12