Home
last modified time | relevance | path

Searched refs:NodeType (Results 1 – 25 of 98) sorted by relevance

1234

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DDirectedGraph.h35 DGEdge<NodeType, EdgeType> &operator=(const DGEdge<NodeType, EdgeType> &E) {
49 NodeType &getTargetNode() { in getTargetNode()
50 return const_cast<NodeType &>( in getTargetNode()
68 NodeType &TargetNode;
86 DGNode<NodeType, EdgeType> &operator=(const DGNode<NodeType, EdgeType> &N) {
90 DGNode<NodeType, EdgeType> &operator=(const DGNode<NodeType, EdgeType> &&N) {
97 friend bool operator==(const NodeType &M, const NodeType &N) {
100 friend bool operator!=(const NodeType &M, const NodeType &N) {
152 NodeType &getDerived() { return *static_cast<NodeType *>(this); } in getDerived()
217 bool addNode(NodeType &N) { in addNode()
[all …]
H A DSCCIterator.h253 using NodeType = typename GT::NodeType; variable
255 using NodesType = std::vector<NodeType *>;
294 std::unordered_map<NodeType *, NodeInfo> NodeInfoMap;
350 std::queue<NodeType *> Queue; in scc_member_iterator()
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DDependenceGraphBuilder.h36 using NodeType = typename GraphType::NodeType;
41 using NodeListType = SmallVector<NodeType *, 4>;
113 virtual NodeType &createRootNode() = 0;
123 virtual EdgeType &createDefUseEdge(NodeType &Src, NodeType &Tgt) = 0;
126 virtual EdgeType &createMemoryEdge(NodeType &Src, NodeType &Tgt) = 0;
129 virtual EdgeType &createRootedEdge(NodeType &Src, NodeType &Tgt) = 0;
139 virtual void destroyNode(NodeType &N) { delete &N; } in destroyNode()
150 virtual bool areNodesMergeable(const NodeType &A,
155 virtual void mergeNodes(NodeType &A, NodeType &B) = 0;
165 size_t getOrdinal(NodeType &N) { in getOrdinal()
[all …]
H A DDDG.h271 NodeType &getRoot() const { in getRoot()
280 bool getDependencies(const NodeType &Src, const NodeType &Dst,
286 std::string getDependenceString(const NodeType &Src,
300 NodeType *Root = nullptr;
311 using NodeType = DDGNode;
330 bool addNode(NodeType &N);
439 template <typename NodeType>
440 bool DependenceGraphInfo<NodeType>::getDependencies( in getDependencies()
441 const NodeType &Src, const NodeType &Dst, DependenceList &Deps) const { in getDependencies()
461 template <typename NodeType>
[all …]
/llvm-project-15.0.7/clang/unittests/AST/
H A DDeclMatcher.h20 template <typename NodeType, DeclMatcherKind MatcherKind>
22 NodeType *Node = nullptr;
26 Node = const_cast<NodeType *>(Result.Nodes.getNodeAs<NodeType>("")); in run()
32 NodeType *match(const Decl *D, const MatcherType &AMatcher) { in match()
40 template <typename NodeType>
42 template <typename NodeType>
45 template <typename NodeType>
51 if (auto N = Result.Nodes.getNodeAs<NodeType>("")) { in run()
59 : Predicate([](const NodeType *) { return true; }) {} in DeclCounterWithPredicate()
72 template <typename NodeType>
[all …]
H A DASTPrint.h24 template <typename NodeType>
27 const NodeType *Node,
30 template <typename NodeType>
31 using NodeFilter = std::function<bool(const NodeType *Node)>;
33 template <typename NodeType>
35 using PrinterT = NodePrinter<NodeType>;
36 using FilterT = NodeFilter<NodeType>;
51 const NodeType *N = Result.Nodes.getNodeAs<NodeType>("id"); in run()
67 template <typename NodeType> bool NoNodeFilter(const NodeType *) { in NoNodeFilter() argument
71 template <typename NodeType, typename Matcher>
[all …]
H A DMatchVerifier.h32 template <typename NodeType>
60 const NodeType &Node) {} in verify()
78 template <typename NodeType>
81 MatchVerifier<NodeType>::match(const std::string &Code, in match()
157 template <typename NodeType>
159 const NodeType *Node = Result.Nodes.getNodeAs<NodeType>(""); in run()
187 template <typename NodeType>
197 const NodeType &Node) override { in verify()
224 template <typename NodeType>
225 class RangeVerifier : public MatchVerifier<NodeType> {
[all …]
H A DASTImporterFixtures.h211 template <typename NodeType>
212 llvm::Expected<NodeType> importNode(ASTUnit *From, ASTUnit *To, in importNode()
240 template <typename NodeType>
245 MatchVerifier<NodeType> &Verifier, in testImport()
246 const internal::BindableMatcher<NodeType> &SearchMatcher, in testImport()
267 auto ToImport = selectFirst<NodeType>(DeclToImportID, FoundNodes); in testImport()
273 internal::BindableMatcher<NodeType> WrapperMatcher(VerificationMatcher); in testImport()
290 template <typename NodeType>
295 MatchVerifier<NodeType> &Verifier, in testImport()
311 template <typename NodeType, typename MatcherType>
[all …]
H A DStructuralEquivalenceTest.cpp39 template <typename NodeType, typename MatcherType>
40 std::tuple<NodeType *, NodeType *>
46 NodeType *D0 = FirstDeclMatcher<NodeType>().match( in makeDecls()
48 NodeType *D1 = FirstDeclMatcher<NodeType>().match( in makeDecls()
66 std::tuple<NodeType *, NodeType *>
69 return makeDecls<NodeType, MatcherType>( in makeDecls()
1707 std::pair<NodeType *, NodeType *>
1710 NodeType *D0 = FirstDeclMatcher<NodeType>().match(get<0>(TU), M); in findDeclPair()
1711 NodeType *D1 = FirstDeclMatcher<NodeType>().match(get<1>(TU), M); in findDeclPair()
1715 template <typename NodeType>
[all …]
H A DASTTraverserTest.cpp104 template <typename... NodeType> std::string dumpASTString(NodeType &&... N) { in dumpASTString()
112 Dumper.Visit(std::forward<NodeType &&>(N)...); in dumpASTString()
117 template <typename... NodeType>
118 std::string dumpASTString(TraversalKind TK, NodeType &&... N) { in dumpASTString()
127 Dumper.Visit(std::forward<NodeType &&>(N)...); in dumpASTString()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DDependenceGraphBuilder.cpp125 llvm::sort(NL, [&](NodeType *LHS, NodeType *RHS) { in createPiBlocks()
138 for (NodeType *N : Graph) { in createPiBlocks()
162 auto createEdgeOfKind = [this](NodeType &Src, NodeType &Dst, in createPiBlocks()
179 auto reconnectEdges = [&](NodeType *Src, NodeType *Dst, NodeType *New, in createPiBlocks()
211 for (NodeType *SCCNode : NL) { in createPiBlocks()
229 for (NodeType *N : Graph) { in createDefUseEdges()
310 auto createConfusedEdges = [&](NodeType &Src, NodeType &Dst) { in createMemoryDependencyEdges()
323 auto createForwardEdge = [&](NodeType &Src, NodeType &Dst) { in createMemoryDependencyEdges()
331 auto createBackwardEdge = [&](NodeType &Src, NodeType &Dst) { in createMemoryDependencyEdges()
394 for (NodeType *N : Graph) { in simplify()
[all …]
/llvm-project-15.0.7/clang/utils/TableGen/
H A DClangSyntaxEmitter.cpp50 for (NodeType &N : AllTypes) { in Hierarchy()
51 llvm::sort(N.Derived, [](const NodeType *L, const NodeType *R) { in Hierarchy()
61 struct NodeType { struct in __anonf5ef44bb0111::Hierarchy
63 const NodeType *Base = nullptr; argument
64 std::vector<const NodeType *> Derived; argument
100 std::deque<NodeType> AllTypes;
104 const Hierarchy::NodeType &firstConcrete(const Hierarchy::NodeType &N) { in firstConcrete()
107 const Hierarchy::NodeType &lastConcrete(const Hierarchy::NodeType &N) { in lastConcrete()
116 NodeType = "Leaf"; in SyntaxConstraint()
118 NodeType = R.getName().str(); in SyntaxConstraint()
[all …]
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DTestGraph.h100 typedef std::pair<unsigned, NodeSubset> NodeType; typedef
104 NodeType Nodes[N];
130 NodeType *AccessNode(unsigned Idx) const { in AccessNode()
134 return const_cast<NodeType *>(&Nodes[Idx]); in AccessNode()
167 NodeType *FirstNode;
174 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} in ChildIterator()
211 NodeType *operator*() {
224 static ChildIterator child_begin(NodeType *Parent) { in child_begin()
229 static ChildIterator child_end(NodeType *Parent) { in child_end()
236 typedef typename Graph<N>::NodeType *NodeRef;
H A DDepthFirstIteratorTest.cpp41 typedef CountedSet<Graph<3>::NodeType *> StorageT; in TEST()
/llvm-project-15.0.7/clang/include/clang/Tooling/Syntax/
H A DSyntax.td37 // Defs derived from NodeType correspond to syntax tree node types.
38 // NodeType is also a syntax constraint: one node of this type.
39 class NodeType : Syntax {
40 // The NodeType that this node is derived from in the Node class hierarchy.
41 NodeType base = ?;
48 class External<NodeType base_> : NodeType { let base = base_; }
60 class Alternatives<NodeType base_ = Tree> : NodeType { let base = base_; }
64 class Unconstrained<NodeType base_ = Tree> : NodeType { let base = base_; }
79 class Sequence<NodeType base_ = Tree> : NodeType {
81 // Children must be Role or have a default role derived from the NodeType.
/llvm-project-15.0.7/clang/include/clang/ASTMatchers/
H A DASTMatchersMacros.h232 template <typename NodeType> \
234 : public ::clang::ast_matchers::internal::MatcherInterface<NodeType> { \
236 bool matches(const NodeType &Node, \
248 template <typename NodeType> \
249 bool internal::matcher_##DefineMatcher##Matcher<NodeType>::matches( \
250 const NodeType &Node, \
271 template <typename NodeType, typename ParamT> \
273 : public ::clang::ast_matchers::internal::MatcherInterface<NodeType> { \
278 bool matches(const NodeType &Node, \
298 template <typename NodeType, typename ParamT> \
[all …]
/llvm-project-15.0.7/clang/include/clang/Analysis/
H A DCallGraph.h244 using NodeType = clang::CallGraphNode;
246 using ChildIteratorType = NodeType::iterator;
248 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
249 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
250 static ChildIteratorType child_end(NodeType *N) { return N->end(); }
254 using NodeType = const clang::CallGraphNode;
256 using ChildIteratorType = NodeType::const_iterator;
259 static ChildIteratorType child_begin(NodeType *N) { return N->begin();}
260 static ChildIteratorType child_end(NodeType *N) { return N->end(); }
265 static NodeType *getEntryNode(clang::CallGraph *CGN) {
[all …]
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/google/
H A DUpgradeGoogletestCaseCheck.cpp229 template <typename NodeType>
230 static bool isInInstantiation(const NodeType &Node, in isInInstantiation()
235 template <typename NodeType>
236 static bool isInTemplate(const NodeType &Node, in isInTemplate()
238 internal::Matcher<NodeType> IsInsideTemplate = in isInTemplate()
/llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h185 using NodeType = ProfiledCallGraphNode;
187 using EdgeType = NodeType::edge;
188 using ChildIteratorType = NodeType::const_iterator;
/llvm-project-15.0.7/llvm/lib/Target/Lanai/
H A DLanaiISelDAGToDAG.cpp168 ISD::NodeType AluOperator = static_cast<ISD::NodeType>(Addr.getOpcode()); in selectAddrRiSpls()
223 ISD::NodeType AluOperator = static_cast<ISD::NodeType>(Addr.getOpcode()); in selectAddrRr()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DISDOpcodes.h40 enum NodeType { enum
1328 NodeType getVecReduceBaseOpcode(unsigned VecReduceOpcode);
1408 NodeType getExtForLoadExtType(bool IsFP, LoadExtType);
H A DSelectionDAGNodes.h458 int16_t NodeType;
645 return NodeType >= ISD::FIRST_TARGET_STRICTFP_OPCODE;
652 return NodeType >= ISD::FIRST_TARGET_MEMORY_OPCODE;
656 bool isUndef() const { return NodeType == ISD::UNDEF; }
664 return (NodeType == ISD::INTRINSIC_W_CHAIN ||
665 NodeType == ISD::INTRINSIC_VOID) &&
671 switch (NodeType) {
688 bool isMachineOpcode() const { return NodeType < 0; }
695 return ~NodeType;
2388 VPBaseLoadStoreSDNode(ISD::NodeType NodeTy, unsigned Order,
[all …]
/llvm-project-15.0.7/clang-tools-extra/clangd/unittests/
H A DFindTargetTests.cpp73 std::vector<PrintedDecl> assertNodeAndPrintDecls(const char *NodeType) { in assertNodeAndPrintDecls() argument
86 EXPECT_EQ(N->kind(), NodeType) << Selection; in assertNodeAndPrintDecls()
98 #define EXPECT_DECLS(NodeType, ...) \ argument
99 EXPECT_THAT(assertNodeAndPrintDecls(NodeType), \
/llvm-project-15.0.7/llvm/utils/TableGen/
H A DDAGISelMatcher.cpp365 MVT::SimpleValueType NodeType = getOpcode().getKnownType(CT->getResNo()); in isContradictoryImpl() local
366 if (NodeType != MVT::Other) in isContradictoryImpl()
367 return TypesAreContradictory(NodeType, CT->getType()); in isContradictoryImpl()
/llvm-project-15.0.7/llvm/lib/Target/AArch64/
H A DAArch64SelectionDAGInfo.h22 SDValue EmitMOPS(AArch64ISD::NodeType SDOpcode, SelectionDAG &DAG,

1234