Home
last modified time | relevance | path

Searched refs:uses_ (Results 1 – 6 of 6) sorted by relevance

/art/compiler/optimizing/
Dssa_liveness_analysis.h304 uses_.push_front(*new_use); in AddTempUse()
340 if ((!uses_.empty()) &&
341 (uses_.front().GetUser() == actual_user) &&
342 (uses_.front().GetPosition() < position)) {
346 DCHECK(uses_.front().GetPosition() + 1 == position);
347 UsePositionList::iterator next_pos = uses_.begin();
352 } while (next_pos != uses_.end() && next_pos->GetPosition() < position);
354 uses_.insert_after(insert_pos, *new_use);
355 if (first_range_->GetEnd() == uses_.front().GetPosition()) {
367 DCHECK(uses_.empty() || position <= uses_.front().GetPosition());
[all …]
Dregister_allocator_test.cc822 first->uses_.push_front(*new (GetScopedAllocator()) UsePosition(user, 0u, 8)); in TEST_F()
823 first->uses_.push_front(*new (GetScopedAllocator()) UsePosition(user, 0u, 7)); in TEST_F()
824 first->uses_.push_front(*new (GetScopedAllocator()) UsePosition(user, 0u, 6)); in TEST_F()
845 third->uses_.push_front(*new (GetScopedAllocator()) UsePosition(user, 0u, 8)); in TEST_F()
846 third->uses_.push_front(*new (GetScopedAllocator()) UsePosition(user, 0u, 4)); in TEST_F()
847 third->uses_.push_front(*new (GetScopedAllocator()) UsePosition(user, 0u, 3)); in TEST_F()
Dnodes.cc1393 auto fixup_end = other->uses_.empty() ? other->uses_.begin() : ++other->uses_.begin(); in ReplaceWith()
1394 other->uses_.splice_after(other->uses_.before_begin(), uses_); in ReplaceWith()
1403 DCHECK(uses_.empty()); in ReplaceWith()
1495 replacement->uses_.empty() ? replacement->uses_.begin() : ++replacement->uses_.begin(); in ReplaceInput()
1496 replacement->uses_.splice_after(replacement->uses_.before_begin(), in ReplaceInput()
1497 input_use.GetInstruction()->uses_, in ReplaceInput()
Dnodes.h2412 auto fixup_end = uses_.empty() ? uses_.begin() : ++uses_.begin(); in AddUseAt()
2416 uses_.push_front(*new_node); in AddUseAt()
2433 input_use.GetInstruction()->uses_.erase_after(before_use_node); in RemoveAsUserOfInput()
2440 input_use.GetInstruction()->uses_.erase_after(before_use_node); in RemoveAsUserOfAllInputs()
2445 const HUseList<HInstruction*>& GetUses() const { return uses_; } in GetUses()
2448 bool HasUses() const { return !uses_.empty() || !env_uses_.empty(); } in HasUses()
2450 bool HasNonEnvironmentUses() const { return !uses_.empty(); } in HasNonEnvironmentUses()
2763 auto before_use_node = uses_.before_begin(); in FixUpUserRecordsAfterUseInsertion()
2764 for (auto use_node = uses_.begin(); use_node != fixup_end; ++use_node) { in FixUpUserRecordsAfterUseInsertion()
2774 if (next != uses_.end()) { in FixUpUserRecordsAfterUseRemoval()
[all …]
/art/tools/veridex/
Dflow_analysis.h193 return uses_; in GetUses()
201 std::vector<ReflectAccessInfo> uses_;
213 return uses_; in GetUses()
221 std::vector<ReflectAccessInfo> uses_;
Dflow_analysis.cc728 uses_.push_back(ReflectAccessInfo(cls, name, /* is_method= */ false)); in AnalyzeInvoke()
735 uses_.push_back(ReflectAccessInfo(cls, name, /* is_method= */ true)); in AnalyzeInvoke()
789 uses_.push_back(ReflectAccessInfo(cls, name, info.is_method)); in AnalyzeInvoke()