Home
last modified time | relevance | path

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

1234

/freebsd-14.2/contrib/llvm-project/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.h254 using NodeType = typename GT::NodeType; variable
256 using NodesType = std::vector<NodeType *>;
296 std::unordered_map<NodeType *, NodeInfo> NodeInfoMap;
350 std::queue<NodeType *> Queue; in scc_member_iterator()
/freebsd-14.2/contrib/llvm-project/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);
440 template <typename NodeType>
441 bool DependenceGraphInfo<NodeType>::getDependencies( in getDependencies()
442 const NodeType &Src, const NodeType &Dst, DependenceList &Deps) const { in getDependencies()
462 template <typename NodeType>
[all …]
/freebsd-14.2/contrib/llvm-project/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 …]
/freebsd-14.2/contrib/llvm-project/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 __anon03f60ac10111::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 …]
/freebsd-14.2/contrib/llvm-project/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.
/freebsd-14.2/contrib/llvm-project/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 …]
H A DASTMatchersInternal.h1975 template <typename NodeType>
1977 equivalentBinaryOperator(const NodeType &Node) {
2056 template <typename NodeType>
2058 equivalentUnaryOperator(const NodeType &Node) {
2100 template <typename NodeType> inline const Expr *getLHS(const NodeType &Node) {
2110 template <typename NodeType> inline const Expr *getRHS(const NodeType &Node) {
2120 template <typename NodeType>
2121 inline const Expr *getSubExpr(const NodeType &Node) {
/freebsd-14.2/contrib/llvm-project/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 …]
/freebsd-14.2/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DBugSuppression.cpp38 template <class NodeType> inline SourceRange getRange(const NodeType *Node) { in getRange()
101 template <class NodeType> bool VisitAttributedNode(NodeType *Node) { in VisitAttributedNode()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Lanai/
H A DLanaiISelDAGToDAG.cpp173 ISD::NodeType AluOperator = static_cast<ISD::NodeType>(Addr.getOpcode()); in selectAddrRiSpls()
218 static AluCode isdToLanaiAluCode(ISD::NodeType Node_type) { in isdToLanaiAluCode()
259 ISD::NodeType AluOperator = static_cast<ISD::NodeType>(Addr.getOpcode()); in selectAddrRr()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h218 using NodeType = ProfiledCallGraphNode;
220 using EdgeType = NodeType::edge;
221 using ChildIteratorType = NodeType::const_iterator;
/freebsd-14.2/contrib/kyua/model/
H A Dmetadata.cpp319 template< class NodeType >
320 typename NodeType::value_type&
324 return tree.lookup_rw< NodeType >(key); in lookup_rw()
342 template< class NodeType >
345 const typename NodeType::value_type& value) in set()
348 tree.set< NodeType >(key, value); in set()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DISDOpcodes.h40 enum NodeType { enum
1404 NodeType getVecReduceBaseOpcode(unsigned VecReduceOpcode);
1490 NodeType getExtForLoadExtType(bool IsFP, LoadExtType);
H A DSelectionDAGNodes.h480 int32_t NodeType;
658 unsigned getOpcode() const { return (unsigned)NodeType; }
670 return NodeType >= ISD::FIRST_TARGET_STRICTFP_OPCODE;
677 return NodeType >= ISD::FIRST_TARGET_MEMORY_OPCODE;
681 bool isUndef() const { return NodeType == ISD::UNDEF; }
689 return (NodeType == ISD::INTRINSIC_W_CHAIN ||
690 NodeType == ISD::INTRINSIC_VOID) &&
696 switch (NodeType) {
713 bool isMachineOpcode() const { return NodeType < 0; }
720 return ~NodeType;
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/LoongArch/
H A DLoongArchISelLowering.h25 enum NodeType : unsigned { enum
205 ISD::NodeType getExtendForAtomicOps() const override { in getExtendForAtomicOps()
209 ISD::NodeType getExtendForAtomicCmpSwapArg() const override;
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanDominatorTree.h27 using NodeType = VPBlockBase;
/freebsd-14.2/lib/libefivar/
H A Duefi-dputil.c429 IN UINT8 NodeType, in CreateDeviceNode() argument
445 DevicePath->Type = NodeType; in CreateDeviceNode()
/freebsd-14.2/contrib/llvm-project/llvm/utils/TableGen/
H A DDAGISelMatcher.cpp370 MVT::SimpleValueType NodeType = getOpcode().getKnownType(CT->getResNo()); in isContradictoryImpl() local
371 if (NodeType != MVT::Other) in isContradictoryImpl()
372 return TypesAreContradictory(NodeType, CT->getType()); in isContradictoryImpl()
/freebsd-14.2/sys/contrib/edk2/Include/Protocol/
H A DDevicePathUtilities.h150 IN UINT8 NodeType,
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64SelectionDAGInfo.h22 SDValue EmitMOPS(AArch64ISD::NodeType SDOpcode, SelectionDAG &DAG,
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/ARC/
H A DARCISelLowering.h29 enum NodeType : unsigned { enum
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/VE/
H A DVEISelLowering.h24 enum NodeType : unsigned { enum
211 ISD::NodeType getExtendForAtomicOps() const override { in getExtendForAtomicOps()
/freebsd-14.2/sys/contrib/edk2/Include/Library/
H A DDevicePathLib.h412 IN UINT8 NodeType,

1234