| /external/libdrm/ |
| xf86drmHash.c | 124 HashBucketPtr bucket; local
131 for (bucket = table->buckets[i]; bucket;) {
132 next = bucket->next;
133 drmFree(bucket);
134 bucket = next;
141 /* Find the bucket and organize the list so that this bucket is at the
149 HashBucketPtr bucket; local
153 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next)
175 HashBucketPtr bucket; local
188 HashBucketPtr bucket; local
208 HashBucketPtr bucket; local
[all...] |
| /external/robolectric-shadows/resources/src/main/java/org/robolectric/res/android/ |
| ByteBucketArray.java | 28 T[] bucket = (T[]) mBuckets[bucketIndex]; local
29 if (bucket == null) {
32 T t = bucket[0x0f & ((byte) index)];
42 Object[] bucket = mBuckets[bucketIndex]; local
43 if (bucket == null) {
44 bucket = mBuckets[bucketIndex] = new Object[BUCKET_SIZE];
46 // return bucket[0x0f & static_cast<uint8_t>(index)];
47 T t = (T) bucket[0x0f & ((byte) index)];
50 bucket[0x0f & ((byte) index)] = t;
64 Object[] bucket = mBuckets[bucketIndex] 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/libaom/libaom/stats/ |
| rate_hist.c | 34 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;
109 if (hist->bucket[idx].low > avg_bitrate)
110 hist->bucket[idx].low = (int)avg_bitrate;
111 if (hist->bucket[idx].high < avg_bitrate)
112 hist->bucket[idx].high = (int)avg_bitrate;
113 hist->bucket[idx].count++;
117 static int merge_hist_buckets(struct hist_bucket *bucket, int max_buckets
238 struct hist_bucket bucket[64]; local
[all...] |
| /external/grpc-grpc/src/core/lib/debug/ |
| stats_data.cc | 365 int bucket = local
367 _bkt.dbl = grpc_stats_table_0[bucket];
368 bucket -= (_val.uint < _bkt.uint);
369 GRPC_STATS_INC_HISTOGRAM(GRPC_STATS_HISTOGRAM_CALL_INITIAL_SIZE, bucket);
388 int bucket = local
390 _bkt.dbl = grpc_stats_table_2[bucket];
391 bucket -= (_val.uint < _bkt.uint);
392 GRPC_STATS_INC_HISTOGRAM(GRPC_STATS_HISTOGRAM_POLL_EVENTS_RETURNED, bucket);
411 int bucket = local
413 _bkt.dbl = grpc_stats_table_4[bucket];
434 int bucket = local
457 int bucket = local
480 int bucket = local
504 int bucket = local
529 int bucket = local
554 int bucket = local
579 int bucket = local
604 int bucket = local
629 int bucket = local
653 int bucket = 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...] |
| /external/pdfium/third_party/base/allocator/partition_allocator/ |
| partition_alloc.cc | 44 "generic smallest bucket");
63 // This works out reasonably for the current bucket sizes of the generic
138 static void PartitionBucketInitBase(PartitionBucket* bucket,
140 bucket->active_pages_head = &PartitionRootGeneric::gSeedPage;
141 bucket->empty_pages_head = 0;
142 bucket->decommitted_pages_head = 0;
143 bucket->num_full_pages = 0;
144 bucket->num_system_pages_per_slot_span =
145 PartitionBucketNumSystemPages(bucket->slot_size);
162 PartitionBucket* bucket = &root->buckets()[i]
[all...] |
| /external/libdrm/etnaviv/ |
| etnaviv_bo_cache.c | 78 struct etna_bo_bucket *bucket = &cache->cache_bucket[i]; local
81 while (!LIST_IS_EMPTY(&bucket->list)) {
82 bo = LIST_ENTRY(struct etna_bo, bucket->list.next, list);
101 * way to the correct bucket size rather than looping..
104 struct etna_bo_bucket *bucket = &cache->cache_bucket[i]; local
105 if (bucket->size >= size) {
106 return bucket;
121 static struct etna_bo *find_in_bucket(struct etna_bo_bucket *bucket, uint32_t flags)
127 if (LIST_IS_EMPTY(&bucket->list))
130 LIST_FOR_EACH_ENTRY_SAFE(bo, tmp, &bucket->list, list)
162 struct etna_bo_bucket *bucket; local
183 struct etna_bo_bucket *bucket = get_bucket(cache, bo->size); local
[all...] |
| /external/libdrm/freedreno/ |
| freedreno_bo_cache.c | 48 * @coarse: if true, only power-of-two bucket sizes, otherwise
90 struct fd_bo_bucket *bucket = &cache->cache_bucket[i]; local
93 while (!LIST_IS_EMPTY(&bucket->list)) {
94 bo = LIST_ENTRY(struct fd_bo, bucket->list.next, list);
114 * way to the correct bucket size rather than looping..
117 struct fd_bo_bucket *bucket = &cache->cache_bucket[i]; local
118 if (bucket->size >= size) {
119 return bucket;
134 static struct fd_bo *find_in_bucket(struct fd_bo_bucket *bucket, uint32_t flags)
146 if (!LIST_IS_EMPTY(&bucket->list))
165 struct fd_bo_bucket *bucket; local
196 struct fd_bo_bucket *bucket = get_bucket(cache, bo->size); local
[all...] |
| /external/v8/src/heap/ |
| slot-set.h | 26 // Each bucket is a bitmap with a bit corresponding to a single slot offset.
30 FREE_EMPTY_BUCKETS, // An empty bucket will be deallocated immediately.
31 PREFREE_EMPTY_BUCKETS, // An empty bucket will be unlinked from the slot
34 KEEP_EMPTY_BUCKETS // An empty bucket will be kept.
54 // allocation of the bucket is not thread-safe.
62 Bucket bucket = LoadBucket<access_mode>(&buckets_[bucket_index]); local
63 if (bucket == nullptr) {
64 bucket = AllocateBucket();
65 if (!SwapInNewBucket<access_mode>(&buckets_[bucket_index], bucket)) {
85 Bucket bucket = LoadBucket(&buckets_[bucket_index]); local
94 Bucket bucket = LoadBucket(&buckets_[bucket_index]); local
115 Bucket bucket; local
174 Bucket bucket = LoadBucket(&buckets_[bucket_index]); local
193 Bucket bucket = LoadBucket(&buckets_[bucket_index]); local
235 Bucket bucket = LoadBucket(&buckets_[bucket_index]); local
246 Bucket bucket = LoadBucket(&buckets_[bucket_index]); local
295 Bucket bucket = LoadBucket(&buckets_[bucket_index]); local
304 Bucket bucket = LoadBucket(&buckets_[bucket_index]); local
[all...] |
| /external/brotli/c/enc/ |
| prefix.h | 36 size_t bucket = Log2FloorNonZero(dist) - 1; local
39 size_t prefix = (dist >> bucket) & 1;
40 size_t offset = (2 + prefix) << bucket;
41 size_t nbits = bucket - postfix_bits;
|
| /external/python/google-api-python-client/samples/storage_serviceaccount_appengine/ |
| main.py | 20 It takes a bucket name in the URL path and does an HTTP GET on the
21 corresponding Google Cloud Storage URL to obtain a listing of the bucket
23 http://bucket-list.appspot.com/foo, it would remove the bucket name 'foo',
25 the resulting URI. The bucket listing is returned in an XML document, which is
64 # Derive desired bucket name from path after domain name.
65 bucket = self.request.path
66 if bucket[-1] == '/':
68 bucket = bucket[:-1
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_mm.c | 36 struct mm_bucket bucket[MM_NUM_BUCKETS]; member in struct:nouveau_mman
97 return &cache->bucket[MAX2(order, MM_MIN_ORDER) - MM_MIN_ORDER];
167 struct mm_bucket *bucket; local
172 bucket = mm_bucket_by_size(cache, size);
173 if (!bucket) {
184 if (!LIST_IS_EMPTY(&bucket->used)) {
185 slab = LIST_ENTRY(struct mm_slab, bucket->used.next, head);
187 if (LIST_IS_EMPTY(&bucket->free)) {
190 slab = LIST_ENTRY(struct mm_slab, bucket->free.next, head);
193 LIST_ADD(&slab->head, &bucket->used)
220 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...] |
| /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...] |
| /cts/tests/tests/app.usage/src/android/app/usage/cts/ |
| NetworkUsageStatsTest.java | 56 import static android.app.usage.NetworkStats.Bucket.DEFAULT_NETWORK_ALL;
57 import static android.app.usage.NetworkStats.Bucket.DEFAULT_NETWORK_NO;
58 import static android.app.usage.NetworkStats.Bucket.DEFAULT_NETWORK_YES;
59 import static android.app.usage.NetworkStats.Bucket.METERED_ALL;
60 import static android.app.usage.NetworkStats.Bucket.METERED_YES;
61 import static android.app.usage.NetworkStats.Bucket.METERED_NO;
62 import static android.app.usage.NetworkStats.Bucket.STATE_ALL;
63 import static android.app.usage.NetworkStats.Bucket.STATE_DEFAULT;
64 import static android.app.usage.NetworkStats.Bucket.STATE_FOREGROUND;
65 import static android.app.usage.NetworkStats.Bucket.TAG_NONE
355 NetworkStats.Bucket bucket = null; local
390 NetworkStats.Bucket bucket = null; local
431 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
540 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
593 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
671 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
813 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
[all...] |
| /external/python/google-api-python-client/samples/searchforshopping/ |
| histograms.py | 27 A bucket contains either a value and a count, or a value and a range. In the
46 for bucket in facet['buckets']:
47 labels.append(bucket['value'].rjust(20))
48 values.append(bucket['count'])
|
| /external/bcc/tests/python/ |
| test_histogram.py | 103 section_print_fn=lambda bucket: "%3d %d" % (bucket[0], bucket[1]),
104 bucket_fn=lambda bucket: (bucket.key_1, bucket.key_2),
|
| /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...] |
| /external/syzkaller/vendor/cloud.google.com/go/storage/ |
| acl.go | 51 // ACLRule represents a grant for a role to an entity (user, group or team) for a Google Cloud Storage object or bucket.
57 // ACLHandle provides operations on an access control list for a Google Cloud Storage bucket or object.
60 bucket string
103 req := a.c.raw.DefaultObjectAccessControls.List(a.bucket)
109 return nil, fmt.Errorf("storage: error listing default object ACL for bucket %q: %v", a.bucket, err)
116 req := a.c.raw.DefaultObjectAccessControls.Delete(a.bucket, string(entity))
121 return fmt.Errorf("storage: error deleting default ACL entry for bucket %q, entity %q: %v", a.bucket, entity, err)
130 req := a.c.raw.BucketAccessControls.List(a.bucket)
[all...] |
| /external/chromium-trace/catapult/dependency_manager/dependency_manager/ |
| uploader_unittest.py | 15 self.bucket = 'cloud_storage_bucket'
24 self.bucket, None, self.local_path)
26 self.bucket, self.remote_path, None)
31 self.bucket, self.remote_path, self.local_path)
35 self.bucket, self.remote_path, self.local_path)
36 expected_bucket = self.bucket
47 self.bucket, self.remote_path, self.local_path)
49 self.bucket, self.remote_path, self.local_path)
68 self.bucket, self.remote_path, self.local_path)
74 self.bucket, new_remote_path, self.local_path
[all...] |
| /external/opencensus-java/impl_core/src/test/java/io/opencensus/implcore/stats/ |
| IntervalBucketTest.java | 93 IntervalBucket bucket = new IntervalBucket(START, MINUTE, MEAN, MEASURE_DOUBLE); local
96 bucket.record(tagValues1, 5.0, Collections.<String, String>emptyMap(), START);
97 bucket.record(tagValues1, 15.0, Collections.<String, String>emptyMap(), START);
98 bucket.record(tagValues2, 10.0, Collections.<String, String>emptyMap(), START);
99 assertThat(bucket.getTagValueAggregationMap().keySet()).containsExactly(tagValues1, tagValues2);
100 MutableMean mutableMean1 = (MutableMean) bucket.getTagValueAggregationMap().get(tagValues1);
101 MutableMean mutableMean2 = (MutableMean) bucket.getTagValueAggregationMap().get(tagValues2);
120 IntervalBucket bucket = new IntervalBucket(START, MINUTE, MEAN, MEASURE_DOUBLE); local
123 bucket.getFraction(twoMinutesAfterStart);
128 IntervalBucket bucket = new IntervalBucket(START, MINUTE, MEAN, MEASURE_DOUBLE) local
[all...] |
