Home
last modified time | relevance | path

Searched defs:Node (Results 1 – 25 of 364) sorted by relevance

12345678910>>...15

/llvm-project-15.0.7/clang/lib/AST/
H A DStmtPrinter.cpp621 ObjCAvailabilityCheckExpr *Node) { in VisitObjCAvailabilityCheckExpr()
809 OMPParallelMasterDirective *Node) { in VisitOMPParallelMasterDirective()
815 OMPParallelMaskedDirective *Node) { in VisitOMPParallelMaskedDirective()
893 OMPTargetExitDataDirective *Node) { in VisitOMPTargetExitDataDirective()
899 OMPTargetParallelDirective *Node) { in VisitOMPTargetParallelDirective()
934 OMPTaskLoopSimdDirective *Node) { in VisitOMPTaskLoopSimdDirective()
940 OMPMasterTaskLoopDirective *Node) { in VisitOMPMasterTaskLoopDirective()
993 OMPTargetUpdateDirective *Node) { in VisitOMPTargetUpdateDirective()
1235 SYCLUniqueStableNameExpr *Node) { in VisitSYCLUniqueStableNameExpr()
1426 UnaryExprOrTypeTraitExpr *Node) { in VisitUnaryExprOrTypeTraitExpr()
[all …]
H A DTextNodeDumper.cpp124 void TextNodeDumper::Visit(const Stmt *Node) { in Visit()
1052 const UnresolvedLookupExpr *Node) { in VisitUnresolvedLookupExpr()
1078 const SYCLUniqueStableNameExpr *Node) { in VisitSYCLUniqueStableNameExpr()
1135 const UnaryExprOrTypeTraitExpr *Node) { in VisitUnaryExprOrTypeTraitExpr()
1154 const ExtVectorElementExpr *Node) { in VisitExtVectorElementExpr()
1165 const CompoundAssignOperator *Node) { in VisitCompoundAssignOperator()
1199 const CXXFunctionalCastExpr *Node) { in VisitCXXFunctionalCastExpr()
1233 const CXXBindTemporaryExpr *Node) { in VisitCXXBindTemporaryExpr()
1276 const MaterializeTemporaryExpr *Node) { in VisitMaterializeTemporaryExpr()
1377 const ObjCSubscriptRefExpr *Node) { in VisitObjCSubscriptRefExpr()
[all …]
/llvm-project-15.0.7/llvm/lib/BinaryFormat/
H A DAMDGPUMetadataVerifier.cpp30 msgpack::DocNode &Node, msgpack::Type SKind, in verifyScalar()
51 bool MetadataVerifier::verifyInteger(msgpack::DocNode &Node) { in verifyInteger()
82 return verifyEntry(MapNode, Key, Required, [=](msgpack::DocNode &Node) { in verifyScalarEntry()
94 bool MetadataVerifier::verifyKernelArgs(msgpack::DocNode &Node) { in verifyKernelArgs()
196 bool MetadataVerifier::verifyKernel(msgpack::DocNode &Node) { in verifyKernel()
228 return verifyArray(Node, [this](msgpack::DocNode &Node) { in verifyKernel()
234 [this](msgpack::DocNode &Node) { in verifyKernel()
236 [this](msgpack::DocNode &Node) { in verifyKernel()
243 [this](msgpack::DocNode &Node) { in verifyKernel()
298 return verifyArray(Node, [this](msgpack::DocNode &Node) { in verify()
[all …]
/llvm-project-15.0.7/clang/include/clang/Tooling/ASTDiff/
H A DASTDiff.h37 struct Node { struct
38 NodeId Parent, LeftMostDescendant, RightMostDescendant; argument
40 DynTypedNode ASTNode; argument
41 SmallVector<NodeId, 4> Children; argument
59 SyntaxTree(T *Node, ASTContext &AST) in SyntaxTree()
/llvm-project-15.0.7/libcxx/test/libcxx/containers/associative/
H A Dtree_right_rotate.pass.cpp21 struct Node struct
23 Node* __left_; argument
24 Node* __right_; argument
25 Node* __parent_; argument
27 Node* __parent_unsafe() const { return __parent_; } in __parent_unsafe() argument
28 void __set_parent(Node* x) { __parent_ = x;} in __set_parent() argument
30 Node() : __left_(), __right_(), __parent_() {} in Node() argument
H A Dtree_left_rotate.pass.cpp21 struct Node struct
23 Node* __left_; argument
24 Node* __right_; argument
25 Node* __parent_; argument
27 Node* __parent_unsafe() const { return __parent_; } in __parent_unsafe() argument
28 void __set_parent(Node* x) { __parent_ = x;} in __set_parent() argument
30 Node() : __left_(), __right_(), __parent_() {} in Node() argument
/llvm-project-15.0.7/libcxx/test/libcxx/memory/trivial_abi/
H A Dunique_ptr_arg.pass.cpp22 struct Node { struct
25 explicit Node(int* ptr) : shared_val(ptr) {} in Node() argument
26 ~Node() { ++(*shared_val); } in ~Node() argument
29 __attribute__((noinline)) bool get_val(std::unique_ptr<Node> /*unused*/) { in get_val()
H A Dshared_ptr_arg.pass.cpp23 struct Node { struct
26 explicit Node(int* ptr) : shared_val(ptr) {} in Node() argument
27 ~Node() { ++(*shared_val); } in ~Node() argument
30 __attribute__((noinline)) bool get_val(std::shared_ptr<Node> /*unused*/) { in get_val()
H A Dunique_ptr_array.pass.cpp23 struct Node { struct
26 explicit Node(int* ptr) : shared_val(ptr) {} in Node() function
27 ~Node() { ++(*shared_val); } in ~Node() argument
30 __attribute__((noinline)) bool get_val(std::unique_ptr<Node[]> /*unused*/) { in get_val()
H A Dunique_ptr_ret.pass.cpp22 struct Node { struct
23 explicit Node() {} in Node() argument
24 ~Node() {} in ~Node() argument
H A Dweak_ptr_ret.pass.cpp22 struct Node { struct
23 explicit Node() {} in Node() argument
24 ~Node() {} in ~Node() argument
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DSpillPlacement.cpp75 struct SpillPlacement::Node { struct in SpillPlacement
77 BlockFrequency BiasN;
80 BlockFrequency BiasP;
85 int Value;
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()
119 void addLink(unsigned b, BlockFrequency w) { in addLink()
[all …]
/llvm-project-15.0.7/clang/unittests/Tooling/
H A DASTSelectionTest.cpp128 const SelectedASTNode &Node; member
200 [](Optional<SelectedASTNode> Node) { in TEST()
224 [](Optional<SelectedASTNode> Node) { in TEST()
240 [](Optional<SelectedASTNode> Node) { in TEST()
256 [](Optional<SelectedASTNode> Node) { in TEST()
310 [](Optional<SelectedASTNode> Node) { in TEST()
331 [](Optional<SelectedASTNode> Node) { in TEST()
353 [](Optional<SelectedASTNode> Node) { in TEST()
401 [](Optional<SelectedASTNode> Node) { in TEST()
417 [](Optional<SelectedASTNode> Node) { in TEST()
[all …]
/llvm-project-15.0.7/clang-tools-extra/clangd/
H A DSelection.h122 struct Node { struct
124 Node *Parent; argument
126 llvm::SmallVector<const Node *> Children; argument
128 DynTypedNode ASTNode; argument
131 // Walk up the AST to get the lexical DeclContext of this Node, which is not argument
/llvm-project-15.0.7/lldb/source/Symbol/
H A DPostfixExpression.cpp117 bool Visit(BinaryOpNode &binary, Node *&) override { in Visit() argument
121 bool Visit(InitialValueNode &, Node *&) override { return true; } in Visit() argument
122 bool Visit(IntegerNode &, Node *&) override { return true; } in Visit() argument
123 bool Visit(RegisterNode &, Node *&) override { return true; } in Visit() argument
135 bool Visit(UnaryOpNode &unary, Node *&) override { in Visit() argument
153 void Visit(IntegerNode &integer, Node *&) override { in Visit() argument
161 void Visit(SymbolNode &symbol, Node *&) override { in Visit() argument
180 void DWARFCodegen::Visit(BinaryOpNode &binary, Node *&) { in Visit() argument
207 void DWARFCodegen::Visit(InitialValueNode &, Node *&) { in Visit() argument
216 void DWARFCodegen::Visit(RegisterNode &reg, Node *&) { in Visit() argument
[all …]
/llvm-project-15.0.7/clang/test/CXX/expr/expr.post/expr.ref/
H A Dp3.cpp4 template<typename T> struct Node { struct
8 Node<T> n[1]; in splay() argument
/llvm-project-15.0.7/llvm/lib/DebugInfo/Symbolize/
H A DMarkupFilter.cpp63 for (const MarkupNode &Node : DeferredNodes) in filter() local
69 while (Optional<MarkupNode> Node = Parser.nextNode()) in finish() local
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
237 bool MarkupFilter::tryPC(const MarkupNode &Node) { in tryPC()
372 bool MarkupFilter::tryData(const MarkupNode &Node) { in tryData()
[all …]
/llvm-project-15.0.7/clang/include/clang/AST/
H A DDeclContextInternals.h58 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
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/abseil/
H A DTimeSubtractionCheck.cpp32 const Expr *Node) { in isConstructorAssignment()
49 const Expr *Node) { in isArgument()
67 static bool isReturn(const MatchFinder::MatchResult &Result, const Expr *Node) { in isReturn()
82 const Expr *Node) { in parensRequired()
89 void TimeSubtractionCheck::emitDiagnostic(const Expr *Node, in emitDiagnostic()
H A DDurationRewriter.cpp72 DurationScale Scale, const Expr &Node) { in rewriteInverseDurationCall()
91 DurationScale Scale, const Expr &Node) { in rewriteInverseTimeCall()
160 bool isLiteralZero(const MatchFinder::MatchResult &Result, const Expr &Node) { in isLiteralZero()
187 const Expr &Node) { in stripFloatCast()
207 const Expr &Node) { in stripFloatLiteralFraction()
217 const Expr &Node) { in simplifyDurationFactoryArg()
271 const Expr *Node) { in rewriteExprFromNumberToDuration()
289 const Expr *Node) { in rewriteExprFromNumberToTime()
/llvm-project-15.0.7/clang/include/clang/Tooling/Transformer/
H A DSourceCode.h33 CharSourceRange getExtendedRange(const T &Node, tok::TokenKind Next, in getExtendedRange()
55 StringRef getText(const T &Node, const ASTContext &Context) { in getText()
83 StringRef getExtendedText(const T &Node, tok::TokenKind Next, in getExtendedText()
/llvm-project-15.0.7/clang-tools-extra/clangd/unittests/
H A DDumpASTTests.cpp148 auto Node = dumpAST(DynTypedNode::create(findUnqualifiedDecl(AST, "root")), in TEST() local
158 auto Node = dumpAST(DynTypedNode::create(findDecl(AST, "x")), AST.getTokens(), in TEST() local
169 auto Node = dumpAST( in TEST() local
180 auto Node = dumpAST(DynTypedNode::create(findDecl(AST, "x")), AST.getTokens(), in TEST() local
/llvm-project-15.0.7/clang/unittests/AST/
H A DMatchVerifier.h60 const NodeType &Node) {} in verify()
159 const NodeType *Node = Result.Nodes.getNodeAs<NodeType>(""); in run() local
197 const NodeType &Node) override { in verify()
212 virtual SourceLocation getLocation(const NodeType &Node) { in getLocation()
237 const NodeType &Node) override { in verify()
259 virtual SourceRange getRange(const NodeType &Node) { in getRange()
276 const DynTypedNode &Node) override { in verify()
303 const DynTypedNode &Node) override { in verify()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DAllocatorList.h34 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() function
46 using list_type = simple_ilist<Node>; argument
/llvm-project-15.0.7/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp80 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()

12345678910>>...15