Searched defs:child_index (Results 1 - 7 of 7) sorted by relevance

/external/chromium/chrome/browser/accessibility/
H A Dbrowser_accessibility.cc101 BrowserAccessibility* BrowserAccessibility::GetChild(uint32 child_index) { argument
102 DCHECK(child_index < children_.size());
103 return children_[child_index];
H A Dbrowser_accessibility_win.cc1030 unsigned int child_index,
1038 if (child_index < children_.size()) {
1039 *node = children_[child_index]->toBrowserAccessibilityWin()->NewReference();
1029 get_childAt( unsigned int child_index, ISimpleDOMNode** node) argument
/external/chromium/chrome/browser/ui/webui/
H A Dcookies_tree_model_util.cc204 int child_index = -1; local
211 child_index = parent->GetIndexOf(child);
212 if (child_index == -1)
218 return child_index >= 0 ? child : NULL;
/external/netperf/
H A Dnetcpu_looper.c177 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/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Dtree.rb226 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...]
/external/v8/src/
H A Dprofile-generator.cc934 int child_index, Type type, const char* name, HeapEntry* to) {
939 child_index_ = child_index;
946 void HeapGraphEdge::Init(int child_index, Type type, int index, HeapEntry* to) { argument
948 child_index_ = child_index;
955 void HeapGraphEdge::Init(int child_index, int index, HeapEntry* to) { argument
956 Init(child_index, kElement, index, to);
986 int child_index,
990 children()[child_index].Init(child_index, type, name, entry);
991 entry->retainers()[retainer_index] = children_arr() + child_index;
933 Init( int child_index, Type type, const char* name, HeapEntry* to) argument
985 SetNamedReference(HeapGraphEdge::Type type, int child_index, const char* name, HeapEntry* entry, int retainer_index) argument
995 SetIndexedReference(HeapGraphEdge::Type type, int child_index, int index, HeapEntry* entry, int retainer_index) argument
1005 SetUnidirElementReference( int child_index, int index, HeapEntry* entry) argument
2993 int child_index, retainer_index; local
3004 int child_index, retainer_index; local
3016 int child_index, retainer_index; local
3027 int child_index, retainer_index; local
[all...]
H A Dobjects.cc5848 int child_index = 2 * parent_index + 1; local
5849 uint32_t child_hash = GetKey(child_index)->Hash();
5850 if (child_index + 1 < len) {
5851 uint32_t right_child_hash = GetKey(child_index + 1)->Hash();
5853 child_index++;
5858 NoIncrementalWriteBarrierSwapDescriptors(parent_index, child_index);
5859 // Now element at child_index could be < its children.
5860 parent_index = child_index; // parent_hash remains correct.
5873 int child_index = parent_index * 2 + 1; local
5874 uint32_t child_hash = GetKey(child_index)
10212 int child_index = i; local
10233 int child_index = ((parent_index + 1) << 1) - 1; local
[all...]

Completed in 173 milliseconds