HomeSort by relevance Sort by last modified time
    Searched defs:bucket (Results 1 - 25 of 76) sorted by null

1 2 3 4

  /packages/inputmethods/LatinIME/native/jni/src/
bloom_filter.h 27 const unsigned int bucket = position % BIGRAM_FILTER_MODULO; local
28 filter[bucket >> 3] |= (1 << (bucket & 0x7));
32 const unsigned int bucket = position % BIGRAM_FILTER_MODULO; local
33 return filter[bucket >> 3] & (1 << (bucket & 0x7));
  /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/oprofile/daemon/liblegacy/
opd_image.c 227 size_t bucket; local
230 bucket = opd_hash_image(name, tid, tgid);
231 list_for_each(pos, &opd_images[bucket]) {
241 if (pos == &opd_images[bucket])
  /external/llvm/lib/CodeGen/AsmPrinter/
DwarfAccelTable.cpp 65 // Then compute the bucket size, minimum of 1 bucket.
93 // Figure out how many buckets we need, then compute the bucket
100 // Compute bucket contents and final ordering.
103 uint32_t bucket = Data[i]->HashValue % Header.bucket_count; local
104 Buckets[bucket].push_back(Data[i]);
117 Asm->OutStreamer.AddComment("Header Bucket Count");
137 // like a list of numbers of how many elements are in each bucket.
141 Asm->OutStreamer.AddComment("Bucket " + Twine(i));
151 // bucket
    [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]) {
134 const unsigned bucket = hash_value % ht->num_buckets; local
142 insert_at_head(& ht->buckets[bucket], & node->link);
149 const unsigned bucket = hash_value % ht->num_buckets; local
152 foreach(node, & ht->buckets[bucket]) {
  /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/util/
ArrayUtils.java 107 int bucket = ((System.identityHashCode(kind) / 8) & 0x7FFFFFFF) % CACHE_SIZE; local
108 Object cache = sCache[bucket];
112 sCache[bucket] = cache;
114 // Log.e("cache", "new empty " + kind.getName() + " at " + bucket);
  /dalvik/dx/src/com/android/dx/ssa/
Dominators.java 213 info[vertex.get(wInfo.semidom).getIndex()].bucket.add(w);
224 wParentBucket = info[wInfo.parent.getIndex()].bucket;
279 public ArrayList<SsaBasicBlock> bucket; field in class:Dominators.DFSInfo
282 bucket = new ArrayList<SsaBasicBlock>();
  /external/dexmaker/src/dx/java/com/android/dx/ssa/
Dominators.java 213 info[vertex.get(wInfo.semidom).getIndex()].bucket.add(w);
224 wParentBucket = info[wInfo.parent.getIndex()].bucket;
279 public ArrayList<SsaBasicBlock> bucket; field in class:Dominators.DFSInfo
282 bucket = new ArrayList<SsaBasicBlock>();
  /external/freetype/src/cache/
ftccache.c 88 /* get a top bucket for specified hash from cache,
131 * the bucket lists
145 /* split a single bucket */
493 FTC_Node* bucket; local
506 bucket = pnode = FTC_NODE__TOP_FOR_HASH( cache, hash );
525 /* Update bucket by modified linked list */
526 bucket = pnode = FTC_NODE__TOP_FOR_HASH( cache, hash );
542 if ( node != *bucket )
545 node->link = *bucket;
546 *bucket = node
580 FTC_Node* bucket = cache->buckets + i; local
    [all...]
  /external/qemu/
qdict.c 110 const char *key, unsigned int bucket)
114 QLIST_FOREACH(entry, &qdict->table[bucket], next)
134 unsigned int bucket; local
137 bucket = tdb_hash(key) % QDICT_BUCKET_MAX;
138 entry = qdict_find(qdict, key, bucket);
146 QLIST_INSERT_HEAD(&qdict->table[bucket], entry, next);
172 unsigned int bucket = tdb_hash(key) % QDICT_BUCKET_MAX; local
173 return (qdict_find(qdict, key, bucket) == NULL ? 0 : 1);
396 unsigned int bucket = tdb_hash(entry->key) % QDICT_BUCKET_MAX; local
397 ret = qdict_next_entry(qdict, bucket + 1)
    [all...]
  /frameworks/base/core/java/com/android/internal/util/
ArrayUtils.java 106 int bucket = ((System.identityHashCode(kind) / 8) & 0x7FFFFFFF) % CACHE_SIZE; local
107 Object cache = sCache[bucket];
111 sCache[bucket] = cache;
113 // Log.e("cache", "new empty " + kind.getName() + " at " + bucket);
  /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) {
  /frameworks/native/libs/utils/
BasicHashtable.cpp 29 mBucketSize(entrySize + sizeof(Bucket)), mHasTrivialDestructor(hasTrivialDestructor),
84 Bucket& bucket = bucketAt(mBuckets, i); local
85 bucket.cookie = 0;
100 const Bucket& bucket = bucketAt(mBuckets, index); local
101 if (bucket.cookie & Bucket::PRESENT) {
119 const Bucket& bucket = bucketAt(mBuckets, size_t(index)) local
135 const Bucket& bucket = bucketAt(mBuckets, size_t(index)); local
158 Bucket* bucket = &bucketAt(mBuckets, size_t(index)); local
187 Bucket& bucket = bucketAt(mBuckets, index); local
248 Bucket& bucket = bucketAt(buckets, i); local
265 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/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/qemu/distrib/sdl-1.2.12/src/video/fbcon/
SDL_fbvideo.h 161 vidmem_bucket *bucket; local
167 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
168 bucket->dirty = 0;
  /external/stlport/stlport/stl/
_unordered_map.h 179 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_map
339 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_multimap
_unordered_set.h 165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_set
315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_multiset
  /external/stlport/stlport/stl/debug/
_hashtable.h 186 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
191 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
199 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
204 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
322 size_type bucket(const _KT& __k) const { return _M_non_dbg_impl.bucket(__k); } function in class:hashtable
  /external/v8/src/
string-search.h 495 int bucket = (sizeof(PatternChar) == 1) ? c : c % AlphabetSize(); local
496 bad_char_occurrence[bucket] = i;
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_unordered_map.h 179 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_map
339 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_multimap
_unordered_set.h 165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_set
315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_multiset
  /ndk/sources/cxx-stl/stlport/stlport/stl/debug/
_hashtable.h 186 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
191 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
199 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
204 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
322 size_type bucket(const _KT& __k) const { return _M_non_dbg_impl.bucket(__k); } function in class:hashtable
  /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/
_unordered_map.h 179 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_map
339 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_multimap
_unordered_set.h 165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_set
315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_multiset

Completed in 8354 milliseconds

1 2 3 4