Home
last modified time | relevance | path

Searched refs:loops_ (Results 1 – 12 of 12) sorted by relevance

/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Dloop_descriptor.cpp497 : loops_(), dummy_top_loop_(nullptr) { in LoopDescriptor()
544 loops_.push_back(current_loop); in PopulateList()
548 for (auto itr = loops_.rbegin() + 1; itr != loops_.rend(); ++itr) { in PopulateList()
577 for (Loop* loop : loops_) { in PopulateList()
929 for (Loop* loop : loops_) { in PostModificationCleanup()
939 loops_.erase(std::find(loops_.begin(), loops_.end(), loop)); in PostModificationCleanup()
956 loops_.emplace_back(loop.release()); in PostModificationCleanup()
963 for (Loop* loop : loops_) { in ClearLoops()
966 loops_.clear(); in ClearLoops()
977 loops_.push_back(&current_loop); in AddLoopNest()
[all …]
Dloop_descriptor.h436 loops_ = std::move(other.loops_); in LoopDescriptor()
437 other.loops_.clear(); in LoopDescriptor()
447 inline size_t NumLoops() const { return loops_.size(); } in NumLoops()
452 assert(loops_.size() > index && in GetLoopByIndex()
454 return *loops_[index]; in GetLoopByIndex()
559 LoopContainerType loops_; variable
Dloop_dependence_helpers.cpp235 for (size_t loop_index = 0; loop_index < loops_.size(); ++loop_index) { in GetDistanceEntryForLoop()
236 if (loop == loops_[loop_index]) { in GetDistanceEntryForLoop()
446 for (size_t i = 0; i < loops_.size(); ++i) { in MarkUnsusedDistanceEntriesAsIrrelevant()
447 if (used_loops.find(loops_[i]) == used_loops.end()) { in MarkUnsusedDistanceEntriesAsIrrelevant()
Dloop_dependence.cpp1130 for (auto loop : loops_) { in PartitionSubscripts()
1467 std::vector<Constraint*> constraints(loops_.size()); in DeltaTest()
1469 std::vector<bool> loop_appeared(loops_.size()); in DeltaTest()
1491 siv_subscripts.size(), DistanceVector(loops_.size())); in DeltaTest()
1512 std::distance(std::begin(loops_), in DeltaTest()
1513 std::find(std::begin(loops_), std::end(loops_), loop)); in DeltaTest()
1571 auto loop = loops_[loop_id]; in DeltaTest()
1627 for (size_t i = 0; i < loops_.size(); ++i) { in DeltaTest()
Dloop_dependence.h299 loops_(loops), in LoopDependenceAnalysis()
452 std::vector<const Loop*> loops_; variable
/external/deqp-deps/SPIRV-Tools/source/opt/
Dloop_descriptor.cpp497 : loops_(), dummy_top_loop_(nullptr) { in LoopDescriptor()
544 loops_.push_back(current_loop); in PopulateList()
548 for (auto itr = loops_.rbegin() + 1; itr != loops_.rend(); ++itr) { in PopulateList()
577 for (Loop* loop : loops_) { in PopulateList()
929 for (Loop* loop : loops_) { in PostModificationCleanup()
939 loops_.erase(std::find(loops_.begin(), loops_.end(), loop)); in PostModificationCleanup()
955 loops_.emplace_back(loop); in PostModificationCleanup()
962 for (Loop* loop : loops_) { in ClearLoops()
965 loops_.clear(); in ClearLoops()
976 loops_.push_back(&current_loop); in AddLoopNest()
[all …]
Dloop_descriptor.h436 loops_ = std::move(other.loops_); in LoopDescriptor()
437 other.loops_.clear(); in LoopDescriptor()
447 inline size_t NumLoops() const { return loops_.size(); } in NumLoops()
452 assert(loops_.size() > index && in GetLoopByIndex()
454 return *loops_[index]; in GetLoopByIndex()
557 LoopContainerType loops_; variable
Dloop_dependence_helpers.cpp235 for (size_t loop_index = 0; loop_index < loops_.size(); ++loop_index) { in GetDistanceEntryForLoop()
236 if (loop == loops_[loop_index]) { in GetDistanceEntryForLoop()
446 for (size_t i = 0; i < loops_.size(); ++i) { in MarkUnsusedDistanceEntriesAsIrrelevant()
447 if (used_loops.find(loops_[i]) == used_loops.end()) { in MarkUnsusedDistanceEntriesAsIrrelevant()
Dloop_dependence.cpp1130 for (auto loop : loops_) { in PartitionSubscripts()
1467 std::vector<Constraint*> constraints(loops_.size()); in DeltaTest()
1469 std::vector<bool> loop_appeared(loops_.size()); in DeltaTest()
1491 siv_subscripts.size(), DistanceVector(loops_.size())); in DeltaTest()
1512 std::distance(std::begin(loops_), in DeltaTest()
1513 std::find(std::begin(loops_), std::end(loops_), loop)); in DeltaTest()
1571 auto loop = loops_[loop_id]; in DeltaTest()
1627 for (size_t i = 0; i < loops_.size(); ++i) { in DeltaTest()
Dloop_dependence.h299 loops_(loops), in LoopDependenceAnalysis()
452 std::vector<const Loop*> loops_; variable
/external/v8/src/compiler/
Dscheduler.cc645 loops_(zone), in SpecialRPONumberer()
688 LoopInfo const& loop = loops_[GetLoopNumber(block)]; in GetOutgoingBlocks()
779 int num_loops = static_cast<int>(loops_.size()); in ComputeAndInsertSpecialRPO()
811 if (num_loops > static_cast<int>(loops_.size())) { in ComputeAndInsertSpecialRPO()
818 HasLoopNumber(entry) ? &loops_[GetLoopNumber(entry)] : nullptr; in ComputeAndInsertSpecialRPO()
852 LoopInfo* info = &loops_[GetLoopNumber(block)]; in ComputeAndInsertSpecialRPO()
876 LoopInfo* next = &loops_[GetLoopNumber(succ)]; in ComputeAndInsertSpecialRPO()
886 LoopInfo* info = &loops_[GetLoopNumber(block)]; in ComputeAndInsertSpecialRPO()
934 current_loop = &loops_[GetLoopNumber(current)]; in ComputeAndInsertSpecialRPO()
959 for (LoopInfo& loop : loops_) { in ComputeLoopInfo()
[all …]
Dloop-analysis.cc60 loops_(zone),
96 for (TempLoopInfo& li : loops_) { in Print()
112 ZoneVector<TempLoopInfo> loops_; member in v8::internal::compiler::LoopFinderImpl
238 loops_.push_back({node, nullptr, nullptr, nullptr, nullptr}); in CreateLoopInfo()
298 for (TempLoopInfo& li : loops_) { in PropagateForward()
370 DCHECK(loops_found_ == static_cast<int>(loops_.size())); in FinishLoopTree()
395 TempLoopInfo* loop = &loops_[loop_num - 1]; in FinishLoopTree()
423 TempLoopInfo* li = &loops_[0]; in FinishSingleLoop()
446 TempLoopInfo& li = loops_[loop_num - 1]; in SerializeLoop()
477 TempLoopInfo& li = loops_[loop_num - 1]; in ConnectLoopTree()