| /third_party/grpc/tools/run_tests/performance/ |
| D | massage_qps_stats.py | 323 "%f" % x for x in h.buckets)
328 h.buckets, 50, h.boundaries)
331 h.buckets, 95, h.boundaries)
334 h.buckets, 99, h.boundaries)
338 "%f" % x for x in h.buckets)
343 h.buckets, 50, h.boundaries)
346 h.buckets, 95, h.boundaries)
349 h.buckets, 99, h.boundaries)
352 stats["core_tcp_write_size"] = ",".join("%f" % x for x in h.buckets)
357 h.buckets, 50, h.boundaries)
[all …]
|
| D | massage_qps_stats_helpers.py | 18 def _threshold_for_count_below(buckets, boundaries, count_below): argument
20 for lower_idx in range(0, len(buckets)):
21 count_so_far += buckets[lower_idx]
27 for upper_idx in range(lower_idx + 1, len(buckets)):
28 if buckets[upper_idx] != 0:
37 (count_so_far - count_below) / float(buckets[lower_idx]))
40 def percentile(buckets, pctl, boundaries): argument
41 return _threshold_for_count_below(buckets, boundaries,
42 sum(buckets) * pctl / 100.0)
57 buckets = []
[all …]
|
| /third_party/iowow/src/utils/ |
| D | iwhmap.c | 28 bucket_t *buckets; member
127 hm->buckets = calloc(MIN_BUCKETS, sizeof(hm->buckets[0])); in iwhmap_create()
128 if (!hm->buckets) { in iwhmap_create()
164 bucket_t *bucket = hm->buckets + (hash & hm->buckets_mask); in _entry_find()
176 bucket_t *bucket = hm->buckets + (hash & hm->buckets_mask); in _entry_add()
209 bucket_t *buckets = calloc(num_buckets, sizeof(*buckets)); in _rehash() local
210 if (!buckets) { in _rehash()
217 *bucket_end = hm->buckets + _n_buckets(hm); in _rehash()
222 hm_copy.buckets = buckets; in _rehash()
224 for (bucket = hm->buckets; bucket < bucket_end; ++bucket) { in _rehash()
[all …]
|
| /third_party/grpc/src/csharp/Grpc.IntegrationTesting/ |
| D | Histogram.cs | 44 readonly uint[] buckets; field in Grpc.IntegrationTesting.Histogram
59 this.buckets = new uint[FindBucket(maxPossible) + 1]; in Histogram()
114 this.buckets[FindBucket(value)]++; in AddObservationUnsafe()
119 …pcPreconditions.CheckArgument(mergeTo.Bucket.Count == 0 || mergeTo.Bucket.Count == buckets.Length); in GetSnapshotUnsafe()
136 mergeTo.Bucket.AddRange(buckets); in GetSnapshotUnsafe()
140 for (int i = 0; i < buckets.Length; i++) in GetSnapshotUnsafe()
142 mergeTo.Bucket[i] += buckets[i]; in GetSnapshotUnsafe()
159 for (int i = 0; i < this.buckets.Length; i++) in ResetUnsafe()
161 this.buckets[i] = 0; in ResetUnsafe()
|
| /third_party/glib/glib/tests/ |
| D | gpoll.c | 174 gint buckets[], in bucketize() argument
182 buckets[count - 1] += 1; in bucketize()
189 buckets[i] += 1; in bucketize()
193 buckets[0] += 1; in bucketize()
197 print_buckets (gint buckets[], in print_buckets() argument
216 if (buckets[i] < 10) in print_buckets()
218 else if (buckets[i] < 100) in print_buckets()
220 else if (buckets[i] < 1000) in print_buckets()
227 if (buckets[i] != 0) in print_buckets()
228 g_print ("%*d", len, buckets[i]); in print_buckets()
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | delta_stepping_shortest_paths.hpp | 150 std::vector<Bucket*> buckets; member in boost::graph::distributed::delta_stepping_impl
259 while (current_bucket < buckets.size() in run()
260 && (!buckets[current_bucket] || buckets[current_bucket]->empty())) in run()
262 if (current_bucket >= buckets.size()) in run()
295 if (current_bucket < buckets.size() && buckets[current_bucket]) { in run()
296 Bucket& bucket = *buckets[current_bucket]; in run()
330 nonempty_bucket = (current_bucket < buckets.size() in run()
331 && buckets[current_bucket] in run()
332 && !buckets[current_bucket]->empty()); in run()
352 for (typename std::vector<Bucket*>::iterator iter = buckets.begin(); in run()
[all …]
|
| /third_party/libdrm/ |
| D | xf86drmHash.c | 126 for (bucket = table->buckets[i]; bucket;) { in drmHashDestroy()
148 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind()
153 bucket->next = table->buckets[hash]; in HashFind()
154 table->buckets[hash] = bucket; in HashFind()
194 bucket->next = table->buckets[hash]; in drmHashInsert()
195 table->buckets[hash] = bucket; in drmHashInsert()
211 table->buckets[hash] = bucket->next; in drmHashDelete()
227 table->p1 = table->buckets[table->p0]; in drmHashNext()
240 table->p1 = table->buckets[0]; in drmHashFirst()
|
| /third_party/boringssl/src/crypto/lhash/ |
| D | lhash.c | 82 LHASH_ITEM **buckets; member
103 ret->buckets = OPENSSL_malloc(sizeof(LHASH_ITEM *) * ret->num_buckets); in lh_new()
104 if (ret->buckets == NULL) { in lh_new()
108 OPENSSL_memset(ret->buckets, 0, sizeof(LHASH_ITEM *) * ret->num_buckets); in lh_new()
122 for (LHASH_ITEM *n = lh->buckets[i]; n != NULL; n = next) { in lh_free()
128 OPENSSL_free(lh->buckets); in lh_free()
150 LHASH_ITEM **ret = &lh->buckets[hash % lh->num_buckets]; in get_next_ptr_and_hash()
167 LHASH_ITEM **ret = &lh->buckets[key_hash % lh->num_buckets]; in get_next_ptr_by_key()
211 for (cur = lh->buckets[i]; cur != NULL; cur = next) { in lh_rebucket()
219 OPENSSL_free(lh->buckets); in lh_rebucket()
[all …]
|
| /third_party/grpc/test/core/util/ |
| D | histogram.cc | 55 uint32_t* buckets; member
92 h->buckets = in grpc_histogram_create()
98 gpr_free(h->buckets); in grpc_histogram_destroy()
112 h->buckets[bucket_for(h, x)]++; in grpc_histogram_add()
121 grpc_histogram_merge_contents(dst, src->buckets, src->num_buckets, in grpc_histogram_merge()
143 dst->buckets[i] += data[i]; in grpc_histogram_merge_contents()
168 count_so_far += h->buckets[lower_idx]; in threshold_for_count_below()
177 if (h->buckets[upper_idx]) { in threshold_for_count_below()
191 h->buckets[lower_idx], in threshold_for_count_below()
229 return h->buckets; in grpc_histogram_get_contents()
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
| D | AlphabeticIndex.java | 156 private BucketList<V> buckets; field in AlphabeticIndex
172 private final BucketList<V> buckets; field in AlphabeticIndex.ImmutableIndex
176 this.buckets = bucketList; in ImmutableIndex()
186 return buckets.getBucketCount(); in getBucketCount()
197 return buckets.getBucketIndex(name, collatorPrimaryOnly); in getBucketIndex()
207 if (0 <= index && index < buckets.getBucketCount()) { in getBucket()
208 return buckets.immutableVisibleList.get(index); in getBucket()
219 return buckets.iterator(); in iterator()
303 buckets = null; in addLabels()
316 buckets = null; in addLabels()
[all …]
|
| /third_party/boost/boost/interprocess/indexes/ |
| D | iunordered_set_index.hpp | 175 bucket_ptr buckets = alloc.allocate(num); in create_buckets() local
176 bucket_ptr buckets_init = buckets; in create_buckets()
180 return buckets; in create_buckets()
184 ( bucket_ptr buckets, size_type old_size in shrink_buckets() argument
191 …:try_shrink_in_place | boost::interprocess::nothrow_allocation, old_size, received_size, buckets)){ in shrink_buckets()
195 for( bucket_type *p = ipcdetail::to_raw_pointer(buckets) + received_size in shrink_buckets()
196 , *pend = ipcdetail::to_raw_pointer(buckets) + old_size in shrink_buckets()
203 …:shrink_in_place | boost::interprocess::nothrow_allocation, received_size, received_size, buckets); in shrink_buckets()
204 BOOST_ASSERT(buckets == shunk_p); (void)shunk_p; in shrink_buckets()
206 bucket_ptr buckets_init = buckets + received_size; in shrink_buckets()
[all …]
|
| /third_party/boost/libs/lockfree/test/ |
| D | test_helpers.hpp | 24 template <typename int_type, size_t buckets>
32 size_t factor = size_t((float)buckets * 1.616f); in calc_index()
34 return ((size_t)id * factor) % buckets; in calc_index()
76 for (int i = 0; i != buckets; ++i) { in count_nodes()
84 boost::array<std::set<int_type>, buckets> data;
85 mutable boost::array<boost::mutex, buckets> ref_mutex;
|
| /third_party/python/Python/ |
| D | hashtable.c | 58 ((_Py_hashtable_entry_t *)_Py_SLIST_HEAD(&(HT)->buckets[BUCKET]))
193 _Py_slist_remove(&ht->buckets[index], (_Py_slist_item_t *)previous, in _Py_hashtable_steal()
242 _Py_slist_prepend(&ht->buckets[index], (_Py_slist_item_t*)entry); in _Py_hashtable_set()
287 size_t buckets_size = new_size * sizeof(ht->buckets[0]); in hashtable_rehash()
296 _Py_hashtable_entry_t *entry = BUCKETS_HEAD(ht->buckets[bucket]); in hashtable_rehash()
308 ht->alloc.free(ht->buckets); in hashtable_rehash()
310 ht->buckets = new_buckets; in hashtable_rehash()
339 size_t buckets_size = ht->nbuckets * sizeof(ht->buckets[0]); in _Py_hashtable_new_full()
340 ht->buckets = alloc.malloc(buckets_size); in _Py_hashtable_new_full()
341 if (ht->buckets == NULL) { in _Py_hashtable_new_full()
[all …]
|
| /third_party/boost/libs/unordered/doc/ |
| D | buckets.qbk | 5 [section:buckets The Data Structure]
7 The containers are made up of a number of 'buckets', each of which can contain
9 boost::unordered_set unordered_set] with 7 buckets containing 5 elements, `A`,
11 have more buckets).
13 [diagram buckets]
20 then the number of buckets, so the container applies another transformation to
27 evenly distributed amongst the buckets so only a small number of elements will
48 <entry>'''The number of buckets.'''</entry>
52 <entry>'''An upper bound on the number of buckets.'''</entry>
86 [h2 Controlling the number of buckets]
[all …]
|
| /third_party/grpc/src/php/tests/qps/ |
| D | histogram.php | 30 private $buckets; variable in Histogram
45 $this->buckets = array_fill(0, $this->bucket_for($max_possible)+1, 0);
58 $this->buckets[$this->bucket_for($value)] += 1;
82 return $this->buckets;
91 $this->buckets = array_fill(0, $this->bucket_for($this->max_possible)+1, 0);
|
| /third_party/node/deps/npm/node_modules/cacache/lib/ |
| D | verify.js | 162 const buckets = {}
169 if (buckets[hashed] && !excluded) {
170 buckets[hashed].push(entry)
171 } else if (buckets[hashed] && excluded) {
174 buckets[hashed] = []
175 buckets[hashed]._path = index._bucketPath(cache, k)
177 buckets[hashed] = [entry]
178 buckets[hashed]._path = index._bucketPath(cache, k)
182 return BB.map(Object.keys(buckets), key => {
183 return rebuildBucket(cache, buckets[key], stats, opts)
|
| /third_party/flutter/skia/infra/project-config/ |
| D | cr-buildbucket.cfg | 1 # Defines buckets on cr-buildbucket.appspot.com, used to schedule builds
2 # on buildbot. In particular, CQ uses some of these buckets to schedule tryjobs.
9 buckets {
29 buckets {
49 buckets {
69 buckets {
|
| /third_party/skia/infra/project-config/ |
| D | cr-buildbucket.cfg | 1 # Defines buckets on cr-buildbucket.appspot.com, used to schedule builds
2 # on buildbot. In particular, CQ uses some of these buckets to schedule tryjobs.
9 buckets {
29 buckets {
49 buckets {
69 buckets {
|
| /third_party/skia/third_party/externals/freetype/src/cache/ |
| D | ftccache.c | 100 return cache->buckets + idx; in ftc_get_top_node_for_hash()
137 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
143 pnode = cache->buckets + p; in ftc_cache_resize()
161 cache->buckets[p + mask + 1] = new_list; in ftc_cache_resize()
191 if ( FT_QRENEW_ARRAY( cache->buckets, in ftc_cache_resize()
201 pnode = cache->buckets + p; in ftc_cache_resize()
205 pold = cache->buckets + old_index; in ftc_cache_resize()
343 FT_MEM_NEW_ARRAY( cache->buckets, FTC_HASH_INITIAL_SIZE * 2 ); in ftc_cache_init()
351 if ( cache && cache->buckets ) in FTC_Cache_Clear()
362 FTC_Node node = cache->buckets[i], next; in FTC_Cache_Clear()
[all …]
|
| /third_party/freetype/src/cache/ |
| D | ftccache.c | 100 pnode = cache->buckets + idx; in ftc_get_top_node_for_hash()
138 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
144 pnode = cache->buckets + p; in ftc_cache_resize()
162 cache->buckets[p + mask + 1] = new_list; in ftc_cache_resize()
192 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
202 pnode = cache->buckets + p; in ftc_cache_resize()
206 pold = cache->buckets + old_index; in ftc_cache_resize()
344 (void)FT_NEW_ARRAY( cache->buckets, FTC_HASH_INITIAL_SIZE * 2 ); in ftc_cache_init()
352 if ( cache && cache->buckets ) in FTC_Cache_Clear()
363 FTC_Node *pnode = cache->buckets + i, next, node = *pnode; in FTC_Cache_Clear()
[all …]
|
| /third_party/flutter/skia/third_party/externals/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 …]
|
| /third_party/boost/boost/intrusive/detail/ |
| D | hashtable_node.hpp | 78 BOOST_INTRUSIVE_FORCEINLINE bucket_traits_impl(bucket_ptr buckets, size_type len) in bucket_traits_impl()
79 : buckets_(buckets), buckets_len_(len) in bucket_traits_impl()
258 bucket_type* const buckets = boost::movelib::to_raw_pointer(rbuck_traits.bucket_begin()); in increment() local
263 const siterator first_bucket_bbegin = buckets->end(); in increment()
264 … if(first_bucket_bbegin.pointed_node() <= n && n <= buckets[buckets_len-1].cend().pointed_node()){ in increment()
271 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment()
276 slist_it_ = buckets->before_begin(); in increment()
280 while (buckets[n_bucket].empty()); in increment()
281 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /third_party/ltp/lib/ |
| D | tst_timer_test.c | 82 unsigned int i, buckets[rows]; in frequency_plot() local
89 memset(buckets, 0, sizeof(buckets)); in frequency_plot()
101 buckets[bucket]++; in frequency_plot()
104 unsigned int max_bucket = buckets[0]; in frequency_plot()
106 max_bucket = MAX(max_bucket, buckets[i]); in frequency_plot()
116 if (buckets[l]) in frequency_plot()
121 if (buckets[r]) in frequency_plot()
126 float len = bucket_len(buckets[i], max_bucket, plot_line_len); in frequency_plot()
136 else if (len < 0.25 && buckets[i]) in frequency_plot()
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| D | hash_longest_match_quickly_inc.h | 58 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN() local
66 buckets[key] = 0; in FN()
70 buckets[(key + (j << 3)) & BUCKET_MASK] = 0; in FN()
79 memset(buckets, 0, sizeof(uint32_t) * BUCKET_SIZE); in FN()
155 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN() local
179 buckets[key] = (uint32_t)cur_ix; in FN()
194 prev_ix = buckets[key]; in FN()
195 buckets[key] = (uint32_t)cur_ix; in FN()
226 prev_ix = buckets[keys[i]]; in FN()
257 buckets[key_out] = (uint32_t)cur_ix; in FN()
|
| /third_party/node/deps/brotli/c/enc/ |
| D | hash_longest_match_quickly_inc.h | 58 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN() local
66 buckets[key] = 0; in FN()
70 buckets[(key + (j << 3)) & BUCKET_MASK] = 0; in FN()
79 memset(buckets, 0, sizeof(uint32_t) * BUCKET_SIZE); in FN()
155 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN() local
179 buckets[key] = (uint32_t)cur_ix; in FN()
194 prev_ix = buckets[key]; in FN()
195 buckets[key] = (uint32_t)cur_ix; in FN()
226 prev_ix = buckets[keys[i]]; in FN()
257 buckets[key_out] = (uint32_t)cur_ix; in FN()
|