/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserved. 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 http://www.apache.org/licenses/LICENSE-2.0 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. */ #pragma once #include "paddle/fluid/memory/detail/meta_cache.h" #include "paddle/fluid/memory/detail/meta_data.h" #include "paddle/fluid/memory/detail/system_allocator.h" #include "paddle/fluid/platform/assert.h" #include "paddle/fluid/platform/cpu_info.h" #include "paddle/fluid/platform/gpu_info.h" #include #include #include #include namespace paddle { namespace memory { namespace detail { class BuddyAllocator { public: BuddyAllocator(SystemAllocator* system_allocator, size_t min_chunk_size, size_t max_chunk_size); ~BuddyAllocator(); public: void* Alloc(size_t unaligned_size); void Free(void* ptr); size_t Used(); public: // Disable copy and assignment BuddyAllocator(const BuddyAllocator&) = delete; BuddyAllocator& operator=(const BuddyAllocator&) = delete; private: // Tuple (allocator index, memory size, memory address) using IndexSizeAddress = std::tuple; // Each element in PoolSet is a free allocation using PoolSet = std::set; /*! \brief Allocate fixed-size memory from system */ void* SystemAlloc(size_t size); /*! \brief If existing chunks are not suitable, refill pool */ PoolSet::iterator RefillPool(); /** * \brief Find the suitable chunk from existing pool and split * it to left and right buddies * * \param it the iterator of pool list * \param size the size of allocation * * \return the left buddy address */ void* SplitToAlloc(PoolSet::iterator it, size_t size); /*! \brief Find the existing chunk which used to allocation */ PoolSet::iterator FindExistChunk(size_t size); /*! \brief Clean idle fallback allocation */ void CleanIdleFallBackAlloc(); /*! \brief Clean idle normal allocation */ void CleanIdleNormalAlloc(); private: size_t total_used_ = 0; // the total size of used memory size_t total_free_ = 0; // the total size of free memory size_t min_chunk_size_; // the minimum size of each chunk size_t max_chunk_size_; // the maximum size of each chunk private: /** * \brief A list of free allocation * * \note Only store free chunk memory in pool */ PoolSet pool_; /*! Record fallback allocation count for auto-scaling */ size_t fallback_alloc_count_ = 0; private: /*! Unify the metadata format between GPU and CPU allocations */ MetadataCache cache_; private: /*! Allocate CPU/GPU memory from system */ SystemAllocator* system_allocator_; std::mutex mutex_; }; } // namespace detail } // namespace memory } // namespace paddle