/external/qemu/android/utils/ |
H A D | refset.h | 22 AVECTOR_DECL(void*,buckets); 29 AVECTOR_INIT(s,buckets); 35 AVECTOR_DONE(s,buckets); 41 AVECTOR_CLEAR(s,buckets); 48 return (int) AVECTOR_SIZE(s,buckets); 65 void* __refset_item = (_set)->buckets[__refset_nn]; \
|
H A D | refset.c | 36 void** pnode = &s->buckets[index]; 55 void** pnode = &s->buckets[index]; 90 AVECTOR_INIT_ALLOC(&newSet,buckets, newSize); 93 void* item = s->buckets[nn]; 100 AVECTOR_DONE(s,buckets); 101 s->buckets = newSet.buckets; 118 AVECTOR_INIT_ALLOC(s,buckets,4); 165 if (s->buckets[nn] == AREFSET_DELETED) { 166 s->buckets[n [all...] |
/external/emma/core/java12/com/vladium/util/ |
H A D | IntObjectMap.java | 48 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1]. 87 final Entry [] buckets = m_buckets; 88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 112 final Entry [] buckets = m_buckets; 113 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; 116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 164 Entry [] buckets = m_buckets; 165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 189 buckets [all...] |
H A D | IntIntMap.java | 48 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1]. 87 final Entry [] buckets = m_buckets; 88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 111 final Entry [] buckets = m_buckets; 112 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; 115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 130 final Entry [] buckets = m_buckets; 131 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; 134 for (Entry entry = buckets [bucketInde [all...] |
H A D | IntSet.java | 46 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1]. 85 final Entry [] buckets = m_buckets; 86 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; 89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 145 Entry [] buckets = m_buckets; 146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 161 buckets = m_buckets; 162 bucketIndex = (key & 0x7FFFFFFF) % buckets.length; 163 final Entry bucketListHead = buckets [bucketIndex]; 165 buckets [bucketInde [all...] |
H A D | ObjectIntMap.java | 50 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1]. 91 final Entry [] buckets = m_buckets; 93 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length; 96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 119 final Entry [] buckets = m_buckets; 121 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length; 124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 171 Entry [] buckets = m_buckets; 172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 193 buckets [all...] |
H A D | SoftValueMap.java | 61 * @param initialCapacity initial number of hash buckets in the table 163 final SoftEntry [] buckets = m_buckets; 164 final int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length; 169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 234 SoftEntry [] buckets = m_buckets; 235 int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length; 238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 281 buckets = m_buckets; 282 bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length; 283 final SoftEntry bucketListHead = buckets [bucketInde [all...] |
/external/mesa3d/src/mesa/program/ |
H A D | hash_table.c | 45 struct node buckets[1]; member in struct:hash_table 69 * sizeof(ht->buckets[0]))); 76 make_empty_list(& ht->buckets[i]); 101 foreach_s(node, temp, & ht->buckets[i]) { 106 assert(is_empty_list(& ht->buckets[i])); 118 foreach(node, & ht->buckets[bucket]) { 142 insert_at_head(& ht->buckets[bucket], & node->link); 152 foreach(node, & ht->buckets[bucket]) {
|
/external/chromium/chrome/browser/extensions/ |
H A D | extension_metrics_module.cc | 75 size_t buckets, 83 buckets, 89 buckets, 109 int buckets; local 114 EXTENSION_FUNCTION_VALIDATE(metric_type->GetInteger("buckets", &buckets)); 118 return RecordValue(name, histogram_type, min, max, buckets, sample); 71 RecordValue(const std::string& name, Histogram::ClassType type, int min, int max, size_t buckets, int sample) argument
|
H A D | extensions_quota_service.cc | 95 BucketList buckets; local 96 bucket_mapper_->GetBucketsForArgs(args, &buckets); 97 for (BucketList::iterator i = buckets.begin(); i != buckets.end(); ++i) {
|
H A D | extension_metrics_module.h | 36 int min, int max, size_t buckets, int sample);
|
H A D | extension_metrics_apitest.cc | 35 size_t buckets; member in struct:__anon1564::RecordedHistogram 132 EXPECT_EQ(r.buckets, histogram->bucket_count());
|
H A D | extensions_quota_service.h | 99 // refilling buckets they are just 'Reset' on-demand (e.g. when new events 130 // the set of buckets (which is typically stored in the BucketMapper itself) 137 // occurs while parsing |args|, the function aborts - buckets may be non- 141 BucketList* buckets) = 0; 191 // Specifies how long exhaustion of buckets is allowed to continue before
|
/external/guava/guava/src/com/google/common/hash/ |
H A D | Hashing.java | 159 * Assigns to {@code hashCode} a "bucket" in the range {@code [0, buckets)}, in a uniform 160 * manner that minimizes the need for remapping as {@code buckets} grows. That is, 171 public static int consistentHash(HashCode hashCode, int buckets) { argument 172 return consistentHash(padToLong(hashCode), buckets); 176 * Assigns to {@code input} a "bucket" in the range {@code [0, buckets)}, in a uniform 177 * manner that minimizes the need for remapping as {@code buckets} grows. That is, 188 public static int consistentHash(long input, int buckets) { argument 189 checkArgument(buckets > 0, "buckets must be positive: %s", buckets); [all...] |
/external/skia/samplecode/ |
H A D | SampleTypeface.cpp | 34 int buckets[16]; local 35 sk_bzero(buckets, sizeof(buckets)); 41 buckets[da] += 1; 51 // SkDebugf("[%d] = %d\n", i, buckets[i]);
|
/external/freetype/src/cache/ |
H A D | ftccache.c | 102 pnode = cache->buckets + idx; 110 * buckets array appropriately, we simply degrade the hash table's 121 FT_UFast count = mask + p + 1; /* number of buckets */ 124 /* do we need to shrink the buckets array? */ 130 /* try to expand the buckets array _before_ splitting 140 if ( FT_RENEW_ARRAY( cache->buckets, 146 pnode = cache->buckets + p; 164 cache->buckets[p + mask + 1] = new_list; 177 /* do we need to expand the buckets array? */ 194 if ( FT_RENEW_ARRAY( cache->buckets, [all...] |
/external/chromium/net/base/ |
H A D | ssl_false_start_blacklist_process.cc | 202 std::vector<std::string> buckets[kBuckets]; local 209 buckets[h & (kBuckets - 1)].push_back(*i); 215 if (buckets[i].size() > max_bucket_size) 216 max_bucket_size = buckets[i].size(); 220 j = buckets[i].begin(); j != buckets[i].end(); j++) {
|
/external/bsdiff/ |
H A D | bsdiff.c | 106 off_t buckets[256]; local 109 for(i=0;i<256;i++) buckets[i]=0; 110 for(i=0;i<oldsize;i++) buckets[old[i]]++; 111 for(i=1;i<256;i++) buckets[i]+=buckets[i-1]; 112 for(i=255;i>0;i--) buckets[i]=buckets[i-1]; 113 buckets[0]=0; 115 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i; 117 for(i=0;i<oldsize;i++) V[i]=buckets[ol [all...] |
/external/freetype/src/base/ |
H A D | ftdbgmem.c | 116 FT_MemNode* buckets; member in struct:FT_MemTableRec_ 281 node = table->buckets[i]; 295 if ( table->buckets ) 296 ft_mem_table_free( table, table->buckets ); 298 table->buckets = new_buckets; 327 table->buckets = (FT_MemNode *) 330 if ( table->buckets ) 331 FT_ARRAY_ZERO( table->buckets, table->size ); 360 FT_MemNode *pnode = table->buckets + i, next, node = *pnode; 388 table->buckets[ [all...] |
/external/clang/include/clang/Basic/ |
H A D | OnDiskHashTable.h | 253 const unsigned char* buckets, 257 Buckets(buckets), Base(base), InfoObj(InfoObj) { 258 assert((reinterpret_cast<uintptr_t>(buckets) & 0x3) == 0 && 259 "'buckets' must have a 4-byte alignment"); 468 static OnDiskChainedHashTable* Create(const unsigned char* buckets, argument 472 assert(buckets > base); 473 assert((reinterpret_cast<uintptr_t>(buckets) & 0x3) == 0 && 474 "buckets should be 4-byte aligned."); 476 unsigned numBuckets = ReadLE32(buckets); 477 unsigned numEntries = ReadLE32(buckets); 252 OnDiskChainedHashTable(unsigned numBuckets, unsigned numEntries, const unsigned char* buckets, const unsigned char* base, const Info &InfoObj = Info()) argument [all...] |
/external/v8/src/ |
H A D | counters.h | 79 // sample values. buckets is the maximum number of buckets 84 size_t buckets) { 86 return create_histogram_function_(name, min, max, buckets); 81 CreateHistogram(const char* name, int min, int max, size_t buckets) argument
|
/external/dbus/dbus/ |
H A D | dbus-hash.c | 110 * different buckets. The hash function was taken from a 114 * decreases as we increase the number of hash buckets (to keep more 116 * fewer high bits as the number of hash buckets increases. 126 * Initial number of buckets in hash table (hash table statically 127 * allocates its buckets for this size and below). 171 DBusHashEntry **buckets; /**< Pointer to bucket array. Each member in struct:DBusHashTable 179 int n_buckets; /**< Total number of buckets allocated 180 * at **buckets. 316 table->buckets = table->static_buckets; 389 entry = table->buckets[ [all...] |
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | antlr3collections.c | 129 // and allocate memory for the requested number of buckets. 133 ANTLR3_UINT32 bucket; // Used to traverse the buckets 143 // Allocate memory for the buckets 145 table->buckets = (pANTLR3_HASH_BUCKET) ANTLR3_MALLOC((size_t) (sizeof(ANTLR3_HASH_BUCKET) * sizeHint)); 147 if (table->buckets == NULL) 159 /* Initialize the buckets to empty 163 table->buckets[bucket].entries = NULL; 197 ANTLR3_UINT32 bucket; /* Used to traverse the buckets */ 203 /* Free the table, all buckets and all entries, and all the 210 thisBucket = &(table->buckets[bucke [all...] |
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | antlr3collections.h | 80 * if the number of buckets is small). We could implement dual hashing algorithms 109 /** Number of buckets available in this table 113 /** Points to the memory where the array of buckets 116 pANTLR3_HASH_BUCKET buckets; member in struct:ANTLR3_HASH_TABLE_struct 353 pANTLR3_TRIE_ENTRY buckets; /**< This is the data bucket(s) that the key indexes, which may be NULL */ member in struct:ANTLR3_INT_TRIE_NODE_struct
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/builderTemplate/publishingFiles/dropSiteRootFiles/ |
H A D | index.php | 69 $buckets[$parts[0]][] = $anEntry;
128 $aBucket = $buckets[$prefix];
|