| /external/emma/core/java12/com/vladium/util/ |
| D | IntIntMap.java | 87 final Entry [] buckets = m_buckets; in contains() local
88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in contains()
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
111 final Entry [] buckets = m_buckets; in get() local
112 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in get()
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
130 final Entry [] buckets = m_buckets; in get() local
131 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in get()
134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
178 Entry [] buckets = m_buckets; in put() local
[all …]
|
| D | ObjectIntMap.java | 91 final Entry [] buckets = m_buckets; in contains() local
93 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length; in contains()
96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
119 final Entry [] buckets = m_buckets; in get() local
121 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length; in get()
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
171 Entry [] buckets = m_buckets; in put() local
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
193 buckets = m_buckets; in put()
194 bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length; in put()
[all …]
|
| D | IntObjectMap.java | 87 final Entry [] buckets = m_buckets; in contains() local
88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in contains()
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
112 final Entry [] buckets = m_buckets; in get() local
113 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in get()
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
164 Entry [] buckets = m_buckets; in put() local
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
189 buckets = m_buckets; in put()
190 bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in put()
[all …]
|
| D | IntSet.java | 85 final Entry [] buckets = m_buckets; in contains() local
86 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in contains()
89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
145 Entry [] buckets = m_buckets; in add() local
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in add()
161 buckets = m_buckets; in add()
162 bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in add()
163 final Entry bucketListHead = buckets [bucketIndex]; in add()
165 buckets [bucketIndex] = newEntry; in add()
220 final Entry [] buckets = m_buckets; in rehash() local
[all …]
|
| D | SoftValueMap.java | 163 final SoftEntry [] buckets = m_buckets; in get() local
164 final int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length; in get()
169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
234 SoftEntry [] buckets = m_buckets; in put() local
235 int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length; in put()
238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
281 buckets = m_buckets; in put()
282 bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length; in put()
283 final SoftEntry bucketListHead = buckets [bucketIndex]; in put()
285 buckets [bucketIndex] = newEntry; in put()
[all …]
|
| /external/chromium_org/third_party/libvpx/source/libvpx/ |
| D | rate_hist.c | 123 int buckets = *num_buckets; in merge_hist_buckets() local
128 for (i = 0; i < buckets; i++) { in merge_hist_buckets()
138 while (buckets > max_buckets) { in merge_hist_buckets()
139 int last_bucket = buckets - 1; in merge_hist_buckets()
152 assert(small_bucket < buckets); in merge_hist_buckets()
153 assert(big_bucket < buckets); in merge_hist_buckets()
154 assert(merge_bucket < buckets); in merge_hist_buckets()
167 buckets--; in merge_hist_buckets()
173 for (i = 0; i < buckets; i++) { in merge_hist_buckets()
184 *num_buckets = buckets; in merge_hist_buckets()
[all …]
|
| /external/libvpx/libvpx/ |
| D | rate_hist.c | 123 int buckets = *num_buckets; in merge_hist_buckets() local
128 for (i = 0; i < buckets; i++) { in merge_hist_buckets()
138 while (buckets > max_buckets) { in merge_hist_buckets()
139 int last_bucket = buckets - 1; in merge_hist_buckets()
152 assert(small_bucket < buckets); in merge_hist_buckets()
153 assert(big_bucket < buckets); in merge_hist_buckets()
154 assert(merge_bucket < buckets); in merge_hist_buckets()
167 buckets--; in merge_hist_buckets()
173 for (i = 0; i < buckets; i++) { in merge_hist_buckets()
184 *num_buckets = buckets; in merge_hist_buckets()
[all …]
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/ |
| D | bisect_test_ordering.py | 62 self.buckets = [Bucket([self.expected_failure])]
72 self.buckets = [Bucket(self.tests[:-1]), Bucket([self.expected_failure])]
87 if self.test_bucket_list_fails(self.buckets):
93 for bucket in self.buckets:
95 print '%d tests left, %d buckets' % (count, len(self.buckets))
99 for bucket in self.buckets:
105 for bucket in self.buckets:
114 for bucket in self.buckets:
120 bucket_to_split = self.buckets[largest_index]
125 buckets_before = self.buckets[:largest_index]
[all …]
|
| /external/chromium_org/tools/telemetry/ |
| D | cloud_storage | 100 for file_path, buckets in sorted(files.iteritems()):
101 if buckets:
102 buckets = [BUCKETS[bucket] for bucket in buckets]
103 print '%-11s %s' % (','.join(buckets), file_path)
123 for file_path, buckets in sorted(files.iteritems()):
124 if not buckets:
127 for file_path, buckets in sorted(files.iteritems()):
128 if args.bucket in buckets:
129 buckets.remove(args.bucket)
130 if not buckets:
[all …]
|
| /external/qemu/android/utils/ |
| D | refset.c | 36 void** pnode = &s->buckets[index]; in _arefSet_lookup()
55 void** pnode = &s->buckets[index]; in _arefSet_lookupInsert()
90 AVECTOR_INIT_ALLOC(&newSet,buckets, newSize); in _arefSet_resize()
93 void* item = s->buckets[nn]; in _arefSet_resize()
100 AVECTOR_DONE(s,buckets); in _arefSet_resize()
101 s->buckets = newSet.buckets; in _arefSet_resize()
118 AVECTOR_INIT_ALLOC(s,buckets,4); in arefSet_add()
165 if (s->buckets[nn] == AREFSET_DELETED) { in _arefSet_removeDeferred()
166 s->buckets[nn] = NULL; in _arefSet_removeDeferred()
|
| D | refset.h | 25 AVECTOR_DECL(void*,buckets);
32 AVECTOR_INIT(s,buckets); in arefSet_init()
38 AVECTOR_DONE(s,buckets); in arefSet_done()
44 AVECTOR_CLEAR(s,buckets); in arefSet_clear()
51 return (int) AVECTOR_SIZE(s,buckets); in arefSet_count()
68 void* __refset_item = (_set)->buckets[__refset_nn]; \
|
| /external/mesa3d/src/mesa/program/ |
| D | hash_table.c | 45 struct node buckets[1]; member
69 * sizeof(ht->buckets[0]))); in hash_table_ctor()
76 make_empty_list(& ht->buckets[i]); in hash_table_ctor()
101 foreach_s(node, temp, & ht->buckets[i]) { in hash_table_clear()
106 assert(is_empty_list(& ht->buckets[i])); in hash_table_clear()
118 foreach(node, & ht->buckets[bucket]) { in get_node()
149 insert_at_head(& ht->buckets[bucket], & node->link); in hash_table_insert()
160 foreach(node, & ht->buckets[bucket]) { in hash_table_replace()
174 insert_at_head(& ht->buckets[bucket], & hn->link); in hash_table_replace()
200 foreach_s(node, temp, &ht->buckets[bucket]) { in hash_table_call_foreach()
|
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| D | hash_table.c | 45 struct node buckets[1]; member
69 * sizeof(ht->buckets[0]))); in hash_table_ctor()
76 make_empty_list(& ht->buckets[i]); in hash_table_ctor()
101 foreach_s(node, temp, & ht->buckets[i]) { in hash_table_clear()
106 assert(is_empty_list(& ht->buckets[i])); in hash_table_clear()
118 foreach(node, & ht->buckets[bucket]) { in get_node()
149 insert_at_head(& ht->buckets[bucket], & node->link); in hash_table_insert()
160 foreach(node, & ht->buckets[bucket]) { in hash_table_replace()
174 insert_at_head(& ht->buckets[bucket], & hn->link); in hash_table_replace()
200 foreach_s(node, temp, &ht->buckets[bucket]) { in hash_table_call_foreach()
|
| /external/chromium_org/components/omnibox/ |
| D | omnibox_field_trial_unittest.cc | 353 ASSERT_EQ(3u, scoring_params.typed_count_buckets.buckets().size()); in TEST_F()
355 scoring_params.typed_count_buckets.buckets()[0]); in TEST_F()
357 scoring_params.typed_count_buckets.buckets()[1]); in TEST_F()
359 scoring_params.typed_count_buckets.buckets()[2]); in TEST_F()
362 ASSERT_EQ(2u, scoring_params.visited_count_buckets.buckets().size()); in TEST_F()
364 scoring_params.visited_count_buckets.buckets()[0]); in TEST_F()
366 scoring_params.visited_count_buckets.buckets()[1]); in TEST_F()
370 HUPScoringParams::ScoreBuckets buckets; in TEST_F() local
373 EXPECT_EQ(1.0, buckets.HalfLifeTimeDecay(base::TimeDelta::FromDays(7))); in TEST_F()
375 buckets.set_half_life_days(7); in TEST_F()
[all …]
|
| /external/chromium_org/tools/telemetry/telemetry/value/ |
| D | histogram_util.py | 73 buckets = collections.defaultdict(int)
78 buckets[key] += b['count']
80 buckets = [{'low': key[0], 'high': key[1], 'count': value}
81 for key, value in buckets.iteritems()]
82 buckets.sort(key = lambda h : h['low'])
85 result_histogram['buckets'] = buckets
|
| /external/chromium_org/chrome/browser/extensions/api/metrics_private/ |
| D | metrics_private_api.cc | 81 int min, int max, size_t buckets, in RecordValue() argument
87 buckets = std::min(buckets, kMaxBuckets); in RecordValue()
91 buckets = std::max(buckets, static_cast<size_t>(3)); in RecordValue()
93 if (buckets > static_cast<size_t>(max - min + 2)) in RecordValue()
94 buckets = max - min + 2; in RecordValue()
99 name, min, max, buckets, in RecordValue()
103 name, min, max, buckets, in RecordValue()
126 params->metric.buckets, params->value); in RunSync()
|
| /external/chromium_org/third_party/boringssl/src/crypto/lhash/ |
| D | lhash.c | 81 ret->buckets = OPENSSL_malloc(sizeof(LHASH_ITEM *) * ret->num_buckets); in lh_new()
82 if (ret->buckets == NULL) { in lh_new()
86 memset(ret->buckets, 0, sizeof(LHASH_ITEM *) * ret->num_buckets); in lh_new()
109 for (n = lh->buckets[i]; n != NULL; n = next) { in lh_free()
115 OPENSSL_free(lh->buckets); in lh_free()
137 ret = &lh->buckets[hash % lh->num_buckets]; in get_next_ptr_and_hash()
179 for (cur = lh->buckets[i]; cur != NULL; cur = next) { in lh_rebucket()
187 OPENSSL_free(lh->buckets); in lh_rebucket()
190 lh->buckets = new_buckets; in lh_rebucket()
291 for (cur = lh->buckets[i]; cur != NULL; cur = next) { in lh_doall_internal()
|
| /external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
| D | pb_bufmgr_slab.c | 162 struct pb_manager **buckets; member
498 return mgr->buckets[i]->create_buffer(mgr->buckets[i], size, desc); in pb_slab_range_manager_create_buffer()
527 mgr->buckets[i]->destroy(mgr->buckets[i]); in pb_slab_range_manager_destroy()
528 FREE(mgr->buckets); in pb_slab_range_manager_destroy()
567 mgr->buckets = CALLOC(mgr->numBuckets, sizeof(*mgr->buckets)); in pb_slab_range_manager_create()
568 if (!mgr->buckets) in pb_slab_range_manager_create()
573 mgr->buckets[i] = pb_slab_manager_create(provider, bufSize, slabSize, desc); in pb_slab_range_manager_create()
574 if(!mgr->buckets[i]) in pb_slab_range_manager_create()
583 if(mgr->buckets[i]) in pb_slab_range_manager_create()
584 mgr->buckets[i]->destroy(mgr->buckets[i]); in pb_slab_range_manager_create()
[all …]
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/ |
| D | pb_bufmgr_slab.c | 162 struct pb_manager **buckets; member
498 return mgr->buckets[i]->create_buffer(mgr->buckets[i], size, desc); in pb_slab_range_manager_create_buffer()
527 mgr->buckets[i]->destroy(mgr->buckets[i]); in pb_slab_range_manager_destroy()
528 FREE(mgr->buckets); in pb_slab_range_manager_destroy()
567 mgr->buckets = CALLOC(mgr->numBuckets, sizeof(*mgr->buckets)); in pb_slab_range_manager_create()
568 if (!mgr->buckets) in pb_slab_range_manager_create()
573 mgr->buckets[i] = pb_slab_manager_create(provider, bufSize, slabSize, desc); in pb_slab_range_manager_create()
574 if(!mgr->buckets[i]) in pb_slab_range_manager_create()
583 if(mgr->buckets[i]) in pb_slab_range_manager_create()
584 mgr->buckets[i]->destroy(mgr->buckets[i]); in pb_slab_range_manager_create()
[all …]
|
| /external/chromium_org/third_party/freetype/src/cache/ |
| D | ftccache.c | 101 pnode = cache->buckets + idx; in ftc_get_top_node_for_hash()
139 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
145 pnode = cache->buckets + p; in ftc_cache_resize()
163 cache->buckets[p + mask + 1] = new_list; in ftc_cache_resize()
193 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
203 pnode = cache->buckets + p; in ftc_cache_resize()
207 pold = cache->buckets + old_index; in ftc_cache_resize()
345 (void)FT_NEW_ARRAY( cache->buckets, FTC_HASH_INITIAL_SIZE * 2 ); in ftc_cache_init()
353 if ( cache && cache->buckets ) in FTC_Cache_Clear()
364 FTC_Node *pnode = cache->buckets + i, next, node = *pnode; in FTC_Cache_Clear()
[all …]
|
| /external/freetype/src/cache/ |
| D | ftccache.c | 101 pnode = cache->buckets + idx; in ftc_get_top_node_for_hash()
139 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
145 pnode = cache->buckets + p; in ftc_cache_resize()
163 cache->buckets[p + mask + 1] = new_list; in ftc_cache_resize()
193 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
203 pnode = cache->buckets + p; in ftc_cache_resize()
207 pold = cache->buckets + old_index; in ftc_cache_resize()
345 (void)FT_NEW_ARRAY( cache->buckets, FTC_HASH_INITIAL_SIZE * 2 ); in ftc_cache_init()
353 if ( cache && cache->buckets ) in FTC_Cache_Clear()
364 FTC_Node *pnode = cache->buckets + i, next, node = *pnode; in FTC_Cache_Clear()
[all …]
|
| /external/mesa3d/src/glx/ |
| D | glxhash.c | 121 __glxHashBucketPtr buckets[HASH_SIZE]; member
171 table->buckets[i] = NULL; in __glxHashCreate()
187 for (bucket = table->buckets[i]; bucket;) { in __glxHashDestroy()
210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind()
215 bucket->next = table->buckets[hash]; in HashFind()
216 table->buckets[hash] = bucket; in HashFind()
264 bucket->next = table->buckets[hash]; in __glxHashInsert()
265 table->buckets[hash] = bucket; in __glxHashInsert()
287 table->buckets[hash] = bucket->next; in __glxHashDelete()
304 table->p1 = table->buckets[table->p0]; in __glxHashNext()
[all …]
|
| /external/chromium_org/third_party/mesa/src/src/glx/ |
| D | glxhash.c | 121 __glxHashBucketPtr buckets[HASH_SIZE]; member
171 table->buckets[i] = NULL; in __glxHashCreate()
187 for (bucket = table->buckets[i]; bucket;) { in __glxHashDestroy()
210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind()
215 bucket->next = table->buckets[hash]; in HashFind()
216 table->buckets[hash] = bucket; in HashFind()
264 bucket->next = table->buckets[hash]; in __glxHashInsert()
265 table->buckets[hash] = bucket; in __glxHashInsert()
287 table->buckets[hash] = bucket->next; in __glxHashDelete()
304 table->p1 = table->buckets[table->p0]; in __glxHashNext()
[all …]
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/ |
| D | cso_hash.c | 82 struct cso_node **buckets; member
141 struct cso_node **oldBuckets = hash->buckets; in cso_data_rehash()
147 hash->buckets = MALLOC(sizeof(struct cso_node*) * hash->numBuckets); in cso_data_rehash()
149 hash->buckets[i] = e; in cso_data_rehash()
163 beforeFirstNode = &hash->buckets[h % hash->numBuckets]; in cso_data_rehash()
193 struct cso_node **bucket = hash->buckets; in cso_data_first_node()
208 node = (struct cso_node **)(&hash->data.d->buckets[akey % hash->data.d->numBuckets]); in cso_hash_find_node()
251 hash->data.d->buckets = 0; in cso_hash_create()
264 struct cso_node **bucket = (struct cso_node **)(hash->data.d->buckets); in cso_hash_delete()
274 FREE(hash->data.d->buckets); in cso_hash_delete()
[all …]
|
| /external/mesa3d/src/gallium/auxiliary/cso_cache/ |
| D | cso_hash.c | 82 struct cso_node **buckets; member
141 struct cso_node **oldBuckets = hash->buckets; in cso_data_rehash()
147 hash->buckets = MALLOC(sizeof(struct cso_node*) * hash->numBuckets); in cso_data_rehash()
149 hash->buckets[i] = e; in cso_data_rehash()
163 beforeFirstNode = &hash->buckets[h % hash->numBuckets]; in cso_data_rehash()
193 struct cso_node **bucket = hash->buckets; in cso_data_first_node()
208 node = (struct cso_node **)(&hash->data.d->buckets[akey % hash->data.d->numBuckets]); in cso_hash_find_node()
251 hash->data.d->buckets = 0; in cso_hash_create()
264 struct cso_node **bucket = (struct cso_node **)(hash->data.d->buckets); in cso_hash_delete()
274 FREE(hash->data.d->buckets); in cso_hash_delete()
[all …]
|