| /netbsd-src/external/apache2/llvm/dist/clang/include/clang/Tooling/Syntax/ |
| H A D | Tree.h | 70 class Tree; variable
116 const Tree *getParent() const { return Parent; } in getParent()
117 Tree *getParent() { return Parent; } in getParent()
137 friend class Tree;
147 Tree *Parent;
169 class Tree : public Node {
208 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findFirstLeaf()); in findFirstLeaf()
213 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findLastLeaf()); in findLastLeaf()
237 return const_cast<Node *>(const_cast<const Tree *>(this)->findChild(R)); in findChild()
275 inline bool operator==(const Tree::ConstChildIterator &A,
[all …]
|
| H A D | Nodes.h | 132 class UnqualifiedId final : public Tree {
134 UnqualifiedId() : Tree(NodeKind::UnqualifiedId) {} in UnqualifiedId()
214 class Statement : public Tree {
216 Statement(NodeKind K) : Tree(K) {} in Statement()
359 class Declaration : public Tree {
361 Declaration(NodeKind K) : Tree(K) {} in Declaration()
491 class Declarator : public Tree {
493 Declarator(NodeKind K) : Tree(K) {} in Declarator()
520 class ArraySubscript final : public Tree {
522 ArraySubscript() : Tree(NodeKind::ArraySubscript) {} in ArraySubscript()
[all …]
|
| H A D | Nodes.td | 1 //===- 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 D | Syntax.td | 53 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 {
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 71 NodeId getMapped(const std::unique_ptr<SyntaxTree::Impl> &Tree, in getMapped() argument
73 if (&*Tree == &T1) in getMapped()
75 assert(&*Tree == &T2 && "Invalid tree."); in getMapped()
193 SyntaxTree::Impl &Tree; member
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor()
199 Tree.Nodes.emplace_back(); in PreTraverse()
200 Node &N = Tree.getMutableNode(MyId); in PreTraverse()
207 Node &P = Tree.getMutableNode(Parent); in PreTraverse()
213 return std::make_tuple(MyId, Tree.getNode(MyId).Parent); in PreTraverse()
221 Node &N = Tree.getMutableNode(MyId); in PostTraverse()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/AST/ |
| H A D | ASTDiagnostic.cpp | 919 DiffTree Tree; member in __anon9bd150090111::TemplateDiff
1143 Tree.SetTypeDiff(FromType, ToType, FromDefault, ToDefault); in DiffTypes()
1144 Tree.SetSame(!FromType.isNull() && !ToType.isNull() && in DiffTypes()
1153 Tree.SetTemplateDiff(FromArgTST->getTemplateName().getAsTemplateDecl(), in DiffTypes()
1166 Tree.SetTemplateTemplateDiff(FromDecl, ToDecl, FromIter.isEnd() && FromDecl, in DiffTemplateTemplates()
1168 Tree.SetSame(FromDecl && ToDecl && in DiffTemplateTemplates()
1268 Tree.SetFromDeclarationAndToIntegerDiff( in DiffNonTypes()
1271 Tree.SetSame(false); in DiffNonTypes()
1277 Tree.SetFromIntegerAndToDeclarationDiff( in DiffNonTypes()
1280 Tree.SetSame(false); in DiffNonTypes()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/clang/tools/clang-diff/ |
| H A D | ClangDiff.cpp | 267 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);
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/ |
| H A D | Tree.cpp | 21 if (auto *T = dyn_cast<syntax::Tree>(N)) { in traverse()
70 void syntax::Tree::appendChildLowLevel(Node *Child, NodeRole Role) { in appendChildLowLevel()
78 void syntax::Tree::appendChildLowLevel(Node *Child) { in appendChildLowLevel()
94 void syntax::Tree::prependChildLowLevel(Node *Child, NodeRole Role) { in prependChildLowLevel()
102 void syntax::Tree::prependChildLowLevel(Node *Child) { in prependChildLowLevel()
118 void syntax::Tree::replaceChildRangeLowLevel(Node *Begin, Node *End, in replaceChildRangeLowLevel()
225 const auto *T = cast<syntax::Tree>(N); in dumpNode()
276 const auto *T = dyn_cast<Tree>(this); in assertInvariants()
312 const syntax::Leaf *syntax::Tree::findFirstLeaf() const { in findFirstLeaf()
316 if (const auto *L = cast<syntax::Tree>(C).findFirstLeaf()) in findFirstLeaf()
[all …]
|
| H A D | ComputeReplacements.cpp | 19 void enumerateTokenSpans(const syntax::Tree *Root, ProcessTokensFn Callback) { in enumerateTokenSpans()
25 void run(const syntax::Tree *Root) { in enumerateTokenSpans()
34 if (auto *T = dyn_cast<syntax::Tree>(N)) { in enumerateTokenSpans()
|
| H A D | Synthesis.cpp | 20 static void prependChildLowLevel(syntax::Tree *T, syntax::Node *Child, in prependChildLowLevel()
24 static void appendChildLowLevel(syntax::Tree *T, syntax::Node *Child, in appendChildLowLevel()
63 syntax::Tree *allocateTree(syntax::Arena &A, syntax::NodeKind Kind) { in allocateTree()
197 syntax::Tree *clang::syntax::createTree( in createTree()
218 const auto *T = cast<syntax::Tree>(N); in deepCopyExpandingMacros()
|
| /netbsd-src/external/gpl2/dtc/dist/Documentation/ |
| H A D | dt-object-internal.txt | 1 Device Tree Dynamic Object format internals
4 The Device Tree for most platforms is a static representation of
6 that need to dynamically insert Device Tree fragments into the
9 This document explains the the Device Tree object format and
10 modifications made to the Device Tree compiler, which make it possible.
15 Assume we have a platform which boots using following simplified Device Tree.
35 should result in different Device Tree configuration.
97 2. Device Tree Object Format Requirements
100 Since the Device Tree is used for booting a number of very different hardware
103 2.a) No changes to the Device Tree binary format for the base tree. We cannot
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| H A D | GICombinerEmitter.cpp | 72 const GIMatchTree &Tree; member in __anon31f3a7ff0111::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 …]
|
| /netbsd-src/external/apache2/llvm/dist/clang/utils/TableGen/ |
| H A D | ClangASTNodesEmitter.cpp | 41 ChildMap Tree; member in __anon24f475500111::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()
|
| /netbsd-src/external/bsd/openldap/dist/doc/rfc/ |
| H A D | rfc2294.txt | 14 X.500 Directory Information Tree
31 in the Directory Information Tree [6, 1]. This is useful for a range
60 RFC 2294 Directory Information Tree March 1998
116 RFC 2294 Directory Information Tree March 1998
160 Figure 1: Example O/R Address Tree
172 RFC 2294 Directory Information Tree March 1998
228 RFC 2294 Directory Information Tree March 1998
284 RFC 2294 Directory Information Tree March 1998
340 RFC 2294 Directory Information Tree March 1998
396 RFC 2294 Directory Information Tree March 1998
[all …]
|
| /netbsd-src/sys/external/gpl2/dts/dist/arch/arm/boot/dts/ |
| H A D | armada-xp-crs326-24g-2s.dtsi | 3 * Device Tree file for CRS326-24G-2S board
10 * Note: this Device Tree assumes that the bootloader has remapped the
17 * solution) or the below Device Tree should be adjusted.
|
| H A D | armada-xp-crs328-4c-20s-4s.dtsi | 3 * Device Tree file for CRS328-4C-20S-4S+ board
10 * Note: this Device Tree assumes that the bootloader has remapped the
17 * solution) or the below Device Tree should be adjusted.
|
| H A D | armada-xp-crs305-1g-4s.dtsi | 3 * Device Tree file for CRS305-1G-4S board
10 * Note: this Device Tree assumes that the bootloader has remapped the
17 * solution) or the below Device Tree should be adjusted.
|
| H A D | armada-xp-db-dxbc2.dts | 3 * Device Tree file for DB-DXBC2 board
9 * Note: this Device Tree assumes that the bootloader has remapped the
16 * solution) or the below Device Tree should be adjusted.
|
| H A D | armada-xp-db-xc3-24g4xg.dts | 3 * Device Tree file for DB-XC3-24G4XG board
9 * Note: this Device Tree assumes that the bootloader has remapped the
16 * solution) or the below Device Tree should be adjusted.
|
| H A D | armada-370-rd.dts | 3 * Device Tree file for Marvell Armada 370 Reference Design board
10 * Note: this Device Tree assumes that the bootloader has remapped the
17 * solution) or the below Device Tree should be adjusted.
|
| H A D | armada-370-synology-ds213j.dts | 3 * Device Tree file for Synology DS213j
7 * Note: this Device Tree assumes that the bootloader has remapped the
14 * not be able to directly boot a kernel based on this Device Tree. In
17 * installing it from u-boot prompt) or adjust the Devive Tree
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | gdbhooks.py | 170 class Tree: class
193 return Tree(self.gdbval['decl_minimal']['name'])
199 return Tree(self.gdbval['type_common']['name'])
212 self.node = Tree(gdbval)
247 tree_TYPE_NAME = Tree(self.gdbval['type_common']['name'])
277 tree_decl = Tree(self.gdbval['decl'])
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | gdbhooks.py | 170 class Tree: class
193 return Tree(self.gdbval['decl_minimal']['name'])
199 return Tree(self.gdbval['type_common']['name'])
212 self.node = Tree(gdbval)
247 tree_TYPE_NAME = Tree(self.gdbval['type_common']['name'])
277 tree_decl = Tree(self.gdbval['decl'])
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| H A D | ImmutableMap.h | 195 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} in iterator() argument
325 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} in iterator() argument
|
| /netbsd-src/external/mpl/bind/dist/bin/tests/system/geoip2/data/ |
| H A D | write-test-data.pl | 26 use MaxMind::DB::Writer::Tree 0.100004;
134 my $writer = MaxMind::DB::Writer::Tree->new(
|