| /llvm-project-15.0.7/clang/lib/Tooling/Syntax/ |
| H A D | Nodes.cpp | 241 syntax::Statement *syntax::CaseStatement::getBody() { in getBody()
256 syntax::Leaf *syntax::IfStatement::getIfKeyword() { in getIfKeyword()
266 syntax::Leaf *syntax::IfStatement::getElseKeyword() { in getElseKeyword()
275 syntax::Leaf *syntax::ForStatement::getForKeyword() { in getForKeyword()
280 syntax::Statement *syntax::ForStatement::getBody() { in getBody()
290 syntax::Statement *syntax::WhileStatement::getBody() { in getBody()
330 syntax::Leaf *syntax::CompoundStatement::getLbrace() { in getLbrace()
390 syntax::Leaf *syntax::ParenDeclarator::getLparen() { in getLparen()
394 syntax::Leaf *syntax::ParenDeclarator::getRparen() { in getRparen()
398 syntax::Leaf *syntax::ArraySubscript::getLbracket() { in getLbracket()
[all …]
|
| H A D | Synthesis.cpp | 22 static void prependChildLowLevel(syntax::Tree *T, syntax::Node *Child, in prependChildLowLevel()
26 static void appendChildLowLevel(syntax::Tree *T, syntax::Node *Child, in appendChildLowLevel()
40 syntax::Leaf *clang::syntax::createLeaf(syntax::Arena &A, in createLeaf()
57 syntax::Leaf *clang::syntax::createLeaf(syntax::Arena &A, in createLeaf()
70 syntax::Tree *allocateTree(syntax::Arena &A, syntax::NodeKind Kind) { in allocateTree()
204 syntax::Tree *clang::syntax::createTree( in createTree()
205 syntax::Arena &A, in createTree()
206 ArrayRef<std::pair<syntax::Node *, syntax::NodeRole>> Children, in createTree()
217 syntax::Node *clang::syntax::deepCopyExpandingMacros(syntax::Arena &A, in deepCopyExpandingMacros()
227 std::vector<std::pair<syntax::Node *, syntax::NodeRole>> Children; in deepCopyExpandingMacros()
[all …]
|
| H A D | BuildTree.cpp | 396 void foldNode(llvm::ArrayRef<syntax::Token> Range, syntax::Tree *New, in foldNode()
406 void foldList(ArrayRef<syntax::Token> SuperRange, syntax::List *New, in foldList()
571 Forest(syntax::Arena &A, const syntax::TokenBuffer &TB) { in Forest()
585 void assignRole(ArrayRef<syntax::Token> Range, syntax::NodeRole Role) { in assignRole()
600 ArrayRef<syntax::Token> shrinkToFitList(ArrayRef<syntax::Token> Range) { in shrinkToFitList()
629 ArrayRef<syntax::Token> Tokens, syntax::Tree *Node) { in foldChildren()
688 std::map<const syntax::Token *, syntax::Node *> Trees;
1652 ArrayRef<syntax::Token> Range, const syntax::Token *ExternKW, in foldExplicitTemplateInstantiation()
1665 ArrayRef<syntax::Token> Range, const syntax::Token *TemplateKW, in foldTemplateDeclaration()
1700 void syntax::TreeBuilder::markChild(syntax::Node *N, NodeRole R) { in markChild()
[all …]
|
| H A D | Tree.cpp | 27 static void traverse(syntax::Node *N, in traverse()
29 traverse(static_cast<const syntax::Node *>(N), [&](const syntax::Node *N) { in traverse()
35 syntax::Leaf::Leaf(syntax::TokenManager::Key K) : Node(NodeKind::Leaf), K(K) {} in Leaf()
37 syntax::Node::Node(NodeKind Kind) in Node()
44 bool syntax::Node::isDetached() const { in isDetached()
283 const syntax::Leaf *syntax::Tree::findFirstLeaf() const { in findFirstLeaf()
293 const syntax::Leaf *syntax::Tree::findLastLeaf() const { in findLastLeaf()
303 const syntax::Node *syntax::Tree::findChild(NodeRole R) const { in findChild()
311 std::vector<syntax::List::ElementAndDelimiter<syntax::Node>>
357 std::vector<syntax::Node *> syntax::List::getElementsAsNodes() { in getElementsAsNodes()
[all …]
|
| H A D | ComputeReplacements.cpp | 21 void enumerateTokenSpans(const syntax::Tree *Root, in enumerateTokenSpans()
25 Enumerator(const syntax::TokenBufferTokenManager &STM, in enumerateTokenSpans()
30 void run(const syntax::Tree *Root) { in enumerateTokenSpans()
38 void process(const syntax::Node *N) { in enumerateTokenSpans()
39 if (auto *T = dyn_cast<syntax::Tree>(N)) { in enumerateTokenSpans()
46 auto *L = cast<syntax::Leaf>(N); in enumerateTokenSpans()
62 const syntax::TokenBufferTokenManager &STM; in enumerateTokenSpans()
63 const syntax::Token *SpanBegin; in enumerateTokenSpans()
64 const syntax::Token *SpanEnd; in enumerateTokenSpans()
72 syntax::FileRange rangeOfExpanded(const syntax::TokenBufferTokenManager &STM, in rangeOfExpanded()
[all …]
|
| H A D | Tokens.cpp | 36 using namespace clang::syntax;
40 llvm::ArrayRef<syntax::Token>
45 const syntax::Token *Begin = in getTokensCovering()
49 const syntax::Token *End = in getTokensCovering()
570 llvm::ArrayRef<syntax::Token>
584 llvm::ArrayRef<syntax::Token>
591 const syntax::Token *
601 const syntax::Token *
608 std::vector<const syntax::Token *>
623 std::vector<syntax::Token> syntax::tokenize(const FileRange &FR, in tokenize()
[all …]
|
| H A D | Mutations.cpp | 28 class syntax::MutationsImpl {
31 static void addAfter(syntax::Node *Anchor, syntax::Node *New, NodeRole Role) { in addAfter()
49 static void replace(syntax::Node *Old, syntax::Node *New) { in replace()
66 static void remove(syntax::Node *N) { in remove()
80 void syntax::removeStatement(syntax::Arena &A, TokenBufferTokenManager &TBTM, in removeStatement()
81 syntax::Statement *S) { in removeStatement()
|
| H A D | TokenBufferTokenManager.cpp | 12 namespace syntax { namespace
13 constexpr llvm::StringLiteral syntax::TokenBufferTokenManager::Kind;
15 std::pair<FileID, ArrayRef<syntax::Token>>
16 syntax::TokenBufferTokenManager::lexBuffer( in lexBuffer()
|
| /llvm-project-15.0.7/clang/unittests/Tooling/Syntax/ |
| H A D | TreeTestBase.cpp | 35 using namespace clang::syntax;
38 ArrayRef<syntax::Token> tokens(syntax::Node *N, in tokens()
41 if (auto *L = dyn_cast<syntax::Leaf>(N)) in tokens()
43 auto *T = cast<syntax::Tree>(N); in tokens()
66 syntax::TranslationUnit *
91 syntax::TranslationUnit *&Root; in buildTree()
94 std::unique_ptr<syntax::Arena> &Arena; in buildTree()
116 syntax::TranslationUnit *&Root; in buildTree()
119 std::unique_ptr<syntax::Arena> &Arena; in buildTree()
157 syntax::TranslationUnit *Root = nullptr; in buildTree()
[all …]
|
| H A D | TreeTest.cpp | 18 using namespace clang::syntax;
32 return clang::syntax::createTree(*Arena, ChildrenWithRoles, in createTree()
134 auto *Tree = syntax::createTree(*Arena, in TEST_F()
233 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P()
254 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P()
274 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P()
294 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P()
317 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P()
342 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P()
366 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P()
[all …]
|
| H A D | TreeTestBase.h | 30 namespace syntax {
40 syntax::Node *nodeByRange(llvm::Annotations::Range R, syntax::Node *Root);
54 std::unique_ptr<syntax::TokenBuffer> TB;
55 std::unique_ptr<syntax::TokenBufferTokenManager> TM;
56 std::unique_ptr<syntax::Arena> Arena;
|
| H A D | MutationsTest.cpp | 18 using namespace clang::syntax;
33 auto Replacements = syntax::computeReplacements(*TM, *Root); in CheckTransformation()
48 auto *S = cast<syntax::Statement>(nodeByRange(Input.range(), Root)); in __anona969432b0202()
50 syntax::removeStatement(*Arena, *TM, S); in __anona969432b0202()
|
| /llvm-project-15.0.7/clang/include/clang/Tooling/Syntax/ |
| H A D | BuildTree.h | 20 namespace syntax {
25 syntax::TranslationUnit *
33 syntax::Leaf *createLeaf(syntax::Arena &A, TokenBufferTokenManager &TBTM,
38 syntax::Leaf *createLeaf(syntax::Arena &A, TokenBufferTokenManager &TBTM,
44 syntax::Tree *
45 createTree(syntax::Arena &A,
46 ArrayRef<std::pair<syntax::Node *, syntax::NodeRole>> Children,
47 syntax::NodeKind K);
50 syntax::EmptyStatement *createEmptyStatement(syntax::Arena &A,
59 syntax::Node *deepCopyExpandingMacros(syntax::Arena &A,
[all …]
|
| H A D | Tokens.h | 47 namespace syntax {
275 llvm::ArrayRef<syntax::Token> Spelled;
276 llvm::ArrayRef<syntax::Token> Expanded;
343 std::vector<syntax::Token> SpelledTokens;
373 std::vector<syntax::Token> ExpandedTokens;
384 llvm::ArrayRef<syntax::Token>
386 llvm::ArrayRef<syntax::Token>
391 const syntax::Token *
394 const syntax::Token *
412 std::vector<syntax::Token>
[all …]
|
| H A D | Mutations.h | 20 namespace syntax {
25 const syntax::TranslationUnit &TU);
33 void removeStatement(syntax::Arena &A, TokenBufferTokenManager &TBTM,
34 syntax::Statement *S);
|
| /llvm-project-15.0.7/llvm/utils/vim/syntax/ |
| H A D | mir.vim | 1 " Vim syntax file
7 syntax clear
14 " MIR is embedded in a yaml container, so we load all of the yaml syntax.
15 runtime! syntax/yaml.vim
20 syntax include @LLVM syntax/llvm.vim
22 syntax region llvm start=/\(^---\s*|\)\@<=/ end=/\(^\.\.\.\)\@=/ contains=@LLVM
25 syntax include @MIR syntax/machine-ir.vim
26 syntax region mir start=/\(^body:\s*|\)\@<=/ end=/\(^[^[:space:]]\)\@=/ contains=@MIR
|
| /llvm-project-15.0.7/clang-tools-extra/clangd/ |
| H A D | SemanticSelection.cpp | 60 extractFoldingRange(const syntax::Node *Node, in extractFoldingRange()
61 const syntax::TokenBufferTokenManager &TM) { in extractFoldingRange()
63 const auto *LBrace = cast_or_null<syntax::Leaf>( in extractFoldingRange()
64 Stmt->findChild(syntax::NodeRole::OpenParen)); in extractFoldingRange()
68 const auto *RBrace = cast_or_null<syntax::Leaf>( in extractFoldingRange()
69 Stmt->findChild(syntax::NodeRole::CloseParen)); in extractFoldingRange()
89 collectFoldingRanges(const syntax::Node *Root, in collectFoldingRanges()
91 std::queue<const syntax::Node *> Nodes; in collectFoldingRanges()
95 const syntax::Node *Node = Nodes.front(); in collectFoldingRanges()
100 if (const auto *T = dyn_cast<syntax::Tree>(Node)) in collectFoldingRanges()
[all …]
|
| H A D | Selection.cpp | 193 bool shouldIgnore(const syntax::Token &Tok) { in shouldIgnore()
256 const syntax::Token *SelFirst = in SelectionTester()
267 for (const syntax::TokenBuffer::Expansion &X : in SelectionTester()
270 for (const syntax::Token &Tok : X.Spelled) { in SelectionTester()
366 llvm::ArrayRef<syntax::Token>
390 const syntax::Token *Start = llvm::partition_point( in computeMaybeSelectedExpandedTokens()
404 const syntax::Token *End = std::partition_point( in computeMaybeSelectedExpandedTokens()
536 llvm::ArrayRef<syntax::Token> MaybeSelectedExpanded;
959 const syntax::TokenBuffer &TokenBuf;
962 IntervalSet<syntax::Token> UnclaimedExpandedTokens;
[all …]
|
| /llvm-project-15.0.7/clang-tools-extra/clangd/refactor/tweaks/ |
| H A D | ExpandMacro.cpp | 43 syntax::TokenBuffer::Expansion Expansion;
50 static const syntax::Token * in REGISTER_TWEAK()
52 llvm::ArrayRef<syntax::Token> Spelled, in REGISTER_TWEAK()
55 auto *It = llvm::partition_point(Spelled, [&](const syntax::Token &T) { in REGISTER_TWEAK()
66 static const syntax::Token *
67 findIdentifierUnderCursor(const syntax::TokenBuffer &Tokens, in findIdentifierUnderCursor()
112 for (const syntax::Token &T : Expansion.Expanded) { in apply()
|
| /llvm-project-15.0.7/llvm/docs/AMDGPU/ |
| H A D | gfx1013_vaddr_cdc744.rst | 15 …y be specified using either :ref:`standard VGPR syntax<amdgpu_synid_v>` or special :ref:`NSA VGPR …
17 *Size:* 1-13 dwords. Actual size depends on syntax, opcode, :ref:`dim<amdgpu_synid_dim>` and :ref:`…
19 * If specified using :ref:`NSA VGPR syntax<amdgpu_synid_nsa>`, the size is 1-13 dwords.
20 * If specified using :ref:`standard VGPR syntax<amdgpu_synid_v>`, the size is 1-8 dwords. Opcodes w…
|
| H A D | gfx1030_vaddr_cdc744.rst | 15 …y be specified using either :ref:`standard VGPR syntax<amdgpu_synid_v>` or special :ref:`NSA VGPR …
17 *Size:* 1-13 dwords. Actual size depends on syntax, opcode, :ref:`dim<amdgpu_synid_dim>` and :ref:`…
19 * If specified using :ref:`NSA VGPR syntax<amdgpu_synid_nsa>`, the size is 1-13 dwords.
20 * If specified using :ref:`standard VGPR syntax<amdgpu_synid_v>`, the size is 1-8 dwords. Opcodes w…
|
| H A D | gfx10_vaddr_cdc744.rst | 15 …y be specified using either :ref:`standard VGPR syntax<amdgpu_synid_v>` or special :ref:`NSA VGPR …
17 *Size:* 1-13 dwords. Actual size depends on syntax, opcode, :ref:`dim<amdgpu_synid_dim>` and :ref:`…
19 * If specified using :ref:`NSA VGPR syntax<amdgpu_synid_nsa>`, the size is 1-13 dwords.
20 * If specified using :ref:`standard VGPR syntax<amdgpu_synid_v>`, the size is 1-8 dwords. Opcodes w…
|
| /llvm-project-15.0.7/llvm/docs/HistoricalNotes/ |
| H A D | 2001-02-06-TypeNotationDebateResp1.txt | 13 and him that the C declarator syntax is difficult and confusing.
16 conclusion I do: that you have to go with familiar syntax over logical
17 syntax because familiarity is such a strong force:
32 particular problem is inherently difficult. Your syntax for the above
34 thinking about it. Honestly, I don't find it much easier than the C syntax.
39 the old array syntax:
42 introduce, no matter how logical it is. Introducing a new syntax that may
50 The syntax programmers are used to out of years of experience or a new
51 syntax that they have never seen that has a more logical structure. I think
57 P.S. Also, while I agree that most your syntax is more logical, there is
|
| H A D | 2001-02-06-TypeNotationDebateResp4.txt | 2 > conclusion I do: that you have to go with familiar syntax over logical
3 > syntax because familiarity is such a strong force:
13 that a new person would have to learn the new, different, syntax
25 > particular problem is inherently difficult. Your syntax for the above
27 > thinking about it. Honestly, I don't find it much easier than the C syntax.
35 declare these pointers, and the syntax is inconsistent with the method
36 declaration and calling syntax.
45 > And the old array syntax:
50 Erm... excuse me but how is this the "old array syntax"? If you are
63 > Introducing a new syntax that may
[all …]
|
| /llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/readability/ |
| H A D | misplaced-array-index.rst | 6 This check warns for unusual array index syntax.
8 The following code has unusual array index syntax:
24 The check warns about such unusual syntax for readability reasons:
25 * There are programmers that are not familiar with this unusual syntax.
|