/external/chromium_org/third_party/mesa/src/src/mapi/glapi/gen/ |
H A D | glX_server_table.py | 180 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/mesa3d/src/mapi/glapi/gen/ |
H A D | glX_server_table.py | 180 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/lldb/source/Target/ |
H A D | StackFrame.cpp | 758 long child_index = ::strtol (&var_path[1], &end, 0); local 830 else if (child_index >= synthetic->GetNumChildren() /* synthetic does not have that many values */) 834 child_index, 840 child_valobj_sp = synthetic->GetChildAtIndex(child_index, true); 845 child_index, 853 child_valobj_sp = valobj_sp->GetSyntheticArrayMemberFromPointer (child_index, true); 858 child_index, 868 child_valobj_sp = valobj_sp->GetChildAtIndex (child_index, true); 870 child_valobj_sp = valobj_sp->GetSyntheticArrayMember (child_index, true); 876 child_index, [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
H A D | test-tree-wizard.rb | 254 @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, label [all...] |
H A D | test-trees.rb | 53 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 [all...] |
/external/chromium_org/ui/views/accessibility/ |
H A D | native_view_accessibility_win_unittest.cc | 61 ScopedVariant child_index(1); 63 child_index, textfield_dispatch.Receive())); 106 ScopedVariant child_index(-999); 108 child_index, result_dispatch.Receive()));
|
/external/chromium_org/content/browser/accessibility/ |
H A D | browser_accessibility.h | 89 BrowserAccessibility* PlatformGetChild(uint32 child_index) const; 153 BrowserAccessibility* InternalGetChild(uint32 child_index) const;
|
H A D | browser_accessibility.cc | 85 uint32 child_index) const { 86 DCHECK(child_index < InternalChildCount()); 87 BrowserAccessibility* result = InternalGetChild(child_index); 124 uint32 child_index) const { 127 return manager_->GetFromAXNode(node_->children()[child_index]);
|
H A D | browser_accessibility_win.h | 660 CONTENT_EXPORT STDMETHODIMP get_childAt(unsigned int child_index,
|
H A D | browser_accessibility_win.cc | 2668 unsigned int child_index, 2676 if (child_index >= PlatformChildCount()) 2679 BrowserAccessibility* child = PlatformGetChild(child_index); 2667 get_childAt( unsigned int child_index, ISimpleDOMNode** node) argument
|
/external/netperf/ |
H A D | netcpu_looper.c | 177 sit_and_spin(int child_index) argument 190 child_index, 200 PAGES_PER_CHILD * child_index)); 215 bind_to_specific_processor(child_index % lib_num_loc_cpus,1);
|
/external/chromium_org/chrome/browser/ui/webui/ |
H A D | cookies_tree_model_util.cc | 337 int child_index = -1; local 346 child_index = parent->GetIndexOf(child); 347 if (child_index == -1) 353 return child_index >= 0 ? child : NULL;
|
/external/chromium_org/v8/src/ |
H A D | liveedit-debugger.js | 599 var child_index = 0; 605 if (child_index < info_node.children.length) { 606 var child = info_node.children[child_index]; 610 child_index++; 625 child_index++; 632 child_index++; 650 while (child_index < info_node.children.length) { 651 var child = info_node.children[child_index]; 653 child_index++;
|
H A D | objects.cc | 7850 int child_index = 2 * parent_index + 1; local 7851 uint32_t child_hash = GetSortedKey(child_index)->Hash(); 7852 if (child_index + 1 < len) { 7853 uint32_t right_child_hash = GetSortedKey(child_index + 1)->Hash(); 7855 child_index++; 7860 SwapSortedKeys(parent_index, child_index); 7861 // Now element at child_index could be < its children. 7862 parent_index = child_index; // parent_hash remains correct. 7875 int child_index = parent_index * 2 + 1; local 7876 uint32_t child_hash = GetSortedKey(child_index) 13273 int child_index = i; local 13294 int child_index = ((parent_index + 1) << 1) - 1; local [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
H A D | wizard.rb | 387 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/chromium_org/tools/deep_memory_profiler/visualizer/static/third_party/jqTree/ |
H A D | tree.jquery.js | 612 var child_index, node; 617 child_index = this.parent.getChildIndex(this); 618 this.parent.addChildAtPosition(node, child_index + 1); 624 var child_index, node; 629 child_index = this.parent.getChildIndex(this); 630 this.parent.addChildAtPosition(node, child_index);
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | error.rb | 571 2. A node has a child at index +n+, but the child's +@child_index+ value is not
|
H A D | tree.rb | 226 attr_accessor :child_index 320 @child_index = 0 339 child.child_index = length + index 343 child_tree.child_index = length 352 @child_index = -1 363 tree.child_index = index 393 node.child_index = i 401 i == @child_index or 402 raise TreeInconsistency.failed_index_check!( i, @child_index ) 477 @child_index 698 def child_index( tree ) method in class:ANTLR3.CommonTree.TreeAdaptor [all...] |