MemoryPool.cc

// -*- tab-width: 2; indent-tabs-mode: nil; coding: utf-8-with-signature -*-
//-----------------------------------------------------------------------------
// Copyright 2000-2025 CEA (www.cea.fr) IFPEN (www.ifpenergiesnouvelles.com)
// See the top-level COPYRIGHT file for details.
// SPDX-License-Identifier: Apache-2.0
//-----------------------------------------------------------------------------
/*---------------------------------------------------------------------------*/
/* MemoryPool.cc                                               (C) 2000-2025 */
/*                                                                           */
/* Classe pour gérer une liste de zone allouées.                             */
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
#include "arccore/common/internal/MemoryPool.h"
 
#include "arccore/base/FatalErrorException.h"
#include "arccore/base/PlatformUtils.h"
#include "arccore/base/Convert.h"
 
#include "arccore/common/Array.h"
 
#include <unordered_map>
#include <map>
#include <atomic>
#include <mutex>
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
namespace Arcane::Impl
{
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
class MemoryPool::Impl
{
  //! Tableau associatif des pointeurs alloués et la taille associée
  class AllocatedMap
  {
   public:
 
    using MapType = std::unordered_map<void*, size_t>;
    using ValueType = MapType::value_type;
    using MapIterator = MapType::iterator;
 
   public:
 
    explicit AllocatedMap(const String& name)
    : m_name(name)
    {}
 
   public:
 
    void removePointer(void* ptr, size_t size)
    {
      std::unique_lock<std::mutex> lg(m_mutex);
      auto x = m_allocated_memory_map.find(ptr);
      if (x == m_allocated_memory_map.end()) {
        ++m_nb_error;
        String str = String::format("MemoryPool '{0}': pointer {1} is not in the allocated map", m_name, ptr);
        ARCCORE_FATAL_IF(m_is_throw_on_error, str);
        std::cerr << "ERROR: " << str << "\n";
        return;
      }
 
      size_t allocated_size = x->second;
      if (size != allocated_size) {
        ++m_nb_error;
        String str = String::format("MemoryPool '{0}': Incoherent size saved_size={1} arg_size={2}",
                                    m_name, allocated_size, size);
        ARCCORE_FATAL_IF(m_is_throw_on_error, str);
        std::cerr << "ERROR: " << str << "\n";
      }
 
      m_allocated_memory_map.erase(x);
    }
 
    void addPointer(void* ptr, size_t size)
    {
      std::unique_lock<std::mutex> lg(m_mutex);
      auto x = m_allocated_memory_map.find(ptr);
      ARCCORE_FATAL_IF((x != m_allocated_memory_map.end()),
                      "MemoryPool '{0}': pointer {1} (for size={2}) is already in the allocated map (with size={3})",
                      m_name, ptr, size, x->second);
      m_allocated_memory_map.insert(std::make_pair(ptr, size));
    }
 
    size_t size() const
    {
      std::unique_lock<std::mutex> lg(m_mutex);
      return m_allocated_memory_map.size();
    }
 
    bool isThrowOnError() const { return m_is_throw_on_error; }
    void setIsThrowOnError(bool v) { m_is_throw_on_error = v; }
    Int32 nbError() const { return m_nb_error; }
 
   private:
 
    MapType m_allocated_memory_map;
    String m_name;
    std::atomic<Int32> m_nb_error = 0;
    bool m_is_throw_on_error = false;
    mutable std::mutex m_mutex;
  };
 
 public:
 
  //! Tableau associatif des emplacements mémoire libres par taille
  class FreedMap
  {
   public:
 
    using MapType = std::unordered_multimap<size_t, void*>;
 
   public:
 
    explicit FreedMap(const String& name)
    : m_name(name)
    {}
 
   public:
 
    /*!
     * \brief Récupère un pointeur pour une taille \a size.
     *
     * Retourne nullptr s'il n'y a aucune valeur dans le cache
     * pour cette taille. Sinon, le pointeur retourné est supprimé du cache.
     */
    void* getPointer(size_t size)
    {
      std::unique_lock<std::mutex> lg(m_mutex);
      void* ptr = nullptr;
      auto x = m_free_memory_map.find(size);
      if (x != m_free_memory_map.end()) {
        ptr = x->second;
        m_free_memory_map.erase(x);
      }
      return ptr;
    }
 
    void addPointer(void* ptr, size_t size)
    {
      std::unique_lock<std::mutex> lg(m_mutex);
      m_free_memory_map.insert(std::make_pair(size, ptr));
    }
 
    size_t size() const
    {
      std::unique_lock<std::mutex> lg(m_mutex);
      return m_free_memory_map.size();
    }
 
    void dump(std::ostream& ostr)
    {
      std::map<size_t, Int32> nb_alloc_per_size;
      {
        std::unique_lock<std::mutex> lg(m_mutex);
        for (const auto& [key, value] : m_free_memory_map) {
          auto x = nb_alloc_per_size.find(key);
          if (x == nb_alloc_per_size.end())
            nb_alloc_per_size.insert(std::make_pair(key, 1));
          else
            ++x->second;
        }
      }
      ostr << "FreedMap '" << m_name << "\n";
      for (const auto& [key, value] : nb_alloc_per_size)
        ostr << "Map size=" << key << " nb_allocated=" << value << " page_modulo=" << (key % 4096) << "\n";
    }
 
    //! Remplit \a values avec les valeurs de \a m_free_memory_map et vide cette dernière
    void fillFreeMapAndClear(Array<std::pair<void*, size_t>>& values)
    {
      std::unique_lock<std::mutex> lg(m_mutex);
      values.reserve(m_free_memory_map.size());
      for (const auto& [size, ptr] : m_free_memory_map)
        values.add(std::make_pair(ptr, size));
      m_free_memory_map.clear();
    }
 
   private:
 
    MapType m_free_memory_map;
    String m_name;
    mutable std::mutex m_mutex;
  };
 
 public:
 
  explicit Impl(IMemoryPoolAllocator* allocator, const String& name)
  : m_allocator(allocator)
  , m_allocated_map(name)
  , m_free_map(name)
  , m_name(name)
  {
    if (auto v = Convert::Type<Int32>::tryParseFromEnvironment("ARCANE_MEMORY_POOL_THROW_ON_ERROR", true)) {
      bool throw_on_error = (v.value() != 0);
      m_allocated_map.setIsThrowOnError(throw_on_error);
    }
  }
  ~Impl()
  {
    // Ne libère pas la mémoire dans m_free_map
    // car ce destructeur peut être appelé en fin d'exécution
    // et sur accélérateur on ne peut plus à ce moment la
    // appeler des fonctions du runtime.
  }
 
 public:
 
  void* allocateMemory(size_t size);
  void freeMemory(void* ptr, size_t size);
  void dumpStats(std::ostream& ostr);
  void dumpFreeMap(std::ostream& ostr);
  void setMaxCachedBlockSize(Int32 v);
  void freeCachedMemory();
 
 public:
 
  IMemoryPoolAllocator* m_allocator = nullptr;
  // Contient une liste de couples (taille_mémoire,pointeur) de mémoire allouée.
  AllocatedMap m_allocated_map;
  //! Liste des allocations libres dans le cache
  FreedMap m_free_map;
  std::atomic<size_t> m_total_allocated = 0;
  std::atomic<size_t> m_total_free = 0;
  std::atomic<Int32> m_nb_cached = 0;
  std::atomic<Int32> m_nb_no_cached = 0;
  size_t m_max_memory_size_to_pool = 1024 * 64 * 4 * 4;
  String m_name;
 
 private:
 
  void _freeMemory(void* ptr);
  void _addAllocated(void* ptr, size_t size);
};
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
void* MemoryPool::Impl::
allocateMemory(size_t size)
{
  if (m_max_memory_size_to_pool != 0 && size > m_max_memory_size_to_pool) {
    ++m_nb_no_cached;
    return m_allocator->allocateMemory(size);
  }
 
  void* ptr = m_free_map.getPointer(size);
  if (ptr) {
    m_total_free -= size;
    ++m_nb_cached;
  }
  else {
    ptr = m_allocator->allocateMemory(size);
  }
  _addAllocated(ptr, size);
  return ptr;
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
void MemoryPool::Impl::
freeMemory(void* ptr, size_t size)
{
  if (m_max_memory_size_to_pool != 0 && size > m_max_memory_size_to_pool)
    return m_allocator->freeMemory(ptr, size);
 
  m_allocated_map.removePointer(ptr, size);
 
  m_free_map.addPointer(ptr, size);
  m_total_allocated -= size;
  m_total_free += size;
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
void MemoryPool::Impl::
_addAllocated(void* ptr, size_t size)
{
  m_allocated_map.addPointer(ptr, size);
  m_total_allocated += size;
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
void MemoryPool::Impl::
dumpStats(std::ostream& ostr)
{
  ostr << "Stats '" << m_name << "' max_block=" << m_max_memory_size_to_pool
       << " TotalAllocated=" << m_total_allocated
       << " TotalFree=" << m_total_free
       << " nb_allocated=" << m_allocated_map.size()
       << " nb_free=" << m_free_map.size()
       << " nb_cached=" << m_nb_cached
       << " nb_no_cached=" << m_nb_no_cached
       << " nb_error=" << m_allocated_map.nbError()
       << "\n";
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
void MemoryPool::Impl::
dumpFreeMap(std::ostream& ostr)
{
  m_free_map.dump(ostr);
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
void MemoryPool::Impl::
setMaxCachedBlockSize(Int32 v)
{
  if (m_allocated_map.size() != 0 || m_free_map.size() != 0)
    ARCCORE_FATAL("Can not change maximum cached block size on non empty pool");
  if (v < 0)
    v = 0;
  m_max_memory_size_to_pool = v;
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
void MemoryPool::Impl::
freeCachedMemory()
{
  UniqueArray<std::pair<void*, size_t>> values_to_free;
  m_free_map.fillFreeMapAndClear(values_to_free);
  for (const auto& v : values_to_free) {
    m_allocator->freeMemory(v.first, v.second);
  }
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
MemoryPool::
MemoryPool(IMemoryPoolAllocator* allocator, const String& name)
: m_p(std::make_unique<Impl>(allocator, name))
{
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
MemoryPool::
~MemoryPool()
{
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
void* MemoryPool::allocateMemory(size_t size)
{
  return m_p->allocateMemory(size);
}
void MemoryPool::freeMemory(void* ptr, size_t size)
{
  m_p->freeMemory(ptr, size);
}
void MemoryPool::dumpStats(std::ostream& ostr)
{
  m_p->dumpStats(ostr);
}
void MemoryPool::
dumpFreeMap(std::ostream& ostr)
{
  m_p->dumpFreeMap(ostr);
}
String MemoryPool::name() const
{
  return m_p->m_name;
}
void MemoryPool::
setMaxCachedBlockSize(Int32 v)
{
  m_p->setMaxCachedBlockSize(v);
}
void MemoryPool::
freeCachedMemory()
{
  m_p->freeCachedMemory();
}
size_t MemoryPool::
totalAllocated() const
{
  return m_p->m_total_allocated;
}
size_t MemoryPool::
totalCached() const
{
  return m_p->m_total_free;
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
} // namespace Arcane::Impl
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/