4e600751d2
This pr refactors most tests that use RAV to use DRAV instead; this also has the nice effect of testing both the RAV and DRAV implementations at the same time w/o having to duplicate all of our AST visitor tests. Some tests rely on features that DRAV doesn’t support (mainly post-order traversal), so those haven’t been migrated. At the same time, `TestVisitor` is now a DRAV, so I’ve had to introduce a new `CTRPTestVisitor` for any tests that need to use RAV directly.
83 lines
2.1 KiB
C++
83 lines
2.1 KiB
C++
//===- unittest/Tooling/RecursiveASTVisitorTests/DeductionGuide.cpp -------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "TestVisitor.h"
|
|
#include <string>
|
|
|
|
using namespace clang;
|
|
|
|
namespace {
|
|
|
|
class DeductionGuideVisitor : public ExpectedLocationVisitor {
|
|
public:
|
|
DeductionGuideVisitor(bool VisitImplicitCode) {
|
|
ShouldVisitImplicitCode = VisitImplicitCode;
|
|
ShouldVisitTemplateInstantiations = false;
|
|
}
|
|
|
|
bool VisitCXXDeductionGuideDecl(CXXDeductionGuideDecl *D) override {
|
|
std::string Storage;
|
|
llvm::raw_string_ostream Stream(Storage);
|
|
D->print(Stream);
|
|
Match(Storage, D->getLocation());
|
|
return true;
|
|
}
|
|
};
|
|
|
|
TEST(RecursiveASTVisitor, DeductionGuideNonImplicitMode) {
|
|
DeductionGuideVisitor Visitor(/*ShouldVisitImplicitCode*/ false);
|
|
// Verify that the synthezied deduction guide for alias is not visited in
|
|
// RAV's implicit mode.
|
|
Visitor.ExpectMatch("Foo(T) -> Foo<int>", 11, 1);
|
|
Visitor.DisallowMatch("Bar(T) -> Foo<int>", 14, 1);
|
|
EXPECT_TRUE(Visitor.runOver(
|
|
R"cpp(
|
|
template <typename T>
|
|
concept False = true;
|
|
|
|
template <typename T>
|
|
struct Foo {
|
|
Foo(T);
|
|
};
|
|
|
|
template<typename T> requires False<T>
|
|
Foo(T) -> Foo<int>;
|
|
|
|
template <typename U>
|
|
using Bar = Foo<U>;
|
|
Bar s(1);
|
|
)cpp",
|
|
DeductionGuideVisitor::Lang_CXX2a));
|
|
}
|
|
|
|
TEST(RecursiveASTVisitor, DeductionGuideImplicitMode) {
|
|
DeductionGuideVisitor Visitor(/*ShouldVisitImplicitCode*/ true);
|
|
Visitor.ExpectMatch("Foo(T) -> Foo<int>", 11, 1);
|
|
Visitor.ExpectMatch("Bar(T) -> Foo<int>", 14, 1);
|
|
EXPECT_TRUE(Visitor.runOver(
|
|
R"cpp(
|
|
template <typename T>
|
|
concept False = true;
|
|
|
|
template <typename T>
|
|
struct Foo {
|
|
Foo(T);
|
|
};
|
|
|
|
template<typename T> requires False<T>
|
|
Foo(T) -> Foo<int>;
|
|
|
|
template <typename U>
|
|
using Bar = Foo<U>;
|
|
Bar s(1);
|
|
)cpp",
|
|
DeductionGuideVisitor::Lang_CXX2a));
|
|
}
|
|
|
|
} // end anonymous namespace
|