| /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 =()
411 RootNode = Parser->parse(); in partialDemangle()
412 return RootNode == nullptr; in partialDemangle()
415 static char *printNode(const Node *RootNode, char *Buf, size_t *N) { in printNode() argument
417 RootNode->print(OB); in printNode()
428 const Node *Name = static_cast<const FunctionEncoding *>(RootNode)->getName(); in getFunctionBaseName()
457 const Node *Name = static_cast<const FunctionEncoding *>(RootNode)->getName(); in getFunctionDeclContextName()
[all …]
|
| /llvm-project/clang-tools-extra/clang-tidy/abseil/ |
| H A D | DurationRewriter.cpp | 273 const Expr &RootNode = *Node->IgnoreParenImpCasts(); in rewriteExprFromNumberToDuration() local
277 rewriteInverseDurationCall(Result, Scale, RootNode)) in rewriteExprFromNumberToDuration()
280 if (isLiteralZero(Result, RootNode)) in rewriteExprFromNumberToDuration()
284 simplifyDurationFactoryArg(Result, RootNode) + ")") in rewriteExprFromNumberToDuration()
291 const Expr &RootNode = *Node->IgnoreParenImpCasts(); in rewriteExprFromNumberToTime() local
295 rewriteInverseTimeCall(Result, Scale, RootNode)) in rewriteExprFromNumberToTime()
298 if (isLiteralZero(Result, RootNode)) in rewriteExprFromNumberToTime()
302 tooling::fixit::getText(RootNode, *Result.Context) + ")") in rewriteExprFromNumberToTime()
|
| /llvm-project/clang-tools-extra/clang-move/ |
| H A D | HelperDeclRefGraph.cpp | 73 const auto *RootNode = getNode(Root); in getReachableNodes() local
74 if (!RootNode) in getReachableNodes()
85 VisitNode(RootNode); in getReachableNodes()
|
| /llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 269 DomTreeNodeBase<NodeT> *RootNode = nullptr;
283 NodeNumberMap(std::move(Arg.NodeNumberMap)), RootNode(Arg.RootNode),
295 RootNode = RHS.RootNode;
421 DomTreeNodeBase<NodeT> *getRootNode() { return RootNode; }
422 const DomTreeNodeBase<NodeT> *getRootNode() const { return RootNode; }
717 return RootNode = NewNode;
914 RootNode = nullptr;
1014 RootNode
[all...] |
| H A D | GenericDomTreeConstruction.h | 595 DT.RootNode = DT.createNode(Root); in attachNewSubtree()
596 SNCA.attachNewSubtree(DT, DT.RootNode); in attachNewSubtree()
|
| /llvm-project/llvm/lib/ProfileData/ |
| H A D | PGOCtxProfWriter.cpp | 86 void PGOCtxProfileWriter::write(const ContextNode &RootNode) {
87 writeImpl(std::nullopt, RootNode);
47 write(const ContextNode & RootNode) write() argument
|
| /llvm-project/llvm/lib/CodeGen/ |
| H A D | ComplexDeinterleavingPass.cpp | 1591 auto RootNode = It->second; in checkNodes()
1592 assert(RootNode->Operation == in checkNodes()
1594 RootNode->Operation == in checkNodes()
1598 auto *R = cast<Instruction>(RootNode->Real); in checkNodes()
1599 auto *I = RootNode->Imag ? cast<Instruction>(RootNode->Imag) : nullptr; in checkNodes()
1613 auto RootNode = identifyRoot(RootI); in checkNodes()
1614 if (!RootNode) in checkNodes()
1625 RootToNode[RootI] = RootNode; in checkNodes()
1720 auto RootNode in identifyDeinterleave()
1429 auto RootNode = It->second; identifyNodes() local
1443 auto RootNode = identifyRoot(RootI); identifyNodes() local
1551 auto RootNode = prepareCompositeNode( identifyReductionNodes() local
2054 auto RootNode = RootToNode[RootInstruction]; replaceNodes() local
[all...] |
| /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()
|
| /llvm-project/llvm/tools/llvm-gsymutil/ |
| H A D | llvm-gsymutil.cpp | 644 llvm::json::Object RootNode;
645 RootNode.try_emplace("error-categories", std::move(Categories));
646 RootNode.try_emplace("error-count", ErrorCount);
648 JsonStream << llvm::json::Value(std::move(RootNode));
545 llvm::json::Object RootNode; llvm_gsymutil_main() local
|
| /llvm-project/llvm/include/llvm/Demangle/ |
| H A D | Demangle.h | 131 void *RootNode;
|
| /llvm-project/polly/lib/CodeGen/ |
| H A D | IslAst.cpp | 721 isl::ast_node RootNode = Ast.getAst(); in print() local
726 if (RootNode.is_null()) { in print()
752 P = isl_ast_node_print(RootNode.get(), P, Options); in print()
|
| /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()
|
| /llvm-project/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFVerifier.cpp | 2210 llvm::json::Object RootNode;
2211 RootNode.try_emplace("error-categories", std::move(Categories));
2212 RootNode.try_emplace("error-count", ErrorCount);
2214 JsonStream << llvm::json::Value(std::move(RootNode));
2057 llvm::json::Object RootNode; summarize() local
|
| /llvm-project/clang/lib/Format/ |
| H A D | UnwrappedLineFormatter.cpp | 1314 StateNode *RootNode = in reconstructPath()
1316 Queue.push(QueueItem(OrderedPenalty(0, Count), RootNode)); in reconstructPath()
1223 StateNode *RootNode = analyzeSolutionSpace() local
|
| /llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | DAGCombiner.cpp | 134 cl::desc("Limit the number of times for the same StoreNode and RootNode "
186 /// Map from candidate StoreNode to the pair of RootNode and count.
188 /// with the same RootNode bail out in dependence check. If we have seen
190 /// consider the StoreNode with the same RootNode as store merging
801 /// have indirect dependency through their operands. RootNode is the
806 SDNode *RootNode);
20940 SDNode *RootNode = St->getChain().getNode(); in tryStoreMergeOfLoads()
20942 if (ChainsWithoutMergeableStores.contains(RootNode)) in tryStoreMergeOfLoads()
20945 // Check if the pair of StoreNode and the RootNode already bail out many in tryStoreMergeOfLoads()
20948 SDNode *RootNode) in tryStoreMergeOfLoads()
20337 getStoreMergeCandidates(StoreSDNode * St,SmallVectorImpl<MemOpLink> & StoreNodes,SDNode * & RootNode) getStoreMergeCandidates() argument
20437 __anon791abb434702(SDNode *StoreNode, SDNode *RootNode) getStoreMergeCandidates() argument
20502 checkMergeStoreCandidatesForDependencies(SmallVectorImpl<MemOpLink> & StoreNodes,unsigned NumStores,SDNode * RootNode) checkMergeStoreCandidatesForDependencies() argument
20611 tryStoreMergeOfConstants(SmallVectorImpl<MemOpLink> & StoreNodes,unsigned NumConsecutiveStores,EVT MemVT,SDNode * RootNode,bool AllowVectors) tryStoreMergeOfConstants() argument
20739 tryStoreMergeOfExtracts(SmallVectorImpl<MemOpLink> & StoreNodes,unsigned NumConsecutiveStores,EVT MemVT,SDNode * RootNode) tryStoreMergeOfExtracts() argument
20809 tryStoreMergeOfLoads(SmallVectorImpl<MemOpLink> & StoreNodes,unsigned NumConsecutiveStores,EVT MemVT,SDNode * RootNode,bool AllowVectors,bool IsNonTemporalStore,bool IsNonTemporalLoad) tryStoreMergeOfLoads() argument
21125 SDNode *RootNode; mergeConsecutiveStores() local
[all...] |