| /frameworks/compile/mclinker/include/mcld/ADT/ |
| HashIterator.h | 43 bucket_type &bucket = m_pHashTable->m_Buckets[m_Index]; local
44 if (bucket_type::getTombstone() == bucket.Entry) {
47 else if (m_HashValue == bucket.FullHashValue) {
48 if (bucket.Entry->compare(pKey)) {
124 bucket_type &bucket = m_pHashTable->m_Buckets[m_Index]; local
126 if (bucket_type::getTombstone() == bucket.Entry ||
127 bucket_type::getEmptyBucket() == bucket.Entry) {
130 else if (m_HashValue == bucket.FullHashValue) {
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/debug/ |
| safe_local_iterator.h | 60 /// The bucket this local iterator belongs to
225 * @brief Return the bucket
228 bucket() const { return _M_bucket; } function in class:__gnu_debug::_Safe_local_iterator
275 /// Is this iterator part of the same bucket as the other one?
279 { return _M_bucket == __other.bucket(); }
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/debug/ |
| safe_local_iterator.h | 60 /// The bucket this local iterator belongs to
225 * @brief Return the bucket
228 bucket() const { return _M_bucket; } function in class:__gnu_debug::_Safe_local_iterator
275 /// Is this iterator part of the same bucket as the other one?
279 { return _M_bucket == __other.bucket(); }
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/debug/ |
| safe_local_iterator.h | 60 /// The bucket this local iterator belongs to
225 * @brief Return the bucket
228 bucket() const { return _M_bucket; } function in class:__gnu_debug::_Safe_local_iterator
275 /// Is this iterator part of the same bucket as the other one?
279 { return _M_bucket == __other.bucket(); }
|
| /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/chrome/browser/extensions/ |
| extensions_quota_service_unittest.cc | 14 typedef QuotaLimitHeuristic::Bucket Bucket;
37 buckets_[id] = new Bucket();
42 typedef std::map<int, Bucket*> BucketMap;
116 Bucket* b,
141 Bucket b;
160 Bucket bucket; local
162 bucket.Reset(k2PerMinute, kStartTime);
163 DoMoreThan2PerMinuteFor5Minutes(kStartTime, &lim, &bucket, -1)
[all...] |
| /external/chromium_org/chrome/browser/extensions/ |
| extensions_quota_service_unittest.cc | 18 typedef QuotaLimitHeuristic::Bucket Bucket;
43 buckets_[id] = new Bucket();
48 typedef std::map<int, Bucket*> BucketMap;
151 Bucket* b,
176 Bucket b;
196 Bucket bucket; local
198 bucket.Reset(k2PerMinute, kStartTime);
199 DoMoreThan2PerMinuteFor5Minutes(kStartTime, &lim, &bucket, -1)
[all...] |
| /external/chromium_org/chrome/common/metrics/ |
| entropy_provider_unittest.cc | 153 const size_t bucket = static_cast<size_t>(kBucketCount * entropy_value); local
154 ASSERT_LT(bucket, kBucketCount);
155 distribution[bucket] += 1;
|
| /external/chromium_org/gpu/command_buffer/client/ |
| query_tracker.h | 31 struct Bucket {
32 explicit Bucket(QuerySync* sync_mem)
40 QueryInfo(Bucket* bucket, int32 id, uint32 offset, QuerySync* sync_mem)
41 : bucket(bucket),
48 : bucket(NULL),
54 Bucket* bucket; member in struct:gpu::gles2::QuerySyncManager::QueryInfo
69 std::deque<Bucket*> buckets_
[all...] |
| /external/chromium_org/gpu/command_buffer/service/ |
| common_decoder.cc | 10 CommonDecoder::Bucket::Bucket() : size_(0) {}
12 CommonDecoder::Bucket::~Bucket() {}
14 void* CommonDecoder::Bucket::GetData(size_t offset, size_t size) const {
21 void CommonDecoder::Bucket::SetSize(size_t size) {
29 bool CommonDecoder::Bucket::SetData(
38 void CommonDecoder::Bucket::SetFromString(const char* str) {
50 bool CommonDecoder::Bucket::GetAsString(std::string* str) {
86 CommonDecoder::Bucket* CommonDecoder::GetBucket(uint32 bucket_id) const
92 Bucket* bucket = GetBucket(bucket_id); local
185 Bucket* bucket = CreateBucket(bucket_id); local
201 Bucket* bucket = GetBucket(bucket_id); local
222 Bucket* bucket = GetBucket(bucket_id); local
256 Bucket* bucket = GetBucket(bucket_id); local
280 Bucket* bucket = GetBucket(bucket_id); local
[all...] |
| 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...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| PartitionAlloc.h | 60 // bucket.
62 // - The freelist for a given bucket is split across a number of partition
64 // - Fine-grained bucket sizes leading to less waste and better packing.
79 // - No randomness of freelist entries or bucket position.
104 // Supports allocations up to 4088 (one bucket is used for metadata).
118 // Special bucket id for free page metadata.
130 PartitionBucket* bucket; member in struct:WTF::PartitionPageHeader
178 ALWAYS_INLINE size_t partitionBucketSize(const PartitionBucket* bucket)
180 PartitionRoot* root = bucket->root;
181 size_t index = bucket - &root->buckets[0]
[all...] |
| PartitionAllocTest.cpp | 78 WTF::PartitionBucket* bucket = &root.buckets[bucketIdx]; local
92 EXPECT_EQ(numSlots, static_cast<size_t>(bucket->currPage->numAllocatedSlots));
93 EXPECT_EQ(0, bucket->currPage->freelistHead);
94 EXPECT_TRUE(bucket->currPage);
95 EXPECT_TRUE(bucket->currPage != &root.seedPage);
96 return bucket->currPage;
118 WTF::PartitionBucket* bucket = &root.buckets[bucketIdx]; local
120 EXPECT_EQ(0, bucket->freePages);
121 EXPECT_EQ(&bucket->root->seedPage, bucket->currPage)
187 WTF::PartitionBucket* bucket = &root.buckets[bucketIdx]; local
226 WTF::PartitionBucket* bucket = &root.buckets[bucketIdx]; local
273 WTF::PartitionBucket* bucket = &root.buckets[bucketIdx]; 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/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/chromium_org/third_party/tcmalloc/chromium/src/ |
| memory_region_map.cc | 253 HeapProfileBucket* bucket = curr; local
255 MyAllocator::Free(bucket->stack, 0);
256 MyAllocator::Free(bucket, 0);
391 for (HeapProfileBucket* bucket = bucket_table_[hash_index];
392 bucket != 0;
393 bucket = bucket->next) {
394 if ((bucket->hash == hash) && (bucket->depth == depth) &&
395 std::equal(key, key + depth, bucket->stack))
402 HeapProfileBucket* bucket; local
503 HeapProfileBucket bucket = saved_buckets_[--saved_buckets_count_]; local
[all...] |
| profiledata.cc | 113 hash_ = new Bucket[kBuckets];
171 Bucket* bucket = &hash_[b]; local
173 if (bucket->entry[a].count > 0) {
174 Evict(bucket->entry[a]);
246 Bucket* bucket = &hash_[b]; local
248 if (bucket->entry[a].count > 0) {
249 Evict(bucket->entry[a]);
250 bucket->entry[a].depth = 0
280 Bucket* bucket = &hash_[h % kBuckets]; local
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| heap-profile-table.h | 204 // Hash table bucket to hold (de)allocation stats
206 struct Bucket : public Stats {
210 Bucket* next; // Next entry in hash-table
215 // Access to the stack-trace bucket
216 Bucket* bucket() const { function in struct:HeapProfileTable::AllocValue
217 return reinterpret_cast<Bucket*>(bucket_rep & ~uintptr_t(kMask));
220 void set_bucket(Bucket* b) { bucket_rep = reinterpret_cast<uintptr_t>(b); }
261 // Unparse bucket b and print its portion of profile dump into buf.
267 // counting bucket b
[all...] |
| profiledata.cc | 113 hash_ = new Bucket[kBuckets];
171 Bucket* bucket = &hash_[b]; local
173 if (bucket->entry[a].count > 0) {
174 Evict(bucket->entry[a]);
246 Bucket* bucket = &hash_[b]; local
248 if (bucket->entry[a].count > 0) {
249 Evict(bucket->entry[a]);
250 bucket->entry[a].depth = 0
280 Bucket* bucket = &hash_[h % kBuckets]; local
[all...] |
| /external/chromium_org/tools/deep_memory_profiler/lib/ |
| sorter.py | 111 def __init__(self, unit_id, size, alloc_count, free_count, bucket):
113 self._bucket = bucket
118 return str(self.bucket)
121 def bucket(self): member in class:MallocUnit
215 bucket = unit.bucket_set.get(unit.region[1]['bucket_id'])
216 assert bucket
217 assert bucket.allocator_type == 'mmap'
219 stackfunction = bucket.symbolized_joined_stackfunction
220 stacksourcefile = bucket.symbolized_joined_stacksourcefile
300 assert unit.bucket.allocator_type == 'malloc
[all...] |
| /external/chromium_org/v8/src/ |
| string-search.h | 503 int bucket = (sizeof(PatternChar) == 1) ? c : c % AlphabetSize(); local
504 bad_char_occurrence[bucket] = i;
|
| /external/jdiff/src/jdiff/ |
| HTMLStatistics.java | 203 int bucket = (int)(pkg.pdiff); local
204 hist[bucket]++;
206 if (bucket != 0)
207 h_.writeText(" <TD ALIGN=\"center\">" + bucket + "</TD>");
290 int bucket = (int)(classDiff.pdiff); local
291 hist[bucket]++;
293 if (bucket != 0)
294 h_.writeText(" <TD ALIGN=\"center\">" + bucket + "</TD>");
|
| /external/libppp/src/ |
| mbuf.c | 63 } *bucket[(M_MAXLEN + sizeof(struct mbuf)) / BUCKET_HASH]; variable in typeref:struct:mbucket
66 #define M_BUCKET(sz) (bucket + M_BINDEX(sz))
|
| /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/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...] |
