Searched refs:Tree (Results 1 - 6 of 6) sorted by relevance

/freebsd-9.3-release/contrib/llvm/tools/clang/lib/AST/
H A DASTDiagnostic.cpp689 DiffTree Tree; member in class:__anon2980::TemplateDiff
841 Tree.AddNode();
858 Tree.SetNode(FromType, ToType);
859 Tree.SetDefault(FromIter.isEnd() && !FromType.isNull(),
861 Tree.SetKind(DiffTree::Type);
864 Tree.SetSame(true);
877 Tree.SetNode(FromArgTST->getTemplateName().getAsTemplateDecl(),
879 Tree.SetNode(FromQual, ToQual);
880 Tree.SetKind(DiffTree::Template);
926 Tree
[all...]
/freebsd-9.3-release/contrib/llvm/tools/clang/utils/TableGen/
H A DClangASTNodesEmitter.cpp53 std::pair<Record *, Record *> EmitNode (const ChildMap &Tree, raw_ostream& OS,
73 const ChildMap &Tree,
78 ChildIterator i = Tree.lower_bound(Base), e = Tree.upper_bound(Base);
103 if (Tree.find(R) != Tree.end()) {
105 = EmitNode(Tree, OS, R);
158 ChildMap Tree; local
164 Tree.insert(std::make_pair(R->getValueAsDef("Base"), R));
166 Tree
72 EmitNode( const ChildMap &Tree, raw_ostream &OS, Record *Base) argument
[all...]
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Basic/
H A DDiagnostic.cpp672 SmallVector<char, 64> Tree; local
856 if (getDiags()->PrintTemplateTree && Tree.empty()) {
864 Tree, QualTypeVals);
866 if (!Tree.empty()) {
925 OutStr.append(Tree.begin(), Tree.end());
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/
H A DReassociate.cpp1002 SmallVector<RepeatedValue, 8> Tree;
1003 MadeChange |= LinearizeExprTree(BO, Tree);
1005 Factors.reserve(Tree.size());
1006 for (unsigned i = 0, e = Tree.size(); i != e; ++i) {
1007 RepeatedValue E = Tree[i];
1904 SmallVector<RepeatedValue, 8> Tree;
1905 MadeChange |= LinearizeExprTree(I, Tree);
1907 Ops.reserve(Tree.size());
1908 for (unsigned i = 0, e = Tree.size(); i != e; ++i) {
1909 RepeatedValue E = Tree[
[all...]
/freebsd-9.3-release/contrib/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.cpp1095 DagInit *Tree = Operator->getValueAsDag("Fragment");
1097 if (Tree)
1098 if (DefInit *DI = dyn_cast<DefInit>(Tree->getOperator()))
2212 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment"); local
2213 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
2650 getInstructionsInTree(TreePatternNode *Tree, SmallVectorImpl<Record*> &Instrs) { argument
2651 if (Tree->isLeaf())
2653 if (Tree->getOperator()->isSubClassOf("Instruction"))
2654 Instrs.push_back(Tree->getOperator());
2655 for (unsigned i = 0, e = Tree
3176 DagInit *Tree = CurPattern->getValueAsDag("PatternToMatch"); local
[all...]
/freebsd-9.3-release/contrib/dtc/Documentation/
H A Ddtc-paper.tex49 --- the Device Tree Compiler --- that turns a simple text
107 \section{The Flattened Tree}
314 \section{The Device Tree Compiler}
486 \subsection{Tree checking}

Completed in 117 milliseconds