| /openbsd-src/gnu/llvm/clang/lib/AST/ |
| H A D | StmtPrinter.cpp | 153 void VisitStmt(Stmt *Node) LLVM_ATTRIBUTE_UNUSED { in VisitStmt()
157 void VisitExpr(Expr *Node) LLVM_ATTRIBUTE_UNUSED { in VisitExpr()
177 void StmtPrinter::PrintRawCompoundStmt(CompoundStmt *Node) { in PrintRawCompoundStmt()
255 void StmtPrinter::VisitNullStmt(NullStmt *Node) { in VisitNullStmt()
259 void StmtPrinter::VisitDeclStmt(DeclStmt *Node) { in VisitDeclStmt()
265 void StmtPrinter::VisitCompoundStmt(CompoundStmt *Node) { in VisitCompoundStmt()
271 void StmtPrinter::VisitCaseStmt(CaseStmt *Node) { in VisitCaseStmt()
283 void StmtPrinter::VisitDefaultStmt(DefaultStmt *Node) { in VisitDefaultStmt()
288 void StmtPrinter::VisitLabelStmt(LabelStmt *Node) { in VisitLabelStmt()
293 void StmtPrinter::VisitAttributedStmt(AttributedStmt *Node) { in VisitAttributedStmt()
[all …]
|
| H A D | TextNodeDumper.cpp | 124 void TextNodeDumper::Visit(const Stmt *Node) { in Visit()
926 static void dumpBasePath(raw_ostream &OS, const CastExpr *Node) { in dumpBasePath()
951 void TextNodeDumper::VisitIfStmt(const IfStmt *Node) { in VisitIfStmt()
968 void TextNodeDumper::VisitSwitchStmt(const SwitchStmt *Node) { in VisitSwitchStmt()
975 void TextNodeDumper::VisitWhileStmt(const WhileStmt *Node) { in VisitWhileStmt()
980 void TextNodeDumper::VisitLabelStmt(const LabelStmt *Node) { in VisitLabelStmt()
986 void TextNodeDumper::VisitGotoStmt(const GotoStmt *Node) { in VisitGotoStmt()
991 void TextNodeDumper::VisitCaseStmt(const CaseStmt *Node) { in VisitCaseStmt()
996 void TextNodeDumper::VisitConstantExpr(const ConstantExpr *Node) { in VisitConstantExpr()
1002 void TextNodeDumper::VisitCallExpr(const CallExpr *Node) { in VisitCallExpr()
[all …]
|
| H A D | OpenMPClause.cpp | 1676 void OMPClausePrinter::VisitOMPIfClause(OMPIfClause *Node) { in VisitOMPIfClause()
1684 void OMPClausePrinter::VisitOMPFinalClause(OMPFinalClause *Node) { in VisitOMPFinalClause()
1690 void OMPClausePrinter::VisitOMPNumThreadsClause(OMPNumThreadsClause *Node) { in VisitOMPNumThreadsClause()
1696 void OMPClausePrinter::VisitOMPAlignClause(OMPAlignClause *Node) { in VisitOMPAlignClause()
1702 void OMPClausePrinter::VisitOMPSafelenClause(OMPSafelenClause *Node) { in VisitOMPSafelenClause()
1708 void OMPClausePrinter::VisitOMPSimdlenClause(OMPSimdlenClause *Node) { in VisitOMPSimdlenClause()
1714 void OMPClausePrinter::VisitOMPSizesClause(OMPSizesClause *Node) { in VisitOMPSizesClause()
1726 void OMPClausePrinter::VisitOMPFullClause(OMPFullClause *Node) { OS << "full"; } in VisitOMPFullClause()
1728 void OMPClausePrinter::VisitOMPPartialClause(OMPPartialClause *Node) { in VisitOMPPartialClause()
1738 void OMPClausePrinter::VisitOMPAllocatorClause(OMPAllocatorClause *Node) { in VisitOMPAllocatorClause()
[all …]
|
| H A D | ParentMapContext.cpp | 95 static DynTypedNodeList getDynNodeFromMap(const NodeTy &Node, in getDynNodeFromMap()
126 DynTypedNodeList getParents(TraversalKind TK, const DynTypedNode &Node) { in getParents()
314 template <typename T> static DynTypedNode createDynTypedNode(const T &Node) { in createDynTypedNode()
317 template <> DynTypedNode createDynTypedNode(const TypeLoc &Node) { in createDynTypedNode()
321 DynTypedNode createDynTypedNode(const NestedNameSpecifierLoc &Node) { in createDynTypedNode()
324 template <> DynTypedNode createDynTypedNode(const ObjCProtocolLoc &Node) { in createDynTypedNode()
395 template <typename T> static bool isNull(T Node) { return !Node; } in isNull()
396 static bool isNull(ObjCProtocolLoc Node) { return false; } in isNull()
400 bool TraverseNode(T Node, MapNodeTy MapNode, BaseTraverseFn BaseTraverse, in TraverseNode()
459 DynTypedNodeList ParentMapContext::getParents(const DynTypedNode &Node) { in getParents()
|
| /openbsd-src/gnu/llvm/llvm/lib/BinaryFormat/ |
| H A D | AMDGPUMetadataVerifier.cpp | 29 msgpack::DocNode &Node, msgpack::Type SKind, in verifyScalar()
50 bool MetadataVerifier::verifyInteger(msgpack::DocNode &Node) { in verifyInteger()
58 msgpack::DocNode &Node, function_ref<bool(msgpack::DocNode &)> verifyNode, in verifyArray()
81 return verifyEntry(MapNode, Key, Required, [=](msgpack::DocNode &Node) { in verifyScalarEntry()
88 return verifyEntry(MapNode, Key, Required, [this](msgpack::DocNode &Node) { in verifyIntegerEntry()
93 bool MetadataVerifier::verifyKernelArgs(msgpack::DocNode &Node) { in verifyKernelArgs()
195 bool MetadataVerifier::verifyKernel(msgpack::DocNode &Node) { in verifyKernel()
220 KernelMap, ".language_version", false, [this](msgpack::DocNode &Node) { in verifyKernel()
223 [this](msgpack::DocNode &Node) { return verifyInteger(Node); }, 2); in verifyKernel()
226 if (!verifyEntry(KernelMap, ".args", false, [this](msgpack::DocNode &Node) { in verifyKernel()
[all …]
|
| /openbsd-src/gnu/llvm/clang/include/clang/Tooling/ASTDiff/ |
| H A D | ASTDiff.h | 38 struct Node { struct
39 NodeId Parent, LeftMostDescendant, RightMostDescendant; argument
41 DynTypedNode ASTNode; argument
42 SmallVector<NodeId, 4> Children; argument
60 SyntaxTree(T *Node, ASTContext &AST) in SyntaxTree()
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | SpillPlacement.cpp | 75 struct SpillPlacement::Node { struct in SpillPlacement
77 BlockFrequency BiasN;
80 BlockFrequency BiasP;
85 int Value;
87 using LinkVector = SmallVector<std::pair<BlockFrequency, unsigned>, 4>;
91 LinkVector Links;
94 BlockFrequency SumLinkWeights;
97 bool preferReg() const { in preferReg()
103 bool mustSpill() const { in mustSpill()
112 void clear(const BlockFrequency &Threshold) { in clear()
[all …]
|
| /openbsd-src/gnu/llvm/lldb/source/Symbol/ |
| H A D | PostfixExpression.cpp | 118 bool Visit(BinaryOpNode &binary, Node *&) override { in Visit() argument
122 bool Visit(InitialValueNode &, Node *&) override { return true; } in Visit() argument
123 bool Visit(IntegerNode &, Node *&) override { return true; } in Visit() argument
124 bool Visit(RegisterNode &, Node *&) override { return true; } in Visit() argument
136 bool Visit(UnaryOpNode &unary, Node *&) override { in Visit() argument
154 void Visit(IntegerNode &integer, Node *&) override { in Visit() argument
162 void Visit(SymbolNode &symbol, Node *&) override { in Visit() argument
181 void DWARFCodegen::Visit(BinaryOpNode &binary, Node *&) { in Visit() argument
208 void DWARFCodegen::Visit(InitialValueNode &, Node *&) { in Visit() argument
217 void DWARFCodegen::Visit(RegisterNode ®, Node *&) { in Visit() argument
[all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/DebugInfo/Symbolize/ |
| H A D | MarkupFilter.cpp | 53 while (std::optional<MarkupNode> Node = Parser.nextNode()) { in filter() local
63 for (const MarkupNode &Node : DeferredNodes) in filter() local
69 while (std::optional<MarkupNode> Node = Parser.nextNode()) in finish() local
86 const MarkupNode &Node, const SmallVector<MarkupNode> &DeferredNodes) { in tryContextualElement()
94 bool MarkupFilter::tryMMap(const MarkupNode &Node, in tryMMap()
116 for (const MarkupNode &Node : DeferredNodes) in tryMMap() local
125 bool MarkupFilter::tryReset(const MarkupNode &Node, in tryReset()
134 for (const MarkupNode &Node : DeferredNodes) in tryReset() local
146 bool MarkupFilter::tryModule(const MarkupNode &Node, in tryModule()
164 for (const MarkupNode &Node : DeferredNodes) in tryModule() local
[all …]
|
| /openbsd-src/gnu/llvm/clang/include/clang/AST/ |
| H A D | DeclContextInternals.h | 58 if (auto *Node = List.dyn_cast<DeclListNode*>()) { in erase_if() local
72 DeclListNode *Node = NewLast->get<DeclListNode*>(); in erase_if() local
183 DeclListNode *Node = C.AllocateDeclListNode(Decls[I - 1]); in replaceExternalDecls() local
198 while (DeclListNode *Node = Tail->dyn_cast<DeclListNode *>()) in replaceExternalDecls() local
202 DeclListNode *Node = C.AllocateDeclListNode(Tail->get<NamedDecl *>()); in replaceExternalDecls() local
232 DeclListNode *Node = C.AllocateDeclListNode(OldD); in addOrReplaceDecl() local
256 DeclListNode *Node = C.AllocateDeclListNode(ND); in addOrReplaceDecl() local
272 DeclListNode *Node = C.AllocateDeclListNode(D); in prependDeclNoReplace() local
285 if (auto *Node = D.dyn_cast<DeclListNode*>()) { in dump() local
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | LegalizeVectorOps.cpp | 255 SDNode *Node = DAG.UpdateNodeOperands(Op.getNode(), Ops); in LegalizeOp() local
512 bool VectorLegalizer::LowerOperationWrapper(SDNode *Node, in LowerOperationWrapper()
541 void VectorLegalizer::Promote(SDNode *Node, SmallVectorImpl<SDValue> &Results) { in Promote()
606 void VectorLegalizer::PromoteINT_TO_FP(SDNode *Node, in PromoteINT_TO_FP()
647 void VectorLegalizer::PromoteFP_TO_INT(SDNode *Node, in PromoteFP_TO_INT()
703 void VectorLegalizer::Expand(SDNode *Node, SmallVectorImpl<SDValue> &Results) { in Expand()
964 SDValue VectorLegalizer::ExpandSELECT(SDNode *Node) { in ExpandSELECT()
1020 SDValue VectorLegalizer::ExpandSEXTINREG(SDNode *Node) { in ExpandSEXTINREG()
1041 SDValue VectorLegalizer::ExpandANY_EXTEND_VECTOR_INREG(SDNode *Node) { in ExpandANY_EXTEND_VECTOR_INREG()
1076 SDValue VectorLegalizer::ExpandSIGN_EXTEND_VECTOR_INREG(SDNode *Node) { in ExpandSIGN_EXTEND_VECTOR_INREG()
[all …]
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/ADT/ |
| H A D | AllocatorList.h | 34 struct Node : ilist_node<Node> { struct
37 Node &operator=(Node &&) = delete; argument
38 Node &operator=(const Node &) = delete; argument
40 Node(T &&V) : V(std::move(V)) {} in Node() argument
41 Node(const T &V) : V(V) {} in Node() function
42 template <class... Ts> Node(Ts &&... Vs) : V(std::forward<Ts>(Vs)...) {} in Node() argument
46 using list_type = simple_ilist<Node>; argument
|
| /openbsd-src/gnu/llvm/llvm/lib/Support/ |
| H A D | DAGDeltaAlgorithm.cpp | 80 pred_iterator_ty pred_begin(change_ty Node) { in pred_begin()
84 pred_iterator_ty pred_end(change_ty Node) { in pred_end()
89 pred_closure_iterator_ty pred_closure_begin(change_ty Node) { in pred_closure_begin()
93 pred_closure_iterator_ty pred_closure_end(change_ty Node) { in pred_closure_end()
98 succ_iterator_ty succ_begin(change_ty Node) { in succ_begin()
102 succ_iterator_ty succ_end(change_ty Node) { in succ_end()
107 succ_closure_iterator_ty succ_closure_begin(change_ty Node) { in succ_closure_begin()
111 succ_closure_iterator_ty succ_closure_end(change_ty Node) { in succ_closure_end()
|
| H A D | UnicodeNameToCodepoint.cpp | 31 struct Node { struct
32 bool IsRoot = false;
33 char32_t Value = 0xFFFFFFFF;
34 uint32_t ChildrenOffset = 0;
35 bool HasSibling = false;
36 uint32_t Size = 0;
37 StringRef Name;
38 const Node *Parent = nullptr;
40 constexpr bool isValid() const { in isValid()
43 constexpr bool hasChildren() const { return ChildrenOffset != 0 || IsRoot; } in hasChildren()
[all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Remarks/ |
| H A D | YAMLRemarkParser.cpp | 37 yaml::Stream &Stream, yaml::Node &Node) { in YAMLParseError()
177 Error YAMLRemarkParser::error(StringRef Message, yaml::Node &Node) { in error()
272 Expected<Type> YAMLRemarkParser::parseType(yaml::MappingNode &Node) { in parseType()
286 Expected<StringRef> YAMLRemarkParser::parseKey(yaml::KeyValueNode &Node) { in parseKey()
293 Expected<StringRef> YAMLRemarkParser::parseStr(yaml::KeyValueNode &Node) { in parseStr()
308 Expected<unsigned> YAMLRemarkParser::parseUnsigned(yaml::KeyValueNode &Node) { in parseUnsigned()
320 YAMLRemarkParser::parseDebugLoc(yaml::KeyValueNode &Node) { in parseDebugLoc()
362 Expected<Argument> YAMLRemarkParser::parseArg(yaml::Node &Node) { in parseArg()
429 Expected<StringRef> YAMLStrTabRemarkParser::parseStr(yaml::KeyValueNode &Node) { in parseStr()
|
| /openbsd-src/gnu/llvm/llvm/lib/WindowsManifest/ |
| H A D | WindowsManifestMerger.cpp | 96 static xmlAttrPtr getAttribute(xmlNodePtr Node, in getAttribute()
124 static xmlNsPtr search(const unsigned char *HRef, xmlNodePtr Node) { in search()
152 xmlNodePtr Node) { in searchOrDefine()
177 xmlNodePtr Node) { in getNamespaceWithPrefix()
191 static xmlNsPtr getClosestDefault(xmlNodePtr Node) { in getClosestDefault()
288 static bool hasInheritedNs(xmlNodePtr Node) { in hasInheritedNs()
294 static bool hasInheritedDefaultNs(xmlNodePtr Node) { in hasInheritedDefaultNs()
299 static bool hasDefinedDefaultNamespace(xmlNodePtr Node) { in hasDefinedDefaultNamespace()
308 static void explicateNamespace(xmlNsPtr PrefixDef, xmlNodePtr Node) { in explicateNamespace()
480 static bool hasRecognizedNamespace(xmlNodePtr Node) { in hasRecognizedNamespace()
[all …]
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/ |
| H A D | DominanceFrontierImpl.h | 44 const DomTreeNodeT *Node; variable
58 BlockT *Node) { in addToFrontier()
66 iterator I, BlockT *Node) { in removeFromFrontier()
81 BlockT *Node = *I++; in compareDomSet() local
109 BlockT *Node = I->first; in compare() local
160 const DomTreeNodeT *Node) { in calculate()
|
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | DDGPrinter.cpp | 59 std::string DDGDotGraphTraits::getNodeLabel(const DDGNode *Node, in getNodeLabel()
68 const DDGNode *Node, GraphTraits<const DDGNode *>::ChildIteratorType I, in getEdgeAttributes()
77 bool DDGDotGraphTraits::isNodeHidden(const DDGNode *Node, in isNodeHidden()
86 DDGDotGraphTraits::getSimpleNodeLabel(const DDGNode *Node, in getSimpleNodeLabel()
104 DDGDotGraphTraits::getVerboseNodeLabel(const DDGNode *Node, in getVerboseNodeLabel()
|
| /openbsd-src/gnu/llvm/clang/lib/ASTMatchers/ |
| H A D | ASTMatchFinder.cpp | 68 DynTypedNode Node; member
242 bool TraverseCXXForRangeStmt(CXXForRangeStmt *Node) { in TraverseCXXForRangeStmt()
260 bool TraverseCXXRewrittenBinaryOperator(CXXRewrittenBinaryOperator *Node) { in TraverseCXXRewrittenBinaryOperator()
278 bool TraverseLambdaExpr(LambdaExpr *Node) { in TraverseLambdaExpr()
370 bool match(const T &Node) { in match()
397 bool traverse(const T &Node) { in traverse()
594 bool memoizedMatchesRecursively(const DynTypedNode &Node, ASTContext &Ctx, in memoizedMatchesRecursively()
629 bool matchesRecursively(const DynTypedNode &Node, in matchesRecursively()
660 bool matchesChildOf(const DynTypedNode &Node, ASTContext &Ctx, in matchesChildOf()
668 bool matchesDescendantOf(const DynTypedNode &Node, ASTContext &Ctx, in matchesDescendantOf()
[all …]
|
| /openbsd-src/gnu/llvm/clang/include/clang/Tooling/Transformer/ |
| H A D | SourceCode.h | 34 CharSourceRange getExtendedRange(const T &Node, tok::TokenKind Next, in getExtendedRange()
56 StringRef getText(const T &Node, const ASTContext &Context) { in getText()
84 StringRef getExtendedText(const T &Node, tok::TokenKind Next, in getExtendedText()
|
| /openbsd-src/gnu/llvm/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchFinder.h | 194 template <typename T> void match(const T &Node, ASTContext &Context) { in match()
280 if (const NodeT *Node = N.getNodeAs<NodeT>(BoundTo)) in selectFirst() local
302 SmallVector<BoundNodes, 1> match(MatcherT Matcher, const DynTypedNode &Node, in match()
313 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context) { in match()
328 matchDynamic(internal::DynTypedMatcher Matcher, const DynTypedNode &Node, in matchDynamic()
339 const NodeT &Node, in matchDynamic()
|
| /openbsd-src/gnu/llvm/clang/include/clang/Tooling/ |
| H A D | FixIt.h | 43 template <typename T> CharSourceRange getSourceRange(const T &Node) { in getSourceRange()
50 StringRef getText(const T &Node, const ASTContext &Context) { in getText()
56 template <typename T> FixItHint createRemoval(const T &Node) { in createRemoval()
|
| /openbsd-src/gnu/llvm/llvm/utils/UnicodeData/ |
| H A D | UnicodeNameMappingGenerator.cpp | 323 struct Node { struct in Trie
324 Node(std::string Name, Node *Parent = nullptr) in Node() argument
327 std::vector<std::unique_ptr<Node>> Children;
328 std::string Name;
329 Node *Parent = nullptr;
330 std::optional<char32_t> Value;
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Support/ |
| H A D | GraphWriter.h | 83 bool getEdgeSourceLabels(raw_ostream &O, NodeRef Node) { in getEdgeSourceLabels()
167 for (const auto Node : nodes<GraphType>(G)) in writeNodes() local
172 bool isNodeHidden(NodeRef Node) { return DTraits.isNodeHidden(Node, G); } in isNodeHidden()
174 void writeNode(NodeRef Node) { in writeNode()
288 void writeEdge(NodeRef Node, unsigned edgeidx, child_iterator EI) { in writeEdge()
|
| /openbsd-src/gnu/llvm/compiler-rt/lib/xray/ |
| H A D | xray_function_call_trie.h | 111 struct Node { struct
112 Node *Parent; argument
113 NodeIdPairArray Callees; argument
124 Node *NodePtr; argument
486 FunctionCallTrie::Node *Node; in deepCopyInto() member
|