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

  /src/external/apache2/llvm/dist/llvm/include/llvm/Demangle/
Demangle.h 122 void *RootNode;
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DependenceGraphBuilder.cpp 79 auto &RootNode = createRootNode();
82 if (*N == RootNode)
86 createRootedEdge(RootNode, *N);
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
GenericDomTree.h 254 DomTreeNodeBase<NodeT> *RootNode = nullptr;
268 RootNode(Arg.RootNode),
278 RootNode = RHS.RootNode;
370 DomTreeNodeBase<NodeT> *getRootNode() { return RootNode; }
371 const DomTreeNodeBase<NodeT> *getRootNode() const { return RootNode; }
649 return RootNode = NewNode;
809 RootNode = nullptr;
909 RootNode = nullptr
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp 127 cl::desc("Limit the number of times for the same StoreNode and RootNode "
180 /// Map from candidate StoreNode to the pair of RootNode and count.
182 /// with the same RootNode bail out in dependence check. If we have seen
184 /// consider the StoreNode with the same RootNode as store merging
706 /// potentially may be merged with St are placed in StoreNodes. RootNode is
713 /// have indirect dependency through their operands. RootNode is the
718 SDNode *RootNode);
16880 SDNode *&RootNode) {
16972 // Check if the pair of StoreNode and the RootNode already bail out many
16975 SDNode *RootNode) -> bool
    [all...]

Completed in 72 milliseconds