Home
last modified time | relevance | path

Searched refs:child_index (Results 1 – 9 of 9) sorted by relevance

/external/antlr/antlr-3.4/runtime/Ruby/test/unit/
Dtest-tree-wizard.rb254 @wizard.visit( tree, B ) do |node, parent, child_index, labels|
266 @wizard.visit( tree, C ) do |node, parent, child_index, labels|
278 @wizard.visit( tree, B ) do |node, parent, child_index, labels|
290 @wizard.visit( tree, A ) do |node, parent, child_index, labels|
305 @wizard.visit( tree, B ) do |node, parent, child_index, labels|
306 elements << context(node, parent, child_index)
317 @wizard.visit( tree, A ) do |node, parent, child_index, labels|
318 elements << context(node, parent, child_index)
328 @wizard.visit(tree, '(A B)') do |node, parent, child_index, labels|
340 @wizard.visit(tree, '(A B)') do |node, parent, child_index, labels|
[all …]
Dtest-trees.rb53 root_0.child_index.should == -1
54 t.child_index.should == 0
55 u.child_index.should == 1
469 t.child_index.should == -1
480 r0.child_index.should == -1
494 r0.child_index.should == -1
496 c0.child_index.should == 0
498 c1.child_index.should == 1
500 c2.child_index.should == 2
517 root.child_index.should == -1
[all …]
/external/mesa3d/src/mapi/glapi/gen/
DglX_server_table.py180 child_index = base_entry
221 print ' %u,' % (child_index)
222 child_index += child[2]
228 child_index = base_entry
231 self.dump_tree(child, base_opcode, remaining_bits - M, child_index, depth + 1)
232 child_index += child[2]
/external/netperf/src/
Dnetcpu_looper.c177 sit_and_spin(int child_index) in sit_and_spin() argument
190 child_index, in sit_and_spin()
200 PAGES_PER_CHILD * child_index)); in sit_and_spin()
215 bind_to_specific_processor(child_index % lib_num_loc_cpus,1); in sit_and_spin()
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
Dwizard.rb387 index = @adaptor.child_index( tree )
396 index = @adaptor.child_index( tree )
410 visit( tree, pattern.type ) do | tree, parent, child_index, labels |
412 yield( tree, parent, child_index, labels )
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
Dtree.rb339 child.child_index = length + index
343 child_tree.child_index = length
363 tree.child_index = index
393 node.child_index = i
698 def child_index( tree ) method
699 tree.child_index rescue 0
713 set_child_index( new_tree, child_index( tree ) )
772 tree.child_index = index
/external/v8/src/debug/
Dliveedit.js613 var child_index = 0;
619 if (child_index < info_node.children.length) {
620 var child = info_node.children[child_index];
624 child_index++;
639 child_index++;
646 child_index++;
664 while (child_index < info_node.children.length) {
665 var child = info_node.children[child_index];
667 child_index++;
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Ruby/
DAST.stg110 @adaptor.child_index( return_value.start ),
111 @adaptor.child_index( _last ),
/external/v8/src/
Dobjects.cc10874 int child_index = 2 * parent_index + 1; in Sort() local
10875 uint32_t child_hash = GetSortedKey(child_index)->Hash(); in Sort()
10876 if (child_index + 1 < len) { in Sort()
10877 uint32_t right_child_hash = GetSortedKey(child_index + 1)->Hash(); in Sort()
10879 child_index++; in Sort()
10884 SwapSortedKeys(parent_index, child_index); in Sort()
10886 parent_index = child_index; // parent_hash remains correct. in Sort()
10899 int child_index = parent_index * 2 + 1; in Sort() local
10900 uint32_t child_hash = GetSortedKey(child_index)->Hash(); in Sort()
10901 if (child_index + 1 < i) { in Sort()
[all …]