Searched defs:valid_entries (Results 1 - 10 of 10) sorted by relevance
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/trace/ |
H A D | tr_dump_state.c | 372 unsigned valid_entries = 1; local 393 valid_entries = PIPE_MAX_COLOR_BUFS; 394 trace_dump_struct_array(rt_blend_state, state->rt, valid_entries);
|
/external/mesa3d/src/gallium/drivers/trace/ |
H A D | tr_dump_state.c | 372 unsigned valid_entries = 1; local 393 valid_entries = PIPE_MAX_COLOR_BUFS; 394 trace_dump_struct_array(rt_blend_state, state->rt, valid_entries);
|
/external/chromium_org/third_party/freetype/src/sfnt/ |
H A D | ttload.c | 174 FT_UShort nn, valid_entries = 0; local 217 valid_entries++; 266 sfnt->num_tables = valid_entries;
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
H A D | u_dump_state.c | 547 unsigned valid_entries = 1; local 567 valid_entries = PIPE_MAX_COLOR_BUFS; 568 util_dump_struct_array(stream, rt_blend_state, state->rt, valid_entries);
|
/external/freetype/src/sfnt/ |
H A D | ttload.c | 173 FT_UShort nn, valid_entries = 0; local 216 valid_entries++; 265 sfnt->num_tables = valid_entries;
|
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_dump_state.c | 547 unsigned valid_entries = 1; local 567 valid_entries = PIPE_MAX_COLOR_BUFS; 568 util_dump_struct_array(stream, rt_blend_state, state->rt, valid_entries);
|
/external/chromium/chrome/browser/sessions/ |
H A D | tab_restore_service.cc | 943 std::vector<Entry*> valid_entries; local 951 if (valid_entries.size() != max_valid) { 974 valid_entries.push_back(*i); 979 entries->swap(valid_entries);
|
/external/chromium_org/chrome/browser/sessions/ |
H A D | persistent_tab_restore_service.cc | 760 std::vector<Entry*> valid_entries; local 767 valid_entries.push_back(*i); 772 entries->swap(valid_entries);
|
/external/chromium_org/v8/src/ |
H A D | objects-debug.cc | 1118 bool DescriptorArray::IsSortedNoDuplicates(int valid_entries) { argument 1119 if (valid_entries == -1) valid_entries = number_of_descriptors(); 1140 bool TransitionArray::IsSortedNoDuplicates(int valid_entries) { argument 1141 ASSERT(valid_entries == -1);
|
H A D | objects-inl.h | 2143 int BinarySearch(T* array, Name* name, int low, int high, int valid_entries) { argument 2166 if (search_mode == ALL_ENTRIES || sort_index < valid_entries) { 2180 int LinearSearch(T* array, Name* name, int len, int valid_entries) { argument 2191 ASSERT(len >= valid_entries); 2192 for (int number = 0; number < valid_entries; number++) { 2203 int Search(T* array, Name* name, int valid_entries) { argument 2205 SLOW_ASSERT(array->IsSortedNoDuplicates(valid_entries)); 2218 valid_entries <= (kMaxElementsForLinearSearch * 3))) { 2219 return LinearSearch<search_mode>(array, name, nof, valid_entries); 2223 return BinarySearch<search_mode>(array, name, 0, nof - 1, valid_entries); [all...] |
Completed in 925 milliseconds