Searched refs:num_buckets_ (Results 1 – 2 of 2) 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 | 199 num_buckets_(0u), in HashSet()
215 num_buckets_(0u), in HashSet()
229 num_buckets_(0), in HashSet()
236 for (size_t i = 0; i < num_buckets_; ++i) { in HashSet()
249 num_buckets_(other.num_buckets_), in HashSet()
256 other.num_buckets_ = 0u; in HashSet()
271 num_buckets_ = static_cast<uint64_t>(temp); in HashSet()
272 CHECK_LE(num_elements_, num_buckets_); in HashSet()
280 offset += sizeof(*data_) * num_buckets_; in HashSet()
282 AllocateStorage(num_buckets_); in HashSet()
[all …]
|