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

  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
CallGraphUpdater.h 49 LazyCallGraph::SCC *SCC = nullptr;
62 void initialize(CallGraph &CG, CallGraphSCC &SCC) {
64 this->CGSCC = &SCC;
66 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC,
69 this->SCC = &SCC;
73 &AM.getResult<FunctionAnalysisManagerCGSCCProxy>(SCC, LCG).getManager();
92 /// Replace \p OldFn in the call graph (and SCC) with \p NewFn. The use
    [all...]
  /src/external/gpl3/binutils/dist/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,
  /src/external/gpl3/binutils.old/dist/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,
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LazyCallGraph.h 20 /// visited prior to a caller (given any SCC constraints), or vice versa. As
71 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
73 /// that functions already visited in a bottom-up order of the SCC DAG are no
75 /// a bottom-up order of the SCC DAG are not required to have already been
79 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
80 /// in the SCC DAG, the more independence there is in optimizing within it.
116 class SCC;
379 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
410 /// An SCC of the call graph
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
GlobalsModRef.cpp 473 // We do a bottom-up SCC traversal of the call graph. In other words, we
477 const std::vector<CallGraphNode *> &SCC = *I;
478 assert(!SCC.empty() && "SCC with no functions?");
480 for (auto *CGN : SCC)
492 // We do a bottom-up SCC traversal of the call graph. In other words, we
495 const std::vector<CallGraphNode *> &SCC = *I;
496 assert(!SCC.empty() && "SCC with no functions?");
498 Function *F = SCC[0]->getFunction()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
StructurizeCFG.cpp 390 auto &SCC = *SCCI;
392 // An SCC up to the size of 2, can be reduced to an entry (the last node),
395 unsigned Size = SCC.size();
399 // Add the SCC nodes to the Order array.
400 for (auto &N : SCC) {
401 assert(I < E && "SCC size mismatch!");
405 assert(I == E && "SCC size mismatch!");
413 // Collect the set of nodes in the SCC's subgraph. These are only the
415 // will have the same exact SCC all over again.
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SIDefines.h 285 SCC = 16,
286 ALL = GLC | SLC | DLC | SCC
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
OpenMPOpt.cpp 215 void foreachUse(SmallVectorImpl<Function *> &SCC,
217 for (Function *F : SCC)
519 OpenMPOpt(SmallVectorImpl<Function *> &SCC, CallGraphUpdater &CGUpdater,
522 : M(*(*SCC.begin())->getParent()), SCC(SCC), CGUpdater(CGUpdater),
531 /// Run all OpenMP optimizations on the underlying SCC/ModuleSlice.
533 if (SCC.empty())
538 LLVM_DEBUG(dbgs() << TAG << "Run on SCC with " << SCC.size(
    [all...]
  /src/external/bsd/pcc/dist/pcc/mip/
pass2.h 83 #define SCC 040 /* same as FORCC */
  /src/external/gpl3/binutils/dist/opcodes/
i386-opc.h 640 /* Instruction support SCC. */
641 #define SCC 11
  /src/external/gpl3/binutils.old/dist/opcodes/
i386-opc.h 628 /* Instruction support SCC. */
629 #define SCC 11
  /src/external/gpl3/gdb.old/dist/opcodes/
i386-opc.h 595 /* Instruction support SCC. */
596 #define SCC 11
  /src/external/gpl3/gdb/dist/opcodes/
i386-opc.h 628 /* Instruction support SCC. */
629 #define SCC 11
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp 10097 if (SDValue SCC = SimplifySetCC(getSetCCResultType(N0.getValueType()), N0, N1,
10099 AddToWorklist(SCC.getNode());
10101 if (ConstantSDNode *SCCC = dyn_cast<ConstantSDNode>(SCC.getNode())) {
10106 } else if (SCC->isUndef()) {
10110 } else if (SCC.getOpcode() == ISD::SETCC) {
10113 ISD::SELECT_CC, SDLoc(N), N2.getValueType(), SCC.getOperand(0),
10114 SCC.getOperand(1), N2, N3, SCC.getOperand(2));
10115 SelectOp->setFlags(SCC->getFlags());
10958 if (SDValue SCC
    [all...]

Completed in 49 milliseconds