| /external/antlr/runtime/Ruby/test/functional/ast-output/ |
| D | tree-rewrite.rb | 1010 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1011 nodes.token_stream = tokens
1012 walker = FlatListWalker::TreeParser.new( nodes )
1024 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1025 nodes.token_stream = tokens
1026 walker = SimpleTreeWalker::TreeParser.new( nodes )
1038 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1039 nodes.token_stream = tokens
1040 walker = CombinedRewriteAndAutoWalker::TreeParser.new( nodes )
1048 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
[all …]
|
| /external/swiftshader/third_party/SPIRV-Tools/test/util/ |
| D | ilist_test.cpp | 49 TestNode nodes[10]; in TEST() local
52 nodes[i].data_ = i; in TEST()
53 list.push_back(&nodes[i]); in TEST()
64 TestList BuildList(TestNode nodes[], int n) { in BuildList() argument
67 nodes[i].data_ = i; in BuildList()
68 list.push_back(&nodes[i]); in BuildList()
75 TestNode nodes[10]; in TEST() local
76 TestList list = BuildList(nodes, 10); in TEST()
82 TestNode nodes[10]; in TEST() local
83 TestList list = BuildList(nodes, 10); in TEST()
[all …]
|
| /external/deqp-deps/SPIRV-Tools/test/util/ |
| D | ilist_test.cpp | 49 TestNode nodes[10]; in TEST() local
52 nodes[i].data_ = i; in TEST()
53 list.push_back(&nodes[i]); in TEST()
64 TestList BuildList(TestNode nodes[], int n) { in BuildList() argument
67 nodes[i].data_ = i; in BuildList()
68 list.push_back(&nodes[i]); in BuildList()
75 TestNode nodes[10]; in TEST() local
76 TestList list = BuildList(nodes, 10); in TEST()
82 TestNode nodes[10]; in TEST() local
83 TestList list = BuildList(nodes, 10); in TEST()
[all …]
|
| /external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
| D | graphcycles_test.cc | 61 static void PrintNodes(Nodes *nodes) { in PrintNodes() argument
62 LOG(INFO) << "NODES (" << nodes->size() << ")"; in PrintNodes()
63 for (int i = 0; i != nodes->size(); i++) { in PrintNodes()
64 LOG(INFO) << (*nodes)[i]; in PrintNodes()
78 static void PrintGCEdges(Nodes *nodes, tensorflow::GraphCycles *gc) { in PrintGCEdges() argument
80 for (int i = 0; i != nodes->size(); i++) { in PrintGCEdges()
81 for (int j = 0; j != nodes->size(); j++) { in PrintGCEdges()
82 int a = (*nodes)[i]; in PrintGCEdges()
83 int b = (*nodes)[j]; in PrintGCEdges()
92 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges, in PrintTransitiveClosure() argument
[all …]
|
| /external/antlr/runtime/Ruby/test/functional/tree-parser/ |
| D | basic.rb | 37 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
38 nodes.token_stream = tokens
39 walker = FlatListWalker::TreeParser.new( nodes )
73 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
74 nodes.token_stream = tokens
75 walker = SimpleTreeWalker::TreeParser.new( nodes )
112 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
113 nodes.token_stream = tokens
114 walker = FlatVsTreeDecisionWalker::TreeParser.new( nodes )
150 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | SpillPlacement.cpp | 146 bool update(const Node nodes[]) { in update()
150 Sum += I->first * nodes[I->second].Value; in update()
175 assert(!nodes && "Leaking node array"); in runOnMachineFunction()
176 nodes = new Node[bundles->getNumBundles()]; in runOnMachineFunction()
185 nodes[bundles->getBundle(Num, 1)].Scale[0] += Freq; in runOnMachineFunction()
186 nodes[bundles->getBundle(Num, 0)].Scale[1] += Freq; in runOnMachineFunction()
192 if (nodes[i].Scale[d] > 0) in runOnMachineFunction()
193 nodes[i].Scale[d] = 1 / nodes[i].Scale[d]; in runOnMachineFunction()
200 delete[] nodes; in releaseMemory()
201 nodes = 0; in releaseMemory()
[all …]
|
| /external/mesa3d/src/util/ |
| D | register_allocate.c | 166 struct ra_node *nodes; member
397 BITSET_SET(g->nodes[n1].adjacency, n2); in ra_add_node_adjacency()
401 int n1_class = g->nodes[n1].class; in ra_add_node_adjacency()
402 int n2_class = g->nodes[n2].class; in ra_add_node_adjacency()
403 g->nodes[n1].q_total += g->regs->classes[n1_class]->q[n2_class]; in ra_add_node_adjacency()
405 if (g->nodes[n1].adjacency_count >= in ra_add_node_adjacency()
406 g->nodes[n1].adjacency_list_size) { in ra_add_node_adjacency()
407 g->nodes[n1].adjacency_list_size *= 2; in ra_add_node_adjacency()
408 g->nodes[n1].adjacency_list = reralloc(g, g->nodes[n1].adjacency_list, in ra_add_node_adjacency()
410 g->nodes[n1].adjacency_list_size); in ra_add_node_adjacency()
[all …]
|
| /external/strace/tests/ |
| D | move_pages.c | 79 print_node_array(const int *const nodes, in print_node_array() argument
84 printf("%s", nodes ? "[]" : "NULL"); in print_node_array()
88 printf("%p", nodes); in print_node_array()
102 printf("... /* %p */", nodes + i); in print_node_array()
105 printf("%d", nodes[i]); in print_node_array()
164 int *const nodes, in print_move_pages() argument
171 pid, count, pages, nodes, status, flags); in print_move_pages()
176 print_node_array(nodes, count, offset); in print_move_pages()
195 TAIL_ALLOC_OBJECT_VAR_PTR(int, nodes); in main()
199 print_move_pages(pid, 0, 0, pages, nodes, status); in main()
[all …]
|
| /external/strace/tests-mx32/ |
| D | move_pages.c | 79 print_node_array(const int *const nodes, in print_node_array() argument
84 printf("%s", nodes ? "[]" : "NULL"); in print_node_array()
88 printf("%p", nodes); in print_node_array()
102 printf("... /* %p */", nodes + i); in print_node_array()
105 printf("%d", nodes[i]); in print_node_array()
164 int *const nodes, in print_move_pages() argument
171 pid, count, pages, nodes, status, flags); in print_move_pages()
176 print_node_array(nodes, count, offset); in print_move_pages()
195 TAIL_ALLOC_OBJECT_VAR_PTR(int, nodes); in main()
199 print_move_pages(pid, 0, 0, pages, nodes, status); in main()
[all …]
|
| /external/strace/tests-m32/ |
| D | move_pages.c | 79 print_node_array(const int *const nodes, in print_node_array() argument
84 printf("%s", nodes ? "[]" : "NULL"); in print_node_array()
88 printf("%p", nodes); in print_node_array()
102 printf("... /* %p */", nodes + i); in print_node_array()
105 printf("%d", nodes[i]); in print_node_array()
164 int *const nodes, in print_move_pages() argument
171 pid, count, pages, nodes, status, flags); in print_move_pages()
176 print_node_array(nodes, count, offset); in print_move_pages()
195 TAIL_ALLOC_OBJECT_VAR_PTR(int, nodes); in main()
199 print_move_pages(pid, 0, 0, pages, nodes, status); in main()
[all …]
|
| /external/tensorflow/tensorflow/python/grappler/ |
| D | layout_optimizer_test.py | 207 def _assert_trans_nchw_to_nhwc(self, name, nodes): argument
208 self.assertIn(name + '-TransposeNCHWToNHWC-LayoutOptimizer', nodes)
210 def _assert_trans_nhwc_to_nchw(self, name, nodes): argument
211 self.assertIn(name + '-TransposeNHWCToNCHW-LayoutOptimizer', nodes)
213 def _assert_map_nhwc_to_nchw(self, name, nodes): argument
214 self.assertIn(name + '-DimMapNHWCToNCHW-LayoutOptimizer', nodes)
216 def _assert_vec_nchw_to_nhwc(self, name, nodes): argument
217 self.assertIn(name + '-VecPermuteNCHWToNHWC-LayoutOptimizer', nodes)
219 def _assert_vec_nhwc_to_nchw(self, name, nodes): argument
220 self.assertIn(name + '-VecPermuteNHWCToNCHW-LayoutOptimizer', nodes)
[all …]
|
| /external/tensorflow/tensorflow/core/grappler/graph_analyzer/ |
| D | sig_node.cc | 202 for (size_t n = 0; n < nodes.size(); ++n) { in ToString()
204 result += absl::StrFormat("%d:%s", n, nodes[n]->opcode()); in ToString()
205 for (const auto& entry : nodes[n]->hashed_peers_) { in ToString()
206 const auto& link = nodes[n]->hash_to_link_[entry.link_hash]; in ToString()
253 nodes.resize(0); // Keep the storage. in PrepareNodes()
270 nodes.emplace_back(node); in PrepareNodes()
276 std::sort(nodes.begin() + *next_node_id_p, nodes.end(), in FindUniqueHashes()
289 for (size_t n = *next_node_id_p; n < nodes.size(); ++n) { in FindUniqueHashes()
290 size_t cur_hash = nodes[n]->GetHighTopoHash(); in FindUniqueHashes()
291 if (n + 1 < nodes.size() && nodes[n + 1]->GetHighTopoHash() == cur_hash) { in FindUniqueHashes()
[all …]
|
| /external/tensorflow/tensorflow/python/autograph/pyct/ |
| D | qual_names_test.py | 195 nodes = resolve(parser.parse_str(textwrap.dedent(samples)))
196 nodes = tuple(n.value for n in nodes.body)
198 self.assertQNStringIs(nodes[0], 'a')
199 self.assertQNStringIs(nodes[1], 'a.b')
200 self.assertQNStringIs(nodes[2].elts[0], 'c')
201 self.assertQNStringIs(nodes[2].elts[1], 'd.e')
202 self.assertQNStringIs(nodes[3].elts[0], 'f')
203 self.assertQNStringIs(nodes[3].elts[1], 'g.h.i')
204 self.assertQNStringIs(nodes[4].func, 'j')
205 self.assertQNStringIs(nodes[4].args[0], 'k')
[all …]
|
| /external/chromium-trace/catapult/common/py_utils/py_utils/refactor/annotated_symbol/ |
| D | reference.py | 20 def Annotate(cls, nodes): argument
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 or
36 nodes[i].children[1].type != token.NAME):
[all …]
|
| /external/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| D | TreeIterator.java | 54 protected FastQueue<Object> nodes; field in TreeIterator
64 nodes = new FastQueue<Object>(); in TreeIterator()
73 nodes.clear(); in reset()
79 if ( nodes!=null && nodes.size()>0 ) return true; in hasNext()
90 nodes.add(eof); in next()
96 if ( nodes!=null && nodes.size()>0 ) return nodes.remove(); in next()
104 nodes.add(tree); // real node is next after DOWN in next()
113 nodes.add(up); // we're moving back up in next()
120 nodes.add(eof); // add to queue, might have UP nodes in there in next()
121 return nodes.remove(); in next()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | SpillPlacement.cpp | 156 bool update(const Node nodes[], const BlockFrequency &Threshold) { in update()
161 if (nodes[I->second].Value == -1) in update()
163 else if (nodes[I->second].Value == 1) in update()
186 const Node nodes[]) const { in getDissentingNeighbors()
191 if (Value != nodes[n].Value) in getDissentingNeighbors()
202 assert(!nodes && "Leaking node array"); in runOnMachineFunction()
203 nodes = new Node[bundles->getNumBundles()]; in runOnMachineFunction()
221 delete[] nodes; in releaseMemory()
222 nodes = nullptr; in releaseMemory()
232 nodes[n].clear(Threshold); in activate()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | SpillPlacement.cpp | 148 bool update(const Node nodes[], const BlockFrequency &Threshold) { in update()
153 if (nodes[I->second].Value == -1) in update()
155 else if (nodes[I->second].Value == 1) in update()
178 const Node nodes[]) const { in getDissentingNeighbors()
183 if (Value != nodes[n].Value) in getDissentingNeighbors()
194 assert(!nodes && "Leaking node array"); in runOnMachineFunction()
195 nodes = new Node[bundles->getNumBundles()]; in runOnMachineFunction()
213 delete[] nodes; in releaseMemory()
214 nodes = nullptr; in releaseMemory()
224 nodes[n].clear(Threshold); in activate()
[all …]
|
| /external/autotest/client/cros/audio/ |
| D | cras_utils.py | 235 nodes = get_cras_nodes()
236 for node in nodes:
333 nodes = get_cras_nodes()
334 for node in nodes:
372 nodes = get_cras_nodes()
373 for node in nodes:
384 nodes = get_cras_nodes()
385 for node in nodes:
396 nodes = get_cras_nodes()
397 for node in nodes:
[all …]
|
| /external/ltp/testcases/kernel/syscalls/move_pages/ |
| D | move_pages_support.c | 63 int alloc_pages_on_nodes(void **pages, unsigned int num, int *nodes) in alloc_pages_on_nodes() argument
78 pages[i] = numa_alloc_onnode(onepage, nodes[i]); in alloc_pages_on_nodes()
82 "%d failed", nodes[i]); in alloc_pages_on_nodes()
112 int nodes[num]; in alloc_pages_linear() local
127 nodes[i] = allowed_nodes[n]; in alloc_pages_linear()
135 return alloc_pages_on_nodes(pages, num, nodes); in alloc_pages_linear()
153 int nodes[num]; in alloc_pages_on_node() local
156 nodes[i] = node; in alloc_pages_on_node()
158 return alloc_pages_on_nodes(pages, num, nodes); in alloc_pages_on_node()
169 verify_pages_on_nodes(void **pages, int *status, unsigned int num, int *nodes) in verify_pages_on_nodes() argument
[all …]
|
| /external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| D | BufferedTreeNodeStream.cs | 80 if (_index < _outer.nodes.Count)
81 return _outer.nodes[_index];
99 if (_index < _outer.nodes.Count) in MoveNext()
102 return _index < _outer.nodes.Count; in MoveNext()
128 protected IList nodes; field in Antlr.Runtime.Tree.BufferedTreeNodeStream
164 nodes = new List<object>(initialBufferSize); in BufferedTreeNodeStream()
177 return nodes.Count;
259 nodes.Add(t); // add this node in FillBuffer()
284 for (int i = 0; i < nodes.Count; i++) { in GetNodeIndex()
285 object t = nodes[i]; in GetNodeIndex()
[all …]
|
| D | TreeIterator.cs | 55 protected Queue<object> nodes; field in Antlr.Runtime.Tree.TreeIterator
65 nodes = new Queue<object>(); in TreeIterator()
95 nodes.Enqueue(eof); in MoveNext()
100 if (nodes != null && nodes.Count > 0) { in MoveNext()
101 Current = nodes.Dequeue(); in MoveNext()
110 nodes.Enqueue(tree); // real node is next after DOWN in MoveNext()
118 nodes.Enqueue(up); // we're moving back up in MoveNext()
126 nodes.Enqueue(eof); // add to queue, might have UP nodes in there in MoveNext()
127 Current = nodes.Dequeue(); in MoveNext()
133 nodes.Enqueue(tree); // add to queue, might have UP nodes in there in MoveNext()
[all …]
|
| /external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| D | BufferedTreeNodeStream.cs | 86 if ( _index < _outer.nodes.Count )
87 return _outer.nodes[_index];
107 if ( _index < _outer.nodes.Count ) in MoveNext()
110 return _index < _outer.nodes.Count; in MoveNext()
137 protected IList nodes; field in Antlr.Runtime.Tree.BufferedTreeNodeStream
176 nodes = new List<object>( initialBufferSize ); in BufferedTreeNodeStream()
192 return nodes.Count;
297 nodes.Add( t ); // add this node in FillBuffer()
327 for ( int i = 0; i < nodes.Count; i++ ) in GetNodeIndex()
329 object t = nodes[i]; in GetNodeIndex()
[all …]
|
| /external/antlr/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| D | CommonTreeNodeStream.js | 41 this.nodes = []; //new ArrayList(initialBufferSize); property in org.antlr.runtime.tree.CommonTreeNodeStream
57 nodes = this.nodes,
62 return i<nodes.length;
68 if ( current < nodes.length ) {
69 return nodes[current];
92 this.nodes.push(t); // add this node
120 for (i=0; i<this.nodes.length; i++) {
121 t = this.nodes[i];
151 this.nodes.push(navNode);
158 return this.nodes[i];
[all …]
|
| /external/autotest/server/site_tests/audio_AudioNodeSwitch/ |
| D | audio_AudioNodeSwitch.py | 77 def switch_nodes_and_check_volume(self, nodes): argument
83 if len(nodes) == 1:
84 self.check_active_node_volume(nodes[0])
85 for node in nodes:
104 nodes = []
107 nodes.append('INTERNAL_SPEAKER')
108 self.switch_nodes_and_check_volume(nodes)
130 nodes.append('HDMI')
131 self.switch_nodes_and_check_volume(nodes)
149 nodes.append(hp_jack_node_type)
[all …]
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/python/kernel_tests/ |
| D | prediction_ops_test.py | 231 _append_to_leaf(tree.nodes.add().leaf, 0, -0.4)
259 leaf = tree.nodes.add().leaf
290 _append_to_leaf(tree1.nodes.add().leaf, 0, -0.4)
295 _set_float_split(tree2.nodes.add().dense_float_binary_split, 0, 9.0, 1, 2)
296 _set_float_split(tree2.nodes.add()
299 _append_to_leaf(tree2.nodes.add().leaf, 0, 0.5)
300 _append_to_leaf(tree2.nodes.add().leaf, 0, 1.2)
301 _set_categorical_id_split(tree2.nodes.add().categorical_id_binary_split,
303 _append_to_leaf(tree2.nodes.add().leaf, 0, -0.9)
304 _append_to_leaf(tree2.nodes.add().leaf, 0, 0.7)
[all …]
|