| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| racewalk.go | 19 // The rewriting is not yet complete. Certain nodes are not rewritten
106 // instrumentation code to top-level (statement) nodes' init
157 // Scan past OAS nodes copying results off stack.
372 // impossible nodes: only appear in backend.
416 OINDREG, // at this stage, only n(SP) nodes from nodarg
|
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| racewalk.go | 22 // The rewriting is not yet complete. Certain nodes are not rewritten
109 // instrumentation code to top-level (statement) nodes' init
160 // Scan past OAS nodes copying results off stack.
375 // impossible nodes: only appear in backend.
419 OINDREG, // at this stage, only n(SP) nodes from nodarg
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| racewalk.go | 19 // The rewriting is not yet complete. Certain nodes are not rewritten
106 // instrumentation code to top-level (statement) nodes' init
157 // Scan past OAS nodes copying results off stack.
372 // impossible nodes: only appear in backend.
416 OINDREG, // at this stage, only n(SP) nodes from nodarg
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| transformer.py | 18 # Some fixes to try to have correct line number on almost all nodes
58 def asList(nodes):
60 for item in nodes:
84 if kind in nodes:
86 return nodes[kind](*args[1:])
88 print nodes[kind], len(args), args
275 assert isinstance(code.nodes[0], Discard)
276 del code.nodes[0]
311 assert isinstance(code.nodes[0], Discard)
312 del code.nodes[0
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| transformer.py | 18 # Some fixes to try to have correct line number on almost all nodes
58 def asList(nodes):
60 for item in nodes:
84 if kind in nodes:
86 return nodes[kind](*args[1:])
88 print nodes[kind], len(args), args
275 assert isinstance(code.nodes[0], Discard)
276 del code.nodes[0]
311 assert isinstance(code.nodes[0], Discard)
312 del code.nodes[0
[all...] |
| /prebuilts/tools/common/m2/repository/net/sourceforge/saxon/saxon/9.1.0.8/ |
| saxon-9.1.0.8-dom.jar | |
| /frameworks/base/core/java/android/widget/ |
| RelativeLayout.java | 1710 final ArrayList<Node> nodes = mNodes; local
1789 final ArrayList<Node> nodes = mNodes; local
[all...] |
| /external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/ |
| gUnitExecutor.java | 500 // Walk resulting tree; create tree nodes stream first
501 CommonTreeNodeStream nodes; local
503 nodes = new CommonTreeNodeStream(customTreeAdaptor, tree);
506 nodes = new CommonTreeNodeStream(tree);
508 // AST nodes have payload that point into token stream
509 nodes.setTokenStream(tokens);
510 // Create a tree walker attached to the nodes stream
514 Object[] treeParArgs = new Object[]{nodes}; // assign value to tree parser's args
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| error.rb | 169 def extract_from_node_stream( nodes )
170 adaptor = nodes.adaptor
177 while prior_node = nodes.look( i )
494 the same as MismatchedToken, but used specifically for tree nodes.
573 3. An adaptor encountered a situation where multiple tree nodes have been
|
| /external/opencv3/3rdparty/jinja2/ |
| environment.py | 13 from jinja2 import nodes
22 from jinja2.nodes import EvalContext
444 tree of nodes is used by the compiler to convert the template into
597 body = [nodes.Assign(nodes.Name('result', 'store'), expr, lineno=1)]
598 template = self.from_string(nodes.Template(body, lineno=1))
[all...] |
| /frameworks/minikin/tools/ |
| mk_hyb_file.py | 194 nodes = Freelist()
204 if (ix >= 0 and nodes.is_free(ix) and
210 nodes.is_free(ix) # actually don't need nodes at all when use_node,
213 ix, _ = nodes.next(0)
216 nodes.use(ix)
225 # return list of nodes in bfs order
242 # suffix compression - convert the trie into an acyclic digraph, merging nodes when
265 print(len(uniques), 'unique nodes,', len(self.bfs_order), 'total')
|
| /prebuilts/go/darwin-x86/src/cmd/pprof/internal/driver/ |
| driver.go | 445 flagNodeCount *int // Max number of nodes to show
446 flagNodeFraction *float64 // Hide nodes below <f>*total
451 flagIgnore *string // Skips paths going through any nodes matching regexp
640 flagNodeCount: flag.Int("nodecount", -1, "Max number of nodes to show"),
641 flagNodeFraction: flag.Float64("nodefraction", 0.005, "Hide nodes below <f>*total"),
646 flagIgnore: flag.String("ignore", "", "Skips paths going through any nodes matching regexp"),
647 flagHide: flag.String("hide", "", "Skips nodes matching regexp"),
865 " -nodecount=N Max number of nodes to show\n" +
866 " -nodefraction=f Hide nodes below <f>*total\n" +
883 " -ignore=r Skips paths going through any nodes matching regexp\n"
[all...] |
| /prebuilts/go/linux-x86/src/cmd/pprof/internal/driver/ |
| driver.go | 445 flagNodeCount *int // Max number of nodes to show
446 flagNodeFraction *float64 // Hide nodes below <f>*total
451 flagIgnore *string // Skips paths going through any nodes matching regexp
640 flagNodeCount: flag.Int("nodecount", -1, "Max number of nodes to show"),
641 flagNodeFraction: flag.Float64("nodefraction", 0.005, "Hide nodes below <f>*total"),
646 flagIgnore: flag.String("ignore", "", "Skips paths going through any nodes matching regexp"),
647 flagHide: flag.String("hide", "", "Skips nodes matching regexp"),
865 " -nodecount=N Max number of nodes to show\n" +
866 " -nodefraction=f Hide nodes below <f>*total\n" +
883 " -ignore=r Skips paths going through any nodes matching regexp\n"
[all...] |
| /build/tools/droiddoc/templates-pdk/assets/ |
| android-developer-docs.js | 536 var nodes = $("#header-tabs").find("."+lang);
537 for (i=0; i < nodes.length; i++) { // for each node in this language
538 var node = $(nodes[i]);
550 var nodes = $("#side-nav").find("."+lang);
551 for (i=0; i < nodes.length; i++) { // for each node in this language
552 var node = $(nodes[i]);
|
| /cts/tools/utils/ |
| DescriptionGenerator.java | 302 * Rebuild the document, merging empty suite nodes.
305 // merge empty suite nodes
346 * Get the unmuatable child nodes for specified node.
352 ArrayList<Node> nodes = new ArrayList<Node>(); local
356 nodes.add(nodelist.item(i));
359 return nodes;
364 * the existing suite nodes and do the real creation and append.
398 * Get the test suite child nodes of a specified element.
401 * @return The matched child nodes.
481 * Do the append, including creating test suite nodes and test case nodes, an
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| treewizard.py | 310 In order to create nodes and navigate, this class needs a TreeAdaptor.
313 iterating over the various nodes with a particular type.
370 """Walk the entire tree and make a node name to nodes mapping.
418 """Return a List of tree nodes with token type ttype"""
420 nodes = []
423 nodes.append(tree)
427 return nodes
466 all nodes of that type (this is faster than the pattern match).
524 on the various nodes and '.' (dot) as the node/subtree wildcard,
526 the labels pointing at the appropriate nodes. Return false i
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/tests/ |
| t051treeRewriteAST.py | 38 nodes = antlr3.tree.CommonTreeNodeStream(r.tree)
39 nodes.setTokenStream(tStream)
40 walker = walkerCls(nodes)
[all...] |
| t057autoAST.py | 101 nodes = antlr3.tree.CommonTreeNodeStream(r.tree)
102 nodes.setTokenStream(tStream)
103 walker = walkerCls(nodes)
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/ast-output/ |
| hetero-nodes.rb | 612 nodes = ANTLR3::CommonTreeNodeStream.new( r.tree )
613 nodes.token_stream = tokens
614 tree_parser = tree_grammar_module::TreeParser.new( nodes )
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| NodeSet.java | 40 * nextNode() is called, in order that nodes can be added
87 * @param nodelist List of Nodes to be made members of the new set.
101 * @param nodelist Set of Nodes to be made members of the new set.
115 * @param ni Iterator which yields Nodes to be made members of the new set.
179 * hardcoded to show all nodes except EntityReference nodes, which have
193 * The filter object used to screen nodes. Filters are applied to
203 * not going to return all nodes selected by whatToShow.
212 * reference nodes are visible to the iterator. If false, they will be
218 * a view of the document that has entity reference nodes but no entit
[all...] |
| /external/doclava/res/assets/templates/assets/ |
| doclava-developer-docs.js | 449 var nodes = $("#header-tabs").find("."+lang);
450 for (i=0; i < nodes.length; i++) { // for each node in this language
451 var node = $(nodes[i]);
463 var nodes = $("#side-nav").find("."+lang);
464 for (i=0; i < nodes.length; i++) { // for each node in this language
465 var node = $(nodes[i]);
|
| /external/v8/src/compiler/ |
| ast-graph-builder.h | 44 // Helpers to create new control nodes.
55 // Visiting functions for AST nodes make this an AstVisitor.
93 // Nodes representing values in the activation record.
109 // Control nodes that exit the function body.
118 // Cache for StateValues nodes for frame states.
128 // new nodes.
202 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; local
203 return MakeNode(op, arraysize(nodes), nodes, false);
448 // environment will perform proper SSA-renaming of all tracked nodes
[all...] |
| /frameworks/support/graphics/drawable/static/src/android/support/graphics/drawable/ |
| PathParser.java | 64 PathDataNode[] nodes = createNodesFromPathData(pathData); local
65 if (nodes != null) {
67 PathDataNode.nodesToPath(nodes, path);
|
| /libcore/luni/src/test/java/libcore/xml/ |
| NormalizeTest.java | 571 NodeList nodes = element.getChildNodes(); local
572 for (int i = 0; i < nodes.getLength(); i++) {
573 Node node = nodes.item(i);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| ViewHierarchy.java | 105 * Flag which records whether or not we have any exploded parent nodes in this
120 /** Map from nodes to canvas view infos */
123 /** Map from DOM nodes to canvas view infos */
146 * @param explodedNodes The set of individual nodes the layout computer was asked to
150 * nodes are padded during certain interactions.
221 // Update the data structures related to tracking invisible and exploded nodes.
302 * <li>Invisible parents. These are nodes that can hold children and have empty
304 * <li>Exploded nodes. These are nodes that were previously marked as invisible, and
666 * Returns the invisible nodes (the {@link UiElementNode} objects correspondin
680 Set<UiElementNode> nodes = new HashSet<UiElementNode>(mInvisibleParents.size()); local
[all...] |
