2019-04-05 23:14:05 +08:00
|
|
|
//===- unittest/Tooling/TransformerTest.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
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2019-10-10 10:34:47 +08:00
|
|
|
#include "clang/Tooling/Transformer/Transformer.h"
|
2019-04-05 23:14:05 +08:00
|
|
|
#include "clang/ASTMatchers/ASTMatchers.h"
|
|
|
|
#include "clang/Tooling/Tooling.h"
|
2019-11-07 00:30:02 +08:00
|
|
|
#include "clang/Tooling/Transformer/RangeSelector.h"
|
|
|
|
#include "clang/Tooling/Transformer/Stencil.h"
|
2019-05-01 00:48:33 +08:00
|
|
|
#include "llvm/Support/Errc.h"
|
|
|
|
#include "llvm/Support/Error.h"
|
2019-04-05 23:14:05 +08:00
|
|
|
#include "gmock/gmock.h"
|
|
|
|
#include "gtest/gtest.h"
|
|
|
|
|
2019-04-19 01:52:24 +08:00
|
|
|
using namespace clang;
|
|
|
|
using namespace tooling;
|
|
|
|
using namespace ast_matchers;
|
|
|
|
namespace {
|
2019-05-01 00:48:33 +08:00
|
|
|
using ::testing::IsEmpty;
|
2019-11-07 00:30:02 +08:00
|
|
|
using transformer::cat;
|
|
|
|
using transformer::changeTo;
|
2019-10-16 09:06:46 +08:00
|
|
|
using transformer::RewriteRule;
|
2019-05-01 00:48:33 +08:00
|
|
|
|
2019-04-05 23:14:05 +08:00
|
|
|
constexpr char KHeaderContents[] = R"cc(
|
|
|
|
struct string {
|
|
|
|
string(const char*);
|
|
|
|
char* c_str();
|
|
|
|
int size();
|
|
|
|
};
|
|
|
|
int strlen(const char*);
|
|
|
|
|
|
|
|
namespace proto {
|
|
|
|
struct PCFProto {
|
|
|
|
int foo();
|
|
|
|
};
|
|
|
|
struct ProtoCommandLineFlag : PCFProto {
|
|
|
|
PCFProto& GetProto();
|
|
|
|
};
|
|
|
|
} // namespace proto
|
2019-04-19 01:52:24 +08:00
|
|
|
class Logger {};
|
|
|
|
void operator<<(Logger& l, string msg);
|
|
|
|
Logger& log(int level);
|
2019-04-05 23:14:05 +08:00
|
|
|
)cc";
|
|
|
|
|
|
|
|
static ast_matchers::internal::Matcher<clang::QualType>
|
|
|
|
isOrPointsTo(const clang::ast_matchers::DeclarationMatcher &TypeMatcher) {
|
|
|
|
return anyOf(hasDeclaration(TypeMatcher), pointsTo(TypeMatcher));
|
|
|
|
}
|
|
|
|
|
|
|
|
static std::string format(StringRef Code) {
|
|
|
|
const std::vector<Range> Ranges(1, Range(0, Code.size()));
|
|
|
|
auto Style = format::getLLVMStyle();
|
|
|
|
const auto Replacements = format::reformat(Style, Code, Ranges);
|
|
|
|
auto Formatted = applyAllReplacements(Code, Replacements);
|
|
|
|
if (!Formatted) {
|
|
|
|
ADD_FAILURE() << "Could not format code: "
|
|
|
|
<< llvm::toString(Formatted.takeError());
|
|
|
|
return std::string();
|
|
|
|
}
|
|
|
|
return *Formatted;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void compareSnippets(StringRef Expected,
|
|
|
|
const llvm::Optional<std::string> &MaybeActual) {
|
|
|
|
ASSERT_TRUE(MaybeActual) << "Rewrite failed. Expecting: " << Expected;
|
|
|
|
auto Actual = *MaybeActual;
|
|
|
|
std::string HL = "#include \"header.h\"\n";
|
|
|
|
auto I = Actual.find(HL);
|
|
|
|
if (I != std::string::npos)
|
|
|
|
Actual.erase(I, HL.size());
|
|
|
|
EXPECT_EQ(format(Expected), format(Actual));
|
|
|
|
}
|
|
|
|
|
|
|
|
// FIXME: consider separating this class into its own file(s).
|
|
|
|
class ClangRefactoringTestBase : public testing::Test {
|
|
|
|
protected:
|
|
|
|
void appendToHeader(StringRef S) { FileContents[0].second += S; }
|
|
|
|
|
|
|
|
void addFile(StringRef Filename, StringRef Content) {
|
2020-01-29 17:30:36 +08:00
|
|
|
FileContents.emplace_back(std::string(Filename), std::string(Content));
|
2019-04-05 23:14:05 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
llvm::Optional<std::string> rewrite(StringRef Input) {
|
|
|
|
std::string Code = ("#include \"header.h\"\n" + Input).str();
|
|
|
|
auto Factory = newFrontendActionFactory(&MatchFinder);
|
|
|
|
if (!runToolOnCodeWithArgs(
|
|
|
|
Factory->create(), Code, std::vector<std::string>(), "input.cc",
|
|
|
|
"clang-tool", std::make_shared<PCHContainerOperations>(),
|
|
|
|
FileContents)) {
|
2019-05-01 00:48:33 +08:00
|
|
|
llvm::errs() << "Running tool failed.\n";
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
if (ErrorCount != 0) {
|
|
|
|
llvm::errs() << "Generating changes failed.\n";
|
2019-04-05 23:14:05 +08:00
|
|
|
return None;
|
|
|
|
}
|
2019-05-01 00:48:33 +08:00
|
|
|
auto ChangedCode =
|
2019-04-05 23:14:05 +08:00
|
|
|
applyAtomicChanges("input.cc", Code, Changes, ApplyChangesSpec());
|
2019-05-01 00:48:33 +08:00
|
|
|
if (!ChangedCode) {
|
|
|
|
llvm::errs() << "Applying changes failed: "
|
|
|
|
<< llvm::toString(ChangedCode.takeError()) << "\n";
|
2019-04-05 23:14:05 +08:00
|
|
|
return None;
|
|
|
|
}
|
2019-05-01 00:48:33 +08:00
|
|
|
return *ChangedCode;
|
|
|
|
}
|
|
|
|
|
|
|
|
Transformer::ChangeConsumer consumer() {
|
|
|
|
return [this](Expected<AtomicChange> C) {
|
|
|
|
if (C) {
|
|
|
|
Changes.push_back(std::move(*C));
|
|
|
|
} else {
|
|
|
|
consumeError(C.takeError());
|
|
|
|
++ErrorCount;
|
|
|
|
}
|
|
|
|
};
|
2019-04-05 23:14:05 +08:00
|
|
|
}
|
|
|
|
|
2019-05-17 22:23:33 +08:00
|
|
|
template <typename R>
|
|
|
|
void testRule(R Rule, StringRef Input, StringRef Expected) {
|
2019-05-01 00:48:33 +08:00
|
|
|
Transformer T(std::move(Rule), consumer());
|
2019-04-05 23:14:05 +08:00
|
|
|
T.registerMatchers(&MatchFinder);
|
|
|
|
compareSnippets(Expected, rewrite(Input));
|
|
|
|
}
|
|
|
|
|
|
|
|
clang::ast_matchers::MatchFinder MatchFinder;
|
2019-05-01 00:48:33 +08:00
|
|
|
// Records whether any errors occurred in individual changes.
|
|
|
|
int ErrorCount = 0;
|
2019-04-05 23:14:05 +08:00
|
|
|
AtomicChanges Changes;
|
|
|
|
|
|
|
|
private:
|
|
|
|
FileContentMappings FileContents = {{"header.h", ""}};
|
|
|
|
};
|
|
|
|
|
|
|
|
class TransformerTest : public ClangRefactoringTestBase {
|
|
|
|
protected:
|
|
|
|
TransformerTest() { appendToHeader(KHeaderContents); }
|
|
|
|
};
|
|
|
|
|
2019-07-19 01:44:54 +08:00
|
|
|
// Given string s, change strlen($s.c_str()) to REPLACED.
|
2019-04-05 23:14:05 +08:00
|
|
|
static RewriteRule ruleStrlenSize() {
|
|
|
|
StringRef StringExpr = "strexpr";
|
|
|
|
auto StringType = namedDecl(hasAnyName("::basic_string", "::string"));
|
2019-04-19 01:52:24 +08:00
|
|
|
auto R = makeRule(
|
|
|
|
callExpr(callee(functionDecl(hasName("strlen"))),
|
|
|
|
hasArgument(0, cxxMemberCallExpr(
|
|
|
|
on(expr(hasType(isOrPointsTo(StringType)))
|
|
|
|
.bind(StringExpr)),
|
|
|
|
callee(cxxMethodDecl(hasName("c_str")))))),
|
2019-11-04 23:02:35 +08:00
|
|
|
changeTo(cat("REPLACED")), cat("Use size() method directly on string."));
|
2019-04-19 01:52:24 +08:00
|
|
|
return R;
|
2019-04-05 23:14:05 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(TransformerTest, StrlenSize) {
|
|
|
|
std::string Input = "int f(string s) { return strlen(s.c_str()); }";
|
|
|
|
std::string Expected = "int f(string s) { return REPLACED; }";
|
|
|
|
testRule(ruleStrlenSize(), Input, Expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that no change is applied when a match is not expected.
|
|
|
|
TEST_F(TransformerTest, NoMatch) {
|
|
|
|
std::string Input = "int f(string s) { return s.size(); }";
|
|
|
|
testRule(ruleStrlenSize(), Input, Input);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests replacing an expression.
|
|
|
|
TEST_F(TransformerTest, Flag) {
|
|
|
|
StringRef Flag = "flag";
|
2019-04-19 01:52:24 +08:00
|
|
|
RewriteRule Rule = makeRule(
|
|
|
|
cxxMemberCallExpr(on(expr(hasType(cxxRecordDecl(
|
|
|
|
hasName("proto::ProtoCommandLineFlag"))))
|
|
|
|
.bind(Flag)),
|
|
|
|
unless(callee(cxxMethodDecl(hasName("GetProto"))))),
|
2020-01-29 03:23:46 +08:00
|
|
|
changeTo(node(std::string(Flag)), cat("EXPR")));
|
2019-04-05 23:14:05 +08:00
|
|
|
|
|
|
|
std::string Input = R"cc(
|
|
|
|
proto::ProtoCommandLineFlag flag;
|
|
|
|
int x = flag.foo();
|
|
|
|
int y = flag.GetProto().foo();
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
proto::ProtoCommandLineFlag flag;
|
|
|
|
int x = EXPR.foo();
|
|
|
|
int y = flag.GetProto().foo();
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
testRule(std::move(Rule), Input, Expected);
|
|
|
|
}
|
|
|
|
|
2019-07-02 21:11:04 +08:00
|
|
|
TEST_F(TransformerTest, AddIncludeQuoted) {
|
|
|
|
RewriteRule Rule = makeRule(callExpr(callee(functionDecl(hasName("f")))),
|
2019-11-04 23:02:35 +08:00
|
|
|
changeTo(cat("other()")));
|
2019-07-02 21:11:04 +08:00
|
|
|
addInclude(Rule, "clang/OtherLib.h");
|
|
|
|
|
|
|
|
std::string Input = R"cc(
|
|
|
|
int f(int x);
|
|
|
|
int h(int x) { return f(x); }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(#include "clang/OtherLib.h"
|
|
|
|
|
|
|
|
int f(int x);
|
|
|
|
int h(int x) { return other(); }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
testRule(Rule, Input, Expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(TransformerTest, AddIncludeAngled) {
|
|
|
|
RewriteRule Rule = makeRule(callExpr(callee(functionDecl(hasName("f")))),
|
2019-11-04 23:02:35 +08:00
|
|
|
changeTo(cat("other()")));
|
2019-10-16 09:06:46 +08:00
|
|
|
addInclude(Rule, "clang/OtherLib.h", transformer::IncludeFormat::Angled);
|
2019-07-02 21:11:04 +08:00
|
|
|
|
|
|
|
std::string Input = R"cc(
|
|
|
|
int f(int x);
|
|
|
|
int h(int x) { return f(x); }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(#include <clang/OtherLib.h>
|
|
|
|
|
|
|
|
int f(int x);
|
|
|
|
int h(int x) { return other(); }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
testRule(Rule, Input, Expected);
|
|
|
|
}
|
|
|
|
|
2019-04-05 23:14:05 +08:00
|
|
|
TEST_F(TransformerTest, NodePartNameNamedDecl) {
|
|
|
|
StringRef Fun = "fun";
|
2019-05-22 22:48:19 +08:00
|
|
|
RewriteRule Rule = makeRule(functionDecl(hasName("bad")).bind(Fun),
|
2020-01-29 03:23:46 +08:00
|
|
|
changeTo(name(std::string(Fun)), cat("good")));
|
2019-04-05 23:14:05 +08:00
|
|
|
|
|
|
|
std::string Input = R"cc(
|
|
|
|
int bad(int x);
|
|
|
|
int bad(int x) { return x * x; }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
int good(int x);
|
|
|
|
int good(int x) { return x * x; }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
testRule(Rule, Input, Expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(TransformerTest, NodePartNameDeclRef) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
template <typename T>
|
|
|
|
T bad(T x) {
|
|
|
|
return x;
|
|
|
|
}
|
|
|
|
int neutral(int x) { return bad<int>(x) * x; }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
template <typename T>
|
|
|
|
T bad(T x) {
|
|
|
|
return x;
|
|
|
|
}
|
|
|
|
int neutral(int x) { return good<int>(x) * x; }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
StringRef Ref = "ref";
|
2019-04-19 01:52:24 +08:00
|
|
|
testRule(makeRule(declRefExpr(to(functionDecl(hasName("bad")))).bind(Ref),
|
2020-01-29 03:23:46 +08:00
|
|
|
changeTo(name(std::string(Ref)), cat("good"))),
|
2019-04-05 23:14:05 +08:00
|
|
|
Input, Expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(TransformerTest, NodePartNameDeclRefFailure) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
struct Y {
|
|
|
|
int operator*();
|
|
|
|
};
|
|
|
|
int neutral(int x) {
|
|
|
|
Y y;
|
|
|
|
int (Y::*ptr)() = &Y::operator*;
|
|
|
|
return *y + x;
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
StringRef Ref = "ref";
|
2019-05-01 01:24:36 +08:00
|
|
|
Transformer T(makeRule(declRefExpr(to(functionDecl())).bind(Ref),
|
2020-01-29 03:23:46 +08:00
|
|
|
changeTo(name(std::string(Ref)), cat("good"))),
|
2019-05-01 01:24:36 +08:00
|
|
|
consumer());
|
|
|
|
T.registerMatchers(&MatchFinder);
|
|
|
|
EXPECT_FALSE(rewrite(Input));
|
2019-04-05 23:14:05 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(TransformerTest, NodePartMember) {
|
|
|
|
StringRef E = "expr";
|
2019-04-19 01:52:24 +08:00
|
|
|
RewriteRule Rule = makeRule(memberExpr(member(hasName("bad"))).bind(E),
|
2020-01-29 03:23:46 +08:00
|
|
|
changeTo(member(std::string(E)), cat("good")));
|
2019-04-05 23:14:05 +08:00
|
|
|
|
|
|
|
std::string Input = R"cc(
|
|
|
|
struct S {
|
|
|
|
int bad;
|
|
|
|
};
|
|
|
|
int g() {
|
|
|
|
S s;
|
|
|
|
return s.bad;
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
struct S {
|
|
|
|
int bad;
|
|
|
|
};
|
|
|
|
int g() {
|
|
|
|
S s;
|
|
|
|
return s.good;
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
testRule(Rule, Input, Expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(TransformerTest, NodePartMemberQualified) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
struct S {
|
|
|
|
int bad;
|
|
|
|
int good;
|
|
|
|
};
|
|
|
|
struct T : public S {
|
|
|
|
int bad;
|
|
|
|
};
|
|
|
|
int g() {
|
|
|
|
T t;
|
|
|
|
return t.S::bad;
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
struct S {
|
|
|
|
int bad;
|
|
|
|
int good;
|
|
|
|
};
|
|
|
|
struct T : public S {
|
|
|
|
int bad;
|
|
|
|
};
|
|
|
|
int g() {
|
|
|
|
T t;
|
|
|
|
return t.S::good;
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
StringRef E = "expr";
|
2020-01-29 03:23:46 +08:00
|
|
|
testRule(makeRule(memberExpr().bind(E),
|
|
|
|
changeTo(member(std::string(E)), cat("good"))),
|
2019-04-05 23:14:05 +08:00
|
|
|
Input, Expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(TransformerTest, NodePartMemberMultiToken) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
struct Y {
|
|
|
|
int operator*();
|
|
|
|
int good();
|
|
|
|
template <typename T> void foo(T t);
|
|
|
|
};
|
|
|
|
int neutral(int x) {
|
|
|
|
Y y;
|
|
|
|
y.template foo<int>(3);
|
|
|
|
return y.operator *();
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
struct Y {
|
|
|
|
int operator*();
|
|
|
|
int good();
|
|
|
|
template <typename T> void foo(T t);
|
|
|
|
};
|
|
|
|
int neutral(int x) {
|
|
|
|
Y y;
|
|
|
|
y.template good<int>(3);
|
|
|
|
return y.good();
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
StringRef MemExpr = "member";
|
2019-04-19 01:52:24 +08:00
|
|
|
testRule(makeRule(memberExpr().bind(MemExpr),
|
2020-01-29 03:23:46 +08:00
|
|
|
changeTo(member(std::string(MemExpr)), cat("good"))),
|
2019-04-19 01:52:24 +08:00
|
|
|
Input, Expected);
|
|
|
|
}
|
|
|
|
|
2019-06-06 22:20:29 +08:00
|
|
|
TEST_F(TransformerTest, InsertBeforeEdit) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
int f() {
|
|
|
|
return 7;
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
int f() {
|
|
|
|
int y = 3;
|
|
|
|
return 7;
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
StringRef Ret = "return";
|
2020-01-29 03:23:46 +08:00
|
|
|
testRule(
|
|
|
|
makeRule(returnStmt().bind(Ret),
|
|
|
|
insertBefore(statement(std::string(Ret)), cat("int y = 3;"))),
|
|
|
|
Input, Expected);
|
2019-06-06 22:20:29 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(TransformerTest, InsertAfterEdit) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
int f() {
|
|
|
|
int x = 5;
|
|
|
|
return 7;
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
int f() {
|
|
|
|
int x = 5;
|
|
|
|
int y = 3;
|
|
|
|
return 7;
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
StringRef Decl = "decl";
|
2020-01-29 03:23:46 +08:00
|
|
|
testRule(
|
|
|
|
makeRule(declStmt().bind(Decl),
|
|
|
|
insertAfter(statement(std::string(Decl)), cat("int y = 3;"))),
|
|
|
|
Input, Expected);
|
2019-06-06 22:20:29 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(TransformerTest, RemoveEdit) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
int f() {
|
|
|
|
int x = 5;
|
|
|
|
return 7;
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
int f() {
|
|
|
|
return 7;
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
StringRef Decl = "decl";
|
2020-01-29 03:23:46 +08:00
|
|
|
testRule(
|
|
|
|
makeRule(declStmt().bind(Decl), remove(statement(std::string(Decl)))),
|
|
|
|
Input, Expected);
|
2019-06-06 22:20:29 +08:00
|
|
|
}
|
|
|
|
|
2019-04-19 01:52:24 +08:00
|
|
|
TEST_F(TransformerTest, MultiChange) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
void foo() {
|
|
|
|
if (10 > 1.0)
|
|
|
|
log(1) << "oh no!";
|
|
|
|
else
|
|
|
|
log(0) << "ok";
|
|
|
|
}
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"(
|
|
|
|
void foo() {
|
|
|
|
if (true) { /* then */ }
|
|
|
|
else { /* else */ }
|
|
|
|
}
|
|
|
|
)";
|
|
|
|
|
|
|
|
StringRef C = "C", T = "T", E = "E";
|
2020-01-29 03:23:46 +08:00
|
|
|
testRule(
|
|
|
|
makeRule(ifStmt(hasCondition(expr().bind(C)), hasThen(stmt().bind(T)),
|
|
|
|
hasElse(stmt().bind(E))),
|
|
|
|
{changeTo(node(std::string(C)), cat("true")),
|
|
|
|
changeTo(statement(std::string(T)), cat("{ /* then */ }")),
|
|
|
|
changeTo(statement(std::string(E)), cat("{ /* else */ }"))}),
|
|
|
|
Input, Expected);
|
2019-04-05 23:14:05 +08:00
|
|
|
}
|
|
|
|
|
2019-05-17 22:23:33 +08:00
|
|
|
TEST_F(TransformerTest, OrderedRuleUnrelated) {
|
|
|
|
StringRef Flag = "flag";
|
|
|
|
RewriteRule FlagRule = makeRule(
|
|
|
|
cxxMemberCallExpr(on(expr(hasType(cxxRecordDecl(
|
|
|
|
hasName("proto::ProtoCommandLineFlag"))))
|
|
|
|
.bind(Flag)),
|
|
|
|
unless(callee(cxxMethodDecl(hasName("GetProto"))))),
|
2020-01-29 03:23:46 +08:00
|
|
|
changeTo(node(std::string(Flag)), cat("PROTO")));
|
2019-05-17 22:23:33 +08:00
|
|
|
|
|
|
|
std::string Input = R"cc(
|
|
|
|
proto::ProtoCommandLineFlag flag;
|
|
|
|
int x = flag.foo();
|
|
|
|
int y = flag.GetProto().foo();
|
|
|
|
int f(string s) { return strlen(s.c_str()); }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
proto::ProtoCommandLineFlag flag;
|
|
|
|
int x = PROTO.foo();
|
|
|
|
int y = flag.GetProto().foo();
|
|
|
|
int f(string s) { return REPLACED; }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
testRule(applyFirst({ruleStrlenSize(), FlagRule}), Input, Expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(TransformerTest, OrderedRuleRelated) {
|
|
|
|
std::string Input = R"cc(
|
2019-08-13 20:31:29 +08:00
|
|
|
void f1();
|
|
|
|
void f2();
|
|
|
|
void call_f1() { f1(); }
|
|
|
|
void call_f2() { f2(); }
|
2019-05-17 22:23:33 +08:00
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
2019-08-13 20:31:29 +08:00
|
|
|
void f1();
|
|
|
|
void f2();
|
|
|
|
void call_f1() { REPLACE_F1; }
|
|
|
|
void call_f2() { REPLACE_F1_OR_F2; }
|
2019-05-17 22:23:33 +08:00
|
|
|
)cc";
|
|
|
|
|
2019-08-13 20:31:29 +08:00
|
|
|
RewriteRule ReplaceF1 =
|
|
|
|
makeRule(callExpr(callee(functionDecl(hasName("f1")))),
|
2019-11-04 23:02:35 +08:00
|
|
|
changeTo(cat("REPLACE_F1")));
|
2019-08-13 20:31:29 +08:00
|
|
|
RewriteRule ReplaceF1OrF2 =
|
|
|
|
makeRule(callExpr(callee(functionDecl(hasAnyName("f1", "f2")))),
|
2019-11-04 23:02:35 +08:00
|
|
|
changeTo(cat("REPLACE_F1_OR_F2")));
|
2019-08-13 20:31:29 +08:00
|
|
|
testRule(applyFirst({ReplaceF1, ReplaceF1OrF2}), Input, Expected);
|
2019-05-17 22:23:33 +08:00
|
|
|
}
|
|
|
|
|
2019-08-13 20:31:29 +08:00
|
|
|
// Change the order of the rules to get a different result. When `ReplaceF1OrF2`
|
|
|
|
// comes first, it applies for both uses, so `ReplaceF1` never applies.
|
2019-05-17 22:23:33 +08:00
|
|
|
TEST_F(TransformerTest, OrderedRuleRelatedSwapped) {
|
|
|
|
std::string Input = R"cc(
|
2019-08-13 20:31:29 +08:00
|
|
|
void f1();
|
|
|
|
void f2();
|
|
|
|
void call_f1() { f1(); }
|
|
|
|
void call_f2() { f2(); }
|
2019-05-17 22:23:33 +08:00
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
2019-08-13 20:31:29 +08:00
|
|
|
void f1();
|
|
|
|
void f2();
|
|
|
|
void call_f1() { REPLACE_F1_OR_F2; }
|
|
|
|
void call_f2() { REPLACE_F1_OR_F2; }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
RewriteRule ReplaceF1 =
|
|
|
|
makeRule(callExpr(callee(functionDecl(hasName("f1")))),
|
2019-11-04 23:02:35 +08:00
|
|
|
changeTo(cat("REPLACE_F1")));
|
2019-08-13 20:31:29 +08:00
|
|
|
RewriteRule ReplaceF1OrF2 =
|
|
|
|
makeRule(callExpr(callee(functionDecl(hasAnyName("f1", "f2")))),
|
2019-11-04 23:02:35 +08:00
|
|
|
changeTo(cat("REPLACE_F1_OR_F2")));
|
2019-08-13 20:31:29 +08:00
|
|
|
testRule(applyFirst({ReplaceF1OrF2, ReplaceF1}), Input, Expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Verify that a set of rules whose matchers have different base kinds works
|
|
|
|
// properly, including that `applyFirst` produces multiple matchers. We test
|
|
|
|
// two different kinds of rules: Expr and Decl. We place the Decl rule in the
|
|
|
|
// middle to test that `buildMatchers` works even when the kinds aren't grouped
|
|
|
|
// together.
|
|
|
|
TEST_F(TransformerTest, OrderedRuleMultipleKinds) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
void f1();
|
|
|
|
void f2();
|
|
|
|
void call_f1() { f1(); }
|
|
|
|
void call_f2() { f2(); }
|
2019-05-17 22:23:33 +08:00
|
|
|
)cc";
|
2019-08-13 20:31:29 +08:00
|
|
|
std::string Expected = R"cc(
|
|
|
|
void f1();
|
|
|
|
void DECL_RULE();
|
|
|
|
void call_f1() { REPLACE_F1; }
|
|
|
|
void call_f2() { REPLACE_F1_OR_F2; }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
RewriteRule ReplaceF1 =
|
|
|
|
makeRule(callExpr(callee(functionDecl(hasName("f1")))),
|
2019-11-04 23:02:35 +08:00
|
|
|
changeTo(cat("REPLACE_F1")));
|
2019-08-13 20:31:29 +08:00
|
|
|
RewriteRule ReplaceF1OrF2 =
|
|
|
|
makeRule(callExpr(callee(functionDecl(hasAnyName("f1", "f2")))),
|
2019-11-04 23:02:35 +08:00
|
|
|
changeTo(cat("REPLACE_F1_OR_F2")));
|
2019-08-13 20:31:29 +08:00
|
|
|
RewriteRule DeclRule = makeRule(functionDecl(hasName("f2")).bind("fun"),
|
2019-11-04 23:02:35 +08:00
|
|
|
changeTo(name("fun"), cat("DECL_RULE")));
|
2019-08-13 20:31:29 +08:00
|
|
|
|
|
|
|
RewriteRule Rule = applyFirst({ReplaceF1, DeclRule, ReplaceF1OrF2});
|
2019-10-16 09:06:46 +08:00
|
|
|
EXPECT_EQ(transformer::detail::buildMatchers(Rule).size(), 2UL);
|
2019-08-13 20:31:29 +08:00
|
|
|
testRule(Rule, Input, Expected);
|
2019-05-17 22:23:33 +08:00
|
|
|
}
|
|
|
|
|
2019-04-05 23:14:05 +08:00
|
|
|
//
|
|
|
|
// Negative tests (where we expect no transformation to occur).
|
|
|
|
//
|
|
|
|
|
2019-05-01 00:48:33 +08:00
|
|
|
// Tests for a conflict in edits from a single match for a rule.
|
|
|
|
TEST_F(TransformerTest, TextGeneratorFailure) {
|
|
|
|
std::string Input = "int conflictOneRule() { return 3 + 7; }";
|
|
|
|
// Try to change the whole binary-operator expression AND one its operands:
|
|
|
|
StringRef O = "O";
|
2019-11-04 21:30:18 +08:00
|
|
|
class AlwaysFail : public transformer::MatchComputation<std::string> {
|
|
|
|
llvm::Error eval(const ast_matchers::MatchFinder::MatchResult &,
|
|
|
|
std::string *) const override {
|
|
|
|
return llvm::createStringError(llvm::errc::invalid_argument, "ERROR");
|
|
|
|
}
|
|
|
|
std::string toString() const override { return "AlwaysFail"; }
|
2019-05-01 00:48:33 +08:00
|
|
|
};
|
2020-01-29 03:23:46 +08:00
|
|
|
Transformer T(
|
|
|
|
makeRule(binaryOperator().bind(O),
|
|
|
|
changeTo(node(std::string(O)), std::make_shared<AlwaysFail>())),
|
|
|
|
consumer());
|
2019-05-01 00:48:33 +08:00
|
|
|
T.registerMatchers(&MatchFinder);
|
|
|
|
EXPECT_FALSE(rewrite(Input));
|
|
|
|
EXPECT_THAT(Changes, IsEmpty());
|
|
|
|
EXPECT_EQ(ErrorCount, 1);
|
|
|
|
}
|
|
|
|
|
2019-04-19 01:52:24 +08:00
|
|
|
// Tests for a conflict in edits from a single match for a rule.
|
|
|
|
TEST_F(TransformerTest, OverlappingEditsInRule) {
|
|
|
|
std::string Input = "int conflictOneRule() { return 3 + 7; }";
|
|
|
|
// Try to change the whole binary-operator expression AND one its operands:
|
|
|
|
StringRef O = "O", L = "L";
|
2019-05-22 22:48:19 +08:00
|
|
|
Transformer T(makeRule(binaryOperator(hasLHS(expr().bind(L))).bind(O),
|
2020-01-29 03:23:46 +08:00
|
|
|
{changeTo(node(std::string(O)), cat("DELETE_OP")),
|
|
|
|
changeTo(node(std::string(L)), cat("DELETE_LHS"))}),
|
2019-05-22 22:48:19 +08:00
|
|
|
consumer());
|
2019-04-19 01:52:24 +08:00
|
|
|
T.registerMatchers(&MatchFinder);
|
2019-05-01 00:48:33 +08:00
|
|
|
EXPECT_FALSE(rewrite(Input));
|
|
|
|
EXPECT_THAT(Changes, IsEmpty());
|
|
|
|
EXPECT_EQ(ErrorCount, 1);
|
2019-04-19 01:52:24 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Tests for a conflict in edits across multiple matches (of the same rule).
|
|
|
|
TEST_F(TransformerTest, OverlappingEditsMultipleMatches) {
|
|
|
|
std::string Input = "int conflictOneRule() { return -7; }";
|
|
|
|
// Try to change the whole binary-operator expression AND one its operands:
|
|
|
|
StringRef E = "E";
|
2020-01-29 03:23:46 +08:00
|
|
|
Transformer T(makeRule(expr().bind(E),
|
|
|
|
changeTo(node(std::string(E)), cat("DELETE_EXPR"))),
|
2019-05-01 00:48:33 +08:00
|
|
|
consumer());
|
2019-04-19 01:52:24 +08:00
|
|
|
T.registerMatchers(&MatchFinder);
|
|
|
|
// The rewrite process fails because the changes conflict with each other...
|
|
|
|
EXPECT_FALSE(rewrite(Input));
|
2019-05-01 00:48:33 +08:00
|
|
|
// ... but two changes were produced.
|
|
|
|
EXPECT_EQ(Changes.size(), 2u);
|
|
|
|
EXPECT_EQ(ErrorCount, 0);
|
2019-04-19 01:52:24 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(TransformerTest, ErrorOccurredMatchSkipped) {
|
|
|
|
// Syntax error in the function body:
|
|
|
|
std::string Input = "void errorOccurred() { 3 }";
|
2019-05-01 00:48:33 +08:00
|
|
|
Transformer T(makeRule(functionDecl(hasName("errorOccurred")),
|
2019-11-04 23:02:35 +08:00
|
|
|
changeTo(cat("DELETED;"))),
|
2019-05-01 00:48:33 +08:00
|
|
|
consumer());
|
2019-04-19 01:52:24 +08:00
|
|
|
T.registerMatchers(&MatchFinder);
|
|
|
|
// The rewrite process itself fails...
|
|
|
|
EXPECT_FALSE(rewrite(Input));
|
2019-05-01 00:48:33 +08:00
|
|
|
// ... and no changes or errors are produced in the process.
|
|
|
|
EXPECT_THAT(Changes, IsEmpty());
|
|
|
|
EXPECT_EQ(ErrorCount, 0);
|
2019-04-19 01:52:24 +08:00
|
|
|
}
|
|
|
|
|
2019-07-19 01:44:54 +08:00
|
|
|
// Transformation of macro source text when the change encompasses the entirety
|
|
|
|
// of the expanded text.
|
|
|
|
TEST_F(TransformerTest, SimpleMacro) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
#define ZERO 0
|
|
|
|
int f(string s) { return ZERO; }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
#define ZERO 0
|
|
|
|
int f(string s) { return 999; }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
StringRef zero = "zero";
|
|
|
|
RewriteRule R = makeRule(integerLiteral(equals(0)).bind(zero),
|
2020-01-29 03:23:46 +08:00
|
|
|
changeTo(node(std::string(zero)), cat("999")));
|
2019-07-19 01:44:54 +08:00
|
|
|
testRule(R, Input, Expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Transformation of macro source text when the change encompasses the entirety
|
|
|
|
// of the expanded text, for the case of function-style macros.
|
|
|
|
TEST_F(TransformerTest, FunctionMacro) {
|
2019-04-05 23:14:05 +08:00
|
|
|
std::string Input = R"cc(
|
|
|
|
#define MACRO(str) strlen((str).c_str())
|
2019-07-19 01:44:54 +08:00
|
|
|
int f(string s) { return MACRO(s); }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
#define MACRO(str) strlen((str).c_str())
|
|
|
|
int f(string s) { return REPLACED; }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
testRule(ruleStrlenSize(), Input, Expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that expressions in macro arguments can be rewritten.
|
|
|
|
TEST_F(TransformerTest, MacroArg) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
#define PLUS(e) e + 1
|
|
|
|
int f(string s) { return PLUS(strlen(s.c_str())); }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
#define PLUS(e) e + 1
|
|
|
|
int f(string s) { return PLUS(REPLACED); }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
testRule(ruleStrlenSize(), Input, Expected);
|
2019-04-05 23:14:05 +08:00
|
|
|
}
|
|
|
|
|
2019-07-19 01:44:54 +08:00
|
|
|
// Tests that expressions in macro arguments can be rewritten, even when the
|
|
|
|
// macro call occurs inside another macro's definition.
|
|
|
|
TEST_F(TransformerTest, MacroArgInMacroDef) {
|
2019-04-05 23:14:05 +08:00
|
|
|
std::string Input = R"cc(
|
|
|
|
#define NESTED(e) e
|
|
|
|
#define MACRO(str) NESTED(strlen((str).c_str()))
|
2019-07-19 01:44:54 +08:00
|
|
|
int f(string s) { return MACRO(s); }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
#define NESTED(e) e
|
|
|
|
#define MACRO(str) NESTED(strlen((str).c_str()))
|
|
|
|
int f(string s) { return REPLACED; }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
testRule(ruleStrlenSize(), Input, Expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests the corner case of the identity macro, specifically that it is
|
|
|
|
// discarded in the rewrite rather than preserved (like PLUS is preserved in the
|
|
|
|
// previous test). This behavior is of dubious value (and marked with a FIXME
|
|
|
|
// in the code), but we test it to verify (and demonstrate) how this case is
|
|
|
|
// handled.
|
|
|
|
TEST_F(TransformerTest, IdentityMacro) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
#define ID(e) e
|
|
|
|
int f(string s) { return ID(strlen(s.c_str())); }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
#define ID(e) e
|
|
|
|
int f(string s) { return REPLACED; }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
testRule(ruleStrlenSize(), Input, Expected);
|
|
|
|
}
|
|
|
|
|
2019-09-27 23:26:04 +08:00
|
|
|
// Tests that two changes in a single macro expansion do not lead to conflicts
|
|
|
|
// in applying the changes.
|
|
|
|
TEST_F(TransformerTest, TwoChangesInOneMacroExpansion) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
#define PLUS(a,b) (a) + (b)
|
|
|
|
int f() { return PLUS(3, 4); }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
#define PLUS(a,b) (a) + (b)
|
|
|
|
int f() { return PLUS(LIT, LIT); }
|
|
|
|
)cc";
|
|
|
|
|
2019-11-04 23:02:35 +08:00
|
|
|
testRule(makeRule(integerLiteral(), changeTo(cat("LIT"))), Input, Expected);
|
2019-09-27 23:26:04 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Tests case where the rule's match spans both source from the macro and its
|
|
|
|
// arg, with the begin location (the "anchor") being the arg.
|
|
|
|
TEST_F(TransformerTest, MatchSpansMacroTextButChangeDoesNot) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
#define PLUS_ONE(a) a + 1
|
|
|
|
int f() { return PLUS_ONE(3); }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
#define PLUS_ONE(a) a + 1
|
|
|
|
int f() { return PLUS_ONE(LIT); }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
StringRef E = "expr";
|
|
|
|
testRule(makeRule(binaryOperator(hasLHS(expr().bind(E))),
|
2020-01-29 03:23:46 +08:00
|
|
|
changeTo(node(std::string(E)), cat("LIT"))),
|
2019-09-27 23:26:04 +08:00
|
|
|
Input, Expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests case where the rule's match spans both source from the macro and its
|
|
|
|
// arg, with the begin location (the "anchor") being inside the macro.
|
|
|
|
TEST_F(TransformerTest, MatchSpansMacroTextButChangeDoesNotAnchoredInMacro) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
#define PLUS_ONE(a) 1 + a
|
|
|
|
int f() { return PLUS_ONE(3); }
|
|
|
|
)cc";
|
|
|
|
std::string Expected = R"cc(
|
|
|
|
#define PLUS_ONE(a) 1 + a
|
|
|
|
int f() { return PLUS_ONE(LIT); }
|
|
|
|
)cc";
|
|
|
|
|
|
|
|
StringRef E = "expr";
|
|
|
|
testRule(makeRule(binaryOperator(hasRHS(expr().bind(E))),
|
2020-01-29 03:23:46 +08:00
|
|
|
changeTo(node(std::string(E)), cat("LIT"))),
|
2019-09-27 23:26:04 +08:00
|
|
|
Input, Expected);
|
|
|
|
}
|
|
|
|
|
2019-07-19 01:44:54 +08:00
|
|
|
// No rewrite is applied when the changed text does not encompass the entirety
|
|
|
|
// of the expanded text. That is, the edit would have to be applied to the
|
|
|
|
// macro's definition to succeed and editing the expansion point would not
|
|
|
|
// suffice.
|
|
|
|
TEST_F(TransformerTest, NoPartialRewriteOMacroExpansion) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
#define ZERO_PLUS 0 + 3
|
|
|
|
int f(string s) { return ZERO_PLUS; })cc";
|
|
|
|
|
|
|
|
StringRef zero = "zero";
|
|
|
|
RewriteRule R = makeRule(integerLiteral(equals(0)).bind(zero),
|
2020-01-29 03:23:46 +08:00
|
|
|
changeTo(node(std::string(zero)), cat("0")));
|
2019-07-19 01:44:54 +08:00
|
|
|
testRule(R, Input, Input);
|
|
|
|
}
|
|
|
|
|
|
|
|
// This test handles the corner case where a macro expands within another macro
|
|
|
|
// to matching code, but that code is an argument to the nested macro call. A
|
|
|
|
// simple check of isMacroArgExpansion() vs. isMacroBodyExpansion() will get
|
|
|
|
// this wrong, and transform the code.
|
|
|
|
TEST_F(TransformerTest, NoPartialRewriteOfMacroExpansionForMacroArgs) {
|
|
|
|
std::string Input = R"cc(
|
|
|
|
#define NESTED(e) e
|
|
|
|
#define MACRO(str) 1 + NESTED(strlen((str).c_str()))
|
|
|
|
int f(string s) { return MACRO(s); }
|
|
|
|
)cc";
|
|
|
|
|
2019-04-05 23:14:05 +08:00
|
|
|
testRule(ruleStrlenSize(), Input, Input);
|
|
|
|
}
|
2019-08-13 20:31:29 +08:00
|
|
|
|
|
|
|
#if !defined(NDEBUG) && GTEST_HAS_DEATH_TEST
|
|
|
|
// Verifies that `Type` and `QualType` are not allowed as top-level matchers in
|
|
|
|
// rules.
|
|
|
|
TEST(TransformerDeathTest, OrderedRuleTypes) {
|
2019-11-04 23:02:35 +08:00
|
|
|
RewriteRule QualTypeRule = makeRule(qualType(), changeTo(cat("Q")));
|
2019-10-16 09:06:46 +08:00
|
|
|
EXPECT_DEATH(transformer::detail::buildMatchers(QualTypeRule),
|
2019-08-13 20:31:29 +08:00
|
|
|
"Matcher must be.*node matcher");
|
|
|
|
|
2019-11-04 23:02:35 +08:00
|
|
|
RewriteRule TypeRule = makeRule(arrayType(), changeTo(cat("T")));
|
2019-10-16 09:06:46 +08:00
|
|
|
EXPECT_DEATH(transformer::detail::buildMatchers(TypeRule),
|
2019-08-13 20:31:29 +08:00
|
|
|
"Matcher must be.*node matcher");
|
|
|
|
}
|
|
|
|
#endif
|
2020-05-20 02:26:46 +08:00
|
|
|
|
|
|
|
// Edits are able to span multiple files; in this case, a header and an
|
|
|
|
// implementation file.
|
|
|
|
TEST_F(TransformerTest, MultipleFiles) {
|
|
|
|
std::string Header = R"cc(void RemoveThisFunction();)cc";
|
|
|
|
std::string Source = R"cc(#include "input.h"
|
|
|
|
void RemoveThisFunction();)cc";
|
|
|
|
Transformer T(
|
|
|
|
makeRule(functionDecl(hasName("RemoveThisFunction")), changeTo(cat(""))),
|
|
|
|
consumer());
|
|
|
|
T.registerMatchers(&MatchFinder);
|
|
|
|
auto Factory = newFrontendActionFactory(&MatchFinder);
|
|
|
|
EXPECT_TRUE(runToolOnCodeWithArgs(
|
|
|
|
Factory->create(), Source, std::vector<std::string>(), "input.cc",
|
|
|
|
"clang-tool", std::make_shared<PCHContainerOperations>(),
|
|
|
|
{{"input.h", Header}}));
|
|
|
|
|
|
|
|
std::sort(Changes.begin(), Changes.end(),
|
|
|
|
[](const AtomicChange &L, const AtomicChange &R) {
|
|
|
|
return L.getFilePath() < R.getFilePath();
|
|
|
|
});
|
|
|
|
|
|
|
|
ASSERT_EQ(Changes[0].getFilePath(), "./input.h");
|
|
|
|
EXPECT_THAT(Changes[0].getInsertedHeaders(), IsEmpty());
|
|
|
|
EXPECT_THAT(Changes[0].getRemovedHeaders(), IsEmpty());
|
|
|
|
llvm::Expected<std::string> UpdatedCode =
|
|
|
|
clang::tooling::applyAllReplacements(Header,
|
|
|
|
Changes[0].getReplacements());
|
|
|
|
ASSERT_TRUE(static_cast<bool>(UpdatedCode))
|
|
|
|
<< "Could not update code: " << llvm::toString(UpdatedCode.takeError());
|
|
|
|
EXPECT_EQ(format(*UpdatedCode), format(R"cc(;)cc"));
|
|
|
|
|
|
|
|
ASSERT_EQ(Changes[1].getFilePath(), "input.cc");
|
|
|
|
EXPECT_THAT(Changes[1].getInsertedHeaders(), IsEmpty());
|
|
|
|
EXPECT_THAT(Changes[1].getRemovedHeaders(), IsEmpty());
|
|
|
|
UpdatedCode = clang::tooling::applyAllReplacements(
|
|
|
|
Source, Changes[1].getReplacements());
|
|
|
|
ASSERT_TRUE(static_cast<bool>(UpdatedCode))
|
|
|
|
<< "Could not update code: " << llvm::toString(UpdatedCode.takeError());
|
|
|
|
EXPECT_EQ(format(*UpdatedCode), format(R"cc(#include "input.h"
|
|
|
|
;)cc"));
|
|
|
|
}
|
2019-04-05 23:14:05 +08:00
|
|
|
} // namespace
|