HomeSort by: relevance | last modified time | path
    Searched defs:RefSCC (Results 1 - 2 of 2) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LazyCallGraph.cpp 246 assert(OuterRefSCC && "Can't have a null RefSCC!");
328 LazyCallGraph::RefSCC::RefSCC(LazyCallGraph &G) : G(&G) {}
331 LLVM_DUMP_METHOD void LazyCallGraph::RefSCC::dump() const {
337 void LazyCallGraph::RefSCC::verify() {
347 "SCC doesn't think it is inside this RefSCC!");
360 assert(SCCSet.count(C) && "Found an index for an SCC not in the RefSCC!");
381 // Verify that all nodes in this RefSCC can reach all other nodes.
400 "Cannot reach all nodes within RefSCC");
407 bool LazyCallGraph::RefSCC::isParentOf(const RefSCC &RC) const
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LazyCallGraph.h 117 class RefSCC;
167 friend class LazyCallGraph::RefSCC;
187 friend class LazyCallGraph::RefSCC;
319 friend class LazyCallGraph::RefSCC;
379 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
417 /// The SCCs are nested within a \c RefSCC, see below for details about that
419 /// must be done through the containing \c RefSCC in order to fully reason
425 RefSCC *OuterRefSCC;
429 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes)
483 RefSCC &getOuterRefSCC() const { return *OuterRefSCC;
    [all...]

Completed in 20 milliseconds