Searched refs:num_buckets_ (Results 1 – 3 of 3) sorted by relevance
| /art/compiler/optimizing/ |
| D | gvn.cc | 42 num_buckets_(kMinimumNumberOfBuckets), in ValueSet()
43 buckets_(allocator->AllocArray<Node*>(num_buckets_, kArenaAllocGvn)), in ValueSet()
44 buckets_owned_(allocator, num_buckets_, false, kArenaAllocGvn), in ValueSet()
46 DCHECK(IsPowerOfTwo(num_buckets_)); in ValueSet()
47 std::fill_n(buckets_, num_buckets_, nullptr); in ValueSet()
48 buckets_owned_.SetInitialBits(num_buckets_); in ValueSet()
55 num_buckets_(other.IdealBucketCount()), in ValueSet()
56 buckets_(allocator->AllocArray<Node*>(num_buckets_, kArenaAllocGvn)), in ValueSet()
57 buckets_owned_(allocator, num_buckets_, false, kArenaAllocGvn), in ValueSet()
59 DCHECK(IsPowerOfTwo(num_buckets_)); in ValueSet()
[all …]
|
| /art/libartbase/base/ |
| D | hash_set.h | 235 num_buckets_(0u), in HashSet()
251 num_buckets_(0), in HashSet()
258 for (size_t i = 0; i < num_buckets_; ++i) { in HashSet()
271 num_buckets_(other.num_buckets_), in HashSet()
278 other.num_buckets_ = 0u; in HashSet()
309 num_buckets_(buffer_size), in HashSet()
331 num_buckets_ = static_cast<uint64_t>(temp); in HashSet()
332 CHECK_LE(num_elements_, num_buckets_); in HashSet()
340 offset += sizeof(*data_) * num_buckets_; in HashSet()
342 AllocateStorage(num_buckets_); in HashSet()
[all …]
|
| /art/libartbase/base/metrics/ |
| D | metrics.h | 438 size_t num_buckets_,
442 static_assert(num_buckets_ >= 1);
453 == RoundUp(sizeof(intptr_t) + sizeof(value_t) * num_buckets_, sizeof(uint64_t)));
482 return num_buckets_ - 1; in FindBucketId()
486 return static_cast<size_t>(value - minimum_value_) * num_buckets_ / bucket_width; in FindBucketId()
501 std::array<std::atomic<value_t>, num_buckets_> buckets_;
|