| /external/llvm/lib/CodeGen/ |
| SpillPlacement.h | 49 Node *nodes; member in class:llvm::SpillPlacement
51 // Nodes that are active in the current computation. Owned by the prepare()
55 // Nodes with active links. Populated by scanActiveBundles.
58 // Nodes that went positive during the last call to scanActiveBundles or
72 SpillPlacement() : MachineFunctionPass(ID), nodes(nullptr) {}
127 /// Return true is there are any positive nodes.
|
| /external/selinux/libsepol/cil/src/ |
| cil_symtab.h | 39 struct cil_list *nodes; member in struct:cil_symtab_datum
46 #define NODE(n) ((struct cil_tree_node *)(DATUM(n)->nodes->head->data))
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue127/ |
| NullAliasTest.java | 24 import org.yaml.snakeyaml.nodes.Node;
25 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue133/ |
| StackOverflowTest.java | 24 import org.yaml.snakeyaml.nodes.NodeTuple;
25 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue46/ |
| FileTest.java | 25 import org.yaml.snakeyaml.nodes.Node;
26 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue48/ |
| SkipJavaBeanPropertyTest.java | 22 import org.yaml.snakeyaml.nodes.NodeTuple;
23 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/serializer/ |
| AnchorGeneratorTest.java | 21 import org.yaml.snakeyaml.nodes.Node;
22 import org.yaml.snakeyaml.nodes.Tag;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| PropertyCallback.java | 41 * @param targetNodes the nodes to apply the property to, or null to use the
42 * nodes pass into the
67 final List<? extends INode> nodes = selectedNodes; local
71 for (INode targetNode : nodes) {
|
| /external/regex-re2/re2/ |
| onepass.cc | 199 // Basically (OneState*)(nodes + statesize*nodeindex)
201 static inline OneState* IndexToNode(volatile uint8* nodes, int statesize,
204 const_cast<uint8*>(nodes + statesize*nodeindex));
245 volatile uint8* nodes = onepass_nodes_; local
264 state = IndexToNode(nodes, statesize, nextindex);
404 uint8* nodes = new uint8[maxnodes*statesize]; local
405 uint8* nodep = nodes;
415 OneState* node = IndexToNode(nodes, statesize, nodeindex);
576 OneState* node = IndexToNode(nodes, statesize, nodeindex);
594 memmove(nodep, nodes, nalloc*statesize)
[all...] |
| /build/kati/ |
| exec.go | 172 var nodes []*DepNode
174 if len(g.nodes) > 0 {
175 nodes = append(nodes, g.nodes[0])
179 for _, n := range g.nodes {
185 nodes = append(nodes, n)
189 for _, root := range nodes {
198 for _, root := range nodes {
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| Graph.py | 21 The Graph class represents a directed graph with *N* nodes and *E* edges.
45 self.nodes, self.edges = {}, {}
61 return '<Graph: %d nodes, %d edges>' % (
73 # the nodes will contain tuples that will store incoming edges,
83 if node not in self.nodes:
84 self.nodes[node] = ([], [], node_data)
90 It may create the nodes if adding edges between nonexisting ones.
100 # add nodes if on automatic node creation
105 # update the corresponding incoming and outgoing lists in the nodes
110 self.nodes[tail_id][0].append(edge
[all...] |
| /external/mesa3d/src/glsl/ |
| loop_unroll.cpp | 55 int nodes; member in class:loop_unroll_count
60 nodes = 0;
68 nodes++;
74 nodes++;
117 if (count.fail || count.nodes * iterations > (int)max_iterations * 5)
|
| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlParser.java | 60 // The entire array of nodes
61 private List<HtmlDocument.Node> nodes; field in class:HtmlParser
189 // Use a LinkedList because we don't know the number of nodes ahead of
191 nodes = Lists.newLinkedList();
235 nodes = coalesceTextNodes(nodes);
237 HtmlDocument doc = new HtmlDocument(nodes);
238 nodes = null;
244 * During the course of parsing, we may have multiple adjacent Text nodes,
245 * due to the sanitizer stripping out nodes between Text nodes. It i
[all...] |
| /external/ImageMagick/MagickCore/ |
| splay-tree.c | 105 nodes;
221 splay_tree->nodes++;
252 static NodeInfo *LinkSplayTreeNodes(NodeInfo **nodes,const size_t low,
262 node=nodes[bisect];
266 node->left=LinkSplayTreeNodes(nodes,low,bisect-1);
270 node->right=LinkSplayTreeNodes(nodes,bisect+1,high);
274 static inline int SplayTreeToNodeArray(NodeInfo *node,const void *nodes)
279 p=(const NodeInfo ***) nodes;
289 **nodes;
291 if (splay_tree->nodes <= 2
102 nodes; member in struct:_SplayTreeInfo
283 **nodes; local
989 **nodes; local
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 236 const RealScalar nodes[] = { 0.1127016653792583114820734600217600L, 0.5000000000000000000000000000000000L, local
244 result += weights[k] * (MatrixType::Identity(T.rows(), T.rows()) + nodes[k] * TminusI)
252 const RealScalar nodes[] = { 0.0694318442029737123880267555535953L, 0.3300094782075718675986671204483777L, local
260 result += weights[k] * (MatrixType::Identity(T.rows(), T.rows()) + nodes[k] * TminusI)
268 const RealScalar nodes[] = { 0.0469100770306680036011865608503035L, 0.2307653449471584544818427896498956L, local
278 result += weights[k] * (MatrixType::Identity(T.rows(), T.rows()) + nodes[k] * TminusI)
286 const RealScalar nodes[] = { 0.0337652428984239860938492227530027L, 0.1693953067668677431693002024900473L, local
296 result += weights[k] * (MatrixType::Identity(T.rows(), T.rows()) + nodes[k] * TminusI)
304 const RealScalar nodes[] = { 0.0254460438286207377369051579760744L, 0.1292344072003027800680676133596058L, local
316 result += weights[k] * (MatrixType::Identity(T.rows(), T.rows()) + nodes[k] * TminusI
324 const RealScalar nodes[] = { 0.0198550717512318841582195657152635L, 0.1016667612931866302042230317620848L, local
344 const RealScalar nodes[] = { 0.0159198802461869550822118985481636L, 0.0819844463366821028502851059651326L, local
366 const RealScalar nodes[] = { 0.0130467357414141399610179939577740L, 0.0674683166555077446339516557882535L, local
388 const RealScalar nodes[] = { 0.0108856709269715035980309994385713L, 0.0564687001159523504624211153480364L, local
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/ |
| jsonresponse.py | 31 self.nodes = [('root', root_node)]
36 t = self.nodes[-1][1].startElement(name, attrs, self.connection)
39 self.nodes.append(t)
41 self.nodes.append((name, t))
44 self.nodes[-1][1].endElement(name, self.current_text, self.connection)
45 if self.nodes[-1][0] == name:
46 self.nodes.pop()
|
| /external/fio/t/ |
| genzipf.c | 177 struct node *nodes; local
206 nodes = malloc(nranges * sizeof(struct node));
220 hash_insert(&nodes[j], offset);
227 qsort(nodes, j, sizeof(struct node), node_cmp);
234 printf("%lu, %lu\n", k, nodes[k].hits);
248 struct node *node = &nodes[k];
320 free(nodes);
|
| /external/opencv3/modules/objdetect/src/ |
| cascadedetect_convert.cpp | 104 std::vector<HaarClassifierNode> nodes; member in struct:cv::haar_cvt::HaarClassifier
192 weak.nodes.push_back(node);
229 int nnodes = (int)c.nodes.size(), nleaves = (int)c.leaves.size();
231 newfs << c.nodes[k].left << c.nodes[k].right
232 << c.nodes[k].f << c.nodes[k].threshold;
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/composer/ |
| Composer.java | 31 import org.yaml.snakeyaml.nodes.MappingNode;
32 import org.yaml.snakeyaml.nodes.Node;
33 import org.yaml.snakeyaml.nodes.NodeId;
34 import org.yaml.snakeyaml.nodes.NodeTuple;
35 import org.yaml.snakeyaml.nodes.ScalarNode;
36 import org.yaml.snakeyaml.nodes.SequenceNode;
37 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/representer/ |
| BaseRepresenter.java | 28 import org.yaml.snakeyaml.nodes.AnchorNode;
29 import org.yaml.snakeyaml.nodes.MappingNode;
30 import org.yaml.snakeyaml.nodes.Node;
31 import org.yaml.snakeyaml.nodes.NodeTuple;
32 import org.yaml.snakeyaml.nodes.ScalarNode;
33 import org.yaml.snakeyaml.nodes.SequenceNode;
34 import org.yaml.snakeyaml.nodes.Tag;
|
| Representer.java | 30 import org.yaml.snakeyaml.nodes.MappingNode;
31 import org.yaml.snakeyaml.nodes.Node;
32 import org.yaml.snakeyaml.nodes.NodeId;
33 import org.yaml.snakeyaml.nodes.NodeTuple;
34 import org.yaml.snakeyaml.nodes.ScalarNode;
35 import org.yaml.snakeyaml.nodes.SequenceNode;
36 import org.yaml.snakeyaml.nodes.Tag;
|
| /libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/ |
| DoubleNodeTest.java | 38 @DataProvider(name = "nodes")
48 List<Node<Double>> nodes = new ArrayList<>(); local
50 nodes.add(Nodes.node(array));
51 nodes.add(degenerateTree(Spliterators.iterator(Arrays.spliterator(array))));
52 nodes.add(tree(toList(array), l -> Nodes.node(toDoubleArray(l))));
53 nodes.add(fill(array, Nodes.doubleBuilder(array.length)));
54 nodes.add(fill(array, Nodes.doubleBuilder()))
[all...] |
| IntNodeTest.java | 38 @DataProvider(name = "nodes")
48 List<Node<Integer>> nodes = new ArrayList<>(); local
50 nodes.add(Nodes.node(array));
51 nodes.add(degenerateTree(Spliterators.iterator(Arrays.spliterator(array))));
52 nodes.add(tree(toList(array), l -> Nodes.node(toIntArray(l))));
53 nodes.add(fill(array, Nodes.intBuilder(array.length)));
54 nodes.add(fill(array, Nodes.intBuilder()))
[all...] |
| LongNodeTest.java | 38 @DataProvider(name = "nodes")
48 List<Node<Long>> nodes = new ArrayList<>(); local
50 nodes.add(Nodes.node(array));
51 nodes.add(degenerateTree(Spliterators.iterator(Arrays.spliterator(array))));
52 nodes.add(tree(toList(array), l -> Nodes.node(toLongArray(l))));
53 nodes.add(fill(array, Nodes.longBuilder(array.length)));
54 nodes.add(fill(array, Nodes.longBuilder()))
[all...] |
| /prebuilts/go/darwin-x86/src/go/types/ |
| initorder.go | 20 // of graph nodes
38 // repeatedly, until there are no nodes left.
39 // In a valid Go program, those nodes always have zero dependencies (after
48 // if n still depends on other nodes, we have a cycle
50 mark++ // mark nodes using a different value each time
60 // reduce dependency count of all dependent nodes
100 // findPath returns the (reversed) list of nodes z, ... c, b, a,
103 // Nodes marked with the value mark are considered "visited";
104 // unvisited nodes are marked during the graph search.
154 // Nodes may be marked for cycle detection. A node n is marke
[all...] |
