<div dir="ltr"><br><div class="gmail_extra"><br><br><div class="gmail_quote">On Sun, May 18, 2014 at 8:38 PM, Alp Toker <span dir="ltr"><<a href="mailto:alp@nuanti.com" target="_blank" class="cremed">alp@nuanti.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Author: alp<br>
Date: Sun May 18 13:38:19 2014<br>
New Revision: 209092<br>
<br>
URL: <a href="http://llvm.org/viewvc/llvm-project?rev=209092&view=rev" target="_blank" class="cremed">http://llvm.org/viewvc/llvm-project?rev=209092&view=rev</a><br>
Log:<br>
Format the two RecursiveASTVisitors<br>
<br>
Apply current ToT clang-format on the two RAVs to reduce delta and help<br>
identify differences between the two.<br>
<br>
We lose a little pretty formatting in the headers but that's the price to pay<br>
so we can diff these two files effectively and look to a future where we don't<br>
have to maintain two copies of this code.<br>
<br>
Formatting and whitespace only.<br>
<br>
Modified:<br>
cfe/trunk/include/clang/AST/DataRecursiveASTVisitor.h<br>
cfe/trunk/include/clang/AST/RecursiveASTVisitor.h<br>
<br>
Modified: cfe/trunk/include/clang/AST/DataRecursiveASTVisitor.h<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/cfe/trunk/include/clang/AST/DataRecursiveASTVisitor.h?rev=209092&r1=209091&r2=209092&view=diff" target="_blank" class="cremed">http://llvm.org/viewvc/llvm-project/cfe/trunk/include/clang/AST/DataRecursiveASTVisitor.h?rev=209092&r1=209091&r2=209092&view=diff</a><br>
==============================================================================<br>
--- cfe/trunk/include/clang/AST/DataRecursiveASTVisitor.h (original)<br>
+++ cfe/trunk/include/clang/AST/DataRecursiveASTVisitor.h Sun May 18 13:38:19 2014<br>
@@ -38,34 +38,24 @@<br>
// using them is responsible for defining macro OPERATOR().<br>
<br>
// All unary operators.<br>
-#define UNARYOP_LIST() \<br>
- OPERATOR(PostInc) OPERATOR(PostDec) \<br>
- OPERATOR(PreInc) OPERATOR(PreDec) \<br>
- OPERATOR(AddrOf) OPERATOR(Deref) \<br>
- OPERATOR(Plus) OPERATOR(Minus) \<br>
- OPERATOR(Not) OPERATOR(LNot) \<br>
- OPERATOR(Real) OPERATOR(Imag) \<br>
- OPERATOR(Extension)<br>
+#define UNARYOP_LIST() \<br>
+ OPERATOR(PostInc) OPERATOR(PostDec) OPERATOR(PreInc) OPERATOR(PreDec) \<br>
+ OPERATOR(AddrOf) OPERATOR(Deref) OPERATOR(Plus) OPERATOR(Minus) \<br>
+ OPERATOR(Not) OPERATOR(LNot) OPERATOR(Real) OPERATOR(Imag) \<br>
+ OPERATOR(Extension)<br></blockquote><div><br></div><div>If you put them one per line, clang-format understands that these are macro invocations and leaves them one per line. Might be more readable.</div><div> </div>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
// All binary operators (excluding compound assign operators).<br>
-#define BINOP_LIST() \<br>
- OPERATOR(PtrMemD) OPERATOR(PtrMemI) \<br>
- OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) \<br>
- OPERATOR(Add) OPERATOR(Sub) OPERATOR(Shl) \<br>
- OPERATOR(Shr) \<br>
- \<br>
- OPERATOR(LT) OPERATOR(GT) OPERATOR(LE) \<br>
- OPERATOR(GE) OPERATOR(EQ) OPERATOR(NE) \<br>
- OPERATOR(And) OPERATOR(Xor) OPERATOR(Or) \<br>
- OPERATOR(LAnd) OPERATOR(LOr) \<br>
- \<br>
- OPERATOR(Assign) \<br>
- OPERATOR(Comma)<br>
+#define BINOP_LIST() \<br>
+ OPERATOR(PtrMemD) OPERATOR(PtrMemI) OPERATOR(Mul) OPERATOR(Div) \<br>
+ OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) OPERATOR(Shl) OPERATOR(Shr) \<br>
+ OPERATOR(LT) OPERATOR(GT) OPERATOR(LE) OPERATOR(GE) OPERATOR(EQ) \<br>
+ OPERATOR(NE) OPERATOR(And) OPERATOR(Xor) OPERATOR(Or) OPERATOR(LAnd) \<br>
+ OPERATOR(LOr) OPERATOR(Assign) OPERATOR(Comma)<br>
<br>
// All compound assign operators.<br>
-#define CAO_LIST() \<br>
- OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) \<br>
- OPERATOR(Shl) OPERATOR(Shr) OPERATOR(And) OPERATOR(Or) OPERATOR(Xor)<br>
+#define CAO_LIST() \<br>
+ OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) \<br>
+ OPERATOR(Shl) OPERATOR(Shr) OPERATOR(And) OPERATOR(Or) OPERATOR(Xor)<br>
<br>
namespace clang {<br>
<br>
@@ -77,8 +67,11 @@ namespace clang {<br>
// invokes CALL_EXPR, which must be a method call, on the derived<br>
// object (s.t. a user of RecursiveASTVisitor can override the method<br>
// in CALL_EXPR).<br>
-#define TRY_TO(CALL_EXPR) \<br>
- do { if (!getDerived().CALL_EXPR) return false; } while (0)<br>
+#define TRY_TO(CALL_EXPR) \<br>
+ do { \<br>
+ if (!getDerived().CALL_EXPR) \<br>
+ return false; \<br>
+ } while (0)<br>
<br>
/// \brief A class that does preorder depth-first traversal on the<br>
/// entire Clang AST and visits each node.<br>
@@ -144,11 +137,10 @@ namespace clang {<br>
/// to return true, in which case all known implicit and explicit<br>
/// instantiations will be visited at the same time as the pattern<br>
/// from which they were produced.<br>
-template<typename Derived><br>
-class RecursiveASTVisitor {<br>
+template <typename Derived> class RecursiveASTVisitor {<br>
public:<br>
/// \brief Return a reference to the derived class.<br>
- Derived &getDerived() { return *static_cast<Derived*>(this); }<br>
+ Derived &getDerived() { return *static_cast<Derived *>(this); }<br>
<br>
/// \brief Return whether this visitor should recurse into<br>
/// template instantiations.<br>
@@ -255,114 +247,111 @@ public:<br>
// \brief Visit an attribute.<br>
bool VisitAttr(Attr *A) { return true; }<br>
<br>
- // Declare Traverse* and empty Visit* for all Attr classes.<br>
+// Declare Traverse* and empty Visit* for all Attr classes.<br>
#define ATTR_VISITOR_DECLS_ONLY<br>
#include "clang/AST/AttrVisitor.inc"<br>
#undef ATTR_VISITOR_DECLS_ONLY<br>
<br>
- // ---- Methods on Stmts ----<br>
+// ---- Methods on Stmts ----<br>
<br>
- // Declare Traverse*() for all concrete Stmt classes.<br>
+// Declare Traverse*() for all concrete Stmt classes.<br>
#define ABSTRACT_STMT(STMT)<br>
-#define STMT(CLASS, PARENT) \<br>
- bool Traverse##CLASS(CLASS *S);<br>
+#define STMT(CLASS, PARENT) bool Traverse##CLASS(CLASS *S);<br>
#include "clang/AST/StmtNodes.inc"<br>
// The above header #undefs ABSTRACT_STMT and STMT upon exit.<br>
<br>
// Define WalkUpFrom*() and empty Visit*() for all Stmt classes.<br>
bool WalkUpFromStmt(Stmt *S) { return getDerived().VisitStmt(S); }<br>
bool VisitStmt(Stmt *S) { return true; }<br>
-#define STMT(CLASS, PARENT) \<br>
- bool WalkUpFrom##CLASS(CLASS *S) { \<br>
- TRY_TO(WalkUpFrom##PARENT(S)); \<br>
- TRY_TO(Visit##CLASS(S)); \<br>
- return true; \<br>
- } \<br>
+#define STMT(CLASS, PARENT) \<br>
+ bool WalkUpFrom##CLASS(CLASS *S) { \<br>
+ TRY_TO(WalkUpFrom##PARENT(S)); \<br>
+ TRY_TO(Visit##CLASS(S)); \<br>
+ return true; \<br>
+ } \<br>
bool Visit##CLASS(CLASS *S) { return true; }<br>
#include "clang/AST/StmtNodes.inc"<br>
<br>
- // Define Traverse*(), WalkUpFrom*(), and Visit*() for unary<br>
- // operator methods. Unary operators are not classes in themselves<br>
- // (they're all opcodes in UnaryOperator) but do have visitors.<br>
-#define OPERATOR(NAME) \<br>
- bool TraverseUnary##NAME(UnaryOperator *S) { \<br>
- TRY_TO(WalkUpFromUnary##NAME(S)); \<br>
- StmtQueueAction StmtQueue(*this); \<br>
- StmtQueue.queue(S->getSubExpr()); \<br>
- return true; \<br>
- } \<br>
- bool WalkUpFromUnary##NAME(UnaryOperator *S) { \<br>
- TRY_TO(WalkUpFromUnaryOperator(S)); \<br>
- TRY_TO(VisitUnary##NAME(S)); \<br>
- return true; \<br>
- } \<br>
+// Define Traverse*(), WalkUpFrom*(), and Visit*() for unary<br>
+// operator methods. Unary operators are not classes in themselves<br>
+// (they're all opcodes in UnaryOperator) but do have visitors.<br>
+#define OPERATOR(NAME) \<br>
+ bool TraverseUnary##NAME(UnaryOperator *S) { \<br>
+ TRY_TO(WalkUpFromUnary##NAME(S)); \<br>
+ StmtQueueAction StmtQueue(*this); \<br>
+ StmtQueue.queue(S->getSubExpr()); \<br>
+ return true; \<br>
+ } \<br>
+ bool WalkUpFromUnary##NAME(UnaryOperator *S) { \<br>
+ TRY_TO(WalkUpFromUnaryOperator(S)); \<br>
+ TRY_TO(VisitUnary##NAME(S)); \<br>
+ return true; \<br>
+ } \<br>
bool VisitUnary##NAME(UnaryOperator *S) { return true; }<br>
<br>
UNARYOP_LIST()<br>
#undef OPERATOR<br>
<br>
- // Define Traverse*(), WalkUpFrom*(), and Visit*() for binary<br>
- // operator methods. Binary operators are not classes in themselves<br>
- // (they're all opcodes in BinaryOperator) but do have visitors.<br>
-#define GENERAL_BINOP_FALLBACK(NAME, BINOP_TYPE) \<br>
- bool TraverseBin##NAME(BINOP_TYPE *S) { \<br>
- TRY_TO(WalkUpFromBin##NAME(S)); \<br>
- StmtQueueAction StmtQueue(*this); \<br>
- StmtQueue.queue(S->getLHS()); \<br>
- StmtQueue.queue(S->getRHS()); \<br>
- return true; \<br>
- } \<br>
- bool WalkUpFromBin##NAME(BINOP_TYPE *S) { \<br>
- TRY_TO(WalkUpFrom##BINOP_TYPE(S)); \<br>
- TRY_TO(VisitBin##NAME(S)); \<br>
- return true; \<br>
- } \<br>
+// Define Traverse*(), WalkUpFrom*(), and Visit*() for binary<br>
+// operator methods. Binary operators are not classes in themselves<br>
+// (they're all opcodes in BinaryOperator) but do have visitors.<br>
+#define GENERAL_BINOP_FALLBACK(NAME, BINOP_TYPE) \<br>
+ bool TraverseBin##NAME(BINOP_TYPE *S) { \<br>
+ TRY_TO(WalkUpFromBin##NAME(S)); \<br>
+ StmtQueueAction StmtQueue(*this); \<br>
+ StmtQueue.queue(S->getLHS()); \<br>
+ StmtQueue.queue(S->getRHS()); \<br>
+ return true; \<br>
+ } \<br>
+ bool WalkUpFromBin##NAME(BINOP_TYPE *S) { \<br>
+ TRY_TO(WalkUpFrom##BINOP_TYPE(S)); \<br>
+ TRY_TO(VisitBin##NAME(S)); \<br>
+ return true; \<br>
+ } \<br>
bool VisitBin##NAME(BINOP_TYPE *S) { return true; }<br>
<br>
#define OPERATOR(NAME) GENERAL_BINOP_FALLBACK(NAME, BinaryOperator)<br>
BINOP_LIST()<br>
#undef OPERATOR<br>
<br>
- // Define Traverse*(), WalkUpFrom*(), and Visit*() for compound<br>
- // assignment methods. Compound assignment operators are not<br>
- // classes in themselves (they're all opcodes in<br>
- // CompoundAssignOperator) but do have visitors.<br>
-#define OPERATOR(NAME) \<br>
+// Define Traverse*(), WalkUpFrom*(), and Visit*() for compound<br>
+// assignment methods. Compound assignment operators are not<br>
+// classes in themselves (they're all opcodes in<br>
+// CompoundAssignOperator) but do have visitors.<br>
+#define OPERATOR(NAME) \<br>
GENERAL_BINOP_FALLBACK(NAME##Assign, CompoundAssignOperator)<br>
<br>
CAO_LIST()<br>
#undef OPERATOR<br>
#undef GENERAL_BINOP_FALLBACK<br>
<br>
- // ---- Methods on Types ----<br>
- // FIXME: revamp to take TypeLoc's rather than Types.<br>
+// ---- Methods on Types ----<br>
+// FIXME: revamp to take TypeLoc's rather than Types.<br>
<br>
- // Declare Traverse*() for all concrete Type classes.<br>
+// Declare Traverse*() for all concrete Type classes.<br>
#define ABSTRACT_TYPE(CLASS, BASE)<br>
-#define TYPE(CLASS, BASE) \<br>
- bool Traverse##CLASS##Type(CLASS##Type *T);<br>
+#define TYPE(CLASS, BASE) bool Traverse##CLASS##Type(CLASS##Type *T);<br>
#include "clang/AST/TypeNodes.def"<br>
// The above header #undefs ABSTRACT_TYPE and TYPE upon exit.<br>
<br>
// Define WalkUpFrom*() and empty Visit*() for all Type classes.<br>
bool WalkUpFromType(Type *T) { return getDerived().VisitType(T); }<br>
bool VisitType(Type *T) { return true; }<br>
-#define TYPE(CLASS, BASE) \<br>
- bool WalkUpFrom##CLASS##Type(CLASS##Type *T) { \<br>
- TRY_TO(WalkUpFrom##BASE(T)); \<br>
- TRY_TO(Visit##CLASS##Type(T)); \<br>
- return true; \<br>
- } \<br>
+#define TYPE(CLASS, BASE) \<br>
+ bool WalkUpFrom##CLASS##Type(CLASS##Type *T) { \<br>
+ TRY_TO(WalkUpFrom##BASE(T)); \<br>
+ TRY_TO(Visit##CLASS##Type(T)); \<br>
+ return true; \<br>
+ } \<br>
bool Visit##CLASS##Type(CLASS##Type *T) { return true; }<br>
#include "clang/AST/TypeNodes.def"<br>
<br>
- // ---- Methods on TypeLocs ----<br>
- // FIXME: this currently just calls the matching Type methods<br>
+// ---- Methods on TypeLocs ----<br>
+// FIXME: this currently just calls the matching Type methods<br>
<br>
- // Declare Traverse*() for all concrete Type classes.<br>
+// Declare Traverse*() for all concrete Type classes.<br>
#define ABSTRACT_TYPELOC(CLASS, BASE)<br>
-#define TYPELOC(CLASS, BASE) \<br>
- bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL);<br>
+#define TYPELOC(CLASS, BASE) bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL);<br>
#include "clang/AST/TypeLocNodes.def"<br>
// The above header #undefs ABSTRACT_TYPELOC and TYPELOC upon exit.<br>
<br>
@@ -381,34 +370,33 @@ public:<br>
}<br>
bool VisitUnqualTypeLoc(UnqualTypeLoc TL) { return true; }<br>
<br>
- // Note that BASE includes trailing 'Type' which CLASS doesn't.<br>
-#define TYPE(CLASS, BASE) \<br>
- bool WalkUpFrom##CLASS##TypeLoc(CLASS##TypeLoc TL) { \<br>
- TRY_TO(WalkUpFrom##BASE##Loc(TL)); \<br>
- TRY_TO(Visit##CLASS##TypeLoc(TL)); \<br>
- return true; \<br>
- } \<br>
+// Note that BASE includes trailing 'Type' which CLASS doesn't.<br>
+#define TYPE(CLASS, BASE) \<br>
+ bool WalkUpFrom##CLASS##TypeLoc(CLASS##TypeLoc TL) { \<br>
+ TRY_TO(WalkUpFrom##BASE##Loc(TL)); \<br>
+ TRY_TO(Visit##CLASS##TypeLoc(TL)); \<br>
+ return true; \<br>
+ } \<br>
bool Visit##CLASS##TypeLoc(CLASS##TypeLoc TL) { return true; }<br>
#include "clang/AST/TypeNodes.def"<br>
<br>
- // ---- Methods on Decls ----<br>
+// ---- Methods on Decls ----<br>
<br>
- // Declare Traverse*() for all concrete Decl classes.<br>
+// Declare Traverse*() for all concrete Decl classes.<br>
#define ABSTRACT_DECL(DECL)<br>
-#define DECL(CLASS, BASE) \<br>
- bool Traverse##CLASS##Decl(CLASS##Decl *D);<br>
+#define DECL(CLASS, BASE) bool Traverse##CLASS##Decl(CLASS##Decl *D);<br>
#include "clang/AST/DeclNodes.inc"<br>
// The above header #undefs ABSTRACT_DECL and DECL upon exit.<br>
<br>
// Define WalkUpFrom*() and empty Visit*() for all Decl classes.<br>
bool WalkUpFromDecl(Decl *D) { return getDerived().VisitDecl(D); }<br>
bool VisitDecl(Decl *D) { return true; }<br>
-#define DECL(CLASS, BASE) \<br>
- bool WalkUpFrom##CLASS##Decl(CLASS##Decl *D) { \<br>
- TRY_TO(WalkUpFrom##BASE(D)); \<br>
- TRY_TO(Visit##CLASS##Decl(D)); \<br>
- return true; \<br>
- } \<br>
+#define DECL(CLASS, BASE) \<br>
+ bool WalkUpFrom##CLASS##Decl(CLASS##Decl *D) { \<br>
+ TRY_TO(WalkUpFrom##BASE(D)); \<br>
+ TRY_TO(Visit##CLASS##Decl(D)); \<br>
+ return true; \<br>
+ } \<br>
bool Visit##CLASS##Decl(CLASS##Decl *D) { return true; }<br>
#include "clang/AST/DeclNodes.inc"<br>
<br>
@@ -417,7 +405,7 @@ private:<br>
bool TraverseTemplateParameterListHelper(TemplateParameterList *TPL);<br>
bool TraverseClassInstantiations(ClassTemplateDecl *D);<br>
bool TraverseVariableInstantiations(VarTemplateDecl *D);<br>
- bool TraverseFunctionInstantiations(FunctionTemplateDecl *D) ;<br>
+ bool TraverseFunctionInstantiations(FunctionTemplateDecl *D);<br>
bool TraverseTemplateArgumentLocsHelper(const TemplateArgumentLoc *TAL,<br>
unsigned Count);<br>
bool TraverseArrayTypeLocHelper(ArrayTypeLoc TL);<br>
@@ -429,27 +417,24 @@ private:<br>
bool TraverseVarHelper(VarDecl *D);<br>
bool TraverseOMPClause(OMPClause *C);<br>
bool TraverseOMPExecutableDirective(OMPExecutableDirective *S);<br>
-#define OPENMP_CLAUSE(Name, Class) \<br>
- bool Visit##Class(Class *C);<br>
+#define OPENMP_CLAUSE(Name, Class) bool Visit##Class(Class *C);<br>
#include "clang/Basic/OpenMPKinds.def"<br>
/// \brief Process clauses with list of variables.<br>
- template <typename T><br>
- void VisitOMPClauseList(T *Node);<br>
+ template <typename T> void VisitOMPClauseList(T *Node);<br>
<br>
typedef SmallVector<Stmt *, 16> StmtsTy;<br>
typedef SmallVector<StmtsTy *, 4> QueuesTy;<br>
-<br>
+<br>
QueuesTy Queues;<br>
<br>
class NewQueueRAII {<br>
RecursiveASTVisitor &RAV;<br>
+<br>
public:<br>
NewQueueRAII(StmtsTy &queue, RecursiveASTVisitor &RAV) : RAV(RAV) {<br>
RAV.Queues.push_back(&queue);<br>
}<br>
- ~NewQueueRAII() {<br>
- RAV.Queues.pop_back();<br>
- }<br>
+ ~NewQueueRAII() { RAV.Queues.pop_back(); }<br>
};<br>
<br>
StmtsTy &getCurrentQueue() {<br>
@@ -460,20 +445,19 @@ private:<br>
public:<br>
class StmtQueueAction {<br>
StmtsTy &CurrQueue;<br>
+<br>
public:<br>
explicit StmtQueueAction(RecursiveASTVisitor &RAV)<br>
- : CurrQueue(RAV.getCurrentQueue()) { }<br>
+ : CurrQueue(RAV.getCurrentQueue()) {}<br>
<br>
- void queue(Stmt *S) {<br>
- CurrQueue.push_back(S);<br>
- }<br>
+ void queue(Stmt *S) { CurrQueue.push_back(S); }<br>
};<br>
};<br>
<br>
-#define DISPATCH(NAME, CLASS, VAR) \<br>
- return getDerived().Traverse##NAME(static_cast<CLASS*>(VAR))<br>
+#define DISPATCH(NAME, CLASS, VAR) \<br>
+ return getDerived().Traverse##NAME(static_cast<CLASS *>(VAR))<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseStmt(Stmt *S) {<br>
if (!S)<br>
return true;<br>
@@ -489,84 +473,89 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
<br>
StmtsToEnqueu.clear();<br>
<br>
-#define DISPATCH_STMT(NAME, CLASS, VAR) \<br>
- TRY_TO(Traverse##NAME(static_cast<CLASS*>(VAR))); break<br>
+#define DISPATCH_STMT(NAME, CLASS, VAR) \<br>
+ TRY_TO(Traverse##NAME(static_cast<CLASS *>(VAR))); \<br>
+ break<br>
<br>
// If we have a binary expr, dispatch to the subcode of the binop. A smart<br>
// optimizer (e.g. LLVM) will fold this comparison into the switch stmt<br>
// below.<br>
if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(S)) {<br>
switch (BinOp->getOpcode()) {<br>
-#define OPERATOR(NAME) \<br>
- case BO_##NAME: DISPATCH_STMT(Bin##NAME, BinaryOperator, S);<br>
-<br>
- BINOP_LIST()<br>
+#define OPERATOR(NAME) \<br>
+ case BO_##NAME: \<br>
+ DISPATCH_STMT(Bin##NAME, BinaryOperator, S);<br>
+<br>
+ BINOP_LIST()<br>
#undef OPERATOR<br>
#undef BINOP_LIST<br>
-<br>
-#define OPERATOR(NAME) \<br>
- case BO_##NAME##Assign: \<br>
- DISPATCH_STMT(Bin##NAME##Assign, CompoundAssignOperator, S);<br>
-<br>
- CAO_LIST()<br>
+<br>
+#define OPERATOR(NAME) \<br>
+ case BO_##NAME##Assign: \<br>
+ DISPATCH_STMT(Bin##NAME##Assign, CompoundAssignOperator, S);<br>
+<br>
+ CAO_LIST()<br>
#undef OPERATOR<br>
#undef CAO_LIST<br>
}<br>
} else if (UnaryOperator *UnOp = dyn_cast<UnaryOperator>(S)) {<br>
switch (UnOp->getOpcode()) {<br>
-#define OPERATOR(NAME) \<br>
- case UO_##NAME: DISPATCH_STMT(Unary##NAME, UnaryOperator, S);<br>
-<br>
- UNARYOP_LIST()<br>
+#define OPERATOR(NAME) \<br>
+ case UO_##NAME: \<br>
+ DISPATCH_STMT(Unary##NAME, UnaryOperator, S);<br>
+<br>
+ UNARYOP_LIST()<br>
#undef OPERATOR<br>
#undef UNARYOP_LIST<br>
}<br>
} else {<br>
-<br>
+<br>
// Top switch stmt: dispatch to TraverseFooStmt for each concrete FooStmt.<br>
switch (S->getStmtClass()) {<br>
- case Stmt::NoStmtClass: break;<br>
+ case Stmt::NoStmtClass:<br>
+ break;<br>
#define ABSTRACT_STMT(STMT)<br>
-#define STMT(CLASS, PARENT) \<br>
- case Stmt::CLASS##Class: DISPATCH_STMT(CLASS, CLASS, S);<br>
+#define STMT(CLASS, PARENT) \<br>
+ case Stmt::CLASS##Class: \<br>
+ DISPATCH_STMT(CLASS, CLASS, S);<br>
#include "clang/AST/StmtNodes.inc"<br>
}<br>
}<br>
<br>
- for (SmallVectorImpl<Stmt *>::reverse_iterator<br>
- RI = StmtsToEnqueu.rbegin(),<br>
- RE = StmtsToEnqueu.rend(); RI != RE; ++RI)<br>
+ for (SmallVectorImpl<Stmt *>::reverse_iterator RI = StmtsToEnqueu.rbegin(),<br>
+ RE = StmtsToEnqueu.rend();<br>
+ RI != RE; ++RI)<br>
Queue.push_back(*RI);<br>
}<br>
<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseType(QualType T) {<br>
if (T.isNull())<br>
return true;<br>
<br>
switch (T->getTypeClass()) {<br>
#define ABSTRACT_TYPE(CLASS, BASE)<br>
-#define TYPE(CLASS, BASE) \<br>
- case Type::CLASS: DISPATCH(CLASS##Type, CLASS##Type, \<br>
- const_cast<Type*>(T.getTypePtr()));<br>
+#define TYPE(CLASS, BASE) \<br>
+ case Type::CLASS: \<br>
+ DISPATCH(CLASS##Type, CLASS##Type, const_cast<Type *>(T.getTypePtr()));<br>
#include "clang/AST/TypeNodes.def"<br>
}<br>
<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTypeLoc(TypeLoc TL) {<br>
if (TL.isNull())<br>
return true;<br>
<br>
switch (TL.getTypeLocClass()) {<br>
#define ABSTRACT_TYPELOC(CLASS, BASE)<br>
-#define TYPELOC(CLASS, BASE) \<br>
- case TypeLoc::CLASS: \<br>
+#define TYPELOC(CLASS, BASE) \<br>
+ case TypeLoc::CLASS: \<br>
return getDerived().Traverse##CLASS##TypeLoc(TL.castAs<CLASS##TypeLoc>());<br>
#include "clang/AST/TypeLocNodes.def"<br>
}<br>
@@ -574,13 +563,12 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-<br>
// Define the Traverse*Attr(Attr* A) methods<br>
#define VISITORCLASS RecursiveASTVisitor<br>
#include "clang/AST/AttrVisitor.inc"<br>
#undef VISITORCLASS<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseDecl(Decl *D) {<br>
if (!D)<br>
return true;<br>
@@ -593,10 +581,10 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
<br>
switch (D->getKind()) {<br>
#define ABSTRACT_DECL(DECL)<br>
-#define DECL(CLASS, BASE) \<br>
- case Decl::CLASS: \<br>
- if (!getDerived().Traverse##CLASS##Decl(static_cast<CLASS##Decl*>(D))) \<br>
- return false; \<br>
+#define DECL(CLASS, BASE) \<br>
+ case Decl::CLASS: \<br>
+ if (!getDerived().Traverse##CLASS##Decl(static_cast<CLASS##Decl *>(D))) \<br>
+ return false; \<br>
break;<br>
#include "clang/AST/DeclNodes.inc"<br>
}<br>
@@ -611,9 +599,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
<br>
#undef DISPATCH<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseNestedNameSpecifier(<br>
- NestedNameSpecifier *NNS) {<br>
+ NestedNameSpecifier *NNS) {<br>
if (!NNS)<br>
return true;<br>
<br>
@@ -635,14 +623,14 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseNestedNameSpecifierLoc(<br>
- NestedNameSpecifierLoc NNS) {<br>
+ NestedNameSpecifierLoc NNS) {<br>
if (!NNS)<br>
return true;<br>
<br>
- if (NestedNameSpecifierLoc Prefix = NNS.getPrefix())<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(Prefix));<br>
+ if (NestedNameSpecifierLoc Prefix = NNS.getPrefix())<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(Prefix));<br>
<br>
switch (NNS.getNestedNameSpecifier()->getKind()) {<br>
case NestedNameSpecifier::Identifier:<br>
@@ -660,9 +648,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseDeclarationNameInfo(<br>
- DeclarationNameInfo NameInfo) {<br>
+ DeclarationNameInfo NameInfo) {<br>
switch (NameInfo.getName().getNameKind()) {<br>
case DeclarationName::CXXConstructorName:<br>
case DeclarationName::CXXDestructorName:<br>
@@ -685,7 +673,7 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateName(TemplateName Template) {<br>
if (DependentTemplateName *DTN = Template.getAsDependentTemplateName())<br>
TRY_TO(TraverseNestedNameSpecifier(DTN->getQualifier()));<br>
@@ -695,9 +683,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateArgument(<br>
- const TemplateArgument &Arg) {<br>
+ const TemplateArgument &Arg) {<br>
switch (Arg.getKind()) {<br>
case TemplateArgument::Null:<br>
case TemplateArgument::Declaration:<br>
@@ -711,7 +699,7 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
case TemplateArgument::Template:<br>
case TemplateArgument::TemplateExpansion:<br>
return getDerived().TraverseTemplateName(<br>
- Arg.getAsTemplateOrTemplatePattern());<br>
+ Arg.getAsTemplateOrTemplatePattern());<br>
<br>
case TemplateArgument::Expression:<br>
return getDerived().TraverseStmt(Arg.getAsExpr());<br>
@@ -726,9 +714,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
<br>
// FIXME: no template name location?<br>
// FIXME: no source locations for a template argument pack?<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateArgumentLoc(<br>
- const TemplateArgumentLoc &ArgLoc) {<br>
+ const TemplateArgumentLoc &ArgLoc) {<br>
const TemplateArgument &Arg = ArgLoc.getArgument();<br>
<br>
switch (Arg.getKind()) {<br>
@@ -750,9 +738,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
case TemplateArgument::TemplateExpansion:<br>
if (ArgLoc.getTemplateQualifierLoc())<br>
TRY_TO(getDerived().TraverseNestedNameSpecifierLoc(<br>
- ArgLoc.getTemplateQualifierLoc()));<br>
+ ArgLoc.getTemplateQualifierLoc()));<br>
return getDerived().TraverseTemplateName(<br>
- Arg.getAsTemplateOrTemplatePattern());<br>
+ Arg.getAsTemplateOrTemplatePattern());<br>
<br>
case TemplateArgument::Expression:<br>
return getDerived().TraverseStmt(ArgLoc.getSourceExpression());<br>
@@ -765,10 +753,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateArguments(<br>
- const TemplateArgument *Args,<br>
- unsigned NumArgs) {<br>
+ const TemplateArgument *Args, unsigned NumArgs) {<br>
for (unsigned I = 0; I != NumArgs; ++I) {<br>
TRY_TO(TraverseTemplateArgument(Args[I]));<br>
}<br>
@@ -776,9 +763,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseConstructorInitializer(<br>
- CXXCtorInitializer *Init) {<br>
+ CXXCtorInitializer *Init) {<br>
if (TypeSourceInfo *TInfo = Init->getTypeSourceInfo())<br>
TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));<br>
<br>
@@ -795,81 +782,64 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
// ----------------- Type traversal -----------------<br>
<br>
// This macro makes available a variable T, the passed-in type.<br>
-#define DEF_TRAVERSE_TYPE(TYPE, CODE) \<br>
- template<typename Derived> \<br>
- bool RecursiveASTVisitor<Derived>::Traverse##TYPE (TYPE *T) { \<br>
- TRY_TO(WalkUpFrom##TYPE (T)); \<br>
- { CODE; } \<br>
- return true; \<br>
- }<br>
-<br>
-DEF_TRAVERSE_TYPE(BuiltinType, { })<br>
-<br>
-DEF_TRAVERSE_TYPE(ComplexType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(PointerType, {<br>
- TRY_TO(TraverseType(T->getPointeeType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(BlockPointerType, {<br>
- TRY_TO(TraverseType(T->getPointeeType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(LValueReferenceType, {<br>
- TRY_TO(TraverseType(T->getPointeeType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(RValueReferenceType, {<br>
- TRY_TO(TraverseType(T->getPointeeType()));<br>
- })<br>
+#define DEF_TRAVERSE_TYPE(TYPE, CODE) \<br>
+ template <typename Derived> \<br>
+ bool RecursiveASTVisitor<Derived>::Traverse##TYPE(TYPE *T) { \<br>
+ TRY_TO(WalkUpFrom##TYPE(T)); \<br>
+ { CODE; } \<br>
+ return true; \<br>
+ }<br>
+<br>
+DEF_TRAVERSE_TYPE(BuiltinType, {})<br>
+<br>
+DEF_TRAVERSE_TYPE(ComplexType, { TRY_TO(TraverseType(T->getElementType())); })<br>
+<br>
+DEF_TRAVERSE_TYPE(PointerType, { TRY_TO(TraverseType(T->getPointeeType())); })<br>
+<br>
+DEF_TRAVERSE_TYPE(BlockPointerType,<br>
+ { TRY_TO(TraverseType(T->getPointeeType())); })<br>
+<br>
+DEF_TRAVERSE_TYPE(LValueReferenceType,<br>
+ { TRY_TO(TraverseType(T->getPointeeType())); })<br>
+<br>
+DEF_TRAVERSE_TYPE(RValueReferenceType,<br>
+ { TRY_TO(TraverseType(T->getPointeeType())); })<br>
<br>
DEF_TRAVERSE_TYPE(MemberPointerType, {<br>
- TRY_TO(TraverseType(QualType(T->getClass(), 0)));<br>
- TRY_TO(TraverseType(T->getPointeeType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(DecayedType, {<br>
- TRY_TO(TraverseType(T->getOriginalType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(AdjustedType, {<br>
- TRY_TO(TraverseType(T->getOriginalType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(ConstantArrayType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(IncompleteArrayType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- })<br>
+ TRY_TO(TraverseType(QualType(T->getClass(), 0)));<br>
+ TRY_TO(TraverseType(T->getPointeeType()));<br>
+})<br>
+<br>
+DEF_TRAVERSE_TYPE(DecayedType, { TRY_TO(TraverseType(T->getOriginalType())); })<br>
+<br>
+DEF_TRAVERSE_TYPE(AdjustedType, { TRY_TO(TraverseType(T->getOriginalType())); })<br>
+<br>
+DEF_TRAVERSE_TYPE(ConstantArrayType,<br>
+ { TRY_TO(TraverseType(T->getElementType())); })<br>
+<br>
+DEF_TRAVERSE_TYPE(IncompleteArrayType,<br>
+ { TRY_TO(TraverseType(T->getElementType())); })<br>
<br>
DEF_TRAVERSE_TYPE(VariableArrayType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- TRY_TO(TraverseStmt(T->getSizeExpr()));<br>
- })<br>
+ TRY_TO(TraverseType(T->getElementType()));<br>
+ TRY_TO(TraverseStmt(T->getSizeExpr()));<br>
+})<br>
<br>
DEF_TRAVERSE_TYPE(DependentSizedArrayType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- if (T->getSizeExpr())<br>
- TRY_TO(TraverseStmt(T->getSizeExpr()));<br>
- })<br>
+ TRY_TO(TraverseType(T->getElementType()));<br>
+ if (T->getSizeExpr())<br>
+ TRY_TO(TraverseStmt(T->getSizeExpr()));<br>
+})<br>
<br>
DEF_TRAVERSE_TYPE(DependentSizedExtVectorType, {<br>
- if (T->getSizeExpr())<br>
- TRY_TO(TraverseStmt(T->getSizeExpr()));<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(VectorType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(ExtVectorType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- })<br>
+ if (T->getSizeExpr())<br>
+ TRY_TO(TraverseStmt(T->getSizeExpr()));<br>
+ TRY_TO(TraverseType(T->getElementType()));<br>
+})<br>
+<br>
+DEF_TRAVERSE_TYPE(VectorType, { TRY_TO(TraverseType(T->getElementType())); })<br>
+<br>
+DEF_TRAVERSE_TYPE(ExtVectorType, { TRY_TO(TraverseType(T->getElementType())); })<br>
<br>
DEF_TRAVERSE_TYPE(FunctionNoProtoType,<br>
{ TRY_TO(TraverseType(T->getReturnType())); })<br>
@@ -886,87 +856,72 @@ DEF_TRAVERSE_TYPE(FunctionProtoType, {<br>
}<br>
})<br>
<br>
-DEF_TRAVERSE_TYPE(UnresolvedUsingType, { })<br>
-DEF_TRAVERSE_TYPE(TypedefType, { })<br>
+DEF_TRAVERSE_TYPE(UnresolvedUsingType, {})<br>
+DEF_TRAVERSE_TYPE(TypedefType, {})<br>
+<br>
+DEF_TRAVERSE_TYPE(TypeOfExprType,<br>
+ { TRY_TO(TraverseStmt(T->getUnderlyingExpr())); })<br>
<br>
-DEF_TRAVERSE_TYPE(TypeOfExprType, {<br>
- TRY_TO(TraverseStmt(T->getUnderlyingExpr()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(TypeOfType, {<br>
- TRY_TO(TraverseType(T->getUnderlyingType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(DecltypeType, {<br>
- TRY_TO(TraverseStmt(T->getUnderlyingExpr()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(TypeOfType, { TRY_TO(TraverseType(T->getUnderlyingType())); })<br>
+<br>
+DEF_TRAVERSE_TYPE(DecltypeType,<br>
+ { TRY_TO(TraverseStmt(T->getUnderlyingExpr())); })<br>
<br>
DEF_TRAVERSE_TYPE(UnaryTransformType, {<br>
- TRY_TO(TraverseType(T->getBaseType()));<br>
- TRY_TO(TraverseType(T->getUnderlyingType()));<br>
- })<br>
+ TRY_TO(TraverseType(T->getBaseType()));<br>
+ TRY_TO(TraverseType(T->getUnderlyingType()));<br>
+})<br>
+<br>
+DEF_TRAVERSE_TYPE(AutoType, { TRY_TO(TraverseType(T->getDeducedType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(AutoType, {<br>
- TRY_TO(TraverseType(T->getDeducedType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(RecordType, { })<br>
-DEF_TRAVERSE_TYPE(EnumType, { })<br>
-DEF_TRAVERSE_TYPE(TemplateTypeParmType, { })<br>
-DEF_TRAVERSE_TYPE(SubstTemplateTypeParmType, { })<br>
-DEF_TRAVERSE_TYPE(SubstTemplateTypeParmPackType, { })<br>
+DEF_TRAVERSE_TYPE(RecordType, {})<br>
+DEF_TRAVERSE_TYPE(EnumType, {})<br>
+DEF_TRAVERSE_TYPE(TemplateTypeParmType, {})<br>
+DEF_TRAVERSE_TYPE(SubstTemplateTypeParmType, {})<br>
+DEF_TRAVERSE_TYPE(SubstTemplateTypeParmPackType, {})<br>
<br>
DEF_TRAVERSE_TYPE(TemplateSpecializationType, {<br>
- TRY_TO(TraverseTemplateName(T->getTemplateName()));<br>
- TRY_TO(TraverseTemplateArguments(T->getArgs(), T->getNumArgs()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(InjectedClassNameType, { })<br>
-<br>
-DEF_TRAVERSE_TYPE(AttributedType, {<br>
- TRY_TO(TraverseType(T->getModifiedType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(ParenType, {<br>
- TRY_TO(TraverseType(T->getInnerType()));<br>
- })<br>
+ TRY_TO(TraverseTemplateName(T->getTemplateName()));<br>
+ TRY_TO(TraverseTemplateArguments(T->getArgs(), T->getNumArgs()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPE(ElaboratedType, {<br>
- if (T->getQualifier()) {<br>
- TRY_TO(TraverseNestedNameSpecifier(T->getQualifier()));<br>
- }<br>
- TRY_TO(TraverseType(T->getNamedType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(InjectedClassNameType, {})<br>
<br>
-DEF_TRAVERSE_TYPE(DependentNameType, {<br>
+DEF_TRAVERSE_TYPE(AttributedType,<br>
+ { TRY_TO(TraverseType(T->getModifiedType())); })<br>
+<br>
+DEF_TRAVERSE_TYPE(ParenType, { TRY_TO(TraverseType(T->getInnerType())); })<br>
+<br>
+DEF_TRAVERSE_TYPE(ElaboratedType, {<br>
+ if (T->getQualifier()) {<br>
TRY_TO(TraverseNestedNameSpecifier(T->getQualifier()));<br>
- })<br>
+ }<br>
+ TRY_TO(TraverseType(T->getNamedType()));<br>
+})<br>
+<br>
+DEF_TRAVERSE_TYPE(DependentNameType,<br>
+ { TRY_TO(TraverseNestedNameSpecifier(T->getQualifier())); })<br>
<br>
DEF_TRAVERSE_TYPE(DependentTemplateSpecializationType, {<br>
- TRY_TO(TraverseNestedNameSpecifier(T->getQualifier()));<br>
- TRY_TO(TraverseTemplateArguments(T->getArgs(), T->getNumArgs()));<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifier(T->getQualifier()));<br>
+ TRY_TO(TraverseTemplateArguments(T->getArgs(), T->getNumArgs()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPE(PackExpansionType, {<br>
- TRY_TO(TraverseType(T->getPattern()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(PackExpansionType, { TRY_TO(TraverseType(T->getPattern())); })<br>
<br>
-DEF_TRAVERSE_TYPE(ObjCInterfaceType, { })<br>
+DEF_TRAVERSE_TYPE(ObjCInterfaceType, {})<br>
<br>
DEF_TRAVERSE_TYPE(ObjCObjectType, {<br>
- // We have to watch out here because an ObjCInterfaceType's base<br>
- // type is itself.<br>
- if (T->getBaseType().getTypePtr() != T)<br>
- TRY_TO(TraverseType(T->getBaseType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(ObjCObjectPointerType, {<br>
- TRY_TO(TraverseType(T->getPointeeType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(AtomicType, {<br>
- TRY_TO(TraverseType(T->getValueType()));<br>
- })<br>
+ // We have to watch out here because an ObjCInterfaceType's base<br>
+ // type is itself.<br>
+ if (T->getBaseType().getTypePtr() != T)<br>
+ TRY_TO(TraverseType(T->getBaseType()));<br>
+})<br>
+<br>
+DEF_TRAVERSE_TYPE(ObjCObjectPointerType,<br>
+ { TRY_TO(TraverseType(T->getPointeeType())); })<br>
+<br>
+DEF_TRAVERSE_TYPE(AtomicType, { TRY_TO(TraverseType(T->getValueType())); })<br>
<br>
#undef DEF_TRAVERSE_TYPE<br>
<br>
@@ -977,19 +932,19 @@ DEF_TRAVERSE_TYPE(AtomicType, {<br>
// in addition to WalkUpFrom* for the TypeLoc itself, such that existing<br>
// clients that override the WalkUpFrom*Type() and/or Visit*Type() methods<br>
// continue to work.<br>
-#define DEF_TRAVERSE_TYPELOC(TYPE, CODE) \<br>
- template<typename Derived> \<br>
- bool RecursiveASTVisitor<Derived>::Traverse##TYPE##Loc(TYPE##Loc TL) { \<br>
- if (getDerived().shouldWalkTypesOfTypeLocs()) \<br>
- TRY_TO(WalkUpFrom##TYPE(const_cast<TYPE*>(TL.getTypePtr()))); \<br>
- TRY_TO(WalkUpFrom##TYPE##Loc(TL)); \<br>
- { CODE; } \<br>
- return true; \<br>
+#define DEF_TRAVERSE_TYPELOC(TYPE, CODE) \<br>
+ template <typename Derived> \<br>
+ bool RecursiveASTVisitor<Derived>::Traverse##TYPE##Loc(TYPE##Loc TL) { \<br>
+ if (getDerived().shouldWalkTypesOfTypeLocs()) \<br>
+ TRY_TO(WalkUpFrom##TYPE(const_cast<TYPE *>(TL.getTypePtr()))); \<br>
+ TRY_TO(WalkUpFrom##TYPE##Loc(TL)); \<br>
+ { CODE; } \<br>
+ return true; \<br>
}<br>
<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::TraverseQualifiedTypeLoc(<br>
- QualifiedTypeLoc TL) {<br>
+template <typename Derived><br>
+bool<br>
+RecursiveASTVisitor<Derived>::TraverseQualifiedTypeLoc(QualifiedTypeLoc TL) {<br>
// Move this over to the 'main' typeloc tree. Note that this is a<br>
// move -- we pretend that we were really looking at the unqualified<br>
// typeloc all along -- rather than a recursion, so we don't follow<br>
@@ -1008,46 +963,40 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return TraverseTypeLoc(TL.getUnqualifiedLoc());<br>
}<br>
<br>
-DEF_TRAVERSE_TYPELOC(BuiltinType, { })<br>
+DEF_TRAVERSE_TYPELOC(BuiltinType, {})<br>
<br>
// FIXME: ComplexTypeLoc is unfinished<br>
DEF_TRAVERSE_TYPELOC(ComplexType, {<br>
- TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
- })<br>
+ TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(PointerType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPELOC(BlockPointerType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPELOC(LValueReferenceType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPELOC(RValueReferenceType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(PointerType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })<br>
+<br>
+DEF_TRAVERSE_TYPELOC(BlockPointerType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })<br>
+<br>
+DEF_TRAVERSE_TYPELOC(LValueReferenceType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })<br>
+<br>
+DEF_TRAVERSE_TYPELOC(RValueReferenceType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })<br>
<br>
// FIXME: location of base class?<br>
// We traverse this in the type case as well, but how is it not reached through<br>
// the pointee type?<br>
DEF_TRAVERSE_TYPELOC(MemberPointerType, {<br>
- TRY_TO(TraverseType(QualType(TL.getTypePtr()->getClass(), 0)));<br>
- TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPELOC(DecayedType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getOriginalLoc()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPELOC(AdjustedType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getOriginalLoc()));<br>
- })<br>
+ TRY_TO(TraverseType(QualType(TL.getTypePtr()->getClass(), 0)));<br>
+ TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
+})<br>
+<br>
+DEF_TRAVERSE_TYPELOC(DecayedType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getOriginalLoc())); })<br>
<br>
-template<typename Derived><br>
+DEF_TRAVERSE_TYPELOC(AdjustedType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getOriginalLoc())); })<br>
+<br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseArrayTypeLocHelper(ArrayTypeLoc TL) {<br>
// This isn't available for ArrayType, but is for the ArrayTypeLoc.<br>
TRY_TO(TraverseStmt(TL.getSizeExpr()));<br>
@@ -1055,156 +1004,147 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
<br>
DEF_TRAVERSE_TYPELOC(ConstantArrayType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
- return TraverseArrayTypeLocHelper(TL);<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
+ return TraverseArrayTypeLocHelper(TL);<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(IncompleteArrayType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
- return TraverseArrayTypeLocHelper(TL);<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
+ return TraverseArrayTypeLocHelper(TL);<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(VariableArrayType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
- return TraverseArrayTypeLocHelper(TL);<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
+ return TraverseArrayTypeLocHelper(TL);<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(DependentSizedArrayType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
- return TraverseArrayTypeLocHelper(TL);<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
+ return TraverseArrayTypeLocHelper(TL);<br>
+})<br>
<br>
// FIXME: order? why not size expr first?<br>
// FIXME: base VectorTypeLoc is unfinished<br>
DEF_TRAVERSE_TYPELOC(DependentSizedExtVectorType, {<br>
- if (TL.getTypePtr()->getSizeExpr())<br>
- TRY_TO(TraverseStmt(TL.getTypePtr()->getSizeExpr()));<br>
- TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
- })<br>
+ if (TL.getTypePtr()->getSizeExpr())<br>
+ TRY_TO(TraverseStmt(TL.getTypePtr()->getSizeExpr()));<br>
+ TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
+})<br>
<br>
// FIXME: VectorTypeLoc is unfinished<br>
DEF_TRAVERSE_TYPELOC(VectorType, {<br>
- TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
- })<br>
+ TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
+})<br>
<br>
// FIXME: size and attributes<br>
// FIXME: base VectorTypeLoc is unfinished<br>
DEF_TRAVERSE_TYPELOC(ExtVectorType, {<br>
- TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
- })<br>
+ TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(FunctionNoProtoType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getReturnLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(FunctionNoProtoType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getReturnLoc())); })<br>
<br>
// FIXME: location of exception specifications (attributes?)<br>
DEF_TRAVERSE_TYPELOC(FunctionProtoType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getReturnLoc()));<br>
+ TRY_TO(TraverseTypeLoc(TL.getReturnLoc()));<br>
<br>
- const FunctionProtoType *T = TL.getTypePtr();<br>
+ const FunctionProtoType *T = TL.getTypePtr();<br>
<br>
- for (unsigned I = 0, E = TL.getNumParams(); I != E; ++I) {<br>
- if (TL.getParam(I)) {<br>
- TRY_TO(TraverseDecl(TL.getParam(I)));<br>
- } else if (I < T->getNumParams()) {<br>
- TRY_TO(TraverseType(T->getParamType(I)));<br>
- }<br>
+ for (unsigned I = 0, E = TL.getNumParams(); I != E; ++I) {<br>
+ if (TL.getParam(I)) {<br>
+ TRY_TO(TraverseDecl(TL.getParam(I)));<br>
+ } else if (I < T->getNumParams()) {<br>
+ TRY_TO(TraverseType(T->getParamType(I)));<br>
}<br>
+ }<br>
<br>
- for (const auto &E : T->exceptions()) {<br>
- TRY_TO(TraverseType(E));<br>
- }<br>
- })<br>
+ for (const auto &E : T->exceptions()) {<br>
+ TRY_TO(TraverseType(E));<br>
+ }<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(UnresolvedUsingType, { })<br>
-DEF_TRAVERSE_TYPELOC(TypedefType, { })<br>
+DEF_TRAVERSE_TYPELOC(UnresolvedUsingType, {})<br>
+DEF_TRAVERSE_TYPELOC(TypedefType, {})<br>
<br>
-DEF_TRAVERSE_TYPELOC(TypeOfExprType, {<br>
- TRY_TO(TraverseStmt(TL.getUnderlyingExpr()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(TypeOfExprType,<br>
+ { TRY_TO(TraverseStmt(TL.getUnderlyingExpr())); })<br>
<br>
DEF_TRAVERSE_TYPELOC(TypeOfType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getUnderlyingTInfo()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(TL.getUnderlyingTInfo()->getTypeLoc()));<br>
+})<br>
<br>
// FIXME: location of underlying expr<br>
DEF_TRAVERSE_TYPELOC(DecltypeType, {<br>
- TRY_TO(TraverseStmt(TL.getTypePtr()->getUnderlyingExpr()));<br>
- })<br>
+ TRY_TO(TraverseStmt(TL.getTypePtr()->getUnderlyingExpr()));<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(UnaryTransformType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getUnderlyingTInfo()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(TL.getUnderlyingTInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(AutoType, {<br>
- TRY_TO(TraverseType(TL.getTypePtr()->getDeducedType()));<br>
- })<br>
+ TRY_TO(TraverseType(TL.getTypePtr()->getDeducedType()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(RecordType, { })<br>
-DEF_TRAVERSE_TYPELOC(EnumType, { })<br>
-DEF_TRAVERSE_TYPELOC(TemplateTypeParmType, { })<br>
-DEF_TRAVERSE_TYPELOC(SubstTemplateTypeParmType, { })<br>
-DEF_TRAVERSE_TYPELOC(SubstTemplateTypeParmPackType, { })<br>
+DEF_TRAVERSE_TYPELOC(RecordType, {})<br>
+DEF_TRAVERSE_TYPELOC(EnumType, {})<br>
+DEF_TRAVERSE_TYPELOC(TemplateTypeParmType, {})<br>
+DEF_TRAVERSE_TYPELOC(SubstTemplateTypeParmType, {})<br>
+DEF_TRAVERSE_TYPELOC(SubstTemplateTypeParmPackType, {})<br>
<br>
// FIXME: use the loc for the template name?<br>
DEF_TRAVERSE_TYPELOC(TemplateSpecializationType, {<br>
- TRY_TO(TraverseTemplateName(TL.getTypePtr()->getTemplateName()));<br>
- for (unsigned I = 0, E = TL.getNumArgs(); I != E; ++I) {<br>
- TRY_TO(TraverseTemplateArgumentLoc(TL.getArgLoc(I)));<br>
- }<br>
- })<br>
+ TRY_TO(TraverseTemplateName(TL.getTypePtr()->getTemplateName()));<br>
+ for (unsigned I = 0, E = TL.getNumArgs(); I != E; ++I) {<br>
+ TRY_TO(TraverseTemplateArgumentLoc(TL.getArgLoc(I)));<br>
+ }<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(InjectedClassNameType, { })<br>
+DEF_TRAVERSE_TYPELOC(InjectedClassNameType, {})<br>
<br>
-DEF_TRAVERSE_TYPELOC(ParenType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getInnerLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(ParenType, { TRY_TO(TraverseTypeLoc(TL.getInnerLoc())); })<br>
<br>
-DEF_TRAVERSE_TYPELOC(AttributedType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getModifiedLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(AttributedType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getModifiedLoc())); })<br>
<br>
DEF_TRAVERSE_TYPELOC(ElaboratedType, {<br>
- if (TL.getQualifierLoc()) {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));<br>
- }<br>
- TRY_TO(TraverseTypeLoc(TL.getNamedTypeLoc()));<br>
- })<br>
+ if (TL.getQualifierLoc()) {<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));<br>
+ }<br>
+ TRY_TO(TraverseTypeLoc(TL.getNamedTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(DependentNameType, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(DependentTemplateSpecializationType, {<br>
- if (TL.getQualifierLoc()) {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));<br>
- }<br>
+ if (TL.getQualifierLoc()) {<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));<br>
+ }<br>
<br>
- for (unsigned I = 0, E = TL.getNumArgs(); I != E; ++I) {<br>
- TRY_TO(TraverseTemplateArgumentLoc(TL.getArgLoc(I)));<br>
- }<br>
- })<br>
+ for (unsigned I = 0, E = TL.getNumArgs(); I != E; ++I) {<br>
+ TRY_TO(TraverseTemplateArgumentLoc(TL.getArgLoc(I)));<br>
+ }<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(PackExpansionType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getPatternLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(PackExpansionType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getPatternLoc())); })<br>
<br>
-DEF_TRAVERSE_TYPELOC(ObjCInterfaceType, { })<br>
+DEF_TRAVERSE_TYPELOC(ObjCInterfaceType, {})<br>
<br>
DEF_TRAVERSE_TYPELOC(ObjCObjectType, {<br>
- // We have to watch out here because an ObjCInterfaceType's base<br>
- // type is itself.<br>
- if (TL.getTypePtr()->getBaseType().getTypePtr() != TL.getTypePtr())<br>
- TRY_TO(TraverseTypeLoc(TL.getBaseLoc()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPELOC(ObjCObjectPointerType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPELOC(AtomicType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getValueLoc()));<br>
- })<br>
+ // We have to watch out here because an ObjCInterfaceType's base<br>
+ // type is itself.<br>
+ if (TL.getTypePtr()->getBaseType().getTypePtr() != TL.getTypePtr())<br>
+ TRY_TO(TraverseTypeLoc(TL.getBaseLoc()));<br>
+})<br>
+<br>
+DEF_TRAVERSE_TYPELOC(ObjCObjectPointerType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })<br>
+<br>
+DEF_TRAVERSE_TYPELOC(AtomicType, { TRY_TO(TraverseTypeLoc(TL.getValueLoc())); })<br>
<br>
#undef DEF_TRAVERSE_TYPELOC<br>
<br>
@@ -1215,7 +1155,7 @@ DEF_TRAVERSE_TYPELOC(AtomicType, {<br>
// Therefore each Traverse* only needs to worry about children other<br>
// than those.<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseDeclContextHelper(DeclContext *DC) {<br>
if (!DC)<br>
return true;<br>
@@ -1231,131 +1171,121 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
<br>
// This macro makes available a variable D, the passed-in decl.<br>
-#define DEF_TRAVERSE_DECL(DECL, CODE) \<br>
-template<typename Derived> \<br>
-bool RecursiveASTVisitor<Derived>::Traverse##DECL (DECL *D) { \<br>
- TRY_TO(WalkUpFrom##DECL (D)); \<br>
- { CODE; } \<br>
- TRY_TO(TraverseDeclContextHelper(dyn_cast<DeclContext>(D))); \<br>
- return true; \<br>
-}<br>
+#define DEF_TRAVERSE_DECL(DECL, CODE) \<br>
+ template <typename Derived> \<br>
+ bool RecursiveASTVisitor<Derived>::Traverse##DECL(DECL *D) { \<br>
+ TRY_TO(WalkUpFrom##DECL(D)); \<br>
+ { CODE; } \<br>
+ TRY_TO(TraverseDeclContextHelper(dyn_cast<DeclContext>(D))); \<br>
+ return true; \<br>
+ }<br>
<br>
-DEF_TRAVERSE_DECL(AccessSpecDecl, { })<br>
+DEF_TRAVERSE_DECL(AccessSpecDecl, {})<br>
<br>
DEF_TRAVERSE_DECL(BlockDecl, {<br>
- if (TypeSourceInfo *TInfo = D->getSignatureAsWritten())<br>
- TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));<br>
- TRY_TO(TraverseStmt(D->getBody()));<br>
- // This return statement makes sure the traversal of nodes in<br>
- // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)<br>
- // is skipped - don't remove it.<br>
- return true;<br>
- })<br>
+ if (TypeSourceInfo *TInfo = D->getSignatureAsWritten())<br>
+ TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));<br>
+ TRY_TO(TraverseStmt(D->getBody()));<br>
+ // This return statement makes sure the traversal of nodes in<br>
+ // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)<br>
+ // is skipped - don't remove it.<br>
+ return true;<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(CapturedDecl, {<br>
- TRY_TO(TraverseStmt(D->getBody()));<br>
- // This return statement makes sure the traversal of nodes in<br>
- // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)<br>
- // is skipped - don't remove it.<br>
- return true;<br>
- })<br>
+ TRY_TO(TraverseStmt(D->getBody()));<br>
+ // This return statement makes sure the traversal of nodes in<br>
+ // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)<br>
+ // is skipped - don't remove it.<br>
+ return true;<br>
+})<br>
<br>
-DEF_TRAVERSE_DECL(EmptyDecl, { })<br>
+DEF_TRAVERSE_DECL(EmptyDecl, {})<br>
<br>
-DEF_TRAVERSE_DECL(FileScopeAsmDecl, {<br>
- TRY_TO(TraverseStmt(D->getAsmString()));<br>
- })<br>
+DEF_TRAVERSE_DECL(FileScopeAsmDecl,<br>
+ { TRY_TO(TraverseStmt(D->getAsmString())); })<br>
<br>
-DEF_TRAVERSE_DECL(ImportDecl, { })<br>
+DEF_TRAVERSE_DECL(ImportDecl, {})<br>
<br>
DEF_TRAVERSE_DECL(FriendDecl, {<br>
- // Friend is either decl or a type.<br>
- if (D->getFriendType())<br>
- TRY_TO(TraverseTypeLoc(D->getFriendType()->getTypeLoc()));<br>
- else<br>
- TRY_TO(TraverseDecl(D->getFriendDecl()));<br>
- })<br>
+ // Friend is either decl or a type.<br>
+ if (D->getFriendType())<br>
+ TRY_TO(TraverseTypeLoc(D->getFriendType()->getTypeLoc()));<br>
+ else<br>
+ TRY_TO(TraverseDecl(D->getFriendDecl()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(FriendTemplateDecl, {<br>
- if (D->getFriendType())<br>
- TRY_TO(TraverseTypeLoc(D->getFriendType()->getTypeLoc()));<br>
- else<br>
- TRY_TO(TraverseDecl(D->getFriendDecl()));<br>
- for (unsigned I = 0, E = D->getNumTemplateParameters(); I < E; ++I) {<br>
- TemplateParameterList *TPL = D->getTemplateParameterList(I);<br>
- for (TemplateParameterList::iterator ITPL = TPL->begin(),<br>
- ETPL = TPL->end();<br>
- ITPL != ETPL; ++ITPL) {<br>
- TRY_TO(TraverseDecl(*ITPL));<br>
- }<br>
+ if (D->getFriendType())<br>
+ TRY_TO(TraverseTypeLoc(D->getFriendType()->getTypeLoc()));<br>
+ else<br>
+ TRY_TO(TraverseDecl(D->getFriendDecl()));<br>
+ for (unsigned I = 0, E = D->getNumTemplateParameters(); I < E; ++I) {<br>
+ TemplateParameterList *TPL = D->getTemplateParameterList(I);<br>
+ for (TemplateParameterList::iterator ITPL = TPL->begin(), ETPL = TPL->end();<br>
+ ITPL != ETPL; ++ITPL) {<br>
+ TRY_TO(TraverseDecl(*ITPL));<br>
}<br>
- })<br>
+ }<br>
+})<br>
<br>
-DEF_TRAVERSE_DECL(ClassScopeFunctionSpecializationDecl, {<br>
- TRY_TO(TraverseDecl(D->getSpecialization()));<br>
- })<br>
+DEF_TRAVERSE_DECL(ClassScopeFunctionSpecializationDecl,<br>
+ { TRY_TO(TraverseDecl(D->getSpecialization())); })<br>
<br>
-DEF_TRAVERSE_DECL(LinkageSpecDecl, { })<br>
+DEF_TRAVERSE_DECL(LinkageSpecDecl, {})<br>
<br>
-DEF_TRAVERSE_DECL(ObjCPropertyImplDecl, {<br>
- // FIXME: implement this<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCPropertyImplDecl, {// FIXME: implement this<br>
+ })<br>
<br>
DEF_TRAVERSE_DECL(StaticAssertDecl, {<br>
- TRY_TO(TraverseStmt(D->getAssertExpr()));<br>
- TRY_TO(TraverseStmt(D->getMessage()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_DECL(TranslationUnitDecl, {<br>
- // Code in an unnamed namespace shows up automatically in<br>
- // decls_begin()/decls_end(). Thus we don't need to recurse on<br>
- // D->getAnonymousNamespace().<br>
- })<br>
+ TRY_TO(TraverseStmt(D->getAssertExpr()));<br>
+ TRY_TO(TraverseStmt(D->getMessage()));<br>
+})<br>
<br>
-DEF_TRAVERSE_DECL(NamespaceAliasDecl, {<br>
- // We shouldn't traverse an aliased namespace, since it will be<br>
- // defined (and, therefore, traversed) somewhere else.<br>
- //<br>
- // This return statement makes sure the traversal of nodes in<br>
- // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)<br>
- // is skipped - don't remove it.<br>
- return true;<br>
- })<br>
+DEF_TRAVERSE_DECL(<br>
+ TranslationUnitDecl,<br>
+ {// Code in an unnamed namespace shows up automatically in<br>
+ // decls_begin()/decls_end(). Thus we don't need to recurse on<br>
+ // D->getAnonymousNamespace().<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(LabelDecl, {<br>
- // There is no code in a LabelDecl.<br>
+DEF_TRAVERSE_DECL(NamespaceAliasDecl, {<br>
+ // We shouldn't traverse an aliased namespace, since it will be<br>
+ // defined (and, therefore, traversed) somewhere else.<br>
+ //<br>
+ // This return statement makes sure the traversal of nodes in<br>
+ // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)<br>
+ // is skipped - don't remove it.<br>
+ return true;<br>
})<br>
<br>
+DEF_TRAVERSE_DECL(LabelDecl, {// There is no code in a LabelDecl.<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(NamespaceDecl, {<br>
- // Code in an unnamed namespace shows up automatically in<br>
- // decls_begin()/decls_end(). Thus we don't need to recurse on<br>
- // D->getAnonymousNamespace().<br>
- })<br>
+DEF_TRAVERSE_DECL(<br>
+ NamespaceDecl,<br>
+ {// Code in an unnamed namespace shows up automatically in<br>
+ // decls_begin()/decls_end(). Thus we don't need to recurse on<br>
+ // D->getAnonymousNamespace().<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(ObjCCompatibleAliasDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCCompatibleAliasDecl, {// FIXME: implement<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(ObjCCategoryDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCCategoryDecl, {// FIXME: implement<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(ObjCCategoryImplDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCCategoryImplDecl, {// FIXME: implement<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(ObjCImplementationDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCImplementationDecl, {// FIXME: implement<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(ObjCInterfaceDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCInterfaceDecl, {// FIXME: implement<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(ObjCProtocolDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCProtocolDecl, {// FIXME: implement<br>
+ })<br>
<br>
DEF_TRAVERSE_DECL(ObjCMethodDecl, {<br>
if (D->getReturnTypeSourceInfo()) {<br>
@@ -1371,29 +1301,28 @@ DEF_TRAVERSE_DECL(ObjCMethodDecl, {<br>
return true;<br>
})<br>
<br>
-DEF_TRAVERSE_DECL(ObjCPropertyDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCPropertyDecl, {// FIXME: implement<br>
+ })<br>
<br>
DEF_TRAVERSE_DECL(UsingDecl, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(UsingDirectiveDecl, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
+})<br>
<br>
-DEF_TRAVERSE_DECL(UsingShadowDecl, { })<br>
+DEF_TRAVERSE_DECL(UsingShadowDecl, {})<br>
<br>
DEF_TRAVERSE_DECL(OMPThreadPrivateDecl, {<br>
- for (auto *I : D->varlists()) {<br>
- TRY_TO(TraverseStmt(I));<br>
- }<br>
- })<br>
+ for (auto *I : D->varlists()) {<br>
+ TRY_TO(TraverseStmt(I));<br>
+ }<br>
+})<br>
<br>
// A helper method for TemplateDecl's children.<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateParameterListHelper(<br>
TemplateParameterList *TPL) {<br>
if (TPL) {<br>
@@ -1407,7 +1336,7 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
<br>
// A helper method for traversing the implicit instantiations of a<br>
// class template.<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseClassInstantiations(<br>
ClassTemplateDecl *D) {<br>
for (auto *SD : D->specializations()) {<br>
@@ -1416,8 +1345,8 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
if (cast<CXXRecordDecl>(RD)->isInjectedClassName())<br>
continue;<br>
<br>
- switch (cast<ClassTemplateSpecializationDecl>(RD)-><br>
- getSpecializationKind()) {<br>
+ switch (<br>
+ cast<ClassTemplateSpecializationDecl>(RD)->getSpecializationKind()) {<br>
// Visit the implicit instantiations with the requested pattern.<br>
case TSK_Undeclared:<br>
case TSK_ImplicitInstantiation:<br>
@@ -1439,24 +1368,24 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
<br>
DEF_TRAVERSE_DECL(ClassTemplateDecl, {<br>
- CXXRecordDecl* TempDecl = D->getTemplatedDecl();<br>
- TRY_TO(TraverseDecl(TempDecl));<br>
- TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
-<br>
- // By default, we do not traverse the instantiations of<br>
- // class templates since they do not appear in the user code. The<br>
- // following code optionally traverses them.<br>
- //<br>
- // We only traverse the class instantiations when we see the canonical<br>
- // declaration of the template, to ensure we only visit them once.<br>
- if (getDerived().shouldVisitTemplateInstantiations() &&<br>
- D == D->getCanonicalDecl())<br>
- TRY_TO(TraverseClassInstantiations(D));<br>
-<br>
- // Note that getInstantiatedFromMemberTemplate() is just a link<br>
- // from a template instantiation back to the template from which<br>
- // it was instantiated, and thus should not be traversed.<br>
- })<br>
+ CXXRecordDecl *TempDecl = D->getTemplatedDecl();<br>
+ TRY_TO(TraverseDecl(TempDecl));<br>
+ TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
+<br>
+ // By default, we do not traverse the instantiations of<br>
+ // class templates since they do not appear in the user code. The<br>
+ // following code optionally traverses them.<br>
+ //<br>
+ // We only traverse the class instantiations when we see the canonical<br>
+ // declaration of the template, to ensure we only visit them once.<br>
+ if (getDerived().shouldVisitTemplateInstantiations() &&<br>
+ D == D->getCanonicalDecl())<br>
+ TRY_TO(TraverseClassInstantiations(D));<br>
+<br>
+ // Note that getInstantiatedFromMemberTemplate() is just a link<br>
+ // from a template instantiation back to the template from which<br>
+ // it was instantiated, and thus should not be traversed.<br>
+})<br>
<br>
// A helper method for traversing the implicit instantiations of a<br>
// class template.<br>
@@ -1465,8 +1394,8 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
VarTemplateDecl *D) {<br>
for (auto *SD : D->specializations()) {<br>
for (auto *RD : SD->redecls()) {<br>
- switch (cast<VarTemplateSpecializationDecl>(RD)-><br>
- getSpecializationKind()) {<br>
+ switch (<br>
+ cast<VarTemplateSpecializationDecl>(RD)->getSpecializationKind()) {<br>
// Visit the implicit instantiations with the requested pattern.<br>
case TSK_Undeclared:<br>
case TSK_ImplicitInstantiation:<br>
@@ -1487,9 +1416,7 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-DEF_TRAVERSE_DECL(<br>
- VarTemplateDecl,<br>
- {<br>
+DEF_TRAVERSE_DECL(VarTemplateDecl, {<br>
VarDecl *TempDecl = D->getTemplatedDecl();<br>
TRY_TO(TraverseDecl(TempDecl));<br>
TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
@@ -1504,14 +1431,14 @@ DEF_TRAVERSE_DECL(<br>
D == D->getCanonicalDecl())<br>
TRY_TO(TraverseVariableInstantiations(D));<br>
<br>
- // Note that getInstantiatedFromMemberTemplate() is just a link<br>
- // from a template instantiation back to the template from which<br>
- // it was instantiated, and thus should not be traversed.<br>
+ // Note that getInstantiatedFromMemberTemplate() is just a link<br>
+ // from a template instantiation back to the template from which<br>
+ // it was instantiated, and thus should not be traversed.<br>
})<br>
<br>
// A helper method for traversing the instantiations of a<br>
// function while skipping its specializations.<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseFunctionInstantiations(<br>
FunctionTemplateDecl *D) {<br>
for (auto *FD : D->specializations()) {<br>
@@ -1541,80 +1468,78 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
<br>
DEF_TRAVERSE_DECL(FunctionTemplateDecl, {<br>
- TRY_TO(TraverseDecl(D->getTemplatedDecl()));<br>
- TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
+ TRY_TO(TraverseDecl(D->getTemplatedDecl()));<br>
+ TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
<br>
- // By default, we do not traverse the instantiations of<br>
- // function templates since they do not appear in the user code. The<br>
- // following code optionally traverses them.<br>
- //<br>
- // We only traverse the function instantiations when we see the canonical<br>
- // declaration of the template, to ensure we only visit them once.<br>
- if (getDerived().shouldVisitTemplateInstantiations() &&<br>
- D == D->getCanonicalDecl())<br>
- TRY_TO(TraverseFunctionInstantiations(D));<br>
- })<br>
+ // By default, we do not traverse the instantiations of<br>
+ // function templates since they do not appear in the user code. The<br>
+ // following code optionally traverses them.<br>
+ //<br>
+ // We only traverse the function instantiations when we see the canonical<br>
+ // declaration of the template, to ensure we only visit them once.<br>
+ if (getDerived().shouldVisitTemplateInstantiations() &&<br>
+ D == D->getCanonicalDecl())<br>
+ TRY_TO(TraverseFunctionInstantiations(D));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(TemplateTemplateParmDecl, {<br>
- // D is the "T" in something like<br>
- // template <template <typename> class T> class container { };<br>
- TRY_TO(TraverseDecl(D->getTemplatedDecl()));<br>
- if (D->hasDefaultArgument()) {<br>
- TRY_TO(TraverseTemplateArgumentLoc(D->getDefaultArgument()));<br>
- }<br>
- TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
- })<br>
+ // D is the "T" in something like<br>
+ // template <template <typename> class T> class container { };<br>
+ TRY_TO(TraverseDecl(D->getTemplatedDecl()));<br>
+ if (D->hasDefaultArgument()) {<br>
+ TRY_TO(TraverseTemplateArgumentLoc(D->getDefaultArgument()));<br>
+ }<br>
+ TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(TemplateTypeParmDecl, {<br>
- // D is the "T" in something like "template<typename T> class vector;"<br>
- if (D->getTypeForDecl())<br>
- TRY_TO(TraverseType(QualType(D->getTypeForDecl(), 0)));<br>
- if (D->hasDefaultArgument())<br>
- TRY_TO(TraverseTypeLoc(D->getDefaultArgumentInfo()->getTypeLoc()));<br>
- })<br>
+ // D is the "T" in something like "template<typename T> class vector;"<br>
+ if (D->getTypeForDecl())<br>
+ TRY_TO(TraverseType(QualType(D->getTypeForDecl(), 0)));<br>
+ if (D->hasDefaultArgument())<br>
+ TRY_TO(TraverseTypeLoc(D->getDefaultArgumentInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(TypedefDecl, {<br>
- TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));<br>
- // We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
- // declaring the typedef, not something that was written in the<br>
- // source.<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));<br>
+ // We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
+ // declaring the typedef, not something that was written in the<br>
+ // source.<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(TypeAliasDecl, {<br>
- TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));<br>
- // We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
- // declaring the type alias, not something that was written in the<br>
- // source.<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));<br>
+ // We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
+ // declaring the type alias, not something that was written in the<br>
+ // source.<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(TypeAliasTemplateDecl, {<br>
- TRY_TO(TraverseDecl(D->getTemplatedDecl()));<br>
- TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
- })<br>
+ TRY_TO(TraverseDecl(D->getTemplatedDecl()));<br>
+ TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(UnresolvedUsingTypenameDecl, {<br>
- // A dependent using declaration which was marked with 'typename'.<br>
- // template<class T> class A : public B<T> { using typename B<T>::foo; };<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
- // We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
- // declaring the type, not something that was written in the<br>
- // source.<br>
- })<br>
+ // A dependent using declaration which was marked with 'typename'.<br>
+ // template<class T> class A : public B<T> { using typename B<T>::foo; };<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
+ // We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
+ // declaring the type, not something that was written in the<br>
+ // source.<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(EnumDecl, {<br>
- if (D->getTypeForDecl())<br>
- TRY_TO(TraverseType(QualType(D->getTypeForDecl(), 0)));<br>
-<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
- // The enumerators are already traversed by<br>
- // decls_begin()/decls_end().<br>
- })<br>
+ if (D->getTypeForDecl())<br>
+ TRY_TO(TraverseType(QualType(D->getTypeForDecl(), 0)));<br>
<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
+ // The enumerators are already traversed by<br>
+ // decls_begin()/decls_end().<br>
+})<br>
<br>
// Helper methods for RecordDecl and its children.<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::TraverseRecordHelper(<br>
- RecordDecl *D) {<br>
+template <typename Derived><br>
+bool RecursiveASTVisitor<Derived>::TraverseRecordHelper(RecordDecl *D) {<br>
// We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
// declaring the type, not something that was written in the source.<br>
<br>
@@ -1622,9 +1547,8 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::TraverseCXXRecordHelper(<br>
- CXXRecordDecl *D) {<br>
+template <typename Derived><br>
+bool RecursiveASTVisitor<Derived>::TraverseCXXRecordHelper(CXXRecordDecl *D) {<br>
if (!TraverseRecordHelper(D))<br>
return false;<br>
if (D->isCompleteDefinition()) {<br>
@@ -1637,34 +1561,30 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-DEF_TRAVERSE_DECL(RecordDecl, {<br>
- TRY_TO(TraverseRecordHelper(D));<br>
- })<br>
-<br>
-DEF_TRAVERSE_DECL(CXXRecordDecl, {<br>
- TRY_TO(TraverseCXXRecordHelper(D));<br>
- })<br>
+DEF_TRAVERSE_DECL(RecordDecl, { TRY_TO(TraverseRecordHelper(D)); })<br>
+<br>
+DEF_TRAVERSE_DECL(CXXRecordDecl, { TRY_TO(TraverseCXXRecordHelper(D)); })<br>
<br>
DEF_TRAVERSE_DECL(ClassTemplateSpecializationDecl, {<br>
- // For implicit instantiations ("set<int> x;"), we don't want to<br>
- // recurse at all, since the instatiated class isn't written in<br>
- // the source code anywhere. (Note the instatiated *type* --<br>
- // set<int> -- is written, and will still get a callback of<br>
- // TemplateSpecializationType). For explicit instantiations<br>
- // ("template set<int>;"), we do need a callback, since this<br>
- // is the only callback that's made for this instantiation.<br>
- // We use getTypeAsWritten() to distinguish.<br>
- if (TypeSourceInfo *TSI = D->getTypeAsWritten())<br>
- TRY_TO(TraverseTypeLoc(TSI->getTypeLoc()));<br>
-<br>
- if (!getDerived().shouldVisitTemplateInstantiations() &&<br>
- D->getTemplateSpecializationKind() != TSK_ExplicitSpecialization)<br>
- // Returning from here skips traversing the<br>
- // declaration context of the ClassTemplateSpecializationDecl<br>
- // (embedded in the DEF_TRAVERSE_DECL() macro)<br>
- // which contains the instantiated members of the class.<br>
- return true;<br>
- })<br>
+ // For implicit instantiations ("set<int> x;"), we don't want to<br>
+ // recurse at all, since the instatiated class isn't written in<br>
+ // the source code anywhere. (Note the instatiated *type* --<br>
+ // set<int> -- is written, and will still get a callback of<br>
+ // TemplateSpecializationType). For explicit instantiations<br>
+ // ("template set<int>;"), we do need a callback, since this<br>
+ // is the only callback that's made for this instantiation.<br>
+ // We use getTypeAsWritten() to distinguish.<br>
+ if (TypeSourceInfo *TSI = D->getTypeAsWritten())<br>
+ TRY_TO(TraverseTypeLoc(TSI->getTypeLoc()));<br>
+<br>
+ if (!getDerived().shouldVisitTemplateInstantiations() &&<br>
+ D->getTemplateSpecializationKind() != TSK_ExplicitSpecialization)<br>
+ // Returning from here skips traversing the<br>
+ // declaration context of the ClassTemplateSpecializationDecl<br>
+ // (embedded in the DEF_TRAVERSE_DECL() macro)<br>
+ // which contains the instantiated members of the class.<br>
+ return true;<br>
+})<br>
<br>
template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateArgumentLocsHelper(<br>
@@ -1676,40 +1596,38 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
<br>
DEF_TRAVERSE_DECL(ClassTemplatePartialSpecializationDecl, {<br>
- // The partial specialization.<br>
- if (TemplateParameterList *TPL = D->getTemplateParameters()) {<br>
- for (TemplateParameterList::iterator I = TPL->begin(), E = TPL->end();<br>
- I != E; ++I) {<br>
- TRY_TO(TraverseDecl(*I));<br>
- }<br>
+ // The partial specialization.<br>
+ if (TemplateParameterList *TPL = D->getTemplateParameters()) {<br>
+ for (TemplateParameterList::iterator I = TPL->begin(), E = TPL->end();<br>
+ I != E; ++I) {<br>
+ TRY_TO(TraverseDecl(*I));<br>
}<br>
- // The args that remains unspecialized.<br>
- TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
- D->getTemplateArgsAsWritten()->getTemplateArgs(),<br>
- D->getTemplateArgsAsWritten()->NumTemplateArgs));<br>
+ }<br>
+ // The args that remains unspecialized.<br>
+ TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
+ D->getTemplateArgsAsWritten()->getTemplateArgs(),<br>
+ D->getTemplateArgsAsWritten()->NumTemplateArgs));<br>
<br>
- // Don't need the ClassTemplatePartialSpecializationHelper, even<br>
- // though that's our parent class -- we already visit all the<br>
- // template args here.<br>
- TRY_TO(TraverseCXXRecordHelper(D));<br>
-<br>
- // Instantiations will have been visited with the primary template.<br>
- })<br>
-<br>
-DEF_TRAVERSE_DECL(EnumConstantDecl, {<br>
- TRY_TO(TraverseStmt(D->getInitExpr()));<br>
- })<br>
+ // Don't need the ClassTemplatePartialSpecializationHelper, even<br>
+ // though that's our parent class -- we already visit all the<br>
+ // template args here.<br>
+ TRY_TO(TraverseCXXRecordHelper(D));<br>
+<br>
+ // Instantiations will have been visited with the primary template.<br>
+})<br>
+<br>
+DEF_TRAVERSE_DECL(EnumConstantDecl, { TRY_TO(TraverseStmt(D->getInitExpr())); })<br>
<br>
DEF_TRAVERSE_DECL(UnresolvedUsingValueDecl, {<br>
- // Like UnresolvedUsingTypenameDecl, but without the 'typename':<br>
- // template <class T> Class A : public Base<T> { using Base<T>::foo; };<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));<br>
- })<br>
+ // Like UnresolvedUsingTypenameDecl, but without the 'typename':<br>
+ // template <class T> Class A : public Base<T> { using Base<T>::foo; };<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(IndirectFieldDecl, {})<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseDeclaratorHelper(DeclaratorDecl *D) {<br>
TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
if (D->getTypeSourceInfo())<br>
@@ -1720,32 +1638,30 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
<br>
DEF_TRAVERSE_DECL(FieldDecl, {<br>
- TRY_TO(TraverseDeclaratorHelper(D));<br>
- if (D->isBitField())<br>
- TRY_TO(TraverseStmt(D->getBitWidth()));<br>
- else if (D->hasInClassInitializer())<br>
- TRY_TO(TraverseStmt(D->getInClassInitializer()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_DECL(MSPropertyDecl, {<br>
- TRY_TO(TraverseDeclaratorHelper(D));<br>
- })<br>
+ TRY_TO(TraverseDeclaratorHelper(D));<br>
+ if (D->isBitField())<br>
+ TRY_TO(TraverseStmt(D->getBitWidth()));<br>
+ else if (D->hasInClassInitializer())<br>
+ TRY_TO(TraverseStmt(D->getInClassInitializer()));<br>
+})<br>
+<br>
+DEF_TRAVERSE_DECL(MSPropertyDecl, { TRY_TO(TraverseDeclaratorHelper(D)); })<br>
<br>
DEF_TRAVERSE_DECL(ObjCAtDefsFieldDecl, {<br>
- TRY_TO(TraverseDeclaratorHelper(D));<br>
- if (D->isBitField())<br>
- TRY_TO(TraverseStmt(D->getBitWidth()));<br>
- // FIXME: implement the rest.<br>
- })<br>
+ TRY_TO(TraverseDeclaratorHelper(D));<br>
+ if (D->isBitField())<br>
+ TRY_TO(TraverseStmt(D->getBitWidth()));<br>
+ // FIXME: implement the rest.<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(ObjCIvarDecl, {<br>
- TRY_TO(TraverseDeclaratorHelper(D));<br>
- if (D->isBitField())<br>
- TRY_TO(TraverseStmt(D->getBitWidth()));<br>
- // FIXME: implement the rest.<br>
- })<br>
+ TRY_TO(TraverseDeclaratorHelper(D));<br>
+ if (D->isBitField())<br>
+ TRY_TO(TraverseStmt(D->getBitWidth()));<br>
+ // FIXME: implement the rest.<br>
+})<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseFunctionHelper(FunctionDecl *D) {<br>
TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));<br>
@@ -1756,13 +1672,13 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
// the function args, but both are handled by the FunctionTypeLoc<br>
// above, so we have to choose one side. I've decided to do before.<br>
if (const FunctionTemplateSpecializationInfo *FTSI =<br>
- D->getTemplateSpecializationInfo()) {<br>
+ D->getTemplateSpecializationInfo()) {<br>
if (FTSI->getTemplateSpecializationKind() != TSK_Undeclared &&<br>
FTSI->getTemplateSpecializationKind() != TSK_ImplicitInstantiation) {<br>
// A specialization might not have explicit template arguments if it has<br>
// a templated return type and concrete arguments.<br>
if (const ASTTemplateArgumentListInfo *TALI =<br>
- FTSI->TemplateArgumentsAsWritten) {<br>
+ FTSI->TemplateArgumentsAsWritten) {<br>
TRY_TO(TraverseTemplateArgumentLocsHelper(TALI->getTemplateArgs(),<br>
TALI->NumTemplateArgs));<br>
}<br>
@@ -1783,44 +1699,44 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
<br>
if (D->isThisDeclarationADefinition()) {<br>
- TRY_TO(TraverseStmt(D->getBody())); // Function body.<br>
+ TRY_TO(TraverseStmt(D->getBody())); // Function body.<br>
}<br>
return true;<br>
}<br>
<br>
DEF_TRAVERSE_DECL(FunctionDecl, {<br>
- // We skip decls_begin/decls_end, which are already covered by<br>
- // TraverseFunctionHelper().<br>
- return TraverseFunctionHelper(D);<br>
- })<br>
+ // We skip decls_begin/decls_end, which are already covered by<br>
+ // TraverseFunctionHelper().<br>
+ return TraverseFunctionHelper(D);<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(CXXMethodDecl, {<br>
- // We skip decls_begin/decls_end, which are already covered by<br>
- // TraverseFunctionHelper().<br>
- return TraverseFunctionHelper(D);<br>
- })<br>
+ // We skip decls_begin/decls_end, which are already covered by<br>
+ // TraverseFunctionHelper().<br>
+ return TraverseFunctionHelper(D);<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(CXXConstructorDecl, {<br>
- // We skip decls_begin/decls_end, which are already covered by<br>
- // TraverseFunctionHelper().<br>
- return TraverseFunctionHelper(D);<br>
- })<br>
+ // We skip decls_begin/decls_end, which are already covered by<br>
+ // TraverseFunctionHelper().<br>
+ return TraverseFunctionHelper(D);<br>
+})<br>
<br>
// CXXConversionDecl is the declaration of a type conversion operator.<br>
// It's not a cast expression.<br>
DEF_TRAVERSE_DECL(CXXConversionDecl, {<br>
- // We skip decls_begin/decls_end, which are already covered by<br>
- // TraverseFunctionHelper().<br>
- return TraverseFunctionHelper(D);<br>
- })<br>
+ // We skip decls_begin/decls_end, which are already covered by<br>
+ // TraverseFunctionHelper().<br>
+ return TraverseFunctionHelper(D);<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(CXXDestructorDecl, {<br>
- // We skip decls_begin/decls_end, which are already covered by<br>
- // TraverseFunctionHelper().<br>
- return TraverseFunctionHelper(D);<br>
- })<br>
+ // We skip decls_begin/decls_end, which are already covered by<br>
+ // TraverseFunctionHelper().<br>
+ return TraverseFunctionHelper(D);<br>
+})<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseVarHelper(VarDecl *D) {<br>
TRY_TO(TraverseDeclaratorHelper(D));<br>
// Default params are taken care of when we traverse the ParmVarDecl.<br>
@@ -1829,9 +1745,7 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-DEF_TRAVERSE_DECL(VarDecl, {<br>
- TRY_TO(TraverseVarHelper(D));<br>
- })<br>
+DEF_TRAVERSE_DECL(VarDecl, { TRY_TO(TraverseVarHelper(D)); })<br>
<br>
DEF_TRAVERSE_DECL(VarTemplateSpecializationDecl, {<br>
// For implicit instantiations, we don't want to<br>
@@ -1848,8 +1762,7 @@ DEF_TRAVERSE_DECL(VarTemplateSpecializat<br>
return true;<br>
})<br>
<br>
-DEF_TRAVERSE_DECL(VarTemplatePartialSpecializationDecl,<br>
- {<br>
+DEF_TRAVERSE_DECL(VarTemplatePartialSpecializationDecl, {<br>
// The partial specialization.<br>
if (TemplateParameterList *TPL = D->getTemplateParameters()) {<br>
for (TemplateParameterList::iterator I = TPL->begin(), E = TPL->end();<br>
@@ -1859,41 +1772,37 @@ DEF_TRAVERSE_DECL(VarTemplatePartialSpec<br>
}<br>
// The args that remains unspecialized.<br>
TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
- D->getTemplateArgsAsWritten()->getTemplateArgs(),<br>
- D->getTemplateArgsAsWritten()->NumTemplateArgs));<br>
+ D->getTemplateArgsAsWritten()->getTemplateArgs(),<br>
+ D->getTemplateArgsAsWritten()->NumTemplateArgs));<br>
<br>
// Don't need the VarTemplatePartialSpecializationHelper, even<br>
// though that's our parent class -- we already visit all the<br>
// template args here.<br>
TRY_TO(TraverseVarHelper(D));<br>
<br>
- // Instantiations will have been visited with the primary<br>
- // template.<br>
+ // Instantiations will have been visited with the primary<br>
+ // template.<br>
})<br>
<br>
-DEF_TRAVERSE_DECL(ImplicitParamDecl, {<br>
- TRY_TO(TraverseVarHelper(D));<br>
- })<br>
+DEF_TRAVERSE_DECL(ImplicitParamDecl, { TRY_TO(TraverseVarHelper(D)); })<br>
<br>
DEF_TRAVERSE_DECL(NonTypeTemplateParmDecl, {<br>
- // A non-type template parameter, e.g. "S" in template<int S> class Foo ...<br>
- TRY_TO(TraverseDeclaratorHelper(D));<br>
- TRY_TO(TraverseStmt(D->getDefaultArgument()));<br>
- })<br>
+ // A non-type template parameter, e.g. "S" in template<int S> class Foo ...<br>
+ TRY_TO(TraverseDeclaratorHelper(D));<br>
+ TRY_TO(TraverseStmt(D->getDefaultArgument()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(ParmVarDecl, {<br>
- TRY_TO(TraverseVarHelper(D));<br>
+ TRY_TO(TraverseVarHelper(D));<br>
<br>
- if (D->hasDefaultArg() &&<br>
- D->hasUninstantiatedDefaultArg() &&<br>
- !D->hasUnparsedDefaultArg())<br>
- TRY_TO(TraverseStmt(D->getUninstantiatedDefaultArg()));<br>
-<br>
- if (D->hasDefaultArg() &&<br>
- !D->hasUninstantiatedDefaultArg() &&<br>
- !D->hasUnparsedDefaultArg())<br>
- TRY_TO(TraverseStmt(D->getDefaultArg()));<br>
- })<br>
+ if (D->hasDefaultArg() && D->hasUninstantiatedDefaultArg() &&<br>
+ !D->hasUnparsedDefaultArg())<br>
+ TRY_TO(TraverseStmt(D->getUninstantiatedDefaultArg()));<br>
+<br>
+ if (D->hasDefaultArg() && !D->hasUninstantiatedDefaultArg() &&<br>
+ !D->hasUnparsedDefaultArg())<br>
+ TRY_TO(TraverseStmt(D->getDefaultArg()));<br>
+})<br>
<br>
#undef DEF_TRAVERSE_DECL<br>
<br>
@@ -1907,155 +1816,156 @@ DEF_TRAVERSE_DECL(ParmVarDecl, {<br>
// <a href="http://clang.llvm.org/doxygen/Stmt_8cpp_source.html" target="_blank" class="cremed">http://clang.llvm.org/doxygen/Stmt_8cpp_source.html</a><br>
<br>
// This macro makes available a variable S, the passed-in stmt.<br>
-#define DEF_TRAVERSE_STMT(STMT, CODE) \<br>
-template<typename Derived> \<br>
-bool RecursiveASTVisitor<Derived>::Traverse##STMT (STMT *S) { \<br>
- TRY_TO(WalkUpFrom##STMT(S)); \<br>
- StmtQueueAction StmtQueue(*this); \<br>
- { CODE; } \<br>
- for (Stmt::child_range range = S->children(); range; ++range) { \<br>
- StmtQueue.queue(*range); \<br>
- } \<br>
- return true; \<br>
-}<br>
+#define DEF_TRAVERSE_STMT(STMT, CODE) \<br>
+ template <typename Derived> \<br>
+ bool RecursiveASTVisitor<Derived>::Traverse##STMT(STMT *S) { \<br>
+ TRY_TO(WalkUpFrom##STMT(S)); \<br>
+ StmtQueueAction StmtQueue(*this); \<br>
+ { CODE; } \<br>
+ for (Stmt::child_range range = S->children(); range; ++range) { \<br>
+ StmtQueue.queue(*range); \<br>
+ } \<br>
+ return true; \<br>
+ }<br>
<br>
DEF_TRAVERSE_STMT(GCCAsmStmt, {<br>
- StmtQueue.queue(S->getAsmString());<br>
- for (unsigned I = 0, E = S->getNumInputs(); I < E; ++I) {<br>
- StmtQueue.queue(S->getInputConstraintLiteral(I));<br>
- }<br>
- for (unsigned I = 0, E = S->getNumOutputs(); I < E; ++I) {<br>
- StmtQueue.queue(S->getOutputConstraintLiteral(I));<br>
- }<br>
- for (unsigned I = 0, E = S->getNumClobbers(); I < E; ++I) {<br>
- StmtQueue.queue(S->getClobberStringLiteral(I));<br>
- }<br>
- // children() iterates over inputExpr and outputExpr.<br>
- })<br>
+ StmtQueue.queue(S->getAsmString());<br>
+ for (unsigned I = 0, E = S->getNumInputs(); I < E; ++I) {<br>
+ StmtQueue.queue(S->getInputConstraintLiteral(I));<br>
+ }<br>
+ for (unsigned I = 0, E = S->getNumOutputs(); I < E; ++I) {<br>
+ StmtQueue.queue(S->getOutputConstraintLiteral(I));<br>
+ }<br>
+ for (unsigned I = 0, E = S->getNumClobbers(); I < E; ++I) {<br>
+ StmtQueue.queue(S->getClobberStringLiteral(I));<br>
+ }<br>
+ // children() iterates over inputExpr and outputExpr.<br>
+})<br>
<br>
-DEF_TRAVERSE_STMT(MSAsmStmt, {<br>
- // FIXME: MS Asm doesn't currently parse Constraints, Clobbers, etc. Once<br>
- // added this needs to be implemented.<br>
- })<br>
+DEF_TRAVERSE_STMT(<br>
+ MSAsmStmt,<br>
+ {// FIXME: MS Asm doesn't currently parse Constraints, Clobbers, etc. Once<br>
+ // added this needs to be implemented.<br>
+ })<br>
<br>
DEF_TRAVERSE_STMT(CXXCatchStmt, {<br>
- TRY_TO(TraverseDecl(S->getExceptionDecl()));<br>
- // children() iterates over the handler block.<br>
- })<br>
+ TRY_TO(TraverseDecl(S->getExceptionDecl()));<br>
+ // children() iterates over the handler block.<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(DeclStmt, {<br>
- for (auto *I : S->decls()) {<br>
- TRY_TO(TraverseDecl(I));<br>
- }<br>
- // Suppress the default iteration over children() by<br>
- // returning. Here's why: A DeclStmt looks like 'type var [=<br>
- // initializer]'. The decls above already traverse over the<br>
- // initializers, so we don't have to do it again (which<br>
- // children() would do).<br>
- return true;<br>
- })<br>
-<br>
+ for (auto *I : S->decls()) {<br>
+ TRY_TO(TraverseDecl(I));<br>
+ }<br>
+ // Suppress the default iteration over children() by<br>
+ // returning. Here's why: A DeclStmt looks like 'type var [=<br>
+ // initializer]'. The decls above already traverse over the<br>
+ // initializers, so we don't have to do it again (which<br>
+ // children() would do).<br>
+ return true;<br>
+})<br>
<br>
// These non-expr stmts (most of them), do not need any action except<br>
// iterating over the children.<br>
-DEF_TRAVERSE_STMT(BreakStmt, { })<br>
-DEF_TRAVERSE_STMT(CXXTryStmt, { })<br>
-DEF_TRAVERSE_STMT(CaseStmt, { })<br>
-DEF_TRAVERSE_STMT(CompoundStmt, { })<br>
-DEF_TRAVERSE_STMT(ContinueStmt, { })<br>
-DEF_TRAVERSE_STMT(DefaultStmt, { })<br>
-DEF_TRAVERSE_STMT(DoStmt, { })<br>
-DEF_TRAVERSE_STMT(ForStmt, { })<br>
-DEF_TRAVERSE_STMT(GotoStmt, { })<br>
-DEF_TRAVERSE_STMT(IfStmt, { })<br>
-DEF_TRAVERSE_STMT(IndirectGotoStmt, { })<br>
-DEF_TRAVERSE_STMT(LabelStmt, { })<br>
-DEF_TRAVERSE_STMT(AttributedStmt, { })<br>
-DEF_TRAVERSE_STMT(NullStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCAtCatchStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCAtFinallyStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCAtSynchronizedStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCAtThrowStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCAtTryStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCForCollectionStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCAutoreleasePoolStmt, { })<br>
-DEF_TRAVERSE_STMT(CXXForRangeStmt, { })<br>
+DEF_TRAVERSE_STMT(BreakStmt, {})<br>
+DEF_TRAVERSE_STMT(CXXTryStmt, {})<br>
+DEF_TRAVERSE_STMT(CaseStmt, {})<br>
+DEF_TRAVERSE_STMT(CompoundStmt, {})<br>
+DEF_TRAVERSE_STMT(ContinueStmt, {})<br>
+DEF_TRAVERSE_STMT(DefaultStmt, {})<br>
+DEF_TRAVERSE_STMT(DoStmt, {})<br>
+DEF_TRAVERSE_STMT(ForStmt, {})<br>
+DEF_TRAVERSE_STMT(GotoStmt, {})<br>
+DEF_TRAVERSE_STMT(IfStmt, {})<br>
+DEF_TRAVERSE_STMT(IndirectGotoStmt, {})<br>
+DEF_TRAVERSE_STMT(LabelStmt, {})<br>
+DEF_TRAVERSE_STMT(AttributedStmt, {})<br>
+DEF_TRAVERSE_STMT(NullStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCAtCatchStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCAtFinallyStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCAtSynchronizedStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCAtThrowStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCAtTryStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCForCollectionStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCAutoreleasePoolStmt, {})<br>
+DEF_TRAVERSE_STMT(CXXForRangeStmt, {})<br>
DEF_TRAVERSE_STMT(MSDependentExistsStmt, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));<br>
})<br>
-DEF_TRAVERSE_STMT(ReturnStmt, { })<br>
-DEF_TRAVERSE_STMT(SwitchStmt, { })<br>
-DEF_TRAVERSE_STMT(WhileStmt, { })<br>
+DEF_TRAVERSE_STMT(ReturnStmt, {})<br>
+DEF_TRAVERSE_STMT(SwitchStmt, {})<br>
+DEF_TRAVERSE_STMT(WhileStmt, {})<br>
<br>
DEF_TRAVERSE_STMT(CXXDependentScopeMemberExpr, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(S->getMemberNameInfo()));<br>
- if (S->hasExplicitTemplateArgs()) {<br>
- TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
- S->getTemplateArgs(), S->getNumTemplateArgs()));<br>
- }<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(S->getMemberNameInfo()));<br>
+ if (S->hasExplicitTemplateArgs()) {<br>
+ TRY_TO(TraverseTemplateArgumentLocsHelper(S->getTemplateArgs(),<br>
+ S->getNumTemplateArgs()));<br>
+ }<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(DeclRefExpr, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));<br>
- TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
- S->getTemplateArgs(), S->getNumTemplateArgs()));<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));<br>
+ TRY_TO(TraverseTemplateArgumentLocsHelper(S->getTemplateArgs(),<br>
+ S->getNumTemplateArgs()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(DependentScopeDeclRefExpr, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));<br>
- if (S->hasExplicitTemplateArgs()) {<br>
- TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
- S->getExplicitTemplateArgs().getTemplateArgs(),<br>
- S->getNumTemplateArgs()));<br>
- }<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));<br>
+ if (S->hasExplicitTemplateArgs()) {<br>
+ TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
+ S->getExplicitTemplateArgs().getTemplateArgs(),<br>
+ S->getNumTemplateArgs()));<br>
+ }<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(MemberExpr, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(S->getMemberNameInfo()));<br>
- TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
- S->getTemplateArgs(), S->getNumTemplateArgs()));<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(S->getMemberNameInfo()));<br>
+ TRY_TO(TraverseTemplateArgumentLocsHelper(S->getTemplateArgs(),<br>
+ S->getNumTemplateArgs()));<br>
+})<br>
<br>
-DEF_TRAVERSE_STMT(ImplicitCastExpr, {<br>
- // We don't traverse the cast type, as it's not written in the<br>
- // source code.<br>
- })<br>
+DEF_TRAVERSE_STMT(<br>
+ ImplicitCastExpr,<br>
+ {// We don't traverse the cast type, as it's not written in the<br>
+ // source code.<br>
+ })<br>
<br>
DEF_TRAVERSE_STMT(CStyleCastExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXFunctionalCastExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXConstCastExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXDynamicCastExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXReinterpretCastExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXStaticCastExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
+})<br>
<br>
// InitListExpr is a tricky one, because we want to do all our work on<br>
// the syntactic form of the listexpr, but this method takes the<br>
// semantic form by default. We can't use the macro helper because it<br>
// calls WalkUp*() on the semantic form, before our code can convert<br>
// to the syntactic form.<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseInitListExpr(InitListExpr *S) {<br>
if (InitListExpr *Syn = S->getSyntacticForm())<br>
S = Syn;<br>
@@ -2071,9 +1981,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
// GenericSelectionExpr is a special case because the types and expressions<br>
// are interleaved. We also need to watch out for null types (default<br>
// generic associations).<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::<br>
-TraverseGenericSelectionExpr(GenericSelectionExpr *S) {<br>
+template <typename Derived><br>
+bool RecursiveASTVisitor<Derived>::TraverseGenericSelectionExpr(<br>
+ GenericSelectionExpr *S) {<br>
TRY_TO(WalkUpFromGenericSelectionExpr(S));<br>
StmtQueueAction StmtQueue(*this);<br>
StmtQueue.queue(S->getControllingExpr());<br>
@@ -2087,14 +1997,15 @@ TraverseGenericSelectionExpr(GenericSele<br>
<br>
// PseudoObjectExpr is a special case because of the wierdness with<br>
// syntactic expressions and opaque values.<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::<br>
-TraversePseudoObjectExpr(PseudoObjectExpr *S) {<br>
+template <typename Derived><br>
+bool<br>
+RecursiveASTVisitor<Derived>::TraversePseudoObjectExpr(PseudoObjectExpr *S) {<br>
TRY_TO(WalkUpFromPseudoObjectExpr(S));<br>
StmtQueueAction StmtQueue(*this);<br>
StmtQueue.queue(S->getSyntacticForm());<br>
- for (PseudoObjectExpr::semantics_iterator<br>
- i = S->semantics_begin(), e = S->semantics_end(); i != e; ++i) {<br>
+ for (PseudoObjectExpr::semantics_iterator i = S->semantics_begin(),<br>
+ e = S->semantics_end();<br>
+ i != e; ++i) {<br>
Expr *sub = *i;<br>
if (OpaqueValueExpr *OVE = dyn_cast<OpaqueValueExpr>(sub))<br>
sub = OVE->getSourceExpr();<br>
@@ -2104,44 +2015,44 @@ TraversePseudoObjectExpr(PseudoObjectExp<br>
}<br>
<br>
DEF_TRAVERSE_STMT(CXXScalarValueInitExpr, {<br>
- // This is called for code like 'return T()' where T is a built-in<br>
- // (i.e. non-class) type.<br>
- TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
- })<br>
+ // This is called for code like 'return T()' where T is a built-in<br>
+ // (i.e. non-class) type.<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXNewExpr, {<br>
// The child-iterator will pick up the other arguments.<br>
TRY_TO(TraverseTypeLoc(S->getAllocatedTypeSourceInfo()->getTypeLoc()));<br>
- })<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(OffsetOfExpr, {<br>
- // The child-iterator will pick up the expression representing<br>
- // the field.<br>
- // FIMXE: for code like offsetof(Foo, a.b.c), should we get<br>
- // making a MemberExpr callbacks for Foo.a, Foo.a.b, and Foo.a.b.c?<br>
- TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
- })<br>
+ // The child-iterator will pick up the expression representing<br>
+ // the field.<br>
+ // FIMXE: for code like offsetof(Foo, a.b.c), should we get<br>
+ // making a MemberExpr callbacks for Foo.a, Foo.a.b, and Foo.a.b.c?<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(UnaryExprOrTypeTraitExpr, {<br>
- // The child-iterator will pick up the arg if it's an expression,<br>
- // but not if it's a type.<br>
- if (S->isArgumentType())<br>
- TRY_TO(TraverseTypeLoc(S->getArgumentTypeInfo()->getTypeLoc()));<br>
- })<br>
+ // The child-iterator will pick up the arg if it's an expression,<br>
+ // but not if it's a type.<br>
+ if (S->isArgumentType())<br>
+ TRY_TO(TraverseTypeLoc(S->getArgumentTypeInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXTypeidExpr, {<br>
- // The child-iterator will pick up the arg if it's an expression,<br>
- // but not if it's a type.<br>
- if (S->isTypeOperand())<br>
- TRY_TO(TraverseTypeLoc(S->getTypeOperandSourceInfo()->getTypeLoc()));<br>
- })<br>
+ // The child-iterator will pick up the arg if it's an expression,<br>
+ // but not if it's a type.<br>
+ if (S->isTypeOperand())<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeOperandSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXUuidofExpr, {<br>
- // The child-iterator will pick up the arg if it's an expression,<br>
- // but not if it's a type.<br>
- if (S->isTypeOperand())<br>
- TRY_TO(TraverseTypeLoc(S->getTypeOperandSourceInfo()->getTypeLoc()));<br>
- })<br>
+ // The child-iterator will pick up the arg if it's an expression,<br>
+ // but not if it's a type.<br>
+ if (S->isTypeOperand())<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeOperandSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(TypeTraitExpr, {<br>
for (unsigned I = 0, N = S->getNumArgs(); I != N; ++I)<br>
@@ -2149,30 +2060,29 @@ DEF_TRAVERSE_STMT(TypeTraitExpr, {<br>
})<br>
<br>
DEF_TRAVERSE_STMT(ArrayTypeTraitExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getQueriedTypeSourceInfo()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getQueriedTypeSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
-DEF_TRAVERSE_STMT(ExpressionTraitExpr, {<br>
- StmtQueue.queue(S->getQueriedExpression());<br>
- })<br>
+DEF_TRAVERSE_STMT(ExpressionTraitExpr,<br>
+ { StmtQueue.queue(S->getQueriedExpression()); })<br>
<br>
DEF_TRAVERSE_STMT(VAArgExpr, {<br>
- // The child-iterator will pick up the expression argument.<br>
- TRY_TO(TraverseTypeLoc(S->getWrittenTypeInfo()->getTypeLoc()));<br>
- })<br>
+ // The child-iterator will pick up the expression argument.<br>
+ TRY_TO(TraverseTypeLoc(S->getWrittenTypeInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXTemporaryObjectExpr, {<br>
- // This is called for code like 'return T()' where T is a class type.<br>
- TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
- })<br>
+ // This is called for code like 'return T()' where T is a class type.<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
-// Walk only the visible parts of lambda expressions.<br>
-template<typename Derived><br>
+// Walk only the visible parts of lambda expressions.<br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseLambdaExpr(LambdaExpr *S) {<br>
TRY_TO(WalkUpFromLambdaExpr(S));<br>
<br>
for (LambdaExpr::capture_iterator C = S->explicit_capture_begin(),<br>
- CEnd = S->explicit_capture_end();<br>
+ CEnd = S->explicit_capture_end();<br>
C != CEnd; ++C) {<br>
TRY_TO(TraverseLambdaCapture(*C));<br>
}<br>
@@ -2190,7 +2100,7 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
} else {<br>
TRY_TO(TraverseTypeLoc(Proto.getReturnLoc()));<br>
- }<br>
+ }<br>
}<br>
}<br>
<br>
@@ -2200,34 +2110,34 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
<br>
DEF_TRAVERSE_STMT(CXXUnresolvedConstructExpr, {<br>
- // This is called for code like 'T()', where T is a template argument.<br>
- TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
- })<br>
+ // This is called for code like 'T()', where T is a template argument.<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
// These expressions all might take explicit template arguments.<br>
// We traverse those if so. FIXME: implement these.<br>
-DEF_TRAVERSE_STMT(CXXConstructExpr, { })<br>
-DEF_TRAVERSE_STMT(CallExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXMemberCallExpr, { })<br>
+DEF_TRAVERSE_STMT(CXXConstructExpr, {})<br>
+DEF_TRAVERSE_STMT(CallExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXMemberCallExpr, {})<br>
<br>
// These exprs (most of them), do not need any action except iterating<br>
// over the children.<br>
-DEF_TRAVERSE_STMT(AddrLabelExpr, { })<br>
-DEF_TRAVERSE_STMT(ArraySubscriptExpr, { })<br>
+DEF_TRAVERSE_STMT(AddrLabelExpr, {})<br>
+DEF_TRAVERSE_STMT(ArraySubscriptExpr, {})<br>
DEF_TRAVERSE_STMT(BlockExpr, {<br>
TRY_TO(TraverseDecl(S->getBlockDecl()));<br>
return true; // no child statements to loop through.<br>
})<br>
-DEF_TRAVERSE_STMT(ChooseExpr, { })<br>
-DEF_TRAVERSE_STMT(CompoundLiteralExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXBindTemporaryExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXBoolLiteralExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXDefaultArgExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXDefaultInitExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXDeleteExpr, { })<br>
-DEF_TRAVERSE_STMT(ExprWithCleanups, { })<br>
-DEF_TRAVERSE_STMT(CXXNullPtrLiteralExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXStdInitializerListExpr, { })<br>
+DEF_TRAVERSE_STMT(ChooseExpr, {})<br>
+DEF_TRAVERSE_STMT(CompoundLiteralExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXBindTemporaryExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXBoolLiteralExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXDefaultArgExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXDefaultInitExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXDeleteExpr, {})<br>
+DEF_TRAVERSE_STMT(ExprWithCleanups, {})<br>
+DEF_TRAVERSE_STMT(CXXNullPtrLiteralExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXStdInitializerListExpr, {})<br>
DEF_TRAVERSE_STMT(CXXPseudoDestructorExpr, {<br>
TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
if (TypeSourceInfo *ScopeInfo = S->getScopeTypeInfo())<br>
@@ -2235,38 +2145,38 @@ DEF_TRAVERSE_STMT(CXXPseudoDestructorExp<br>
if (TypeSourceInfo *DestroyedTypeInfo = S->getDestroyedTypeInfo())<br>
TRY_TO(TraverseTypeLoc(DestroyedTypeInfo->getTypeLoc()));<br>
})<br>
-DEF_TRAVERSE_STMT(CXXThisExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXThrowExpr, { })<br>
-DEF_TRAVERSE_STMT(UserDefinedLiteral, { })<br>
-DEF_TRAVERSE_STMT(DesignatedInitExpr, { })<br>
-DEF_TRAVERSE_STMT(ExtVectorElementExpr, { })<br>
-DEF_TRAVERSE_STMT(GNUNullExpr, { })<br>
-DEF_TRAVERSE_STMT(ImplicitValueInitExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCBoolLiteralExpr, { })<br>
+DEF_TRAVERSE_STMT(CXXThisExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXThrowExpr, {})<br>
+DEF_TRAVERSE_STMT(UserDefinedLiteral, {})<br>
+DEF_TRAVERSE_STMT(DesignatedInitExpr, {})<br>
+DEF_TRAVERSE_STMT(ExtVectorElementExpr, {})<br>
+DEF_TRAVERSE_STMT(GNUNullExpr, {})<br>
+DEF_TRAVERSE_STMT(ImplicitValueInitExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCBoolLiteralExpr, {})<br>
DEF_TRAVERSE_STMT(ObjCEncodeExpr, {<br>
if (TypeSourceInfo *TInfo = S->getEncodedTypeSourceInfo())<br>
TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));<br>
})<br>
-DEF_TRAVERSE_STMT(ObjCIsaExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCIvarRefExpr, { })<br>
+DEF_TRAVERSE_STMT(ObjCIsaExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCIvarRefExpr, {})<br>
DEF_TRAVERSE_STMT(ObjCMessageExpr, {<br>
if (TypeSourceInfo *TInfo = S->getClassReceiverTypeInfo())<br>
TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));<br>
})<br>
-DEF_TRAVERSE_STMT(ObjCPropertyRefExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCSubscriptRefExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCProtocolExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCSelectorExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCIndirectCopyRestoreExpr, { })<br>
+DEF_TRAVERSE_STMT(ObjCPropertyRefExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCSubscriptRefExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCProtocolExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCSelectorExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCIndirectCopyRestoreExpr, {})<br>
DEF_TRAVERSE_STMT(ObjCBridgedCastExpr, {<br>
TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
})<br>
-DEF_TRAVERSE_STMT(ParenExpr, { })<br>
-DEF_TRAVERSE_STMT(ParenListExpr, { })<br>
-DEF_TRAVERSE_STMT(PredefinedExpr, { })<br>
-DEF_TRAVERSE_STMT(ShuffleVectorExpr, { })<br>
-DEF_TRAVERSE_STMT(ConvertVectorExpr, { })<br>
-DEF_TRAVERSE_STMT(StmtExpr, { })<br>
+DEF_TRAVERSE_STMT(ParenExpr, {})<br>
+DEF_TRAVERSE_STMT(ParenListExpr, {})<br>
+DEF_TRAVERSE_STMT(PredefinedExpr, {})<br>
+DEF_TRAVERSE_STMT(ShuffleVectorExpr, {})<br>
+DEF_TRAVERSE_STMT(ConvertVectorExpr, {})<br>
+DEF_TRAVERSE_STMT(StmtExpr, {})<br>
DEF_TRAVERSE_STMT(UnresolvedLookupExpr, {<br>
TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
if (S->hasExplicitTemplateArgs()) {<br>
@@ -2286,144 +2196,145 @@ DEF_TRAVERSE_STMT(UnresolvedMemberExpr,<br>
DEF_TRAVERSE_STMT(MSPropertyRefExpr, {})<br>
DEF_TRAVERSE_STMT(SEHTryStmt, {})<br>
DEF_TRAVERSE_STMT(SEHExceptStmt, {})<br>
-DEF_TRAVERSE_STMT(SEHFinallyStmt,{})<br>
-DEF_TRAVERSE_STMT(CapturedStmt, {<br>
- TRY_TO(TraverseDecl(S->getCapturedDecl()));<br>
-})<br>
+DEF_TRAVERSE_STMT(SEHFinallyStmt, {})<br>
+DEF_TRAVERSE_STMT(CapturedStmt, { TRY_TO(TraverseDecl(S->getCapturedDecl())); })<br>
<br>
-DEF_TRAVERSE_STMT(CXXOperatorCallExpr, { })<br>
-DEF_TRAVERSE_STMT(OpaqueValueExpr, { })<br>
-DEF_TRAVERSE_STMT(CUDAKernelCallExpr, { })<br>
+DEF_TRAVERSE_STMT(CXXOperatorCallExpr, {})<br>
+DEF_TRAVERSE_STMT(OpaqueValueExpr, {})<br>
+DEF_TRAVERSE_STMT(CUDAKernelCallExpr, {})<br>
<br>
// These operators (all of them) do not need any action except<br>
// iterating over the children.<br>
-DEF_TRAVERSE_STMT(BinaryConditionalOperator, { })<br>
-DEF_TRAVERSE_STMT(ConditionalOperator, { })<br>
-DEF_TRAVERSE_STMT(UnaryOperator, { })<br>
-DEF_TRAVERSE_STMT(BinaryOperator, { })<br>
-DEF_TRAVERSE_STMT(CompoundAssignOperator, { })<br>
-DEF_TRAVERSE_STMT(CXXNoexceptExpr, { })<br>
-DEF_TRAVERSE_STMT(PackExpansionExpr, { })<br>
-DEF_TRAVERSE_STMT(SizeOfPackExpr, { })<br>
-DEF_TRAVERSE_STMT(SubstNonTypeTemplateParmPackExpr, { })<br>
-DEF_TRAVERSE_STMT(SubstNonTypeTemplateParmExpr, { })<br>
-DEF_TRAVERSE_STMT(FunctionParmPackExpr, { })<br>
-DEF_TRAVERSE_STMT(MaterializeTemporaryExpr, { })<br>
-DEF_TRAVERSE_STMT(AtomicExpr, { })<br>
+DEF_TRAVERSE_STMT(BinaryConditionalOperator, {})<br>
+DEF_TRAVERSE_STMT(ConditionalOperator, {})<br>
+DEF_TRAVERSE_STMT(UnaryOperator, {})<br>
+DEF_TRAVERSE_STMT(BinaryOperator, {})<br>
+DEF_TRAVERSE_STMT(CompoundAssignOperator, {})<br>
+DEF_TRAVERSE_STMT(CXXNoexceptExpr, {})<br>
+DEF_TRAVERSE_STMT(PackExpansionExpr, {})<br>
+DEF_TRAVERSE_STMT(SizeOfPackExpr, {})<br>
+DEF_TRAVERSE_STMT(SubstNonTypeTemplateParmPackExpr, {})<br>
+DEF_TRAVERSE_STMT(SubstNonTypeTemplateParmExpr, {})<br>
+DEF_TRAVERSE_STMT(FunctionParmPackExpr, {})<br>
+DEF_TRAVERSE_STMT(MaterializeTemporaryExpr, {})<br>
+DEF_TRAVERSE_STMT(AtomicExpr, {})<br>
<br>
// These literals (all of them) do not need any action.<br>
-DEF_TRAVERSE_STMT(IntegerLiteral, { })<br>
-DEF_TRAVERSE_STMT(CharacterLiteral, { })<br>
-DEF_TRAVERSE_STMT(FloatingLiteral, { })<br>
-DEF_TRAVERSE_STMT(ImaginaryLiteral, { })<br>
-DEF_TRAVERSE_STMT(StringLiteral, { })<br>
-DEF_TRAVERSE_STMT(ObjCStringLiteral, { })<br>
-DEF_TRAVERSE_STMT(ObjCBoxedExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCArrayLiteral, { })<br>
-DEF_TRAVERSE_STMT(ObjCDictionaryLiteral, { })<br>
-<br>
+DEF_TRAVERSE_STMT(IntegerLiteral, {})<br>
+DEF_TRAVERSE_STMT(CharacterLiteral, {})<br>
+DEF_TRAVERSE_STMT(FloatingLiteral, {})<br>
+DEF_TRAVERSE_STMT(ImaginaryLiteral, {})<br>
+DEF_TRAVERSE_STMT(StringLiteral, {})<br>
+DEF_TRAVERSE_STMT(ObjCStringLiteral, {})<br>
+DEF_TRAVERSE_STMT(ObjCBoxedExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCArrayLiteral, {})<br>
+DEF_TRAVERSE_STMT(ObjCDictionaryLiteral, {})<br>
+<br>
// Traverse OpenCL: AsType, Convert.<br>
-DEF_TRAVERSE_STMT(AsTypeExpr, { })<br>
+DEF_TRAVERSE_STMT(AsTypeExpr, {})<br>
<br>
// OpenMP directives.<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseOMPExecutableDirective(<br>
- OMPExecutableDirective *S) {<br>
+ OMPExecutableDirective *S) {<br>
ArrayRef<OMPClause *> Clauses = S->clauses();<br>
for (ArrayRef<OMPClause *>::iterator I = Clauses.begin(), E = Clauses.end();<br>
I != E; ++I)<br>
- if (!TraverseOMPClause(*I)) return false;<br>
+ if (!TraverseOMPClause(*I))<br>
+ return false;<br>
return true;<br>
}<br>
<br>
DEF_TRAVERSE_STMT(OMPParallelDirective, {<br>
- if (!TraverseOMPExecutableDirective(S)) return false;<br>
+ if (!TraverseOMPExecutableDirective(S))<br>
+ return false;<br>
})<br>
<br>
DEF_TRAVERSE_STMT(OMPSimdDirective, {<br>
- if (!TraverseOMPExecutableDirective(S)) return false;<br>
+ if (!TraverseOMPExecutableDirective(S))<br>
+ return false;<br>
})<br>
<br>
// OpenMP clauses.<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseOMPClause(OMPClause *C) {<br>
- if (!C) return true;<br>
+ if (!C)<br>
+ return true;<br>
switch (C->getClauseKind()) {<br>
-#define OPENMP_CLAUSE(Name, Class) \<br>
- case OMPC_##Name: \<br>
- return getDerived().Visit##Class(static_cast<Class*>(C));<br>
+#define OPENMP_CLAUSE(Name, Class) \<br>
+ case OMPC_##Name: \<br>
+ return getDerived().Visit##Class(static_cast<Class *>(C));<br>
#include "clang/Basic/OpenMPKinds.def"<br>
- default: break;<br>
+ default:<br>
+ break;<br>
}<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPIfClause(OMPIfClause *C) {<br>
TraverseStmt(C->getCondition());<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::VisitOMPNumThreadsClause(<br>
- OMPNumThreadsClause *C) {<br>
+template <typename Derived><br>
+bool<br>
+RecursiveASTVisitor<Derived>::VisitOMPNumThreadsClause(OMPNumThreadsClause *C) {<br>
TraverseStmt(C->getNumThreads());<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::VisitOMPSafelenClause(<br>
- OMPSafelenClause *C) {<br>
+template <typename Derived><br>
+bool RecursiveASTVisitor<Derived>::VisitOMPSafelenClause(OMPSafelenClause *C) {<br>
TraverseStmt(C->getSafelen());<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPDefaultClause(OMPDefaultClause *C) {<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool<br>
RecursiveASTVisitor<Derived>::VisitOMPProcBindClause(OMPProcBindClause *C) {<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
-template<typename T><br>
+template <typename Derived><br>
+template <typename T><br>
void RecursiveASTVisitor<Derived>::VisitOMPClauseList(T *Node) {<br>
for (auto *I : Node->varlists())<br>
TraverseStmt(I);<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPPrivateClause(OMPPrivateClause *C) {<br>
VisitOMPClauseList(C);<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPFirstprivateClause(<br>
- OMPFirstprivateClause *C) {<br>
+ OMPFirstprivateClause *C) {<br>
VisitOMPClauseList(C);<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPSharedClause(OMPSharedClause *C) {<br>
VisitOMPClauseList(C);<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
-bool<br>
-RecursiveASTVisitor<Derived>::VisitOMPLinearClause(OMPLinearClause *C) {<br>
+template <typename Derived><br>
+bool RecursiveASTVisitor<Derived>::VisitOMPLinearClause(OMPLinearClause *C) {<br>
VisitOMPClauseList(C);<br>
TraverseStmt(C->getStep());<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPCopyinClause(OMPCopyinClause *C) {<br>
VisitOMPClauseList(C);<br>
return true;<br>
<br>
Modified: cfe/trunk/include/clang/AST/RecursiveASTVisitor.h<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/cfe/trunk/include/clang/AST/RecursiveASTVisitor.h?rev=209092&r1=209091&r2=209092&view=diff" target="_blank" class="cremed">http://llvm.org/viewvc/llvm-project/cfe/trunk/include/clang/AST/RecursiveASTVisitor.h?rev=209092&r1=209091&r2=209092&view=diff</a><br>
==============================================================================<br>
--- cfe/trunk/include/clang/AST/RecursiveASTVisitor.h (original)<br>
+++ cfe/trunk/include/clang/AST/RecursiveASTVisitor.h Sun May 18 13:38:19 2014<br>
@@ -38,34 +38,24 @@<br>
// using them is responsible for defining macro OPERATOR().<br>
<br>
// All unary operators.<br>
-#define UNARYOP_LIST() \<br>
- OPERATOR(PostInc) OPERATOR(PostDec) \<br>
- OPERATOR(PreInc) OPERATOR(PreDec) \<br>
- OPERATOR(AddrOf) OPERATOR(Deref) \<br>
- OPERATOR(Plus) OPERATOR(Minus) \<br>
- OPERATOR(Not) OPERATOR(LNot) \<br>
- OPERATOR(Real) OPERATOR(Imag) \<br>
- OPERATOR(Extension)<br>
+#define UNARYOP_LIST() \<br>
+ OPERATOR(PostInc) OPERATOR(PostDec) OPERATOR(PreInc) OPERATOR(PreDec) \<br>
+ OPERATOR(AddrOf) OPERATOR(Deref) OPERATOR(Plus) OPERATOR(Minus) \<br>
+ OPERATOR(Not) OPERATOR(LNot) OPERATOR(Real) OPERATOR(Imag) \<br>
+ OPERATOR(Extension)<br>
<br>
// All binary operators (excluding compound assign operators).<br>
-#define BINOP_LIST() \<br>
- OPERATOR(PtrMemD) OPERATOR(PtrMemI) \<br>
- OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) \<br>
- OPERATOR(Add) OPERATOR(Sub) OPERATOR(Shl) \<br>
- OPERATOR(Shr) \<br>
- \<br>
- OPERATOR(LT) OPERATOR(GT) OPERATOR(LE) \<br>
- OPERATOR(GE) OPERATOR(EQ) OPERATOR(NE) \<br>
- OPERATOR(And) OPERATOR(Xor) OPERATOR(Or) \<br>
- OPERATOR(LAnd) OPERATOR(LOr) \<br>
- \<br>
- OPERATOR(Assign) \<br>
- OPERATOR(Comma)<br>
+#define BINOP_LIST() \<br>
+ OPERATOR(PtrMemD) OPERATOR(PtrMemI) OPERATOR(Mul) OPERATOR(Div) \<br>
+ OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) OPERATOR(Shl) OPERATOR(Shr) \<br>
+ OPERATOR(LT) OPERATOR(GT) OPERATOR(LE) OPERATOR(GE) OPERATOR(EQ) \<br>
+ OPERATOR(NE) OPERATOR(And) OPERATOR(Xor) OPERATOR(Or) OPERATOR(LAnd) \<br>
+ OPERATOR(LOr) OPERATOR(Assign) OPERATOR(Comma)<br>
<br>
// All compound assign operators.<br>
-#define CAO_LIST() \<br>
- OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) \<br>
- OPERATOR(Shl) OPERATOR(Shr) OPERATOR(And) OPERATOR(Or) OPERATOR(Xor)<br>
+#define CAO_LIST() \<br>
+ OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) \<br>
+ OPERATOR(Shl) OPERATOR(Shr) OPERATOR(And) OPERATOR(Or) OPERATOR(Xor)<br>
<br>
namespace clang {<br>
<br>
@@ -73,8 +63,11 @@ namespace clang {<br>
// invokes CALL_EXPR, which must be a method call, on the derived<br>
// object (s.t. a user of RecursiveASTVisitor can override the method<br>
// in CALL_EXPR).<br>
-#define TRY_TO(CALL_EXPR) \<br>
- do { if (!getDerived().CALL_EXPR) return false; } while (0)<br>
+#define TRY_TO(CALL_EXPR) \<br>
+ do { \<br>
+ if (!getDerived().CALL_EXPR) \<br>
+ return false; \<br>
+ } while (0)<br>
<br>
/// \brief A class that does preorder depth-first traversal on the<br>
/// entire Clang AST and visits each node.<br>
@@ -137,11 +130,10 @@ namespace clang {<br>
/// to return true, in which case all known implicit and explicit<br>
/// instantiations will be visited at the same time as the pattern<br>
/// from which they were produced.<br>
-template<typename Derived><br>
-class RecursiveASTVisitor {<br>
+template <typename Derived> class RecursiveASTVisitor {<br>
public:<br>
/// \brief Return a reference to the derived class.<br>
- Derived &getDerived() { return *static_cast<Derived*>(this); }<br>
+ Derived &getDerived() { return *static_cast<Derived *>(this); }<br>
<br>
/// \brief Return whether this visitor should recurse into<br>
/// template instantiations.<br>
@@ -267,112 +259,109 @@ public:<br>
// \brief Visit an attribute.<br>
bool VisitAttr(Attr *A) { return true; }<br>
<br>
- // Declare Traverse* and empty Visit* for all Attr classes.<br>
+// Declare Traverse* and empty Visit* for all Attr classes.<br>
#define ATTR_VISITOR_DECLS_ONLY<br>
#include "clang/AST/AttrVisitor.inc"<br>
#undef ATTR_VISITOR_DECLS_ONLY<br>
<br>
- // ---- Methods on Stmts ----<br>
+// ---- Methods on Stmts ----<br>
<br>
- // Declare Traverse*() for all concrete Stmt classes.<br>
+// Declare Traverse*() for all concrete Stmt classes.<br>
#define ABSTRACT_STMT(STMT)<br>
-#define STMT(CLASS, PARENT) \<br>
- bool Traverse##CLASS(CLASS *S);<br>
+#define STMT(CLASS, PARENT) bool Traverse##CLASS(CLASS *S);<br>
#include "clang/AST/StmtNodes.inc"<br>
// The above header #undefs ABSTRACT_STMT and STMT upon exit.<br>
<br>
// Define WalkUpFrom*() and empty Visit*() for all Stmt classes.<br>
bool WalkUpFromStmt(Stmt *S) { return getDerived().VisitStmt(S); }<br>
bool VisitStmt(Stmt *S) { return true; }<br>
-#define STMT(CLASS, PARENT) \<br>
- bool WalkUpFrom##CLASS(CLASS *S) { \<br>
- TRY_TO(WalkUpFrom##PARENT(S)); \<br>
- TRY_TO(Visit##CLASS(S)); \<br>
- return true; \<br>
- } \<br>
+#define STMT(CLASS, PARENT) \<br>
+ bool WalkUpFrom##CLASS(CLASS *S) { \<br>
+ TRY_TO(WalkUpFrom##PARENT(S)); \<br>
+ TRY_TO(Visit##CLASS(S)); \<br>
+ return true; \<br>
+ } \<br>
bool Visit##CLASS(CLASS *S) { return true; }<br>
#include "clang/AST/StmtNodes.inc"<br>
<br>
- // Define Traverse*(), WalkUpFrom*(), and Visit*() for unary<br>
- // operator methods. Unary operators are not classes in themselves<br>
- // (they're all opcodes in UnaryOperator) but do have visitors.<br>
-#define OPERATOR(NAME) \<br>
- bool TraverseUnary##NAME(UnaryOperator *S) { \<br>
- TRY_TO(WalkUpFromUnary##NAME(S)); \<br>
- TRY_TO(TraverseStmt(S->getSubExpr())); \<br>
- return true; \<br>
- } \<br>
- bool WalkUpFromUnary##NAME(UnaryOperator *S) { \<br>
- TRY_TO(WalkUpFromUnaryOperator(S)); \<br>
- TRY_TO(VisitUnary##NAME(S)); \<br>
- return true; \<br>
- } \<br>
+// Define Traverse*(), WalkUpFrom*(), and Visit*() for unary<br>
+// operator methods. Unary operators are not classes in themselves<br>
+// (they're all opcodes in UnaryOperator) but do have visitors.<br>
+#define OPERATOR(NAME) \<br>
+ bool TraverseUnary##NAME(UnaryOperator *S) { \<br>
+ TRY_TO(WalkUpFromUnary##NAME(S)); \<br>
+ TRY_TO(TraverseStmt(S->getSubExpr())); \<br>
+ return true; \<br>
+ } \<br>
+ bool WalkUpFromUnary##NAME(UnaryOperator *S) { \<br>
+ TRY_TO(WalkUpFromUnaryOperator(S)); \<br>
+ TRY_TO(VisitUnary##NAME(S)); \<br>
+ return true; \<br>
+ } \<br>
bool VisitUnary##NAME(UnaryOperator *S) { return true; }<br>
<br>
UNARYOP_LIST()<br>
#undef OPERATOR<br>
<br>
- // Define Traverse*(), WalkUpFrom*(), and Visit*() for binary<br>
- // operator methods. Binary operators are not classes in themselves<br>
- // (they're all opcodes in BinaryOperator) but do have visitors.<br>
-#define GENERAL_BINOP_FALLBACK(NAME, BINOP_TYPE) \<br>
- bool TraverseBin##NAME(BINOP_TYPE *S) { \<br>
- TRY_TO(WalkUpFromBin##NAME(S)); \<br>
- TRY_TO(TraverseStmt(S->getLHS())); \<br>
- TRY_TO(TraverseStmt(S->getRHS())); \<br>
- return true; \<br>
- } \<br>
- bool WalkUpFromBin##NAME(BINOP_TYPE *S) { \<br>
- TRY_TO(WalkUpFrom##BINOP_TYPE(S)); \<br>
- TRY_TO(VisitBin##NAME(S)); \<br>
- return true; \<br>
- } \<br>
+// Define Traverse*(), WalkUpFrom*(), and Visit*() for binary<br>
+// operator methods. Binary operators are not classes in themselves<br>
+// (they're all opcodes in BinaryOperator) but do have visitors.<br>
+#define GENERAL_BINOP_FALLBACK(NAME, BINOP_TYPE) \<br>
+ bool TraverseBin##NAME(BINOP_TYPE *S) { \<br>
+ TRY_TO(WalkUpFromBin##NAME(S)); \<br>
+ TRY_TO(TraverseStmt(S->getLHS())); \<br>
+ TRY_TO(TraverseStmt(S->getRHS())); \<br>
+ return true; \<br>
+ } \<br>
+ bool WalkUpFromBin##NAME(BINOP_TYPE *S) { \<br>
+ TRY_TO(WalkUpFrom##BINOP_TYPE(S)); \<br>
+ TRY_TO(VisitBin##NAME(S)); \<br>
+ return true; \<br>
+ } \<br>
bool VisitBin##NAME(BINOP_TYPE *S) { return true; }<br>
<br>
#define OPERATOR(NAME) GENERAL_BINOP_FALLBACK(NAME, BinaryOperator)<br>
BINOP_LIST()<br>
#undef OPERATOR<br>
<br>
- // Define Traverse*(), WalkUpFrom*(), and Visit*() for compound<br>
- // assignment methods. Compound assignment operators are not<br>
- // classes in themselves (they're all opcodes in<br>
- // CompoundAssignOperator) but do have visitors.<br>
-#define OPERATOR(NAME) \<br>
+// Define Traverse*(), WalkUpFrom*(), and Visit*() for compound<br>
+// assignment methods. Compound assignment operators are not<br>
+// classes in themselves (they're all opcodes in<br>
+// CompoundAssignOperator) but do have visitors.<br>
+#define OPERATOR(NAME) \<br>
GENERAL_BINOP_FALLBACK(NAME##Assign, CompoundAssignOperator)<br>
<br>
CAO_LIST()<br>
#undef OPERATOR<br>
#undef GENERAL_BINOP_FALLBACK<br>
<br>
- // ---- Methods on Types ----<br>
- // FIXME: revamp to take TypeLoc's rather than Types.<br>
+// ---- Methods on Types ----<br>
+// FIXME: revamp to take TypeLoc's rather than Types.<br>
<br>
- // Declare Traverse*() for all concrete Type classes.<br>
+// Declare Traverse*() for all concrete Type classes.<br>
#define ABSTRACT_TYPE(CLASS, BASE)<br>
-#define TYPE(CLASS, BASE) \<br>
- bool Traverse##CLASS##Type(CLASS##Type *T);<br>
+#define TYPE(CLASS, BASE) bool Traverse##CLASS##Type(CLASS##Type *T);<br>
#include "clang/AST/TypeNodes.def"<br>
// The above header #undefs ABSTRACT_TYPE and TYPE upon exit.<br>
<br>
// Define WalkUpFrom*() and empty Visit*() for all Type classes.<br>
bool WalkUpFromType(Type *T) { return getDerived().VisitType(T); }<br>
bool VisitType(Type *T) { return true; }<br>
-#define TYPE(CLASS, BASE) \<br>
- bool WalkUpFrom##CLASS##Type(CLASS##Type *T) { \<br>
- TRY_TO(WalkUpFrom##BASE(T)); \<br>
- TRY_TO(Visit##CLASS##Type(T)); \<br>
- return true; \<br>
- } \<br>
+#define TYPE(CLASS, BASE) \<br>
+ bool WalkUpFrom##CLASS##Type(CLASS##Type *T) { \<br>
+ TRY_TO(WalkUpFrom##BASE(T)); \<br>
+ TRY_TO(Visit##CLASS##Type(T)); \<br>
+ return true; \<br>
+ } \<br>
bool Visit##CLASS##Type(CLASS##Type *T) { return true; }<br>
#include "clang/AST/TypeNodes.def"<br>
<br>
- // ---- Methods on TypeLocs ----<br>
- // FIXME: this currently just calls the matching Type methods<br>
+// ---- Methods on TypeLocs ----<br>
+// FIXME: this currently just calls the matching Type methods<br>
<br>
- // Declare Traverse*() for all concrete TypeLoc classes.<br>
+// Declare Traverse*() for all concrete TypeLoc classes.<br>
#define ABSTRACT_TYPELOC(CLASS, BASE)<br>
-#define TYPELOC(CLASS, BASE) \<br>
- bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL);<br>
+#define TYPELOC(CLASS, BASE) bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL);<br>
#include "clang/AST/TypeLocNodes.def"<br>
// The above header #undefs ABSTRACT_TYPELOC and TYPELOC upon exit.<br>
<br>
@@ -391,34 +380,33 @@ public:<br>
}<br>
bool VisitUnqualTypeLoc(UnqualTypeLoc TL) { return true; }<br>
<br>
- // Note that BASE includes trailing 'Type' which CLASS doesn't.<br>
-#define TYPE(CLASS, BASE) \<br>
- bool WalkUpFrom##CLASS##TypeLoc(CLASS##TypeLoc TL) { \<br>
- TRY_TO(WalkUpFrom##BASE##Loc(TL)); \<br>
- TRY_TO(Visit##CLASS##TypeLoc(TL)); \<br>
- return true; \<br>
- } \<br>
+// Note that BASE includes trailing 'Type' which CLASS doesn't.<br>
+#define TYPE(CLASS, BASE) \<br>
+ bool WalkUpFrom##CLASS##TypeLoc(CLASS##TypeLoc TL) { \<br>
+ TRY_TO(WalkUpFrom##BASE##Loc(TL)); \<br>
+ TRY_TO(Visit##CLASS##TypeLoc(TL)); \<br>
+ return true; \<br>
+ } \<br>
bool Visit##CLASS##TypeLoc(CLASS##TypeLoc TL) { return true; }<br>
#include "clang/AST/TypeNodes.def"<br>
<br>
- // ---- Methods on Decls ----<br>
+// ---- Methods on Decls ----<br>
<br>
- // Declare Traverse*() for all concrete Decl classes.<br>
+// Declare Traverse*() for all concrete Decl classes.<br>
#define ABSTRACT_DECL(DECL)<br>
-#define DECL(CLASS, BASE) \<br>
- bool Traverse##CLASS##Decl(CLASS##Decl *D);<br>
+#define DECL(CLASS, BASE) bool Traverse##CLASS##Decl(CLASS##Decl *D);<br>
#include "clang/AST/DeclNodes.inc"<br>
// The above header #undefs ABSTRACT_DECL and DECL upon exit.<br>
<br>
// Define WalkUpFrom*() and empty Visit*() for all Decl classes.<br>
bool WalkUpFromDecl(Decl *D) { return getDerived().VisitDecl(D); }<br>
bool VisitDecl(Decl *D) { return true; }<br>
-#define DECL(CLASS, BASE) \<br>
- bool WalkUpFrom##CLASS##Decl(CLASS##Decl *D) { \<br>
- TRY_TO(WalkUpFrom##BASE(D)); \<br>
- TRY_TO(Visit##CLASS##Decl(D)); \<br>
- return true; \<br>
- } \<br>
+#define DECL(CLASS, BASE) \<br>
+ bool WalkUpFrom##CLASS##Decl(CLASS##Decl *D) { \<br>
+ TRY_TO(WalkUpFrom##BASE(D)); \<br>
+ TRY_TO(Visit##CLASS##Decl(D)); \<br>
+ return true; \<br>
+ } \<br>
bool Visit##CLASS##Decl(CLASS##Decl *D) { return true; }<br>
#include "clang/AST/DeclNodes.inc"<br>
<br>
@@ -442,12 +430,10 @@ private:<br>
bool TraverseVarHelper(VarDecl *D);<br>
bool TraverseOMPClause(OMPClause *C);<br>
bool TraverseOMPExecutableDirective(OMPExecutableDirective *S);<br>
-#define OPENMP_CLAUSE(Name, Class) \<br>
- bool Visit##Class(Class *C);<br>
+#define OPENMP_CLAUSE(Name, Class) bool Visit##Class(Class *C);<br>
#include "clang/Basic/OpenMPKinds.def"<br>
/// \brief Process clauses with list of variables.<br>
- template <typename T><br>
- void VisitOMPClauseList(T *Node);<br>
+ template <typename T> void VisitOMPClauseList(T *Node);<br>
<br>
struct EnqueueJob {<br>
Stmt *S;<br>
@@ -459,7 +445,7 @@ private:<br>
bool dataTraverseNode(Stmt *S, bool &EnqueueChildren);<br>
};<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::dataTraverse(Stmt *S) {<br>
<br>
SmallVector<EnqueueJob, 16> Queue;<br>
@@ -476,7 +462,8 @@ bool RecursiveASTVisitor<Derived>::dataT<br>
if (getDerived().shouldUseDataRecursionFor(CurrS)) {<br>
if (job.StmtIt == Stmt::child_iterator()) {<br>
bool EnqueueChildren = true;<br>
- if (!dataTraverseNode(CurrS, EnqueueChildren)) return false;<br>
+ if (!dataTraverseNode(CurrS, EnqueueChildren))<br>
+ return false;<br>
if (!EnqueueChildren) {<br>
Queue.pop_back();<br>
continue;<br>
@@ -500,53 +487,57 @@ bool RecursiveASTVisitor<Derived>::dataT<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::dataTraverseNode(Stmt *S,<br>
bool &EnqueueChildren) {<br>
<br>
- // Dispatch to the corresponding WalkUpFrom* function only if the derived<br>
- // class didn't override Traverse* (and thus the traversal is trivial).<br>
-#define DISPATCH_WALK(NAME, CLASS, VAR) \<br>
- { \<br>
- bool (Derived::*DerivedFn)(CLASS*) = &Derived::Traverse##NAME; \<br>
- bool (Derived::*BaseFn)(CLASS*) = &RecursiveASTVisitor::Traverse##NAME; \<br>
- if (DerivedFn == BaseFn) \<br>
- return getDerived().WalkUpFrom##NAME(static_cast<CLASS*>(VAR)); \<br>
- } \<br>
- EnqueueChildren = false; \<br>
- return getDerived().Traverse##NAME(static_cast<CLASS*>(VAR));<br>
+// Dispatch to the corresponding WalkUpFrom* function only if the derived<br>
+// class didn't override Traverse* (and thus the traversal is trivial).<br>
+#define DISPATCH_WALK(NAME, CLASS, VAR) \<br>
+ { \<br>
+ bool (Derived::*DerivedFn)(CLASS *) = &Derived::Traverse##NAME; \<br>
+ bool (Derived::*BaseFn)(CLASS *) = &RecursiveASTVisitor::Traverse##NAME; \<br>
+ if (DerivedFn == BaseFn) \<br>
+ return getDerived().WalkUpFrom##NAME(static_cast<CLASS *>(VAR)); \<br>
+ } \<br>
+ EnqueueChildren = false; \<br>
+ return getDerived().Traverse##NAME(static_cast<CLASS *>(VAR));<br>
<br>
if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(S)) {<br>
switch (BinOp->getOpcode()) {<br>
-#define OPERATOR(NAME) \<br>
- case BO_##NAME: DISPATCH_WALK(Bin##NAME, BinaryOperator, S);<br>
+#define OPERATOR(NAME) \<br>
+ case BO_##NAME: \<br>
+ DISPATCH_WALK(Bin##NAME, BinaryOperator, S);<br>
<br>
- BINOP_LIST()<br>
+ BINOP_LIST()<br>
#undef OPERATOR<br>
<br>
-#define OPERATOR(NAME) \<br>
- case BO_##NAME##Assign: \<br>
+#define OPERATOR(NAME) \<br>
+ case BO_##NAME##Assign: \<br>
DISPATCH_WALK(Bin##NAME##Assign, CompoundAssignOperator, S);<br>
<br>
- CAO_LIST()<br>
+ CAO_LIST()<br>
#undef OPERATOR<br>
}<br>
} else if (UnaryOperator *UnOp = dyn_cast<UnaryOperator>(S)) {<br>
switch (UnOp->getOpcode()) {<br>
-#define OPERATOR(NAME) \<br>
- case UO_##NAME: DISPATCH_WALK(Unary##NAME, UnaryOperator, S);<br>
+#define OPERATOR(NAME) \<br>
+ case UO_##NAME: \<br>
+ DISPATCH_WALK(Unary##NAME, UnaryOperator, S);<br>
<br>
- UNARYOP_LIST()<br>
+ UNARYOP_LIST()<br>
#undef OPERATOR<br>
}<br>
}<br>
<br>
// Top switch stmt: dispatch to TraverseFooStmt for each concrete FooStmt.<br>
switch (S->getStmtClass()) {<br>
- case Stmt::NoStmtClass: break;<br>
+ case Stmt::NoStmtClass:<br>
+ break;<br>
#define ABSTRACT_STMT(STMT)<br>
-#define STMT(CLASS, PARENT) \<br>
- case Stmt::CLASS##Class: DISPATCH_WALK(CLASS, CLASS, S);<br>
+#define STMT(CLASS, PARENT) \<br>
+ case Stmt::CLASS##Class: \<br>
+ DISPATCH_WALK(CLASS, CLASS, S);<br>
#include "clang/AST/StmtNodes.inc"<br>
}<br>
<br>
@@ -555,10 +546,10 @@ bool RecursiveASTVisitor<Derived>::dataT<br>
return true;<br>
}<br>
<br>
-#define DISPATCH(NAME, CLASS, VAR) \<br>
- return getDerived().Traverse##NAME(static_cast<CLASS*>(VAR))<br>
+#define DISPATCH(NAME, CLASS, VAR) \<br>
+ return getDerived().Traverse##NAME(static_cast<CLASS *>(VAR))<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseStmt(Stmt *S) {<br>
if (!S)<br>
return true;<br>
@@ -571,27 +562,29 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
// below.<br>
if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(S)) {<br>
switch (BinOp->getOpcode()) {<br>
-#define OPERATOR(NAME) \<br>
- case BO_##NAME: DISPATCH(Bin##NAME, BinaryOperator, S);<br>
+#define OPERATOR(NAME) \<br>
+ case BO_##NAME: \<br>
+ DISPATCH(Bin##NAME, BinaryOperator, S);<br>
<br>
- BINOP_LIST()<br>
+ BINOP_LIST()<br>
#undef OPERATOR<br>
#undef BINOP_LIST<br>
<br>
-#define OPERATOR(NAME) \<br>
- case BO_##NAME##Assign: \<br>
- DISPATCH(Bin##NAME##Assign, CompoundAssignOperator, S);<br>
+#define OPERATOR(NAME) \<br>
+ case BO_##NAME##Assign: \<br>
+ DISPATCH(Bin##NAME##Assign, CompoundAssignOperator, S);<br>
<br>
- CAO_LIST()<br>
+ CAO_LIST()<br>
#undef OPERATOR<br>
#undef CAO_LIST<br>
}<br>
} else if (UnaryOperator *UnOp = dyn_cast<UnaryOperator>(S)) {<br>
switch (UnOp->getOpcode()) {<br>
-#define OPERATOR(NAME) \<br>
- case UO_##NAME: DISPATCH(Unary##NAME, UnaryOperator, S);<br>
+#define OPERATOR(NAME) \<br>
+ case UO_##NAME: \<br>
+ DISPATCH(Unary##NAME, UnaryOperator, S);<br>
<br>
- UNARYOP_LIST()<br>
+ UNARYOP_LIST()<br>
#undef OPERATOR<br>
#undef UNARYOP_LIST<br>
}<br>
@@ -599,41 +592,43 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
<br>
// Top switch stmt: dispatch to TraverseFooStmt for each concrete FooStmt.<br>
switch (S->getStmtClass()) {<br>
- case Stmt::NoStmtClass: break;<br>
+ case Stmt::NoStmtClass:<br>
+ break;<br>
#define ABSTRACT_STMT(STMT)<br>
-#define STMT(CLASS, PARENT) \<br>
- case Stmt::CLASS##Class: DISPATCH(CLASS, CLASS, S);<br>
+#define STMT(CLASS, PARENT) \<br>
+ case Stmt::CLASS##Class: \<br>
+ DISPATCH(CLASS, CLASS, S);<br>
#include "clang/AST/StmtNodes.inc"<br>
}<br>
<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseType(QualType T) {<br>
if (T.isNull())<br>
return true;<br>
<br>
switch (T->getTypeClass()) {<br>
#define ABSTRACT_TYPE(CLASS, BASE)<br>
-#define TYPE(CLASS, BASE) \<br>
- case Type::CLASS: DISPATCH(CLASS##Type, CLASS##Type, \<br>
- const_cast<Type*>(T.getTypePtr()));<br>
+#define TYPE(CLASS, BASE) \<br>
+ case Type::CLASS: \<br>
+ DISPATCH(CLASS##Type, CLASS##Type, const_cast<Type *>(T.getTypePtr()));<br>
#include "clang/AST/TypeNodes.def"<br>
}<br>
<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTypeLoc(TypeLoc TL) {<br>
if (TL.isNull())<br>
return true;<br>
<br>
switch (TL.getTypeLocClass()) {<br>
#define ABSTRACT_TYPELOC(CLASS, BASE)<br>
-#define TYPELOC(CLASS, BASE) \<br>
- case TypeLoc::CLASS: \<br>
+#define TYPELOC(CLASS, BASE) \<br>
+ case TypeLoc::CLASS: \<br>
return getDerived().Traverse##CLASS##TypeLoc(TL.castAs<CLASS##TypeLoc>());<br>
#include "clang/AST/TypeLocNodes.def"<br>
}<br>
@@ -641,14 +636,12 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-<br>
// Define the Traverse*Attr(Attr* A) methods<br>
#define VISITORCLASS RecursiveASTVisitor<br>
#include "clang/AST/AttrVisitor.inc"<br>
#undef VISITORCLASS<br>
<br>
-<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseDecl(Decl *D) {<br>
if (!D)<br>
return true;<br>
@@ -660,10 +653,10 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
<br>
switch (D->getKind()) {<br>
#define ABSTRACT_DECL(DECL)<br>
-#define DECL(CLASS, BASE) \<br>
- case Decl::CLASS: \<br>
- if (!getDerived().Traverse##CLASS##Decl(static_cast<CLASS##Decl*>(D))) \<br>
- return false; \<br>
+#define DECL(CLASS, BASE) \<br>
+ case Decl::CLASS: \<br>
+ if (!getDerived().Traverse##CLASS##Decl(static_cast<CLASS##Decl *>(D))) \<br>
+ return false; \<br>
break;<br>
#include "clang/AST/DeclNodes.inc"<br>
}<br>
@@ -678,9 +671,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
<br>
#undef DISPATCH<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseNestedNameSpecifier(<br>
- NestedNameSpecifier *NNS) {<br>
+ NestedNameSpecifier *NNS) {<br>
if (!NNS)<br>
return true;<br>
<br>
@@ -702,14 +695,14 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseNestedNameSpecifierLoc(<br>
- NestedNameSpecifierLoc NNS) {<br>
+ NestedNameSpecifierLoc NNS) {<br>
if (!NNS)<br>
return true;<br>
<br>
- if (NestedNameSpecifierLoc Prefix = NNS.getPrefix())<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(Prefix));<br>
+ if (NestedNameSpecifierLoc Prefix = NNS.getPrefix())<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(Prefix));<br>
<br>
switch (NNS.getNestedNameSpecifier()->getKind()) {<br>
case NestedNameSpecifier::Identifier:<br>
@@ -727,9 +720,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseDeclarationNameInfo(<br>
- DeclarationNameInfo NameInfo) {<br>
+ DeclarationNameInfo NameInfo) {<br>
switch (NameInfo.getName().getNameKind()) {<br>
case DeclarationName::CXXConstructorName:<br>
case DeclarationName::CXXDestructorName:<br>
@@ -752,7 +745,7 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateName(TemplateName Template) {<br>
if (DependentTemplateName *DTN = Template.getAsDependentTemplateName())<br>
TRY_TO(TraverseNestedNameSpecifier(DTN->getQualifier()));<br>
@@ -762,9 +755,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateArgument(<br>
- const TemplateArgument &Arg) {<br>
+ const TemplateArgument &Arg) {<br>
switch (Arg.getKind()) {<br>
case TemplateArgument::Null:<br>
case TemplateArgument::Declaration:<br>
@@ -778,7 +771,7 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
case TemplateArgument::Template:<br>
case TemplateArgument::TemplateExpansion:<br>
return getDerived().TraverseTemplateName(<br>
- Arg.getAsTemplateOrTemplatePattern());<br>
+ Arg.getAsTemplateOrTemplatePattern());<br>
<br>
case TemplateArgument::Expression:<br>
return getDerived().TraverseStmt(Arg.getAsExpr());<br>
@@ -793,9 +786,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
<br>
// FIXME: no template name location?<br>
// FIXME: no source locations for a template argument pack?<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateArgumentLoc(<br>
- const TemplateArgumentLoc &ArgLoc) {<br>
+ const TemplateArgumentLoc &ArgLoc) {<br>
const TemplateArgument &Arg = ArgLoc.getArgument();<br>
<br>
switch (Arg.getKind()) {<br>
@@ -817,9 +810,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
case TemplateArgument::TemplateExpansion:<br>
if (ArgLoc.getTemplateQualifierLoc())<br>
TRY_TO(getDerived().TraverseNestedNameSpecifierLoc(<br>
- ArgLoc.getTemplateQualifierLoc()));<br>
+ ArgLoc.getTemplateQualifierLoc()));<br>
return getDerived().TraverseTemplateName(<br>
- Arg.getAsTemplateOrTemplatePattern());<br>
+ Arg.getAsTemplateOrTemplatePattern());<br>
<br>
case TemplateArgument::Expression:<br>
return getDerived().TraverseStmt(ArgLoc.getSourceExpression());<br>
@@ -832,10 +825,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateArguments(<br>
- const TemplateArgument *Args,<br>
- unsigned NumArgs) {<br>
+ const TemplateArgument *Args, unsigned NumArgs) {<br>
for (unsigned I = 0; I != NumArgs; ++I) {<br>
TRY_TO(TraverseTemplateArgument(Args[I]));<br>
}<br>
@@ -843,9 +835,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseConstructorInitializer(<br>
- CXXCtorInitializer *Init) {<br>
+ CXXCtorInitializer *Init) {<br>
if (TypeSourceInfo *TInfo = Init->getTypeSourceInfo())<br>
TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));<br>
<br>
@@ -854,99 +846,82 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::TraverseLambdaCapture(<br>
- LambdaExpr *LE, const LambdaCapture *C) {<br>
+template <typename Derived><br>
+bool<br>
+RecursiveASTVisitor<Derived>::TraverseLambdaCapture(LambdaExpr *LE,<br>
+ const LambdaCapture *C) {<br>
if (C->isInitCapture())<br>
TRY_TO(TraverseDecl(C->getCapturedVar()));<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseLambdaBody(LambdaExpr *LE) {<br>
TRY_TO(TraverseStmt(LE->getBody()));<br>
return true;<br>
}<br>
<br>
-<br>
// ----------------- Type traversal -----------------<br>
<br>
// This macro makes available a variable T, the passed-in type.<br>
-#define DEF_TRAVERSE_TYPE(TYPE, CODE) \<br>
- template<typename Derived> \<br>
- bool RecursiveASTVisitor<Derived>::Traverse##TYPE (TYPE *T) { \<br>
- TRY_TO(WalkUpFrom##TYPE (T)); \<br>
- { CODE; } \<br>
- return true; \<br>
+#define DEF_TRAVERSE_TYPE(TYPE, CODE) \<br>
+ template <typename Derived> \<br>
+ bool RecursiveASTVisitor<Derived>::Traverse##TYPE(TYPE *T) { \<br>
+ TRY_TO(WalkUpFrom##TYPE(T)); \<br>
+ { CODE; } \<br>
+ return true; \<br>
}<br>
<br>
-DEF_TRAVERSE_TYPE(BuiltinType, { })<br>
+DEF_TRAVERSE_TYPE(BuiltinType, {})<br>
<br>
-DEF_TRAVERSE_TYPE(ComplexType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(ComplexType, { TRY_TO(TraverseType(T->getElementType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(PointerType, {<br>
- TRY_TO(TraverseType(T->getPointeeType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(PointerType, { TRY_TO(TraverseType(T->getPointeeType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(BlockPointerType, {<br>
- TRY_TO(TraverseType(T->getPointeeType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(BlockPointerType,<br>
+ { TRY_TO(TraverseType(T->getPointeeType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(LValueReferenceType, {<br>
- TRY_TO(TraverseType(T->getPointeeType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(LValueReferenceType,<br>
+ { TRY_TO(TraverseType(T->getPointeeType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(RValueReferenceType, {<br>
- TRY_TO(TraverseType(T->getPointeeType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(RValueReferenceType,<br>
+ { TRY_TO(TraverseType(T->getPointeeType())); })<br>
<br>
DEF_TRAVERSE_TYPE(MemberPointerType, {<br>
- TRY_TO(TraverseType(QualType(T->getClass(), 0)));<br>
- TRY_TO(TraverseType(T->getPointeeType()));<br>
- })<br>
+ TRY_TO(TraverseType(QualType(T->getClass(), 0)));<br>
+ TRY_TO(TraverseType(T->getPointeeType()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPE(AdjustedType, {<br>
- TRY_TO(TraverseType(T->getOriginalType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(AdjustedType, { TRY_TO(TraverseType(T->getOriginalType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(DecayedType, {<br>
- TRY_TO(TraverseType(T->getOriginalType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(DecayedType, { TRY_TO(TraverseType(T->getOriginalType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(ConstantArrayType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(ConstantArrayType,<br>
+ { TRY_TO(TraverseType(T->getElementType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(IncompleteArrayType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(IncompleteArrayType,<br>
+ { TRY_TO(TraverseType(T->getElementType())); })<br>
<br>
DEF_TRAVERSE_TYPE(VariableArrayType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- TRY_TO(TraverseStmt(T->getSizeExpr()));<br>
- })<br>
+ TRY_TO(TraverseType(T->getElementType()));<br>
+ TRY_TO(TraverseStmt(T->getSizeExpr()));<br>
+})<br>
<br>
DEF_TRAVERSE_TYPE(DependentSizedArrayType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- if (T->getSizeExpr())<br>
- TRY_TO(TraverseStmt(T->getSizeExpr()));<br>
- })<br>
+ TRY_TO(TraverseType(T->getElementType()));<br>
+ if (T->getSizeExpr())<br>
+ TRY_TO(TraverseStmt(T->getSizeExpr()));<br>
+})<br>
<br>
DEF_TRAVERSE_TYPE(DependentSizedExtVectorType, {<br>
- if (T->getSizeExpr())<br>
- TRY_TO(TraverseStmt(T->getSizeExpr()));<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- })<br>
+ if (T->getSizeExpr())<br>
+ TRY_TO(TraverseStmt(T->getSizeExpr()));<br>
+ TRY_TO(TraverseType(T->getElementType()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPE(VectorType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(VectorType, { TRY_TO(TraverseType(T->getElementType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(ExtVectorType, {<br>
- TRY_TO(TraverseType(T->getElementType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(ExtVectorType, { TRY_TO(TraverseType(T->getElementType())); })<br>
<br>
DEF_TRAVERSE_TYPE(FunctionNoProtoType,<br>
{ TRY_TO(TraverseType(T->getReturnType())); })<br>
@@ -963,87 +938,72 @@ DEF_TRAVERSE_TYPE(FunctionProtoType, {<br>
}<br>
})<br>
<br>
-DEF_TRAVERSE_TYPE(UnresolvedUsingType, { })<br>
-DEF_TRAVERSE_TYPE(TypedefType, { })<br>
+DEF_TRAVERSE_TYPE(UnresolvedUsingType, {})<br>
+DEF_TRAVERSE_TYPE(TypedefType, {})<br>
<br>
-DEF_TRAVERSE_TYPE(TypeOfExprType, {<br>
- TRY_TO(TraverseStmt(T->getUnderlyingExpr()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(TypeOfExprType,<br>
+ { TRY_TO(TraverseStmt(T->getUnderlyingExpr())); })<br>
<br>
-DEF_TRAVERSE_TYPE(TypeOfType, {<br>
- TRY_TO(TraverseType(T->getUnderlyingType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(TypeOfType, { TRY_TO(TraverseType(T->getUnderlyingType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(DecltypeType, {<br>
- TRY_TO(TraverseStmt(T->getUnderlyingExpr()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(DecltypeType,<br>
+ { TRY_TO(TraverseStmt(T->getUnderlyingExpr())); })<br>
<br>
DEF_TRAVERSE_TYPE(UnaryTransformType, {<br>
- TRY_TO(TraverseType(T->getBaseType()));<br>
- TRY_TO(TraverseType(T->getUnderlyingType()));<br>
- })<br>
+ TRY_TO(TraverseType(T->getBaseType()));<br>
+ TRY_TO(TraverseType(T->getUnderlyingType()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPE(AutoType, {<br>
- TRY_TO(TraverseType(T->getDeducedType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(AutoType, { TRY_TO(TraverseType(T->getDeducedType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(RecordType, { })<br>
-DEF_TRAVERSE_TYPE(EnumType, { })<br>
-DEF_TRAVERSE_TYPE(TemplateTypeParmType, { })<br>
-DEF_TRAVERSE_TYPE(SubstTemplateTypeParmType, { })<br>
-DEF_TRAVERSE_TYPE(SubstTemplateTypeParmPackType, { })<br>
+DEF_TRAVERSE_TYPE(RecordType, {})<br>
+DEF_TRAVERSE_TYPE(EnumType, {})<br>
+DEF_TRAVERSE_TYPE(TemplateTypeParmType, {})<br>
+DEF_TRAVERSE_TYPE(SubstTemplateTypeParmType, {})<br>
+DEF_TRAVERSE_TYPE(SubstTemplateTypeParmPackType, {})<br>
<br>
DEF_TRAVERSE_TYPE(TemplateSpecializationType, {<br>
- TRY_TO(TraverseTemplateName(T->getTemplateName()));<br>
- TRY_TO(TraverseTemplateArguments(T->getArgs(), T->getNumArgs()));<br>
- })<br>
+ TRY_TO(TraverseTemplateName(T->getTemplateName()));<br>
+ TRY_TO(TraverseTemplateArguments(T->getArgs(), T->getNumArgs()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPE(InjectedClassNameType, { })<br>
+DEF_TRAVERSE_TYPE(InjectedClassNameType, {})<br>
<br>
-DEF_TRAVERSE_TYPE(AttributedType, {<br>
- TRY_TO(TraverseType(T->getModifiedType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(AttributedType,<br>
+ { TRY_TO(TraverseType(T->getModifiedType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(ParenType, {<br>
- TRY_TO(TraverseType(T->getInnerType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(ParenType, { TRY_TO(TraverseType(T->getInnerType())); })<br>
<br>
DEF_TRAVERSE_TYPE(ElaboratedType, {<br>
- if (T->getQualifier()) {<br>
- TRY_TO(TraverseNestedNameSpecifier(T->getQualifier()));<br>
- }<br>
- TRY_TO(TraverseType(T->getNamedType()));<br>
- })<br>
-<br>
-DEF_TRAVERSE_TYPE(DependentNameType, {<br>
+ if (T->getQualifier()) {<br>
TRY_TO(TraverseNestedNameSpecifier(T->getQualifier()));<br>
- })<br>
+ }<br>
+ TRY_TO(TraverseType(T->getNamedType()));<br>
+})<br>
+<br>
+DEF_TRAVERSE_TYPE(DependentNameType,<br>
+ { TRY_TO(TraverseNestedNameSpecifier(T->getQualifier())); })<br>
<br>
DEF_TRAVERSE_TYPE(DependentTemplateSpecializationType, {<br>
- TRY_TO(TraverseNestedNameSpecifier(T->getQualifier()));<br>
- TRY_TO(TraverseTemplateArguments(T->getArgs(), T->getNumArgs()));<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifier(T->getQualifier()));<br>
+ TRY_TO(TraverseTemplateArguments(T->getArgs(), T->getNumArgs()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPE(PackExpansionType, {<br>
- TRY_TO(TraverseType(T->getPattern()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(PackExpansionType, { TRY_TO(TraverseType(T->getPattern())); })<br>
<br>
-DEF_TRAVERSE_TYPE(ObjCInterfaceType, { })<br>
+DEF_TRAVERSE_TYPE(ObjCInterfaceType, {})<br>
<br>
DEF_TRAVERSE_TYPE(ObjCObjectType, {<br>
- // We have to watch out here because an ObjCInterfaceType's base<br>
- // type is itself.<br>
- if (T->getBaseType().getTypePtr() != T)<br>
- TRY_TO(TraverseType(T->getBaseType()));<br>
- })<br>
+ // We have to watch out here because an ObjCInterfaceType's base<br>
+ // type is itself.<br>
+ if (T->getBaseType().getTypePtr() != T)<br>
+ TRY_TO(TraverseType(T->getBaseType()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPE(ObjCObjectPointerType, {<br>
- TRY_TO(TraverseType(T->getPointeeType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(ObjCObjectPointerType,<br>
+ { TRY_TO(TraverseType(T->getPointeeType())); })<br>
<br>
-DEF_TRAVERSE_TYPE(AtomicType, {<br>
- TRY_TO(TraverseType(T->getValueType()));<br>
- })<br>
+DEF_TRAVERSE_TYPE(AtomicType, { TRY_TO(TraverseType(T->getValueType())); })<br>
<br>
#undef DEF_TRAVERSE_TYPE<br>
<br>
@@ -1054,19 +1014,19 @@ DEF_TRAVERSE_TYPE(AtomicType, {<br>
// in addition to WalkUpFrom* for the TypeLoc itself, such that existing<br>
// clients that override the WalkUpFrom*Type() and/or Visit*Type() methods<br>
// continue to work.<br>
-#define DEF_TRAVERSE_TYPELOC(TYPE, CODE) \<br>
- template<typename Derived> \<br>
- bool RecursiveASTVisitor<Derived>::Traverse##TYPE##Loc(TYPE##Loc TL) { \<br>
- if (getDerived().shouldWalkTypesOfTypeLocs()) \<br>
- TRY_TO(WalkUpFrom##TYPE(const_cast<TYPE*>(TL.getTypePtr()))); \<br>
- TRY_TO(WalkUpFrom##TYPE##Loc(TL)); \<br>
- { CODE; } \<br>
- return true; \<br>
+#define DEF_TRAVERSE_TYPELOC(TYPE, CODE) \<br>
+ template <typename Derived> \<br>
+ bool RecursiveASTVisitor<Derived>::Traverse##TYPE##Loc(TYPE##Loc TL) { \<br>
+ if (getDerived().shouldWalkTypesOfTypeLocs()) \<br>
+ TRY_TO(WalkUpFrom##TYPE(const_cast<TYPE *>(TL.getTypePtr()))); \<br>
+ TRY_TO(WalkUpFrom##TYPE##Loc(TL)); \<br>
+ { CODE; } \<br>
+ return true; \<br>
}<br>
<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::TraverseQualifiedTypeLoc(<br>
- QualifiedTypeLoc TL) {<br>
+template <typename Derived><br>
+bool<br>
+RecursiveASTVisitor<Derived>::TraverseQualifiedTypeLoc(QualifiedTypeLoc TL) {<br>
// Move this over to the 'main' typeloc tree. Note that this is a<br>
// move -- we pretend that we were really looking at the unqualified<br>
// typeloc all along -- rather than a recursion, so we don't follow<br>
@@ -1085,46 +1045,40 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return TraverseTypeLoc(TL.getUnqualifiedLoc());<br>
}<br>
<br>
-DEF_TRAVERSE_TYPELOC(BuiltinType, { })<br>
+DEF_TRAVERSE_TYPELOC(BuiltinType, {})<br>
<br>
// FIXME: ComplexTypeLoc is unfinished<br>
DEF_TRAVERSE_TYPELOC(ComplexType, {<br>
- TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
- })<br>
+ TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(PointerType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(PointerType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })<br>
<br>
-DEF_TRAVERSE_TYPELOC(BlockPointerType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(BlockPointerType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })<br>
<br>
-DEF_TRAVERSE_TYPELOC(LValueReferenceType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(LValueReferenceType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })<br>
<br>
-DEF_TRAVERSE_TYPELOC(RValueReferenceType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(RValueReferenceType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })<br>
<br>
// FIXME: location of base class?<br>
// We traverse this in the type case as well, but how is it not reached through<br>
// the pointee type?<br>
DEF_TRAVERSE_TYPELOC(MemberPointerType, {<br>
- TRY_TO(TraverseType(QualType(TL.getTypePtr()->getClass(), 0)));<br>
- TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
- })<br>
+ TRY_TO(TraverseType(QualType(TL.getTypePtr()->getClass(), 0)));<br>
+ TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(AdjustedType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getOriginalLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(AdjustedType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getOriginalLoc())); })<br>
<br>
-DEF_TRAVERSE_TYPELOC(DecayedType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getOriginalLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(DecayedType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getOriginalLoc())); })<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseArrayTypeLocHelper(ArrayTypeLoc TL) {<br>
// This isn't available for ArrayType, but is for the ArrayTypeLoc.<br>
TRY_TO(TraverseStmt(TL.getSizeExpr()));<br>
@@ -1132,156 +1086,147 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
<br>
DEF_TRAVERSE_TYPELOC(ConstantArrayType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
- return TraverseArrayTypeLocHelper(TL);<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
+ return TraverseArrayTypeLocHelper(TL);<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(IncompleteArrayType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
- return TraverseArrayTypeLocHelper(TL);<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
+ return TraverseArrayTypeLocHelper(TL);<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(VariableArrayType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
- return TraverseArrayTypeLocHelper(TL);<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
+ return TraverseArrayTypeLocHelper(TL);<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(DependentSizedArrayType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
- return TraverseArrayTypeLocHelper(TL);<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(TL.getElementLoc()));<br>
+ return TraverseArrayTypeLocHelper(TL);<br>
+})<br>
<br>
// FIXME: order? why not size expr first?<br>
// FIXME: base VectorTypeLoc is unfinished<br>
DEF_TRAVERSE_TYPELOC(DependentSizedExtVectorType, {<br>
- if (TL.getTypePtr()->getSizeExpr())<br>
- TRY_TO(TraverseStmt(TL.getTypePtr()->getSizeExpr()));<br>
- TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
- })<br>
+ if (TL.getTypePtr()->getSizeExpr())<br>
+ TRY_TO(TraverseStmt(TL.getTypePtr()->getSizeExpr()));<br>
+ TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
+})<br>
<br>
// FIXME: VectorTypeLoc is unfinished<br>
DEF_TRAVERSE_TYPELOC(VectorType, {<br>
- TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
- })<br>
+ TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
+})<br>
<br>
// FIXME: size and attributes<br>
// FIXME: base VectorTypeLoc is unfinished<br>
DEF_TRAVERSE_TYPELOC(ExtVectorType, {<br>
- TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
- })<br>
+ TRY_TO(TraverseType(TL.getTypePtr()->getElementType()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(FunctionNoProtoType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getReturnLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(FunctionNoProtoType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getReturnLoc())); })<br>
<br>
// FIXME: location of exception specifications (attributes?)<br>
DEF_TRAVERSE_TYPELOC(FunctionProtoType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getReturnLoc()));<br>
+ TRY_TO(TraverseTypeLoc(TL.getReturnLoc()));<br>
<br>
- const FunctionProtoType *T = TL.getTypePtr();<br>
+ const FunctionProtoType *T = TL.getTypePtr();<br>
<br>
- for (unsigned I = 0, E = TL.getNumParams(); I != E; ++I) {<br>
- if (TL.getParam(I)) {<br>
- TRY_TO(TraverseDecl(TL.getParam(I)));<br>
- } else if (I < T->getNumParams()) {<br>
- TRY_TO(TraverseType(T->getParamType(I)));<br>
- }<br>
+ for (unsigned I = 0, E = TL.getNumParams(); I != E; ++I) {<br>
+ if (TL.getParam(I)) {<br>
+ TRY_TO(TraverseDecl(TL.getParam(I)));<br>
+ } else if (I < T->getNumParams()) {<br>
+ TRY_TO(TraverseType(T->getParamType(I)));<br>
}<br>
+ }<br>
<br>
- for (const auto &E : T->exceptions()) {<br>
- TRY_TO(TraverseType(E));<br>
- }<br>
- })<br>
+ for (const auto &E : T->exceptions()) {<br>
+ TRY_TO(TraverseType(E));<br>
+ }<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(UnresolvedUsingType, { })<br>
-DEF_TRAVERSE_TYPELOC(TypedefType, { })<br>
+DEF_TRAVERSE_TYPELOC(UnresolvedUsingType, {})<br>
+DEF_TRAVERSE_TYPELOC(TypedefType, {})<br>
<br>
-DEF_TRAVERSE_TYPELOC(TypeOfExprType, {<br>
- TRY_TO(TraverseStmt(TL.getUnderlyingExpr()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(TypeOfExprType,<br>
+ { TRY_TO(TraverseStmt(TL.getUnderlyingExpr())); })<br>
<br>
DEF_TRAVERSE_TYPELOC(TypeOfType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getUnderlyingTInfo()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(TL.getUnderlyingTInfo()->getTypeLoc()));<br>
+})<br>
<br>
// FIXME: location of underlying expr<br>
DEF_TRAVERSE_TYPELOC(DecltypeType, {<br>
- TRY_TO(TraverseStmt(TL.getTypePtr()->getUnderlyingExpr()));<br>
- })<br>
+ TRY_TO(TraverseStmt(TL.getTypePtr()->getUnderlyingExpr()));<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(UnaryTransformType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getUnderlyingTInfo()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(TL.getUnderlyingTInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(AutoType, {<br>
- TRY_TO(TraverseType(TL.getTypePtr()->getDeducedType()));<br>
- })<br>
+ TRY_TO(TraverseType(TL.getTypePtr()->getDeducedType()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(RecordType, { })<br>
-DEF_TRAVERSE_TYPELOC(EnumType, { })<br>
-DEF_TRAVERSE_TYPELOC(TemplateTypeParmType, { })<br>
-DEF_TRAVERSE_TYPELOC(SubstTemplateTypeParmType, { })<br>
-DEF_TRAVERSE_TYPELOC(SubstTemplateTypeParmPackType, { })<br>
+DEF_TRAVERSE_TYPELOC(RecordType, {})<br>
+DEF_TRAVERSE_TYPELOC(EnumType, {})<br>
+DEF_TRAVERSE_TYPELOC(TemplateTypeParmType, {})<br>
+DEF_TRAVERSE_TYPELOC(SubstTemplateTypeParmType, {})<br>
+DEF_TRAVERSE_TYPELOC(SubstTemplateTypeParmPackType, {})<br>
<br>
// FIXME: use the loc for the template name?<br>
DEF_TRAVERSE_TYPELOC(TemplateSpecializationType, {<br>
- TRY_TO(TraverseTemplateName(TL.getTypePtr()->getTemplateName()));<br>
- for (unsigned I = 0, E = TL.getNumArgs(); I != E; ++I) {<br>
- TRY_TO(TraverseTemplateArgumentLoc(TL.getArgLoc(I)));<br>
- }<br>
- })<br>
+ TRY_TO(TraverseTemplateName(TL.getTypePtr()->getTemplateName()));<br>
+ for (unsigned I = 0, E = TL.getNumArgs(); I != E; ++I) {<br>
+ TRY_TO(TraverseTemplateArgumentLoc(TL.getArgLoc(I)));<br>
+ }<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(InjectedClassNameType, { })<br>
+DEF_TRAVERSE_TYPELOC(InjectedClassNameType, {})<br>
<br>
-DEF_TRAVERSE_TYPELOC(ParenType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getInnerLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(ParenType, { TRY_TO(TraverseTypeLoc(TL.getInnerLoc())); })<br>
<br>
-DEF_TRAVERSE_TYPELOC(AttributedType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getModifiedLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(AttributedType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getModifiedLoc())); })<br>
<br>
DEF_TRAVERSE_TYPELOC(ElaboratedType, {<br>
- if (TL.getQualifierLoc()) {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));<br>
- }<br>
- TRY_TO(TraverseTypeLoc(TL.getNamedTypeLoc()));<br>
- })<br>
+ if (TL.getQualifierLoc()) {<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));<br>
+ }<br>
+ TRY_TO(TraverseTypeLoc(TL.getNamedTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(DependentNameType, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_TYPELOC(DependentTemplateSpecializationType, {<br>
- if (TL.getQualifierLoc()) {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));<br>
- }<br>
+ if (TL.getQualifierLoc()) {<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(TL.getQualifierLoc()));<br>
+ }<br>
<br>
- for (unsigned I = 0, E = TL.getNumArgs(); I != E; ++I) {<br>
- TRY_TO(TraverseTemplateArgumentLoc(TL.getArgLoc(I)));<br>
- }<br>
- })<br>
+ for (unsigned I = 0, E = TL.getNumArgs(); I != E; ++I) {<br>
+ TRY_TO(TraverseTemplateArgumentLoc(TL.getArgLoc(I)));<br>
+ }<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(PackExpansionType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getPatternLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(PackExpansionType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getPatternLoc())); })<br>
<br>
-DEF_TRAVERSE_TYPELOC(ObjCInterfaceType, { })<br>
+DEF_TRAVERSE_TYPELOC(ObjCInterfaceType, {})<br>
<br>
DEF_TRAVERSE_TYPELOC(ObjCObjectType, {<br>
- // We have to watch out here because an ObjCInterfaceType's base<br>
- // type is itself.<br>
- if (TL.getTypePtr()->getBaseType().getTypePtr() != TL.getTypePtr())<br>
- TRY_TO(TraverseTypeLoc(TL.getBaseLoc()));<br>
- })<br>
+ // We have to watch out here because an ObjCInterfaceType's base<br>
+ // type is itself.<br>
+ if (TL.getTypePtr()->getBaseType().getTypePtr() != TL.getTypePtr())<br>
+ TRY_TO(TraverseTypeLoc(TL.getBaseLoc()));<br>
+})<br>
<br>
-DEF_TRAVERSE_TYPELOC(ObjCObjectPointerType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getPointeeLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(ObjCObjectPointerType,<br>
+ { TRY_TO(TraverseTypeLoc(TL.getPointeeLoc())); })<br>
<br>
-DEF_TRAVERSE_TYPELOC(AtomicType, {<br>
- TRY_TO(TraverseTypeLoc(TL.getValueLoc()));<br>
- })<br>
+DEF_TRAVERSE_TYPELOC(AtomicType, { TRY_TO(TraverseTypeLoc(TL.getValueLoc())); })<br>
<br>
#undef DEF_TRAVERSE_TYPELOC<br>
<br>
@@ -1292,7 +1237,7 @@ DEF_TRAVERSE_TYPELOC(AtomicType, {<br>
// Therefore each Traverse* only needs to worry about children other<br>
// than those.<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseDeclContextHelper(DeclContext *DC) {<br>
if (!DC)<br>
return true;<br>
@@ -1308,137 +1253,128 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
<br>
// This macro makes available a variable D, the passed-in decl.<br>
-#define DEF_TRAVERSE_DECL(DECL, CODE) \<br>
-template<typename Derived> \<br>
-bool RecursiveASTVisitor<Derived>::Traverse##DECL (DECL *D) { \<br>
- TRY_TO(WalkUpFrom##DECL (D)); \<br>
- { CODE; } \<br>
- TRY_TO(TraverseDeclContextHelper(dyn_cast<DeclContext>(D))); \<br>
- return true; \<br>
-}<br>
+#define DEF_TRAVERSE_DECL(DECL, CODE) \<br>
+ template <typename Derived> \<br>
+ bool RecursiveASTVisitor<Derived>::Traverse##DECL(DECL *D) { \<br>
+ TRY_TO(WalkUpFrom##DECL(D)); \<br>
+ { CODE; } \<br>
+ TRY_TO(TraverseDeclContextHelper(dyn_cast<DeclContext>(D))); \<br>
+ return true; \<br>
+ }<br>
<br>
-DEF_TRAVERSE_DECL(AccessSpecDecl, { })<br>
+DEF_TRAVERSE_DECL(AccessSpecDecl, {})<br>
<br>
DEF_TRAVERSE_DECL(BlockDecl, {<br>
- if (TypeSourceInfo *TInfo = D->getSignatureAsWritten())<br>
- TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));<br>
- TRY_TO(TraverseStmt(D->getBody()));<br>
- // This return statement makes sure the traversal of nodes in<br>
- // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)<br>
- // is skipped - don't remove it.<br>
- return true;<br>
- })<br>
+ if (TypeSourceInfo *TInfo = D->getSignatureAsWritten())<br>
+ TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));<br>
+ TRY_TO(TraverseStmt(D->getBody()));<br>
+ // This return statement makes sure the traversal of nodes in<br>
+ // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)<br>
+ // is skipped - don't remove it.<br>
+ return true;<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(CapturedDecl, {<br>
- TRY_TO(TraverseStmt(D->getBody()));<br>
- // This return statement makes sure the traversal of nodes in<br>
- // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)<br>
- // is skipped - don't remove it.<br>
- return true;<br>
- })<br>
+ TRY_TO(TraverseStmt(D->getBody()));<br>
+ // This return statement makes sure the traversal of nodes in<br>
+ // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)<br>
+ // is skipped - don't remove it.<br>
+ return true;<br>
+})<br>
<br>
-DEF_TRAVERSE_DECL(EmptyDecl, { })<br>
+DEF_TRAVERSE_DECL(EmptyDecl, {})<br>
<br>
-DEF_TRAVERSE_DECL(FileScopeAsmDecl, {<br>
- TRY_TO(TraverseStmt(D->getAsmString()));<br>
- })<br>
+DEF_TRAVERSE_DECL(FileScopeAsmDecl,<br>
+ { TRY_TO(TraverseStmt(D->getAsmString())); })<br>
<br>
-DEF_TRAVERSE_DECL(ImportDecl, { })<br>
+DEF_TRAVERSE_DECL(ImportDecl, {})<br>
<br>
DEF_TRAVERSE_DECL(FriendDecl, {<br>
- // Friend is either decl or a type.<br>
- if (D->getFriendType())<br>
- TRY_TO(TraverseTypeLoc(D->getFriendType()->getTypeLoc()));<br>
- else<br>
- TRY_TO(TraverseDecl(D->getFriendDecl()));<br>
- })<br>
+ // Friend is either decl or a type.<br>
+ if (D->getFriendType())<br>
+ TRY_TO(TraverseTypeLoc(D->getFriendType()->getTypeLoc()));<br>
+ else<br>
+ TRY_TO(TraverseDecl(D->getFriendDecl()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(FriendTemplateDecl, {<br>
- if (D->getFriendType())<br>
- TRY_TO(TraverseTypeLoc(D->getFriendType()->getTypeLoc()));<br>
- else<br>
- TRY_TO(TraverseDecl(D->getFriendDecl()));<br>
- for (unsigned I = 0, E = D->getNumTemplateParameters(); I < E; ++I) {<br>
- TemplateParameterList *TPL = D->getTemplateParameterList(I);<br>
- for (TemplateParameterList::iterator ITPL = TPL->begin(),<br>
- ETPL = TPL->end();<br>
- ITPL != ETPL; ++ITPL) {<br>
- TRY_TO(TraverseDecl(*ITPL));<br>
- }<br>
+ if (D->getFriendType())<br>
+ TRY_TO(TraverseTypeLoc(D->getFriendType()->getTypeLoc()));<br>
+ else<br>
+ TRY_TO(TraverseDecl(D->getFriendDecl()));<br>
+ for (unsigned I = 0, E = D->getNumTemplateParameters(); I < E; ++I) {<br>
+ TemplateParameterList *TPL = D->getTemplateParameterList(I);<br>
+ for (TemplateParameterList::iterator ITPL = TPL->begin(), ETPL = TPL->end();<br>
+ ITPL != ETPL; ++ITPL) {<br>
+ TRY_TO(TraverseDecl(*ITPL));<br>
}<br>
- })<br>
+ }<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(ClassScopeFunctionSpecializationDecl, {<br>
- TRY_TO(TraverseDecl(D->getSpecialization()));<br>
+ TRY_TO(TraverseDecl(D->getSpecialization()));<br>
<br>
- if (D->hasExplicitTemplateArgs()) {<br>
- const TemplateArgumentListInfo& args = D->templateArgs();<br>
- TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
- args.getArgumentArray(), args.size()));<br>
- }<br>
- })<br>
+ if (D->hasExplicitTemplateArgs()) {<br>
+ const TemplateArgumentListInfo &args = D->templateArgs();<br>
+ TRY_TO(TraverseTemplateArgumentLocsHelper(args.getArgumentArray(),<br>
+ args.size()));<br>
+ }<br>
+})<br>
<br>
-DEF_TRAVERSE_DECL(LinkageSpecDecl, { })<br>
+DEF_TRAVERSE_DECL(LinkageSpecDecl, {})<br>
<br>
-DEF_TRAVERSE_DECL(ObjCPropertyImplDecl, {<br>
- // FIXME: implement this<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCPropertyImplDecl, {// FIXME: implement this<br>
+ })<br>
<br>
DEF_TRAVERSE_DECL(StaticAssertDecl, {<br>
- TRY_TO(TraverseStmt(D->getAssertExpr()));<br>
- TRY_TO(TraverseStmt(D->getMessage()));<br>
- })<br>
+ TRY_TO(TraverseStmt(D->getAssertExpr()));<br>
+ TRY_TO(TraverseStmt(D->getMessage()));<br>
+})<br>
<br>
-DEF_TRAVERSE_DECL(TranslationUnitDecl, {<br>
- // Code in an unnamed namespace shows up automatically in<br>
- // decls_begin()/decls_end(). Thus we don't need to recurse on<br>
- // D->getAnonymousNamespace().<br>
- })<br>
+DEF_TRAVERSE_DECL(<br>
+ TranslationUnitDecl,<br>
+ {// Code in an unnamed namespace shows up automatically in<br>
+ // decls_begin()/decls_end(). Thus we don't need to recurse on<br>
+ // D->getAnonymousNamespace().<br>
+ })<br>
<br>
DEF_TRAVERSE_DECL(NamespaceAliasDecl, {<br>
- // We shouldn't traverse an aliased namespace, since it will be<br>
- // defined (and, therefore, traversed) somewhere else.<br>
- //<br>
- // This return statement makes sure the traversal of nodes in<br>
- // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)<br>
- // is skipped - don't remove it.<br>
- return true;<br>
- })<br>
-<br>
-DEF_TRAVERSE_DECL(LabelDecl, {<br>
- // There is no code in a LabelDecl.<br>
+ // We shouldn't traverse an aliased namespace, since it will be<br>
+ // defined (and, therefore, traversed) somewhere else.<br>
+ //<br>
+ // This return statement makes sure the traversal of nodes in<br>
+ // decls_begin()/decls_end() (done in the DEF_TRAVERSE_DECL macro)<br>
+ // is skipped - don't remove it.<br>
+ return true;<br>
})<br>
<br>
+DEF_TRAVERSE_DECL(LabelDecl, {// There is no code in a LabelDecl.<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(NamespaceDecl, {<br>
- // Code in an unnamed namespace shows up automatically in<br>
- // decls_begin()/decls_end(). Thus we don't need to recurse on<br>
- // D->getAnonymousNamespace().<br>
- })<br>
+DEF_TRAVERSE_DECL(<br>
+ NamespaceDecl,<br>
+ {// Code in an unnamed namespace shows up automatically in<br>
+ // decls_begin()/decls_end(). Thus we don't need to recurse on<br>
+ // D->getAnonymousNamespace().<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(ObjCCompatibleAliasDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCCompatibleAliasDecl, {// FIXME: implement<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(ObjCCategoryDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCCategoryDecl, {// FIXME: implement<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(ObjCCategoryImplDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCCategoryImplDecl, {// FIXME: implement<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(ObjCImplementationDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCImplementationDecl, {// FIXME: implement<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(ObjCInterfaceDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCInterfaceDecl, {// FIXME: implement<br>
+ })<br>
<br>
-DEF_TRAVERSE_DECL(ObjCProtocolDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCProtocolDecl, {// FIXME: implement<br>
+ })<br>
<br>
DEF_TRAVERSE_DECL(ObjCMethodDecl, {<br>
if (D->getReturnTypeSourceInfo()) {<br>
@@ -1454,29 +1390,28 @@ DEF_TRAVERSE_DECL(ObjCMethodDecl, {<br>
return true;<br>
})<br>
<br>
-DEF_TRAVERSE_DECL(ObjCPropertyDecl, {<br>
- // FIXME: implement<br>
- })<br>
+DEF_TRAVERSE_DECL(ObjCPropertyDecl, {// FIXME: implement<br>
+ })<br>
<br>
DEF_TRAVERSE_DECL(UsingDecl, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(UsingDirectiveDecl, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
+})<br>
<br>
-DEF_TRAVERSE_DECL(UsingShadowDecl, { })<br>
+DEF_TRAVERSE_DECL(UsingShadowDecl, {})<br>
<br>
DEF_TRAVERSE_DECL(OMPThreadPrivateDecl, {<br>
- for (auto *I : D->varlists()) {<br>
- TRY_TO(TraverseStmt(I));<br>
- }<br>
- })<br>
+ for (auto *I : D->varlists()) {<br>
+ TRY_TO(TraverseStmt(I));<br>
+ }<br>
+})<br>
<br>
// A helper method for TemplateDecl's children.<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateParameterListHelper(<br>
TemplateParameterList *TPL) {<br>
if (TPL) {<br>
@@ -1488,7 +1423,7 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateInstantiations(<br>
ClassTemplateDecl *D) {<br>
for (auto *SD : D->specializations()) {<br>
@@ -1497,8 +1432,8 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
if (cast<CXXRecordDecl>(RD)->isInjectedClassName())<br>
continue;<br>
<br>
- switch (cast<ClassTemplateSpecializationDecl>(RD)-><br>
- getSpecializationKind()) {<br>
+ switch (<br>
+ cast<ClassTemplateSpecializationDecl>(RD)->getSpecializationKind()) {<br>
// Visit the implicit instantiations with the requested pattern.<br>
case TSK_Undeclared:<br>
case TSK_ImplicitInstantiation:<br>
@@ -1519,13 +1454,13 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateInstantiations(<br>
VarTemplateDecl *D) {<br>
for (auto *SD : D->specializations()) {<br>
for (auto *RD : SD->redecls()) {<br>
- switch (cast<VarTemplateSpecializationDecl>(RD)-><br>
- getSpecializationKind()) {<br>
+ switch (<br>
+ cast<VarTemplateSpecializationDecl>(RD)->getSpecializationKind()) {<br>
case TSK_Undeclared:<br>
case TSK_ImplicitInstantiation:<br>
TRY_TO(TraverseDecl(RD));<br>
@@ -1544,7 +1479,7 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
<br>
// A helper method for traversing the instantiations of a<br>
// function while skipping its specializations.<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseTemplateInstantiations(<br>
FunctionTemplateDecl *D) {<br>
for (auto *FD : D->specializations()) {<br>
@@ -1574,8 +1509,8 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
<br>
// This macro unifies the traversal of class, variable and function<br>
// template declarations.<br>
-#define DEF_TRAVERSE_TMPL_DECL(TMPLDECLKIND) \<br>
-DEF_TRAVERSE_DECL(TMPLDECLKIND##TemplateDecl, { \<br>
+#define DEF_TRAVERSE_TMPL_DECL(TMPLDECLKIND) \<br>
+ DEF_TRAVERSE_DECL(TMPLDECLKIND##TemplateDecl, { \<br>
TRY_TO(TraverseDecl(D->getTemplatedDecl())); \<br>
TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters())); \<br>
\<br>
@@ -1599,65 +1534,63 @@ DEF_TRAVERSE_TMPL_DECL(Var)<br>
DEF_TRAVERSE_TMPL_DECL(Function)<br>
<br>
DEF_TRAVERSE_DECL(TemplateTemplateParmDecl, {<br>
- // D is the "T" in something like<br>
- // template <template <typename> class T> class container { };<br>
- TRY_TO(TraverseDecl(D->getTemplatedDecl()));<br>
- if (D->hasDefaultArgument() && !D->defaultArgumentWasInherited()) {<br>
- TRY_TO(TraverseTemplateArgumentLoc(D->getDefaultArgument()));<br>
- }<br>
- TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
- })<br>
+ // D is the "T" in something like<br>
+ // template <template <typename> class T> class container { };<br>
+ TRY_TO(TraverseDecl(D->getTemplatedDecl()));<br>
+ if (D->hasDefaultArgument() && !D->defaultArgumentWasInherited()) {<br>
+ TRY_TO(TraverseTemplateArgumentLoc(D->getDefaultArgument()));<br>
+ }<br>
+ TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(TemplateTypeParmDecl, {<br>
- // D is the "T" in something like "template<typename T> class vector;"<br>
- if (D->getTypeForDecl())<br>
- TRY_TO(TraverseType(QualType(D->getTypeForDecl(), 0)));<br>
- if (D->hasDefaultArgument() && !D->defaultArgumentWasInherited())<br>
- TRY_TO(TraverseTypeLoc(D->getDefaultArgumentInfo()->getTypeLoc()));<br>
- })<br>
+ // D is the "T" in something like "template<typename T> class vector;"<br>
+ if (D->getTypeForDecl())<br>
+ TRY_TO(TraverseType(QualType(D->getTypeForDecl(), 0)));<br>
+ if (D->hasDefaultArgument() && !D->defaultArgumentWasInherited())<br>
+ TRY_TO(TraverseTypeLoc(D->getDefaultArgumentInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(TypedefDecl, {<br>
- TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));<br>
- // We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
- // declaring the typedef, not something that was written in the<br>
- // source.<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));<br>
+ // We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
+ // declaring the typedef, not something that was written in the<br>
+ // source.<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(TypeAliasDecl, {<br>
- TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));<br>
- // We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
- // declaring the type alias, not something that was written in the<br>
- // source.<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(D->getTypeSourceInfo()->getTypeLoc()));<br>
+ // We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
+ // declaring the type alias, not something that was written in the<br>
+ // source.<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(TypeAliasTemplateDecl, {<br>
- TRY_TO(TraverseDecl(D->getTemplatedDecl()));<br>
- TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
- })<br>
+ TRY_TO(TraverseDecl(D->getTemplatedDecl()));<br>
+ TRY_TO(TraverseTemplateParameterListHelper(D->getTemplateParameters()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(UnresolvedUsingTypenameDecl, {<br>
- // A dependent using declaration which was marked with 'typename'.<br>
- // template<class T> class A : public B<T> { using typename B<T>::foo; };<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
- // We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
- // declaring the type, not something that was written in the<br>
- // source.<br>
- })<br>
+ // A dependent using declaration which was marked with 'typename'.<br>
+ // template<class T> class A : public B<T> { using typename B<T>::foo; };<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
+ // We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
+ // declaring the type, not something that was written in the<br>
+ // source.<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(EnumDecl, {<br>
- if (D->getTypeForDecl())<br>
- TRY_TO(TraverseType(QualType(D->getTypeForDecl(), 0)));<br>
-<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
- // The enumerators are already traversed by<br>
- // decls_begin()/decls_end().<br>
- })<br>
+ if (D->getTypeForDecl())<br>
+ TRY_TO(TraverseType(QualType(D->getTypeForDecl(), 0)));<br>
<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
+ // The enumerators are already traversed by<br>
+ // decls_begin()/decls_end().<br>
+})<br>
<br>
// Helper methods for RecordDecl and its children.<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::TraverseRecordHelper(<br>
- RecordDecl *D) {<br>
+template <typename Derived><br>
+bool RecursiveASTVisitor<Derived>::TraverseRecordHelper(RecordDecl *D) {<br>
// We shouldn't traverse D->getTypeForDecl(); it's a result of<br>
// declaring the type, not something that was written in the source.<br>
<br>
@@ -1665,9 +1598,8 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::TraverseCXXRecordHelper(<br>
- CXXRecordDecl *D) {<br>
+template <typename Derived><br>
+bool RecursiveASTVisitor<Derived>::TraverseCXXRecordHelper(CXXRecordDecl *D) {<br>
if (!TraverseRecordHelper(D))<br>
return false;<br>
if (D->isCompleteDefinition()) {<br>
@@ -1680,34 +1612,30 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-DEF_TRAVERSE_DECL(RecordDecl, {<br>
- TRY_TO(TraverseRecordHelper(D));<br>
- })<br>
+DEF_TRAVERSE_DECL(RecordDecl, { TRY_TO(TraverseRecordHelper(D)); })<br>
<br>
-DEF_TRAVERSE_DECL(CXXRecordDecl, {<br>
- TRY_TO(TraverseCXXRecordHelper(D));<br>
- })<br>
+DEF_TRAVERSE_DECL(CXXRecordDecl, { TRY_TO(TraverseCXXRecordHelper(D)); })<br>
<br>
-#define DEF_TRAVERSE_TMPL_SPEC_DECL(TMPLDECLKIND) \<br>
-DEF_TRAVERSE_DECL(TMPLDECLKIND##TemplateSpecializationDecl, { \<br>
- /* For implicit instantiations ("set<int> x;"), we don't want to<br>
- recurse at all, since the instatiated template isn't written in<br>
- the source code anywhere. (Note the instatiated *type* --<br>
- set<int> -- is written, and will still get a callback of<br>
- TemplateSpecializationType). For explicit instantiations<br>
- ("template set<int>;"), we do need a callback, since this<br>
- is the only callback that's made for this instantiation.<br>
- We use getTypeAsWritten() to distinguish. */ \<br>
- if (TypeSourceInfo *TSI = D->getTypeAsWritten()) \<br>
- TRY_TO(TraverseTypeLoc(TSI->getTypeLoc())); \<br>
- \<br>
- if (!getDerived().shouldVisitTemplateInstantiations() && \<br>
- D->getTemplateSpecializationKind() != TSK_ExplicitSpecialization) \<br>
- /* Returning from here skips traversing the<br>
- declaration context of the *TemplateSpecializationDecl<br>
- (embedded in the DEF_TRAVERSE_DECL() macro)<br>
- which contains the instantiated members of the template. */ \<br>
- return true; \<br>
+#define DEF_TRAVERSE_TMPL_SPEC_DECL(TMPLDECLKIND) \<br>
+ DEF_TRAVERSE_DECL(TMPLDECLKIND##TemplateSpecializationDecl, { \<br>
+ /* For implicit instantiations ("set<int> x;"), we don't want to \<br>
+ recurse at all, since the instatiated template isn't written in \<br>
+ the source code anywhere. (Note the instatiated *type* -- \<br>
+ set<int> -- is written, and will still get a callback of \<br>
+ TemplateSpecializationType). For explicit instantiations \<br>
+ ("template set<int>;"), we do need a callback, since this \<br>
+ is the only callback that's made for this instantiation. \<br>
+ We use getTypeAsWritten() to distinguish. */ \<br>
+ if (TypeSourceInfo *TSI = D->getTypeAsWritten()) \<br>
+ TRY_TO(TraverseTypeLoc(TSI->getTypeLoc())); \<br>
+ \<br>
+ if (!getDerived().shouldVisitTemplateInstantiations() && \<br>
+ D->getTemplateSpecializationKind() != TSK_ExplicitSpecialization) \<br>
+ /* Returning from here skips traversing the \<br>
+ declaration context of the *TemplateSpecializationDecl \<br>
+ (embedded in the DEF_TRAVERSE_DECL() macro) \<br>
+ which contains the instantiated members of the template. */ \<br>
+ return true; \<br>
})<br>
<br>
DEF_TRAVERSE_TMPL_SPEC_DECL(Class)<br>
@@ -1722,8 +1650,8 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-#define DEF_TRAVERSE_TMPL_PART_SPEC_DECL(TMPLDECLKIND, DECLKIND) \<br>
-DEF_TRAVERSE_DECL(TMPLDECLKIND##TemplatePartialSpecializationDecl, { \<br>
+#define DEF_TRAVERSE_TMPL_PART_SPEC_DECL(TMPLDECLKIND, DECLKIND) \<br>
+ DEF_TRAVERSE_DECL(TMPLDECLKIND##TemplatePartialSpecializationDecl, { \<br>
/* The partial specialization. */ \<br>
if (TemplateParameterList *TPL = D->getTemplateParameters()) { \<br>
for (TemplateParameterList::iterator I = TPL->begin(), E = TPL->end(); \<br>
@@ -1747,20 +1675,18 @@ DEF_TRAVERSE_DECL(TMPLDECLKIND##Template<br>
DEF_TRAVERSE_TMPL_PART_SPEC_DECL(Class, CXXRecord)<br>
DEF_TRAVERSE_TMPL_PART_SPEC_DECL(Var, Var)<br>
<br>
-DEF_TRAVERSE_DECL(EnumConstantDecl, {<br>
- TRY_TO(TraverseStmt(D->getInitExpr()));<br>
- })<br>
+DEF_TRAVERSE_DECL(EnumConstantDecl, { TRY_TO(TraverseStmt(D->getInitExpr())); })<br>
<br>
DEF_TRAVERSE_DECL(UnresolvedUsingValueDecl, {<br>
- // Like UnresolvedUsingTypenameDecl, but without the 'typename':<br>
- // template <class T> Class A : public Base<T> { using Base<T>::foo; };<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));<br>
- })<br>
+ // Like UnresolvedUsingTypenameDecl, but without the 'typename':<br>
+ // template <class T> Class A : public Base<T> { using Base<T>::foo; };<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(IndirectFieldDecl, {})<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseDeclaratorHelper(DeclaratorDecl *D) {<br>
TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
if (D->getTypeSourceInfo())<br>
@@ -1770,33 +1696,31 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-DEF_TRAVERSE_DECL(MSPropertyDecl, {<br>
- TRY_TO(TraverseDeclaratorHelper(D));<br>
- })<br>
+DEF_TRAVERSE_DECL(MSPropertyDecl, { TRY_TO(TraverseDeclaratorHelper(D)); })<br>
<br>
DEF_TRAVERSE_DECL(FieldDecl, {<br>
- TRY_TO(TraverseDeclaratorHelper(D));<br>
- if (D->isBitField())<br>
- TRY_TO(TraverseStmt(D->getBitWidth()));<br>
- else if (D->hasInClassInitializer())<br>
- TRY_TO(TraverseStmt(D->getInClassInitializer()));<br>
- })<br>
+ TRY_TO(TraverseDeclaratorHelper(D));<br>
+ if (D->isBitField())<br>
+ TRY_TO(TraverseStmt(D->getBitWidth()));<br>
+ else if (D->hasInClassInitializer())<br>
+ TRY_TO(TraverseStmt(D->getInClassInitializer()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(ObjCAtDefsFieldDecl, {<br>
- TRY_TO(TraverseDeclaratorHelper(D));<br>
- if (D->isBitField())<br>
- TRY_TO(TraverseStmt(D->getBitWidth()));<br>
- // FIXME: implement the rest.<br>
- })<br>
+ TRY_TO(TraverseDeclaratorHelper(D));<br>
+ if (D->isBitField())<br>
+ TRY_TO(TraverseStmt(D->getBitWidth()));<br>
+ // FIXME: implement the rest.<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(ObjCIvarDecl, {<br>
- TRY_TO(TraverseDeclaratorHelper(D));<br>
- if (D->isBitField())<br>
- TRY_TO(TraverseStmt(D->getBitWidth()));<br>
- // FIXME: implement the rest.<br>
- })<br>
+ TRY_TO(TraverseDeclaratorHelper(D));<br>
+ if (D->isBitField())<br>
+ TRY_TO(TraverseStmt(D->getBitWidth()));<br>
+ // FIXME: implement the rest.<br>
+})<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseFunctionHelper(FunctionDecl *D) {<br>
TRY_TO(TraverseNestedNameSpecifierLoc(D->getQualifierLoc()));<br>
TRY_TO(TraverseDeclarationNameInfo(D->getNameInfo()));<br>
@@ -1807,13 +1731,13 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
// the function args, but both are handled by the FunctionTypeLoc<br>
// above, so we have to choose one side. I've decided to do before.<br>
if (const FunctionTemplateSpecializationInfo *FTSI =<br>
- D->getTemplateSpecializationInfo()) {<br>
+ D->getTemplateSpecializationInfo()) {<br>
if (FTSI->getTemplateSpecializationKind() != TSK_Undeclared &&<br>
FTSI->getTemplateSpecializationKind() != TSK_ImplicitInstantiation) {<br>
// A specialization might not have explicit template arguments if it has<br>
// a templated return type and concrete arguments.<br>
if (const ASTTemplateArgumentListInfo *TALI =<br>
- FTSI->TemplateArgumentsAsWritten) {<br>
+ FTSI->TemplateArgumentsAsWritten) {<br>
TRY_TO(TraverseTemplateArgumentLocsHelper(TALI->getTemplateArgs(),<br>
TALI->NumTemplateArgs));<br>
}<br>
@@ -1832,7 +1756,8 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
// declarations do not have valid TypeSourceInfo, so to visit them<br>
// we need to traverse the declarations explicitly.<br>
for (FunctionDecl::param_const_iterator I = D->param_begin(),<br>
- E = D->param_end(); I != E; ++I)<br>
+ E = D->param_end();<br>
+ I != E; ++I)<br>
TRY_TO(TraverseDecl(*I));<br>
}<br>
<br>
@@ -1844,44 +1769,44 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
<br>
if (D->isThisDeclarationADefinition()) {<br>
- TRY_TO(TraverseStmt(D->getBody())); // Function body.<br>
+ TRY_TO(TraverseStmt(D->getBody())); // Function body.<br>
}<br>
return true;<br>
}<br>
<br>
DEF_TRAVERSE_DECL(FunctionDecl, {<br>
- // We skip decls_begin/decls_end, which are already covered by<br>
- // TraverseFunctionHelper().<br>
- return TraverseFunctionHelper(D);<br>
- })<br>
+ // We skip decls_begin/decls_end, which are already covered by<br>
+ // TraverseFunctionHelper().<br>
+ return TraverseFunctionHelper(D);<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(CXXMethodDecl, {<br>
- // We skip decls_begin/decls_end, which are already covered by<br>
- // TraverseFunctionHelper().<br>
- return TraverseFunctionHelper(D);<br>
- })<br>
+ // We skip decls_begin/decls_end, which are already covered by<br>
+ // TraverseFunctionHelper().<br>
+ return TraverseFunctionHelper(D);<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(CXXConstructorDecl, {<br>
- // We skip decls_begin/decls_end, which are already covered by<br>
- // TraverseFunctionHelper().<br>
- return TraverseFunctionHelper(D);<br>
- })<br>
+ // We skip decls_begin/decls_end, which are already covered by<br>
+ // TraverseFunctionHelper().<br>
+ return TraverseFunctionHelper(D);<br>
+})<br>
<br>
// CXXConversionDecl is the declaration of a type conversion operator.<br>
// It's not a cast expression.<br>
DEF_TRAVERSE_DECL(CXXConversionDecl, {<br>
- // We skip decls_begin/decls_end, which are already covered by<br>
- // TraverseFunctionHelper().<br>
- return TraverseFunctionHelper(D);<br>
- })<br>
+ // We skip decls_begin/decls_end, which are already covered by<br>
+ // TraverseFunctionHelper().<br>
+ return TraverseFunctionHelper(D);<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(CXXDestructorDecl, {<br>
- // We skip decls_begin/decls_end, which are already covered by<br>
- // TraverseFunctionHelper().<br>
- return TraverseFunctionHelper(D);<br>
- })<br>
+ // We skip decls_begin/decls_end, which are already covered by<br>
+ // TraverseFunctionHelper().<br>
+ return TraverseFunctionHelper(D);<br>
+})<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseVarHelper(VarDecl *D) {<br>
TRY_TO(TraverseDeclaratorHelper(D));<br>
// Default params are taken care of when we traverse the ParmVarDecl.<br>
@@ -1891,34 +1816,28 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
return true;<br>
}<br>
<br>
-DEF_TRAVERSE_DECL(VarDecl, {<br>
- TRY_TO(TraverseVarHelper(D));<br>
- })<br>
+DEF_TRAVERSE_DECL(VarDecl, { TRY_TO(TraverseVarHelper(D)); })<br>
<br>
-DEF_TRAVERSE_DECL(ImplicitParamDecl, {<br>
- TRY_TO(TraverseVarHelper(D));<br>
- })<br>
+DEF_TRAVERSE_DECL(ImplicitParamDecl, { TRY_TO(TraverseVarHelper(D)); })<br>
<br>
DEF_TRAVERSE_DECL(NonTypeTemplateParmDecl, {<br>
- // A non-type template parameter, e.g. "S" in template<int S> class Foo ...<br>
- TRY_TO(TraverseDeclaratorHelper(D));<br>
- if (D->hasDefaultArgument() && !D->defaultArgumentWasInherited())<br>
- TRY_TO(TraverseStmt(D->getDefaultArgument()));<br>
- })<br>
+ // A non-type template parameter, e.g. "S" in template<int S> class Foo ...<br>
+ TRY_TO(TraverseDeclaratorHelper(D));<br>
+ if (D->hasDefaultArgument() && !D->defaultArgumentWasInherited())<br>
+ TRY_TO(TraverseStmt(D->getDefaultArgument()));<br>
+})<br>
<br>
DEF_TRAVERSE_DECL(ParmVarDecl, {<br>
- TRY_TO(TraverseVarHelper(D));<br>
+ TRY_TO(TraverseVarHelper(D));<br>
<br>
- if (D->hasDefaultArg() &&<br>
- D->hasUninstantiatedDefaultArg() &&<br>
- !D->hasUnparsedDefaultArg())<br>
- TRY_TO(TraverseStmt(D->getUninstantiatedDefaultArg()));<br>
-<br>
- if (D->hasDefaultArg() &&<br>
- !D->hasUninstantiatedDefaultArg() &&<br>
- !D->hasUnparsedDefaultArg())<br>
- TRY_TO(TraverseStmt(D->getDefaultArg()));<br>
- })<br>
+ if (D->hasDefaultArg() && D->hasUninstantiatedDefaultArg() &&<br>
+ !D->hasUnparsedDefaultArg())<br>
+ TRY_TO(TraverseStmt(D->getUninstantiatedDefaultArg()));<br>
+<br>
+ if (D->hasDefaultArg() && !D->hasUninstantiatedDefaultArg() &&<br>
+ !D->hasUnparsedDefaultArg())<br>
+ TRY_TO(TraverseStmt(D->getDefaultArg()));<br>
+})<br>
<br>
#undef DEF_TRAVERSE_DECL<br>
<br>
@@ -1932,77 +1851,77 @@ DEF_TRAVERSE_DECL(ParmVarDecl, {<br>
// <a href="http://clang.llvm.org/doxygen/Stmt_8cpp_source.html" target="_blank" class="cremed">http://clang.llvm.org/doxygen/Stmt_8cpp_source.html</a><br>
<br>
// This macro makes available a variable S, the passed-in stmt.<br>
-#define DEF_TRAVERSE_STMT(STMT, CODE) \<br>
-template<typename Derived> \<br>
-bool RecursiveASTVisitor<Derived>::Traverse##STMT (STMT *S) { \<br>
- TRY_TO(WalkUpFrom##STMT(S)); \<br>
- { CODE; } \<br>
- for (Stmt::child_range range = S->children(); range; ++range) { \<br>
- TRY_TO(TraverseStmt(*range)); \<br>
- } \<br>
- return true; \<br>
-}<br>
+#define DEF_TRAVERSE_STMT(STMT, CODE) \<br>
+ template <typename Derived> \<br>
+ bool RecursiveASTVisitor<Derived>::Traverse##STMT(STMT *S) { \<br>
+ TRY_TO(WalkUpFrom##STMT(S)); \<br>
+ { CODE; } \<br>
+ for (Stmt::child_range range = S->children(); range; ++range) { \<br>
+ TRY_TO(TraverseStmt(*range)); \<br>
+ } \<br>
+ return true; \<br>
+ }<br>
<br>
DEF_TRAVERSE_STMT(GCCAsmStmt, {<br>
- TRY_TO(TraverseStmt(S->getAsmString()));<br>
- for (unsigned I = 0, E = S->getNumInputs(); I < E; ++I) {<br>
- TRY_TO(TraverseStmt(S->getInputConstraintLiteral(I)));<br>
- }<br>
- for (unsigned I = 0, E = S->getNumOutputs(); I < E; ++I) {<br>
- TRY_TO(TraverseStmt(S->getOutputConstraintLiteral(I)));<br>
- }<br>
- for (unsigned I = 0, E = S->getNumClobbers(); I < E; ++I) {<br>
- TRY_TO(TraverseStmt(S->getClobberStringLiteral(I)));<br>
- }<br>
- // children() iterates over inputExpr and outputExpr.<br>
- })<br>
+ TRY_TO(TraverseStmt(S->getAsmString()));<br>
+ for (unsigned I = 0, E = S->getNumInputs(); I < E; ++I) {<br>
+ TRY_TO(TraverseStmt(S->getInputConstraintLiteral(I)));<br>
+ }<br>
+ for (unsigned I = 0, E = S->getNumOutputs(); I < E; ++I) {<br>
+ TRY_TO(TraverseStmt(S->getOutputConstraintLiteral(I)));<br>
+ }<br>
+ for (unsigned I = 0, E = S->getNumClobbers(); I < E; ++I) {<br>
+ TRY_TO(TraverseStmt(S->getClobberStringLiteral(I)));<br>
+ }<br>
+ // children() iterates over inputExpr and outputExpr.<br>
+})<br>
<br>
-DEF_TRAVERSE_STMT(MSAsmStmt, {<br>
- // FIXME: MS Asm doesn't currently parse Constraints, Clobbers, etc. Once<br>
- // added this needs to be implemented.<br>
- })<br>
+DEF_TRAVERSE_STMT(<br>
+ MSAsmStmt,<br>
+ {// FIXME: MS Asm doesn't currently parse Constraints, Clobbers, etc. Once<br>
+ // added this needs to be implemented.<br>
+ })<br>
<br>
DEF_TRAVERSE_STMT(CXXCatchStmt, {<br>
- TRY_TO(TraverseDecl(S->getExceptionDecl()));<br>
- // children() iterates over the handler block.<br>
- })<br>
+ TRY_TO(TraverseDecl(S->getExceptionDecl()));<br>
+ // children() iterates over the handler block.<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(DeclStmt, {<br>
- for (auto *I : S->decls()) {<br>
- TRY_TO(TraverseDecl(I));<br>
- }<br>
- // Suppress the default iteration over children() by<br>
- // returning. Here's why: A DeclStmt looks like 'type var [=<br>
- // initializer]'. The decls above already traverse over the<br>
- // initializers, so we don't have to do it again (which<br>
- // children() would do).<br>
- return true;<br>
- })<br>
-<br>
+ for (auto *I : S->decls()) {<br>
+ TRY_TO(TraverseDecl(I));<br>
+ }<br>
+ // Suppress the default iteration over children() by<br>
+ // returning. Here's why: A DeclStmt looks like 'type var [=<br>
+ // initializer]'. The decls above already traverse over the<br>
+ // initializers, so we don't have to do it again (which<br>
+ // children() would do).<br>
+ return true;<br>
+})<br>
<br>
// These non-expr stmts (most of them), do not need any action except<br>
// iterating over the children.<br>
-DEF_TRAVERSE_STMT(BreakStmt, { })<br>
-DEF_TRAVERSE_STMT(CXXTryStmt, { })<br>
-DEF_TRAVERSE_STMT(CaseStmt, { })<br>
-DEF_TRAVERSE_STMT(CompoundStmt, { })<br>
-DEF_TRAVERSE_STMT(ContinueStmt, { })<br>
-DEF_TRAVERSE_STMT(DefaultStmt, { })<br>
-DEF_TRAVERSE_STMT(DoStmt, { })<br>
-DEF_TRAVERSE_STMT(ForStmt, { })<br>
-DEF_TRAVERSE_STMT(GotoStmt, { })<br>
-DEF_TRAVERSE_STMT(IfStmt, { })<br>
-DEF_TRAVERSE_STMT(IndirectGotoStmt, { })<br>
-DEF_TRAVERSE_STMT(LabelStmt, { })<br>
-DEF_TRAVERSE_STMT(AttributedStmt, { })<br>
-DEF_TRAVERSE_STMT(NullStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCAtCatchStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCAtFinallyStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCAtSynchronizedStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCAtThrowStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCAtTryStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCForCollectionStmt, { })<br>
-DEF_TRAVERSE_STMT(ObjCAutoreleasePoolStmt, { })<br>
+DEF_TRAVERSE_STMT(BreakStmt, {})<br>
+DEF_TRAVERSE_STMT(CXXTryStmt, {})<br>
+DEF_TRAVERSE_STMT(CaseStmt, {})<br>
+DEF_TRAVERSE_STMT(CompoundStmt, {})<br>
+DEF_TRAVERSE_STMT(ContinueStmt, {})<br>
+DEF_TRAVERSE_STMT(DefaultStmt, {})<br>
+DEF_TRAVERSE_STMT(DoStmt, {})<br>
+DEF_TRAVERSE_STMT(ForStmt, {})<br>
+DEF_TRAVERSE_STMT(GotoStmt, {})<br>
+DEF_TRAVERSE_STMT(IfStmt, {})<br>
+DEF_TRAVERSE_STMT(IndirectGotoStmt, {})<br>
+DEF_TRAVERSE_STMT(LabelStmt, {})<br>
+DEF_TRAVERSE_STMT(AttributedStmt, {})<br>
+DEF_TRAVERSE_STMT(NullStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCAtCatchStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCAtFinallyStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCAtSynchronizedStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCAtThrowStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCAtTryStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCForCollectionStmt, {})<br>
+DEF_TRAVERSE_STMT(ObjCAutoreleasePoolStmt, {})<br>
DEF_TRAVERSE_STMT(CXXForRangeStmt, {<br>
if (!getDerived().shouldVisitImplicitCode()) {<br>
TRY_TO(TraverseStmt(S->getLoopVarStmt()));<br>
@@ -2013,82 +1932,82 @@ DEF_TRAVERSE_STMT(CXXForRangeStmt, {<br>
}<br>
})<br>
DEF_TRAVERSE_STMT(MSDependentExistsStmt, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));<br>
})<br>
-DEF_TRAVERSE_STMT(ReturnStmt, { })<br>
-DEF_TRAVERSE_STMT(SwitchStmt, { })<br>
-DEF_TRAVERSE_STMT(WhileStmt, { })<br>
-<br>
+DEF_TRAVERSE_STMT(ReturnStmt, {})<br>
+DEF_TRAVERSE_STMT(SwitchStmt, {})<br>
+DEF_TRAVERSE_STMT(WhileStmt, {})<br>
<br>
DEF_TRAVERSE_STMT(CXXDependentScopeMemberExpr, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(S->getMemberNameInfo()));<br>
- if (S->hasExplicitTemplateArgs()) {<br>
- TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
- S->getTemplateArgs(), S->getNumTemplateArgs()));<br>
- }<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(S->getMemberNameInfo()));<br>
+ if (S->hasExplicitTemplateArgs()) {<br>
+ TRY_TO(TraverseTemplateArgumentLocsHelper(S->getTemplateArgs(),<br>
+ S->getNumTemplateArgs()));<br>
+ }<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(DeclRefExpr, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));<br>
- TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
- S->getTemplateArgs(), S->getNumTemplateArgs()));<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));<br>
+ TRY_TO(TraverseTemplateArgumentLocsHelper(S->getTemplateArgs(),<br>
+ S->getNumTemplateArgs()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(DependentScopeDeclRefExpr, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));<br>
- if (S->hasExplicitTemplateArgs()) {<br>
- TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
- S->getExplicitTemplateArgs().getTemplateArgs(),<br>
- S->getNumTemplateArgs()));<br>
- }<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(S->getNameInfo()));<br>
+ if (S->hasExplicitTemplateArgs()) {<br>
+ TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
+ S->getExplicitTemplateArgs().getTemplateArgs(),<br>
+ S->getNumTemplateArgs()));<br>
+ }<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(MemberExpr, {<br>
- TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
- TRY_TO(TraverseDeclarationNameInfo(S->getMemberNameInfo()));<br>
- TRY_TO(TraverseTemplateArgumentLocsHelper(<br>
- S->getTemplateArgs(), S->getNumTemplateArgs()));<br>
- })<br>
+ TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
+ TRY_TO(TraverseDeclarationNameInfo(S->getMemberNameInfo()));<br>
+ TRY_TO(TraverseTemplateArgumentLocsHelper(S->getTemplateArgs(),<br>
+ S->getNumTemplateArgs()));<br>
+})<br>
<br>
-DEF_TRAVERSE_STMT(ImplicitCastExpr, {<br>
- // We don't traverse the cast type, as it's not written in the<br>
- // source code.<br>
- })<br>
+DEF_TRAVERSE_STMT(<br>
+ ImplicitCastExpr,<br>
+ {// We don't traverse the cast type, as it's not written in the<br>
+ // source code.<br>
+ })<br>
<br>
DEF_TRAVERSE_STMT(CStyleCastExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXFunctionalCastExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXConstCastExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXDynamicCastExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXReinterpretCastExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXStaticCastExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
+})<br>
<br>
// InitListExpr is a tricky one, because we want to do all our work on<br>
// the syntactic form of the listexpr, but this method takes the<br>
// semantic form by default. We can't use the macro helper because it<br>
// calls WalkUp*() on the semantic form, before our code can convert<br>
// to the syntactic form.<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseInitListExpr(InitListExpr *S) {<br>
if (InitListExpr *Syn = S->getSyntacticForm())<br>
S = Syn;<br>
@@ -2103,9 +2022,9 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
// GenericSelectionExpr is a special case because the types and expressions<br>
// are interleaved. We also need to watch out for null types (default<br>
// generic associations).<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::<br>
-TraverseGenericSelectionExpr(GenericSelectionExpr *S) {<br>
+template <typename Derived><br>
+bool RecursiveASTVisitor<Derived>::TraverseGenericSelectionExpr(<br>
+ GenericSelectionExpr *S) {<br>
TRY_TO(WalkUpFromGenericSelectionExpr(S));<br>
TRY_TO(TraverseStmt(S->getControllingExpr()));<br>
for (unsigned i = 0; i != S->getNumAssocs(); ++i) {<br>
@@ -2118,13 +2037,14 @@ TraverseGenericSelectionExpr(GenericSele<br>
<br>
// PseudoObjectExpr is a special case because of the wierdness with<br>
// syntactic expressions and opaque values.<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::<br>
-TraversePseudoObjectExpr(PseudoObjectExpr *S) {<br>
+template <typename Derived><br>
+bool<br>
+RecursiveASTVisitor<Derived>::TraversePseudoObjectExpr(PseudoObjectExpr *S) {<br>
TRY_TO(WalkUpFromPseudoObjectExpr(S));<br>
TRY_TO(TraverseStmt(S->getSyntacticForm()));<br>
- for (PseudoObjectExpr::semantics_iterator<br>
- i = S->semantics_begin(), e = S->semantics_end(); i != e; ++i) {<br>
+ for (PseudoObjectExpr::semantics_iterator i = S->semantics_begin(),<br>
+ e = S->semantics_end();<br>
+ i != e; ++i) {<br>
Expr *sub = *i;<br>
if (OpaqueValueExpr *OVE = dyn_cast<OpaqueValueExpr>(sub))<br>
sub = OVE->getSourceExpr();<br>
@@ -2134,48 +2054,48 @@ TraversePseudoObjectExpr(PseudoObjectExp<br>
}<br>
<br>
DEF_TRAVERSE_STMT(CXXScalarValueInitExpr, {<br>
- // This is called for code like 'return T()' where T is a built-in<br>
- // (i.e. non-class) type.<br>
- TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
- })<br>
+ // This is called for code like 'return T()' where T is a built-in<br>
+ // (i.e. non-class) type.<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXNewExpr, {<br>
// The child-iterator will pick up the other arguments.<br>
TRY_TO(TraverseTypeLoc(S->getAllocatedTypeSourceInfo()->getTypeLoc()));<br>
- })<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(OffsetOfExpr, {<br>
- // The child-iterator will pick up the expression representing<br>
- // the field.<br>
- // FIMXE: for code like offsetof(Foo, a.b.c), should we get<br>
- // making a MemberExpr callbacks for Foo.a, Foo.a.b, and Foo.a.b.c?<br>
- TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
- })<br>
+ // The child-iterator will pick up the expression representing<br>
+ // the field.<br>
+ // FIMXE: for code like offsetof(Foo, a.b.c), should we get<br>
+ // making a MemberExpr callbacks for Foo.a, Foo.a.b, and Foo.a.b.c?<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(UnaryExprOrTypeTraitExpr, {<br>
- // The child-iterator will pick up the arg if it's an expression,<br>
- // but not if it's a type.<br>
- if (S->isArgumentType())<br>
- TRY_TO(TraverseTypeLoc(S->getArgumentTypeInfo()->getTypeLoc()));<br>
- })<br>
+ // The child-iterator will pick up the arg if it's an expression,<br>
+ // but not if it's a type.<br>
+ if (S->isArgumentType())<br>
+ TRY_TO(TraverseTypeLoc(S->getArgumentTypeInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXTypeidExpr, {<br>
- // The child-iterator will pick up the arg if it's an expression,<br>
- // but not if it's a type.<br>
- if (S->isTypeOperand())<br>
- TRY_TO(TraverseTypeLoc(S->getTypeOperandSourceInfo()->getTypeLoc()));<br>
- })<br>
+ // The child-iterator will pick up the arg if it's an expression,<br>
+ // but not if it's a type.<br>
+ if (S->isTypeOperand())<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeOperandSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(MSPropertyRefExpr, {<br>
TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
})<br>
<br>
DEF_TRAVERSE_STMT(CXXUuidofExpr, {<br>
- // The child-iterator will pick up the arg if it's an expression,<br>
- // but not if it's a type.<br>
- if (S->isTypeOperand())<br>
- TRY_TO(TraverseTypeLoc(S->getTypeOperandSourceInfo()->getTypeLoc()));<br>
- })<br>
+ // The child-iterator will pick up the arg if it's an expression,<br>
+ // but not if it's a type.<br>
+ if (S->isTypeOperand())<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeOperandSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(TypeTraitExpr, {<br>
for (unsigned I = 0, N = S->getNumArgs(); I != N; ++I)<br>
@@ -2183,30 +2103,29 @@ DEF_TRAVERSE_STMT(TypeTraitExpr, {<br>
})<br>
<br>
DEF_TRAVERSE_STMT(ArrayTypeTraitExpr, {<br>
- TRY_TO(TraverseTypeLoc(S->getQueriedTypeSourceInfo()->getTypeLoc()));<br>
- })<br>
+ TRY_TO(TraverseTypeLoc(S->getQueriedTypeSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
-DEF_TRAVERSE_STMT(ExpressionTraitExpr, {<br>
- TRY_TO(TraverseStmt(S->getQueriedExpression()));<br>
- })<br>
+DEF_TRAVERSE_STMT(ExpressionTraitExpr,<br>
+ { TRY_TO(TraverseStmt(S->getQueriedExpression())); })<br>
<br>
DEF_TRAVERSE_STMT(VAArgExpr, {<br>
- // The child-iterator will pick up the expression argument.<br>
- TRY_TO(TraverseTypeLoc(S->getWrittenTypeInfo()->getTypeLoc()));<br>
- })<br>
+ // The child-iterator will pick up the expression argument.<br>
+ TRY_TO(TraverseTypeLoc(S->getWrittenTypeInfo()->getTypeLoc()));<br>
+})<br>
<br>
DEF_TRAVERSE_STMT(CXXTemporaryObjectExpr, {<br>
- // This is called for code like 'return T()' where T is a class type.<br>
- TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
- })<br>
+ // This is called for code like 'return T()' where T is a class type.<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
-// Walk only the visible parts of lambda expressions.<br>
-template<typename Derived><br>
+// Walk only the visible parts of lambda expressions.<br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseLambdaExpr(LambdaExpr *S) {<br>
TRY_TO(WalkUpFromLambdaExpr(S));<br>
<br>
for (LambdaExpr::capture_iterator C = S->explicit_capture_begin(),<br>
- CEnd = S->explicit_capture_end();<br>
+ CEnd = S->explicit_capture_end();<br>
C != CEnd; ++C) {<br>
TRY_TO(TraverseLambdaCapture(S, C));<br>
}<br>
@@ -2224,7 +2143,7 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
} else {<br>
TRY_TO(TraverseTypeLoc(Proto.getReturnLoc()));<br>
- }<br>
+ }<br>
}<br>
}<br>
<br>
@@ -2233,36 +2152,36 @@ bool RecursiveASTVisitor<Derived>::Trave<br>
}<br>
<br>
DEF_TRAVERSE_STMT(CXXUnresolvedConstructExpr, {<br>
- // This is called for code like 'T()', where T is a template argument.<br>
- TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
- })<br>
+ // This is called for code like 'T()', where T is a template argument.<br>
+ TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
+})<br>
<br>
// These expressions all might take explicit template arguments.<br>
// We traverse those if so. FIXME: implement these.<br>
-DEF_TRAVERSE_STMT(CXXConstructExpr, { })<br>
-DEF_TRAVERSE_STMT(CallExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXMemberCallExpr, { })<br>
+DEF_TRAVERSE_STMT(CXXConstructExpr, {})<br>
+DEF_TRAVERSE_STMT(CallExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXMemberCallExpr, {})<br>
<br>
// These exprs (most of them), do not need any action except iterating<br>
// over the children.<br>
-DEF_TRAVERSE_STMT(AddrLabelExpr, { })<br>
-DEF_TRAVERSE_STMT(ArraySubscriptExpr, { })<br>
+DEF_TRAVERSE_STMT(AddrLabelExpr, {})<br>
+DEF_TRAVERSE_STMT(ArraySubscriptExpr, {})<br>
DEF_TRAVERSE_STMT(BlockExpr, {<br>
TRY_TO(TraverseDecl(S->getBlockDecl()));<br>
return true; // no child statements to loop through.<br>
})<br>
-DEF_TRAVERSE_STMT(ChooseExpr, { })<br>
+DEF_TRAVERSE_STMT(ChooseExpr, {})<br>
DEF_TRAVERSE_STMT(CompoundLiteralExpr, {<br>
TRY_TO(TraverseTypeLoc(S->getTypeSourceInfo()->getTypeLoc()));<br>
})<br>
-DEF_TRAVERSE_STMT(CXXBindTemporaryExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXBoolLiteralExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXDefaultArgExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXDefaultInitExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXDeleteExpr, { })<br>
-DEF_TRAVERSE_STMT(ExprWithCleanups, { })<br>
-DEF_TRAVERSE_STMT(CXXNullPtrLiteralExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXStdInitializerListExpr, { })<br>
+DEF_TRAVERSE_STMT(CXXBindTemporaryExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXBoolLiteralExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXDefaultArgExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXDefaultInitExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXDeleteExpr, {})<br>
+DEF_TRAVERSE_STMT(ExprWithCleanups, {})<br>
+DEF_TRAVERSE_STMT(CXXNullPtrLiteralExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXStdInitializerListExpr, {})<br>
DEF_TRAVERSE_STMT(CXXPseudoDestructorExpr, {<br>
TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
if (TypeSourceInfo *ScopeInfo = S->getScopeTypeInfo())<br>
@@ -2270,38 +2189,38 @@ DEF_TRAVERSE_STMT(CXXPseudoDestructorExp<br>
if (TypeSourceInfo *DestroyedTypeInfo = S->getDestroyedTypeInfo())<br>
TRY_TO(TraverseTypeLoc(DestroyedTypeInfo->getTypeLoc()));<br>
})<br>
-DEF_TRAVERSE_STMT(CXXThisExpr, { })<br>
-DEF_TRAVERSE_STMT(CXXThrowExpr, { })<br>
-DEF_TRAVERSE_STMT(UserDefinedLiteral, { })<br>
-DEF_TRAVERSE_STMT(DesignatedInitExpr, { })<br>
-DEF_TRAVERSE_STMT(ExtVectorElementExpr, { })<br>
-DEF_TRAVERSE_STMT(GNUNullExpr, { })<br>
-DEF_TRAVERSE_STMT(ImplicitValueInitExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCBoolLiteralExpr, { })<br>
+DEF_TRAVERSE_STMT(CXXThisExpr, {})<br>
+DEF_TRAVERSE_STMT(CXXThrowExpr, {})<br>
+DEF_TRAVERSE_STMT(UserDefinedLiteral, {})<br>
+DEF_TRAVERSE_STMT(DesignatedInitExpr, {})<br>
+DEF_TRAVERSE_STMT(ExtVectorElementExpr, {})<br>
+DEF_TRAVERSE_STMT(GNUNullExpr, {})<br>
+DEF_TRAVERSE_STMT(ImplicitValueInitExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCBoolLiteralExpr, {})<br>
DEF_TRAVERSE_STMT(ObjCEncodeExpr, {<br>
if (TypeSourceInfo *TInfo = S->getEncodedTypeSourceInfo())<br>
TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));<br>
})<br>
-DEF_TRAVERSE_STMT(ObjCIsaExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCIvarRefExpr, { })<br>
+DEF_TRAVERSE_STMT(ObjCIsaExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCIvarRefExpr, {})<br>
DEF_TRAVERSE_STMT(ObjCMessageExpr, {<br>
if (TypeSourceInfo *TInfo = S->getClassReceiverTypeInfo())<br>
TRY_TO(TraverseTypeLoc(TInfo->getTypeLoc()));<br>
})<br>
-DEF_TRAVERSE_STMT(ObjCPropertyRefExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCSubscriptRefExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCProtocolExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCSelectorExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCIndirectCopyRestoreExpr, { })<br>
+DEF_TRAVERSE_STMT(ObjCPropertyRefExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCSubscriptRefExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCProtocolExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCSelectorExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCIndirectCopyRestoreExpr, {})<br>
DEF_TRAVERSE_STMT(ObjCBridgedCastExpr, {<br>
TRY_TO(TraverseTypeLoc(S->getTypeInfoAsWritten()->getTypeLoc()));<br>
})<br>
-DEF_TRAVERSE_STMT(ParenExpr, { })<br>
-DEF_TRAVERSE_STMT(ParenListExpr, { })<br>
-DEF_TRAVERSE_STMT(PredefinedExpr, { })<br>
-DEF_TRAVERSE_STMT(ShuffleVectorExpr, { })<br>
-DEF_TRAVERSE_STMT(ConvertVectorExpr, { })<br>
-DEF_TRAVERSE_STMT(StmtExpr, { })<br>
+DEF_TRAVERSE_STMT(ParenExpr, {})<br>
+DEF_TRAVERSE_STMT(ParenListExpr, {})<br>
+DEF_TRAVERSE_STMT(PredefinedExpr, {})<br>
+DEF_TRAVERSE_STMT(ShuffleVectorExpr, {})<br>
+DEF_TRAVERSE_STMT(ConvertVectorExpr, {})<br>
+DEF_TRAVERSE_STMT(StmtExpr, {})<br>
DEF_TRAVERSE_STMT(UnresolvedLookupExpr, {<br>
TRY_TO(TraverseNestedNameSpecifierLoc(S->getQualifierLoc()));<br>
if (S->hasExplicitTemplateArgs()) {<br>
@@ -2320,87 +2239,90 @@ DEF_TRAVERSE_STMT(UnresolvedMemberExpr,<br>
<br>
DEF_TRAVERSE_STMT(SEHTryStmt, {})<br>
DEF_TRAVERSE_STMT(SEHExceptStmt, {})<br>
-DEF_TRAVERSE_STMT(SEHFinallyStmt,{})<br>
-DEF_TRAVERSE_STMT(CapturedStmt, {<br>
- TRY_TO(TraverseDecl(S->getCapturedDecl()));<br>
-})<br>
+DEF_TRAVERSE_STMT(SEHFinallyStmt, {})<br>
+DEF_TRAVERSE_STMT(CapturedStmt, { TRY_TO(TraverseDecl(S->getCapturedDecl())); })<br>
<br>
-DEF_TRAVERSE_STMT(CXXOperatorCallExpr, { })<br>
-DEF_TRAVERSE_STMT(OpaqueValueExpr, { })<br>
-DEF_TRAVERSE_STMT(CUDAKernelCallExpr, { })<br>
+DEF_TRAVERSE_STMT(CXXOperatorCallExpr, {})<br>
+DEF_TRAVERSE_STMT(OpaqueValueExpr, {})<br>
+DEF_TRAVERSE_STMT(CUDAKernelCallExpr, {})<br>
<br>
// These operators (all of them) do not need any action except<br>
// iterating over the children.<br>
-DEF_TRAVERSE_STMT(BinaryConditionalOperator, { })<br>
-DEF_TRAVERSE_STMT(ConditionalOperator, { })<br>
-DEF_TRAVERSE_STMT(UnaryOperator, { })<br>
-DEF_TRAVERSE_STMT(BinaryOperator, { })<br>
-DEF_TRAVERSE_STMT(CompoundAssignOperator, { })<br>
-DEF_TRAVERSE_STMT(CXXNoexceptExpr, { })<br>
-DEF_TRAVERSE_STMT(PackExpansionExpr, { })<br>
-DEF_TRAVERSE_STMT(SizeOfPackExpr, { })<br>
-DEF_TRAVERSE_STMT(SubstNonTypeTemplateParmPackExpr, { })<br>
-DEF_TRAVERSE_STMT(SubstNonTypeTemplateParmExpr, { })<br>
-DEF_TRAVERSE_STMT(FunctionParmPackExpr, { })<br>
-DEF_TRAVERSE_STMT(MaterializeTemporaryExpr, { })<br>
-DEF_TRAVERSE_STMT(AtomicExpr, { })<br>
+DEF_TRAVERSE_STMT(BinaryConditionalOperator, {})<br>
+DEF_TRAVERSE_STMT(ConditionalOperator, {})<br>
+DEF_TRAVERSE_STMT(UnaryOperator, {})<br>
+DEF_TRAVERSE_STMT(BinaryOperator, {})<br>
+DEF_TRAVERSE_STMT(CompoundAssignOperator, {})<br>
+DEF_TRAVERSE_STMT(CXXNoexceptExpr, {})<br>
+DEF_TRAVERSE_STMT(PackExpansionExpr, {})<br>
+DEF_TRAVERSE_STMT(SizeOfPackExpr, {})<br>
+DEF_TRAVERSE_STMT(SubstNonTypeTemplateParmPackExpr, {})<br>
+DEF_TRAVERSE_STMT(SubstNonTypeTemplateParmExpr, {})<br>
+DEF_TRAVERSE_STMT(FunctionParmPackExpr, {})<br>
+DEF_TRAVERSE_STMT(MaterializeTemporaryExpr, {})<br>
+DEF_TRAVERSE_STMT(AtomicExpr, {})<br>
<br>
// These literals (all of them) do not need any action.<br>
-DEF_TRAVERSE_STMT(IntegerLiteral, { })<br>
-DEF_TRAVERSE_STMT(CharacterLiteral, { })<br>
-DEF_TRAVERSE_STMT(FloatingLiteral, { })<br>
-DEF_TRAVERSE_STMT(ImaginaryLiteral, { })<br>
-DEF_TRAVERSE_STMT(StringLiteral, { })<br>
-DEF_TRAVERSE_STMT(ObjCStringLiteral, { })<br>
-DEF_TRAVERSE_STMT(ObjCBoxedExpr, { })<br>
-DEF_TRAVERSE_STMT(ObjCArrayLiteral, { })<br>
-DEF_TRAVERSE_STMT(ObjCDictionaryLiteral, { })<br>
-<br>
+DEF_TRAVERSE_STMT(IntegerLiteral, {})<br>
+DEF_TRAVERSE_STMT(CharacterLiteral, {})<br>
+DEF_TRAVERSE_STMT(FloatingLiteral, {})<br>
+DEF_TRAVERSE_STMT(ImaginaryLiteral, {})<br>
+DEF_TRAVERSE_STMT(StringLiteral, {})<br>
+DEF_TRAVERSE_STMT(ObjCStringLiteral, {})<br>
+DEF_TRAVERSE_STMT(ObjCBoxedExpr, {})<br>
+DEF_TRAVERSE_STMT(ObjCArrayLiteral, {})<br>
+DEF_TRAVERSE_STMT(ObjCDictionaryLiteral, {})<br>
+<br>
// Traverse OpenCL: AsType, Convert.<br>
-DEF_TRAVERSE_STMT(AsTypeExpr, { })<br>
+DEF_TRAVERSE_STMT(AsTypeExpr, {})<br>
<br>
// OpenMP directives.<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseOMPExecutableDirective(<br>
- OMPExecutableDirective *S) {<br>
+ OMPExecutableDirective *S) {<br>
ArrayRef<OMPClause *> Clauses = S->clauses();<br>
for (ArrayRef<OMPClause *>::iterator I = Clauses.begin(), E = Clauses.end();<br>
I != E; ++I)<br>
- if (!TraverseOMPClause(*I)) return false;<br>
+ if (!TraverseOMPClause(*I))<br>
+ return false;<br>
return true;<br>
}<br>
<br>
DEF_TRAVERSE_STMT(OMPParallelDirective, {<br>
- if (!TraverseOMPExecutableDirective(S)) return false;<br>
+ if (!TraverseOMPExecutableDirective(S))<br>
+ return false;<br>
})<br>
<br>
DEF_TRAVERSE_STMT(OMPSimdDirective, {<br>
- if (!TraverseOMPExecutableDirective(S)) return false;<br>
+ if (!TraverseOMPExecutableDirective(S))<br>
+ return false;<br>
})<br>
<br>
// OpenMP clauses.<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::TraverseOMPClause(OMPClause *C) {<br>
- if (!C) return true;<br>
+ if (!C)<br>
+ return true;<br>
switch (C->getClauseKind()) {<br>
-#define OPENMP_CLAUSE(Name, Class) \<br>
- case OMPC_##Name: \<br>
- return getDerived().Visit##Class(static_cast<Class*>(C));<br>
+#define OPENMP_CLAUSE(Name, Class) \<br>
+ case OMPC_##Name: \<br>
+ return getDerived().Visit##Class(static_cast<Class *>(C));<br>
#include "clang/Basic/OpenMPKinds.def"<br>
- default: break;<br>
+ default:<br>
+ break;<br>
}<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPIfClause(OMPIfClause *C) {<br>
TraverseStmt(C->getCondition());<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::VisitOMPNumThreadsClause(<br>
- OMPNumThreadsClause *C) {<br>
+template <typename Derived><br>
+bool<br>
+RecursiveASTVisitor<Derived>::VisitOMPNumThreadsClause(OMPNumThreadsClause *C) {<br>
TraverseStmt(C->getNumThreads());<br>
return true;<br>
}<br>
@@ -2411,50 +2333,51 @@ bool RecursiveASTVisitor<Derived>::Visit<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPDefaultClause(OMPDefaultClause *C) {<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
-bool RecursiveASTVisitor<Derived>::VisitOMPProcBindClause(OMPProcBindClause *C) {<br>
+template <typename Derived><br>
+bool<br>
+RecursiveASTVisitor<Derived>::VisitOMPProcBindClause(OMPProcBindClause *C) {<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
-template<typename T><br>
+template <typename Derived><br>
+template <typename T><br>
void RecursiveASTVisitor<Derived>::VisitOMPClauseList(T *Node) {<br>
for (auto *I : Node->varlists())<br>
TraverseStmt(I);<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPPrivateClause(OMPPrivateClause *C) {<br>
VisitOMPClauseList(C);<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPFirstprivateClause(<br>
- OMPFirstprivateClause *C) {<br>
+ OMPFirstprivateClause *C) {<br>
VisitOMPClauseList(C);<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPSharedClause(OMPSharedClause *C) {<br>
VisitOMPClauseList(C);<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPLinearClause(OMPLinearClause *C) {<br>
VisitOMPClauseList(C);<br>
TraverseStmt(C->getStep());<br>
return true;<br>
}<br>
<br>
-template<typename Derived><br>
+template <typename Derived><br>
bool RecursiveASTVisitor<Derived>::VisitOMPCopyinClause(OMPCopyinClause *C) {<br>
VisitOMPClauseList(C);<br>
return true;<br>
<br>
<br>
_______________________________________________<br>
cfe-commits mailing list<br>
<a href="mailto:cfe-commits@cs.uiuc.edu" class="cremed">cfe-commits@cs.uiuc.edu</a><br>
<a href="http://lists.cs.uiuc.edu/mailman/listinfo/cfe-commits" target="_blank" class="cremed">http://lists.cs.uiuc.edu/mailman/listinfo/cfe-commits</a><br>
</blockquote></div><br></div></div>