| /prebuilts/go/darwin-x86/src/syscall/ |
| syscall_netbsd.go | 31 func sysctlNodes(mib []_C_int) (nodes []Sysctlnode, err error) {
34 // Get a list of all sysctl nodes below the given MIB by performing
44 // Now that we know the size, get the actual nodes.
45 nodes = make([]Sysctlnode, olen/sz)
46 np := (*byte)(unsafe.Pointer(&nodes[0]))
51 return nodes, nil
67 // Discover the nodes and construct the MIB OID.
69 nodes, err := sysctlNodes(mib)
73 for _, node := range nodes {
|
| /prebuilts/go/linux-x86/src/syscall/ |
| syscall_netbsd.go | 31 func sysctlNodes(mib []_C_int) (nodes []Sysctlnode, err error) {
34 // Get a list of all sysctl nodes below the given MIB by performing
44 // Now that we know the size, get the actual nodes.
45 nodes = make([]Sysctlnode, olen/sz)
46 np := (*byte)(unsafe.Pointer(&nodes[0]))
51 return nodes, nil
67 // Discover the nodes and construct the MIB OID.
69 nodes, err := sysctlNodes(mib)
73 for _, node := range nodes {
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/broadphase/ |
| DynamicTree.java | 399 int[] nodes = new int[m_nodeCount]; local
412 nodes[count] = i;
424 AABB aabbi = m_nodes[nodes[i]].aabb;
427 AABB aabbj = m_nodes[nodes[j]].aabb;
438 int index1 = nodes[iMin];
439 int index2 = nodes[jMin];
453 nodes[jMin] = nodes[count - 1];
454 nodes[iMin] = parent.id;
458 m_root = m_nodes[nodes[0]]
[all...] |
| /external/libxml2/python/ |
| libxml.py | 263 # the basic functionalities shared by all nodes (and handle
338 # Those are common attributes to nearly all type of nodes
415 # nodes: the node set (tuple or list) to be included in the
416 # canonized image or None if all document nodes should be
426 nodes=None,
430 if nodes:
431 nodes = [n._o for n in nodes]
434 nodes,
440 nodes=None
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| cgraph.h | 42 The symtab_node is inherited by cgraph and varpol nodes. */
57 During WPA output it is used to mark nodes that are present in
74 /* Circular list of nodes in the same comdat group if non-NULL. */
329 /* A cgraph node set is a collection of cgraph nodes. A cgraph node
334 vec<cgraph_node_ptr> nodes; member in struct:cgraph_node_set_def
340 /* A varpool node set is a collection of varpool nodes. A varpool node
345 vec<varpool_node_ptr> nodes; member in struct:varpool_node_set_def
476 /* Ordering of all cgraph nodes. */
[all...] |
| /build/kati/ |
| ninja.cc | 200 void Generate(const vector<DepNode*>& nodes,
203 PopulateNinjaNodes(nodes);
221 void PopulateNinjaNodes(const vector<DepNode*>& nodes) {
223 for (DepNode* node : nodes) {
799 void GenerateNinja(const vector<DepNode*>& nodes,
804 ng.Generate(nodes, orig_args);
|
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| CycleDetectingLockFactory.java | 322 * with nodes according to the natural ordering of the associated Enum values.
329 ArrayList<LockGraphNode> nodes = local
334 nodes.add(node);
337 // Pre-populate all allowedPriorLocks with nodes of smaller ordinal.
339 nodes.get(i).checkAcquiredLocks(Policies.THROW, nodes.subList(0, i));
341 // Pre-populate all disallowedPriorLocks with nodes of larger ordinal.
343 nodes.get(i).checkAcquiredLocks(
344 Policies.DISABLED, nodes.subList(i + 1, numKeys));
629 * The map tracking lock nodes that can cause a lock acquisition cycle i
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| StringTrieBuilder.java | 91 // In either case we need to fix-up linear-match nodes (for their maximum length)
92 // and branch nodes (turning dynamic branch nodes into trees of
93 // runtime-equivalent nodes), but the HashMap/hashCode()/equals() are omitted for
94 // nodes other than final values.
109 // Then we call root.register() to turn it into a tree of nodes
125 nodes.clear();
142 Node oldNode=nodes.get(newNode);
148 oldNode=nodes.put(newNode, newNode);
164 Node oldNode=nodes.get(lookupFinalValueNode)
887 private HashMap<Node, Node> nodes=new HashMap<Node, Node>(); field in class:StringTrieBuilder
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| StringTrieBuilder.java | 93 // In either case we need to fix-up linear-match nodes (for their maximum length)
94 // and branch nodes (turning dynamic branch nodes into trees of
95 // runtime-equivalent nodes), but the HashMap/hashCode()/equals() are omitted for
96 // nodes other than final values.
111 // Then we call root.register() to turn it into a tree of nodes
127 nodes.clear();
144 Node oldNode=nodes.get(newNode);
150 oldNode=nodes.put(newNode, newNode);
166 Node oldNode=nodes.get(lookupFinalValueNode)
889 private HashMap<Node, Node> nodes=new HashMap<Node, Node>(); field in class:StringTrieBuilder
[all...] |
| /external/libxml2/include/libxml/ |
| xpathInternals.h | 385 xmlXPathDistinctSorted (xmlNodeSetPtr nodes);
387 xmlXPathDistinct (xmlNodeSetPtr nodes);
394 xmlXPathNodeLeadingSorted (xmlNodeSetPtr nodes,
400 xmlXPathNodeLeading (xmlNodeSetPtr nodes,
407 xmlXPathNodeTrailingSorted (xmlNodeSetPtr nodes,
413 xmlXPathNodeTrailing (xmlNodeSetPtr nodes,
|
| /external/opencv3/modules/cudaobjdetect/src/cuda/ |
| lbp.cu | 200 : stages(_stages), nstages(_nstages), nodes(_nodes), leaves(_leaves), subsets(_subsets), features(_features), subsetSize(_subsetSize){}
213 ClNode node = nodes[current_node];
235 const ClNode* nodes;
|
| /external/v8/src/compiler/ |
| raw-machine-assembler.cc | 236 Node* nodes[] = {centry, arg1, ref, arity, context}; local
237 Node* tail_call = MakeNode(common()->TailCall(desc), arraysize(nodes), nodes);
260 Node* nodes[] = {centry, arg1, arg2, ref, arity, context}; local
261 Node* tail_call = MakeNode(common()->TailCall(desc), arraysize(nodes), nodes);
370 // The raw machine assembler nodes do not have effect and control inputs,
|
| loop-peeling.cc | 42 // The body of the loop is duplicated so that all nodes considered "inside"
107 // The vector which contains the mapped nodes.
124 void CopyNodes(Graph* graph, Zone* tmp_zone, Node* dead, NodeRange nodes) {
126 // Copy all the nodes first.
127 for (Node* node : nodes) {
134 for (Node* original : nodes) {
217 // Map the loop header nodes to their entry values.
222 // Copy all the nodes of loop body for the peeled iteration.
|
| /frameworks/base/packages/Osu/src/com/android/hotspot2/osu/ |
| OSUClient.java | 454 Collection<OMANode> nodes = null; local
459 nodes = Arrays.asList(node);
465 nodes = root.getChildren();
468 nodes = Arrays.asList(root.getChild(name));
472 if (nodes == null) {
477 for (OMANode node : nodes) {
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/ |
| pycodegen.py | 338 # The first few visitor methods handle nodes that generator new
377 for decorator in node.decorators.nodes:
379 ndecorators = len(node.decorators.nodes)
520 for child in node.nodes[:-1]:
524 self.visit(node.nodes[-1])
959 dups = len(node.nodes) - 1
960 for i in range(len(node.nodes)):
961 elt = node.nodes[i]
988 self.emit(op, len(node.nodes))
989 for child in node.nodes
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/compiler/ |
| pycodegen.py | 338 # The first few visitor methods handle nodes that generator new
377 for decorator in node.decorators.nodes:
379 ndecorators = len(node.decorators.nodes)
520 for child in node.nodes[:-1]:
524 self.visit(node.nodes[-1])
959 dups = len(node.nodes) - 1
960 for i in range(len(node.nodes)):
961 elt = node.nodes[i]
988 self.emit(op, len(node.nodes))
989 for child in node.nodes
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| pycodegen.py | 338 # The first few visitor methods handle nodes that generator new
377 for decorator in node.decorators.nodes:
379 ndecorators = len(node.decorators.nodes)
520 for child in node.nodes[:-1]:
524 self.visit(node.nodes[-1])
959 dups = len(node.nodes) - 1
960 for i in range(len(node.nodes)):
961 elt = node.nodes[i]
988 self.emit(op, len(node.nodes))
989 for child in node.nodes
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| pycodegen.py | 338 # The first few visitor methods handle nodes that generator new
377 for decorator in node.decorators.nodes:
379 ndecorators = len(node.decorators.nodes)
520 for child in node.nodes[:-1]:
524 self.visit(node.nodes[-1])
959 dups = len(node.nodes) - 1
960 for i in range(len(node.nodes)):
961 elt = node.nodes[i]
988 self.emit(op, len(node.nodes))
989 for child in node.nodes
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeWizard.java | 42 * In order to create nodes and navigate, this class needs a TreeAdaptor.
45 * iterating over the various nodes with a particular type.
107 * nodes such as function definition nodes (you'll want to seek
109 * dynamic searches; i.e., go find me all PLUS nodes.
167 /** Walk the entire tree and make a node name to nodes mapping.
199 /** Return a List of tree nodes with token type ttype */
201 final List nodes = new ArrayList(); local
204 nodes.add(t);
207 return nodes;
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/template-output/ |
| template-output.rb | 398 nodes = ANTLR3::AST::CommonTreeNodeStream.new( tree )
399 nodes.token_stream = tokens
400 tree_parser = TreeRewriteTG::TreeParser.new( nodes )
|
| /external/chromium-trace/catapult/third_party/py_vulcanize/py_vulcanize/ |
| project.py | 206 self.nodes = []
221 self.nodes.append(node)
229 '\n'.join(self.nodes), '\n'.join(self.edges))
|
| /external/testng/src/main/java/org/testng/xml/dom/ |
| DomUtil.java | 35 NodeList nodes = m_document.getChildNodes(); local
37 for (int i = 0; i < nodes.getLength(); i++) {
38 Node item1 = nodes.item(i);
|
| /external/v8/test/unittests/compiler/ |
| control-equivalence-unittest.cc | 45 bool IsEquivalenceClass(size_t length, Node** nodes) {
47 size_t expected_class = classes_[nodes[0]->id()];
49 in_class.Add(nodes[i]->id());
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/ |
| infoflow.py | 287 # types (nodes) and edges (information flows) which are below the
332 nodes = [n for n in self.G.nodes() if n not in self.exclude]
333 self.subG = self.G.subgraph(nodes)
|
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tree.pas | 109 /// Is tree considered a nil node used to make lists of child nodes?
159 /// constructing these nodes so we should have this control for
181 /// For identifying trees. How to identify nodes so we can say "add node
187 /// <item>Number the nodes as they are created?</item>
267 /// Each rule that creates AST nodes will call this
331 /// <summary>A stream of tree nodes, accessing nodes from a tree of some kind </summary>
344 /// If you don't want to buffer up nodes, then this method makes no
351 /// i<0 indicates nodes in the past. So LT(-1) is previous node, but
363 /// <summary>Return the text of all nodes from start to stop, inclusive
[all...] |
