1 //===--- DataRecursiveASTVisitor.h - Data-Recursive AST Visitor -*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the DataRecursiveASTVisitor interface, which recursively
11 // traverses the entire AST, using data recursion for Stmts/Exprs.
13 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_CLANG_AST_DATARECURSIVEASTVISITOR_H
15 #define LLVM_CLANG_AST_DATARECURSIVEASTVISITOR_H
17 #include "clang/AST/Attr.h"
18 #include "clang/AST/Decl.h"
19 #include "clang/AST/DeclCXX.h"
20 #include "clang/AST/DeclFriend.h"
21 #include "clang/AST/DeclObjC.h"
22 #include "clang/AST/DeclOpenMP.h"
23 #include "clang/AST/DeclTemplate.h"
24 #include "clang/AST/Expr.h"
25 #include "clang/AST/ExprCXX.h"
26 #include "clang/AST/ExprObjC.h"
27 #include "clang/AST/NestedNameSpecifier.h"
28 #include "clang/AST/Stmt.h"
29 #include "clang/AST/StmtCXX.h"
30 #include "clang/AST/StmtObjC.h"
31 #include "clang/AST/StmtOpenMP.h"
32 #include "clang/AST/TemplateBase.h"
33 #include "clang/AST/TemplateName.h"
34 #include "clang/AST/Type.h"
35 #include "clang/AST/TypeLoc.h"
37 // The following three macros are used for meta programming. The code
38 // using them is responsible for defining macro OPERATOR().
40 // All unary operators.
41 #define UNARYOP_LIST() \
42 OPERATOR(PostInc) OPERATOR(PostDec) OPERATOR(PreInc) OPERATOR(PreDec) \
43 OPERATOR(AddrOf) OPERATOR(Deref) OPERATOR(Plus) OPERATOR(Minus) \
44 OPERATOR(Not) OPERATOR(LNot) OPERATOR(Real) OPERATOR(Imag) \
47 // All binary operators (excluding compound assign operators).
48 #define BINOP_LIST() \
49 OPERATOR(PtrMemD) OPERATOR(PtrMemI) OPERATOR(Mul) OPERATOR(Div) \
50 OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) OPERATOR(Shl) OPERATOR(Shr) \
51 OPERATOR(LT) OPERATOR(GT) OPERATOR(LE) OPERATOR(GE) OPERATOR(EQ) \
52 OPERATOR(NE) OPERATOR(And) OPERATOR(Xor) OPERATOR(Or) OPERATOR(LAnd) \
53 OPERATOR(LOr) OPERATOR(Assign) OPERATOR(Comma)
55 // All compound assign operators.
57 OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) \
58 OPERATOR(Shl) OPERATOR(Shr) OPERATOR(And) OPERATOR(Or) OPERATOR(Xor)
62 // Reduce the diff between RecursiveASTVisitor / DataRecursiveASTVisitor to
63 // make it easier to track changes and keep the two in sync.
64 #define RecursiveASTVisitor DataRecursiveASTVisitor
66 // A helper macro to implement short-circuiting when recursing. It
67 // invokes CALL_EXPR, which must be a method call, on the derived
68 // object (s.t. a user of RecursiveASTVisitor can override the method
70 #define TRY_TO(CALL_EXPR) \
72 if (!getDerived().CALL_EXPR) \
76 /// \brief A class that does preorder depth-first traversal on the
77 /// entire Clang AST and visits each node.
79 /// This class performs three distinct tasks:
80 /// 1. traverse the AST (i.e. go to each node);
81 /// 2. at a given node, walk up the class hierarchy, starting from
82 /// the node's dynamic type, until the top-most class (e.g. Stmt,
83 /// Decl, or Type) is reached.
84 /// 3. given a (node, class) combination, where 'class' is some base
85 /// class of the dynamic type of 'node', call a user-overridable
86 /// function to actually visit the node.
88 /// These tasks are done by three groups of methods, respectively:
89 /// 1. TraverseDecl(Decl *x) does task #1. It is the entry point
90 /// for traversing an AST rooted at x. This method simply
91 /// dispatches (i.e. forwards) to TraverseFoo(Foo *x) where Foo
92 /// is the dynamic type of *x, which calls WalkUpFromFoo(x) and
93 /// then recursively visits the child nodes of x.
94 /// TraverseStmt(Stmt *x) and TraverseType(QualType x) work
96 /// 2. WalkUpFromFoo(Foo *x) does task #2. It does not try to visit
97 /// any child node of x. Instead, it first calls WalkUpFromBar(x)
98 /// where Bar is the direct parent class of Foo (unless Foo has
99 /// no parent), and then calls VisitFoo(x) (see the next list item).
100 /// 3. VisitFoo(Foo *x) does task #3.
102 /// These three method groups are tiered (Traverse* > WalkUpFrom* >
103 /// Visit*). A method (e.g. Traverse*) may call methods from the same
104 /// tier (e.g. other Traverse*) or one tier lower (e.g. WalkUpFrom*).
105 /// It may not call methods from a higher tier.
107 /// Note that since WalkUpFromFoo() calls WalkUpFromBar() (where Bar
108 /// is Foo's super class) before calling VisitFoo(), the result is
109 /// that the Visit*() methods for a given node are called in the
110 /// top-down order (e.g. for a node of type NamespaceDecl, the order will
111 /// be VisitDecl(), VisitNamedDecl(), and then VisitNamespaceDecl()).
113 /// This scheme guarantees that all Visit*() calls for the same AST
114 /// node are grouped together. In other words, Visit*() methods for
115 /// different nodes are never interleaved.
117 /// Stmts are traversed internally using a data queue to avoid a stack overflow
118 /// with hugely nested ASTs.
120 /// Clients of this visitor should subclass the visitor (providing
121 /// themselves as the template argument, using the curiously recurring
122 /// template pattern) and override any of the Traverse*, WalkUpFrom*,
123 /// and Visit* methods for declarations, types, statements,
124 /// expressions, or other AST nodes where the visitor should customize
125 /// behavior. Most users only need to override Visit*. Advanced
126 /// users may override Traverse* and WalkUpFrom* to implement custom
127 /// traversal strategies. Returning false from one of these overridden
128 /// functions will abort the entire traversal.
130 /// By default, this visitor tries to visit every part of the explicit
131 /// source code exactly once. The default policy towards templates
132 /// is to descend into the 'pattern' class or function body, not any
133 /// explicit or implicit instantiations. Explicit specializations
134 /// are still visited, and the patterns of partial specializations
135 /// are visited separately. This behavior can be changed by
136 /// overriding shouldVisitTemplateInstantiations() in the derived class
137 /// to return true, in which case all known implicit and explicit
138 /// instantiations will be visited at the same time as the pattern
139 /// from which they were produced.
140 template <typename Derived> class RecursiveASTVisitor {
142 /// \brief Return a reference to the derived class.
143 Derived &getDerived() { return *static_cast<Derived *>(this); }
145 /// \brief Return whether this visitor should recurse into
146 /// template instantiations.
147 bool shouldVisitTemplateInstantiations() const { return false; }
149 /// \brief Return whether this visitor should recurse into the types of
151 bool shouldWalkTypesOfTypeLocs() const { return true; }
153 /// \brief Recursively visit a statement or expression, by
154 /// dispatching to Traverse*() based on the argument's dynamic type.
156 /// \returns false if the visitation was terminated early, true
157 /// otherwise (including when the argument is NULL).
158 bool TraverseStmt(Stmt *S);
160 /// \brief Recursively visit a type, by dispatching to
161 /// Traverse*Type() based on the argument's getTypeClass() property.
163 /// \returns false if the visitation was terminated early, true
164 /// otherwise (including when the argument is a Null type).
165 bool TraverseType(QualType T);
167 /// \brief Recursively visit a type with location, by dispatching to
168 /// Traverse*TypeLoc() based on the argument type's getTypeClass() property.
170 /// \returns false if the visitation was terminated early, true
171 /// otherwise (including when the argument is a Null type location).
172 bool TraverseTypeLoc(TypeLoc TL);
174 /// \brief Recursively visit an attribute, by dispatching to
175 /// Traverse*Attr() based on the argument's dynamic type.
177 /// \returns false if the visitation was terminated early, true
178 /// otherwise (including when the argument is a Null type location).
179 bool TraverseAttr(Attr *At);
181 /// \brief Recursively visit a declaration, by dispatching to
182 /// Traverse*Decl() based on the argument's dynamic type.
184 /// \returns false if the visitation was terminated early, true
185 /// otherwise (including when the argument is NULL).
186 bool TraverseDecl(Decl *D);
188 /// \brief Recursively visit a C++ nested-name-specifier.
190 /// \returns false if the visitation was terminated early, true otherwise.
191 bool TraverseNestedNameSpecifier(NestedNameSpecifier *NNS);
193 /// \brief Recursively visit a C++ nested-name-specifier with location
196 /// \returns false if the visitation was terminated early, true otherwise.
197 bool TraverseNestedNameSpecifierLoc(NestedNameSpecifierLoc NNS);
199 /// \brief Recursively visit a name with its location information.
201 /// \returns false if the visitation was terminated early, true otherwise.
202 bool TraverseDeclarationNameInfo(DeclarationNameInfo NameInfo);
204 /// \brief Recursively visit a template name and dispatch to the
205 /// appropriate method.
207 /// \returns false if the visitation was terminated early, true otherwise.
208 bool TraverseTemplateName(TemplateName Template);
210 /// \brief Recursively visit a template argument and dispatch to the
211 /// appropriate method for the argument type.
213 /// \returns false if the visitation was terminated early, true otherwise.
214 // FIXME: migrate callers to TemplateArgumentLoc instead.
215 bool TraverseTemplateArgument(const TemplateArgument &Arg);
217 /// \brief Recursively visit a template argument location and dispatch to the
218 /// appropriate method for the argument type.
220 /// \returns false if the visitation was terminated early, true otherwise.
221 bool TraverseTemplateArgumentLoc(const TemplateArgumentLoc &ArgLoc);
223 /// \brief Recursively visit a set of template arguments.
224 /// This can be overridden by a subclass, but it's not expected that
225 /// will be needed -- this visitor always dispatches to another.
227 /// \returns false if the visitation was terminated early, true otherwise.
228 // FIXME: take a TemplateArgumentLoc* (or TemplateArgumentListInfo) instead.
229 bool TraverseTemplateArguments(const TemplateArgument *Args,
232 /// \brief Recursively visit a constructor initializer. This
233 /// automatically dispatches to another visitor for the initializer
234 /// expression, but not for the name of the initializer, so may
235 /// be overridden for clients that need access to the name.
237 /// \returns false if the visitation was terminated early, true otherwise.
238 bool TraverseConstructorInitializer(CXXCtorInitializer *Init);
240 /// \brief Recursively visit a lambda capture.
242 /// \returns false if the visitation was terminated early, true otherwise.
243 bool TraverseLambdaCapture(LambdaExpr *LE, const LambdaCapture *C);
245 /// \brief Recursively visit the body of a lambda expression.
247 /// This provides a hook for visitors that need more context when visiting
248 /// \c LE->getBody().
250 /// \returns false if the visitation was terminated early, true otherwise.
251 bool TraverseLambdaBody(LambdaExpr *LE);
253 // ---- Methods on Attrs ----
255 // \brief Visit an attribute.
256 bool VisitAttr(Attr *A) { return true; }
258 // Declare Traverse* and empty Visit* for all Attr classes.
259 #define ATTR_VISITOR_DECLS_ONLY
260 #include "clang/AST/AttrVisitor.inc"
261 #undef ATTR_VISITOR_DECLS_ONLY
263 // ---- Methods on Stmts ----
265 // Declare Traverse*() for all concrete Stmt classes.
266 #define ABSTRACT_STMT(STMT)
267 #define STMT(CLASS, PARENT) bool Traverse##CLASS(CLASS *S);
268 #include "clang/AST/StmtNodes.inc"
269 // The above header #undefs ABSTRACT_STMT and STMT upon exit.
271 // Define WalkUpFrom*() and empty Visit*() for all Stmt classes.
272 bool WalkUpFromStmt(Stmt *S) { return getDerived().VisitStmt(S); }
273 bool VisitStmt(Stmt *S) { return true; }
274 #define STMT(CLASS, PARENT) \
275 bool WalkUpFrom##CLASS(CLASS *S) { \
276 TRY_TO(WalkUpFrom##PARENT(S)); \
277 TRY_TO(Visit##CLASS(S)); \
280 bool Visit##CLASS(CLASS *S) { return true; }
281 #include "clang/AST/StmtNodes.inc"
283 // Define Traverse*(), WalkUpFrom*(), and Visit*() for unary
284 // operator methods. Unary operators are not classes in themselves
285 // (they're all opcodes in UnaryOperator) but do have visitors.
286 #define OPERATOR(NAME) \
287 bool TraverseUnary##NAME(UnaryOperator *S) { \
288 TRY_TO(WalkUpFromUnary##NAME(S)); \
289 StmtQueueAction StmtQueue(*this); \
290 StmtQueue.queue(S->getSubExpr()); \
293 bool WalkUpFromUnary##NAME(UnaryOperator *S) { \
294 TRY_TO(WalkUpFromUnaryOperator(S)); \
295 TRY_TO(VisitUnary##NAME(S)); \
298 bool VisitUnary##NAME(UnaryOperator *S) { return true; }
303 // Define Traverse*(), WalkUpFrom*(), and Visit*() for binary
304 // operator methods. Binary operators are not classes in themselves
305 // (they're all opcodes in BinaryOperator) but do have visitors.
306 #define GENERAL_BINOP_FALLBACK(NAME, BINOP_TYPE) \
307 bool TraverseBin##NAME(BINOP_TYPE *S) { \
308 TRY_TO(WalkUpFromBin##NAME(S)); \
309 StmtQueueAction StmtQueue(*this); \
310 StmtQueue.queue(S->getLHS()); \
311 StmtQueue.queue(S->getRHS()); \
314 bool WalkUpFromBin##NAME(BINOP_TYPE *S) { \
315 TRY_TO(WalkUpFrom##BINOP_TYPE(S)); \
316 TRY_TO(VisitBin##NAME(S)); \
319 bool VisitBin##NAME(BINOP_TYPE *S) { return true; }
321 #define OPERATOR(NAME) GENERAL_BINOP_FALLBACK(NAME, BinaryOperator)
325 // Define Traverse*(), WalkUpFrom*(), and Visit*() for compound
326 // assignment methods. Compound assignment operators are not
327 // classes in themselves (they're all opcodes in
328 // CompoundAssignOperator) but do have visitors.
329 #define OPERATOR(NAME) \
330 GENERAL_BINOP_FALLBACK(NAME##Assign, CompoundAssignOperator)
334 #undef GENERAL_BINOP_FALLBACK
336 // ---- Methods on Types ----
337 // FIXME: revamp to take TypeLoc's rather than Types.
339 // Declare Traverse*() for all concrete Type classes.
340 #define ABSTRACT_TYPE(CLASS, BASE)
341 #define TYPE(CLASS, BASE) bool Traverse##CLASS##Type(CLASS##Type *T);
342 #include "clang/AST/TypeNodes.def"
343 // The above header #undefs ABSTRACT_TYPE and TYPE upon exit.
345 // Define WalkUpFrom*() and empty Visit*() for all Type classes.
346 bool WalkUpFromType(Type *T) { return getDerived().VisitType(T); }
347 bool VisitType(Type *T) { return true; }
348 #define TYPE(CLASS, BASE) \
349 bool WalkUpFrom##CLASS##Type(CLASS##Type *T) { \
350 TRY_TO(WalkUpFrom##BASE(T)); \
351 TRY_TO(Visit##CLASS##Type(T)); \
354 bool Visit##CLASS##Type(CLASS##Type *T) { return true; }
355 #include "clang/AST/TypeNodes.def"
357 // ---- Methods on TypeLocs ----
358 // FIXME: this currently just calls the matching Type methods
360 // Declare Traverse*() for all concrete TypeLoc classes.
361 #define ABSTRACT_TYPELOC(CLASS, BASE)
362 #define TYPELOC(CLASS, BASE) bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL);
363 #include "clang/AST/TypeLocNodes.def"
364 // The above header #undefs ABSTRACT_TYPELOC and TYPELOC upon exit.
366 // Define WalkUpFrom*() and empty Visit*() for all TypeLoc classes.
367 bool WalkUpFromTypeLoc(TypeLoc TL) { return getDerived().VisitTypeLoc(TL); }
368 bool VisitTypeLoc(TypeLoc TL) { return true; }
370 // QualifiedTypeLoc and UnqualTypeLoc are not declared in
371 // TypeNodes.def and thus need to be handled specially.
372 bool WalkUpFromQualifiedTypeLoc(QualifiedTypeLoc TL) {
373 return getDerived().VisitUnqualTypeLoc(TL.getUnqualifiedLoc());
375 bool VisitQualifiedTypeLoc(QualifiedTypeLoc TL) { return true; }
376 bool WalkUpFromUnqualTypeLoc(UnqualTypeLoc TL) {
377 return getDerived().VisitUnqualTypeLoc(TL.getUnqualifiedLoc());
379 bool VisitUnqualTypeLoc(UnqualTypeLoc TL) { return true; }
381 // Note that BASE includes trailing 'Type' which CLASS doesn't.
382 #define TYPE(CLASS, BASE) \
383 bool WalkUpFrom##CLASS##TypeLoc(CLASS##TypeLoc TL) { \
384 TRY_TO(WalkUpFrom##BASE##Loc(TL)); \
385 TRY_TO(Visit##CLASS##TypeLoc(TL)); \
388 bool Visit##CLASS##TypeLoc(CLASS##TypeLoc TL) { return true; }
389 #include "clang/AST/TypeNodes.def"
391 // ---- Methods on Decls ----
393 // Declare Traverse*() for all concrete Decl classes.
394 #define ABSTRACT_DECL(DECL)
395 #define DECL(CLASS, BASE) bool Traverse##CLASS##Decl(CLASS##Decl *D);
396 #include "clang/AST/DeclNodes.inc"
397 // The above header #undefs ABSTRACT_DECL and DECL upon exit.
399 // Define WalkUpFrom*() and empty Visit*() for all Decl classes.
400 bool WalkUpFromDecl(Decl *D) { return getDerived().VisitDecl(D); }
401 bool VisitDecl(Decl *D) { return true; }
402 #define DECL(CLASS, BASE) \
403 bool WalkUpFrom##CLASS##Decl(CLASS##Decl *D) { \
404 TRY_TO(WalkUpFrom##BASE(D)); \
405 TRY_TO(Visit##CLASS##Decl(D)); \
408 bool Visit##CLASS##Decl(CLASS##Decl *D) { return true; }
409 #include "clang/AST/DeclNodes.inc"
412 // These are helper methods used by more than one Traverse* method.
413 bool TraverseTemplateParameterListHelper(TemplateParameterList *TPL);
414 bool TraverseClassInstantiations(ClassTemplateDecl *D);
415 bool TraverseVariableInstantiations(VarTemplateDecl *D);
416 bool TraverseFunctionInstantiations(FunctionTemplateDecl *D);
417 bool TraverseTemplateArgumentLocsHelper(const TemplateArgumentLoc *TAL,
419 bool TraverseArrayTypeLocHelper(ArrayTypeLoc TL);
420 bool TraverseRecordHelper(RecordDecl *D);
421 bool TraverseCXXRecordHelper(CXXRecordDecl *D);
422 bool TraverseDeclaratorHelper(DeclaratorDecl *D);
423 bool TraverseDeclContextHelper(DeclContext *DC);
424 bool TraverseFunctionHelper(FunctionDecl *D);
425 bool TraverseVarHelper(VarDecl *D);
426 bool TraverseOMPExecutableDirective(OMPExecutableDirective *S);
427 bool TraverseOMPLoopDirective(OMPLoopDirective *S);
428 bool TraverseOMPClause(OMPClause *C);
429 #define OPENMP_CLAUSE(Name, Class) bool Visit##Class(Class *C);
430 #include "clang/Basic/OpenMPKinds.def"
431 /// \brief Process clauses with list of variables.
432 template <typename T> bool VisitOMPClauseList(T *Node);
434 typedef SmallVector<Stmt *, 16> StmtsTy;
435 typedef SmallVector<StmtsTy *, 4> QueuesTy;
440 RecursiveASTVisitor &RAV;
443 NewQueueRAII(StmtsTy &queue, RecursiveASTVisitor &RAV) : RAV(RAV) {
444 RAV.Queues.push_back(&queue);
446 ~NewQueueRAII() { RAV.Queues.pop_back(); }
449 StmtsTy &getCurrentQueue() {
450 assert(!Queues.empty() && "base TraverseStmt was never called?");
451 return *Queues.back();
455 class StmtQueueAction {
459 explicit StmtQueueAction(RecursiveASTVisitor &RAV)
460 : CurrQueue(RAV.getCurrentQueue()) {}
462 void queue(Stmt *S) { CurrQueue.push_back(S); }
466 #define DISPATCH(NAME, CLASS, VAR) \
467 return getDerived().Traverse##NAME(static_cast<CLASS *>(VAR))
469 template <typename Derived>
470 bool RecursiveASTVisitor<Derived>::TraverseStmt(Stmt *S) {
474 StmtsTy Queue, StmtsToEnqueue;
476 NewQueueRAII NQ(StmtsToEnqueue, *this);
478 while (!Queue.empty()) {
479 S = Queue.pop_back_val();
483 StmtsToEnqueue.clear();
485 #define DISPATCH_STMT(NAME, CLASS, VAR) \
486 TRY_TO(Traverse##NAME(static_cast<CLASS *>(VAR))); \
489 // If we have a binary expr, dispatch to the subcode of the binop. A smart
490 // optimizer (e.g. LLVM) will fold this comparison into the switch stmt
492 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(S)) {
493 switch (BinOp->getOpcode()) {
494 #define OPERATOR(NAME) \
496 DISPATCH_STMT(Bin##NAME, BinaryOperator, S);
502 #define OPERATOR(NAME) \
503 case BO_##NAME##Assign: \
504 DISPATCH_STMT(Bin##NAME##Assign, CompoundAssignOperator, S);
510 } else if (UnaryOperator *UnOp = dyn_cast<UnaryOperator>(S)) {
511 switch (UnOp->getOpcode()) {
512 #define OPERATOR(NAME) \
514 DISPATCH_STMT(Unary##NAME, UnaryOperator, S);
522 // Top switch stmt: dispatch to TraverseFooStmt for each concrete FooStmt.
523 switch (S->getStmtClass()) {
524 case Stmt::NoStmtClass:
526 #define ABSTRACT_STMT(STMT)
527 #define STMT(CLASS, PARENT) \
528 case Stmt::CLASS##Class: \
529 DISPATCH_STMT(CLASS, CLASS, S);
530 #include "clang/AST/StmtNodes.inc"
534 for (SmallVectorImpl<Stmt *>::reverse_iterator RI = StmtsToEnqueue.rbegin(),
535 RE = StmtsToEnqueue.rend();
537 Queue.push_back(*RI);
545 template <typename Derived>
546 bool RecursiveASTVisitor<Derived>::TraverseType(QualType T) {
550 switch (T->getTypeClass()) {
551 #define ABSTRACT_TYPE(CLASS, BASE)
552 #define TYPE(CLASS, BASE) \
554 DISPATCH(CLASS##Type, CLASS##Type, const_cast<Type *>(T.getTypePtr()));
555 #include "clang/AST/TypeNodes.def"
561 template <typename Derived>
562 bool RecursiveASTVisitor<Derived>::TraverseTypeLoc(TypeLoc TL) {
566 switch (TL.getTypeLocClass()) {
567 #define ABSTRACT_TYPELOC(CLASS, BASE)
568 #define TYPELOC(CLASS, BASE) \
569 case TypeLoc::CLASS: \
570 return getDerived().Traverse##CLASS##TypeLoc(TL.castAs<CLASS##TypeLoc>());
571 #include "clang/AST/TypeLocNodes.def"
577 // Define the Traverse*Attr(Attr* A) methods
578 #define VISITORCLASS RecursiveASTVisitor
579 #include "clang/AST/AttrVisitor.inc"
582 template <typename Derived>
583 bool RecursiveASTVisitor<Derived>::TraverseDecl(Decl *D) {
587 // As a syntax visitor, we want to ignore declarations for
588 // implicitly-defined declarations (ones not typed explicitly by the
593 switch (D->getKind()) {
594 #define ABSTRACT_DECL(DECL)
595 #define DECL(CLASS, BASE) \
597 if (!getDerived().Traverse##CLASS##Decl(static_cast<CLASS##Decl *>(D))) \
600 #include "clang/AST/DeclNodes.inc"
603 // Visit any attributes attached to this declaration.
604 for (auto *I : D->attrs()) {
605 if (!getDerived().TraverseAttr(I))
613 template <typename Derived>
614 bool RecursiveASTVisitor<Derived>::TraverseNestedNameSpecifier(
615 NestedNameSpecifier *NNS) {
619 if (NNS->getPrefix())
620 TRY_TO(TraverseNestedNameSpecifier(NNS->getPrefix()));
622 switch (NNS->getKind()) {
623 case NestedNameSpecifier::Identifier:
624 case NestedNameSpecifier::Namespace:
625 case NestedNameSpecifier::NamespaceAlias:
626 case NestedNameSpecifier::Global:
627 case NestedNameSpecifier::Super:
630 case NestedNameSpecifier::TypeSpec:
631 case NestedNameSpecifier::TypeSpecWithTemplate:
632 TRY_TO(TraverseType(QualType(NNS->getAsType(), 0)));
638 template <typename Derived>
639 bool RecursiveASTVisitor<Derived>::TraverseNestedNameSpecifierLoc(
640 NestedNameSpecifierLoc NNS) {
644 if (NestedNameSpecifierLoc Prefix = NNS.getPrefix())
645 TRY_TO(TraverseNestedNameSpecifierLoc(Prefix));
647 switch (NNS.getNestedNameSpecifier()->getKind()) {
648 case NestedNameSpecifier::Identifier:
649 case NestedNameSpecifier::Namespace:
650 case NestedNameSpecifier::NamespaceAlias:
651 case NestedNameSpecifier::Global:
652 case NestedNameSpecifier::Super:
655 case NestedNameSpecifier::TypeSpec:
656 case NestedNameSpecifier::TypeSpecWithTemplate:
657 TRY_TO(TraverseTypeLoc(NNS.getTypeLoc()));
664 template <typename Derived>
665 bool RecursiveASTVisitor<Derived>::TraverseDeclarationNameInfo(
666 DeclarationNameInfo NameInfo) {
667 switch (NameInfo.getName().getNameKind()) {
668 case DeclarationName::CXXConstructorName:
669 case DeclarationName::CXXDestructorName:
670 case DeclarationName::CXXConversionFunctionName:
671 if (TypeSourceInfo *TSInfo = NameInfo.getNamedTypeInfo())
672 TRY_TO(TraverseTypeLoc(TSInfo->getTypeLoc()));
676 case DeclarationName::Identifier:
677 case DeclarationName::ObjCZeroArgSelector:
678 case DeclarationName::ObjCOneArgSelector:
679 case DeclarationName::ObjCMultiArgSelector:
680 case DeclarationName::CXXOperatorName:
681 case DeclarationName::CXXLiteralOperatorName:
682 case DeclarationName::CXXUsingDirective:
689 template <typename Derived>
690 bool RecursiveASTVisitor<Derived>::TraverseTemplateName(TemplateName Template) {
691 if (DependentTemplateName *DTN = Template.getAsDependentTemplateName())
692 TRY_TO(TraverseNestedNameSpecifier(DTN->getQualifier()));
693 else if (QualifiedTemplateName *QTN = Template.getAsQualifiedTemplateName())
694 TRY_TO(TraverseNestedNameSpecifier(QTN->getQualifier()));
699 template <typename Derived>
700 bool RecursiveASTVisitor<Derived>::TraverseTemplateArgument(
701 const TemplateArgument &Arg) {
702 switch (Arg.getKind()) {
703 case TemplateArgument::Null:
704 case TemplateArgument::Declaration:
705 case TemplateArgument::Integral:
706 case TemplateArgument::NullPtr:
709 case TemplateArgument::Type:
710 return getDerived().TraverseType(Arg.getAsType());
712 case TemplateArgument::Template:
713 case TemplateArgument::TemplateExpansion:
714 return getDerived().TraverseTemplateName(
715 Arg.getAsTemplateOrTemplatePattern());
717 case TemplateArgument::Expression:
718 return getDerived().TraverseStmt(Arg.getAsExpr());
720 case TemplateArgument::Pack:
721 return getDerived().TraverseTemplateArguments(Arg.pack_begin(),
728 // FIXME: no template name location?
729 // FIXME: no source locations for a template argument pack?
730 template <typename Derived>
731 bool RecursiveASTVisitor<Derived>::TraverseTemplateArgumentLoc(
732 const TemplateArgumentLoc &ArgLoc) {
733 const TemplateArgument &Arg = ArgLoc.getArgument();
735 switch (Arg.getKind()) {
736 case TemplateArgument::Null:
737 case TemplateArgument::Declaration:
738 case TemplateArgument::Integral:
739 case TemplateArgument::NullPtr:
742 case TemplateArgument::Type: {
743 // FIXME: how can TSI ever be NULL?
744 if (TypeSourceInfo *TSI = ArgLoc.getTypeSourceInfo())
745 return getDerived().TraverseTypeLoc(TSI->getTypeLoc());
747 return getDerived().TraverseType(Arg.getAsType());
750 case TemplateArgument::Template:
751 case TemplateArgument::TemplateExpansion:
752 if (ArgLoc.getTemplateQualifierLoc())
753 TRY_TO(getDerived().TraverseNestedNameSpecifierLoc(
754 ArgLoc.getTemplateQualifierLoc()));
755 return getDerived().TraverseTemplateName(
756 Arg.getAsTemplateOrTemplatePattern());
758 case TemplateArgument::Expression:
759 return getDerived().TraverseStmt(ArgLoc.getSourceExpression());
761 case TemplateArgument::Pack:
762 return getDerived().TraverseTemplateArguments(Arg.pack_begin(),
769 template <typename Derived>
770 bool RecursiveASTVisitor<Derived>::TraverseTemplateArguments(
771 const TemplateArgument *Args, unsigned NumArgs) {
772 for (unsigned I = 0; I != NumArgs; ++I) {
773 TRY_TO(TraverseTemplateArgument(Args[I]));
779 template <typename Derived>
780 bool RecursiveASTVisitor<Derived>::TraverseConstructorInitializer(
781 CXXCtorInitializer *Init) {
782 if (TypeSourceInfo *TInfo = Init->getTypeSourceInfo())
783 TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));
785 if (Init->isWritten())
786 TRY_TO(TraverseStmt(Init->getInit()));
790 template <typename Derived>
792 RecursiveASTVisitor<Derived>::TraverseLambdaCapture(LambdaExpr *LE,
793 const LambdaCapture *C) {
794 if (LE->isInitCapture(C))
795 TRY_TO(TraverseDecl(C->getCapturedVar()));
799 template <typename Derived>
800 bool RecursiveASTVisitor<Derived>::TraverseLambdaBody(LambdaExpr *LE) {
801 StmtQueueAction StmtQueue(*this);
802 StmtQueue.queue(LE->getBody());
806 // ----------------- Type traversal -----------------
808 // This macro makes available a variable T, the passed-in type.
809 #define DEF_TRAVERSE_TYPE(TYPE, CODE) \
810 template <typename Derived> \
811 bool RecursiveASTVisitor<Derived>::Traverse##TYPE(TYPE *T) { \
812 TRY_TO(WalkUpFrom##TYPE(T)); \
817 DEF_TRAVERSE_TYPE(BuiltinType, {})
819 DEF_TRAVERSE_TYPE(ComplexType, { TRY_TO(TraverseType(T->getElementType())); })
821 DEF_TRAVERSE_TYPE(PointerType, { TRY_TO(TraverseType(T->getPointeeType())); })
823 DEF_TRAVERSE_TYPE(BlockPointerType,
824 { TRY_TO(TraverseType(T->getPointeeType())); })
826 DEF_TRAVERSE_TYPE(LValueReferenceType,
827 { TRY_TO(TraverseType(T->getPointeeType())); })
829 DEF_TRAVERSE_TYPE(RValueReferenceType,
830 { TRY_TO(TraverseType(T->getPointeeType())); })
832 DEF_TRAVERSE_TYPE(MemberPointerType, {
833 TRY_TO(TraverseType(QualType(T->getClass(), 0)));
834 TRY_TO(TraverseType(T->getPointeeType()));
837 DEF_TRAVERSE_TYPE(AdjustedType, { TRY_TO(TraverseType(T->getOriginalType())); })
839 DEF_TRAVERSE_TYPE(DecayedType, { TRY_TO(TraverseType(T->getOriginalType())); })
841 DEF_TRAVERSE_TYPE(ConstantArrayType,
842 { TRY_TO(TraverseType(T->getElementType())); })
844 DEF_TRAVERSE_TYPE(IncompleteArrayType,
845 { TRY_TO(TraverseType(T->getElementType())); })
847 DEF_TRAVERSE_TYPE(VariableArrayType, {
848 TRY_TO(TraverseType(T->getElementType()));
849 TRY_TO(TraverseStmt(T->getSizeExpr()));
852 DEF_TRAVERSE_TYPE(DependentSizedArrayType, {
853 TRY_TO(TraverseType(T->getElementType()));
854 if (T->getSizeExpr())
855 TRY_TO(TraverseStmt(T->getSizeExpr()));
858 DEF_TRAVERSE_TYPE(DependentSizedExtVectorType, {
859 if (T->getSizeExpr())
860 TRY_TO(TraverseStmt(T->getSizeExpr()));
861 TRY_TO(TraverseType(T->getElementType()));
864 DEF_TRAVERSE_TYPE(VectorType, { TRY_TO(TraverseType(T->getElementType())); })
866 DEF_TRAVERSE_TYPE(ExtVectorType, { TRY_TO(TraverseType(T->getElementType())); })
868 DEF_TRAVERSE_TYPE(FunctionNoProtoType,
869 { TRY_TO(TraverseType(T->getReturnType())); })
871 DEF_TRAVERSE_TYPE(FunctionProtoType, {
872 TRY_TO(TraverseType(T->getReturnType()));
874 for (const auto &A : T->param_types()) {
875 TRY_TO(TraverseType(A));
878 for (const auto &E : T->exceptions()) {
879 TRY_TO(TraverseType(E));
882 if (Expr *NE = T->getNoexceptExpr())
883 TRY_TO(TraverseStmt(NE));
886 DEF_TRAVERSE_TYPE(UnresolvedUsingType, {})
887 DEF_TRAVERSE_TYPE(TypedefType, {})
889 DEF_TRAVERSE_TYPE(TypeOfExprType,
890 { TRY_TO(TraverseStmt(T->getUnderlyingExpr())); })
892 DEF_TRAVERSE_TYPE(TypeOfType, { TRY_TO(TraverseType(T->getUnderlyingType())); })
894 DEF_TRAVERSE_TYPE(DecltypeType,
895 { TRY_TO(TraverseStmt(T->getUnderlyingExpr())); })
897 DEF_TRAVERSE_TYPE(UnaryTransformType, {
898 TRY_TO(TraverseType(T->getBaseType()));
899 TRY_TO(TraverseType(T->getUnderlyingType()));
902 DEF_TRAVERSE_TYPE(AutoType, { TRY_TO(TraverseType(T->getDeducedType())); })
904 DEF_TRAVERSE_TYPE(RecordType, {})
905 DEF_TRAVERSE_TYPE(EnumType, {})
906 DEF_TRAVERSE_TYPE(TemplateTypeParmType, {})
907 DEF_TRAVERSE_TYPE(SubstTemplateTypeParmType, {})
908 DEF_TRAVERSE_TYPE(SubstTemplateTypeParmPackType, {})
910 DEF_TRAVERSE_TYPE(TemplateSpecializationType, {
911 TRY_TO(TraverseTemplateName(T->getTemplateName()));
912 TRY_TO(TraverseTemplateArguments(T->getArgs(), T->getNumArgs()));
915 DEF_TRAVERSE_TYPE(InjectedClassNameType, {})
917 DEF_TRAVERSE_TYPE(AttributedType,
918 { TRY_TO(TraverseType(T->getModifiedType())); })
920 DEF_TRAVERSE_TYPE(ParenType, { TRY_TO(TraverseType(T->getInnerType())); })
922 DEF_TRAVERSE_TYPE(ElaboratedType, {
923 if (T->getQualifier()) {
924 TRY_TO(TraverseNestedNameSpecifier(T->getQualifier()));
926 TRY_TO(TraverseType(T->getNamedType()));
929 DEF_TRAVERSE_TYPE(DependentNameType,
930 { TRY_TO(TraverseNestedNameSpecifier(T->getQualifier())); })
932 DEF_TRAVERSE_TYPE(DependentTemplateSpecializationType, {
933 TRY_TO(TraverseNestedNameSpecifier(T->getQualifier()));
934 TRY_TO(TraverseTemplateArguments(T->getArgs(), T->getNumArgs()));
937 DEF_TRAVERSE_TYPE(PackExpansionType, { TRY_TO(TraverseType(T->getPattern())); })
939 DEF_TRAVERSE_TYPE(ObjCInterfaceType, {})
941 DEF_TRAVERSE_TYPE(ObjCObjectType, {
942 // We have to watch out here because an ObjCInterfaceType's base
944 if (T->getBaseType().getTypePtr() != T)
945 TRY_TO(TraverseType(T->getBaseType()));
948 DEF_TRAVERSE_TYPE(ObjCObjectPointerType,
949 { TRY_TO(TraverseType(T->getPointeeType())); })
951 DEF_TRAVERSE_TYPE(AtomicType, { TRY_TO(TraverseType(T->getValueType())); })
953 #undef DEF_TRAVERSE_TYPE
955 // ----------------- TypeLoc traversal -----------------
957 // This macro makes available a variable TL, the passed-in TypeLoc.
958 // If requested, it calls WalkUpFrom* for the Type in the given TypeLoc,
959 // in addition to WalkUpFrom* for the TypeLoc itself, such that existing
960 // clients that override the WalkUpFrom*Type() and/or Visit*Type() methods
962 #define DEF_TRAVERSE_TYPELOC(TYPE, CODE) \
963 template <typename Derived> \
964 bool RecursiveASTVisitor<Derived>::Traverse##TYPE##Loc(TYPE##Loc TL) { \
965 if (getDerived().shouldWalkTypesOfTypeLocs()) \
966 TRY_TO(WalkUpFrom##TYPE(const_cast<TYPE *>(TL.getTypePtr()))); \
967 TRY_TO(WalkUpFrom##TYPE##Loc(TL)); \
972 template <typename Derived>
974 RecursiveASTVisitor<Derived>::TraverseQualifiedTypeLoc(QualifiedTypeLoc TL) {
975 // Move this over to the 'main' typeloc tree. Note that this is a
976 // move -- we pretend that we were really looking at the unqualified
977 // typeloc all along -- rather than a recursion, so we don't follow
978 // the normal CRTP plan of going through
979 // getDerived().TraverseTypeLoc. If we did, we'd be traversing
980 // twice for the same type (once as a QualifiedTypeLoc version of
981 // the type, once as an UnqualifiedTypeLoc version of the type),
982 // which in effect means we'd call VisitTypeLoc twice with the
983 // 'same' type. This solves that problem, at the cost of never
984 // seeing the qualified version of the type (unless the client
985 // subclasses TraverseQualifiedTypeLoc themselves). It's not a
986 // perfect solution. A perfect solution probably requires making
987 // QualifiedTypeLoc a wrapper around TypeLoc -- like QualType is a
988 // wrapper around Type* -- rather than being its own class in the
990 return TraverseTypeLoc(TL.getUnqualifiedLoc());
993 DEF_TRAVERSE_TYPELOC(BuiltinType, {})
995 // FIXME: ComplexTypeLoc is unfinished
996 DEF_TRAVERSE_TYPELOC(ComplexType, {
997 TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));
1000 DEF_TRAVERSE_TYPELOC(PointerType,
1001 { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })
1003 DEF_TRAVERSE_TYPELOC(BlockPointerType,
1004 { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })
1006 DEF_TRAVERSE_TYPELOC(LValueReferenceType,
1007 { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })
1009 DEF_TRAVERSE_TYPELOC(RValueReferenceType,
1010 { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })
1012 // FIXME: location of base class?
1013 // We traverse this in the type case as well, but how is it not reached through
1014 // the pointee type?
1015 DEF_TRAVERSE_TYPELOC(MemberPointerType, {
1016 TRY_TO(TraverseType(QualType(TL.getTypePtr()->getClass(), 0)));
1017 TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));
1020 DEF_TRAVERSE_TYPELOC(AdjustedType,
1021 { TRY_TO(TraverseTypeLoc(TL.getOriginalLoc())); })
1023 DEF_TRAVERSE_TYPELOC(DecayedType,
1024 { TRY_TO(TraverseTypeLoc(TL.getOriginalLoc())); })
1026 template <typename Derived>
1027 bool RecursiveASTVisitor<Derived>::TraverseArrayTypeLocHelper(ArrayTypeLoc TL) {
1028 // This isn't available for ArrayType, but is for the ArrayTypeLoc.
1029 TRY_TO(TraverseStmt(TL.getSizeExpr()));
1033 DEF_TRAVERSE_TYPELOC(ConstantArrayType, {
1034 TRY_TO(TraverseTypeLoc(TL.getElementLoc()));
1035 return TraverseArrayTypeLocHelper(TL);
1038 DEF_TRAVERSE_TYPELOC(IncompleteArrayType, {
1039 TRY_TO(TraverseTypeLoc(TL.getElementLoc()));
1040 return TraverseArrayTypeLocHelper(TL);
1043 DEF_TRAVERSE_TYPELOC(VariableArrayType, {
1044 TRY_TO(TraverseTypeLoc(TL.getElementLoc()));
1045 return TraverseArrayTypeLocHelper(TL);
1048 DEF_TRAVERSE_TYPELOC(DependentSizedArrayType, {
1049 TRY_TO(TraverseTypeLoc(TL.getElementLoc()));
1050 return TraverseArrayTypeLocHelper(TL);
1053 // FIXME: order? why not size expr first?
1054 // FIXME: base VectorTypeLoc is unfinished
1055 DEF_TRAVERSE_TYPELOC(DependentSizedExtVectorType, {
1056 if (TL.getTypePtr()->getSizeExpr())
1057 TRY_TO(TraverseStmt(TL.getTypePtr()->getSizeExpr()));
1058 TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));
1061 // FIXME: VectorTypeLoc is unfinished
1062 DEF_TRAVERSE_TYPELOC(VectorType, {
1063 TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));
1066 // FIXME: size and attributes
1067 // FIXME: base VectorTypeLoc is unfinished
1068 DEF_TRAVERSE_TYPELOC(ExtVectorType, {
1069 TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));
1072 DEF_TRAVERSE_TYPELOC(FunctionNoProtoType,
1073 { TRY_TO(TraverseTypeLoc(TL.getReturnLoc())); })
1075 // FIXME: location of exception specifications (attributes?)
1076 DEF_TRAVERSE_TYPELOC(FunctionProtoType, {
1077 TRY_TO(TraverseTypeLoc(TL.getReturnLoc()));
1079 const FunctionProtoType *T = TL.getTypePtr();
1081 for (unsigned I = 0, E = TL.getNumParams(); I != E; ++I) {
1082 if (TL.getParam(I)) {
1083 TRY_TO(TraverseDecl(TL.getParam(I)));
1084 } else if (I < T->getNumParams()) {
1085 TRY_TO(TraverseType(T->getParamType(I)));
1089 for (const auto &E : T->exceptions()) {
1090 TRY_TO(TraverseType(E));
1093 if (Expr *NE = T->getNoexceptExpr())
1094 TRY_TO(TraverseStmt(NE));
1097 DEF_TRAVERSE_TYPELOC(UnresolvedUsingType, {})
1098 DEF_TRAVERSE_TYPELOC(TypedefType, {})
1100 DEF_TRAVERSE_TYPELOC(TypeOfExprType,
1101 { TRY_TO(TraverseStmt(TL.getUnderlyingExpr())); })
1103 DEF_TRAVERSE_TYPELOC(TypeOfType, {
1104 TRY_TO(TraverseTypeLoc(TL.getUnderlyingTInfo()->getTypeLoc()));
1107 // FIXME: location of underlying expr
1108 DEF_TRAVERSE_TYPELOC(DecltypeType, {
1109 TRY_TO(TraverseStmt(TL.getTypePtr()->getUnderlyingExpr()));
1112 DEF_TRAVERSE_TYPELOC(UnaryTransformType, {
1113 TRY_TO(TraverseTypeLoc(TL.getUnderlyingTInfo()->getTypeLoc()));
1116 DEF_TRAVERSE_TYPELOC(AutoType, {
1117 TRY_TO(TraverseType(TL.getTypePtr()->getDeducedType()));
1120 DEF_TRAVERSE_TYPELOC(RecordType, {})
1121 DEF_TRAVERSE_TYPELOC(EnumType, {})
1122 DEF_TRAVERSE_TYPELOC(TemplateTypeParmType, {})
1123 DEF_TRAVERSE_TYPELOC(SubstTemplateTypeParmType, {})
1124 DEF_TRAVERSE_TYPELOC(SubstTemplateTypeParmPackType, {})
1126 // FIXME: use the loc for the template name?
1127 DEF_TRAVERSE_TYPELOC(TemplateSpecializationType, {
1128 TRY_TO(TraverseTemplateName(TL.getTypePtr()->getTemplateName()));
1129 for (unsigned I = 0, E = TL.getNumArgs(); I != E; ++I) {
1130 TRY_TO(TraverseTemplateArgumentLoc(TL.getArgLoc(I)));
1134 DEF_TRAVERSE_TYPELOC(InjectedClassNameType, {})
1136 DEF_TRAVERSE_TYPELOC(ParenType, { TRY_TO(TraverseTypeLoc(TL.getInnerLoc())); })
1138 DEF_TRAVERSE_TYPELOC(AttributedType,
1139 { TRY_TO(TraverseTypeLoc(TL.getModifiedLoc())); })
1141 DEF_TRAVERSE_TYPELOC(ElaboratedType, {
1142 if (TL.getQualifierLoc()) {
1143 TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));
1145 TRY_TO(TraverseTypeLoc(TL.getNamedTypeLoc()));
1148 DEF_TRAVERSE_TYPELOC(DependentNameType, {
1149 TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));
1152 DEF_TRAVERSE_TYPELOC(DependentTemplateSpecializationType, {
1153 if (TL.getQualifierLoc()) {
1154 TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));
1157 for (unsigned I = 0, E = TL.getNumArgs(); I != E; ++I) {
1158 TRY_TO(TraverseTemplateArgumentLoc(TL.getArgLoc(I)));
1162 DEF_TRAVERSE_TYPELOC(PackExpansionType,
1163 { TRY_TO(TraverseTypeLoc(TL.getPatternLoc())); })
1165 DEF_TRAVERSE_TYPELOC(ObjCInterfaceType, {})
1167 DEF_TRAVERSE_TYPELOC(ObjCObjectType, {
1168 // We have to watch out here because an ObjCInterfaceType's base
1170 if (TL.getTypePtr()->getBaseType().getTypePtr() != TL.getTypePtr())
1171 TRY_TO(TraverseTypeLoc(TL.getBaseLoc()));
1174 DEF_TRAVERSE_TYPELOC(ObjCObjectPointerType,
1175 { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })
1177 DEF_TRAVERSE_TYPELOC(AtomicType, { TRY_TO(TraverseTypeLoc(TL.getValueLoc())); })
1179 #undef DEF_TRAVERSE_TYPELOC
1181 // ----------------- Decl traversal -----------------
1183 // For a Decl, we automate (in the DEF_TRAVERSE_DECL macro) traversing
1184 // the children that come from the DeclContext associated with it.
1185 // Therefore each Traverse* only needs to worry about children other
1188 template <typename Derived>
1189 bool RecursiveASTVisitor<Derived>::TraverseDeclContextHelper(DeclContext *DC) {
1193 for (auto *Child : DC->decls()) {
1194 // BlockDecls and CapturedDecls are traversed through BlockExprs and
1195 // CapturedStmts respectively.
1196 if (!isa<BlockDecl>(Child) && !isa<CapturedDecl>(Child))
1197 TRY_TO(TraverseDecl(Child));
1203 // This macro makes available a variable D, the passed-in decl.
1204 #define DEF_TRAVERSE_DECL(DECL, CODE) \
1205 template <typename Derived> \
1206 bool RecursiveASTVisitor<Derived>::Traverse##DECL(DECL *D) { \
1207 TRY_TO(WalkUpFrom##DECL(D)); \
1209 TRY_TO(TraverseDeclContextHelper(dyn_cast<DeclContext>(D))); \
1213 DEF_TRAVERSE_DECL(AccessSpecDecl, {})
1215 DEF_TRAVERSE_DECL(BlockDecl, {
1216 if (TypeSourceInfo *TInfo = D->getSignatureAsWritten())
1217 TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));
1218 TRY_TO(TraverseStmt(D->getBody()));
1219 for (const auto &I : D->captures()) {
1220 if (I.hasCopyExpr()) {
1221 TRY_TO(TraverseStmt(I.getCopyExpr()));
1224 // This return statement makes sure the traversal of nodes in
1225 // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)
1226 // is skipped - don't remove it.
1230 DEF_TRAVERSE_DECL(CapturedDecl, {
1231 TRY_TO(TraverseStmt(D->getBody()));
1232 // This return statement makes sure the traversal of nodes in
1233 // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)
1234 // is skipped - don't remove it.
1238 DEF_TRAVERSE_DECL(EmptyDecl, {})
1240 DEF_TRAVERSE_DECL(FileScopeAsmDecl,
1241 { TRY_TO(TraverseStmt(D->getAsmString())); })
1243 DEF_TRAVERSE_DECL(ImportDecl, {})
1245 DEF_TRAVERSE_DECL(FriendDecl, {
1246 // Friend is either decl or a type.
1247 if (D->getFriendType())
1248 TRY_TO(TraverseTypeLoc(D->getFriendType()->getTypeLoc()));
1250 TRY_TO(TraverseDecl(D->getFriendDecl()));
1253 DEF_TRAVERSE_DECL(FriendTemplateDecl, {
1254 if (D->getFriendType())
1255 TRY_TO(TraverseTypeLoc(D->getFriendType()->getTypeLoc()));
1257 TRY_TO(TraverseDecl(D->getFriendDecl()));
1258 for (unsigned I = 0, E = D->getNumTemplateParameters(); I < E; ++I) {
1259 TemplateParameterList *TPL = D->getTemplateParameterList(I);
1260 for (TemplateParameterList::iterator ITPL = TPL->begin(), ETPL = TPL->end();
1261 ITPL != ETPL; ++ITPL) {
1262 TRY_TO(TraverseDecl(*ITPL));
1267 DEF_TRAVERSE_DECL(ClassScopeFunctionSpecializationDecl,
1268 { TRY_TO(TraverseDecl(D->getSpecialization())); })
1270 DEF_TRAVERSE_DECL(LinkageSpecDecl, {})
1272 DEF_TRAVERSE_DECL(ObjCPropertyImplDecl, {// FIXME: implement this
1275 DEF_TRAVERSE_DECL(StaticAssertDecl, {
1276 TRY_TO(TraverseStmt(D->getAssertExpr()));
1277 TRY_TO(TraverseStmt(D->getMessage()));
1281 TranslationUnitDecl,
1282 {// Code in an unnamed namespace shows up automatically in
1283 // decls_begin()/decls_end(). Thus we don't need to recurse on
1284 // D->getAnonymousNamespace().
1287 DEF_TRAVERSE_DECL(ExternCContextDecl, {})
1289 DEF_TRAVERSE_DECL(NamespaceAliasDecl, {
1290 // We shouldn't traverse an aliased namespace, since it will be
1291 // defined (and, therefore, traversed) somewhere else.
1293 // This return statement makes sure the traversal of nodes in
1294 // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)
1295 // is skipped - don't remove it.
1299 DEF_TRAVERSE_DECL(LabelDecl, {// There is no code in a LabelDecl.
1304 {// Code in an unnamed namespace shows up automatically in
1305 // decls_begin()/decls_end(). Thus we don't need to recurse on
1306 // D->getAnonymousNamespace().
1309 DEF_TRAVERSE_DECL(ObjCCompatibleAliasDecl, {// FIXME: implement
1312 DEF_TRAVERSE_DECL(ObjCCategoryDecl, {// FIXME: implement
1315 DEF_TRAVERSE_DECL(ObjCCategoryImplDecl, {// FIXME: implement
1318 DEF_TRAVERSE_DECL(ObjCImplementationDecl, {// FIXME: implement
1321 DEF_TRAVERSE_DECL(ObjCInterfaceDecl, {// FIXME: implement
1324 DEF_TRAVERSE_DECL(ObjCProtocolDecl, {// FIXME: implement
1327 DEF_TRAVERSE_DECL(ObjCMethodDecl, {
1328 if (D->getReturnTypeSourceInfo()) {
1329 TRY_TO(TraverseTypeLoc(D->getReturnTypeSourceInfo()->getTypeLoc()));
1331 for (ObjCMethodDecl::param_iterator I = D->param_begin(), E = D->param_end();
1333 TRY_TO(TraverseDecl(*I));
1335 if (D->isThisDeclarationADefinition()) {
1336 TRY_TO(TraverseStmt(D->getBody()));
1341 DEF_TRAVERSE_DECL(ObjCPropertyDecl, {
1342 if (D->getTypeSourceInfo())
1343 TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));
1345 TRY_TO(TraverseType(D->getType()));
1349 DEF_TRAVERSE_DECL(UsingDecl, {
1350 TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));
1351 TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));
1354 DEF_TRAVERSE_DECL(UsingDirectiveDecl, {
1355 TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));
1358 DEF_TRAVERSE_DECL(UsingShadowDecl, {})
1360 DEF_TRAVERSE_DECL(OMPThreadPrivateDecl, {
1361 for (auto *I : D->varlists()) {
1362 TRY_TO(TraverseStmt(I));
1366 // A helper method for TemplateDecl's children.
1367 template <typename Derived>
1368 bool RecursiveASTVisitor<Derived>::TraverseTemplateParameterListHelper(
1369 TemplateParameterList *TPL) {
1371 for (TemplateParameterList::iterator I = TPL->begin(), E = TPL->end();
1373 TRY_TO(TraverseDecl(*I));
1379 // A helper method for traversing the implicit instantiations of a
1381 template <typename Derived>
1382 bool RecursiveASTVisitor<Derived>::TraverseClassInstantiations(
1383 ClassTemplateDecl *D) {
1384 for (auto *SD : D->specializations()) {
1385 for (auto *RD : SD->redecls()) {
1386 // We don't want to visit injected-class-names in this traversal.
1387 if (cast<CXXRecordDecl>(RD)->isInjectedClassName())
1391 cast<ClassTemplateSpecializationDecl>(RD)->getSpecializationKind()) {
1392 // Visit the implicit instantiations with the requested pattern.
1393 case TSK_Undeclared:
1394 case TSK_ImplicitInstantiation:
1395 TRY_TO(TraverseDecl(RD));
1398 // We don't need to do anything on an explicit instantiation
1399 // or explicit specialization because there will be an explicit
1400 // node for it elsewhere.
1401 case TSK_ExplicitInstantiationDeclaration:
1402 case TSK_ExplicitInstantiationDefinition:
1403 case TSK_ExplicitSpecialization:
1412 DEF_TRAVERSE_DECL(ClassTemplateDecl, {
1413 CXXRecordDecl *TempDecl = D->getTemplatedDecl();
1414 TRY_TO(TraverseDecl(TempDecl));
1415 TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));
1417 // By default, we do not traverse the instantiations of
1418 // class templates since they do not appear in the user code. The
1419 // following code optionally traverses them.
1421 // We only traverse the class instantiations when we see the canonical
1422 // declaration of the template, to ensure we only visit them once.
1423 if (getDerived().shouldVisitTemplateInstantiations() &&
1424 D == D->getCanonicalDecl())
1425 TRY_TO(TraverseClassInstantiations(D));
1427 // Note that getInstantiatedFromMemberTemplate() is just a link
1428 // from a template instantiation back to the template from which
1429 // it was instantiated, and thus should not be traversed.
1432 // A helper method for traversing the implicit instantiations of a
1434 template <typename Derived>
1435 bool RecursiveASTVisitor<Derived>::TraverseVariableInstantiations(
1436 VarTemplateDecl *D) {
1437 for (auto *SD : D->specializations()) {
1438 for (auto *RD : SD->redecls()) {
1440 cast<VarTemplateSpecializationDecl>(RD)->getSpecializationKind()) {
1441 // Visit the implicit instantiations with the requested pattern.
1442 case TSK_Undeclared:
1443 case TSK_ImplicitInstantiation:
1444 TRY_TO(TraverseDecl(RD));
1447 // We don't need to do anything on an explicit instantiation
1448 // or explicit specialization because there will be an explicit
1449 // node for it elsewhere.
1450 case TSK_ExplicitInstantiationDeclaration:
1451 case TSK_ExplicitInstantiationDefinition:
1452 case TSK_ExplicitSpecialization:
1461 DEF_TRAVERSE_DECL(VarTemplateDecl, {
1462 VarDecl *TempDecl = D->getTemplatedDecl();
1463 TRY_TO(TraverseDecl(TempDecl));
1464 TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));
1466 // By default, we do not traverse the instantiations of
1467 // variable templates since they do not appear in the user code. The
1468 // following code optionally traverses them.
1470 // We only traverse the variable instantiations when we see the canonical
1471 // declaration of the template, to ensure we only visit them once.
1472 if (getDerived().shouldVisitTemplateInstantiations() &&
1473 D == D->getCanonicalDecl())
1474 TRY_TO(TraverseVariableInstantiations(D));
1476 // Note that getInstantiatedFromMemberTemplate() is just a link
1477 // from a template instantiation back to the template from which
1478 // it was instantiated, and thus should not be traversed.
1481 // A helper method for traversing the instantiations of a
1482 // function while skipping its specializations.
1483 template <typename Derived>
1484 bool RecursiveASTVisitor<Derived>::TraverseFunctionInstantiations(
1485 FunctionTemplateDecl *D) {
1486 for (auto *FD : D->specializations()) {
1487 for (auto *RD : FD->redecls()) {
1488 switch (RD->getTemplateSpecializationKind()) {
1489 case TSK_Undeclared:
1490 case TSK_ImplicitInstantiation:
1491 // We don't know what kind of FunctionDecl this is.
1492 TRY_TO(TraverseDecl(RD));
1495 // No need to visit explicit instantiations, we'll find the node
1497 // FIXME: This is incorrect; there is no other node for an explicit
1498 // instantiation of a function template specialization.
1499 case TSK_ExplicitInstantiationDeclaration:
1500 case TSK_ExplicitInstantiationDefinition:
1503 case TSK_ExplicitSpecialization:
1512 DEF_TRAVERSE_DECL(FunctionTemplateDecl, {
1513 TRY_TO(TraverseDecl(D->getTemplatedDecl()));
1514 TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));
1516 // By default, we do not traverse the instantiations of
1517 // function templates since they do not appear in the user code. The
1518 // following code optionally traverses them.
1520 // We only traverse the function instantiations when we see the canonical
1521 // declaration of the template, to ensure we only visit them once.
1522 if (getDerived().shouldVisitTemplateInstantiations() &&
1523 D == D->getCanonicalDecl())
1524 TRY_TO(TraverseFunctionInstantiations(D));
1527 DEF_TRAVERSE_DECL(TemplateTemplateParmDecl, {
1528 // D is the "T" in something like
1529 // template <template <typename> class T> class container { };
1530 TRY_TO(TraverseDecl(D->getTemplatedDecl()));
1531 if (D->hasDefaultArgument()) {
1532 TRY_TO(TraverseTemplateArgumentLoc(D->getDefaultArgument()));
1534 TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));
1537 DEF_TRAVERSE_DECL(TemplateTypeParmDecl, {
1538 // D is the "T" in something like "template<typename T> class vector;"
1539 if (D->getTypeForDecl())
1540 TRY_TO(TraverseType(QualType(D->getTypeForDecl(), 0)));
1541 if (D->hasDefaultArgument())
1542 TRY_TO(TraverseTypeLoc(D->getDefaultArgumentInfo()->getTypeLoc()));
1545 DEF_TRAVERSE_DECL(TypedefDecl, {
1546 TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));
1547 // We shouldn't traverse D->getTypeForDecl(); it's a result of
1548 // declaring the typedef, not something that was written in the
1552 DEF_TRAVERSE_DECL(TypeAliasDecl, {
1553 TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));
1554 // We shouldn't traverse D->getTypeForDecl(); it's a result of
1555 // declaring the type alias, not something that was written in the
1559 DEF_TRAVERSE_DECL(TypeAliasTemplateDecl, {
1560 TRY_TO(TraverseDecl(D->getTemplatedDecl()));
1561 TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));
1564 DEF_TRAVERSE_DECL(UnresolvedUsingTypenameDecl, {
1565 // A dependent using declaration which was marked with 'typename'.
1566 // template<class T> class A : public B<T> { using typename B<T>::foo; };
1567 TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));
1568 // We shouldn't traverse D->getTypeForDecl(); it's a result of
1569 // declaring the type, not something that was written in the
1573 DEF_TRAVERSE_DECL(EnumDecl, {
1574 if (D->getTypeForDecl())
1575 TRY_TO(TraverseType(QualType(D->getTypeForDecl(), 0)));
1577 TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));
1578 // The enumerators are already traversed by
1579 // decls_begin()/decls_end().
1582 // Helper methods for RecordDecl and its children.
1583 template <typename Derived>
1584 bool RecursiveASTVisitor<Derived>::TraverseRecordHelper(RecordDecl *D) {
1585 // We shouldn't traverse D->getTypeForDecl(); it's a result of
1586 // declaring the type, not something that was written in the source.
1588 TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));
1592 template <typename Derived>
1593 bool RecursiveASTVisitor<Derived>::TraverseCXXRecordHelper(CXXRecordDecl *D) {
1594 if (!TraverseRecordHelper(D))
1596 if (D->isCompleteDefinition()) {
1597 for (const auto &I : D->bases()) {
1598 TRY_TO(TraverseTypeLoc(I.getTypeSourceInfo()->getTypeLoc()));
1600 // We don't traverse the friends or the conversions, as they are
1601 // already in decls_begin()/decls_end().
1606 DEF_TRAVERSE_DECL(RecordDecl, { TRY_TO(TraverseRecordHelper(D)); })
1608 DEF_TRAVERSE_DECL(CXXRecordDecl, { TRY_TO(TraverseCXXRecordHelper(D)); })
1610 DEF_TRAVERSE_DECL(ClassTemplateSpecializationDecl, {
1611 // For implicit instantiations ("set<int> x;"), we don't want to
1612 // recurse at all, since the instatiated class isn't written in
1613 // the source code anywhere. (Note the instatiated *type* --
1614 // set<int> -- is written, and will still get a callback of
1615 // TemplateSpecializationType). For explicit instantiations
1616 // ("template set<int>;"), we do need a callback, since this
1617 // is the only callback that's made for this instantiation.
1618 // We use getTypeAsWritten() to distinguish.
1619 if (TypeSourceInfo *TSI = D->getTypeAsWritten())
1620 TRY_TO(TraverseTypeLoc(TSI->getTypeLoc()));
1622 if (!getDerived().shouldVisitTemplateInstantiations() &&
1623 D->getTemplateSpecializationKind() != TSK_ExplicitSpecialization)
1624 // Returning from here skips traversing the
1625 // declaration context of the ClassTemplateSpecializationDecl
1626 // (embedded in the DEF_TRAVERSE_DECL() macro)
1627 // which contains the instantiated members of the class.
1631 template <typename Derived>
1632 bool RecursiveASTVisitor<Derived>::TraverseTemplateArgumentLocsHelper(
1633 const TemplateArgumentLoc *TAL, unsigned Count) {
1634 for (unsigned I = 0; I < Count; ++I) {
1635 TRY_TO(TraverseTemplateArgumentLoc(TAL[I]));
1640 DEF_TRAVERSE_DECL(ClassTemplatePartialSpecializationDecl, {
1641 // The partial specialization.
1642 if (TemplateParameterList *TPL = D->getTemplateParameters()) {
1643 for (TemplateParameterList::iterator I = TPL->begin(), E = TPL->end();
1645 TRY_TO(TraverseDecl(*I));
1648 // The args that remains unspecialized.
1649 TRY_TO(TraverseTemplateArgumentLocsHelper(
1650 D->getTemplateArgsAsWritten()->getTemplateArgs(),
1651 D->getTemplateArgsAsWritten()->NumTemplateArgs));
1653 // Don't need the ClassTemplatePartialSpecializationHelper, even
1654 // though that's our parent class -- we already visit all the
1655 // template args here.
1656 TRY_TO(TraverseCXXRecordHelper(D));
1658 // Instantiations will have been visited with the primary template.
1661 DEF_TRAVERSE_DECL(EnumConstantDecl, { TRY_TO(TraverseStmt(D->getInitExpr())); })
1663 DEF_TRAVERSE_DECL(UnresolvedUsingValueDecl, {
1664 // Like UnresolvedUsingTypenameDecl, but without the 'typename':
1665 // template <class T> Class A : public Base<T> { using Base<T>::foo; };
1666 TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));
1667 TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));
1670 DEF_TRAVERSE_DECL(IndirectFieldDecl, {})
1672 template <typename Derived>
1673 bool RecursiveASTVisitor<Derived>::TraverseDeclaratorHelper(DeclaratorDecl *D) {
1674 TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));
1675 if (D->getTypeSourceInfo())
1676 TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));
1678 TRY_TO(TraverseType(D->getType()));
1682 DEF_TRAVERSE_DECL(MSPropertyDecl, { TRY_TO(TraverseDeclaratorHelper(D)); })
1684 DEF_TRAVERSE_DECL(FieldDecl, {
1685 TRY_TO(TraverseDeclaratorHelper(D));
1686 if (D->isBitField())
1687 TRY_TO(TraverseStmt(D->getBitWidth()));
1688 else if (D->hasInClassInitializer())
1689 TRY_TO(TraverseStmt(D->getInClassInitializer()));
1692 DEF_TRAVERSE_DECL(ObjCAtDefsFieldDecl, {
1693 TRY_TO(TraverseDeclaratorHelper(D));
1694 if (D->isBitField())
1695 TRY_TO(TraverseStmt(D->getBitWidth()));
1696 // FIXME: implement the rest.
1699 DEF_TRAVERSE_DECL(ObjCIvarDecl, {
1700 TRY_TO(TraverseDeclaratorHelper(D));
1701 if (D->isBitField())
1702 TRY_TO(TraverseStmt(D->getBitWidth()));
1703 // FIXME: implement the rest.
1706 template <typename Derived>
1707 bool RecursiveASTVisitor<Derived>::TraverseFunctionHelper(FunctionDecl *D) {
1708 TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));
1709 TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));
1711 // If we're an explicit template specialization, iterate over the
1712 // template args that were explicitly specified. If we were doing
1713 // this in typing order, we'd do it between the return type and
1714 // the function args, but both are handled by the FunctionTypeLoc
1715 // above, so we have to choose one side. I've decided to do before.
1716 if (const FunctionTemplateSpecializationInfo *FTSI =
1717 D->getTemplateSpecializationInfo()) {
1718 if (FTSI->getTemplateSpecializationKind() != TSK_Undeclared &&
1719 FTSI->getTemplateSpecializationKind() != TSK_ImplicitInstantiation) {
1720 // A specialization might not have explicit template arguments if it has
1721 // a templated return type and concrete arguments.
1722 if (const ASTTemplateArgumentListInfo *TALI =
1723 FTSI->TemplateArgumentsAsWritten) {
1724 TRY_TO(TraverseTemplateArgumentLocsHelper(TALI->getTemplateArgs(),
1725 TALI->NumTemplateArgs));
1730 // Visit the function type itself, which can be either
1731 // FunctionNoProtoType or FunctionProtoType, or a typedef. This
1732 // also covers the return type and the function parameters,
1733 // including exception specifications.
1734 TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));
1736 if (CXXConstructorDecl *Ctor = dyn_cast<CXXConstructorDecl>(D)) {
1737 // Constructor initializers.
1738 for (auto *I : Ctor->inits()) {
1739 TRY_TO(TraverseConstructorInitializer(I));
1743 if (D->isThisDeclarationADefinition()) {
1744 TRY_TO(TraverseStmt(D->getBody())); // Function body.
1749 DEF_TRAVERSE_DECL(FunctionDecl, {
1750 // We skip decls_begin/decls_end, which are already covered by
1751 // TraverseFunctionHelper().
1752 return TraverseFunctionHelper(D);
1755 DEF_TRAVERSE_DECL(CXXMethodDecl, {
1756 // We skip decls_begin/decls_end, which are already covered by
1757 // TraverseFunctionHelper().
1758 return TraverseFunctionHelper(D);
1761 DEF_TRAVERSE_DECL(CXXConstructorDecl, {
1762 // We skip decls_begin/decls_end, which are already covered by
1763 // TraverseFunctionHelper().
1764 return TraverseFunctionHelper(D);
1767 // CXXConversionDecl is the declaration of a type conversion operator.
1768 // It's not a cast expression.
1769 DEF_TRAVERSE_DECL(CXXConversionDecl, {
1770 // We skip decls_begin/decls_end, which are already covered by
1771 // TraverseFunctionHelper().
1772 return TraverseFunctionHelper(D);
1775 DEF_TRAVERSE_DECL(CXXDestructorDecl, {
1776 // We skip decls_begin/decls_end, which are already covered by
1777 // TraverseFunctionHelper().
1778 return TraverseFunctionHelper(D);
1781 template <typename Derived>
1782 bool RecursiveASTVisitor<Derived>::TraverseVarHelper(VarDecl *D) {
1783 TRY_TO(TraverseDeclaratorHelper(D));
1784 // Default params are taken care of when we traverse the ParmVarDecl.
1785 if (!isa<ParmVarDecl>(D))
1786 TRY_TO(TraverseStmt(D->getInit()));
1790 DEF_TRAVERSE_DECL(VarDecl, { TRY_TO(TraverseVarHelper(D)); })
1792 DEF_TRAVERSE_DECL(VarTemplateSpecializationDecl, {
1793 // For implicit instantiations, we don't want to
1794 // recurse at all, since the instatiated class isn't written in
1795 // the source code anywhere.
1796 if (TypeSourceInfo *TSI = D->getTypeAsWritten())
1797 TRY_TO(TraverseTypeLoc(TSI->getTypeLoc()));
1799 if (!getDerived().shouldVisitTemplateInstantiations() &&
1800 D->getTemplateSpecializationKind() != TSK_ExplicitSpecialization)
1801 // Returning from here skips traversing the
1802 // declaration context of the VarTemplateSpecializationDecl
1803 // (embedded in the DEF_TRAVERSE_DECL() macro).
1807 DEF_TRAVERSE_DECL(VarTemplatePartialSpecializationDecl, {
1808 // The partial specialization.
1809 if (TemplateParameterList *TPL = D->getTemplateParameters()) {
1810 for (TemplateParameterList::iterator I = TPL->begin(), E = TPL->end();
1812 TRY_TO(TraverseDecl(*I));
1815 // The args that remains unspecialized.
1816 TRY_TO(TraverseTemplateArgumentLocsHelper(
1817 D->getTemplateArgsAsWritten()->getTemplateArgs(),
1818 D->getTemplateArgsAsWritten()->NumTemplateArgs));
1820 // Don't need the VarTemplatePartialSpecializationHelper, even
1821 // though that's our parent class -- we already visit all the
1822 // template args here.
1823 TRY_TO(TraverseVarHelper(D));
1825 // Instantiations will have been visited with the primary
1829 DEF_TRAVERSE_DECL(ImplicitParamDecl, { TRY_TO(TraverseVarHelper(D)); })
1831 DEF_TRAVERSE_DECL(NonTypeTemplateParmDecl, {
1832 // A non-type template parameter, e.g. "S" in template<int S> class Foo ...
1833 TRY_TO(TraverseDeclaratorHelper(D));
1834 TRY_TO(TraverseStmt(D->getDefaultArgument()));
1837 DEF_TRAVERSE_DECL(ParmVarDecl, {
1838 TRY_TO(TraverseVarHelper(D));
1840 if (D->hasDefaultArg() && D->hasUninstantiatedDefaultArg() &&
1841 !D->hasUnparsedDefaultArg())
1842 TRY_TO(TraverseStmt(D->getUninstantiatedDefaultArg()));
1844 if (D->hasDefaultArg() && !D->hasUninstantiatedDefaultArg() &&
1845 !D->hasUnparsedDefaultArg())
1846 TRY_TO(TraverseStmt(D->getDefaultArg()));
1849 #undef DEF_TRAVERSE_DECL
1851 // ----------------- Stmt traversal -----------------
1853 // For stmts, we automate (in the DEF_TRAVERSE_STMT macro) iterating
1854 // over the children defined in children() (every stmt defines these,
1855 // though sometimes the range is empty). Each individual Traverse*
1856 // method only needs to worry about children other than those. To see
1857 // what children() does for a given class, see, e.g.,
1858 // http://clang.llvm.org/doxygen/Stmt_8cpp_source.html
1860 // This macro makes available a variable S, the passed-in stmt.
1861 #define DEF_TRAVERSE_STMT(STMT, CODE) \
1862 template <typename Derived> \
1863 bool RecursiveASTVisitor<Derived>::Traverse##STMT(STMT *S) { \
1864 TRY_TO(WalkUpFrom##STMT(S)); \
1865 StmtQueueAction StmtQueue(*this); \
1867 for (Stmt::child_range range = S->children(); range; ++range) { \
1868 StmtQueue.queue(*range); \
1873 DEF_TRAVERSE_STMT(GCCAsmStmt, {
1874 StmtQueue.queue(S->getAsmString());
1875 for (unsigned I = 0, E = S->getNumInputs(); I < E; ++I) {
1876 StmtQueue.queue(S->getInputConstraintLiteral(I));
1878 for (unsigned I = 0, E = S->getNumOutputs(); I < E; ++I) {
1879 StmtQueue.queue(S->getOutputConstraintLiteral(I));
1881 for (unsigned I = 0, E = S->getNumClobbers(); I < E; ++I) {
1882 StmtQueue.queue(S->getClobberStringLiteral(I));
1884 // children() iterates over inputExpr and outputExpr.
1889 {// FIXME: MS Asm doesn't currently parse Constraints, Clobbers, etc. Once
1890 // added this needs to be implemented.
1893 DEF_TRAVERSE_STMT(CXXCatchStmt, {
1894 TRY_TO(TraverseDecl(S->getExceptionDecl()));
1895 // children() iterates over the handler block.
1898 DEF_TRAVERSE_STMT(DeclStmt, {
1899 for (auto *I : S->decls()) {
1900 TRY_TO(TraverseDecl(I));
1902 // Suppress the default iteration over children() by
1903 // returning. Here's why: A DeclStmt looks like 'type var [=
1904 // initializer]'. The decls above already traverse over the
1905 // initializers, so we don't have to do it again (which
1906 // children() would do).
1910 // These non-expr stmts (most of them), do not need any action except
1911 // iterating over the children.
1912 DEF_TRAVERSE_STMT(BreakStmt, {})
1913 DEF_TRAVERSE_STMT(CXXTryStmt, {})
1914 DEF_TRAVERSE_STMT(CaseStmt, {})
1915 DEF_TRAVERSE_STMT(CompoundStmt, {})
1916 DEF_TRAVERSE_STMT(ContinueStmt, {})
1917 DEF_TRAVERSE_STMT(DefaultStmt, {})
1918 DEF_TRAVERSE_STMT(DoStmt, {})
1919 DEF_TRAVERSE_STMT(ForStmt, {})
1920 DEF_TRAVERSE_STMT(GotoStmt, {})
1921 DEF_TRAVERSE_STMT(IfStmt, {})
1922 DEF_TRAVERSE_STMT(IndirectGotoStmt, {})
1923 DEF_TRAVERSE_STMT(LabelStmt, {})
1924 DEF_TRAVERSE_STMT(AttributedStmt, {})
1925 DEF_TRAVERSE_STMT(NullStmt, {})
1926 DEF_TRAVERSE_STMT(ObjCAtCatchStmt, {})
1927 DEF_TRAVERSE_STMT(ObjCAtFinallyStmt, {})
1928 DEF_TRAVERSE_STMT(ObjCAtSynchronizedStmt, {})
1929 DEF_TRAVERSE_STMT(ObjCAtThrowStmt, {})
1930 DEF_TRAVERSE_STMT(ObjCAtTryStmt, {})
1931 DEF_TRAVERSE_STMT(ObjCForCollectionStmt, {})
1932 DEF_TRAVERSE_STMT(ObjCAutoreleasePoolStmt, {})
1933 DEF_TRAVERSE_STMT(CXXForRangeStmt, {})
1934 DEF_TRAVERSE_STMT(MSDependentExistsStmt, {
1935 TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));
1936 TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));
1938 DEF_TRAVERSE_STMT(ReturnStmt, {})
1939 DEF_TRAVERSE_STMT(SwitchStmt, {})
1940 DEF_TRAVERSE_STMT(WhileStmt, {})
1942 DEF_TRAVERSE_STMT(CXXDependentScopeMemberExpr, {
1943 TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));
1944 TRY_TO(TraverseDeclarationNameInfo(S->getMemberNameInfo()));
1945 if (S->hasExplicitTemplateArgs()) {
1946 TRY_TO(TraverseTemplateArgumentLocsHelper(S->getTemplateArgs(),
1947 S->getNumTemplateArgs()));
1951 DEF_TRAVERSE_STMT(DeclRefExpr, {
1952 TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));
1953 TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));
1954 TRY_TO(TraverseTemplateArgumentLocsHelper(S->getTemplateArgs(),
1955 S->getNumTemplateArgs()));
1958 DEF_TRAVERSE_STMT(DependentScopeDeclRefExpr, {
1959 TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));
1960 TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));
1961 if (S->hasExplicitTemplateArgs()) {
1962 TRY_TO(TraverseTemplateArgumentLocsHelper(
1963 S->getExplicitTemplateArgs().getTemplateArgs(),
1964 S->getNumTemplateArgs()));
1968 DEF_TRAVERSE_STMT(MemberExpr, {
1969 TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));
1970 TRY_TO(TraverseDeclarationNameInfo(S->getMemberNameInfo()));
1971 TRY_TO(TraverseTemplateArgumentLocsHelper(S->getTemplateArgs(),
1972 S->getNumTemplateArgs()));
1977 {// We don't traverse the cast type, as it's not written in the
1981 DEF_TRAVERSE_STMT(CStyleCastExpr, {
1982 TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));
1985 DEF_TRAVERSE_STMT(CXXFunctionalCastExpr, {
1986 TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));
1989 DEF_TRAVERSE_STMT(CXXConstCastExpr, {
1990 TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));
1993 DEF_TRAVERSE_STMT(CXXDynamicCastExpr, {
1994 TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));
1997 DEF_TRAVERSE_STMT(CXXReinterpretCastExpr, {
1998 TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));
2001 DEF_TRAVERSE_STMT(CXXStaticCastExpr, {
2002 TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));
2005 // InitListExpr is a tricky one, because we want to do all our work on
2006 // the syntactic form of the listexpr, but this method takes the
2007 // semantic form by default. We can't use the macro helper because it
2008 // calls WalkUp*() on the semantic form, before our code can convert
2009 // to the syntactic form.
2010 template <typename Derived>
2011 bool RecursiveASTVisitor<Derived>::TraverseInitListExpr(InitListExpr *S) {
2012 if (InitListExpr *Syn = S->getSyntacticForm())
2014 TRY_TO(WalkUpFromInitListExpr(S));
2015 StmtQueueAction StmtQueue(*this);
2016 // All we need are the default actions. FIXME: use a helper function.
2017 for (Stmt::child_range range = S->children(); range; ++range) {
2018 StmtQueue.queue(*range);
2023 // GenericSelectionExpr is a special case because the types and expressions
2024 // are interleaved. We also need to watch out for null types (default
2025 // generic associations).
2026 template <typename Derived>
2027 bool RecursiveASTVisitor<Derived>::TraverseGenericSelectionExpr(
2028 GenericSelectionExpr *S) {
2029 TRY_TO(WalkUpFromGenericSelectionExpr(S));
2030 StmtQueueAction StmtQueue(*this);
2031 StmtQueue.queue(S->getControllingExpr());
2032 for (unsigned i = 0; i != S->getNumAssocs(); ++i) {
2033 if (TypeSourceInfo *TS = S->getAssocTypeSourceInfo(i))
2034 TRY_TO(TraverseTypeLoc(TS->getTypeLoc()));
2035 StmtQueue.queue(S->getAssocExpr(i));
2040 // PseudoObjectExpr is a special case because of the wierdness with
2041 // syntactic expressions and opaque values.
2042 template <typename Derived>
2044 RecursiveASTVisitor<Derived>::TraversePseudoObjectExpr(PseudoObjectExpr *S) {
2045 TRY_TO(WalkUpFromPseudoObjectExpr(S));
2046 StmtQueueAction StmtQueue(*this);
2047 StmtQueue.queue(S->getSyntacticForm());
2048 for (PseudoObjectExpr::semantics_iterator i = S->semantics_begin(),
2049 e = S->semantics_end();
2052 if (OpaqueValueExpr *OVE = dyn_cast<OpaqueValueExpr>(sub))
2053 sub = OVE->getSourceExpr();
2054 StmtQueue.queue(sub);
2059 DEF_TRAVERSE_STMT(CXXScalarValueInitExpr, {
2060 // This is called for code like 'return T()' where T is a built-in
2061 // (i.e. non-class) type.
2062 TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));
2065 DEF_TRAVERSE_STMT(CXXNewExpr, {
2066 // The child-iterator will pick up the other arguments.
2067 TRY_TO(TraverseTypeLoc(S->getAllocatedTypeSourceInfo()->getTypeLoc()));
2070 DEF_TRAVERSE_STMT(OffsetOfExpr, {
2071 // The child-iterator will pick up the expression representing
2073 // FIMXE: for code like offsetof(Foo, a.b.c), should we get
2074 // making a MemberExpr callbacks for Foo.a, Foo.a.b, and Foo.a.b.c?
2075 TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));
2078 DEF_TRAVERSE_STMT(UnaryExprOrTypeTraitExpr, {
2079 // The child-iterator will pick up the arg if it's an expression,
2080 // but not if it's a type.
2081 if (S->isArgumentType())
2082 TRY_TO(TraverseTypeLoc(S->getArgumentTypeInfo()->getTypeLoc()));
2085 DEF_TRAVERSE_STMT(CXXTypeidExpr, {
2086 // The child-iterator will pick up the arg if it's an expression,
2087 // but not if it's a type.
2088 if (S->isTypeOperand())
2089 TRY_TO(TraverseTypeLoc(S->getTypeOperandSourceInfo()->getTypeLoc()));
2092 DEF_TRAVERSE_STMT(MSPropertyRefExpr, {
2093 TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));
2096 DEF_TRAVERSE_STMT(CXXUuidofExpr, {
2097 // The child-iterator will pick up the arg if it's an expression,
2098 // but not if it's a type.
2099 if (S->isTypeOperand())
2100 TRY_TO(TraverseTypeLoc(S->getTypeOperandSourceInfo()->getTypeLoc()));
2103 DEF_TRAVERSE_STMT(TypeTraitExpr, {
2104 for (unsigned I = 0, N = S->getNumArgs(); I != N; ++I)
2105 TRY_TO(TraverseTypeLoc(S->getArg(I)->getTypeLoc()));
2108 DEF_TRAVERSE_STMT(ArrayTypeTraitExpr, {
2109 TRY_TO(TraverseTypeLoc(S->getQueriedTypeSourceInfo()->getTypeLoc()));
2112 DEF_TRAVERSE_STMT(ExpressionTraitExpr,
2113 { StmtQueue.queue(S->getQueriedExpression()); })
2115 DEF_TRAVERSE_STMT(VAArgExpr, {
2116 // The child-iterator will pick up the expression argument.
2117 TRY_TO(TraverseTypeLoc(S->getWrittenTypeInfo()->getTypeLoc()));
2120 DEF_TRAVERSE_STMT(CXXTemporaryObjectExpr, {
2121 // This is called for code like 'return T()' where T is a class type.
2122 TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));
2125 // Walk only the visible parts of lambda expressions.
2126 template <typename Derived>
2127 bool RecursiveASTVisitor<Derived>::TraverseLambdaExpr(LambdaExpr *S) {
2128 TRY_TO(WalkUpFromLambdaExpr(S));
2130 for (LambdaExpr::capture_iterator C = S->explicit_capture_begin(),
2131 CEnd = S->explicit_capture_end();
2133 TRY_TO(TraverseLambdaCapture(S, C));
2136 TypeLoc TL = S->getCallOperator()->getTypeSourceInfo()->getTypeLoc();
2137 FunctionProtoTypeLoc Proto = TL.castAs<FunctionProtoTypeLoc>();
2139 if (S->hasExplicitParameters() && S->hasExplicitResultType()) {
2140 // Visit the whole type.
2141 TRY_TO(TraverseTypeLoc(TL));
2143 if (S->hasExplicitParameters()) {
2144 // Visit parameters.
2145 for (unsigned I = 0, N = Proto.getNumParams(); I != N; ++I) {
2146 TRY_TO(TraverseDecl(Proto.getParam(I)));
2148 } else if (S->hasExplicitResultType()) {
2149 TRY_TO(TraverseTypeLoc(Proto.getReturnLoc()));
2152 auto *T = Proto.getTypePtr();
2153 for (const auto &E : T->exceptions()) {
2154 TRY_TO(TraverseType(E));
2157 if (Expr *NE = T->getNoexceptExpr())
2158 TRY_TO(TraverseStmt(NE));
2161 TRY_TO(TraverseLambdaBody(S));
2165 DEF_TRAVERSE_STMT(CXXUnresolvedConstructExpr, {
2166 // This is called for code like 'T()', where T is a template argument.
2167 TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));
2170 // These expressions all might take explicit template arguments.
2171 // We traverse those if so. FIXME: implement these.
2172 DEF_TRAVERSE_STMT(CXXConstructExpr, {})
2173 DEF_TRAVERSE_STMT(CallExpr, {})
2174 DEF_TRAVERSE_STMT(CXXMemberCallExpr, {})
2176 // These exprs (most of them), do not need any action except iterating
2177 // over the children.
2178 DEF_TRAVERSE_STMT(AddrLabelExpr, {})
2179 DEF_TRAVERSE_STMT(ArraySubscriptExpr, {})
2180 DEF_TRAVERSE_STMT(BlockExpr, {
2181 TRY_TO(TraverseDecl(S->getBlockDecl()));
2182 return true; // no child statements to loop through.
2184 DEF_TRAVERSE_STMT(ChooseExpr, {})
2185 DEF_TRAVERSE_STMT(CompoundLiteralExpr, {
2186 TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));
2188 DEF_TRAVERSE_STMT(CXXBindTemporaryExpr, {})
2189 DEF_TRAVERSE_STMT(CXXBoolLiteralExpr, {})
2190 DEF_TRAVERSE_STMT(CXXDefaultArgExpr, {})
2191 DEF_TRAVERSE_STMT(CXXDefaultInitExpr, {})
2192 DEF_TRAVERSE_STMT(CXXDeleteExpr, {})
2193 DEF_TRAVERSE_STMT(ExprWithCleanups, {})
2194 DEF_TRAVERSE_STMT(CXXNullPtrLiteralExpr, {})
2195 DEF_TRAVERSE_STMT(CXXStdInitializerListExpr, {})
2196 DEF_TRAVERSE_STMT(CXXPseudoDestructorExpr, {
2197 TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));
2198 if (TypeSourceInfo *ScopeInfo = S->getScopeTypeInfo())
2199 TRY_TO(TraverseTypeLoc(ScopeInfo->getTypeLoc()));
2200 if (TypeSourceInfo *DestroyedTypeInfo = S->getDestroyedTypeInfo())
2201 TRY_TO(TraverseTypeLoc(DestroyedTypeInfo->getTypeLoc()));
2203 DEF_TRAVERSE_STMT(CXXThisExpr, {})
2204 DEF_TRAVERSE_STMT(CXXThrowExpr, {})
2205 DEF_TRAVERSE_STMT(UserDefinedLiteral, {})
2206 DEF_TRAVERSE_STMT(DesignatedInitExpr, {})
2207 DEF_TRAVERSE_STMT(ExtVectorElementExpr, {})
2208 DEF_TRAVERSE_STMT(GNUNullExpr, {})
2209 DEF_TRAVERSE_STMT(ImplicitValueInitExpr, {})
2210 DEF_TRAVERSE_STMT(ObjCBoolLiteralExpr, {})
2211 DEF_TRAVERSE_STMT(ObjCEncodeExpr, {
2212 if (TypeSourceInfo *TInfo = S->getEncodedTypeSourceInfo())
2213 TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));
2215 DEF_TRAVERSE_STMT(ObjCIsaExpr, {})
2216 DEF_TRAVERSE_STMT(ObjCIvarRefExpr, {})
2217 DEF_TRAVERSE_STMT(ObjCMessageExpr, {
2218 if (TypeSourceInfo *TInfo = S->getClassReceiverTypeInfo())
2219 TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));
2221 DEF_TRAVERSE_STMT(ObjCPropertyRefExpr, {})
2222 DEF_TRAVERSE_STMT(ObjCSubscriptRefExpr, {})
2223 DEF_TRAVERSE_STMT(ObjCProtocolExpr, {})
2224 DEF_TRAVERSE_STMT(ObjCSelectorExpr, {})
2225 DEF_TRAVERSE_STMT(ObjCIndirectCopyRestoreExpr, {})
2226 DEF_TRAVERSE_STMT(ObjCBridgedCastExpr, {
2227 TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));
2229 DEF_TRAVERSE_STMT(ParenExpr, {})
2230 DEF_TRAVERSE_STMT(ParenListExpr, {})
2231 DEF_TRAVERSE_STMT(PredefinedExpr, {})
2232 DEF_TRAVERSE_STMT(ShuffleVectorExpr, {})
2233 DEF_TRAVERSE_STMT(ConvertVectorExpr, {})
2234 DEF_TRAVERSE_STMT(StmtExpr, {})
2235 DEF_TRAVERSE_STMT(UnresolvedLookupExpr, {
2236 TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));
2237 if (S->hasExplicitTemplateArgs()) {
2238 TRY_TO(TraverseTemplateArgumentLocsHelper(S->getTemplateArgs(),
2239 S->getNumTemplateArgs()));
2243 DEF_TRAVERSE_STMT(UnresolvedMemberExpr, {
2244 TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));
2245 if (S->hasExplicitTemplateArgs()) {
2246 TRY_TO(TraverseTemplateArgumentLocsHelper(S->getTemplateArgs(),
2247 S->getNumTemplateArgs()));
2251 DEF_TRAVERSE_STMT(SEHTryStmt, {})
2252 DEF_TRAVERSE_STMT(SEHExceptStmt, {})
2253 DEF_TRAVERSE_STMT(SEHFinallyStmt, {})
2254 DEF_TRAVERSE_STMT(SEHLeaveStmt, {})
2255 DEF_TRAVERSE_STMT(CapturedStmt, { TRY_TO(TraverseDecl(S->getCapturedDecl())); })
2257 DEF_TRAVERSE_STMT(CXXOperatorCallExpr, {})
2258 DEF_TRAVERSE_STMT(OpaqueValueExpr, {})
2259 DEF_TRAVERSE_STMT(TypoExpr, {})
2260 DEF_TRAVERSE_STMT(CUDAKernelCallExpr, {})
2262 // These operators (all of them) do not need any action except
2263 // iterating over the children.
2264 DEF_TRAVERSE_STMT(BinaryConditionalOperator, {})
2265 DEF_TRAVERSE_STMT(ConditionalOperator, {})
2266 DEF_TRAVERSE_STMT(UnaryOperator, {})
2267 DEF_TRAVERSE_STMT(BinaryOperator, {})
2268 DEF_TRAVERSE_STMT(CompoundAssignOperator, {})
2269 DEF_TRAVERSE_STMT(CXXNoexceptExpr, {})
2270 DEF_TRAVERSE_STMT(PackExpansionExpr, {})
2271 DEF_TRAVERSE_STMT(SizeOfPackExpr, {})
2272 DEF_TRAVERSE_STMT(SubstNonTypeTemplateParmPackExpr, {})
2273 DEF_TRAVERSE_STMT(SubstNonTypeTemplateParmExpr, {})
2274 DEF_TRAVERSE_STMT(FunctionParmPackExpr, {})
2275 DEF_TRAVERSE_STMT(MaterializeTemporaryExpr, {})
2276 DEF_TRAVERSE_STMT(CXXFoldExpr, {})
2277 DEF_TRAVERSE_STMT(AtomicExpr, {})
2279 // These literals (all of them) do not need any action.
2280 DEF_TRAVERSE_STMT(IntegerLiteral, {})
2281 DEF_TRAVERSE_STMT(CharacterLiteral, {})
2282 DEF_TRAVERSE_STMT(FloatingLiteral, {})
2283 DEF_TRAVERSE_STMT(ImaginaryLiteral, {})
2284 DEF_TRAVERSE_STMT(StringLiteral, {})
2285 DEF_TRAVERSE_STMT(ObjCStringLiteral, {})
2286 DEF_TRAVERSE_STMT(ObjCBoxedExpr, {})
2287 DEF_TRAVERSE_STMT(ObjCArrayLiteral, {})
2288 DEF_TRAVERSE_STMT(ObjCDictionaryLiteral, {})
2290 // Traverse OpenCL: AsType, Convert.
2291 DEF_TRAVERSE_STMT(AsTypeExpr, {})
2293 // OpenMP directives.
2294 template <typename Derived>
2295 bool RecursiveASTVisitor<Derived>::TraverseOMPExecutableDirective(
2296 OMPExecutableDirective *S) {
2297 for (auto *C : S->clauses()) {
2298 TRY_TO(TraverseOMPClause(C));
2303 template <typename Derived>
2305 RecursiveASTVisitor<Derived>::TraverseOMPLoopDirective(OMPLoopDirective *S) {
2306 return TraverseOMPExecutableDirective(S);
2309 DEF_TRAVERSE_STMT(OMPParallelDirective,
2310 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2312 DEF_TRAVERSE_STMT(OMPSimdDirective,
2313 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2315 DEF_TRAVERSE_STMT(OMPForDirective,
2316 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2318 DEF_TRAVERSE_STMT(OMPForSimdDirective,
2319 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2321 DEF_TRAVERSE_STMT(OMPSectionsDirective,
2322 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2324 DEF_TRAVERSE_STMT(OMPSectionDirective,
2325 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2327 DEF_TRAVERSE_STMT(OMPSingleDirective,
2328 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2330 DEF_TRAVERSE_STMT(OMPMasterDirective,
2331 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2333 DEF_TRAVERSE_STMT(OMPCriticalDirective, {
2334 TRY_TO(TraverseDeclarationNameInfo(S->getDirectiveName()));
2335 TRY_TO(TraverseOMPExecutableDirective(S));
2338 DEF_TRAVERSE_STMT(OMPParallelForDirective,
2339 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2341 DEF_TRAVERSE_STMT(OMPParallelForSimdDirective,
2342 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2344 DEF_TRAVERSE_STMT(OMPParallelSectionsDirective,
2345 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2347 DEF_TRAVERSE_STMT(OMPTaskDirective,
2348 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2350 DEF_TRAVERSE_STMT(OMPTaskyieldDirective,
2351 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2353 DEF_TRAVERSE_STMT(OMPBarrierDirective,
2354 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2356 DEF_TRAVERSE_STMT(OMPTaskwaitDirective,
2357 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2359 DEF_TRAVERSE_STMT(OMPFlushDirective,
2360 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2362 DEF_TRAVERSE_STMT(OMPOrderedDirective,
2363 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2365 DEF_TRAVERSE_STMT(OMPAtomicDirective,
2366 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2368 DEF_TRAVERSE_STMT(OMPTargetDirective,
2369 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2371 DEF_TRAVERSE_STMT(OMPTeamsDirective,
2372 { TRY_TO(TraverseOMPExecutableDirective(S)); })
2375 template <typename Derived>
2376 bool RecursiveASTVisitor<Derived>::TraverseOMPClause(OMPClause *C) {
2379 switch (C->getClauseKind()) {
2380 #define OPENMP_CLAUSE(Name, Class) \
2382 TRY_TO(Visit##Class(static_cast<Class *>(C))); \
2384 #include "clang/Basic/OpenMPKinds.def"
2385 case OMPC_threadprivate:
2392 template <typename Derived>
2393 bool RecursiveASTVisitor<Derived>::VisitOMPIfClause(OMPIfClause *C) {
2394 TRY_TO(TraverseStmt(C->getCondition()));
2398 template <typename Derived>
2399 bool RecursiveASTVisitor<Derived>::VisitOMPFinalClause(OMPFinalClause *C) {
2400 TRY_TO(TraverseStmt(C->getCondition()));
2404 template <typename Derived>
2406 RecursiveASTVisitor<Derived>::VisitOMPNumThreadsClause(OMPNumThreadsClause *C) {
2407 TRY_TO(TraverseStmt(C->getNumThreads()));
2411 template <typename Derived>
2412 bool RecursiveASTVisitor<Derived>::VisitOMPSafelenClause(OMPSafelenClause *C) {
2413 TRY_TO(TraverseStmt(C->getSafelen()));
2417 template <typename Derived>
2419 RecursiveASTVisitor<Derived>::VisitOMPCollapseClause(OMPCollapseClause *C) {
2420 TRY_TO(TraverseStmt(C->getNumForLoops()));
2424 template <typename Derived>
2425 bool RecursiveASTVisitor<Derived>::VisitOMPDefaultClause(OMPDefaultClause *) {
2429 template <typename Derived>
2430 bool RecursiveASTVisitor<Derived>::VisitOMPProcBindClause(OMPProcBindClause *) {
2434 template <typename Derived>
2436 RecursiveASTVisitor<Derived>::VisitOMPScheduleClause(OMPScheduleClause *C) {
2437 TRY_TO(TraverseStmt(C->getChunkSize()));
2438 TRY_TO(TraverseStmt(C->getHelperChunkSize()));
2442 template <typename Derived>
2443 bool RecursiveASTVisitor<Derived>::VisitOMPOrderedClause(OMPOrderedClause *) {
2447 template <typename Derived>
2448 bool RecursiveASTVisitor<Derived>::VisitOMPNowaitClause(OMPNowaitClause *) {
2452 template <typename Derived>
2453 bool RecursiveASTVisitor<Derived>::VisitOMPUntiedClause(OMPUntiedClause *) {
2457 template <typename Derived>
2459 RecursiveASTVisitor<Derived>::VisitOMPMergeableClause(OMPMergeableClause *) {
2463 template <typename Derived>
2464 bool RecursiveASTVisitor<Derived>::VisitOMPReadClause(OMPReadClause *) {
2468 template <typename Derived>
2469 bool RecursiveASTVisitor<Derived>::VisitOMPWriteClause(OMPWriteClause *) {
2473 template <typename Derived>
2474 bool RecursiveASTVisitor<Derived>::VisitOMPUpdateClause(OMPUpdateClause *) {
2478 template <typename Derived>
2479 bool RecursiveASTVisitor<Derived>::VisitOMPCaptureClause(OMPCaptureClause *) {
2483 template <typename Derived>
2484 bool RecursiveASTVisitor<Derived>::VisitOMPSeqCstClause(OMPSeqCstClause *) {
2488 template <typename Derived>
2489 template <typename T>
2490 bool RecursiveASTVisitor<Derived>::VisitOMPClauseList(T *Node) {
2491 for (auto *E : Node->varlists()) {
2492 TRY_TO(TraverseStmt(E));
2497 template <typename Derived>
2498 bool RecursiveASTVisitor<Derived>::VisitOMPPrivateClause(OMPPrivateClause *C) {
2499 TRY_TO(VisitOMPClauseList(C));
2500 for (auto *E : C->private_copies()) {
2501 TRY_TO(TraverseStmt(E));
2506 template <typename Derived>
2507 bool RecursiveASTVisitor<Derived>::VisitOMPFirstprivateClause(
2508 OMPFirstprivateClause *C) {
2509 TRY_TO(VisitOMPClauseList(C));
2510 for (auto *E : C->private_copies()) {
2511 TRY_TO(TraverseStmt(E));
2513 for (auto *E : C->inits()) {
2514 TRY_TO(TraverseStmt(E));
2519 template <typename Derived>
2520 bool RecursiveASTVisitor<Derived>::VisitOMPLastprivateClause(
2521 OMPLastprivateClause *C) {
2522 TRY_TO(VisitOMPClauseList(C));
2523 for (auto *E : C->private_copies()) {
2524 TRY_TO(TraverseStmt(E));
2526 for (auto *E : C->source_exprs()) {
2527 TRY_TO(TraverseStmt(E));
2529 for (auto *E : C->destination_exprs()) {
2530 TRY_TO(TraverseStmt(E));
2532 for (auto *E : C->assignment_ops()) {
2533 TRY_TO(TraverseStmt(E));
2538 template <typename Derived>
2539 bool RecursiveASTVisitor<Derived>::VisitOMPSharedClause(OMPSharedClause *C) {
2540 TRY_TO(VisitOMPClauseList(C));
2544 template <typename Derived>
2545 bool RecursiveASTVisitor<Derived>::VisitOMPLinearClause(OMPLinearClause *C) {
2546 TRY_TO(TraverseStmt(C->getStep()));
2547 TRY_TO(TraverseStmt(C->getCalcStep()));
2548 TRY_TO(VisitOMPClauseList(C));
2549 for (auto *E : C->inits()) {
2550 TRY_TO(TraverseStmt(E));
2552 for (auto *E : C->updates()) {
2553 TRY_TO(TraverseStmt(E));
2555 for (auto *E : C->finals()) {
2556 TRY_TO(TraverseStmt(E));
2561 template <typename Derived>
2562 bool RecursiveASTVisitor<Derived>::VisitOMPAlignedClause(OMPAlignedClause *C) {
2563 TRY_TO(TraverseStmt(C->getAlignment()));
2564 TRY_TO(VisitOMPClauseList(C));
2568 template <typename Derived>
2569 bool RecursiveASTVisitor<Derived>::VisitOMPCopyinClause(OMPCopyinClause *C) {
2570 TRY_TO(VisitOMPClauseList(C));
2571 for (auto *E : C->source_exprs()) {
2572 TRY_TO(TraverseStmt(E));
2574 for (auto *E : C->destination_exprs()) {
2575 TRY_TO(TraverseStmt(E));
2577 for (auto *E : C->assignment_ops()) {
2578 TRY_TO(TraverseStmt(E));
2583 template <typename Derived>
2584 bool RecursiveASTVisitor<Derived>::VisitOMPCopyprivateClause(
2585 OMPCopyprivateClause *C) {
2586 TRY_TO(VisitOMPClauseList(C));
2587 for (auto *E : C->source_exprs()) {
2588 TRY_TO(TraverseStmt(E));
2590 for (auto *E : C->destination_exprs()) {
2591 TRY_TO(TraverseStmt(E));
2593 for (auto *E : C->assignment_ops()) {
2594 TRY_TO(TraverseStmt(E));
2599 template <typename Derived>
2601 RecursiveASTVisitor<Derived>::VisitOMPReductionClause(OMPReductionClause *C) {
2602 TRY_TO(TraverseNestedNameSpecifierLoc(C->getQualifierLoc()));
2603 TRY_TO(TraverseDeclarationNameInfo(C->getNameInfo()));
2604 TRY_TO(VisitOMPClauseList(C));
2605 for (auto *E : C->lhs_exprs()) {
2606 TRY_TO(TraverseStmt(E));
2608 for (auto *E : C->rhs_exprs()) {
2609 TRY_TO(TraverseStmt(E));
2611 for (auto *E : C->reduction_ops()) {
2612 TRY_TO(TraverseStmt(E));
2617 template <typename Derived>
2618 bool RecursiveASTVisitor<Derived>::VisitOMPFlushClause(OMPFlushClause *C) {
2619 TRY_TO(VisitOMPClauseList(C));
2623 // FIXME: look at the following tricky-seeming exprs to see if we
2624 // need to recurse on anything. These are ones that have methods
2625 // returning decls or qualtypes or nestednamespecifier -- though I'm
2626 // not sure if they own them -- or just seemed very complicated, or
2627 // had lots of sub-types to explore.
2629 // VisitOverloadExpr and its children: recurse on template args? etc?
2631 // FIXME: go through all the stmts and exprs again, and see which of them
2632 // create new types, and recurse on the types (TypeLocs?) of those.
2635 // http://clang.llvm.org/doxygen/classclang_1_1CXXTypeidExpr.html
2636 // http://clang.llvm.org/doxygen/classclang_1_1UnaryExprOrTypeTraitExpr.html
2637 // http://clang.llvm.org/doxygen/classclang_1_1TypesCompatibleExpr.html
2638 // Every class that has getQualifier.
2640 #undef DEF_TRAVERSE_STMT
2644 #undef RecursiveASTVisitor
2646 } // end namespace clang
2648 #endif // LLVM_CLANG_LIBCLANG_RECURSIVEASTVISITOR_H