Searched refs:num_buckets_ (Results 1 – 2 of 2) sorted by relevance
| /art/compiler/optimizing/ |
| D | gvn.cc | 40 num_buckets_(kMinimumNumberOfBuckets), in ValueSet()
41 buckets_(allocator->AllocArray<Node*>(num_buckets_)), in ValueSet()
42 buckets_owned_(allocator, num_buckets_, false), in ValueSet()
45 DCHECK(IsPowerOfTwo(num_buckets_)); in ValueSet()
46 buckets_owned_.SetInitialBits(num_buckets_); in ValueSet()
53 num_buckets_(to_copy.IdealBucketCount()), in ValueSet()
54 buckets_(allocator->AllocArray<Node*>(num_buckets_)), in ValueSet()
55 buckets_owned_(allocator, num_buckets_, false), in ValueSet()
59 DCHECK(IsPowerOfTwo(num_buckets_)); in ValueSet()
60 if (num_buckets_ == to_copy.num_buckets_) { in ValueSet()
[all …]
|
| /art/runtime/base/ |
| D | hash_set.h | 133 HashSet() : num_elements_(0), num_buckets_(0), owns_data_(false), data_(nullptr), in HashSet()
138 HashSet(const HashSet& other) : num_elements_(0), num_buckets_(0), owns_data_(false), in HashSet()
143 HashSet(HashSet&& other) : num_elements_(0), num_buckets_(0), owns_data_(false), in HashSet()
157 num_buckets_ = static_cast<uint64_t>(temp); in HashSet()
158 CHECK_LE(num_elements_, num_buckets_); in HashSet()
166 offset += sizeof(*data_) * num_buckets_; in HashSet()
168 AllocateStorage(num_buckets_); in HashSet()
171 for (size_t i = 0; i < num_buckets_; ++i) { in HashSet()
184 offset = WriteToBytes(ptr, offset, static_cast<uint64_t>(num_buckets_)); in WriteToMemory()
190 for (size_t i = 0; i < num_buckets_; ++i) { in WriteToMemory()
[all …]
|