| /art/test/102-concurrent-gc/src/ |
| Main.java | 20 private static final int buckets = 16 * 1024; field in class:Main
28 ByteContainer[] l = new ByteContainer[buckets];
30 for (int i = 0; i < buckets; ++i) {
35 for (int i = 0; i < buckets / 256; ++i) {
36 int index = rnd.nextInt(buckets);
|
| /external/qemu/android/utils/ |
| 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]; \
|
| 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[nn] = NULL
[all...] |
| /external/emma/core/java12/com/vladium/util/ |
| 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; local
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; local
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; local
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
189 buckets = m_buckets
248 final Entry [] buckets = m_buckets; local
[all...] |
| 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; local
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; local
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; local
131 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next
178 Entry [] buckets = m_buckets; local
221 Entry [] buckets = m_buckets; local
290 final Entry [] buckets = m_buckets; local
[all...] |
| 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; local
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; local
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 [bucketIndex] = newEntry
220 final Entry [] buckets = m_buckets; local
[all...] |
| 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; local
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; local
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; local
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
193 buckets = m_buckets
217 Entry [] buckets = m_buckets; local
286 final Entry [] buckets = m_buckets; local
[all...] |
| SoftValueMap.java | 61 * @param initialCapacity initial number of hash buckets in the table
163 final SoftEntry [] buckets = m_buckets; local
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; local
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 [bucketIndex]
301 final SoftEntry [] buckets = m_buckets; local
345 final SoftEntry [] buckets = m_buckets; local
476 final SoftEntry [] buckets = m_buckets; local
[all...] |
| /development/tools/axl/ |
| chewperf.py | 62 buckets = {}
66 if bucket in buckets:
67 buckets[bucket] += bytes
69 buckets[bucket] = bytes
71 top = max(buckets.keys())
73 if x not in buckets.keys():
74 buckets[x] = 0
79 for x in range(len(buckets.items())):
80 window[x % len(window)] = buckets.items()[x][1]
81 print "%s\t%s" % (buckets.items()[x][0], sum(window) / len(window)
[all...] |
| /frameworks/ex/common/tools/ |
| make-iana-tld-pattern.py | 101 def getBucket(buckets, line):
103 bucket = buckets.get(letter)
107 buckets[letter] = bucket
111 def makePattern(prefix, suffix, buckets, isWebUrl=False):
114 output += getBucket(buckets, 'a').dump(isFirst=True, isWebUrl=isWebUrl)
117 output += getBucket(buckets, chr(letter)).dump(isWebUrl=isWebUrl)
119 output += getBucket(buckets, 'z').dump(isLast=True, isWebUrl=isWebUrl)
135 buckets = {} variable
141 getBucket(buckets, domain[0]).add(domain.strip())
147 getBucket(buckets, 'xn--').add(result[2:-1]
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| 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]) {
149 insert_at_head(& ht->buckets[bucket], & node->link);
160 foreach(node, & ht->buckets[bucket]) {
174 insert_at_head(& ht->buckets[bucket], & hn->link);
200 foreach_s(node, temp, &ht->buckets[bucket])
[all...] |
| /external/mesa3d/src/mesa/program/ |
| 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]) {
149 insert_at_head(& ht->buckets[bucket], & node->link);
160 foreach(node, & ht->buckets[bucket]) {
174 insert_at_head(& ht->buckets[bucket], & hn->link);
200 foreach_s(node, temp, &ht->buckets[bucket])
[all...] |
| /external/chromium_org/tools/perf/metrics/ |
| histogram_util_unittest.py | 11 baseline_histogram = """{"count": 3, "buckets": [
15 histogram = """{"count": 14, "buckets": [
23 for b in new_histogram['buckets']:
|
| /external/chromium_org/base/win/ |
| sampling_profiler_unittest.cc | 73 ASSERT_EQ(1, profiler.buckets().size());
74 ASSERT_EQ(0, profiler.buckets()[0]);
98 volatile const ULONG* bucket_ptr = &profiler.buckets()[0];
116 ASSERT_NE(0U, profiler.buckets()[0]);
|
| sampling_profiler.h | 19 // running, its buckets will count the number of times the instruction counter
54 // It is safe to read the counts in the sampling buckets at any time.
58 const std::vector<ULONG>& buckets() const { return buckets_; } function in class:base::win::SamplingProfiler
|
| /system/core/libcutils/ |
| hashmap.c | 35 Entry** buckets; member in struct:Hashmap
61 map->buckets = calloc(map->bucketCount, sizeof(Entry*));
62 if (map->buckets == NULL) {
115 Entry* entry = map->buckets[i];
126 free(map->buckets);
127 map->buckets = newBuckets;
143 Entry* entry = map->buckets[i];
150 free(map->buckets);
193 Entry** p = &(map->buckets[index]);
225 Entry* entry = map->buckets[index]
[all...] |
| /external/chromium_org/chrome/browser/extensions/api/metrics_private/ |
| metrics_private_api.cc | 42 // buckets; there is no real need for them
116 int min, int max, size_t buckets,
122 buckets = std::min(buckets, kMaxBuckets);
126 buckets = std::max(buckets, static_cast<size_t>(3));
127 // Trim buckets down to a maximum of the given range + over/underflow buckets
128 if (buckets > static_cast<size_t>(max - min + 2))
129 buckets = max - min + 2
[all...] |
| /external/chromium/chrome/browser/extensions/ |
| 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);
|
| /external/chromium_org/chrome/browser/extensions/ |
| extensions_quota_service.cc | 110 BucketList* buckets) {
111 buckets->push_back(&bucket_);
124 BucketList buckets; local
125 bucket_mapper_->GetBucketsForArgs(args, &buckets);
126 for (BucketList::iterator i = buckets.begin(); i != buckets.end(); ++i) {
|
| /external/guava/guava/src/com/google/common/hash/ |
| 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) {
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) {
189 checkArgument(buckets > 0, "buckets must be positive: %s", buckets);
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glx/ |
| glxhash.c | 121 __glxHashBucketPtr buckets[HASH_SIZE]; member in struct:__glxHashTable
171 table->buckets[i] = NULL;
187 for (bucket = table->buckets[i]; bucket;) {
210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) {
215 bucket->next = table->buckets[hash];
216 table->buckets[hash] = bucket;
264 bucket->next = table->buckets[hash];
265 table->buckets[hash] = bucket;
287 table->buckets[hash] = bucket->next;
304 table->p1 = table->buckets[table->p0]
[all...] |
| /external/mesa3d/src/glx/ |
| glxhash.c | 121 __glxHashBucketPtr buckets[HASH_SIZE]; member in struct:__glxHashTable
171 table->buckets[i] = NULL;
187 for (bucket = table->buckets[i]; bucket;) {
210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) {
215 bucket->next = table->buckets[hash];
216 table->buckets[hash] = bucket;
264 bucket->next = table->buckets[hash];
265 table->buckets[hash] = bucket;
287 table->buckets[hash] = bucket->next;
304 table->p1 = table->buckets[table->p0]
[all...] |
| /external/chromium_org/tools/deep_memory_profiler/subcommands/ |
| __init__.py | 5 from subcommands.buckets import BucketsCommand
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/ |
| pb_bufmgr_slab.c | 162 struct pb_manager **buckets; member in struct:pb_slab_range_manager
498 return mgr->buckets[i]->create_buffer(mgr->buckets[i], size, desc);
527 mgr->buckets[i]->destroy(mgr->buckets[i]);
528 FREE(mgr->buckets);
567 mgr->buckets = CALLOC(mgr->numBuckets, sizeof(*mgr->buckets));
568 if (!mgr->buckets)
573 mgr->buckets[i] = pb_slab_manager_create(provider, bufSize, slabSize, desc)
[all...] |
| /external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
| pb_bufmgr_slab.c | 162 struct pb_manager **buckets; member in struct:pb_slab_range_manager
498 return mgr->buckets[i]->create_buffer(mgr->buckets[i], size, desc);
527 mgr->buckets[i]->destroy(mgr->buckets[i]);
528 FREE(mgr->buckets);
567 mgr->buckets = CALLOC(mgr->numBuckets, sizeof(*mgr->buckets));
568 if (!mgr->buckets)
573 mgr->buckets[i] = pb_slab_manager_create(provider, bufSize, slabSize, desc)
[all...] |
