buddy_allocator.cc 10.0 KB
Newer Older
1
/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserved.
2

L
Luo Tao 已提交
3 4 5
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
6

L
Luo Tao 已提交
7
    http://www.apache.org/licenses/LICENSE-2.0
8

L
Luo Tao 已提交
9 10 11 12 13
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License. */
14

Y
Yi Wang 已提交
15
#include "paddle/fluid/memory/detail/buddy_allocator.h"
L
liaogang 已提交
16
#include "glog/logging.h"
17 18 19 20 21

namespace paddle {
namespace memory {
namespace detail {

22 23 24
BuddyAllocator::BuddyAllocator(
    std::unique_ptr<SystemAllocator> system_allocator, size_t min_chunk_size,
    size_t max_chunk_size)
25 26 27
    : min_chunk_size_(min_chunk_size),
      max_chunk_size_(max_chunk_size),
      cache_(system_allocator->UseGpu()),
L
liaogang 已提交
28 29 30
      system_allocator_(std::move(system_allocator)) {}

BuddyAllocator::~BuddyAllocator() {
31 32
  VLOG(10) << "BuddyAllocator Disconstructor makes sure that all of these "
              "have actually been freed";
L
liaogang 已提交
33 34
  while (!pool_.empty()) {
    auto block = static_cast<MemoryBlock*>(std::get<2>(*pool_.begin()));
35
    VLOG(10) << "Free from block (" << block << ", " << max_chunk_size_ << ")";
L
liaogang 已提交
36 37 38 39 40

    system_allocator_->Free(block, max_chunk_size_, block->index(cache_));
    cache_.invalidate(block);
    pool_.erase(pool_.begin());
  }
L
liaogang 已提交
41 42 43 44 45 46 47 48 49
}

inline size_t align(size_t size, size_t alignment) {
  size_t remaining = size % alignment;
  return remaining == 0 ? size : size + (alignment - remaining);
}

void* BuddyAllocator::Alloc(size_t unaligned_size) {
  // adjust allocation alignment
Y
Update  
Yi Wang 已提交
50 51
  size_t size =
      align(unaligned_size + sizeof(MemoryBlock::Desc), min_chunk_size_);
L
liaogang 已提交
52 53 54 55

  // acquire the allocator lock
  std::lock_guard<std::mutex> lock(mutex_);

56 57
  VLOG(10) << "Allocate " << unaligned_size << " bytes from chunk size "
           << size;
L
liaogang 已提交
58 59 60

  // if the allocation is huge, send directly to the system allocator
  if (size > max_chunk_size_) {
61
    VLOG(10) << "Allocate from system allocator.";
L
liaogang 已提交
62 63 64 65 66 67 68 69 70
    return SystemAlloc(size);
  }

  // query and allocate from the existing chunk
  auto it = FindExistChunk(size);

  // refill the pool if failure
  if (it == pool_.end()) {
    it = RefillPool();
L
liaogang 已提交
71 72 73 74
    // if still failure, fail fatally
    if (it == pool_.end()) {
      return nullptr;
    }
L
liaogang 已提交
75
  } else {
76 77 78
    VLOG(10) << "Allocation from existing memory block " << std::get<2>(*it)
             << " at address "
             << reinterpret_cast<MemoryBlock*>(std::get<2>(*it))->data();
L
liaogang 已提交
79 80 81 82 83 84 85 86 87
  }

  total_used_ += size;
  total_free_ -= size;

  // split the allocation and return data for use
  return reinterpret_cast<MemoryBlock*>(SplitToAlloc(it, size))->data();
}

L
liaogang 已提交
88
void BuddyAllocator::Free(void* p) {
L
liaogang 已提交
89
  // Point back to metadata
L
liaogang 已提交
90 91
  auto block = static_cast<MemoryBlock*>(p)->metadata();

L
liaogang 已提交
92
  // Acquire the allocator lock
L
liaogang 已提交
93
  std::lock_guard<std::mutex> lock(mutex_);
L
liaogang 已提交
94

95
  VLOG(10) << "Free from address " << block;
L
liaogang 已提交
96 97

  if (block->type(cache_) == MemoryBlock::HUGE_CHUNK) {
98
    VLOG(10) << "Free directly from system allocator";
L
liaogang 已提交
99 100 101 102
    system_allocator_->Free(block, block->total_size(cache_),
                            block->index(cache_));

    // Invalidate GPU allocation from cache
103 104
    cache_.invalidate(block);

L
liaogang 已提交
105 106 107
    return;
  }

Y
Update  
Yi Wang 已提交
108
  block->mark_as_free(&cache_);
L
liaogang 已提交
109 110 111 112 113 114

  total_used_ -= block->total_size(cache_);
  total_free_ += block->total_size(cache_);

  // Trying to merge the right buddy
  if (block->has_right_buddy(cache_)) {
115 116
    VLOG(10) << "Merging this block " << block << " with its right buddy "
             << block->right_buddy(cache_);
117 118 119 120 121

    auto right_buddy = block->right_buddy(cache_);

    if (right_buddy->type(cache_) == MemoryBlock::FREE_CHUNK) {
      // Take away right buddy from pool
L
liaogang 已提交
122 123 124
      pool_.erase(IndexSizeAddress(right_buddy->index(cache_),
                                   right_buddy->total_size(cache_),
                                   right_buddy));
125 126

      // merge its right buddy to the block
Y
Update  
Yi Wang 已提交
127
      block->merge(&cache_, right_buddy);
128
    }
L
liaogang 已提交
129 130 131 132
  }

  // Trying to merge the left buddy
  if (block->has_left_buddy(cache_)) {
133 134
    VLOG(10) << "Merging this block " << block << " with its left buddy "
             << block->left_buddy(cache_);
135 136 137 138 139

    auto left_buddy = block->left_buddy(cache_);

    if (left_buddy->type(cache_) == MemoryBlock::FREE_CHUNK) {
      // Take away right buddy from pool
L
liaogang 已提交
140 141
      pool_.erase(IndexSizeAddress(left_buddy->index(cache_),
                                   left_buddy->total_size(cache_), left_buddy));
142 143

      // merge the block to its left buddy
Y
Update  
Yi Wang 已提交
144
      left_buddy->merge(&cache_, block);
145 146
      block = left_buddy;
    }
L
liaogang 已提交
147 148 149
  }

  // Dumping this block into pool
150 151
  VLOG(10) << "Inserting free block (" << block << ", "
           << block->total_size(cache_) << ")";
L
liaogang 已提交
152 153
  pool_.insert(
      IndexSizeAddress(block->index(cache_), block->total_size(cache_), block));
L
liaogang 已提交
154

L
liaogang 已提交
155
  // Clean up if existing too much free memory
156

L
liaogang 已提交
157 158 159 160 161
  // Prefer freeing fallback allocation first
  CleanIdleFallBackAlloc();

  // Free normal allocation
  CleanIdleNormalAlloc();
L
liaogang 已提交
162 163
}

L
liaogang 已提交
164 165
size_t BuddyAllocator::Used() { return total_used_; }

L
liaogang 已提交
166 167
void* BuddyAllocator::SystemAlloc(size_t size) {
  size_t index = 0;
Y
Update  
Yi Wang 已提交
168
  void* p = system_allocator_->Alloc(&index, size);
L
liaogang 已提交
169

170
  VLOG(10) << "Allocated " << p << " from system allocator.";
L
liaogang 已提交
171 172 173

  if (p == nullptr) return nullptr;

Y
Update  
Yi Wang 已提交
174
  static_cast<MemoryBlock*>(p)->init(&cache_, MemoryBlock::HUGE_CHUNK, index,
L
liaogang 已提交
175 176 177 178 179 180
                                     size, nullptr, nullptr);

  return static_cast<MemoryBlock*>(p)->data();
}

BuddyAllocator::PoolSet::iterator BuddyAllocator::RefillPool() {
181
#ifdef PADDLE_WITH_CUDA
L
liaogang 已提交
182 183 184 185 186 187
  if (system_allocator_->UseGpu()) {
    if ((total_used_ + total_free_) == 0) {
      // Compute the maximum allocation size for the first allocation.
      max_chunk_size_ = platform::GpuMaxChunkSize();
    }
  }
L
Luo Tao 已提交
188
#endif
L
liaogang 已提交
189 190 191

  // Allocate a new maximum sized block
  size_t index = 0;
Y
Update  
Yi Wang 已提交
192
  void* p = system_allocator_->Alloc(&index, max_chunk_size_);
L
liaogang 已提交
193 194 195

  if (p == nullptr) return pool_.end();

196 197
  VLOG(10) << "Creating and inserting new block " << p
           << " from system allocator";
L
liaogang 已提交
198

Y
Yi Wang 已提交
199
  static_cast<MemoryBlock*>(p)->init(&cache_, MemoryBlock::FREE_CHUNK, index,
L
liaogang 已提交
200 201
                                     max_chunk_size_, nullptr, nullptr);

202 203 204 205 206 207
  // gpu fallback allocation
  if (system_allocator_->UseGpu() &&
      static_cast<MemoryBlock*>(p)->index(cache_) == 1) {
    fallback_alloc_count_++;
  }

L
liaogang 已提交
208 209 210
  total_free_ += max_chunk_size_;

  // dump the block into pool
L
liaogang 已提交
211
  return pool_.insert(IndexSizeAddress(index, max_chunk_size_, p)).first;
L
liaogang 已提交
212 213 214 215 216 217
}

BuddyAllocator::PoolSet::iterator BuddyAllocator::FindExistChunk(size_t size) {
  size_t index = 0;

  while (1) {
L
liaogang 已提交
218
    auto it = pool_.lower_bound(IndexSizeAddress(index, size, nullptr));
219 220

    // no match chunk memory
L
liaogang 已提交
221 222 223
    if (it == pool_.end()) return it;

    if (std::get<0>(*it) > index) {
224
      // find suitable one
L
liaogang 已提交
225 226 227
      if (std::get<1>(*it) >= size) {
        return it;
      }
228
      // update and continue
L
liaogang 已提交
229 230 231 232 233 234 235 236 237 238 239 240
      index = std::get<0>(*it);
      continue;
    }
    return it;
  }
}

void* BuddyAllocator::SplitToAlloc(BuddyAllocator::PoolSet::iterator it,
                                   size_t size) {
  auto block = static_cast<MemoryBlock*>(std::get<2>(*it));
  pool_.erase(it);

241 242
  VLOG(10) << "Split block (" << block << ", " << block->total_size(cache_)
           << ") into";
Y
Update  
Yi Wang 已提交
243
  block->split(&cache_, size);
L
liaogang 已提交
244

245 246
  VLOG(10) << "Left block (" << block << ", " << block->total_size(cache_)
           << ")";
Y
Update  
Yi Wang 已提交
247
  block->set_type(&cache_, MemoryBlock::ARENA_CHUNK);
L
liaogang 已提交
248 249 250 251

  // the rest of memory if exist
  if (block->has_right_buddy(cache_)) {
    if (block->right_buddy(cache_)->type(cache_) == MemoryBlock::FREE_CHUNK) {
252 253
      VLOG(10) << "Insert right block (" << block->right_buddy(cache_) << ", "
               << block->right_buddy(cache_)->total_size(cache_) << ")";
L
liaogang 已提交
254

L
liaogang 已提交
255 256 257 258
      pool_.insert(
          IndexSizeAddress(block->right_buddy(cache_)->index(cache_),
                           block->right_buddy(cache_)->total_size(cache_),
                           block->right_buddy(cache_)));
L
liaogang 已提交
259 260 261 262
    }
  }

  return block;
263 264
}

L
liaogang 已提交
265
void BuddyAllocator::CleanIdleFallBackAlloc() {
266 267 268 269 270 271 272 273 274 275 276 277 278 279
  // If fallback allocation does not exist, return directly
  if (!fallback_alloc_count_) return;

  for (auto pool = pool_.rbegin(); pool != pool_.rend();) {
    // If free memory block less than max_chunk_size_, return directly
    if (std::get<1>(*pool) < max_chunk_size_) return;

    MemoryBlock* block = static_cast<MemoryBlock*>(std::get<2>(*pool));

    // If no GPU fallback allocator, return
    if (!system_allocator_->UseGpu() || block->index(cache_) == 0) {
      return;
    }

280
    VLOG(10) << "Return block " << block << " to fallback allocator.";
281 282 283 284 285 286 287 288 289 290 291 292

    system_allocator_->Free(block, max_chunk_size_, block->index(cache_));
    cache_.invalidate(block);

    pool = PoolSet::reverse_iterator(pool_.erase(std::next(pool).base()));

    total_free_ -= max_chunk_size_;
    fallback_alloc_count_--;

    // If no fall allocation exists, return directly
    if (!fallback_alloc_count_) return;
  }
293 294
}

295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315
void BuddyAllocator::CleanIdleNormalAlloc() {
  auto shall_free_alloc = [&]() -> bool {
    // free all fallback allocations
    if (fallback_alloc_count_ > 0) {
      return true;
    }
    // keep 2x overhead if we haven't fallen back
    if ((total_used_ + max_chunk_size_) * 2 < total_free_) {
      return true;
    }
    return false;
  };

  if (!shall_free_alloc()) return;

  for (auto pool = pool_.rbegin(); pool != pool_.rend();) {
    // If free memory block less than max_chunk_size_, return directly
    if (std::get<1>(*pool) < max_chunk_size_) return;

    MemoryBlock* block = static_cast<MemoryBlock*>(std::get<2>(*pool));

316
    VLOG(10) << "Return block " << block << " to base allocator.";
317 318 319 320 321 322 323 324 325 326 327

    system_allocator_->Free(block, max_chunk_size_, block->index(cache_));
    cache_.invalidate(block);

    pool = PoolSet::reverse_iterator(pool_.erase(std::next(pool).base()));

    total_free_ -= max_chunk_size_;

    if (!shall_free_alloc()) return;
  }
}
L
liaogang 已提交
328

329 330 331
}  // namespace detail
}  // namespace memory
}  // namespace paddle