| /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/chromium_org/third_party/libvpx/source/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;
112 if (hist->bucket[idx].low > avg_bitrate)
113 hist->bucket[idx].low = (int)avg_bitrate;
114 if (hist->bucket[idx].high < avg_bitrate)
115 hist->bucket[idx].high = (int)avg_bitrate;
116 hist->bucket[idx].count++;
120 static int merge_hist_buckets(struct hist_bucket *bucket,
248 struct hist_bucket bucket[64]; 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;
112 if (hist->bucket[idx].low > avg_bitrate)
113 hist->bucket[idx].low = (int)avg_bitrate;
114 if (hist->bucket[idx].high < avg_bitrate)
115 hist->bucket[idx].high = (int)avg_bitrate;
116 hist->bucket[idx].count++;
120 static int merge_hist_buckets(struct hist_bucket *bucket,
248 struct hist_bucket bucket[64]; local
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/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;
112 if (hist->bucket[idx].low > avg_bitrate)
113 hist->bucket[idx].low = (int)avg_bitrate;
114 if (hist->bucket[idx].high < avg_bitrate)
115 hist->bucket[idx].high = (int)avg_bitrate;
116 hist->bucket[idx].count++;
120 static int merge_hist_buckets(struct hist_bucket *bucket,
248 struct hist_bucket bucket[64]; local
[all...] |
| /external/chromium_org/chrome/browser/ui/webui/ntp/ |
| core_app_launcher_handler.cc | 31 extension_misc::AppLaunchBucket bucket,
33 DCHECK_LT(bucket, extension_misc::APP_LAUNCH_BUCKET_BOUNDARY);
36 bucket,
40 bucket,
48 extension_misc::AppLaunchBucket bucket = local
51 bucket = extension_misc::APP_LAUNCH_APP_LIST_SEARCH_WEBSTORE;
53 bucket = extension_misc::APP_LAUNCH_APP_LIST_SEARCH_CHROME;
54 RecordAppLaunchType(bucket, extension->GetType());
60 extension_misc::AppLaunchBucket bucket = local
63 bucket = extension_misc::APP_LAUNCH_APP_LIST_MAIN_WEBSTORE
89 extension_misc::AppLaunchBucket bucket = local
[all...] |
| /external/chromium_org/third_party/mesa/src/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/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...] |
| /hardware/intel/img/libdrm/libdrm/ |
| xf86drmHash.c | 177 HashBucketPtr bucket; local
184 for (bucket = table->buckets[i]; bucket;) {
185 next = bucket->next;
186 HASH_FREE(bucket);
187 bucket = next;
194 /* Find the bucket and organize the list so that this bucket is at the
202 HashBucketPtr bucket; local
206 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next)
228 HashBucketPtr bucket; local
241 HashBucketPtr bucket; local
264 HashBucketPtr bucket; local
332 HashBucketPtr bucket; local
[all...] |
| /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/chromium_org/third_party/WebKit/Source/wtf/ |
| PartitionAlloc.cpp | 65 // This works out reasonably for the current bucket sizes of the generic
130 static void partitionBucketInitBase(PartitionBucket* bucket, PartitionRootBase* root)
132 bucket->activePagesHead = &PartitionRootGeneric::gSeedPage;
133 bucket->freePagesHead = 0;
134 bucket->numFullPages = 0;
135 bucket->numSystemPagesPerSlotSpan = partitionBucketNumSystemPages(bucket->slotSize);
146 PartitionBucket* bucket = &root->buckets()[i]; local
148 bucket->slotSize = kAllocationGranularity;
150 bucket->slotSize = i << kBucketShift
193 PartitionBucket* bucket = &root->buckets[0]; local
280 PartitionBucket* bucket = &root->buckets()[i]; local
294 PartitionBucket* bucket = &root->buckets[i]; local
444 PartitionBucket* bucket = page->bucket; local
517 PartitionBucket* bucket = page->bucket; local
609 PartitionBucket* bucket = reinterpret_cast<PartitionBucket*>(reinterpret_cast<char*>(page) + kPageMetadataSize); local
767 PartitionBucket* bucket = page->bucket; local
933 const PartitionBucket& bucket = root.buckets()[i]; local
[all...] |
| /external/chromium_org/tools/deep_memory_profiler/subcommands/ |
| expand.py | 76 def _add_size(precedence, bucket, depth, committed, sizes):
79 bucket.symbolized_stackfunction[
80 0 : min(len(bucket.symbolized_stackfunction), 1 + depth)],
81 bucket.symbolized_stacksourcefile[
82 0 : min(len(bucket.symbolized_stacksourcefile), 1 + depth)]):
95 bucket = bucket_set.get(bucket_id)
96 if not bucket or bucket.allocator_type == 'malloc':
97 component_match = policy.find_malloc(bucket)
98 elif bucket.allocator_type == 'mmap'
[all...] |
| pprof.py | 87 component_match, bucket = policy.find_mmap(region, bucket_set)
97 bucket = bucket_set.get(bucket_id)
98 if not bucket or bucket.allocator_type == 'malloc':
99 component_match = policy.find_malloc(bucket)
100 elif bucket.allocator_type == 'mmap':
104 if (not bucket or
127 component_match, bucket = policy.find_mmap(region, bucket_set)
135 for address in bucket.stacktrace:
140 bucket = bucket_set.get(bucket_id
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/video/dga/ |
| SDL_dgavideo.c | 599 vidmem_bucket *bucket; local
604 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
605 printf("Bucket: %p, %d (%s)\n", bucket->base, bucket->size, bucket->used ? "used" : "free");
606 if ( bucket->prev )
627 vidmem_bucket *bucket; local
659 vidmem_bucket *bucket, *freeable; local
682 vidmem_bucket *bucket; local
695 vidmem_bucket *bucket; local
776 vidmem_bucket *bucket, *freeable; local
[all...] |
| /external/chromium_org/build/util/lib/common/ |
| perf_tests_results_helper.py | 46 for bucket in histogram['buckets']:
47 if 'high' in bucket:
48 bucket['mean'] = (bucket['low'] + bucket['high']) / 2.0
50 bucket['mean'] = bucket['low']
51 if bucket['mean'] > 0:
52 sum_of_logs += math.log(bucket['mean']) * bucket['count'
[all...] |
| /external/chromium_org/tools/telemetry/ |
| cloud_storage | 16 BUCKETS = {bucket: easy_bucket_name for easy_bucket_name, bucket
35 for bucket in BUCKETS:
37 bucket_contents[bucket] = cloud_storage.List(bucket)
41 # Check if each file is in the bucket contents.
55 for bucket in BUCKETS:
56 if bucket in bucket_contents and file_hash in bucket_contents[bucket]:
57 file_buckets[file_path].append(bucket)
[all...] |
| /system/core/libutils/ |
| BasicHashtable.cpp | 29 mBucketSize(entrySize + sizeof(Bucket)), mHasTrivialDestructor(hasTrivialDestructor),
88 Bucket& bucket = bucketAt(mBuckets, i); local
89 bucket.cookie = 0;
104 const Bucket& bucket = bucketAt(mBuckets, index); local
105 if (bucket.cookie & Bucket::PRESENT) {
123 const Bucket& bucket = bucketAt(mBuckets, size_t(index)) local
139 const Bucket& bucket = bucketAt(mBuckets, size_t(index)); local
162 Bucket* bucket = &bucketAt(mBuckets, size_t(index)); local
191 Bucket& bucket = bucketAt(mBuckets, index); local
252 Bucket& bucket = bucketAt(buckets, i); local
269 Bucket& bucket = bucketAt(buckets, i); local
[all...] |
| /external/chromium_org/third_party/mesa/src/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/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/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...] |
| /ndk/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...] |
| /external/chromium_org/tools/memory_inspector/memory_inspector/classification/ |
| results.py | 8 aggregated results are organized in a bucket tree, which structure is identical
50 """A tree of results, where each node is a bucket (root: 'Total' bucket)."""
53 """Initializes the bucket tree using the structure of the rules tree.
55 Each node of the bucket tree is initialized with a list of len(keys) zeros.
84 def _AddToMatchingNodes(trace_record, values, bucket, num_keys):
85 if not bucket.rule.Match(trace_record):
88 bucket.values[i] += values[i]
89 for child_bucket in bucket.children:
98 bucket = Bucket(rule, num_keys
[all...] |
| /external/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...] |
| /ndk/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...] |
