/art/compiler/optimizing/ |
H A D | code_generator.cc | 860 HInstruction* next_phi = current_phi->GetNext();
|
H A D | code_generator_arm.cc | 4815 if (block->IsEntryBlock() && instruction->GetNext()->IsGoto()) {
|
H A D | code_generator_arm64.cc | 3033 if (cond->IsCondition() && cond->GetNext() == select) { 4625 if (block->IsEntryBlock() && instruction->GetNext()->IsGoto()) {
|
H A D | code_generator_mips.cc | 4683 if (block->IsEntryBlock() && instruction->GetNext()->IsGoto()) {
|
H A D | code_generator_mips64.cc | 3814 if (block->IsEntryBlock() && instruction->GetNext()->IsGoto()) {
|
H A D | code_generator_x86.cc | 1359 cond->GetNext() == branch && 5579 if (block->IsEntryBlock() && instruction->GetNext()->IsGoto()) {
|
H A D | code_generator_x86_64.cc | 1403 cond->GetNext() == branch && 5074 if (block->IsEntryBlock() && instruction->GetNext()->IsGoto()) {
|
H A D | graph_checker.cc | 126 if (current->GetNext() == nullptr && current != block->GetLastPhi()) { 143 if (current->GetNext() == nullptr && current != block->GetLastInstruction()) { 738 HInstruction* next_phi = phi->GetNext(); 784 HInstruction* next_phi = phi->GetNext();
|
H A D | graph_test.cc | 304 ASSERT_EQ(first_instruction->GetNext(), got); 306 ASSERT_EQ(got->GetNext(), nullptr); 317 ASSERT_EQ(first_instruction->GetNext(), second_instruction); 319 ASSERT_EQ(second_instruction->GetNext(), got); 321 ASSERT_EQ(got->GetNext(), nullptr);
|
H A D | graph_visualizer.cc | 62 // must provide methods `GetNext` and `Dump`. 65 for (T* current = first_entry; current != nullptr; current = current->GetNext()) {
|
H A D | gvn.cc | 103 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 D | induction_var_analysis_test.cc | 623 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); 642 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); 660 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); 680 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); 698 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext()); 716 loop_body_[0]->InsertInstructionBefore(conv, increment_[0]->GetNext());
|
H A D | inliner.cc | 83 HInstruction* next = instruction->GetNext();
|
H A D | instruction_simplifier.cc | 176 binop->GetBlock()->InsertInstructionBefore(neg, binop->GetNext()); 1669 invoke->GetBlock()->InsertInstructionBefore(condition, invoke->GetNext()); 1672 invoke->GetBlock()->InsertInstructionBefore(select, condition->GetNext());
|
H A D | live_interval_test.cc | 174 ++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 D | live_ranges_test.cc | 79 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 D | nodes.cc | 206 instruction = instruction->GetNext(); 947 HInstruction* next = GetNext(); 949 next = next->GetNext(); 1514 new_block->instructions_.first_instruction_ = cursor->GetNext(); 1589 return !GetPhis().IsEmpty() && GetFirstPhi()->GetNext() == nullptr; 1633 for (; current != nullptr; current = current->GetNext()) { 1642 current = current->GetNext()) { 2325 for (; current != other && current != nullptr; current = current->GetNext()) {
|
H A D | nodes.h | 1785 HInstruction* GetNext() const { return next_; } function in class:art::HInstruction 2196 next_ = Done() ? nullptr : instruction_->GetNext(); 2203 next_ = Done() ? nullptr : instruction_->GetNext(); 2406 HInstruction* next = GetNext(); 2411 next = next->GetNext();
|
H A D | prepare_for_register_allocation.cc | 150 if (condition->GetNext() != user) { 230 for (HInstruction* between = input->GetNext(); between != user; between = between->GetNext()) {
|
H A D | reference_type_propagation.cc | 643 HBoundType* bound_type = check_cast->GetNext()->AsBoundType();
|
H A D | register_allocator.cc | 429 current_range_ = current_range_->GetNext(); 1479 at = at->GetNext(); 1495 move = at->GetNext()->AsParallelMove(); 1501 at->GetBlock()->InsertInstructionBefore(move, at->GetNext()); 1588 HParallelMove* move = instruction->GetNext()->AsParallelMove(); 1595 instruction->GetBlock()->InsertInstructionBefore(move, instruction->GetNext()); 1628 use = use->GetNext(); 1649 use = use->GetNext(); 1654 env_use = env_use->GetNext(); 1662 env_use = env_use->GetNext(); [all...] |
H A D | ssa_builder.cc | 88 HInstruction* next = phi->GetNext(); 92 next = next->GetNext(); 95 DCHECK(!phi->IsVRegEquivalentOf(next->GetNext())); 282 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 D | ssa_liveness_analysis.cc | 464 use = use->GetNext();
|
H A D | ssa_liveness_analysis.h | 67 LiveRange* GetNext() const { return next_; } function in class:art::FINAL 124 UsePosition* GetNext() const { return next_; } function in class:art::UsePosition 182 SafepointPosition* GetNext() const { function in class:art::SafepointPosition 282 while ((cursor->GetNext() != nullptr) && (cursor->GetNext()->GetPosition() < position)) { 283 cursor = cursor->GetNext(); 287 instruction, nullptr /* environment */, input_index, position, cursor->GetNext()); 367 after_loop = after_loop->GetNext(); 460 my_range = my_range->GetNext(); 465 other_range = other_range->GetNext(); [all...] |
H A D | ssa_phi_elimination.cc | 94 next = current->GetNext();
|