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

  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGSDNodes.h 155 const SDNode *GetNode() const {
ScheduleDAGRRList.cpp 320 const SDNode *Node = RegDefPos.GetNode();
452 if (IsChainDependent(Op.getNode(), Inner, NestLevel, TII))
469 N = Op.getNode();
501 if (SDNode *New = FindCallSeqStart(Op.getNode(),
527 N = Op.getNode();
579 for (SDNode *Node = SU->getNode(); Node; Node = Node->getGluedNode())
660 // if (!SU->getNode() || !SU->getNode()->isMachineOpcode()) return;
698 if (!SU->getNode())
701 switch (SU->getNode()->getOpcode())
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LazyCallGraph.cpp 258 assert(E.getNode().isPopulated() && "Can't have an unpopulated node!");
270 Worklist.push_back(&E.getNode());
287 if (OuterRefSCC->G->lookupSCC(E.getNode()) == &C)
309 SCC *CalleeC = G.lookupSCC(E.getNode());
371 SCC &TargetSCC = *G->lookupSCC(E.getNode());
396 Worklist.push_back(&E.getNode());
415 if (G->lookupRefSCC(E.getNode()) == &RC)
437 auto *ChildRC = G->lookupRefSCC(E.getNode());
630 if (ConnectedSet.count(G->lookupSCC(E.getNode())))
661 SCC &EdgeC = *G->lookupSCC(E.getNode());
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LazyCallGraph.h 158 Node &getNode() const;
1210 GetEndT &&GetEnd, GetNodeT &&GetNode,
1246 inline LazyCallGraph::Node &LazyCallGraph::Edge::getNode() const {
1253 return getNode().getFunction();

Completed in 18 milliseconds