| /openbsd-current/gnu/llvm/llvm/lib/Demangle/ |
| H A D | ItaniumDemangle.cpp | 398 : RootNode(nullptr), Context(new Demangler{nullptr, nullptr}) {}
406 : RootNode(Other.RootNode), Context(Other.Context) {
407 Other.Context = Other.RootNode = nullptr;
412 std::swap(RootNode, Other.RootNode);
417 // Demangle MangledName into an AST, storing it into this->RootNode.
422 RootNode = Parser->parse();
423 return RootNode == nullptr;
426 static char *printNode(const Node *RootNode, cha argument
[all...] |
| /openbsd-current/gnu/llvm/llvm/include/llvm/Demangle/ |
| H A D | Demangle.h | 128 void *RootNode; member in struct:llvm::ItaniumPartialDemangler
|
| /openbsd-current/gnu/llvm/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 270 DomTreeNodeBase<NodeT> *RootNode = nullptr; member in class:llvm::DominatorTreeBase
284 RootNode(Arg.RootNode),
294 RootNode = RHS.RootNode;
386 DomTreeNodeBase<NodeT> *getRootNode() { return RootNode; }
387 const DomTreeNodeBase<NodeT> *getRootNode() const { return RootNode; }
666 return RootNode = NewNode;
826 RootNode = nullptr;
926 RootNode
[all...] |
| H A D | GenericDomTreeConstruction.h | 594 DT.RootNode = DT.createNode(Root);
595 SNCA.attachNewSubtree(DT, DT.RootNode);
|
| /openbsd-current/gnu/llvm/llvm/lib/Analysis/ |
| H A D | DependenceGraphBuilder.cpp | 80 auto &RootNode = createRootNode(); local
83 if (*N == RootNode)
87 createRootedEdge(RootNode, *N);
|
| /openbsd-current/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | ComplexDeinterleavingPass.cpp | 202 NodePtr RootNode; member in class:__anon2055::ComplexDeinterleavingGraph
821 RootNode = identifyNode(Real, Imag);
839 return RootNode != nullptr;
864 Value *R = replaceNode(RootNode.get());
|
| /openbsd-current/gnu/llvm/llvm/tools/llvm-xray/ |
| H A D | xray-stacks.cpp | 513 for (auto *RootNode : RootNodeRange)
514 RootValues.push_back(RootNode);
|
| /openbsd-current/gnu/llvm/clang/lib/Format/ |
| H A D | UnwrappedLineFormatter.cpp | 1178 StateNode *RootNode =
1180 Queue.push(QueueItem(OrderedPenalty(0, Count), RootNode));
|
| /openbsd-current/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | DAGCombiner.cpp | 125 cl::desc("Limit the number of times for the same StoreNode and RootNode "
183 /// Map from candidate StoreNode to the pair of RootNode and count.
185 /// with the same RootNode bail out in dependence check. If we have seen
187 /// consider the StoreNode with the same RootNode as store merging
726 /// potentially may be merged with St are placed in StoreNodes. RootNode is
733 /// have indirect dependency through their operands. RootNode is the
738 SDNode *RootNode);
18714 SDNode *&RootNode) {
18806 // Check if the pair of StoreNode and the RootNode already bail out many
18809 SDNode *RootNode)
18712 getStoreMergeCandidates( StoreSDNode *St, SmallVectorImpl<MemOpLink> &StoreNodes, SDNode *&RootNode) argument
18872 checkMergeStoreCandidatesForDependencies( SmallVectorImpl<MemOpLink> &StoreNodes, unsigned NumStores, SDNode *RootNode) argument
18981 tryStoreMergeOfConstants( SmallVectorImpl<MemOpLink> &StoreNodes, unsigned NumConsecutiveStores, EVT MemVT, SDNode *RootNode, bool AllowVectors) argument
19109 tryStoreMergeOfExtracts( SmallVectorImpl<MemOpLink> &StoreNodes, unsigned NumConsecutiveStores, EVT MemVT, SDNode *RootNode) argument
19179 tryStoreMergeOfLoads(SmallVectorImpl<MemOpLink> &StoreNodes, unsigned NumConsecutiveStores, EVT MemVT, SDNode *RootNode, bool AllowVectors, bool IsNonTemporalStore, bool IsNonTemporalLoad) argument
19488 SDNode *RootNode; local
[all...] |