mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2025-01-13 11:22:03 +00:00
2946cd7010
to reflect the new license. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. llvm-svn: 351636
116 lines
3.6 KiB
C++
116 lines
3.6 KiB
C++
//===- unittests/Tooling/RecursiveASTVisitorPostOrderASTVisitor.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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file contains tests for the post-order traversing functionality
|
|
// of RecursiveASTVisitor.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "TestVisitor.h"
|
|
|
|
using namespace clang;
|
|
|
|
namespace {
|
|
|
|
class RecordingVisitor : public TestVisitor<RecordingVisitor> {
|
|
|
|
bool VisitPostOrder;
|
|
|
|
public:
|
|
explicit RecordingVisitor(bool VisitPostOrder)
|
|
: VisitPostOrder(VisitPostOrder) {}
|
|
|
|
// List of visited nodes during traversal.
|
|
std::vector<std::string> VisitedNodes;
|
|
|
|
bool shouldTraversePostOrder() const { return VisitPostOrder; }
|
|
|
|
bool VisitUnaryOperator(UnaryOperator *Op) {
|
|
VisitedNodes.push_back(Op->getOpcodeStr(Op->getOpcode()));
|
|
return true;
|
|
}
|
|
|
|
bool VisitBinaryOperator(BinaryOperator *Op) {
|
|
VisitedNodes.push_back(Op->getOpcodeStr());
|
|
return true;
|
|
}
|
|
|
|
bool VisitIntegerLiteral(IntegerLiteral *Lit) {
|
|
VisitedNodes.push_back(Lit->getValue().toString(10, false));
|
|
return true;
|
|
}
|
|
|
|
bool VisitVarDecl(VarDecl *D) {
|
|
VisitedNodes.push_back(D->getNameAsString());
|
|
return true;
|
|
}
|
|
|
|
bool VisitCXXMethodDecl(CXXMethodDecl *D) {
|
|
VisitedNodes.push_back(D->getQualifiedNameAsString());
|
|
return true;
|
|
}
|
|
|
|
bool VisitReturnStmt(ReturnStmt *S) {
|
|
VisitedNodes.push_back("return");
|
|
return true;
|
|
}
|
|
|
|
bool VisitCXXRecordDecl(CXXRecordDecl *D) {
|
|
if (!D->isImplicit())
|
|
VisitedNodes.push_back(D->getQualifiedNameAsString());
|
|
return true;
|
|
}
|
|
|
|
bool VisitTemplateTypeParmType(TemplateTypeParmType *T) {
|
|
VisitedNodes.push_back(T->getDecl()->getQualifiedNameAsString());
|
|
return true;
|
|
}
|
|
};
|
|
} // namespace
|
|
|
|
TEST(RecursiveASTVisitor, PostOrderTraversal) {
|
|
// We traverse the translation unit and store all visited nodes.
|
|
RecordingVisitor Visitor(true);
|
|
Visitor.runOver("class A {\n"
|
|
" class B {\n"
|
|
" int foo() {\n"
|
|
" while(4) { int i = 9; int j = -5; }\n"
|
|
" return (1 + 3) + 2; }\n"
|
|
" };\n"
|
|
"};\n");
|
|
|
|
std::vector<std::string> expected = {"4", "9", "i", "5", "-",
|
|
"j", "1", "3", "+", "2",
|
|
"+", "return", "A::B::foo", "A::B", "A"};
|
|
// Compare the list of actually visited nodes with the expected list of
|
|
// visited nodes.
|
|
ASSERT_EQ(expected.size(), Visitor.VisitedNodes.size());
|
|
for (std::size_t I = 0; I < expected.size(); I++) {
|
|
ASSERT_EQ(expected[I], Visitor.VisitedNodes[I]);
|
|
}
|
|
}
|
|
|
|
TEST(RecursiveASTVisitor, NoPostOrderTraversal) {
|
|
// We traverse the translation unit and store all visited nodes.
|
|
RecordingVisitor Visitor(false);
|
|
Visitor.runOver("class A {\n"
|
|
" class B {\n"
|
|
" int foo() { return 1 + 2; }\n"
|
|
" };\n"
|
|
"};\n");
|
|
|
|
std::vector<std::string> expected = {"A", "A::B", "A::B::foo", "return",
|
|
"+", "1", "2"};
|
|
// Compare the list of actually visited nodes with the expected list of
|
|
// visited nodes.
|
|
ASSERT_EQ(expected.size(), Visitor.VisitedNodes.size());
|
|
for (std::size_t I = 0; I < expected.size(); I++) {
|
|
ASSERT_EQ(expected[I], Visitor.VisitedNodes[I]);
|
|
}
|
|
}
|