clang  15.0.0git
RewriteRule.cpp
Go to the documentation of this file.
1 //===--- Transformer.cpp - Transformer library implementation ---*- C++ -*-===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 
11 #include "clang/AST/Stmt.h"
16 #include "llvm/ADT/Optional.h"
17 #include "llvm/ADT/StringRef.h"
18 #include "llvm/Support/Errc.h"
19 #include "llvm/Support/Error.h"
20 #include <map>
21 #include <string>
22 #include <utility>
23 #include <vector>
24 
25 using namespace clang;
26 using namespace transformer;
27 
29 using ast_matchers::internal::DynTypedMatcher;
30 
32 
33 const char transformer::RootID[] = "___root___";
34 
36 translateEdits(const MatchResult &Result, ArrayRef<ASTEdit> ASTEdits) {
38  for (const auto &E : ASTEdits) {
39  Expected<CharSourceRange> Range = E.TargetRange(Result);
40  if (!Range)
41  return Range.takeError();
43  tooling::getRangeForEdit(*Range, *Result.Context);
44  // FIXME: let user specify whether to treat this case as an error or ignore
45  // it as is currently done. This behavior is problematic in that it hides
46  // failures from bad ranges. Also, the behavior here differs from
47  // `flatten`. Here, we abort (without error), whereas flatten, if it hits an
48  // empty list, does not abort. As a result, `editList({A,B})` is not
49  // equivalent to `flatten(edit(A), edit(B))`. The former will abort if `A`
50  // produces a bad range, whereas the latter will simply ignore A.
51  if (!EditRange)
52  return SmallVector<Edit, 0>();
53  auto Replacement = E.Replacement->eval(Result);
54  if (!Replacement)
55  return Replacement.takeError();
56  auto Metadata = E.Metadata(Result);
57  if (!Metadata)
58  return Metadata.takeError();
60  T.Kind = E.Kind;
61  T.Range = *EditRange;
62  T.Replacement = std::move(*Replacement);
63  T.Metadata = std::move(*Metadata);
64  Edits.push_back(std::move(T));
65  }
66  return Edits;
67 }
68 
70  return [Edits = std::move(Edits)](const MatchResult &Result) {
71  return translateEdits(Result, Edits);
72  };
73 }
74 
76  return [Edit = std::move(Edit)](const MatchResult &Result) {
77  return translateEdits(Result, {Edit});
78  };
79 }
80 
82  return [Anchor = std::move(Anchor)](const MatchResult &Result)
84  Expected<CharSourceRange> Range = Anchor(Result);
85  if (!Range)
86  return Range.takeError();
87  // In case the range is inside a macro expansion, map the location back to a
88  // "real" source location.
90  Result.SourceManager->getSpellingLoc(Range->getBegin());
91  Edit E;
92  // Implicitly, leave `E.Replacement` as the empty string.
95  return SmallVector<Edit, 1>{E};
96  };
97 }
98 
101  if (Generators.size() == 1)
102  return std::move(Generators[0]);
103  return
104  [Gs = std::move(Generators)](
105  const MatchResult &Result) -> llvm::Expected<SmallVector<Edit, 1>> {
106  SmallVector<Edit, 1> AllEdits;
107  for (const auto &G : Gs) {
108  llvm::Expected<SmallVector<Edit, 1>> Edits = G(Result);
109  if (!Edits)
110  return Edits.takeError();
111  AllEdits.append(Edits->begin(), Edits->end());
112  }
113  return AllEdits;
114  };
115 }
116 
118  ASTEdit E;
119  E.TargetRange = std::move(Target);
120  E.Replacement = std::move(Replacement);
121  return E;
122 }
123 
124 namespace {
125 /// A \c TextGenerator that always returns a fixed string.
126 class SimpleTextGenerator : public MatchComputation<std::string> {
127  std::string S;
128 
129 public:
130  SimpleTextGenerator(std::string S) : S(std::move(S)) {}
131  llvm::Error eval(const ast_matchers::MatchFinder::MatchResult &,
132  std::string *Result) const override {
133  Result->append(S);
134  return llvm::Error::success();
135  }
136  std::string toString() const override {
137  return (llvm::Twine("text(\"") + S + "\")").str();
138  }
139 };
140 } // namespace
141 
143  return std::make_shared<SimpleTextGenerator>(std::move(S));
144 }
145 
147  return change(std::move(S), makeText(""));
148 }
149 
150 static std::string formatHeaderPath(StringRef Header, IncludeFormat Format) {
151  switch (Format) {
153  return Header.str();
155  return ("<" + Header + ">").str();
156  }
157  llvm_unreachable("Unknown transformer::IncludeFormat enum");
158 }
159 
161  IncludeFormat Format) {
162  ASTEdit E;
164  E.TargetRange = Target;
165  E.Replacement = makeText(formatHeaderPath(Header, Format));
166  return E;
167 }
168 
171  return editList(std::move(Edits));
172 }
173 
175  return edit(std::move(Edit));
176 }
177 
179  EditGenerator Edits) {
180  RewriteRule R;
181  R.Cases = {{std::move(M), std::move(Edits)}};
182  return R;
183 }
184 
185 RewriteRule transformer::makeRule(ast_matchers::internal::DynTypedMatcher M,
186  std::initializer_list<ASTEdit> Edits) {
187  return detail::makeRule(std::move(M),
188  detail::makeEditGenerator(std::move(Edits)));
189 }
190 
191 namespace {
192 
193 /// Unconditionally binds the given node set before trying `InnerMatcher` and
194 /// keeps the bound nodes on a successful match.
195 template <typename T>
196 class BindingsMatcher : public ast_matchers::internal::MatcherInterface<T> {
198  const ast_matchers::internal::Matcher<T> InnerMatcher;
199 
200 public:
201  explicit BindingsMatcher(ast_matchers::BoundNodes Nodes,
202  ast_matchers::internal::Matcher<T> InnerMatcher)
203  : Nodes(std::move(Nodes)), InnerMatcher(std::move(InnerMatcher)) {}
204 
205  bool matches(
206  const T &Node, ast_matchers::internal::ASTMatchFinder *Finder,
207  ast_matchers::internal::BoundNodesTreeBuilder *Builder) const override {
208  ast_matchers::internal::BoundNodesTreeBuilder Result(*Builder);
209  for (const auto &N : Nodes.getMap())
210  Result.setBinding(N.first, N.second);
211  if (InnerMatcher.matches(Node, Finder, &Result)) {
212  *Builder = std::move(Result);
213  return true;
214  }
215  return false;
216  }
217 };
218 
219 /// Matches nodes of type T that have at least one descendant node for which the
220 /// given inner matcher matches. Will match for each descendant node that
221 /// matches. Based on ForEachDescendantMatcher, but takes a dynamic matcher,
222 /// instead of a static one, because it is used by RewriteRule, which carries
223 /// (only top-level) dynamic matchers.
224 template <typename T>
225 class DynamicForEachDescendantMatcher
226  : public ast_matchers::internal::MatcherInterface<T> {
227  const DynTypedMatcher DescendantMatcher;
228 
229 public:
230  explicit DynamicForEachDescendantMatcher(DynTypedMatcher DescendantMatcher)
231  : DescendantMatcher(std::move(DescendantMatcher)) {}
232 
233  bool matches(
234  const T &Node, ast_matchers::internal::ASTMatchFinder *Finder,
235  ast_matchers::internal::BoundNodesTreeBuilder *Builder) const override {
236  return Finder->matchesDescendantOf(
237  Node, this->DescendantMatcher, Builder,
238  ast_matchers::internal::ASTMatchFinder::BK_All);
239  }
240 };
241 
242 template <typename T>
243 ast_matchers::internal::Matcher<T>
244 forEachDescendantDynamically(ast_matchers::BoundNodes Nodes,
245  DynTypedMatcher M) {
246  return ast_matchers::internal::makeMatcher(new BindingsMatcher<T>(
247  std::move(Nodes),
248  ast_matchers::internal::makeMatcher(
249  new DynamicForEachDescendantMatcher<T>(std::move(M)))));
250 }
251 
252 class ApplyRuleCallback : public MatchFinder::MatchCallback {
253 public:
254  ApplyRuleCallback(RewriteRule Rule) : Rule(std::move(Rule)) {}
255 
256  template <typename T>
257  void registerMatchers(const ast_matchers::BoundNodes &Nodes,
258  MatchFinder *MF) {
259  for (auto &Matcher : transformer::detail::buildMatchers(Rule))
260  MF->addMatcher(forEachDescendantDynamically<T>(Nodes, Matcher), this);
261  }
262 
263  void run(const MatchFinder::MatchResult &Result) override {
264  if (!Edits)
265  return;
266  size_t I = transformer::detail::findSelectedCase(Result, Rule);
267  auto Transformations = Rule.Cases[I].Edits(Result);
268  if (!Transformations) {
269  Edits = Transformations.takeError();
270  return;
271  }
272  Edits->append(Transformations->begin(), Transformations->end());
273  }
274 
275  RewriteRule Rule;
276 
277  // Initialize to a non-error state.
279 };
280 } // namespace
281 
282 template <typename T>
285  const MatchResult &Result) {
286  ApplyRuleCallback Callback(std::move(Rule));
287  MatchFinder Finder;
288  Callback.registerMatchers<T>(Result.Nodes, &Finder);
289  Finder.match(Node, *Result.Context);
290  return std::move(Callback.Edits);
291 }
292 
295  const MatchResult &Result) {
296  return rewriteDescendantsImpl(Node, std::move(Rule), Result);
297 }
298 
301  const MatchResult &Result) {
302  return rewriteDescendantsImpl(Node, std::move(Rule), Result);
303 }
304 
307  const MatchResult &Result) {
308  return rewriteDescendantsImpl(Node, std::move(Rule), Result);
309 }
310 
313  RewriteRule Rule,
314  const MatchResult &Result) {
315  if (const auto *Node = DNode.get<Decl>())
316  return rewriteDescendantsImpl(*Node, std::move(Rule), Result);
317  if (const auto *Node = DNode.get<Stmt>())
318  return rewriteDescendantsImpl(*Node, std::move(Rule), Result);
319  if (const auto *Node = DNode.get<TypeLoc>())
320  return rewriteDescendantsImpl(*Node, std::move(Rule), Result);
321 
322  return llvm::make_error<llvm::StringError>(
323  llvm::errc::invalid_argument,
324  "type unsupported for recursive rewriting, Kind=" +
325  DNode.getNodeKind().asStringRef());
326 }
327 
329  RewriteRule Rule) {
330  return [NodeId = std::move(NodeId),
331  Rule = std::move(Rule)](const MatchResult &Result)
333  const ast_matchers::BoundNodes::IDToNodeMap &NodesMap =
334  Result.Nodes.getMap();
335  auto It = NodesMap.find(NodeId);
336  if (It == NodesMap.end())
337  return llvm::make_error<llvm::StringError>(llvm::errc::invalid_argument,
338  "ID not bound: " + NodeId);
339  return detail::rewriteDescendants(It->second, std::move(Rule), Result);
340  };
341 }
342 
343 void transformer::addInclude(RewriteRuleBase &Rule, StringRef Header,
344  IncludeFormat Format) {
345  for (auto &Case : Rule.Cases)
346  Case.Edits = flatten(std::move(Case.Edits), addInclude(Header, Format));
347 }
348 
349 #ifndef NDEBUG
350 // Filters for supported matcher kinds. FIXME: Explicitly list the allowed kinds
351 // (all node matcher types except for `QualType` and `Type`), rather than just
352 // banning `QualType` and `Type`.
353 static bool hasValidKind(const DynTypedMatcher &M) {
354  return !M.canConvertTo<QualType>();
355 }
356 #endif
357 
358 // Binds each rule's matcher to a unique (and deterministic) tag based on
359 // `TagBase` and the id paired with the case. All of the returned matchers have
360 // their traversal kind explicitly set, either based on a pre-set kind or to the
361 // provided `DefaultTraversalKind`.
362 static std::vector<DynTypedMatcher> taggedMatchers(
363  StringRef TagBase,
364  const SmallVectorImpl<std::pair<size_t, RewriteRule::Case>> &Cases,
365  TraversalKind DefaultTraversalKind) {
366  std::vector<DynTypedMatcher> Matchers;
367  Matchers.reserve(Cases.size());
368  for (const auto &Case : Cases) {
369  std::string Tag = (TagBase + Twine(Case.first)).str();
370  // HACK: Many matchers are not bindable, so ensure that tryBind will work.
371  DynTypedMatcher BoundMatcher(Case.second.Matcher);
372  BoundMatcher.setAllowBind(true);
373  auto M = *BoundMatcher.tryBind(Tag);
374  Matchers.push_back(!M.getTraversalKind()
375  ? M.withTraversalKind(DefaultTraversalKind)
376  : std::move(M));
377  }
378  return Matchers;
379 }
380 
381 // Simply gathers the contents of the various rules into a single rule. The
382 // actual work to combine these into an ordered choice is deferred to matcher
383 // registration.
384 template <>
387  RewriteRule R;
388  for (auto &Rule : Rules)
389  R.Cases.append(Rule.Cases.begin(), Rule.Cases.end());
390  return R;
391 }
392 
393 std::vector<DynTypedMatcher>
395  // Map the cases into buckets of matchers -- one for each "root" AST kind,
396  // which guarantees that they can be combined in a single anyOf matcher. Each
397  // case is paired with an identifying number that is converted to a string id
398  // in `taggedMatchers`.
399  std::map<ASTNodeKind,
401  Buckets;
402  const SmallVectorImpl<RewriteRule::Case> &Cases = Rule.Cases;
403  for (int I = 0, N = Cases.size(); I < N; ++I) {
404  assert(hasValidKind(Cases[I].Matcher) &&
405  "Matcher must be non-(Qual)Type node matcher");
406  Buckets[Cases[I].Matcher.getSupportedKind()].emplace_back(I, Cases[I]);
407  }
408 
409  // Each anyOf explicitly controls the traversal kind. The anyOf itself is set
410  // to `TK_AsIs` to ensure no nodes are skipped, thereby deferring to the kind
411  // of the branches. Then, each branch is either left as is, if the kind is
412  // already set, or explicitly set to `TK_AsIs`. We choose this setting because
413  // it is the default interpretation of matchers.
414  std::vector<DynTypedMatcher> Matchers;
415  for (const auto &Bucket : Buckets) {
416  DynTypedMatcher M = DynTypedMatcher::constructVariadic(
417  DynTypedMatcher::VO_AnyOf, Bucket.first,
418  taggedMatchers("Tag", Bucket.second, TK_AsIs));
419  M.setAllowBind(true);
420  // `tryBind` is guaranteed to succeed, because `AllowBind` was set to true.
421  Matchers.push_back(M.tryBind(RootID)->withTraversalKind(TK_AsIs));
422  }
423  return Matchers;
424 }
425 
427  std::vector<DynTypedMatcher> Ms = buildMatchers(Rule);
428  assert(Ms.size() == 1 && "Cases must have compatible matchers.");
429  return Ms[0];
430 }
431 
433  auto &NodesMap = Result.Nodes.getMap();
434  auto Root = NodesMap.find(RootID);
435  assert(Root != NodesMap.end() && "Transformation failed: missing root node.");
437  CharSourceRange::getTokenRange(Root->second.getSourceRange()),
438  *Result.Context);
439  if (RootRange)
440  return RootRange->getBegin();
441  // The match doesn't have a coherent range, so fall back to the expansion
442  // location as the "beginning" of the match.
443  return Result.SourceManager->getExpansionLoc(
444  Root->second.getSourceRange().getBegin());
445 }
446 
447 // Finds the case that was "selected" -- that is, whose matcher triggered the
448 // `MatchResult`.
450  const RewriteRuleBase &Rule) {
451  if (Rule.Cases.size() == 1)
452  return 0;
453 
454  auto &NodesMap = Result.Nodes.getMap();
455  for (size_t i = 0, N = Rule.Cases.size(); i < N; ++i) {
456  std::string Tag = ("Tag" + Twine(i)).str();
457  if (NodesMap.find(Tag) != NodesMap.end())
458  return i;
459  }
460  llvm_unreachable("No tag found for this rule.");
461 }
clang::TraversalKind
TraversalKind
Defines how we descend a level in the AST when we pass through expressions.
Definition: ASTTypeTraits.h:38
clang::transformer::RootID
const char RootID[]
Definition: RewriteRule.cpp:33
Nodes
BoundNodesTreeBuilder Nodes
Definition: ASTMatchFinder.cpp:83
string
string(SUBSTRING ${CMAKE_CURRENT_BINARY_DIR} 0 ${PATH_LIB_START} PATH_HEAD) string(SUBSTRING $
Definition: CMakeLists.txt:22
llvm::SmallVector
Definition: LLVM.h:38
clang::SourceLocation
Encodes a location in the source.
Definition: SourceLocation.h:86
clang::ast_matchers::MatchFinder
A class to allow finding matches over the Clang AST.
Definition: ASTMatchFinder.h:68
hasValidKind
static bool hasValidKind(const DynTypedMatcher &M)
Definition: RewriteRule.cpp:353
clang::MultiVersionKind::Target
@ Target
RewriteRule.h
clang::QualType
A (possibly-)qualified type.
Definition: Type.h:675
clang::transformer::detail::findSelectedCase
size_t findSelectedCase(const ast_matchers::MatchFinder::MatchResult &Result, const RewriteRuleBase &Rule)
Returns the index of the Case of Rule that was selected in the match result.
Definition: RewriteRule.cpp:449
clang::transformer::noopEdit
EditGenerator noopEdit(RangeSelector Anchor)
Generates a single, no-op edit anchored at the start location of the specified range.
Definition: RewriteRule.cpp:81
clang::transformer::run
Stencil run(MatchConsumer< std::string > C)
Wraps a MatchConsumer in a Stencil, so that it can be used in a Stencil.
Definition: Stencil.cpp:484
clang::transformer::EditKind::AddInclude
@ AddInclude
clang::transformer::editList
EditGenerator editList(llvm::SmallVector< ASTEdit, 1 > Edits)
Lifts a list of ASTEdits into an EditGenerator.
Definition: RewriteRule.cpp:69
llvm::Optional
Definition: LLVM.h:40
llvm::Expected
Definition: LLVM.h:41
ASTMatchFinder.h
taggedMatchers
static std::vector< DynTypedMatcher > taggedMatchers(StringRef TagBase, const SmallVectorImpl< std::pair< size_t, RewriteRule::Case >> &Cases, TraversalKind DefaultTraversalKind)
Definition: RewriteRule.cpp:362
clang::transformer::ASTEdit
Definition: RewriteRule.h:106
clang::transformer::Edit::Replacement
std::string Replacement
Definition: RewriteRule.h:48
clang::transformer::RangeSelector
MatchConsumer< CharSourceRange > RangeSelector
Definition: RangeSelector.h:27
clang::transformer::edit
EditGenerator edit(ASTEdit E)
Generates a single (specified) edit.
Definition: RewriteRule.cpp:75
clang::DynTypedNode::getNodeKind
ASTNodeKind getNodeKind() const
Definition: ASTTypeTraits.h:281
MatchResult
MatchFinder::MatchResult MatchResult
Definition: RewriteRule.cpp:31
clang::CharSourceRange::getCharRange
static CharSourceRange getCharRange(SourceRange R)
Definition: SourceLocation.h:265
clang::transformer::change
ASTEdit change(RangeSelector Target, TextGenerator Replacement)
DEPRECATED: use changeTo.
Definition: RewriteRule.h:179
rewriteDescendantsImpl
llvm::Expected< SmallVector< clang::transformer::Edit, 1 > > rewriteDescendantsImpl(const T &Node, RewriteRule Rule, const MatchResult &Result)
Definition: RewriteRule.cpp:284
clang::transformer::Edit::Range
CharSourceRange Range
Definition: RewriteRule.h:47
clang::transformer::detail::buildMatchers
std::vector< ast_matchers::internal::DynTypedMatcher > buildMatchers(const RewriteRuleBase &Rule)
Builds a set of matchers that cover the rule.
Definition: RewriteRule.cpp:394
Node
DynTypedNode Node
Definition: ASTMatchFinder.cpp:68
clang::transformer::Edit
A concrete description of a source edit, represented by a character range in the source to be replace...
Definition: RewriteRule.h:45
clang::transformer::makeRule
RewriteRule makeRule(ast_matchers::internal::DynTypedMatcher M, EditsT &&Edits)
Constructs a simple RewriteRule.
Definition: RewriteRule.h:323
MatchResult
MatchFinder::MatchResult MatchResult
Definition: RangeSelector.cpp:30
clang::threadSafety::sx::toString
std::string toString(const til::SExpr *E)
Definition: ThreadSafetyCommon.h:90
ASTMatchers.h
formatHeaderPath
static std::string formatHeaderPath(StringRef Header, IncludeFormat Format)
Definition: RewriteRule.cpp:150
clang::transformer::flatten
EditGenerator flatten(Ts &&...Edits)
Definition: RewriteRule.h:167
clang::tooling::getRangeForEdit
llvm::Optional< CharSourceRange > getRangeForEdit(const CharSourceRange &EditRange, const SourceManager &SM, const LangOptions &LangOpts)
Attempts to resolve the given range to one that can be edited by a rewrite; generally,...
Definition: SourceCode.cpp:82
makeText
static TextGenerator makeText(std::string S)
Definition: RewriteRule.cpp:142
clang::transformer::applyFirst
RewriteRuleWith< MetadataT > applyFirst(ArrayRef< RewriteRuleWith< MetadataT >> Rules)
Applies the first rule whose pattern matches; other rules are ignored.
Definition: RewriteRule.h:409
clang::transformer::Edit::Kind
EditKind Kind
Definition: RewriteRule.h:46
clang::transformer::MatchComputation
A failable computation over nodes bound by AST matchers, with (limited) reflection via the toString m...
Definition: MatchConsumer.h:64
translateEdits
static Expected< SmallVector< transformer::Edit, 1 > > translateEdits(const MatchResult &Result, ArrayRef< ASTEdit > ASTEdits)
Definition: RewriteRule.cpp:36
clang::transformer::RewriteRuleBase
Description of a source-code transformation.
Definition: RewriteRule.h:277
clang::transformer::RewriteRuleWith< void >
Definition: RewriteRule.h:294
clang::transformer::detail::makeEditGenerator
EditGenerator makeEditGenerator(EditGenerator Edits)
Definition: RewriteRule.h:313
clang::transformer::IncludeFormat
IncludeFormat
Format of the path in an include directive – angle brackets or quotes.
Definition: RewriteRule.h:53
clang::transformer::EditKind::Range
@ Range
clang::transformer::ASTEdit::Replacement
TextGenerator Replacement
Definition: RewriteRule.h:109
clang::transformer::remove
ASTEdit remove(RangeSelector S)
Removes the source selected by S.
Definition: RewriteRule.cpp:146
clang::transformer::detail::buildMatcher
ast_matchers::internal::DynTypedMatcher buildMatcher(const RewriteRuleBase &Rule)
Builds a single matcher for the rule, covering all of the rule's cases.
Definition: RewriteRule.cpp:426
SourceLocation.h
clang::ast_matchers::MatchFinder::addMatcher
void addMatcher(const DeclarationMatcher &NodeMatch, MatchCallback *Action)
Adds a matcher to execute when running over the AST.
Definition: ASTMatchFinder.cpp:1563
clang::transformer::addInclude
ASTEdit addInclude(RangeSelector Target, StringRef Header, IncludeFormat Format=IncludeFormat::Quoted)
Adds an include directive for the given header to the file of Target.
Definition: RewriteRule.cpp:160
clang::transformer::ASTEdit::Kind
EditKind Kind
Definition: RewriteRule.h:107
clang::TK_AsIs
@ TK_AsIs
Will traverse all child nodes.
Definition: ASTTypeTraits.h:40
clang::CharSourceRange::getTokenRange
static CharSourceRange getTokenRange(SourceRange R)
Definition: SourceLocation.h:261
SourceCode.h
Begin
SourceLocation Begin
Definition: USRLocFinder.cpp:165
llvm::ArrayRef
Definition: LLVM.h:34
clang::Decl
Decl - This represents one declaration (or definition), e.g.
Definition: DeclBase.h:83
clang::TypeLoc
Base wrapper for a particular "section" of type source info.
Definition: TypeLoc.h:58
clang::transformer::changeTo
ASTEdit changeTo(RangeSelector Target, TextGenerator Replacement)
Replaces a portion of the source text with Replacement.
Definition: RewriteRule.cpp:117
clang::transformer::rewriteDescendants
EditGenerator rewriteDescendants(std::string NodeId, RewriteRule Rule)
Applies Rule to all descendants of the node bound to NodeId.
Definition: RewriteRule.cpp:328
clang::transformer::TextGenerator
Generator< std::string > TextGenerator
Definition: RewriteRule.h:66
clang::transformer::ASTEdit::TargetRange
RangeSelector TargetRange
Definition: RewriteRule.h:108
ASTTypeTraits.h
clang::threadSafety::sx::matches
bool matches(const til::SExpr *E1, const til::SExpr *E2)
Definition: ThreadSafetyCommon.h:68
clang::ast_matchers::MatchFinder::MatchResult
Contains all information for a given match.
Definition: ASTMatchFinder.h:74
clang::transformer::IncludeFormat::Quoted
@ Quoted
std
Definition: Format.h:4296
clang::ast_matchers::BoundNodes::IDToNodeMap
internal::BoundNodesMap::IDToNodeMap IDToNodeMap
Type of mapping from binding identifiers to bound nodes.
Definition: ASTMatchers.h:121
clang::ASTNodeKind
Kind identifier.
Definition: ASTTypeTraits.h:51
clang
Definition: CalledOnceCheck.h:17
clang::transformer::detail::rewriteDescendants
llvm::Expected< SmallVector< Edit, 1 > > rewriteDescendants(const Decl &Node, RewriteRule Rule, const ast_matchers::MatchFinder::MatchResult &Result)
The following overload set is a version of rewriteDescendants that operates directly on the AST,...
Definition: RewriteRule.cpp:294
clang::Stmt
Stmt - This represents one statement.
Definition: Stmt.h:69
clang::transformer::IncludeFormat::Angled
@ Angled
clang::DynTypedNode::get
const T * get() const
Retrieve the stored node as type T.
Definition: ASTTypeTraits.h:269
clang::ast_matchers::BoundNodes
Maps string IDs to AST nodes matched by parts of a matcher.
Definition: ASTMatchers.h:107
clang::transformer::detail::makeRule
RewriteRule makeRule(ast_matchers::internal::DynTypedMatcher M, EditGenerator Edits)
clang::DynTypedNode
A dynamically typed AST node container.
Definition: ASTTypeTraits.h:249
clang::transformer::Edit::Metadata
llvm::Any Metadata
Definition: RewriteRule.h:49
Stmt.h
llvm::SmallVectorImpl
Definition: Randstruct.h:18
clang::transformer::flattenVector
EditGenerator flattenVector(SmallVector< EditGenerator, 2 > Generators)
Flattens a list of generators into a single generator whose elements are the concatenation of the res...
Definition: RewriteRule.cpp:100
clang::transformer::RewriteRuleBase::Cases
SmallVector< Case, 1 > Cases
Definition: RewriteRule.h:283
clang::transformer::EditGenerator
MatchConsumer< llvm::SmallVector< Edit, 1 > > EditGenerator
Maps a match result to a list of concrete edits (with possible failure).
Definition: RewriteRule.h:62
clang::transformer::detail::getRuleMatchLoc
SourceLocation getRuleMatchLoc(const ast_matchers::MatchFinder::MatchResult &Result)
Gets the beginning location of the source matched by a rewrite rule.
Definition: RewriteRule.cpp:432
clang::ast_matchers::MatchFinder::MatchCallback
Called when the Match registered for it was successfully found in the AST.
Definition: ASTMatchFinder.h:91
clang::ASTNodeKind::asStringRef
StringRef asStringRef() const
String representation of the kind.
Definition: ASTTypeTraits.cpp:87