| /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...] |
| /frameworks/base/packages/SettingsLib/src/com/android/settingslib/ |
| TronUtils.java | 43 int bucket; local
46 bucket = 0;
49 bucket = 1;
52 bucket = 2;
55 bucket = 3;
61 MetricsLogger.histogram(context, histogram, bucket);
|
| /external/bison/lib/ |
| hash.c | 54 /* The array of buckets starts at BUCKET and extends to BUCKET_LIMIT-1,
57 struct hash_entry *bucket; member in struct:hash_table
93 slot. A bucket is the collection of all entries hashing to the same slot.
96 In the ideal case, the length of each bucket is roughly the number of
99 entry is linear in time with the size of the bucket. Consequently, a
119 /* If a deletion empties a bucket and causes the ratio of used buckets to
171 /* Return the length of the longest chain (bucket). */
176 struct hash_entry const *bucket; local
179 for (bucket = table->bucket; bucket < table->bucket_limit; bucket++
203 struct hash_entry const *bucket; local
263 struct hash_entry const *bucket = safe_hasher (table, entry); local
290 struct hash_entry const *bucket; local
309 struct hash_entry const *bucket = safe_hasher (table, entry); local
340 struct hash_entry const *bucket; local
372 struct hash_entry const *bucket; local
655 struct hash_entry *bucket; local
698 struct hash_entry *bucket; local
793 struct hash_entry *bucket = safe_hasher (table, entry); local
862 struct hash_entry *bucket; local
1042 struct hash_entry *bucket; local
1151 struct hash_entry *bucket; local
1214 struct hash_entry *bucket = (struct hash_entry *) table->bucket; local
[all...] |
| /external/libvpx/libvpx/ |
| rate_hist.c | 33 struct hist_bucket bucket[RATE_BINS]; member in struct:rate_hist
62 hist->bucket[i].low = INT_MAX;
63 hist->bucket[i].high = 0;
64 hist->bucket[i].count = 0;
118 if (hist->bucket[idx].low > avg_bitrate)
119 hist->bucket[idx].low = (int)avg_bitrate;
120 if (hist->bucket[idx].high < avg_bitrate)
121 hist->bucket[idx].high = (int)avg_bitrate;
122 hist->bucket[idx].count++;
126 static int merge_hist_buckets(struct hist_bucket *bucket, int max_buckets
254 struct hist_bucket bucket[64]; local
[all...] |
| /external/kmod/shared/ |
| hash.c | 69 struct hash_bucket *bucket, *bucket_end; local
74 bucket = hash->buckets;
75 bucket_end = bucket + hash->n_buckets;
76 for (; bucket < bucket_end; bucket++) {
79 entry = bucket->entries;
80 entry_end = entry + bucket->used;
84 free(bucket->entries);
151 struct hash_bucket *bucket = hash->buckets + pos; local
154 if (bucket->used + 1 >= bucket->total)
194 struct hash_bucket *bucket = hash->buckets + pos; local
239 const struct hash_bucket *bucket = hash->buckets + pos; local
258 struct hash_bucket *bucket = hash->buckets + pos; local
[all...] |
| /external/mesa3d/src/glx/ |
| glxhash.c | 179 __glxHashBucketPtr bucket; local
187 for (bucket = table->buckets[i]; bucket;) {
188 next = bucket->next;
189 HASH_FREE(bucket);
190 bucket = next;
197 /* Find the bucket and organize the list so that this bucket is at the
205 __glxHashBucketPtr bucket; local
210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next)
234 __glxHashBucketPtr bucket; local
250 __glxHashBucketPtr bucket; local
277 __glxHashBucketPtr bucket; local
359 __glxHashBucketPtr bucket; local
[all...] |
| /external/parameter-framework/asio-1.10.6/include/asio/detail/ |
| hash_map.hpp | 103 size_t bucket = calculate_hash_value(k) % num_buckets_; local
104 iterator it = buckets_[bucket].first;
107 iterator end_it = buckets_[bucket].last;
124 size_t bucket = calculate_hash_value(k) % num_buckets_; local
125 const_iterator it = buckets_[bucket].first;
128 const_iterator end_it = buckets_[bucket].last;
145 size_t bucket = calculate_hash_value(v.first) % num_buckets_; local
146 iterator it = buckets_[bucket].first;
149 buckets_[bucket].first = buckets_[bucket].last
173 size_t bucket = calculate_hash_value(it->first) % num_buckets_; local
250 std::size_t bucket = calculate_hash_value(iter->first) % num_buckets_; local
[all...] |
| /frameworks/base/libs/androidfw/include/androidfw/ |
| ByteBucketArray.h | 55 T* bucket = buckets_[bucket_index]; local
56 if (bucket == NULL) {
59 return bucket[0x0f & static_cast<uint8_t>(index)];
67 T* bucket = buckets_[bucket_index];
68 if (bucket == NULL) {
69 bucket = buckets_[bucket_index] = new T[kBucketSize]();
71 return bucket[0x0f & static_cast<uint8_t>(index)];
|
| /cts/tests/tests/app.usage/src/android/app/usage/cts/ |
| NetworkUsageStatsTest.java | 343 NetworkStats.Bucket bucket = null; local
345 bucket = mNsm.querySummaryForDevice(
351 assertNotNull(bucket);
352 assertTimestamps(bucket);
353 assertEquals(bucket.getState(), NetworkStats.Bucket.STATE_ALL);
354 assertEquals(bucket.getUid(), NetworkStats.Bucket.UID_ALL);
355 assertEquals(bucket.getMetered(), NetworkStats.Bucket.METERED_ALL)
376 NetworkStats.Bucket bucket = null; local
415 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
475 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
531 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
586 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
[all...] |
| /external/libchrome/base/trace_event/ |
| trace_sampling_thread.cc | 17 TraceBucketData(base::subtle::AtomicWord* bucket,
22 TRACE_EVENT_API_ATOMIC_WORD* bucket; member in class:base::trace_event::TraceBucketData
50 TRACE_EVENT_API_ATOMIC_LOAD(*bucket_data->bucket);
73 TRACE_EVENT_API_ATOMIC_WORD* bucket,
80 sample_buckets_.push_back(TraceBucketData(bucket, name, callback));
99 TraceBucketData::TraceBucketData(base::subtle::AtomicWord* bucket,
102 : bucket(bucket), bucket_name(name), callback(callback) {}
|
| heap_profiler_heap_dump_writer.cc | 30 // The pairs are grouped into |Bucket|s. A bucket is a group of (context, size)
33 // bucket that represents the entire heap. Then this bucket is recursively
34 // broken down into smaller buckets. Each bucket keeps track of whether further
46 struct Bucket {
47 Bucket()
63 // elements in this bucket, the stack frames 0 up to (but not including) the
67 // When true, the type name for all elements in this bucket must be equal.
72 bool operator<(const Bucket& lhs, const Bucket& rhs)
[all...] |
| /external/chromium-trace/catapult/telemetry/telemetry/util/ |
| perf_tests_results_helper.py | 45 for bucket in histogram['buckets']:
46 if 'high' in bucket:
47 bucket['mean'] = (bucket['low'] + bucket['high']) / 2.0
49 bucket['mean'] = bucket['low']
50 if bucket['mean'] > 0:
51 sum_of_logs += math.log(bucket['mean']) * bucket['count'
[all...] |
| /external/chromium-trace/catapult/telemetry/ |
| cloud_storage | 20 BUCKETS = {bucket: easy_bucket_name for easy_bucket_name, bucket
39 for bucket in BUCKETS:
41 bucket_contents[bucket] = cloud_storage.List(bucket)
45 # Check if each file is in the bucket contents.
59 for bucket in BUCKETS:
60 if bucket in bucket_contents and file_hash in bucket_contents[bucket]:
61 file_buckets[file_path].append(bucket)
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_mm.c | 29 struct mm_bucket bucket[MM_NUM_BUCKETS]; member in struct:nouveau_mman
90 return &cache->bucket[MAX2(order, MM_MIN_ORDER) - MM_MIN_ORDER];
160 struct mm_bucket *bucket; local
165 bucket = mm_bucket_by_size(cache, size);
166 if (!bucket) {
177 if (!LIST_IS_EMPTY(&bucket->used)) {
178 slab = LIST_ENTRY(struct mm_slab, bucket->used.next, head);
180 if (LIST_IS_EMPTY(&bucket->free)) {
183 slab = LIST_ENTRY(struct mm_slab, bucket->free.next, head);
186 LIST_ADD(&slab->head, &bucket->used)
213 struct mm_bucket *bucket = mm_bucket_by_order(slab->cache, slab->order); local
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| local_iterators.pass.cpp | 45 C::size_type b = c.bucket(0);
50 b = c.bucket(1);
58 b = c.bucket(2);
66 b = c.bucket(3);
72 b = c.bucket(4);
78 b = c.bucket(5);
83 b = c.bucket(6);
103 C::size_type b = c.bucket(0);
108 b = c.bucket(1);
116 b = c.bucket(2)
[all...] |
| local_iterators.fail.cpp | 45 C::size_type b = c.bucket(0);
50 b = c.bucket(1);
59 b = c.bucket(2);
67 b = c.bucket(3);
73 b = c.bucket(4);
79 b = c.bucket(5);
84 b = c.bucket(6);
104 C::size_type b = c.bucket(0);
109 b = c.bucket(1);
117 b = c.bucket(2)
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| local_iterators.pass.cpp | 45 C::size_type b = c.bucket(0);
50 b = c.bucket(1);
58 b = c.bucket(2);
66 b = c.bucket(3);
72 b = c.bucket(4);
78 b = c.bucket(5);
83 b = c.bucket(6);
103 C::size_type b = c.bucket(0);
108 b = c.bucket(1);
116 b = c.bucket(2)
[all...] |
| local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0);
48 b = c.bucket(1);
57 b = c.bucket(2);
65 b = c.bucket(3);
71 b = c.bucket(4);
77 b = c.bucket(5);
82 b = c.bucket(6);
102 C::size_type b = c.bucket(0);
107 b = c.bucket(1);
115 b = c.bucket(2)
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/ |
| local_iterators.pass.cpp | 45 C::size_type b = c.bucket(0);
50 b = c.bucket(1);
58 b = c.bucket(2);
66 b = c.bucket(3);
72 b = c.bucket(4);
78 b = c.bucket(5);
83 b = c.bucket(6);
103 C::size_type b = c.bucket(0);
108 b = c.bucket(1);
116 b = c.bucket(2)
[all...] |
| local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0);
48 b = c.bucket(1);
57 b = c.bucket(2);
65 b = c.bucket(3);
71 b = c.bucket(4);
77 b = c.bucket(5);
82 b = c.bucket(6);
102 C::size_type b = c.bucket(0);
107 b = c.bucket(1);
115 b = c.bucket(2)
[all...] |
| /external/libcxx/test/std/containers/unord/unord.set/ |
| local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0);
48 b = c.bucket(1);
57 b = c.bucket(2);
65 b = c.bucket(3);
71 b = c.bucket(4);
77 b = c.bucket(5);
82 b = c.bucket(6);
102 C::size_type b = c.bucket(0);
107 b = c.bucket(1);
115 b = c.bucket(2)
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0);
48 b = c.bucket(1);
57 b = c.bucket(2);
65 b = c.bucket(3);
71 b = c.bucket(4);
77 b = c.bucket(5);
82 b = c.bucket(6);
102 C::size_type b = c.bucket(0);
107 b = c.bucket(1);
115 b = c.bucket(2)
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/ |
| local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0);
48 b = c.bucket(1);
57 b = c.bucket(2);
65 b = c.bucket(3);
71 b = c.bucket(4);
77 b = c.bucket(5);
82 b = c.bucket(6);
102 C::size_type b = c.bucket(0);
107 b = c.bucket(1);
115 b = c.bucket(2)
[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...] |
| /external/autotest/client/site_tests/firmware_TouchMTB/ |
| cros_gs.py | 57 self.bucket = GS_BUCKET_PUBLIC if boto == PUBLIC_BOTO else GS_BUCKET
58 bucket = self.bucket
62 self.ls_cmd = '{0} {1} {2}/%s'.format(_cmd_prefix, 'ls', bucket)
64 self.upload_cmd = upload_cmd_str.format(_cmd_prefix, 'cp', bucket)
66 self.download_cmd = download_cmd_str.format(_cmd_prefix, 'cp', bucket)
67 self.rm_cmd = '{0} {1} {2}/%s'.format(_cmd_prefix, 'rm', bucket)
70 """ls the files in the selected bucket."""
74 """Upload the data to the chosen bucket."""
81 print msg % os.path.join(self.bucket, bucket_dir, data_dir
[all...] |
