Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2016 the V8 project authors. All rights reserved. | 1 // Copyright 2016 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "src/zone/accounting-allocator.h" | 5 #include "src/zone/accounting-allocator.h" |
| 6 | 6 |
| 7 #include <cstdlib> | 7 #include <cstdlib> |
| 8 | 8 |
| 9 #if V8_LIBC_BIONIC | 9 #if V8_LIBC_BIONIC |
| 10 #include <malloc.h> // NOLINT | 10 #include <malloc.h> // NOLINT |
| 11 #endif | 11 #endif |
| 12 | 12 |
| 13 namespace v8 { | 13 namespace v8 { |
| 14 namespace internal { | 14 namespace internal { |
| 15 | 15 |
| 16 AccountingAllocator::AccountingAllocator() : unused_segments_mutex_() { | 16 AccountingAllocator::AccountingAllocator() : unused_segments_mutex_() { |
| 17 static const uint8_t kDefaultBucketMaxSize = 5; | |
|
jochen (gone - plz use gerrit)
2016/10/19 14:18:31
also in this file, please don't unnecessarily cons
| |
| 18 | |
| 17 memory_pressure_level_.SetValue(MemoryPressureLevel::kNone); | 19 memory_pressure_level_.SetValue(MemoryPressureLevel::kNone); |
| 18 std::fill(unused_segments_heads_, | 20 std::fill(unused_segments_heads_, unused_segments_heads_ + kNumberBuckets, |
| 19 unused_segments_heads_ + | |
| 20 (1 + kMaxSegmentSizePower - kMinSegmentSizePower), | |
| 21 nullptr); | 21 nullptr); |
| 22 std::fill( | 22 std::fill(unused_segments_sizes, unused_segments_sizes + kNumberBuckets, 0); |
| 23 unused_segments_sizes, | 23 std::fill(unused_segments_max_sizes, |
| 24 unused_segments_sizes + (1 + kMaxSegmentSizePower - kMinSegmentSizePower), | 24 unused_segments_max_sizes + kNumberBuckets, kDefaultBucketMaxSize); |
| 25 0); | |
| 26 } | 25 } |
| 27 | 26 |
| 28 AccountingAllocator::~AccountingAllocator() { ClearPool(); } | 27 AccountingAllocator::~AccountingAllocator() { ClearPool(); } |
| 29 | 28 |
| 30 void AccountingAllocator::MemoryPressureNotification( | 29 void AccountingAllocator::MemoryPressureNotification( |
| 31 MemoryPressureLevel level) { | 30 MemoryPressureLevel level) { |
| 32 memory_pressure_level_.SetValue(level); | 31 memory_pressure_level_.SetValue(level); |
| 33 | 32 |
| 34 if (level != MemoryPressureLevel::kNone) { | 33 if (level != MemoryPressureLevel::kNone) { |
| 35 ClearPool(); | 34 ClearPool(); |
| 36 } | 35 } |
| 37 } | 36 } |
| 38 | 37 |
| 38 void AccountingAllocator::ConfigureSegmentPool(const size_t max_pool_size) { | |
| 39 // The sum of the bytes of one segment of each size. | |
| 40 static const size_t full_size = (size_t(1) << (kMaxSegmentSizePower + 1)) - | |
| 41 (size_t(1) << kMinSegmentSizePower); | |
| 42 uint8_t fits_fully = max_pool_size / full_size; | |
| 43 | |
| 44 base::LockGuard<base::Mutex> lock_guard(&unused_segments_mutex_); | |
| 45 | |
| 46 size_t total_size = fits_fully * full_size; | |
| 47 | |
| 48 for (uint8_t power = 0; power < kNumberBuckets; power++) { | |
|
jochen (gone - plz use gerrit)
2016/10/19 14:18:31
++power (same below)
| |
| 49 if (total_size + (size_t(1) << power) <= max_pool_size) { | |
| 50 unused_segments_max_sizes[power] = fits_fully + 1; | |
| 51 total_size += size_t(1) << power; | |
| 52 } else { | |
| 53 unused_segments_max_sizes[power] = fits_fully; | |
| 54 } | |
| 55 } | |
| 56 | |
| 57 #if DEBUG | |
| 58 total_size = 0; | |
| 59 for (uint8_t power = 0; power < kNumberBuckets; power++) { | |
| 60 total_size += unused_segments_max_sizes[power] * (size_t(1) << power); | |
| 61 } | |
| 62 CHECK_LE(total_size, max_pool_size); | |
|
jochen (gone - plz use gerrit)
2016/10/19 14:18:31
this really should be a unit test
| |
| 63 #endif | |
| 64 } | |
| 65 | |
| 39 Segment* AccountingAllocator::GetSegment(size_t bytes) { | 66 Segment* AccountingAllocator::GetSegment(size_t bytes) { |
| 40 Segment* result = GetSegmentFromPool(bytes); | 67 Segment* result = GetSegmentFromPool(bytes); |
| 41 if (result == nullptr) { | 68 if (result == nullptr) { |
| 42 result = AllocateSegment(bytes); | 69 result = AllocateSegment(bytes); |
| 43 result->Initialize(bytes); | 70 result->Initialize(bytes); |
| 44 } | 71 } |
| 45 | 72 |
| 46 return result; | 73 return result; |
| 47 } | 74 } |
| 48 | 75 |
| (...skipping 82 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 131 uint8_t power = kMaxSegmentSizePower; | 158 uint8_t power = kMaxSegmentSizePower; |
| 132 | 159 |
| 133 while (size < (static_cast<size_t>(1) << power)) power--; | 160 while (size < (static_cast<size_t>(1) << power)) power--; |
| 134 | 161 |
| 135 DCHECK_GE(power, kMinSegmentSizePower + 0); | 162 DCHECK_GE(power, kMinSegmentSizePower + 0); |
| 136 power -= kMinSegmentSizePower; | 163 power -= kMinSegmentSizePower; |
| 137 | 164 |
| 138 { | 165 { |
| 139 base::LockGuard<base::Mutex> lock_guard(&unused_segments_mutex_); | 166 base::LockGuard<base::Mutex> lock_guard(&unused_segments_mutex_); |
| 140 | 167 |
| 141 if (unused_segments_sizes[power] >= kMaxSegmentsPerBucket) { | 168 if (unused_segments_sizes[power] >= unused_segments_max_sizes[power]) { |
| 142 return false; | 169 return false; |
| 143 } | 170 } |
| 144 | 171 |
| 145 segment->set_next(unused_segments_heads_[power]); | 172 segment->set_next(unused_segments_heads_[power]); |
| 146 unused_segments_heads_[power] = segment; | 173 unused_segments_heads_[power] = segment; |
| 147 base::NoBarrier_AtomicIncrement(¤t_pool_size_, size); | 174 base::NoBarrier_AtomicIncrement(¤t_pool_size_, size); |
| 148 unused_segments_sizes[power]++; | 175 unused_segments_sizes[power]++; |
| 149 } | 176 } |
| 150 | 177 |
| 151 return true; | 178 return true; |
| 152 } | 179 } |
| 153 | 180 |
| 154 void AccountingAllocator::ClearPool() { | 181 void AccountingAllocator::ClearPool() { |
| 155 base::LockGuard<base::Mutex> lock_guard(&unused_segments_mutex_); | 182 base::LockGuard<base::Mutex> lock_guard(&unused_segments_mutex_); |
| 156 | 183 |
| 157 for (uint8_t power = 0; power <= kMaxSegmentSizePower - kMinSegmentSizePower; | 184 for (uint8_t power = 0; power <= kMaxSegmentSizePower - kMinSegmentSizePower; |
| 158 power++) { | 185 power++) { |
| 159 Segment* current = unused_segments_heads_[power]; | 186 Segment* current = unused_segments_heads_[power]; |
| 160 while (current) { | 187 while (current) { |
| 161 Segment* next = current->next(); | 188 Segment* next = current->next(); |
| 162 FreeSegment(current); | 189 FreeSegment(current); |
| 163 current = next; | 190 current = next; |
| 164 } | 191 } |
| 165 unused_segments_heads_[power] = nullptr; | 192 unused_segments_heads_[power] = nullptr; |
| 166 } | 193 } |
| 167 } | 194 } |
| 168 | 195 |
| 169 } // namespace internal | 196 } // namespace internal |
| 170 } // namespace v8 | 197 } // namespace v8 |
| OLD | NEW |