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()
77       return other.IdealBucketCount() == num_buckets_;  in CanHoldCopyOf()
79       return other.IdealBucketCount() <= num_buckets_;  in CanHoldCopyOf()
135     for (size_t i = 0; i < num_buckets_; ++i) {  in Clear()
138     buckets_owned_.SetInitialBits(num_buckets_);  in Clear()
163     DCHECK_GE(num_buckets_, other.IdealBucketCount());  in PopulateFromInternal()
165     if (num_buckets_ == other.num_buckets_) {  in PopulateFromInternal()
169       memcpy(buckets_, other.buckets_, num_buckets_ * sizeof(Node*));  in PopulateFromInternal()
173       std::fill_n(buckets_, num_buckets_, nullptr);  in PopulateFromInternal()
174       for (size_t i = 0; i < other.num_buckets_; ++i) {  in PopulateFromInternal()
180       buckets_owned_.SetInitialBits(num_buckets_);  in PopulateFromInternal()
237     for (size_t i = 0; i < num_buckets_; i += 2) {  in DeleteAllImpureWhich()
314     return hash_code & (num_buckets_ - 1);  in BucketIndex()
320   size_t const num_buckets_;  member in art::ValueSet