| /external/v8/src/compiler/ |
| common-node-cache.cc | 24 void CommonNodeCache::GetCachedNodes(ZoneVector<Node*>* nodes) {
25 int32_constants_.GetCachedNodes(nodes);
26 int64_constants_.GetCachedNodes(nodes);
27 float32_constants_.GetCachedNodes(nodes);
28 float64_constants_.GetCachedNodes(nodes);
29 external_constants_.GetCachedNodes(nodes);
30 number_constants_.GetCachedNodes(nodes);
31 heap_constants_.GetCachedNodes(nodes);
|
| graph.h | 21 // Marks are used during traversal of the graph to distinguish states of nodes.
27 // NodeIds are identifying numbers for nodes that can be used to index auxiliary
44 // Factories for nodes with static input counts.
50 Node* nodes[] = {n1, n2}; local
51 return NewNode(op, arraysize(nodes), nodes);
54 Node* nodes[] = {n1, n2, n3}; local
55 return NewNode(op, arraysize(nodes), nodes);
58 Node* nodes[] = {n1, n2, n3, n4} local
63 Node* nodes[] = {n1, n2, n3, n4, n5}; local
68 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; local
73 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7}; local
78 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8}; local
83 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8, n9}; local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
| State.java | 10 ArrayList nodes; field in class:State
12 State(@SuppressWarnings("hiding") int state, @SuppressWarnings("hiding") ArrayList nodes)
15 this.nodes = nodes;
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| NodeId.java | 16 package org.yaml.snakeyaml.nodes;
|
| /external/chromium-trace/catapult/catapult_base/catapult_base/refactor/annotated_symbol/ |
| reference.py | 20 def Annotate(cls, nodes):
21 if not nodes:
23 if nodes[0].type != symbol.atom:
25 if not nodes[0].children or nodes[0].children[0].type != token.NAME:
28 for i in xrange(1, len(nodes)):
29 if not nodes:
31 if nodes[i].type != symbol.trailer:
33 if len(nodes[i].children) != 2:
35 if (nodes[i].children[0].type != token.DOT o
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/utils/ |
| BinaryHeap.java | 23 private Node[] nodes;
field in class:BinaryHeap
32 nodes = new Node[capacity];
37 if (size == nodes.length) {
39 System.arraycopy(nodes, 0, newNodes, 0, size);
40 nodes = newNodes;
44 nodes[size] = node;
56 return (T)nodes[0];
68 Node[] nodes = this.nodes;
local
69 Node removed = nodes[index];
77 Node[] nodes = this.nodes; local
93 Node[] nodes = this.nodes; local
111 Node[] nodes = this.nodes; local
[all...] |
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/representer/ |
| Represent.java | 18 import org.yaml.snakeyaml.nodes.Node;
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/serializer/ |
| AnchorGenerator.java | 18 import org.yaml.snakeyaml.nodes.Node;
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeIterator.java | 36 /** Return a node stream from a doubly-linked tree whose nodes
39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
47 // navigation nodes to return during walk and at end
52 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
55 protected FastQueue nodes; field in class:TreeIterator
65 nodes = new FastQueue();
74 nodes.clear();
79 if ( nodes!=null && nodes.size()>0 ) return true
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/ |
| handler.py | 31 self.nodes = [('root', root_node)]
36 new_node = self.nodes[-1][1].startElement(name, attrs, self.connection)
38 self.nodes.append((name, new_node))
41 self.nodes[-1][1].endElement(name, self.current_text, self.connection)
42 if self.nodes[-1][0] == name:
43 if hasattr(self.nodes[-1][1], 'endNode'):
44 self.nodes[-1][1].endNode(self.connection)
45 self.nodes.pop()
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 53 List nodes = g.sort(); local
54 String result = nodes.toString();
67 List nodes = g.sort(); local
68 String result = nodes.toString();
81 List nodes = g.sort(); local
82 String result = nodes.toString();
95 List nodes = g.sort(); local
96 String result = nodes.toString();
109 List nodes = g.sort(); local
110 String result = nodes.toString()
[all...] |
| /external/opencv3/3rdparty/jinja2/ |
| meta.py | 12 from jinja2 import nodes
72 for node in ast.find_all((nodes.Extends, nodes.FromImport, nodes.Import,
73 nodes.Include)):
74 if not isinstance(node.template, nodes.Const):
76 if isinstance(node.template, (nodes.Tuple, nodes.List)):
80 if isinstance(template_name, nodes.Const):
96 elif isinstance(node, nodes.Include) and
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeIterator.cs | 36 /** Return a node stream from a doubly-linked tree whose nodes
39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
47 // navigation nodes to return during walk and at end
52 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
55 protected Queue<object> nodes; field in class:Antlr.Runtime.Tree.TreeIterator
65 nodes = new Queue<object>();
95 nodes.Enqueue(eof);
100 if (nodes != null && nodes.Count > 0)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| TreeIterator.cs | 37 /** Return a node stream from a doubly-linked tree whose nodes
40 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
50 // navigation nodes to return during walk and at end
55 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
58 protected Queue<object> nodes; field in class:Antlr.Runtime.Tree.TreeIterator
70 nodes = new Queue<object>();
105 nodes.Enqueue( eof );
112 if ( nodes != null && nodes.Count > 0
[all...] |
| /external/llvm/utils/ |
| DSAextract.py | 3 #this is a script to extract given named nodes from a dot file, with
5 # x and y are both nodes specified to be kept.
19 #nodes in the file
35 <output_file> [list of nodes to extract]'
66 #for the node (it will be Node(hex number)) to our set of nodes
96 #check to make sure that both nodes are in the node list
98 nodes = arrowexp.split(buffer) variable
99 nodes[0] = string.strip(nodes[0])
100 nodes[1] = string.strip(nodes[1]
[all...] |
| /external/llvm/lib/CodeGen/ |
| SpillPlacement.cpp | 69 /// value can change when linked nodes change, but convergence is very fast
94 // Undecided nodes (Value==0) go on the stack.
148 bool update(const Node nodes[], const BlockFrequency &Threshold) {
153 if (nodes[I->second].Value == -1)
155 else if (nodes[I->second].Value == 1)
183 assert(!nodes && "Leaking node array");
184 nodes = new Node[bundles->getNumBundles()];
200 delete[] nodes;
201 nodes = nullptr;
209 nodes[n].clear(Threshold)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/functions/ |
| FuncSum.java | 49 DTMIterator nodes = m_arg0.asIterator(xctxt, xctxt.getCurrentNode()); local
53 while (DTM.NULL != (pos = nodes.nextNode()))
55 DTM dtm = nodes.getDTM(pos);
61 nodes.detach();
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/constructor/ |
| Construct.java | 18 import org.yaml.snakeyaml.nodes.Node;
|
| /toolchain/binutils/binutils-2.25/include/vms/ |
| dcx.h | 46 unsigned char nodes[2]; member in struct:vms_dcxsbm
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRStreamEnumerator.h | 39 AMutableArray *nodes; variable
47 @property (retain) AMutableArray *nodes; variable
|
| /external/clang/test/CodeGenCXX/ |
| constructor-template.cpp | 17 A nodes; member in struct:B
39 List<BinomialNode<T>*> nodes; member in class:BinomialNode
|
| /external/libxml2/doc/examples/ |
| xpath2.c | 28 static void update_xpath_nodes(xmlNodeSetPtr nodes, const xmlChar * value);
79 * Parses input XML file, evaluates XPath expression and update the nodes
118 /* update selected nodes */
138 * @nodes: the nodes set.
141 * Prints the @nodes content to @output.
144 update_xpath_nodes(xmlNodeSetPtr nodes, const xmlChar* value) {
149 size = (nodes) ? nodes->nodeNr : 0;
152 * NOTE: the nodes are processed in reverse order, i.e. reverse documen
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue9/ |
| BeanConstructor3.java | 19 import org.yaml.snakeyaml.nodes.Node;
20 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/doclava/src/com/google/doclava/ |
| Hierarchy.java | 27 HashMap<String, TreeSet<String>> nodes = new HashMap<String, TreeSet<String>>(); local
32 TreeSet<String> me = nodes.get(name);
35 nodes.put(name, me);
41 TreeSet<String> s = nodes.get(sname);
44 nodes.put(sname, s);
51 * Set<String> keys = nodes.keySet(); for (String n: keys) { System.out.println("class: " + n);
53 * TreeSet<String> values = nodes.get(n); for (String v: values) {
57 int depth = depth(nodes, "java.lang.Object");
62 recurse(nodes, "java.lang.Object", hdf.getChild("classes.0"), depth, depth);
65 Set<String> keys = nodes.keySet()
[all...] |
| /external/mesa3d/src/mesa/program/ |
| register_allocate.c | 34 * edges in the graph between nodes that interfere (can't be allocated
41 * That likely causes other nodes to become trivially colorable as well.
43 * Then during the "select" process, nodes are popped off of that
118 * List of which nodes this node interferes with. This should be
150 struct ra_node *nodes; member in struct:ra_graph
151 unsigned int count; /**< count of nodes. */
298 g->nodes[n1].adjacency[n2] = GL_TRUE;
299 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2;
300 g->nodes[n1].adjacency_count++
[all...] |
