| /freebsd/contrib/llvm-project/llvm/lib/Demangle/ |
| H A D | ItaniumDemangle.cpp | 387 : RootNode(nullptr), Context(new Demangler{nullptr, nullptr}) {} in ItaniumPartialDemangler()
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 =()
406 // Demangle MangledName into an AST, storing it into this->RootNode.
411 RootNode = Parser->parse(); in partialDemangle()
412 return RootNode == nullptr; in partialDemangle()
415 static char *printNode(const Node *RootNode, cha argument
[all...] |
| /freebsd/contrib/llvm-project/llvm/lib/ProfileData/ |
| H A D | PGOCtxProfWriter.cpp | 47 void PGOCtxProfileWriter::write(const ContextNode &RootNode) { in write() argument
48 writeImpl(std::nullopt, RootNode); in write()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 268 DomTreeNodeBase<NodeT> *RootNode = nullptr;
282 RootNode(Arg.RootNode),
292 RootNode = RHS.RootNode;
384 DomTreeNodeBase<NodeT> *getRootNode() { return RootNode; }
385 const DomTreeNodeBase<NodeT> *getRootNode() const { return RootNode; }
664 return RootNode = NewNode;
824 RootNode = nullptr;
923 RootNode = nullptr;
|
| H A D | GenericDomTreeConstruction.h | 579 DT.RootNode = DT.createNode(Root); in CalculateFromScratch()
580 SNCA.attachNewSubtree(DT, DT.RootNode); in CalculateFromScratch()
|
| /freebsd/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()
1434 auto *R = cast<Instruction>(RootNode->Real); in identifyNodes()
1435 auto *I = cast<Instruction>(RootNode->Imag); 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()
[all …]
|
| /freebsd/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/contrib/llvm-project/llvm/include/llvm/Demangle/ |
| H A D | Demangle.h | 131 void *RootNode;
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-xray/ |
| H A D | xray-stacks.cpp | 509 for (auto *RootNode : RootNodeRange) in printIgnoringThreads()
510 RootValues.push_back(RootNode); in printIgnoringThreads()
513 for (auto *RootNode : RootNodeRange) printIgnoringThreads() local
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFVerifier.cpp | 2058 llvm::json::Object RootNode; in summarize() local
2059 RootNode.try_emplace("error-categories", std::move(Categories)); in summarize()
2060 RootNode.try_emplace("error-count", ErrorCount); in summarize()
2062 JsonStream << llvm::json::Value(std::move(RootNode)); in summarize()
|
| /freebsd/contrib/llvm-project/clang/lib/Format/ |
| H A D | UnwrappedLineFormatter.cpp | 1223 StateNode *RootNode = in analyzeSolutionSpace() local
1225 Queue.push(QueueItem(OrderedPenalty(0, Count), RootNode)); in analyzeSolutionSpace()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | DAGCombiner.cpp | 795 SDNode *RootNode);
20497 SDNode *RootNode = St->getChain().getNode(); in getStoreMergeCandidates() local
20499 if (ChainsWithoutMergeableStores.contains(RootNode)) in getStoreMergeCandidates()
20505 SDNode *RootNode) -> bool { in getStoreMergeCandidates() argument
20508 RootCount->second.first == RootNode && in getStoreMergeCandidates()
20520 !OverLimitInDependenceCheck(OtherStore, RootNode)) in getStoreMergeCandidates()
20527 if (auto *Ldn = dyn_cast<LoadSDNode>(RootNode)) { in getStoreMergeCandidates()
20528 RootNode = Ldn->getChain().getNode(); in getStoreMergeCandidates()
20530 if (ChainsWithoutMergeableStores.contains(RootNode)) in getStoreMergeCandidates()
20532 for (auto I = RootNode->use_begin(), E = RootNode->use_end(); in getStoreMergeCandidates()
[all …]
|