Searched refs:bucket (Results 1 – 5 of 5) sorted by relevance
115 static inline size_t bucket_to_size(unsigned int bucket) { in bucket_to_size() argument116 return kMinBucketAllocationSize << bucket; in bucket_to_size()168 Chunk(HeapImpl* heap, int bucket);230 Chunk::Chunk(HeapImpl* heap, int bucket) in Chunk() argument233 bucket_(bucket), in Chunk()234 allocation_size_(bucket_to_size(bucket)), in Chunk()364 int bucket = size_to_bucket(size); in AllocLocked() local365 if (free_chunks_[bucket].empty()) { in AllocLocked()366 Chunk* chunk = new Chunk(this, bucket); in AllocLocked()367 free_chunks_[bucket].insert(chunk->node_); in AllocLocked()[all …]
82 vector<UniqueBlock>* bucket = nullptr; in AddBlock() local86 bucket = &mapping_[h]; in AddBlock()95 bucket = &mapping_it->second; in AddBlock()100 bucket->emplace_back(); in AddBlock()101 UniqueBlock* new_ublock = &bucket->back(); in AddBlock()
35 uint32_t bucket; member73 uint16_t bucket; member
103 time_key_t key = {.uid = uid, .bucket = freq_idx / FREQS_PER_ENTRY};148 .bucket = freq_idx / FREQS_PER_ENTRY};157 key.bucket = nactive / CPUS_PER_ENTRY;166 if (policy_nactive / CPUS_PER_ENTRY != key.bucket) {167 key.bucket = policy_nactive / CPUS_PER_ENTRY;
104 std::atomic<bucket_t>& bucket = loaded_blocks_[i]; in Verify() local105 if (LIKELY(bucket.load(std::memory_order_relaxed) & present_bit)) { in Verify()117 bucket.fetch_or(present_bit, std::memory_order_relaxed); in Verify()