HomeSort by: relevance | last modified time | path
    Searched refs:RootSet (Results 1 - 3 of 3) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/tools/llvm-mca/Views/
BottleneckAnalysis.h 241 void initializeRootSet(SmallVectorImpl<unsigned> &RootSet) const;
242 void propagateThroughEdges(SmallVectorImpl<unsigned> &RootSet, unsigned Iterations);
269 SmallVector<unsigned, 16> RootSet;
271 initializeRootSet(RootSet);
272 propagateThroughEdges(RootSet, Iterations);
BottleneckAnalysis.cpp 195 SmallVectorImpl<unsigned> &RootSet) const {
199 RootSet.emplace_back(I);
204 SmallVectorImpl<unsigned> &RootSet, unsigned Iterations) {
208 // RootSet to a leaf node (i.e. a node with no successors). The RootSet is
224 // RootSet. A node N is added to the `unvisited nodes` if all its
234 // The algorithm terminates when the set of unvisited nodes (i.e. our RootSet)
238 for (unsigned IID : RootSet) {
258 std::swap(RootSet, ToVisit);
260 } while (!RootSet.empty())
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp 1247 SparseSet<RootData> RootSet;
1251 RootSet.setUniverse(R.DFSNodeData.size());
1297 if (RootSet[PredNum].ParentNodeID == SchedDFSResult::InvalidSubtreeID)
1298 RootSet[PredNum].ParentNodeID = SU->NodeNum;
1300 else if (RootSet.count(PredNum)) {
1303 // RootSet[PredNum].ParentNodeID may either be invalid or may still be
1305 RData.SubInstrCount += RootSet[PredNum].SubInstrCount;
1306 RootSet.erase(PredNum);
1309 RootSet[SU->NodeNum] = RData;
1331 assert(SubtreeClasses.getNumClasses() == RootSet.size(
    [all...]

Completed in 49 milliseconds