Searched refs:RootSet (Results 1 - 3 of 3) sorted by relevance

/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.h240 void initializeRootSet(SmallVectorImpl<unsigned> &RootSet) const;
241 void propagateThroughEdges(SmallVectorImpl<unsigned> &RootSet, unsigned Iterations);
268 SmallVector<unsigned, 16> RootSet; local
270 initializeRootSet(RootSet);
271 propagateThroughEdges(RootSet, Iterations);
H A DBottleneckAnalysis.cpp196 SmallVectorImpl<unsigned> &RootSet) const {
200 RootSet.emplace_back(I);
205 SmallVectorImpl<unsigned> &RootSet, unsigned Iterations) {
209 // RootSet to a leaf node (i.e. a node with no successors). The RootSet is
225 // RootSet. A node N is added to the `unvisited nodes` if all its
235 // The algorithm terminates when the set of unvisited nodes (i.e. our RootSet)
239 for (unsigned IID : RootSet) {
259 std::swap(RootSet, ToVisit);
261 } while (!RootSet
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1240 SparseSet<RootData> RootSet; member in class:llvm::SchedDFSImpl
1244 RootSet.setUniverse(R.DFSNodeData.size());
1290 if (RootSet[PredNum].ParentNodeID == SchedDFSResult::InvalidSubtreeID)
1291 RootSet[PredNum].ParentNodeID = SU->NodeNum;
1293 else if (RootSet.count(PredNum)) {
1296 // RootSet[PredNum].ParentNodeID may either be invalid or may still be
1298 RData.SubInstrCount += RootSet[PredNum].SubInstrCount;
1299 RootSet.erase(PredNum);
1302 RootSet[SU->NodeNum] = RData;
1324 assert(SubtreeClasses.getNumClasses() == RootSet
[all...]

Completed in 72 milliseconds