Home
last modified time | relevance | path

Searched refs:Tree (Results 1 – 25 of 85) sorted by relevance

1234

/openbsd-src/gnu/llvm/clang/include/clang/Tooling/Syntax/
H A DTree.h44 class Tree; variable
90 const Tree *getParent() const { return Parent; } in getParent()
91 Tree *getParent() { return Parent; } in getParent()
111 friend class Tree;
121 Tree *Parent;
144 class Tree : public Node {
186 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findFirstLeaf()); in findFirstLeaf()
191 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findLastLeaf()); in findLastLeaf()
215 return const_cast<Node *>(const_cast<const Tree *>(this)->findChild(R)); in findChild()
254 class List : public Tree {
[all …]
H A DNodes.h127 class UnqualifiedId final : public Tree {
129 UnqualifiedId() : Tree(NodeKind::UnqualifiedId) {} in UnqualifiedId()
209 class Statement : public Tree {
211 Statement(NodeKind K) : Tree(K) {} in Statement()
354 class Declaration : public Tree {
356 Declaration(NodeKind K) : Tree(K) {} in Declaration()
486 class Declarator : public Tree {
488 Declarator(NodeKind K) : Tree(K) {} in Declarator()
515 class ArraySubscript final : public Tree {
517 ArraySubscript() : Tree(NodeKind::ArraySubscript) {} in ArraySubscript()
[all …]
H A DNodes.td1 //===- Nodes.td - Node types in the Syntax Tree grammar -------------------===//
26 def UnqualifiedId : External<Tree> {}
29 def List : External<Tree> {}
42 def UnaryOperatorExpression : External<Tree> {}
221 def Statement : External<Tree> {}
239 def Declaration : External<Tree> {}
254 def Declarator : External<Tree> {}
258 def ArraySubscript : External<Tree> {}
259 def TrailingReturnType : External<Tree> {}
260 def ParametersAndQualifiers : External<Tree> {}
[all …]
H A DSyntax.td53 def Tree : External<Node> {}
60 class Alternatives<NodeType base_ = Tree> : NodeType { let base = base_; }
64 class Unconstrained<NodeType base_ = Tree> : NodeType { let base = base_; }
79 class Sequence<NodeType base_ = Tree> : NodeType {
H A DBuildTree.h44 syntax::Tree *
/openbsd-src/gnu/llvm/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp72 NodeId getMapped(const std::unique_ptr<SyntaxTree::Impl> &Tree, in getMapped() argument
74 if (&*Tree == &T1) in getMapped()
76 assert(&*Tree == &T2 && "Invalid tree."); in getMapped()
192 SyntaxTree::Impl &Tree; member
194 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor()
198 Tree.Nodes.emplace_back(); in PreTraverse()
199 Node &N = Tree.getMutableNode(MyId); in PreTraverse()
206 Node &P = Tree.getMutableNode(Parent); in PreTraverse()
212 return std::make_tuple(MyId, Tree.getNode(MyId).Parent); in PreTraverse()
220 Node &N = Tree.getMutableNode(MyId); in PostTraverse()
[all …]
/openbsd-src/gnu/llvm/clang/lib/AST/
H A DASTDiagnostic.cpp951 DiffTree Tree; member in __anonb797b9d50111::TemplateDiff
1178 Tree.SetTypeDiff(FromType, ToType, FromDefault, ToDefault); in DiffTypes()
1179 Tree.SetSame(!FromType.isNull() && !ToType.isNull() && in DiffTypes()
1188 Tree.SetTemplateDiff(FromArgTST->getTemplateName().getAsTemplateDecl(), in DiffTypes()
1201 Tree.SetTemplateTemplateDiff(FromDecl, ToDecl, FromIter.isEnd() && FromDecl, in DiffTemplateTemplates()
1203 Tree.SetSame(FromDecl && ToDecl && in DiffTemplateTemplates()
1303 Tree.SetFromDeclarationAndToIntegerDiff( in DiffNonTypes()
1306 Tree.SetSame(false); in DiffNonTypes()
1312 Tree.SetFromIntegerAndToDeclarationDiff( in DiffNonTypes()
1315 Tree.SetSame(false); in DiffNonTypes()
[all …]
/openbsd-src/gnu/llvm/clang/tools/clang-diff/
H A DClangDiff.cpp267 diff::SyntaxTree &Tree, bool IsLeft, in printHtmlForNode() argument
269 const diff::Node &Node = Tree.getNode(Id); in printHtmlForNode()
272 diff::NodeId TargetId = Diff.getMapped(Tree, Id); in printHtmlForNode()
285 std::tie(Begin, End) = Tree.getSourceRangeOffsets(Node); in printHtmlForNode()
286 const SourceManager &SrcMgr = Tree.getASTContext().getSourceManager(); in printHtmlForNode()
295 std::string Value = Tree.getNodeValue(Node); in printHtmlForNode()
306 Offset = printHtmlForNode(OS, Diff, Tree, IsLeft, Child, Offset); in printHtmlForNode()
310 if (Id == Tree.getRootId()) { in printHtmlForNode()
344 static void printNodeAttributes(raw_ostream &OS, diff::SyntaxTree &Tree, argument
346 const diff::Node &N = Tree.getNode(Id);
/openbsd-src/gnu/llvm/clang/lib/Tooling/Syntax/
H A DTree.cpp21 if (auto *T = dyn_cast<syntax::Tree>(N)) { in traverse()
52 void syntax::Tree::appendChildLowLevel(Node *Child, NodeRole Role) { in appendChildLowLevel()
60 void syntax::Tree::appendChildLowLevel(Node *Child) { in appendChildLowLevel()
76 void syntax::Tree::prependChildLowLevel(Node *Child, NodeRole Role) { in prependChildLowLevel()
84 void syntax::Tree::prependChildLowLevel(Node *Child) { in prependChildLowLevel()
100 void syntax::Tree::replaceChildRangeLowLevel(Node *Begin, Node *End, in replaceChildRangeLowLevel()
195 const auto *T = cast<syntax::Tree>(N); in dumpNode()
246 const auto *T = dyn_cast<Tree>(this); in assertInvariants()
283 const syntax::Leaf *syntax::Tree::findFirstLeaf() const { in findFirstLeaf()
287 if (const auto *L = cast<syntax::Tree>(C).findFirstLeaf()) in findFirstLeaf()
[all …]
H A DComputeReplacements.cpp21 void enumerateTokenSpans(const syntax::Tree *Root, in enumerateTokenSpans()
30 void run(const syntax::Tree *Root) { in enumerateTokenSpans()
39 if (auto *T = dyn_cast<syntax::Tree>(N)) { in enumerateTokenSpans()
H A DSynthesis.cpp22 static void prependChildLowLevel(syntax::Tree *T, syntax::Node *Child, in prependChildLowLevel()
26 static void appendChildLowLevel(syntax::Tree *T, syntax::Node *Child, in appendChildLowLevel()
70 syntax::Tree *allocateTree(syntax::Arena &A, syntax::NodeKind Kind) { in allocateTree()
204 syntax::Tree *clang::syntax::createTree( in createTree()
226 const auto *T = cast<syntax::Tree>(N); in deepCopyExpandingMacros()
H A DCMakeLists.txt11 Tree.cpp
H A DBuildTree.cpp322 void add(ASTPtr From, syntax::Tree *To) { in add()
331 void add(NestedNameSpecifierLoc From, syntax::Tree *To) { in add()
340 syntax::Tree *find(ASTPtr P) const { return Nodes.lookup(P); } in find()
342 syntax::Tree *find(NestedNameSpecifierLoc P) const { in find()
347 llvm::DenseMap<ASTPtr, syntax::Tree *> Nodes;
348 llvm::DenseMap<NestedNameSpecifierLoc, syntax::Tree *> NNSNodes;
384 void foldNode(ArrayRef<syntax::Token> Range, syntax::Tree *New, ASTPtr From) { in foldNode()
391 void foldNode(ArrayRef<syntax::Token> Range, syntax::Tree *New, TypeLoc L) { in foldNode()
396 void foldNode(llvm::ArrayRef<syntax::Token> Range, syntax::Tree *New, in foldNode()
629 ArrayRef<syntax::Token> Tokens, syntax::Tree *Node) { in foldChildren()
[all …]
/openbsd-src/gnu/llvm/llvm/utils/TableGen/
H A DGICombinerEmitter.cpp72 const GIMatchTree &Tree; member in __anon8971c0cb0111::format_partition_name
76 format_partition_name(const GIMatchTree &Tree, unsigned Idx) in format_partition_name() argument
77 : Tree(Tree), Idx(Idx) {} in format_partition_name()
79 Tree.getPartitioner()->emitPartitionName(OS, Idx); in print()
618 void generateCodeForTree(raw_ostream &OS, const GIMatchTree &Tree,
721 const GIMatchTree &Tree, in generateCodeForTree() argument
723 if (Tree.getPartitioner() != nullptr) { in generateCodeForTree()
724 Tree.getPartitioner()->generatePartitionSelectorCode(OS, Indent); in generateCodeForTree()
725 for (const auto &EnumChildren : enumerate(Tree.children())) { in generateCodeForTree()
727 << format_partition_name(Tree, EnumChildren.index()) << " */) {\n"; in generateCodeForTree()
[all …]
/openbsd-src/gnu/llvm/clang/utils/TableGen/
H A DClangASTNodesEmitter.cpp41 ChildMap Tree; member in __anoncc2a141c0111::ClangASTNodesEmitter
91 ChildIterator i = Tree.lower_bound(Base), e = Tree.upper_bound(Base); in EmitNode()
155 Tree.insert(std::make_pair(B, R)); in deriveChildTree()
/openbsd-src/share/snmp/
H A DBRIDGE-MIB.txt63 Spanning Tree Protocol (RSTP)."
79 "The Bridge-Identifier, as used in the Spanning Tree
92 "A Spanning Tree Protocol (STP) timer in units of 1/100
94 values of timers used by the Spanning Tree Protocol.
98 These timers, when stored in a Spanning Tree Protocol's
176 which is used in the Spanning Tree Protocol."
314 -- implemented by those bridges that support the Spanning Tree
327 "An indication of what version of the Spanning Tree
329 indicates the DEC LANbridge 100 Spanning Tree protocol.
331 If future versions of the IEEE Spanning Tree Protocol
[all …]
/openbsd-src/gnu/llvm/llvm/utils/UnicodeData/
H A DUnicodeNameMappingGenerator.cpp379 const std::vector<uint8_t> &Tree = Data.second; in main() local
416 Tree.size() + 1); in main()
418 for (auto Byte : Tree) { in main()
426 Tree.size() + 1); in main()
433 argv[3], NameCount, Tree.size() / 1024.0, Dict.size() / 1024.0); in main()
/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DImmutableMap.h159 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} in iterator() argument
289 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} in iterator() argument
H A DImmutableSet.h350 static void retain(ImutAVLTree<ImutInfo> *Tree) { Tree->retain(); }
351 static void release(ImutAVLTree<ImutInfo> *Tree) { Tree->release(); }
822 explicit ImutAVLValueIterator(typename T::TreeTy *Tree)
823 : ImutAVLValueIterator::iterator_adaptor_base(Tree) {}
/openbsd-src/gnu/llvm/llvm/utils/gn/secondary/clang/lib/Tooling/Syntax/
H A DBUILD.gn20 "Tree.cpp",
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DInlineSizeEstimatorAnalysis.cpp143 const DominatorTree &Tree) { in getMaxDominatorTreeDepth() argument
146 if (const auto *TN = Tree.getNode(&BB)) in getMaxDominatorTreeDepth()
/openbsd-src/usr.bin/file/magdir/
H A Dcommunications6 # TTCN is the Tree and Tabular Combined Notation described in ISO 9646-3.
/openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DAMDGPUMachineCFGStructurizer.cpp528 void addChild(MRT *Tree) { Children.insert(Tree); } in addChild() argument
553 MRT *Tree = Children.back(); in getEntry() local
554 return (Tree->isRegion()) ? Tree->getRegionMRT()->getEntry() in getEntry()
555 : Tree->getMBBMRT()->getMBB(); in getEntry()
559 MRT *Tree = Children.front(); in getExit() local
560 return (Tree->isRegion()) ? Tree->getRegionMRT()->getExit() in getExit()
561 : Tree->getMBBMRT()->getMBB(); in getExit()
2550 static bool containsNewBackedge(MRT *Tree, in containsNewBackedge() argument
2553 if (Tree == nullptr) in containsNewBackedge()
2556 if (Tree->isMBB()) { in containsNewBackedge()
[all …]
/openbsd-src/gnu/llvm/clang/lib/Basic/
H A DDiagnostic.cpp874 SmallString<64> Tree; in FormatDiagnostic() local
1085 if (getDiags()->PrintTemplateTree && Tree.empty()) { in FormatDiagnostic()
1092 Tree, QualTypeVals); in FormatDiagnostic()
1094 if (!Tree.empty()) { in FormatDiagnostic()
1153 OutStr.append(Tree.begin(), Tree.end()); in FormatDiagnostic()
/openbsd-src/gnu/llvm/llvm/include/llvm/MC/
H A DMCPseudoProbe.h178 uint8_t At, MCDecodedPseudoProbeInlineTree *Tree) in MCDecodedPseudoProbe() argument
180 InlineTree(Tree){}; in MCDecodedPseudoProbe()

1234