FixedSizeDequeWithMutexes.hpp

/*
 * ------------------------------------------------------------------------------------------------------------
 * SPDX-License-Identifier: LGPL-2.1-only
 *
 * Copyright (c) 2018-2020 Lawrence Livermore National Security LLC
 * Copyright (c) 2018-2020 The Board of Trustees of the Leland Stanford Junior University
 * Copyright (c) 2018-2020 TotalEnergies
 * Copyright (c) 2019-     GEOSX Contributors
 * All rights reserved
 *
 * See top level LICENSE, COPYRIGHT, CONTRIBUTORS, NOTICE, and ACKNOWLEDGEMENTS files for details.
 * ------------------------------------------------------------------------------------------------------------
 */
#ifndef FIXEDSIZEDEQUEWITHMUTEXES_HPP
#define FIXEDSIZEDEQUEWITHMUTEXES_HPP
 
#include <future>
#include <mutex>
#include <condition_variable>
#include <camp/camp.hpp>
 
#include "common/FixedSizeDeque.hpp"
#include "common/MultiMutexesLock.hpp"
 
namespace geos
{
template< typename T, typename INDEX_TYPE >
class FixedSizeDequeWithMutexes : public FixedSizeDeque< T, INDEX_TYPE >
{
public:
  std::mutex m_frontMutex;
  std::mutex m_backMutex;
  std::mutex m_popMutex;
  std::mutex m_emplaceMutex;
  std::condition_variable_any m_notFullCond;
  std::condition_variable_any m_notEmptyCond;
 
  FixedSizeDequeWithMutexes( int maxEntries, int valuesPerEntry, LvArray::MemorySpace space ): FixedSizeDeque< T, INDEX_TYPE >( maxEntries, valuesPerEntry, space,
#ifdef GEOSX_USE_CUDA
                                                                                                                                camp::resources::Resource{ camp::resources::Cuda{} }
#else
                                                                                                                                camp::resources::Resource{ camp::resources::Host{} }
#endif
                                                                                                                                ) {}
 
  camp::resources::Event emplaceFront( arrayView1d< T > array )
  {
    LIFO_MARK_FUNCTION;
    camp::resources::Event e;
    {
      auto lock = make_multilock( m_emplaceMutex, m_frontMutex );
      {
        LIFO_MARK_SCOPE( waitingForBuffer );
        m_notFullCond.wait( lock, [ this ]  { return !this->full(); } );
      }
      {
        LIFO_MARK_SCOPE( copy );
        e = FixedSizeDeque< T, INDEX_TYPE >::emplace_front( array.toSliceConst() );
      }
    }
    m_notEmptyCond.notify_all();
    return e;
  }
 
  camp::resources::Event popFront( arrayView1d< T > array )
  {
    LIFO_MARK_FUNCTION;
    camp::resources::Event e;
    {
      auto lock = make_multilock( m_popMutex, m_frontMutex );
      {
        LIFO_MARK_SCOPE( waitingForBuffer );
        m_notEmptyCond.wait( lock, [ this ]  { return !this->empty(); } );
      }
      // deadlock can occur if frontMutex is taken after an
      // emplaceMutex (inside pushAsync) but this is prevented by the
      // pushWait() in popAsync.
      {
        LIFO_MARK_SCOPE( copy );
        camp::resources::Resource r = this->getStream();
        e = LvArray::memcpy( r, array.toSlice(), this->front() );
        this->pop_front();
      }
    }
    m_notFullCond.notify_all();
    return e;
  }
 
  void emplaceFrontFromBack( FixedSizeDequeWithMutexes< T, INDEX_TYPE > & q2 )
  {
    LIFO_MARK_FUNCTION;
    {
      auto lock = make_multilock( m_emplaceMutex, q2.m_popMutex, m_frontMutex, q2.m_backMutex );
      while( this->full() || q2.empty() )
      {
        {
          LIFO_MARK_SCOPE( WaitForBufferToEmplace );
          m_notFullCond.wait( lock, [ this ]  { return !this->full(); } );
        }
        {
          LIFO_MARK_SCOPE( WaitForBufferToPop );
          q2.m_notEmptyCond.wait( lock, [ &q2 ] { return !q2.empty(); } );
        }
      }
      LIFO_MARK_SCOPE( Transfert );
      this->emplace_front( q2.back() ).wait();
      q2.pop_back();
    }
    q2.m_notFullCond.notify_all();
    m_notEmptyCond.notify_all();
  }
 
  void emplaceBackFromFront( FixedSizeDequeWithMutexes< T, INDEX_TYPE > & q2 )
  {
    LIFO_MARK_FUNCTION;
    {
      auto lock = make_multilock( m_emplaceMutex, q2.m_popMutex, m_backMutex, q2.m_frontMutex );
      while( this->full() || q2.empty() )
      {
        m_notFullCond.wait( lock, [ this ]  { return !this->full(); } );
        q2.m_notEmptyCond.wait( lock, [ &q2 ] { return !q2.empty(); } );
      }
      this->emplace_back( q2.front() ).wait();
      q2.pop_front();
    }
    m_notEmptyCond.notify_all();
    q2.m_notFullCond.notify_all();
  }
};
}
#endif // FIXEDSIZEDEQUEWITHMUTEXES_HPP