Searched defs:buckets (Results 1 - 25 of 52) sorted by relevance

123

/external/chromium/chrome/browser/extensions/
H A Dextension_metrics_module.cc75 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 Dextensions_quota_service.cc95 BucketList buckets; local
96 bucket_mapper_->GetBucketsForArgs(args, &buckets);
97 for (BucketList::iterator i = buckets.begin(); i != buckets.end(); ++i) {
H A Dextension_metrics_apitest.cc35 size_t buckets; member in struct:__anon2144::RecordedHistogram
132 EXPECT_EQ(r.buckets, histogram->bucket_count());
H A Dextensions_quota_service_unittest.cc32 virtual void GetBucketsForArgs(const ListValue* args, BucketList* buckets) { argument
38 buckets->push_back(buckets_[id]);
49 virtual void GetBucketsForArgs(const ListValue* args, BucketList* buckets) {} argument
130 // These are OK because we haven't exhausted all buckets.
/external/chromium_org/chrome/browser/extensions/api/metrics_private/
H A Dmetrics_private_api.cc42 // 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
113 RecordValue( const std::string& name, base::HistogramType type, int min, int max, size_t buckets, int sample) argument
[all...]
H A Dmetrics_apitest.cc35 size_t buckets; member in struct:__anon5067::RecordedHistogram
118 histogram->HasConstructionArguments(r.min, r.max, r.buckets));
/external/chromium/net/base/
H A Dssl_false_start_blacklist_process.cc202 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/chromium_org/extensions/browser/
H A Dquota_service.cc112 BucketList* buckets) {
113 buckets->push_back(&bucket_);
125 BucketList buckets; local
126 bucket_mapper_->GetBucketsForArgs(args, &buckets);
127 for (BucketList::iterator i = buckets.begin(); i != buckets.end(); ++i) {
110 GetBucketsForArgs( const base::ListValue* args, BucketList* buckets) argument
/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dhash_table.c45 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[bucke
[all...]
/external/chromium_org/third_party/npapi/npspy/extern/nspr/
H A Dplhash.h85 PLHashEntry **buckets; /* vector of hash buckets */ member in struct:PLHashTable
/external/guava/guava/src/com/google/common/hash/
H A DHashing.java159 * 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/mesa3d/src/mesa/program/
H A Dhash_table.c45 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[bucke
[all...]
/external/bsdiff/
H A Dbsdiff.c106 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/chromium_org/net/dns/
H A Ddns_session.cc30 // Number of buckets in the histogram of observed RTTs.
38 ServerStats(base::TimeDelta rtt_estimate_param, RttBuckets* buckets) argument
40 rtt_histogram.reset(new base::SampleVector(buckets));
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DPartitionAlloc.h230 ALWAYS_INLINE PartitionBucket* buckets() { return reinterpret_cast<PartitionBucket*>(this + 1); } function in struct:WTF::PartitionRoot
231 ALWAYS_INLINE const PartitionBucket* buckets() const { return reinterpret_cast<const PartitionBucket*>(this + 1); } function in struct:WTF::PartitionRoot
336 size_t index = bucket - &root->buckets()[0];
473 PartitionBucket* bucket = &root->buckets()[index];
/external/chromium_org/third_party/freetype/src/cache/
H A Dftccache.h77 ( ( cache )->buckets + \
148 FTC_Node* buckets; member in struct:FTC_CacheRec_
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/
H A Dpb_bufmgr_slab.c162 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[
[all...]
/external/chromium_org/third_party/mesa/src/src/glx/
H A Dglxhash.c121 __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[tabl
[all...]
/external/chromium_org/v8/src/
H A Dcounters.h79 // 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/elfutils/libdwfl/
H A Ddwfl_module_getdwarf.c426 const Elf32_Word *const buckets = data->d_buf; local
429 if (buckets[bucket] > maxndx)
430 maxndx = buckets[bucket];
/external/freetype/src/cache/
H A Dftccache.h77 ( ( cache )->buckets + \
148 FTC_Node* buckets; member in struct:FTC_CacheRec_
/external/mesa3d/src/gallium/auxiliary/pipebuffer/
H A Dpb_bufmgr_slab.c162 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[
[all...]
/external/mesa3d/src/glx/
H A Dglxhash.c121 __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[tabl
[all...]
/external/stressapptest/src/
H A Dfinelock_queue.cc163 uint64 buckets[32]; local
172 buckets[b] = 0;
184 buckets[b]++;
189 if (buckets[b])
191 ((1 << b) >> 1), 1 << b, buckets[b]);
/external/v8/src/
H A Dcounters.h79 // 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

Completed in 794 milliseconds

123