| /external/libmojo/mojo/public/tools/bindings/pylib/mojom/parse/ |
| translate.py | 5 """Translates parse tree to Mojom IR."""
22 def _MapTreeForType(func, tree, type_to_map, scope):
24 if not tree:
27 for subtree in tree if isinstance(subtree, type_to_map)]
119 def Build(self, tree, name):
204 assert isinstance(tree, ast.Mojom)
206 self.mojom['namespace'] = tree.module.name[1] if tree.module else ''
208 [{'filename': imp.import_filename} for imp in tree.import_list]
210 _MapTreeForType(StructToDict, tree.definition_list, ast.Struct, name
[all...] |
| /external/dtc/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...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/compiler/ |
| syntax.py | 14 def check(tree, multi=None):
16 walk(tree, v)
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/versioncheck/ |
| checkversions.py | 15 Recursively examine a tree (default: sys.prefix) and for each package
33 def walk1tree(tree):
34 os.path.walk(tree, check1dir, None)
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| MismatchedTreeNodeException.as | 2 import org.antlr.runtime.tree.TreeNodeStream;
|
| /external/libvpx/libvpx/vp8/common/ |
| treecoder.h | 6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
38 Each node of the tree is a pair of vp8_tree_indices.
51 /* Construct encoding array from tree. */
58 for the associated binary encoding tree. Also writes count of branches
59 taken for each node on the tree; this facilitiates decisions as to
63 vp8_token tok[/* n */], vp8_tree tree,
72 vp8_token tok[/* n */], vp8_tree tree,
|
| treecoder.c | 6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
43 vp8_token tok[/* n */], vp8_tree tree,
70 i = tree[i + b];
78 vp8_token tok[/* n */], vp8_tree tree,
86 branch_counts(n, tok, tree, branch_ct, num_events);
|
| /external/smali/smalidea/src/main/java/org/jf/smalidea/psi/ |
| SmaliCompositeElementType.java | 34 import com.intellij.psi.tree.ICompositeElementType;
35 import com.intellij.psi.tree.IElementType;
|
| /frameworks/base/tools/aapt2/ |
| DominatorTree_test.cpp | 41 std::string ToString(DominatorTree* tree) {
44 tree->Accept(this);
81 DominatorTree tree(configs);
88 EXPECT_EQ(expected, printer.ToString(&tree));
105 DominatorTree tree(configs);
113 EXPECT_EQ(expected, printer.ToString(&tree));
146 DominatorTree tree(configs);
160 EXPECT_EQ(expected, printer.ToString(&tree));
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| tree-dump.h | 0 /* Tree-dumping functionality for intermediate representation.
24 #include "splay-tree.h"
47 /* The queued tree node. */
74 /* The tree nodes which we have already written out. The
90 extern void dump_function (int, tree);
93 /* In tree-cfg.c */
94 extern void dump_function_to_file (tree, FILE *, int);
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/ |
| syntax.py | 14 def check(tree, multi=None):
16 walk(tree, v)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/compiler/ |
| syntax.py | 14 def check(tree, multi=None):
16 walk(tree, v)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| syntax.py | 14 def check(tree, multi=None):
16 walk(tree, v)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| syntax.py | 14 def check(tree, multi=None):
16 walk(tree, v)
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| RewriteRuleElementStream.js | 9 * @see org.antlr.runtime.tree.RewriteRuleSubtreeStream
10 * @see org.antlr.runtime.tree.RewriteRuleTokenStream
14 org.antlr.runtime.tree.RewriteRuleElementStream = function(adaptor, elementDescription, el) {
42 org.antlr.runtime.tree.RewriteRuleElementStream.prototype = {
91 * a tree node or subtree. Deal with the optimization of single-
99 throw new org.antlr.runtime.tree.RewriteEmptyStreamException(this.elementDescription);
106 throw new org.antlr.runtime.tree.RewriteCardinalityException(this.elementDescription);
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/ |
| ASTParser.stg | 51 retval.tree = self._adaptor.errorNode(self.input, retval.start, self.input.LT(-1), re)
133 <finishedBacktracking({self._adaptor.addChild(root_0, <label>.tree)})>
142 <finishedBacktracking({root_0 = self._adaptor.becomeRoot(<label>.tree, root_0)})>
148 <listLabel(label, {<label>.tree})>
154 <listLabel(label, {<label>.tree})>
160 <listLabel(label, {<label>.tree})>
194 retval.tree = self._adaptor.rulePostProcessing(root_0)
195 self._adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop)
|
| /external/smali/smalidea/src/main/java/org/jf/smalidea/ |
| SmaliLexicalElementType.java | 35 import com.intellij.psi.tree.IElementType;
|
| /external/syslinux/com32/lib/zlib/ |
| trees.c | 13 * Each code tree is stored in a compressed form which is itself
92 /* The static literal tree. Since the bit lengths are imposed, there is no
94 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
99 /* The static distance tree. (Actually a trivial tree since all codes use
123 const ct_data *static_tree; /* static tree or NULL */
126 int elems; /* max number of elements in the tree */
145 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
147 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
149 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code))
498 ct_data *tree = desc->dyn_tree; local
627 ct_data *tree = desc->dyn_tree; local
[all...] |
| /prebuilts/tools/linux-x86_64/kythe/extractors/ |
| javac_extractor.jar | |
| /prebuilts/tools/linux-x86_64/kythe/indexers/ |
| java_indexer.jar | |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRTreeIterator.h | 43 __strong id<ANTLRBaseTree> tree; variable
54 @property(retain) id<ANTLRBaseTree> tree; variable
62 andTree:(id<ANTLRBaseTree>)tree;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
| SimpleCTP.h | 39 ANTLRCommonTree * tree; variable
43 @property (retain, getter=gettree, setter=settree:) ANTLRCommonTree * tree; variable
64 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
|
| /external/antlr/antlr-3.4/runtime/Python/unittests/ |
| testdottreegen.py | 12 from antlr3.tree import CommonTreeAdaptor
41 tree = self.wiz.create("(A B (B C C) (B (C D D)))")
42 st = toDOT(tree, self.adaptor, treeST, edgeST)
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
| visitor.rb | 40 AST::Visitor is an extra utility class for working with tree objects. Visitor
42 instead a standard single iteration block. The <tt>visit(tree)</tt> method walks
43 through each node of the tree (top-down left-to-right). If +pre_action+ is
68 def visit( tree, pre_action = nil, post_action = nil )
69 flat = @adaptor.flat_list?( tree )
73 tree = before.call( tree ) unless before.nil? or flat
74 @adaptor.child_count( tree ).times do |index|
75 child = @adaptor.child_of( tree, index )
78 tree = after.call( tree ) unless after.nil? or fla
[all...] |
| /external/libnl/lib/cli/cls/ |
| basic.c | 36 struct rtnl_ematch_tree *tree; local
71 tree = nl_cli_cls_parse_ematch(cls, optarg);
72 rtnl_basic_set_ematch(cls, tree);
|
