HomeSort by relevance Sort by last modified time
    Searched defs:SCC (Results 1 - 6 of 6) sorted by null

  /toolchain/binutils/binutils-2.25/gas/config/
tc-m68851.h 34 110 SCC Stack Change Control
73 #define SCC (VAL+1) /* 54 */
74 #define AC (SCC+1) /* 55 */
157 /* TC, CRP, DRP, SRP, CAL, VAL, SCC, AC */
m68k-parse.h 148 SCC,
  /external/llvm/unittests/Analysis/
LazyCallGraphTest.cpp 55 All call edges go up between SCCs, and clockwise around the SCC.
208 LazyCallGraph::SCC &D = *SCCI++;
222 LazyCallGraph::SCC &C = *SCCI++;
236 LazyCallGraph::SCC &B = *SCCI++;
252 LazyCallGraph::SCC &A = *SCCI++;
327 // Two interlocking cycles. The really useful thing about this SCC is that it
329 // children of each node in the SCC.
361 LazyCallGraph::SCC &SCC = *SCCI++;
369 EXPECT_EQ(&SCC, CG.lookupSCC(A))
    [all...]
  /external/llvm/include/llvm/Analysis/
LazyCallGraph.h 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
62 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
64 /// that functions already visited in a bottom-up order of the SCC DAG are no
66 /// a bottom-up order of the SCC DAG are not required to have already been
70 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
71 /// in the SCC DAG, the more independence there is in optimizing within it.
106 class SCC;
162 friend class LazyCallGraph::SCC;
205 /// \brief An SCC of the call graph
    [all...]
  /external/llvm/lib/Analysis/
GlobalsModRef.cpp 472 // We do a bottom-up SCC traversal of the call graph. In other words, we
476 const std::vector<CallGraphNode *> &SCC = *I;
477 assert(!SCC.empty() && "SCC with no functions?");
479 for (auto *CGN : SCC)
491 // We do a bottom-up SCC traversal of the call graph. In other words, we
494 const std::vector<CallGraphNode *> &SCC = *I;
495 assert(!SCC.empty() && "SCC with no functions?");
497 if (!SCC[0]->getFunction() || SCC[0]->getFunction()->mayBeOverridden())
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp     [all...]

Completed in 313 milliseconds