/external/v8/src/compiler/ |
H A D | common-node-cache.cc | 24 void CommonNodeCache::GetCachedNodes(ZoneVector<Node*>* nodes) { argument 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);
|
H A D | 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[] 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/ |
H A D | State.java | 10 ArrayList nodes; field in class:State 12 State(@SuppressWarnings("hiding") int state, @SuppressWarnings("hiding") ArrayList nodes) argument 15 this.nodes = nodes;
|
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
H A D | NodeId.java | 16 package org.yaml.snakeyaml.nodes;
|
/external/chromium-trace/catapult/catapult_base/catapult_base/refactor/annotated_symbol/ |
H A D | 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[ [all...] |
/external/opencv3/3rdparty/jinja2/ |
H A D | meta.py | 12 from jinja2 import nodes namespace 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 [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | 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 [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | 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 [all...] |
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/representer/ |
H A D | Represent.java | 18 import org.yaml.snakeyaml.nodes.Node;
|
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/serializer/ |
H A D | AnchorGenerator.java | 18 import org.yaml.snakeyaml.nodes.Node;
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | 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 [all...] |
/external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/ |
H A D | 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/llvm/utils/ |
H A D | 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[ [all...] |
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
H A D | TestTopologicalSort.java | 53 List nodes = g.sort(); 54 String result = nodes.toString(); 67 List nodes = g.sort(); 68 String result = nodes.toString(); 81 List nodes = g.sort(); 82 String result = nodes.toString(); 95 List nodes = g.sort(); 96 String result = nodes.toString(); 109 List nodes = g.sort(); 110 String result = nodes [all...] |
/external/autotest/server/site_tests/audio_AudioNodeSwitch/ |
H A D | audio_AudioNodeSwitch.py | 5 """This is a server side audio nodes s test using the Chameleon board.""" 25 audio nodes switch correctly. 37 """Checks default audio nodes for devices with onboard audio support.""" 73 def switch_nodes_and_check_volume(self, nodes): 74 """Switches between nodes and check the node volumes. 76 @param nodes: A list of node types to check. 79 if len(nodes) == 1: 80 self.check_active_node_volume(nodes[0]) 81 for node in nodes: 82 # Switch nodes an [all...] |
/external/llvm/lib/CodeGen/ |
H A D | 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) { argument 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[ [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/functions/ |
H A D | FuncSum.java | 49 DTMIterator nodes = m_arg0.asIterator(xctxt, xctxt.getCurrentNode()); 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/ |
H A D | Construct.java | 18 import org.yaml.snakeyaml.nodes.Node;
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRStreamEnumerator.h | 39 AMutableArray *nodes; variable 47 @property (retain) AMutableArray *nodes; variable
|
/external/clang/test/CodeGenCXX/ |
H A D | constructor-template.cpp | 17 A nodes; member in struct:B 39 List<BinomialNode<T>*> nodes; member in class:BinomialNode
|
/external/libxml2/doc/examples/ |
H A D | 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) { argument 149 size = (nodes) ? nodes->nodeNr : 0; 152 * NOTE: the nodes ar [all...] |
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue9/ |
H A D | BeanConstructor3.java | 19 import org.yaml.snakeyaml.nodes.Node; 20 import org.yaml.snakeyaml.nodes.Tag;
|
/external/doclava/src/com/google/doclava/ |
H A D | Hierarchy.java | 27 HashMap<String, TreeSet<String>> nodes = new HashMap<String, TreeSet<String>>(); 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 76 depth(HashMap<String, TreeSet<String>> nodes, String name) argument 94 recurse(HashMap<String, TreeSet<String>> nodes, String name, Data hdf, int totalDepth, int remainingDepth) argument [all...] |
/external/mesa3d/src/mesa/program/ |
H A D | 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[n [all...] |
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
H A D | CommonTreeNodeStream.js | 1 /** A buffered stream of tree nodes. Nodes can be from a tree of ANY kind. 3 * This node stream sucks all nodes out of the tree specified in 6 * includes pointers to DOWN and UP and EOF nodes. 30 /** Reuse same DOWN, UP navigation nodes unless this is true */ 33 /** The index into the nodes list of the current node (next node 34 * to consume). If -1, nodes array not filled yet. 41 this.nodes = []; //new ArrayList(initialBufferSize); 57 nodes = this.nodes, 62 return i<nodes [all...] |