d4934eb5f8
This gives us slightly nicer syntax (foreach) for idioms currently expressed as a loop, and the option to use range algorithms where it makes sense (e.g. llvm::all_of et al encapsulate the needed flow control in a useful way). It's also a building block for iteration over filtered views (e.g. iterate over all Stmt children, with the right type): for (const Statement &S : filter<Statement>(N.children())) ... I realize the recent direction has been mostly towards strongly-typed node-specific facilities, but I think it's important we have convenient generic facilities too. Differential Revision: https://reviews.llvm.org/D90023
69 lines
2.5 KiB
C++
69 lines
2.5 KiB
C++
//===- TreeTestBase.h -----------------------------------------------------===//
|
|
//
|
|
// 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 provides the test infrastructure for syntax trees.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_CLANG_UNITTESTS_TOOLING_SYNTAX_TREETESTBASE_H
|
|
#define LLVM_CLANG_UNITTESTS_TOOLING_SYNTAX_TREETESTBASE_H
|
|
|
|
#include "clang/Basic/LLVM.h"
|
|
#include "clang/Frontend/CompilerInvocation.h"
|
|
#include "clang/Testing/TestClangConfig.h"
|
|
#include "clang/Tooling/Syntax/Nodes.h"
|
|
#include "clang/Tooling/Syntax/Tokens.h"
|
|
#include "clang/Tooling/Syntax/Tree.h"
|
|
#include "llvm/ADT/StringRef.h"
|
|
#include "llvm/Support/ScopedPrinter.h"
|
|
#include "llvm/Testing/Support/Annotations.h"
|
|
#include "gmock/gmock.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
namespace clang {
|
|
namespace syntax {
|
|
class SyntaxTreeTest : public ::testing::Test,
|
|
public ::testing::WithParamInterface<TestClangConfig> {
|
|
protected:
|
|
// Build a syntax tree for the code.
|
|
TranslationUnit *buildTree(StringRef Code,
|
|
const TestClangConfig &ClangConfig);
|
|
|
|
/// Finds the deepest node in the tree that covers exactly \p R.
|
|
/// FIXME: implement this efficiently and move to public syntax tree API.
|
|
syntax::Node *nodeByRange(llvm::Annotations::Range R, syntax::Node *Root);
|
|
|
|
// Data fields.
|
|
IntrusiveRefCntPtr<DiagnosticOptions> DiagOpts = new DiagnosticOptions();
|
|
IntrusiveRefCntPtr<DiagnosticsEngine> Diags =
|
|
new DiagnosticsEngine(new DiagnosticIDs, DiagOpts.get());
|
|
IntrusiveRefCntPtr<llvm::vfs::InMemoryFileSystem> FS =
|
|
new llvm::vfs::InMemoryFileSystem;
|
|
IntrusiveRefCntPtr<FileManager> FileMgr =
|
|
new FileManager(FileSystemOptions(), FS);
|
|
IntrusiveRefCntPtr<SourceManager> SourceMgr =
|
|
new SourceManager(*Diags, *FileMgr);
|
|
std::shared_ptr<CompilerInvocation> Invocation;
|
|
// Set after calling buildTree().
|
|
std::unique_ptr<syntax::TokenBuffer> TB;
|
|
std::unique_ptr<syntax::Arena> Arena;
|
|
};
|
|
|
|
std::vector<TestClangConfig> allTestClangConfigs();
|
|
|
|
MATCHER_P(role, R, "") {
|
|
if (arg.getRole() == R)
|
|
return true;
|
|
*result_listener << "role is " << llvm::to_string(arg.getRole());
|
|
return false;
|
|
}
|
|
|
|
} // namespace syntax
|
|
} // namespace clang
|
|
#endif // LLVM_CLANG_UNITTESTS_TOOLING_SYNTAX_TREETESTBASE_H
|