Lines Matching refs:NAME

290 #define OPERATOR(NAME)                                                         \
291 bool TraverseUnary##NAME(UnaryOperator *S) { \
292 TRY_TO(WalkUpFromUnary##NAME(S)); \
296 bool WalkUpFromUnary##NAME(UnaryOperator *S) { \
298 TRY_TO(VisitUnary##NAME(S)); \
301 bool VisitUnary##NAME(UnaryOperator *S) { return true; }
309 #define GENERAL_BINOP_FALLBACK(NAME, BINOP_TYPE) \
310 bool TraverseBin##NAME(BINOP_TYPE *S) { \
311 TRY_TO(WalkUpFromBin##NAME(S)); \
316 bool WalkUpFromBin##NAME(BINOP_TYPE *S) { \
318 TRY_TO(VisitBin##NAME(S)); \
321 bool VisitBin##NAME(BINOP_TYPE *S) { return true; }
323 #define OPERATOR(NAME) GENERAL_BINOP_FALLBACK(NAME, BinaryOperator)
331 #define OPERATOR(NAME) \
332 GENERAL_BINOP_FALLBACK(NAME##Assign, CompoundAssignOperator)
496 #define DISPATCH_WALK(NAME, CLASS, VAR) \
498 bool (Derived::*DerivedFn)(CLASS *) = &Derived::Traverse##NAME; \
499 bool (Derived::*BaseFn)(CLASS *) = &RecursiveASTVisitor::Traverse##NAME; \
501 return getDerived().WalkUpFrom##NAME(static_cast<CLASS *>(VAR)); \
504 return getDerived().Traverse##NAME(static_cast<CLASS *>(VAR));
508 #define OPERATOR(NAME) \
509 case BO_##NAME: \
510 DISPATCH_WALK(Bin##NAME, BinaryOperator, S);
515 #define OPERATOR(NAME) \
516 case BO_##NAME##Assign: \
517 DISPATCH_WALK(Bin##NAME##Assign, CompoundAssignOperator, S);
524 #define OPERATOR(NAME) \
525 case UO_##NAME: \
526 DISPATCH_WALK(Unary##NAME, UnaryOperator, S);
549 #define DISPATCH(NAME, CLASS, VAR) \
550 return getDerived().Traverse##NAME(static_cast<CLASS *>(VAR))
557 #define DISPATCH_STMT(NAME, CLASS, VAR) DISPATCH(NAME, CLASS, VAR)
567 #define OPERATOR(NAME) \
568 case BO_##NAME: \
569 DISPATCH_STMT(Bin##NAME, BinaryOperator, S);
575 #define OPERATOR(NAME) \
576 case BO_##NAME##Assign: \
577 DISPATCH_STMT(Bin##NAME##Assign, CompoundAssignOperator, S);
585 #define OPERATOR(NAME) \
586 case UO_##NAME: \
587 DISPATCH_STMT(Unary##NAME, UnaryOperator, S);