| /art/compiler/optimizing/ |
| gvn.cc | 40 num_buckets_(kMinimumNumberOfBuckets),
41 buckets_(allocator->AllocArray<Node*>(num_buckets_)),
42 buckets_owned_(allocator, num_buckets_, false),
45 DCHECK(IsPowerOfTwo(num_buckets_));
46 buckets_owned_.SetInitialBits(num_buckets_);
53 num_buckets_(to_copy.IdealBucketCount()),
54 buckets_(allocator->AllocArray<Node*>(num_buckets_)),
55 buckets_owned_(allocator, num_buckets_, false),
59 DCHECK(IsPowerOfTwo(num_buckets_));
60 if (num_buckets_ == to_copy.num_buckets_)
282 size_t const num_buckets_; member in class:art::ValueSet
[all...] |
| /external/v8/src/ |
| counters.h | 180 num_buckets_(num_buckets),
217 int num_buckets_; member in class:v8::internal::Histogram
|
| /art/runtime/base/ |
| hash_set.h | 133 HashSet() : num_elements_(0), num_buckets_(0), owns_data_(false), data_(nullptr),
138 HashSet(const HashSet& other) : num_elements_(0), num_buckets_(0), owns_data_(false),
143 HashSet(HashSet&& other) : num_elements_(0), num_buckets_(0), owns_data_(false),
157 num_buckets_ = static_cast<uint64_t>(temp);
158 CHECK_LE(num_elements_, num_buckets_);
166 offset += sizeof(*data_) * num_buckets_;
168 AllocateStorage(num_buckets_);
171 for (size_t i = 0; i < num_buckets_; ++i) {
184 offset = WriteToBytes(ptr, offset, static_cast<uint64_t>(num_buckets_));
190 for (size_t i = 0; i < num_buckets_; ++i)
528 size_t num_buckets_; \/\/ Number of hash table buckets. member in class:art::HashSet
[all...] |
