| /external/libdrm/tests/ |
| hash.c | 87 static int count_entries(HashBucketPtr bucket)
91 for (; bucket; bucket = bucket->next)
107 HashBucketPtr bucket; local
113 bucket = table->buckets[i];
114 update_dist(count_entries(bucket));
|
| /frameworks/base/include/androidfw/ |
| ByteBucketArray.h | 60 T* bucket = mBuckets[bucketIndex]; local
61 if (bucket == NULL) {
64 return bucket[0x0f & static_cast<uint8_t>(index)];
72 T* bucket = mBuckets[bucketIndex];
73 if (bucket == NULL) {
74 bucket = mBuckets[bucketIndex] = new T[BUCKET_SIZE]();
76 return bucket[0x0f & static_cast<uint8_t>(index)];
|
| /external/libdrm/ |
| xf86drmHash.c | 127 HashBucketPtr bucket; local
134 for (bucket = table->buckets[i]; bucket;) {
135 next = bucket->next;
136 drmFree(bucket);
137 bucket = next;
144 /* Find the bucket and organize the list so that this bucket is at the
152 HashBucketPtr bucket; local
156 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next)
178 HashBucketPtr bucket; local
191 HashBucketPtr bucket; local
214 HashBucketPtr bucket; local
[all...] |
| /system/update_engine/payload_generator/ |
| block_mapping.cc | 79 // UniqueBlock it could also be part of a new or existing bucket (if there is
81 vector<UniqueBlock> *bucket = nullptr; local
85 bucket = &mapping_[h];
94 bucket = &mapping_it->second;
99 bucket->emplace_back();
100 UniqueBlock *new_ublock = &bucket->back();
|
| /external/ceres-solver/internal/ceres/ |
| reorder_program.cc | 189 // extra bucket at the end to catch all non-eliminated F blocks.
202 // each histogram bucket (where each bucket is for the residuals for that
218 // Fill in each bucket with the residual blocks for its corresponding E block.
219 // Each bucket is individually filled from the back of the bucket to the front
220 // of the bucket. The filling order among the buckets is dictated by the
222 // from each offset as a residual block is placed in the bucket. When the
228 int bucket = min_position_per_residual[i]; local
231 offsets[bucket]--
[all...] |
| /external/chromium-trace/catapult/telemetry/telemetry/story/ |
| story_set.py | 26 cloud_storage_bucket: The cloud storage bucket used to download
88 def bucket(self): member in class:StorySet
96 os.path.join(self.base_dir, self.archive_data_file), self.bucket)
|
| /external/fio/ |
| filehash.c | 49 struct flist_head *bucket = &file_hash[hash(name)]; local
52 flist_for_each(n, bucket) {
|
| /external/libchrome/base/trace_event/ |
| trace_sampling_thread.cc | 16 TraceBucketData(base::subtle::AtomicWord* bucket,
21 TRACE_EVENT_API_ATOMIC_WORD* bucket; member in class:base::trace_event::TraceBucketData
47 TRACE_EVENT_API_ATOMIC_LOAD(*bucket_data->bucket);
69 TRACE_EVENT_API_ATOMIC_WORD* bucket,
76 sample_buckets_.push_back(TraceBucketData(bucket, name, callback));
95 TraceBucketData::TraceBucketData(base::subtle::AtomicWord* bucket,
98 : bucket(bucket), bucket_name(name), callback(callback) {}
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfAccelTable.cpp | 54 // Then compute the bucket size, minimum of 1 bucket.
87 // Figure out how many buckets we need, then compute the bucket
94 // Compute bucket contents and final ordering.
97 uint32_t bucket = Data[i]->HashValue % Header.bucket_count; local
98 Buckets[bucket].push_back(Data[i]);
120 Asm->OutStreamer->AddComment("Header Bucket Count");
144 Asm->OutStreamer->AddComment("Bucket " + Twine(i));
162 // bucket.
172 Asm->OutStreamer->AddComment("Hash in Bucket " + Twine(i))
[all...] |
| /external/mesa3d/src/gallium/drivers/svga/ |
| svga_screen_cache.h | 79 /** Head for the bucket lists. */
107 struct list_head bucket[SVGA_HOST_SURFACE_CACHE_BUCKETS]; member in struct:svga_host_surface_cache
|
| svga_screen_cache.c | 77 * Compute the bucket for this key.
100 unsigned bucket; local
105 bucket = svga_screen_cache_bucket(key);
109 curr = cache->bucket[bucket].next;
111 while (curr != &cache->bucket[bucket]) {
151 debug_printf("%s: cache %s after %u tries (bucket %d)\n", __FUNCTION__,
152 handle ? "hit" : "miss", tries, bucket);
304 unsigned bucket; local
[all...] |
| /external/mockito/cglib-and-asm/src/org/mockito/cglib/core/ |
| CollectionUtils.java | 28 public static Map bucket(Collection c, Transformer t) { method in class:CollectionUtils
33 List bucket = (List)buckets.get(key); local
34 if (bucket == null) {
35 buckets.put(key, bucket = new LinkedList());
37 bucket.add(value);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/profile/ |
| unordered_base.h | 43 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
52 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
54 { return __uc.bucket(__node->_M_v); }
64 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
66 { return __uc.bucket(__node->_M_v.first); }
76 return __bucket_index_helper::bucket(__uc, __node);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/profile/ |
| unordered_base.h | 43 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
52 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
54 { return __uc.bucket(__node->_M_v); }
64 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
66 { return __uc.bucket(__node->_M_v.first); }
76 return __bucket_index_helper::bucket(__uc, __node);
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/profile/ |
| unordered_base.h | 43 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
52 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
54 { return __uc.bucket(__node->_M_v); }
64 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
66 { return __uc.bucket(__node->_M_v.first); }
76 return __bucket_index_helper::bucket(__uc, __node);
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/ |
| unordered_base.h | 43 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
52 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
54 { return __uc.bucket(__node->_M_v()); }
64 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
66 { return __uc.bucket(__node->_M_v().first); }
76 return __bucket_index_helper::bucket(__uc, __node);
|
| /system/core/metricsd/uploader/ |
| metrics_log_base.cc | 134 HistogramEventProto::Bucket* bucket = histogram_proto->add_bucket(); local
135 bucket->set_min(min);
136 bucket->set_max(max);
137 bucket->set_count(count);
142 HistogramEventProto::Bucket* bucket = histogram_proto->mutable_bucket(i); local
144 bucket->max() == histogram_proto->bucket(i + 1).min()) {
145 bucket->clear_max()
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| Dominators.java | 213 info[vertex.get(wInfo.semidom).getIndex()].bucket.add(w);
224 wParentBucket = info[wInfo.parent.getIndex()].bucket;
279 public ArrayList<SsaBasicBlock> bucket; field in class:Dominators.DFSInfo
282 bucket = new ArrayList<SsaBasicBlock>();
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| Dominators.java | 213 info[vertex.get(wInfo.semidom).getIndex()].bucket.add(w);
224 wParentBucket = info[wInfo.parent.getIndex()].bucket;
279 public ArrayList<SsaBasicBlock> bucket; field in class:Dominators.DFSInfo
282 bucket = new ArrayList<SsaBasicBlock>();
|
| /cts/tests/tests/app.usage/src/android/app/usage/cts/ |
| NetworkUsageStatsTest.java | 303 NetworkStats.Bucket bucket = null; local
305 bucket = mNsm.querySummaryForDevice(
311 assertNotNull(bucket);
312 assertTimestamps(bucket);
313 assertEquals(bucket.getState(), NetworkStats.Bucket.STATE_ALL);
314 assertEquals(bucket.getUid(), NetworkStats.Bucket.UID_ALL);
317 bucket = mNsm.querySummaryForDevice
335 NetworkStats.Bucket bucket = null; local
373 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
427 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
482 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
[all...] |
| /external/freetype/src/cache/ |
| ftccache.c | 87 /* get a top bucket for specified hash from cache,
130 * the bucket lists
144 /* split a single bucket */
488 FTC_Node* bucket; local
501 bucket = pnode = FTC_NODE__TOP_FOR_HASH( cache, hash );
520 /* Update bucket by modified linked list */
521 bucket = pnode = FTC_NODE__TOP_FOR_HASH( cache, hash );
537 if ( node != *bucket )
540 node->link = *bucket;
541 *bucket = node
575 FTC_Node* bucket = cache->buckets + i; local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| RegularImmutableBiMap.java | 192 int bucket = Hashing.smear(key.hashCode()) & mask; local
193 for (ImmutableMapEntry<K, V> entry = keyTable[bucket]; entry != null;
267 int bucket = Hashing.smear(value.hashCode()) & mask;
268 for (ImmutableMapEntry<K, V> entry = valueTable[bucket]; entry != null;
|
| /external/libdrm/freedreno/ |
| freedreno_bo.c | 56 /* don't break the bucket if this bo was found in one */
95 struct fd_bo_bucket *bucket = &dev->cache_bucket[i]; local
98 while (!LIST_IS_EMPTY(&bucket->list)) {
99 bo = LIST_ENTRY(struct fd_bo, bucket->list.next, list);
118 * way to the correct bucket size rather than looping..
121 struct fd_bo_bucket *bucket = &dev->cache_bucket[i]; local
122 if (bucket->size >= size) {
123 return bucket;
139 struct fd_bo_bucket *bucket, uint32_t flags)
151 while (!LIST_IS_EMPTY(&bucket->list))
177 struct fd_bo_bucket *bucket; local
304 struct fd_bo_bucket *bucket = get_bucket(dev, bo->size); local
[all...] |
| /external/libvpx/libvpx/ |
| rate_hist.c | 33 struct hist_bucket bucket[RATE_BINS]; member in struct:rate_hist
57 hist->bucket[i].low = INT_MAX;
58 hist->bucket[i].high = 0;
59 hist->bucket[i].count = 0;
115 if (hist->bucket[idx].low > avg_bitrate)
116 hist->bucket[idx].low = (int)avg_bitrate;
117 if (hist->bucket[idx].high < avg_bitrate)
118 hist->bucket[idx].high = (int)avg_bitrate;
119 hist->bucket[idx].count++;
123 static int merge_hist_buckets(struct hist_bucket *bucket,
251 struct hist_bucket bucket[64]; local
[all...] |
| /external/mesa3d/src/mesa/program/ |
| hash_table.c | 115 const unsigned bucket = hash_value % ht->num_buckets; local
118 foreach(node, & ht->buckets[bucket]) {
141 const unsigned bucket = hash_value % ht->num_buckets; local
149 insert_at_head(& ht->buckets[bucket], & node->link);
156 const unsigned bucket = hash_value % ht->num_buckets; local
160 foreach(node, & ht->buckets[bucket]) {
174 insert_at_head(& ht->buckets[bucket], & hn->link);
196 int bucket; local
198 for (bucket = 0; bucket < ht->num_buckets; bucket++)
[all...] |
