зеркало из https://github.com/microsoft/clang-1.git
Do not use data recursion in ASTMatchFinder.
The matchers rely on the complete AST being traversed as shown by the new test cases. git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@168022 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Родитель
5d23eeaaad
Коммит
278057fd9f
|
@ -58,6 +58,9 @@ private:
|
|||
|
||||
bool shouldVisitTemplateInstantiations() const { return true; }
|
||||
bool shouldVisitImplicitCode() const { return true; }
|
||||
// Disables data recursion. We intercept Traverse* methods in the RAV, which
|
||||
// are not triggered during data recursion.
|
||||
bool shouldUseDataRecursionFor(clang::Stmt *S) const { return false; }
|
||||
|
||||
template <typename T>
|
||||
bool TraverseNode(T *Node, bool (VisitorBase::*traverse)(T*)) {
|
||||
|
@ -222,6 +225,9 @@ public:
|
|||
|
||||
bool shouldVisitTemplateInstantiations() const { return true; }
|
||||
bool shouldVisitImplicitCode() const { return true; }
|
||||
// Disables data recursion. We intercept Traverse* methods in the RAV, which
|
||||
// are not triggered during data recursion.
|
||||
bool shouldUseDataRecursionFor(clang::Stmt *S) const { return false; }
|
||||
|
||||
private:
|
||||
// Used for updating the depth during traversal.
|
||||
|
@ -471,6 +477,9 @@ public:
|
|||
|
||||
bool shouldVisitTemplateInstantiations() const { return true; }
|
||||
bool shouldVisitImplicitCode() const { return true; }
|
||||
// Disables data recursion. We intercept Traverse* methods in the RAV, which
|
||||
// are not triggered during data recursion.
|
||||
bool shouldUseDataRecursionFor(clang::Stmt *S) const { return false; }
|
||||
|
||||
private:
|
||||
// Implements a BoundNodesTree::Visitor that calls a MatchCallback with
|
||||
|
|
|
@ -947,6 +947,25 @@ TEST(Matcher, HasOperatorNameForOverloadedOperatorCall) {
|
|||
OpCallLessLess));
|
||||
}
|
||||
|
||||
TEST(Matcher, NestedOverloadedOperatorCalls) {
|
||||
EXPECT_TRUE(matchAndVerifyResultTrue(
|
||||
"class Y { }; "
|
||||
"Y& operator&&(Y& x, Y& y) { return x; }; "
|
||||
"Y a; Y b; Y c; Y d = a && b && c;",
|
||||
operatorCallExpr(hasOverloadedOperatorName("&&")).bind("x"),
|
||||
new VerifyIdIsBoundTo<CXXOperatorCallExpr>("x", 2)));
|
||||
EXPECT_TRUE(matches(
|
||||
"class Y { }; "
|
||||
"Y& operator&&(Y& x, Y& y) { return x; }; "
|
||||
"Y a; Y b; Y c; Y d = a && b && c;",
|
||||
operatorCallExpr(hasParent(operatorCallExpr()))));
|
||||
EXPECT_TRUE(matches(
|
||||
"class Y { }; "
|
||||
"Y& operator&&(Y& x, Y& y) { return x; }; "
|
||||
"Y a; Y b; Y c; Y d = a && b && c;",
|
||||
operatorCallExpr(hasDescendant(operatorCallExpr()))));
|
||||
}
|
||||
|
||||
TEST(Matcher, ThisPointerType) {
|
||||
StatementMatcher MethodOnY =
|
||||
memberCallExpr(thisPointerType(recordDecl(hasName("Y"))));
|
||||
|
|
Загрузка…
Ссылка в новой задаче