Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://clang.llvm.org/doxygen/RewriteRule_8cpp_source.html below:

clang: lib/Tooling/Transformer/RewriteRule.cpp Source File

;

transformer;

ast_matchers::internal::DynTypedMatcher;

(

&

: ASTEdits) {

.takeError();

std::optional<CharSourceRange> EditRange =

.Range = *EditRange;

(

.Replacement) {

Replacement =

.Replacement->eval(Result);

Replacement.takeError();

.Replacement = std::move(*Replacement);

=

.Note->eval(Result);

.takeError();

.Note = std::move(*

);

Metadata =

.Metadata(Result);

Metadata.takeError();

.Metadata = std::move(*Metadata);

Edits.push_back(std::move(

));

[Edits = std::move(Edits)](

&Result) {

[Anchor = std::move(Anchor)](

&Result)

.takeError();

.Kind = EditKind::Range;

(Generators.size() == 1)

std::move(Generators[0]);

[Gs = std::move(Generators)](

(

&G : Gs) {

Edits.takeError();

AllEdits.append(Edits->begin(), Edits->end());

.TargetRange = std::move(

);

.Replacement = std::move(Replacement);

.Note = std::move(

);

SimpleTextGenerator(std::string S) : S(

::move(S)) {}

std::string *Result)

{

llvm::Error::success();

std::string

()

{

(llvm::Twine(

) + S +

).str();

std::make_shared<SimpleTextGenerator>(std::move(S));

transformer::IncludeFormat::Quoted:

transformer::IncludeFormat::Angled:

(

+ Header +

).str();

llvm_unreachable(

);

.Kind = EditKind::AddInclude;

R.

= {{std::move(M), std::move(Edits)}};

std::initializer_list<ASTEdit> Edits) {

<

T>

BindingsMatcher :

ast_matchers::internal::MatcherInterface<T> {

ast_matchers::internal::Matcher<T> InnerMatcher;

ast_matchers::internal::Matcher<T> InnerMatcher)

&

, ast_matchers::internal::ASTMatchFinder *Finder,

ast_matchers::internal::BoundNodesTreeBuilder *Builder)

{

ast_matchers::internal::BoundNodesTreeBuilder Result(*Builder);

(

&N :

.getMap())

Result.setBinding(N.first, N.second);

(InnerMatcher.matches(

, Finder, &Result)) {

*Builder = std::move(Result);

<

T>

DynamicForEachDescendantMatcher

:

ast_matchers::internal::MatcherInterface<T> {

DynTypedMatcher DescendantMatcher;

DynamicForEachDescendantMatcher(DynTypedMatcher DescendantMatcher)

: DescendantMatcher(

::move(DescendantMatcher)) {}

&

, ast_matchers::internal::ASTMatchFinder *Finder,

ast_matchers::internal::BoundNodesTreeBuilder *Builder)

{

Finder->matchesDescendantOf(

, this->DescendantMatcher, Builder,

ast_matchers::internal::ASTMatchFinder::BK_All);

<

T>

ast_matchers::internal::Matcher<T>

ast_matchers::internal::makeMatcher(

BindingsMatcher<T>(

ast_matchers::internal::makeMatcher(

DynamicForEachDescendantMatcher<T>(std::move(M)))));

<

T>

MF->

(forEachDescendantDynamically<T>(

, Matcher),

);

Transformations =

.Cases[I].Edits(Result);

(!Transformations) {

Edits = Transformations.takeError();

Edits->append(Transformations->begin(), Transformations->end());

<

T>

ApplyRuleCallback Callback(std::move(Rule));

Callback.registerMatchers<

>(Result.Nodes, &Finder);

Finder.match(

, *Result.Context);

std::move(Callback.Edits);

llvm::make_error<llvm::StringError>(

llvm::errc::invalid_argument,

+

[NodeId = std::move(NodeId),

Rule = std::move(Rule)](

&Result)

Result.Nodes.getMap();

It = NodesMap.find(NodeId);

(It == NodesMap.end())

llvm::make_error<llvm::StringError>(llvm::errc::invalid_argument,

+ NodeId);

(

&Case : Rule.Cases)

!M.canConvertTo<

>();

std::vector<DynTypedMatcher> Matchers;

Matchers.reserve(Cases.size());

(

&Case : Cases) {

std::string Tag = (TagBase + Twine(Case.first)).str();

DynTypedMatcher BoundMatcher(Case.second.Matcher);

BoundMatcher.setAllowBind(

);

M = *BoundMatcher.tryBind(Tag);

Matchers.push_back(!M.getTraversalKind()

? M.withTraversalKind(DefaultTraversalKind)

(

&Rule : Rules)

R.

.append(Rule.Cases.begin(), Rule.Cases.end());

std::vector<DynTypedMatcher>

(

I = 0, N = Cases.size(); I < N; ++I) {

);

Buckets[Cases[I].Matcher.getSupportedKind()].emplace_back(I, Cases[I]);

std::vector<DynTypedMatcher> Matchers;

(

&Bucket : Buckets) {

DynTypedMatcher M = DynTypedMatcher::constructVariadic(

DynTypedMatcher::VO_AnyOf, Bucket.first,

M.setAllowBind(

);

Matchers.push_back(M.tryBind(

)->withTraversalKind(

));

assert(Ms.size() == 1 &&

);

&NodesMap = Result.Nodes.getMap();

Root = NodesMap.find(

);

assert(Root != NodesMap.end() &&

);

RootRange->getBegin();

Result.SourceManager->getExpansionLoc(

Root->second.getSourceRange().getBegin());

(Rule.Cases.size() == 1)

&NodesMap = Result.Nodes.getMap();

(

i = 0, N = Rule.Cases.size(); i < N; ++i) {

std::string Tag = (

+ Twine(i)).str();

(NodesMap.find(Tag) != NodesMap.end())

llvm_unreachable(

);

BoundNodesTreeBuilder Nodes

llvm::MachO::Target Target

static TextGenerator makeText(std::string S)

llvm::Expected< SmallVector< clang::transformer::Edit, 1 > > rewriteDescendantsImpl(const T &Node, RewriteRule Rule, const MatchResult &Result)

static std::string formatHeaderPath(StringRef Header, IncludeFormat Format)

static Expected< SmallVector< transformer::Edit, 1 > > translateEdits(const MatchResult &Result, ArrayRef< ASTEdit > ASTEdits)

static std::vector< DynTypedMatcher > taggedMatchers(StringRef TagBase, const SmallVectorImpl< std::pair< size_t, RewriteRule::Case > > &Cases, TraversalKind DefaultTraversalKind)

static bool hasValidKind(const DynTypedMatcher &M)

Defines the RewriteRule class and related functions for creating, modifying and interpreting RewriteR...

Defines the clang::SourceLocation class and associated facilities.

StringRef asStringRef() const

String representation of the kind.

static CharSourceRange getCharRange(SourceRange R)

static CharSourceRange getTokenRange(SourceRange R)

Decl - This represents one declaration (or definition), e.g.

A dynamically typed AST node container.

ASTNodeKind getNodeKind() const

const T * get() const

Retrieve the stored node as type T.

A (possibly-)qualified type.

Encodes a location in the source.

SourceLocation getBegin() const

Stmt - This represents one statement.

Base wrapper for a particular "section" of type source info.

Maps string IDs to AST nodes matched by parts of a matcher.

internal::BoundNodesMap::IDToNodeMap IDToNodeMap

Type of mapping from binding identifiers to bound nodes.

Called when the Match registered for it was successfully found in the AST.

virtual void run(const MatchResult &Result)=0

Called on every match by the MatchFinder.

A class to allow finding matches over the Clang AST.

void addMatcher(const DeclarationMatcher &NodeMatch, MatchCallback *Action)

Adds a matcher to execute when running over the AST.

A failable computation over nodes bound by AST matchers, with (limited) reflection via the toString m...

virtual std::string toString() const =0

Constructs a string representation of the computation, for informational purposes.

virtual llvm::Error eval(const ast_matchers::MatchFinder::MatchResult &Match, T *Result) const =0

Evaluates the computation and (potentially) updates the accumulator Result.

const Regex Rule("(.+)/(.+)\\.framework/")

bool matches(const til::SExpr *E1, const til::SExpr *E2)

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,...

RewriteRule makeRule(ast_matchers::internal::DynTypedMatcher M, EditGenerator Edits)

EditGenerator makeEditGenerator(EditGenerator Edits)

SourceLocation getRuleMatchLoc(const ast_matchers::MatchFinder::MatchResult &Result)

Gets the beginning location of the source matched by a rewrite rule.

ast_matchers::internal::DynTypedMatcher buildMatcher(const RewriteRuleBase &Rule)

Builds a single matcher for the rule, covering all of the rule's cases.

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.

std::vector< ast_matchers::internal::DynTypedMatcher > buildMatchers(const RewriteRuleBase &Rule)

Builds a set of matchers that cover the rule.

EditGenerator flattenVector(SmallVector< EditGenerator, 2 > Generators)

Flattens a list of generators into a single generator whose elements are the concatenation of the res...

EditGenerator flatten(Ts &&...Edits)

ASTEdit note(RangeSelector Anchor, TextGenerator Note)

Generates a single, no-op edit with the associated note anchored at the start location of the specifi...

Generator< std::string > TextGenerator

RewriteRule makeRule(ast_matchers::internal::DynTypedMatcher M, EditsT &&Edits)

Constructs a simple RewriteRule.

EditGenerator editList(llvm::SmallVector< ASTEdit, 1 > Edits)

Lifts a list of ASTEdits into an EditGenerator.

MatchConsumer< CharSourceRange > RangeSelector

ASTEdit changeTo(RangeSelector Target, TextGenerator Replacement)

Replaces a portion of the source text with Replacement.

RewriteRuleWith< MetadataT > applyFirst(ArrayRef< RewriteRuleWith< MetadataT > > Rules)

Applies the first rule whose pattern matches; other rules are ignored.

EditGenerator noopEdit(RangeSelector Anchor)

Generates a single, no-op edit anchored at the start location of the specified range.

RangeSelector before(RangeSelector Selector)

Selects the (empty) range [B,B) when Selector selects the range [B,E).

IncludeFormat

Format of the path in an include directive – angle brackets or quotes.

ASTEdit remove(RangeSelector S)

Removes the source selected by S.

MatchConsumer< llvm::SmallVector< Edit, 1 > > EditGenerator

Maps a match result to a list of concrete edits (with possible failure).

ASTEdit addInclude(RangeSelector Target, StringRef Header, IncludeFormat Format=IncludeFormat::Quoted)

Adds an include directive for the given header to the file of Target.

EditGenerator rewriteDescendants(std::string NodeId, RewriteRule Rule)

Applies Rule to all descendants of the node bound to NodeId.

EditGenerator edit(ASTEdit E)

Generates a single (specified) edit.

ASTEdit change(RangeSelector Target, TextGenerator Replacement)

DEPRECATED: use changeTo.

The JSON file list parser is used to communicate input to InstallAPI.

TraversalKind

Defines how we descend a level in the AST when we pass through expressions.

@ TK_AsIs

Will traverse all child nodes.

const FunctionProtoType * T

Contains all information for a given match.

A concrete description of a source edit, represented by a character range in the source to be replace...

Description of a source-code transformation.

SmallVector< Case, 1 > Cases

A source-code transformation with accompanying metadata.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4