HomeSort by: relevance | last modified time | path
    Searched defs:Tree (Results 1 - 12 of 12) sorted by relevancy

  /src/external/gpl2/dtc/dist/Documentation/
dtc-paper.tex 44 flattened-tree representation of the system's hardware based on the
45 device tree supplied by Open Firmware on IBM\R servers and Apple\R
48 The ``blob'' representing the device tree can be created using \dtc
49 --- the Device Tree Compiler --- that turns a simple text
50 representation of the tree into the compact representation used by
55 This flattened-tree approach is now the only supported method of
63 \subsection{OF and the device tree}
67 Among other boot-time services, OF maintains a device tree that
70 the Linux kernel uses OF calls to scan the device tree and transfer it
74 The device tree consists of nodes representing devices o
    [all...]
  /src/external/apache2/llvm/dist/clang/utils/TableGen/
ClangASTNodesEmitter.cpp 41 ChildMap Tree;
91 ChildIterator i = Tree.lower_bound(Base), e = Tree.upper_bound(Base);
145 assert(!Root && "already computed tree");
155 Tree.insert(std::make_pair(B, R));
  /src/external/apache2/llvm/dist/clang/include/clang/Tooling/Syntax/
Tree.h 1 //===- Tree.h - structure of the syntax tree ------------------*- C++ -*-=====//
8 // Defines the basic structure of the syntax tree. There are two kinds of nodes:
10 // - tree nodes correspond to language grammar constructs.
12 // The tree is initially built from an AST. Each node of a newly built tree
15 // a tree. A post-order traversal of a tree will visit leaf nodes in an order
70 class Tree;
78 /// A node in a syntax tree. Each node is either a Leaf (representing tokens) o
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
gdbhooks.py 88 Tree nodes are printed using Python code that emulates print_node_brief,
93 than just "tree".
151 # Convert "enum tree_code" (tree.def and tree.h) to a dict:
159 # Similarly for "enum tree_code_class" (tree.h):
170 class Tree:
172 Wrapper around a gdb.Value for a tree, with various methods
173 corresponding to macros in gcc/tree.h
191 Get Tree instance corresponding to DECL_NAME (self)
193 return Tree(self.gdbval['decl_minimal']['name']
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
gdbhooks.py 88 Tree nodes are printed using Python code that emulates print_node_brief,
93 than just "tree".
151 # Convert "enum tree_code" (tree.def and tree.h) to a dict:
159 # Similarly for "enum tree_code_class" (tree.h):
170 class Tree:
172 Wrapper around a gdb.Value for a tree, with various methods
173 corresponding to macros in gcc/tree.h
191 Get Tree instance corresponding to DECL_NAME (self)
193 return Tree(self.gdbval['decl_minimal']['name']
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Basic/
Diagnostic.cpp 817 SmallString<64> Tree;
1027 // Print the tree. If this diagnostic already has a tree, skip the
1028 // second tree.
1029 if (getDiags()->PrintTemplateTree && Tree.empty()) {
1036 Tree, QualTypeVals);
1037 // If there is no tree information, fall back to regular printing.
1038 if (!Tree.empty()) {
1044 // Non-tree printing, also the fall-back when tree printing fails
    [all...]
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
GICombinerEmitter.cpp 54 cl::desc("Stop processing after building the match tree"),
72 const GIMatchTree &Tree;
76 format_partition_name(const GIMatchTree &Tree, unsigned Idx)
77 : Tree(Tree), Idx(Idx) {}
79 Tree.getPartitioner()->emitPartitionName(OS, Idx);
229 /// preparation work for flattening the DAG into a tree.
618 void generateCodeForTree(raw_ostream &OS, const GIMatchTree &Tree,
721 const GIMatchTree &Tree,
723 if (Tree.getPartitioner() != nullptr)
    [all...]
CodeGenDAGPatterns.cpp 66 // of types that are currently possible for a given tree node. Type
1348 for (const auto &Tree : PatFragRec->getTrees()) {
1350 if (Tree->isLeaf())
1353 Record *Op = Tree->getOperator();
1557 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
1967 /// clone - Make a copy of this tree and all of its children.
1989 /// RemoveAllTypes - Recursively strip all the types of this tree.
1999 /// SubstituteFormalArguments - Replace the formal arguments in this tree
2362 /// TreeHasProperty - Return true if any node in this tree has the specified
2410 /// this node and its children in the tree. This returns true if it makes
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/AST/
ASTDiagnostic.cpp 384 // Don't fall-back during tree printing. The caller will handle
488 /// QualTypes. For the pair of types, a diff tree will be created containing
490 /// the tree is transformed to a string according to the options passed in.
502 /// PrintTree - Format output string as a tree.
509 /// type to be be printed. When tree printing is selected, this type will
510 /// show up first in the tree.
513 /// ToTemplateType - The type that FromType is compared to. Only in tree
523 /// DiffTree - A tree representation the differences between two types.
592 /// FlatTree - A flattened tree used to store the DiffNodes.
767 /// StartTraverse - Prepares the tree for recursive traversal
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/
ASTDiff.cpp 31 /// Maps nodes of the left tree to ones on the right, and vice versa.
71 NodeId getMapped(const std::unique_ptr<SyntaxTree::Impl> &Tree,
73 if (&*Tree == &T1)
75 assert(&*Tree == &T2 && "Invalid tree.");
115 /// Constructs a tree from an AST node.
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {}
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonConstExtenders.cpp 668 // an unbalanced tree again.
683 // an unbalanced tree again.
1331 RangeTree Tree;
1333 Tree.add(R);
1335 Tree.order(Nodes);
1357 auto P0 = MaxAlign(Tree.nodesWith(R.Min, false), R.Align, R.Offset);
1361 auto P1 = MaxAlign(Tree.nodesWith(R.Max, false), R.Align, R.Offset);
1376 auto &&V = Tree.nodesWith(*It);
1396 for (RangeTree::Node *N : Tree.nodesWith(Best)) {
1399 Tree.erase(N)
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Sema/
SemaChecking.cpp 13216 /// A tree of sequenced regions within an expression. Two regions are
13219 /// expression, we fold its tree nodes into its parent, since they are
13325 SequenceTree Tree;
13429 if (!U.UsageExpr || !Tree.isUnsequenced(Region, U.Seq)) {
13452 if (!U.UsageExpr || !Tree.isUnsequenced(Region, U.Seq))
13524 : Base(S.Context), SemaRef(S), Region(Tree.root()), WorkList(WorkList) {
13554 SequenceTree::Seq BeforeRegion = Tree.allocate(Region);
13555 SequenceTree::Seq AfterRegion = Tree.allocate(Region);
13569 Tree.merge(BeforeRegion);
13570 Tree.merge(AfterRegion)
    [all...]

Completed in 52 milliseconds