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

12

/art/compiler/optimizing/
H A Dlive_ranges_test.cc79 ASSERT_TRUE(range->GetNext() == nullptr);
127 ASSERT_TRUE(range->GetNext() == nullptr);
177 ASSERT_TRUE(range->GetNext() == nullptr);
188 range = range->GetNext();
192 ASSERT_TRUE(range->GetNext() == nullptr);
200 ASSERT_TRUE(range->GetNext() == nullptr);
256 ASSERT_TRUE(range->GetNext() == nullptr);
264 ASSERT_TRUE(range->GetNext() == nullptr);
272 ASSERT_TRUE(range->GetNext() == nullptr);
280 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 Dssa_liveness_analysis.h68 LiveRange* GetNext() const { return next_; } function in class:art::FINAL
124 UsePosition* GetNext() const { return next_; } function in class:art::UsePosition
183 EnvUsePosition* GetNext() const { return next_; } function in class:art::EnvUsePosition
222 SafepointPosition* GetNext() const { function in class:art::SafepointPosition
316 while ((cursor->GetNext() != nullptr) && (cursor->GetNext()->GetPosition() < position)) {
317 cursor = cursor->GetNext();
321 instruction, input_index, position, cursor->GetNext());
401 after_loop = after_loop->GetNext();
494 my_range = my_range->GetNext();
[all...]
H A Dgvn.cc103 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {
119 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {
190 for (Node* node = other.buckets_[i]; node != nullptr; node = node->GetNext()) {
208 Node* GetNext() const { return next_; } function in class:art::ValueSet::Node
232 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {
269 node = (previous == nullptr) ? buckets_[i] : previous->GetNext();
273 node = node->GetNext();
284 Node* next = node->GetNext();
486 HInstruction* next = current->GetNext();
H A Dssa_builder.cc89 HInstruction* next = phi->GetNext();
93 next = next->GetNext();
96 DCHECK(!phi->IsVRegEquivalentOf(next->GetNext()));
275 HInstruction* next = aget->GetNext();
559 HFloatConstant* result = constant->GetNext()->AsFloatConstant();
563 constant->GetBlock()->InsertInstructionBefore(result, constant->GetNext());
581 HDoubleConstant* result = constant->GetNext()->AsDoubleConstant();
585 constant->GetBlock()->InsertInstructionBefore(result, constant->GetNext());
606 HInstruction* next = phi->GetNext();
611 next = next->GetNext();
[all...]
H A Dregister_allocation_resolver.cc241 safepoint_position = safepoint_position->GetNext()) {
326 use = use->GetNext();
346 use = use->GetNext();
351 env_use = env_use->GetNext();
359 env_use = env_use->GetNext();
362 range = range->GetNext();
377 safepoint_position = safepoint_position->GetNext()) {
402 use = use->GetNext();
577 at = at->GetNext();
593 move = at->GetNext()
[all...]
H A Dprepare_for_register_allocation.cc146 if (condition->GetNext() != user) {
224 for (HInstruction* between = input->GetNext(); between != user; between = between->GetNext()) {
H A Dgraph_test.cc303 ASSERT_EQ(first_instruction->GetNext(), got);
305 ASSERT_EQ(got->GetNext(), nullptr);
316 ASSERT_EQ(first_instruction->GetNext(), second_instruction);
318 ASSERT_EQ(second_instruction->GetNext(), got);
320 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 Dscheduler.cc106 for (HInstruction* other = instruction->GetNext(); other != nullptr; other = other->GetNext()) {
140 for (HInstruction* other = instruction->GetNext(); other != nullptr; other = other->GetNext()) {
449 instruction->MoveBefore(cursor->GetNext(), /* do_checks */ false);
H A Dscheduler_arm64.cc181 (block->IsEntryBlock() && instruction->GetNext()->IsGoto()));
H A Dinduction_var_analysis_test.cc1220 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
1246 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
1272 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
1298 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
1323 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
1348 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
H A Dgraph_checker.cc128 if (current->GetNext() == nullptr && current != block->GetLastPhi()) {
145 if (current->GetNext() == nullptr && current != block->GetLastInstruction()) {
745 HInstruction* next_phi = phi->GetNext();
791 HInstruction* next_phi = phi->GetNext();
H A Dregister_allocator.cc75 current_range_ = current_range_->GetNext();
H A Dssa_phi_elimination.cc92 next = current->GetNext();
H A Dregister_allocator_graph_color.cc184 use = use->GetNext();
192 use = use->GetNext();
994 use = use->GetNext();
1011 use = use->GetNext();
1204 range = range->GetNext();
1402 for (; use != nullptr && use->GetPosition() <= interval->GetStart(); use = use->GetNext()) {
1405 for (; use != nullptr && use->GetPosition() <= interval->GetEnd(); use = use->GetNext()) {
H A Ddead_code_elimination.cc197 (first->GetNext() == last) &&
H A Dloop_optimization.cc1308 phi->GetNext() == nullptr &&
1312 HInstruction* c = s->GetNext();
1317 HInstruction* i = c->GetNext();
H A Dnodes.cc205 instruction = instruction->GetNext();
941 HInstruction* next = GetNext();
943 next = next->GetNext();
1543 new_block->instructions_.first_instruction_ = cursor->GetNext();
1618 return !GetPhis().IsEmpty() && GetFirstPhi()->GetNext() == nullptr;
1662 for (; current != nullptr; current = current->GetNext()) {
1671 current = current->GetNext()) {
2466 for (; current != other && current != nullptr; current = current->GetNext()) {
H A Dreference_type_propagation.cc234 ? start_instruction->GetNext()
708 HBoundType* bound_type = check_cast->GetNext()->AsBoundType();
H A Dbounds_check_elimination.cc542 next_ = instruction->GetNext();
548 next_ = instruction->GetNext();
1810 next_ = next_->GetNext();
H A Dssa_liveness_analysis.cc411 use = use->GetNext();
H A Dinstruction_simplifier.cc190 binop->GetBlock()->InsertInstructionBefore(neg, binop->GetNext());
1945 invoke->GetBlock()->InsertInstructionBefore(condition, invoke->GetNext());
1948 invoke->GetBlock()->InsertInstructionBefore(select, condition->GetNext());
H A Dgraph_visualizer.cc62 // must provide methods `GetNext` and `Dump`.
65 for (T* current = first_entry; current != nullptr; current = current->GetNext()) {
/art/runtime/
H A Dthread.cc295 FrameIdToShadowFrame* GetNext() const { return next_; } function in class:art::FrameIdToShadowFrame
320 for (FrameIdToShadowFrame* record = head; record != nullptr; record = record->GetNext()) {
378 tlsPtr_.frame_id_to_shadow_frame = head->GetNext();
383 for (FrameIdToShadowFrame* record = head->GetNext();
385 prev = record, record = record->GetNext()) {
387 prev->SetNext(record->GetNext());
3408 record = record->GetNext()) {

Completed in 222 milliseconds

12