File: TraversalScope.cpp

package info (click to toggle)
llvm-toolchain-9 1%3A9.0.1-16
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 882,436 kB
  • sloc: cpp: 4,167,636; ansic: 714,256; asm: 457,610; python: 155,927; objc: 65,094; sh: 42,856; lisp: 26,908; perl: 7,786; pascal: 7,722; makefile: 6,881; ml: 5,581; awk: 3,648; cs: 2,027; xml: 888; javascript: 381; ruby: 156
file content (50 lines) | stat: -rw-r--r-- 1,367 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
//===- unittest/Tooling/RecursiveASTVisitorTests/TraversalScope.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"

using namespace clang;

namespace {

class Visitor : public ExpectedLocationVisitor<Visitor, clang::TestVisitor> {
public:
  Visitor(ASTContext *Context) { this->Context = Context; }

  bool VisitNamedDecl(NamedDecl *D) {
    if (!D->isImplicit())
      Match(D->getName(), D->getLocation());
    return true;
  }
};

TEST(RecursiveASTVisitor, RespectsTraversalScope) {
  auto AST = tooling::buildASTFromCode(
      R"cpp(
struct foo {
  struct bar {
    struct baz {};
  };
};
      )cpp",
      "foo.cpp", std::make_shared<PCHContainerOperations>());
  auto &Ctx = AST->getASTContext();
  auto &TU = *Ctx.getTranslationUnitDecl();
  auto &Foo = *TU.lookup(&Ctx.Idents.get("foo")).front();
  auto &Bar = *cast<DeclContext>(Foo).lookup(&Ctx.Idents.get("bar")).front();

  Ctx.setTraversalScope({&Bar});

  Visitor V(&Ctx);
  V.DisallowMatch("foo", 2, 8);
  V.ExpectMatch("bar", 3, 10);
  V.ExpectMatch("baz", 4, 12);
  V.TraverseAST(Ctx);
}

} // end anonymous namespace