| /frameworks/compile/mclinker/lib/Support/ |
| HandleToArea.cpp | 23 Bucket bucket;
24 bucket.hash_value = HashFunction()(
28 bucket.handle = pHandle;
29 bucket.area = pArea;
30 m_AreaMap.push_back(bucket);
48 HandleToAreaMap::iterator bucket, bEnd = m_AreaMap.end(); local
49 for (bucket = m_AreaMap.begin(); bucket != bEnd; ++bucket) {
65 HandleToAreaMap::iterator bucket, bEnd = m_AreaMap.end(); local
83 HandleToAreaMap::const_iterator bucket, bEnd = m_AreaMap.end(); local
[all...] |
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/ |
| bloom_filter.h | 42 const uint32_t bucket = static_cast<uint32_t>(position % BIGRAM_FILTER_MODULO); local
43 mFilter[bucket >> 3] |= static_cast<uint8_t>(1 << (bucket & 0x7));
48 const uint32_t bucket = static_cast<uint32_t>(position % BIGRAM_FILTER_MODULO); local
49 return (mFilter[bucket >> 3] & static_cast<uint8_t>(1 << (bucket & 0x7))) != 0;
|
| /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/chrome/browser/ui/webui/ntp/ |
| core_app_launcher_handler.cc | 29 extension_misc::AppLaunchBucket bucket,
31 DCHECK_LT(bucket, extension_misc::APP_LAUNCH_BUCKET_BOUNDARY);
34 bucket,
38 bucket,
46 extension_misc::AppLaunchBucket bucket = local
49 bucket = extension_misc::APP_LAUNCH_APP_LIST_SEARCH_WEBSTORE;
51 bucket = extension_misc::APP_LAUNCH_APP_LIST_SEARCH_CHROME;
52 RecordAppLaunchType(bucket, extension->GetType());
58 extension_misc::AppLaunchBucket bucket = local
61 bucket = extension_misc::APP_LAUNCH_APP_LIST_MAIN_WEBSTORE
87 extension_misc::AppLaunchBucket bucket = local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| PartitionAlloc.cpp | 52 PartitionBucket* bucket = &root->buckets[i]; variable
53 bucket->root = root;
54 bucket->currPage = &root->seedPage;
55 bucket->freePages = 0;
56 bucket->numFullPages = 0;
63 root->seedPage.bucket = &root->seedBucket;
89 static bool partitionAllocShutdownBucket(PartitionBucket* bucket, Vector<PartitionPageHeader*>* superPages)
92 bool noLeaks = !bucket->numFullPages;
93 PartitionFreepagelistEntry* entry = bucket->freePages;
100 PartitionPageHeader* page = bucket->currPage
[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...] |
| /external/chromium_org/net/base/ |
| file_stream_metrics.cc | 47 int bucket = GetFileErrorUmaBucket(error); local
56 UMA_HISTOGRAM_ENUMERATION("Net.FileErrorRange_Open", bucket, max_bucket);
61 UMA_HISTOGRAM_ENUMERATION("Net.FileErrorRange_Write", bucket, max_bucket);
66 UMA_HISTOGRAM_ENUMERATION("Net.FileErrorRange_Read", bucket, max_bucket);
71 UMA_HISTOGRAM_ENUMERATION("Net.FileErrorRange_Seek", bucket, max_bucket);
76 UMA_HISTOGRAM_ENUMERATION("Net.FileErrorRange_Flush", bucket, max_bucket);
81 UMA_HISTOGRAM_ENUMERATION("Net.FileErrorRange_SetEof", bucket,
87 UMA_HISTOGRAM_ENUMERATION("Net.FileErrorRange_GetSize", bucket,
|
| /packages/apps/Gallery2/src/com/android/gallery3d/ingest/ |
| MtpDeviceIndex.java | 42 * The index enables the access of items and bucket labels as one unified list.
44 * [Bucket A]: [photo 1], [photo 2]
45 * [Bucket B]: [photo 3]
48 * [Bucket A], [photo 1], [photo 2], [Bucket B], [photo 3]
52 * bucket labels need to always be at the beginning:
53 * [Bucket B], [photo 3], [Bucket A], [photo 2], [photo 1]
58 * - size: get the total number of items (bucket labels and MTP objects)
202 * @return the bucket label or MtpObjectInfo at the specified position an
208 DateBucket bucket = mBuckets[mUnifiedLookupIndex[position]]; local
217 DateBucket bucket = mBuckets[mUnifiedLookupIndex[zeroIndex]]; local
284 DateBucket bucket = mBuckets[mUnifiedLookupIndex[position]]; local
292 DateBucket bucket = mBuckets[mUnifiedLookupIndex[zeroIndex]]; local
350 SimpleDate bucket; field in class:MtpDeviceIndex.DateBucket
469 DateBucket bucket = mBuckets[i]; local
572 DateBucket bucket = mBucketsTemp.get(mDateInstance); local
[all...] |
| /external/chromium/net/base/ |
| ssl_false_start_blacklist.cc | 14 const unsigned bucket = Hash(last_two_labels) & (kBuckets - 1); local
15 const uint32 start = kHashTable[bucket];
16 const uint32 end = kHashTable[bucket + 1];
|
| /external/chromium_org/tools/deep_memory_profiler/subcommands/ |
| expand.py | 8 from lib.bucket import BUCKET_ID, COMMITTED, ALLOC_COUNT, FREE_COUNT
61 def _add_size(precedence, bucket, depth, committed, sizes):
64 bucket.symbolized_stackfunction[
65 0 : min(len(bucket.symbolized_stackfunction), 1 + depth)],
66 bucket.symbolized_stacksourcefile[
67 0 : min(len(bucket.symbolized_stacksourcefile), 1 + depth)]):
81 bucket = bucket_set.get(int(words[BUCKET_ID]))
82 if not bucket or bucket.allocator_type == 'malloc':
83 component_match = policy.find_malloc(bucket)
[all...] |
| pprof.py | 8 from lib.bucket import BUCKET_ID, COMMITTED, ALLOC_COUNT, FREE_COUNT
88 component_match, bucket = policy.find_mmap(region, bucket_set)
99 bucket = bucket_set.get(int(words[BUCKET_ID]))
100 if not bucket or bucket.allocator_type == 'malloc':
101 component_match = policy.find_malloc(bucket)
102 elif bucket.allocator_type == 'mmap':
106 if (not bucket or
129 component_match, bucket = policy.find_mmap(region, bucket_set)
137 for address in bucket.stacktrace
[all...] |
| stacktrace.py | 7 from lib.bucket import BUCKET_ID
34 bucket = bucket_set.get(int(words[BUCKET_ID]))
35 if not bucket:
39 for frame in bucket.symbolized_stackfunction:
|
| /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...] |
| /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/jmonkeyengine/engine/src/core/com/jme3/renderer/queue/ |
| RenderQueue.java | 71 * The render queue <code>Bucket</code> specifies the bucket
75 * bucket the spatial is placed. A spatial's queue bucket can be set
76 * via {@link Spatial#setQueueBucket(com.jme3.renderer.queue.RenderQueue.Bucket) }.
78 public enum Bucket {
100 * spatials in this bucket will appear behind everything, the downside
101 * to this bucket is that 3D objects will not be rendered correctly
165 * Sets a different geometry comparator for the specified bucket, one
171 * bucket since there is no correct way to sort the transparent bucke
[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/chrome/test/functional/ispy/ispy_core/tests/rendering_test_manager/ |
| cloud_bucket_impl.py | 19 """Initializes the bucket with a key, secret, and bucket_name.
24 bucket_name: the name of the bucket to connect to.
31 self.bucket = conn.get_bucket(bucket_name)
35 key = boto.gs.key.Key(self.bucket)
42 key = boto.gs.key.Key(self.bucket)
51 key = boto.gs.key.Key(self.bucket)
57 key = boto.gs.key.Key(self.bucket)
63 key = boto.gs.key.Key(self.bucket)
72 return (key.key for key in self.bucket.get_all_keys(prefix=prefix))
|
| /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...] |
| /external/chromium/chrome/browser/extensions/ |
| extensions_quota_service.cc | 51 // Apply heuristic to each item (bucket).
80 void QuotaLimitHeuristic::Bucket::Reset(const Config& config,
98 if ((*i)->expiration().is_null()) // A brand new bucket.
114 bool ExtensionsQuotaService::TimedLimit::Apply(Bucket* bucket,
116 if (event_time > bucket->expiration())
117 bucket->Reset(config(), event_time);
119 return bucket->DeductToken();
122 bool ExtensionsQuotaService::SustainedLimit::Apply(Bucket* bucket,
[all...] |
| /external/chromium_org/chrome/browser/extensions/ |
| extensions_quota_service.cc | 66 // Apply heuristic to each item (bucket).
102 void QuotaLimitHeuristic::Bucket::Reset(const Config& config,
127 if ((*i)->expiration().is_null()) // A brand new bucket.
150 bool ExtensionsQuotaService::TimedLimit::Apply(Bucket* bucket,
152 if (event_time > bucket->expiration())
153 bucket->Reset(config(), event_time);
155 return bucket->DeductToken();
158 bool ExtensionsQuotaService::SustainedLimit::Apply(Bucket* bucket,
[all...] |
| /external/chromium_org/gpu/command_buffer/service/ |
| common_decoder_unittest.cc | 12 CommonDecoder::Bucket bucket; local
13 EXPECT_EQ(0u, bucket.size());
14 EXPECT_TRUE(NULL == bucket.GetData(0, 0));
18 CommonDecoder::Bucket bucket; local
19 bucket.SetSize(24);
20 EXPECT_EQ(24u, bucket.size());
21 bucket.SetSize(12);
22 EXPECT_EQ(12u, bucket.size())
26 CommonDecoder::Bucket bucket; local
39 CommonDecoder::Bucket bucket; local
225 CommonDecoder::Bucket* bucket; local
253 CommonDecoder::Bucket* bucket = decoder_.GetBucket(kBucketId); local
311 CommonDecoder::Bucket* bucket = decoder_.GetBucket(kBucketId); local
[all...] |
