Searched refs:RootNode (Results 1 – 9 of 9) sorted by relevance
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Demangle/ |
| H A D | ItaniumDemangle.cpp | 395 : RootNode(Other.RootNode), Context(Other.Context) { in ItaniumPartialDemangler() 396 Other.Context = Other.RootNode = nullptr; in ItaniumPartialDemangler() 401 std::swap(RootNode, Other.RootNode); in operator =() 411 RootNode = Parser->parse(); in partialDemangle() 412 return RootNode == nullptr; in partialDemangle() 417 RootNode->print(OB); in printNode() 540 return printNode(static_cast<Node *>(RootNode), Buf, N); in finishDemangle() 547 auto *E = static_cast<const FunctionEncoding *>(RootNode); in hasFunctionQualifiers() 552 const Node *N = static_cast<const Node *>(RootNode); in isCtorOrDtor() 585 return static_cast<const Node *>(RootNode)->getKind() == in isFunction() [all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 270 DomTreeNodeBase<NodeT> *RootNode = nullptr; 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; 925 RootNode = nullptr;
|
| H A D | GenericDomTreeConstruction.h | 590 DT.RootNode = DT.createNode(Root); in CalculateFromScratch() 591 SNCA.attachNewSubtree(DT, DT.RootNode); in CalculateFromScratch()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ComplexDeinterleavingPass.cpp | 1429 auto RootNode = It->second; in identifyNodes() local 1430 assert(RootNode->Operation == in identifyNodes() 1443 auto RootNode = identifyRoot(RootI); in identifyNodes() local 1444 if (!RootNode) in identifyNodes() 1455 RootToNode[RootI] = RootNode; in identifyNodes() 1551 auto RootNode = prepareCompositeNode( in identifyReductionNodes() local 1553 RootNode->addOperand(Node); in identifyReductionNodes() 1554 RootToNode[Real] = RootNode; in identifyReductionNodes() 1555 RootToNode[Imag] = RootNode; in identifyReductionNodes() 1556 submitCompositeNode(RootNode); in identifyReductionNodes() [all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DependenceGraphBuilder.cpp | 80 auto &RootNode = createRootNode(); in createAndConnectRootNode() local 83 if (*N == RootNode) in createAndConnectRootNode() 87 createRootedEdge(RootNode, *N); in createAndConnectRootNode()
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Demangle/ |
| H A D | Demangle.h | 127 void *RootNode;
|
| /freebsd-14.2/contrib/llvm-project/llvm/tools/llvm-xray/ |
| H A D | xray-stacks.cpp | 509 for (auto *RootNode : RootNodeRange) in printIgnoringThreads() local 510 RootValues.push_back(RootNode); in printIgnoringThreads()
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/Format/ |
| H A D | UnwrappedLineFormatter.cpp | 1214 StateNode *RootNode = in analyzeSolutionSpace() local 1216 Queue.push(QueueItem(OrderedPenalty(0, Count), RootNode)); in analyzeSolutionSpace()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | DAGCombiner.cpp | 789 SDNode *RootNode); 20046 SDNode *&RootNode) { in getStoreMergeCandidates() argument 20182 RootNode = St->getChain().getNode(); in getStoreMergeCandidates() 20188 for (auto I = RootNode->use_begin(), E = RootNode->use_end(); in getStoreMergeCandidates() 20200 for (auto I = RootNode->use_begin(), E = RootNode->use_end(); in getStoreMergeCandidates() 20211 SDNode *RootNode) { in checkMergeStoreCandidatesForDependencies() argument 20224 Worklist.push_back(RootNode); in checkMergeStoreCandidatesForDependencies() 20268 if (RootCount.first == RootNode) in checkMergeStoreCandidatesForDependencies() 20271 RootCount = {RootNode, 1}; in checkMergeStoreCandidatesForDependencies() 20448 EVT MemVT, SDNode *RootNode) { in tryStoreMergeOfExtracts() argument [all …]
|