| /external/antlr/antlr-3.4/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/antlr/antlr-3.4/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
393 BITSET_SET(g->nodes[n1].adjacency, n2); in ra_add_node_adjacency()
396 int n1_class = g->nodes[n1].class; in ra_add_node_adjacency()
397 int n2_class = g->nodes[n2].class; in ra_add_node_adjacency()
398 g->nodes[n1].q_total += g->regs->classes[n1_class]->q[n2_class]; in ra_add_node_adjacency()
401 if (g->nodes[n1].adjacency_count >= in ra_add_node_adjacency()
402 g->nodes[n1].adjacency_list_size) { in ra_add_node_adjacency()
403 g->nodes[n1].adjacency_list_size *= 2; in ra_add_node_adjacency()
404 g->nodes[n1].adjacency_list = reralloc(g, g->nodes[n1].adjacency_list, in ra_add_node_adjacency()
406 g->nodes[n1].adjacency_list_size); in ra_add_node_adjacency()
[all …]
|
| /external/v8/src/compiler/ |
| D | graph.h | 71 Node* nodes[] = {n1, n2}; in NON_EXPORTED_BASE() local
72 return NewNode(op, arraysize(nodes), nodes); in NON_EXPORTED_BASE()
75 Node* nodes[] = {n1, n2, n3}; in NON_EXPORTED_BASE() local
76 return NewNode(op, arraysize(nodes), nodes); in NON_EXPORTED_BASE()
79 Node* nodes[] = {n1, n2, n3, n4}; in NON_EXPORTED_BASE() local
80 return NewNode(op, arraysize(nodes), nodes); in NON_EXPORTED_BASE()
84 Node* nodes[] = {n1, n2, n3, n4, n5}; in NON_EXPORTED_BASE() local
85 return NewNode(op, arraysize(nodes), nodes); in NON_EXPORTED_BASE()
89 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; in NON_EXPORTED_BASE() local
90 return NewNode(op, arraysize(nodes), nodes); in NON_EXPORTED_BASE()
[all …]
|
| D | common-node-cache.cc | 24 void CommonNodeCache::GetCachedNodes(ZoneVector<Node*>* nodes) { in GetCachedNodes() argument
25 int32_constants_.GetCachedNodes(nodes); in GetCachedNodes()
26 int64_constants_.GetCachedNodes(nodes); in GetCachedNodes()
27 float32_constants_.GetCachedNodes(nodes); in GetCachedNodes()
28 float64_constants_.GetCachedNodes(nodes); in GetCachedNodes()
29 external_constants_.GetCachedNodes(nodes); in GetCachedNodes()
30 number_constants_.GetCachedNodes(nodes); in GetCachedNodes()
31 heap_constants_.GetCachedNodes(nodes); in GetCachedNodes()
32 relocatable_int32_constants_.GetCachedNodes(nodes); in GetCachedNodes()
33 relocatable_int64_constants_.GetCachedNodes(nodes); in GetCachedNodes()
|
| /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/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/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| D | TreeIterator.java | 55 protected FastQueue nodes; field in TreeIterator
65 nodes = new FastQueue(); in TreeIterator()
74 nodes.clear(); in reset()
79 if ( nodes!=null && nodes.size()>0 ) return true; in hasNext()
89 nodes.add(eof); in next()
95 if ( nodes!=null && nodes.size()>0 ) return nodes.remove(); in next()
103 nodes.add(tree); // real node is next after DOWN in next()
112 nodes.add(up); // we're moving back up in next()
119 nodes.add(eof); // add to queue, might have UP nodes in there in next()
120 return nodes.remove(); in next()
[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/server/site_tests/audio_AudioNodeSwitch/ |
| D | audio_AudioNodeSwitch.py | 75 def switch_nodes_and_check_volume(self, nodes): argument
81 if len(nodes) == 1:
82 self.check_active_node_volume(nodes[0])
83 for node in nodes:
101 nodes = []
104 nodes.append('INTERNAL_SPEAKER')
105 self.switch_nodes_and_check_volume(nodes)
123 nodes.append('HDMI')
124 self.switch_nodes_and_check_volume(nodes)
142 nodes.append(hp_jack_node_type)
[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/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| 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 …]
|
| 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 …]
|
| /external/antlr/antlr-3.4/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 …]
|
| D | TreeIterator.cs | 58 protected Queue<object> nodes; field in Antlr.Runtime.Tree.TreeIterator
70 nodes = new Queue<object>(); in TreeIterator()
105 nodes.Enqueue( eof ); in MoveNext()
112 if ( nodes != null && nodes.Count > 0 ) in MoveNext()
114 Current = nodes.Dequeue(); in MoveNext()
129 nodes.Enqueue( tree ); // real node is next after DOWN in MoveNext()
140 nodes.Enqueue( up ); // we're moving back up in MoveNext()
149 nodes.Enqueue( eof ); // add to queue, might have UP nodes in there in MoveNext()
150 Current = nodes.Dequeue(); in MoveNext()
158 nodes.Enqueue( tree ); // add to queue, might have UP nodes in there in MoveNext()
[all …]
|
| /external/antlr/antlr-3.4/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/brotli/enc/ |
| D | backward_references_hq.c | 220 static BROTLI_INLINE void UpdateZopfliNode(ZopfliNode* nodes, size_t pos, in UpdateZopfliNode() argument
223 ZopfliNode* next = &nodes[pos + len]; in UpdateZopfliNode()
274 const ZopfliNode* nodes, in ComputeMinimumCopyLength() argument
282 while (pos + len <= num_bytes && nodes[pos + len].u.cost <= min_cost) { in ComputeMinimumCopyLength()
303 const ZopfliNode* nodes) { in ComputeDistanceShortcut() argument
304 const size_t clen = ZopfliNodeCopyLength(&nodes[pos]); in ComputeDistanceShortcut()
305 const size_t ilen = nodes[pos].insert_length; in ComputeDistanceShortcut()
306 const size_t dist = ZopfliNodeCopyDistance(&nodes[pos]); in ComputeDistanceShortcut()
316 ZopfliNodeDistanceCode(&nodes[pos]) > 0) { in ComputeDistanceShortcut()
319 return nodes[pos - clen - ilen].u.shortcut; in ComputeDistanceShortcut()
[all …]
|
| /external/python/cpython2/Lib/lib2to3/ |
| D | patcomp.py | 101 nodes = node.children
102 if len(nodes) >= 3 and nodes[1].type == token.EQUAL:
103 name = nodes[0].value
104 nodes = nodes[2:]
106 if len(nodes) >= 2 and nodes[-1].type == self.syms.Repeater:
107 repeat = nodes[-1]
108 nodes = nodes[:-1]
111 pattern = self.compile_basic(nodes, repeat)
139 def compile_basic(self, nodes, repeat=None): argument
141 assert len(nodes) >= 1
[all …]
|
| /external/python/cpython2/Tools/compiler/ |
| D | ast.txt | 1 # This file describes the nodes of the AST in ast.py. The module is
6 # ! this child is a sequence that contains nodes in it
13 Stmt: nodes!
14 Decorators: nodes!
35 Print: nodes!, dest&
36 Printnl: nodes!, dest&
39 Assign: nodes!, expr
40 AssTuple: nodes!
41 AssList: nodes!
51 List: nodes!
[all …]
|
| /external/doclava/src/com/google/doclava/ |
| D | Hierarchy.java | 27 HashMap<String, TreeSet<String>> nodes = new HashMap<String, TreeSet<String>>(); in makeHierarchy() local
32 TreeSet<String> me = nodes.get(name); in makeHierarchy()
35 nodes.put(name, me); in makeHierarchy()
41 TreeSet<String> s = nodes.get(sname); in makeHierarchy()
44 nodes.put(sname, s); in makeHierarchy()
57 int depth = depth(nodes, "java.lang.Object"); in makeHierarchy()
62 recurse(nodes, "java.lang.Object", hdf.getChild("classes.0"), depth, depth); in makeHierarchy()
65 Set<String> keys = nodes.keySet(); in makeHierarchy()
76 private static int depth(HashMap<String, TreeSet<String>> nodes, String name) { in depth() argument
78 TreeSet<String> derived = nodes.get(name); in depth()
[all …]
|
| /external/python/cpython2/Lib/compiler/ |
| D | ast.py | 21 nodes = {} variable
40 nodes["expression"] = "Expression"
69 def __init__(self, nodes, lineno=None): argument
70 self.nodes = nodes
74 return tuple(flatten(self.nodes))
78 nodelist.extend(flatten_nodes(self.nodes))
82 return "And(%s)" % (repr(self.nodes),)
101 def __init__(self, nodes, lineno=None): argument
102 self.nodes = nodes
106 return tuple(flatten(self.nodes))
[all …]
|
| /external/libmojo/third_party/jinja2/ |
| D | 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 \
|