| /minix3/external/bsd/llvm/dist/clang/lib/AST/ |
| H A D | ASTDiagnostic.cpp | 736 DiffTree Tree; member in __anon265222710111::TemplateDiff
883 Tree.SetNode(FromType, ToType); in DiffTypes()
884 Tree.SetDefault(FromIter.isEnd() && !FromType.isNull(), in DiffTypes()
886 Tree.SetKind(DiffTree::Type); in DiffTypes()
891 Tree.SetSame(true); in DiffTypes()
912 Tree.SetNode(FromArgTST->getTemplateName().getAsTemplateDecl(), in DiffTypes()
914 Tree.SetNode(FromQual, ToQual); in DiffTypes()
915 Tree.SetKind(DiffTree::Template); in DiffTypes()
927 Tree.SetNode(FromDecl, ToDecl); in DiffTemplateTemplates()
928 Tree.SetSame(FromDecl && ToDecl && in DiffTemplateTemplates()
[all …]
|
| /minix3/external/bsd/llvm/dist/clang/utils/TableGen/ |
| H A D | ClangASTNodesEmitter.cpp | 53 std::pair<Record *, Record *> EmitNode (const ChildMap &Tree, raw_ostream& OS,
73 const ChildMap &Tree, in EmitNode() argument
78 ChildIterator i = Tree.lower_bound(Base), e = Tree.upper_bound(Base); in EmitNode()
103 if (Tree.find(R) != Tree.end()) { in EmitNode()
105 = EmitNode(Tree, OS, R); in EmitNode()
158 ChildMap Tree; in run() local
164 Tree.insert(std::make_pair(R->getValueAsDef("Base"), R)); in run()
166 Tree.insert(std::make_pair(&Root, R)); in run()
169 EmitNode(Tree, OS, &Root); in run()
|
| /minix3/external/bsd/llvm/dist/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
| H A D | ast.ml | 2 * Abstract Syntax Tree (aka Parse Tree)
|
| /minix3/external/bsd/llvm/dist/llvm/examples/OCaml-Kaleidoscope/Chapter2/ |
| H A D | ast.ml | 2 * Abstract Syntax Tree (aka Parse Tree)
|
| /minix3/external/bsd/llvm/dist/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
| H A D | ast.ml | 2 * Abstract Syntax Tree (aka Parse Tree)
|
| /minix3/external/bsd/llvm/dist/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
| H A D | ast.ml | 2 * Abstract Syntax Tree (aka Parse Tree)
|
| /minix3/external/bsd/llvm/dist/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
| H A D | ast.ml | 2 * Abstract Syntax Tree (aka Parse Tree)
|
| /minix3/external/bsd/llvm/dist/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
| H A D | ast.ml | 2 * Abstract Syntax Tree (aka Parse Tree)
|
| /minix3/external/bsd/llvm/dist/llvm/test/Analysis/Dominators/ |
| H A D | basic.ll | 5 ; CHECK-OLDPM-LABEL: 'Dominator Tree Construction' for function 'test1':
34 ; CHECK-OLDPM-LABEL: 'Dominator Tree Construction' for function 'test2':
|
| /minix3/external/mit/xorg/lib/libXaw/ |
| H A D | Makefile | 28 TextTr.c Tip.c Toggle.c Tree.c Vendor.c Viewport.c \
47 Tip.h TipP.h Toggle.h ToggleP.h Tree.h TreeP.h VendorEP.h \
|
| /minix3/external/bsd/file/dist/magic/magdir/ |
| H A D | communications | 6 # TTCN is the Tree and Tabular Combined Notation described in ISO 9646-3.
|
| /minix3/external/mit/xorg/lib/libXaw6/ |
| H A D | Makefile | 19 TextSrc.c TextTr.c Toggle.c Tree.c Vendor.c Viewport.c \
|
| /minix3/external/bsd/llvm/dist/clang/lib/Basic/ |
| H A D | Diagnostic.cpp | 656 SmallVector<char, 64> Tree; in FormatDiagnostic() local
863 if (getDiags()->PrintTemplateTree && Tree.empty()) { in FormatDiagnostic()
870 Tree, QualTypeVals); in FormatDiagnostic()
872 if (!Tree.empty()) { in FormatDiagnostic()
931 OutStr.append(Tree.begin(), Tree.end()); in FormatDiagnostic()
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | Reassociate.cpp | 1116 SmallVector<RepeatedValue, 8> Tree; in RemoveFactorFromExpression() local
1117 MadeChange |= LinearizeExprTree(BO, Tree); in RemoveFactorFromExpression()
1119 Factors.reserve(Tree.size()); in RemoveFactorFromExpression()
1120 for (unsigned i = 0, e = Tree.size(); i != e; ++i) { in RemoveFactorFromExpression()
1121 RepeatedValue E = Tree[i]; in RemoveFactorFromExpression()
2175 SmallVector<RepeatedValue, 8> Tree; in ReassociateExpression() local
2176 MadeChange |= LinearizeExprTree(I, Tree); in ReassociateExpression()
2178 Ops.reserve(Tree.size()); in ReassociateExpression()
2179 for (unsigned i = 0, e = Tree.size(); i != e; ++i) { in ReassociateExpression()
2180 RepeatedValue E = Tree[i]; in ReassociateExpression()
|
| /minix3/external/bsd/bind/dist/doc/misc/ |
| H A D | roadmap | 7 Road Map to the BIND 9 Source Tree
|
| /minix3/external/bsd/llvm/dist/llvm/utils/TableGen/ |
| H A D | CodeGenDAGPatterns.cpp | 1102 DagInit *Tree = Operator->getValueAsDag("Fragment"); in GetNumNodeResults() local
1104 if (Tree) in GetNumNodeResults()
1105 if (DefInit *DI = dyn_cast<DefInit>(Tree->getOperator())) in GetNumNodeResults()
2340 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment"); in ParsePatternFragments() local
2343 Fragments[i], Tree, !Fragments[i]->isSubClassOf("OutPatFrag"), in ParsePatternFragments()
2783 getInstructionsInTree(TreePatternNode *Tree, SmallVectorImpl<Record*> &Instrs) { in getInstructionsInTree() argument
2784 if (Tree->isLeaf()) in getInstructionsInTree()
2786 if (Tree->getOperator()->isSubClassOf("Instruction")) in getInstructionsInTree()
2787 Instrs.push_back(Tree->getOperator()); in getInstructionsInTree()
2788 for (unsigned i = 0, e = Tree->getNumChildren(); i != e; ++i) in getInstructionsInTree()
[all …]
|
| /minix3/external/bsd/llvm/dist/llvm/docs/HistoricalNotes/ |
| H A D | 2001-06-01-GCCOptimizations.txt | 51 I'm continuing to look at the Tree -> RTL code. It is pretty gross
|
| /minix3/external/bsd/llvm/dist/clang/docs/ |
| H A D | JSONCompilationDatabase.rst | 11 Tools based on the C++ Abstract Syntax Tree need full information how to
|
| /minix3/external/bsd/llvm/dist/llvm/docs/tutorial/ |
| H A D | OCamlLangImpl2.rst | 17 Tree <http://en.wikipedia.org/wiki/Abstract_syntax_tree>`_ (AST).
25 talk about the output of the parser: the Abstract Syntax Tree.
27 The Abstract Syntax Tree (AST)
684 * Abstract Syntax Tree (aka Parse Tree)
|
| H A D | LangImpl2.rst | 16 Syntax Tree <http://en.wikipedia.org/wiki/Abstract_syntax_tree>`_ (AST).
24 talk about the output of the parser: the Abstract Syntax Tree.
26 The Abstract Syntax Tree (AST)
|
| H A D | OCamlLangImpl3.rst | 13 the `Abstract Syntax Tree <OCamlLangImpl2.html>`_, built in Chapter 2,
632 * Abstract Syntax Tree (aka Parse Tree)
|
| /minix3/external/bsd/llvm/dist/llvm/docs/ |
| H A D | Lexicon.rst | 19 Abstract Syntax Tree.
|
| H A D | Projects.rst | 44 Source Tree Layout
|
| /minix3/crypto/external/bsd/heimdal/dist/doc/ |
| H A D | win2k.texi | 109 Domain Tree Management tool (found in Programs, Administrative tools,
119 If you want to use @command{netdom.exe} instead of the Domain Tree
|
| /minix3/external/bsd/llvm/dist/clang/lib/Sema/ |
| H A D | SemaChecking.cpp | 7091 SequenceTree Tree; member in __anon0a2745240a11::SequenceChecker
7183 if (!U.Use || !Tree.isUnsequenced(Region, U.Seq)) { in addUsage()
7197 if (!U.Use || !Tree.isUnsequenced(Region, U.Seq)) in checkUsage()
7237 : Base(S.Context), SemaRef(S), Region(Tree.root()), in SequenceChecker()
7268 SequenceTree::Seq LHS = Tree.allocate(Region); in VisitBinComma()
7269 SequenceTree::Seq RHS = Tree.allocate(Region); in VisitBinComma()
7285 Tree.merge(LHS); in VisitBinComma()
7286 Tree.merge(RHS); in VisitBinComma()
7439 Region = Tree.allocate(Parent); in VisitCXXConstructExpr()
7447 Tree.merge(Elts[I]); in VisitCXXConstructExpr()
[all …]
|