/external/chromium_org/storage/browser/fileapi/ |
H A D | async_file_util_adapter.cc | 99 std::vector<DirectoryEntry> entries; local 102 FROM_HERE, base::Bind(callback, error, entries, false /* has_more */)); 108 // assuming that they are reading much more entries than this constant.) 121 entries.push_back(entry); 123 if (entries.size() == kResultChunkSize) { 125 FROM_HERE, base::Bind(callback, base::File::FILE_OK, entries, 127 entries.clear(); 131 FROM_HERE, base::Bind(callback, base::File::FILE_OK, entries,
|
/external/chromium_org/third_party/WebKit/Source/core/timing/ |
H A D | Performance.cpp | 95 PerformanceEntryVector entries; local 97 entries.appendVector(m_resourceTimingBuffer); 100 entries.appendVector(m_userTiming->getMarks()); 101 entries.appendVector(m_userTiming->getMeasures()); 104 std::sort(entries.begin(), entries.end(), PerformanceEntry::startTimeCompareLessThan); 105 return entries; 110 PerformanceEntryVector entries; local 114 entries.append(*resource); 118 entries 129 PerformanceEntryVector entries; local [all...] |
/external/chromium_org/third_party/WebKit/Source/modules/filesystem/ |
H A D | FileSystemCallbacks.cpp | 189 EntryHeapVector entries; local 190 entries.swap(m_entries); 194 m_successCallback->handleEvent(entries);
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
H A D | u_cache.c | 78 struct util_cache_entry *entries; member in struct:util_cache 110 cache->entries = CALLOC(size, sizeof(struct util_cache_entry)); 111 if(!cache->entries) { 139 struct util_cache_entry *current = &cache->entries[i]; 248 util_cache_entry_destroy(cache, &cache->entries[i]); 249 cache->entries[i].state = EMPTY; 272 double z = fabs(cache->entries[i].count - mean)/stddev; 282 FREE(cache->entries); 319 struct util_cache_entry *header = &cache->entries[i];
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/ |
H A D | nv50_screen.h | 49 void **entries; member in struct:nv50_screen::__anon13846 55 void **entries; member in struct:nv50_screen::__anon13847 135 screen->tic.entries[tic->id] = NULL; 144 screen->tsc.entries[tsc->id] = NULL;
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nvc0/ |
H A D | nvc0_screen.h | 45 void **entries; member in struct:nvc0_screen::__anon13856 51 void **entries; member in struct:nvc0_screen::__anon13857 134 screen->tic.entries[tic->id] = NULL; 143 screen->tsc.entries[tsc->id] = NULL;
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/softpipe/ |
H A D | sp_tex_tile_cache.h | 87 struct softpipe_tex_cached_tile entries[NUM_ENTRIES]; member in struct:softpipe_tex_tile_cache
|
/external/chromium_org/third_party/webrtc/overrides/webrtc/base/ |
H A D | logging.cc | 52 const char* FindLabel(int value, const ConstantLabel entries[]) { argument 53 for (int i = 0; entries[i].label; ++i) { 54 if (value == entries[i].value) return entries[i].label;
|
/external/chromium_org/v8/src/third_party/vtune/ |
H A D | vtune-jit.cc | 136 static JitInfoMap* entries; local 137 if (entries == NULL) { 138 entries = new JitInfoMap(); 140 return entries;
|
/external/deqp/framework/randomshaders/ |
H A D | rsgShaderGenerator.cpp | 95 vector<const ValueEntry*> entries; local 96 std::copy(state.getVariableManager().getBegin<AnyEntry>(), state.getVariableManager().getEnd<AnyEntry>(), std::inserter(entries, entries.begin())); 98 for (vector<const ValueEntry*>::const_iterator i = entries.begin(); i != entries.end(); i++) 281 // Create input entries (store value range) if necessary
|
/external/dnsmasq/src/ |
H A D | log.c | 53 static struct log_entry *entries = NULL; variable in typeref:struct:log_entry 141 struct log_entry *tmp = entries; 142 entries = tmp->next; 151 while (entries) 154 if (entries->pid != getpid()) 162 if ((rc = write(log_fd, entries->payload + entries->offset, entries->length)) != -1) 164 entries->length -= rc; 165 entries [all...] |
/external/e2fsprogs/intl/ |
H A D | l10nflist.c | 183 size_t entries; local 321 entries = 0; 346 retval->successor[entries++] 353 retval->successor[entries++] 359 retval->successor[entries] = NULL;
|
/external/e2fsprogs/lib/quota/ |
H A D | quotaio_tree.c | 132 /* Remove given block from the list of blocks with free entries */ 165 /* Insert given block to the beginning of list with free entries */ 551 int entries, i; local 560 entries = ext2fs_le16_to_cpu(dh->dqdh_entries); 573 return entries; 591 int entries = 0, i; local 604 entries += report_block(dquot, blk, bitmap, 612 entries += report_tree(dquot, blk, depth + 1, 619 return entries;
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | ImmutableMap.java | 80 * Returns an immutable map containing the given entries, in order. 89 * Returns an immutable map containing the given entries, in order. 100 * Returns an immutable map containing the given entries, in order. 111 * Returns an immutable map containing the given entries, in order. 121 // looking for of() with > 5 entries? Use the builder instead. 165 final ArrayList<Entry<K, V>> entries = Lists.newArrayList(); field in class:ImmutableMap.Builder 178 entries.add(entryOf(key, value)); 197 entries.add(immutableEntry); 201 entries.add(entryOf(key, value)); 213 entries 234 fromEntryList( List<Entry<K, V>> entries) argument [all...] |
H A D | ImmutableMultiset.java | 208 Collection<? extends Entry<? extends E>> entries) { 211 for (Entry<? extends E> entry : entries) { 207 copyFromEntries( Collection<? extends Entry<? extends E>> entries) argument
|
H A D | ImmutableSetMultimap.java | 79 * Returns an immutable multimap containing the given entries, in order. 91 * Returns an immutable multimap containing the given entries, in order. 105 * Returns an immutable multimap containing the given entries, in order. 120 * Returns an immutable multimap containing the given entries, in order. 135 // looking for of() with > 5 entries? Use the builder instead. 387 for (Entry<K, V> entry : entries()) { 414 private transient ImmutableSet<Entry<K, V>> entries; field in class:ImmutableSetMultimap 421 // TODO(kevinb): Fix this so that two copies of the entries are not created. 422 @Override public ImmutableSet<Entry<K, V>> entries() { method in class:ImmutableSetMultimap 423 ImmutableSet<Entry<K, V>> result = entries; [all...] |
H A D | ImmutableSortedMultiset.java | 287 ImmutableList<Entry<E>> entries = 289 if (entries.isEmpty()) { 292 verifyEntries(entries); 293 return RegularImmutableSortedMultiset.createFromSorted(comparator, entries); 299 ImmutableList<Entry<E>> entries = 301 if (entries.isEmpty()) { 304 verifyEntries(entries); 305 return RegularImmutableSortedMultiset.createFromSorted(comparator, entries); 308 private static <E> void verifyEntries(Collection<Entry<E>> entries) { argument 309 for (Entry<E> entry : entries) { [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | ImmutableMap.java | 54 ImmutableMap(Entry<? extends K, ? extends V>... entries) { argument 56 for (Entry<? extends K, ? extends V> entry : entries) { 99 // looking for of() with > 5 entries? Use the builder instead. 110 final List<Entry<K, V>> entries = Lists.newArrayList(); field in class:ImmutableMap.Builder 115 entries.add(entryOf(key, value)); 125 entries.add(immutableEntry); 127 entries.add(entryOf((K) entry.getKey(), (V) entry.getValue())); 140 return fromEntryList(entries); 144 List<Entry<K, V>> entries) { 145 int size = entries 143 fromEntryList( List<Entry<K, V>> entries) argument [all...] |
H A D | ImmutableMultimap.java | 76 * Returns an immutable multimap containing the given entries, in order. 83 * Returns an immutable multimap containing the given entries, in order. 91 * Returns an immutable multimap containing the given entries, in order. 99 * Returns an immutable multimap containing the given entries, in order. 106 // looking for of() with > 5 entries? Use the builder instead. 221 * Stores another multimap's entries in the built multimap. The generated 479 private transient ImmutableCollection<Entry<K, V>> entries; field in class:ImmutableMultimap 487 public ImmutableCollection<Entry<K, V>> entries() { method in class:ImmutableMultimap 488 ImmutableCollection<Entry<K, V>> result = entries; 490 ? (entries [all...] |
H A D | ImmutableSetMultimap.java | 74 * Returns an immutable multimap containing the given entries, in order. 86 * Returns an immutable multimap containing the given entries, in order. 100 * Returns an immutable multimap containing the given entries, in order. 115 * Returns an immutable multimap containing the given entries, in order. 130 // looking for of() with > 5 entries? Use the builder instead. 382 for (Entry<K, V> entry : entries()) { 409 private transient ImmutableSet<Entry<K, V>> entries; field in class:ImmutableSetMultimap 416 // TODO(kevinb): Fix this so that two copies of the entries are not created. 417 @Override public ImmutableSet<Entry<K, V>> entries() { method in class:ImmutableSetMultimap 418 ImmutableSet<Entry<K, V>> result = entries; [all...] |
H A D | ImmutableSortedMap.java | 77 Entry<? extends K, ? extends V>... entries) { 80 for (Entry<? extends K, ? extends V> entry : entries) { 202 entries.add(entryOf(key, value)); 220 for (Entry<? extends K, ? extends V> entry : entries) { 75 create( Comparator<? super K> comparator, Entry<? extends K, ? extends V>... entries) argument
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/ |
H A D | perf.h | 201 struct branch_entry entries[0]; member in struct:branch_stack
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
H A D | evlist.h | 28 struct list_head entries; member in struct:perf_evlist 158 return list_entry(evlist->entries.next, struct perf_evsel, node); 163 return list_entry(evlist->entries.prev, struct perf_evsel, node);
|
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_cache.c | 78 struct util_cache_entry *entries; member in struct:util_cache 110 cache->entries = CALLOC(size, sizeof(struct util_cache_entry)); 111 if(!cache->entries) { 139 struct util_cache_entry *current = &cache->entries[i]; 248 util_cache_entry_destroy(cache, &cache->entries[i]); 249 cache->entries[i].state = EMPTY; 272 double z = fabs(cache->entries[i].count - mean)/stddev; 282 FREE(cache->entries); 319 struct util_cache_entry *header = &cache->entries[i];
|
/external/mesa3d/src/gallium/drivers/nv50/ |
H A D | nv50_screen.h | 49 void **entries; member in struct:nv50_screen::__anon27257 55 void **entries; member in struct:nv50_screen::__anon27258 135 screen->tic.entries[tic->id] = NULL; 144 screen->tsc.entries[tsc->id] = NULL;
|