Upgrade linux quickfix
WARNING: This is NOT an official release. As of 12/10/21 20:23, the latest release of the quickfix lib (1.15.1) does not support c++17 (the FIX::Application class has fns with dynamic exceptions). This commit upgrades to a more recent (unreleased) build which supports c++17.
This commit is contained in:
1 parent
0f3130fb47
commit
fc1ae2e5cb
357 files changed
+34385
-7102
No files matched your search
@@ -22,14 +22,21 @@
|
||||
#ifndef SHARED_ARRAY
|
||||
#define SHARED_ARRAY
|
||||
|
||||
#include "config-all.h"
|
||||
#include "AtomicCount.h"
|
||||
|
||||
namespace FIX
|
||||
{
|
||||
/// Shared array with atomic reference count
|
||||
#ifndef NO_UNALIGNED_ACCESS
|
||||
template<typename T>
|
||||
class shared_array
|
||||
{
|
||||
enum
|
||||
{
|
||||
data_offset = ( sizeof(atomic_count) / sizeof(T) + 1 )
|
||||
};
|
||||
|
||||
public:
|
||||
shared_array()
|
||||
: m_size(0)
|
||||
@@ -67,16 +74,16 @@ namespace FIX
|
||||
{ return m_buffer == 0; }
|
||||
|
||||
operator T* () const
|
||||
{ return m_buffer; }
|
||||
{ return &m_buffer[data_offset]; }
|
||||
|
||||
//optimized function to allocate storage for buffer and counter object at once
|
||||
static shared_array create(const std::size_t nSize)
|
||||
{
|
||||
if(nSize <= 0)
|
||||
if(nSize == 0)
|
||||
return shared_array();
|
||||
|
||||
//verify the needed buffer size to allocate counter object and nSize elements
|
||||
const std::size_t sizeToAllocate = nSize + ( sizeof(atomic_count) / sizeof(T) + 1 );
|
||||
const std::size_t sizeToAllocate = data_offset + nSize;
|
||||
|
||||
//allocate and zero-fill the buffer
|
||||
T* storage = new T[ sizeToAllocate ];
|
||||
@@ -84,7 +91,7 @@ namespace FIX
|
||||
|
||||
// create the counter object at the end of the storage
|
||||
// with initial reference count set to 1
|
||||
new (&storage[nSize]) atomic_count( 1 );
|
||||
new (storage) atomic_count( 1 );
|
||||
|
||||
return shared_array(storage, nSize);
|
||||
}
|
||||
@@ -100,7 +107,7 @@ namespace FIX
|
||||
|
||||
atomic_count* get_counter() const
|
||||
{
|
||||
return reinterpret_cast<atomic_count*>( &m_buffer[ size() ] );
|
||||
return reinterpret_cast<atomic_count*>( m_buffer );
|
||||
}
|
||||
|
||||
void increment_reference_count() const
|
||||
@@ -109,7 +116,7 @@ namespace FIX
|
||||
++(*counter);
|
||||
}
|
||||
|
||||
long decrement_reference_count()
|
||||
long decrement_reference_count() const
|
||||
{
|
||||
atomic_count* counter = get_counter();
|
||||
return --(*counter);
|
||||
@@ -145,6 +152,133 @@ namespace FIX
|
||||
std::size_t m_size;
|
||||
T * m_buffer;
|
||||
};
|
||||
#else
|
||||
template<typename T>
|
||||
class shared_array
|
||||
{
|
||||
public:
|
||||
shared_array()
|
||||
: m_size(0)
|
||||
, m_buffer(0)
|
||||
, m_pCtr(0)
|
||||
{}
|
||||
|
||||
shared_array(const shared_array& rhs)
|
||||
: m_size(rhs.m_size)
|
||||
, m_buffer(rhs.m_buffer)
|
||||
{
|
||||
rhs.attach();
|
||||
}
|
||||
|
||||
~shared_array()
|
||||
{ release(); }
|
||||
|
||||
shared_array& operator=(const shared_array& rhs)
|
||||
{
|
||||
if( &rhs == this )
|
||||
return *this;
|
||||
|
||||
rhs.attach();
|
||||
release();
|
||||
|
||||
m_size = rhs.m_size;
|
||||
m_buffer = rhs.m_buffer;
|
||||
m_pCtr = rhs.m_pCtr;
|
||||
|
||||
return *this;
|
||||
}
|
||||
|
||||
std::size_t size() const
|
||||
{ return m_size; }
|
||||
|
||||
bool empty() const
|
||||
{ return m_buffer == 0; }
|
||||
|
||||
operator T* () const
|
||||
{ return m_buffer; }
|
||||
|
||||
//optimized function to allocate storage for buffer and counter object at once
|
||||
static shared_array create(const std::size_t nSize)
|
||||
{
|
||||
if(nSize <= 0)
|
||||
return shared_array();
|
||||
|
||||
//verify the needed buffer size to allocate counter object and nSize elements
|
||||
const std::size_t sizeToAllocate = (nSize * sizeof(T)) + sizeof(atomic_count) + 15;
|
||||
|
||||
//allocate and zero-fill the buffer
|
||||
void * buf = std::malloc(sizeToAllocate);
|
||||
memset(buf, 0, sizeToAllocate);
|
||||
|
||||
// create the counter object at the end of the storage
|
||||
// with initial reference count set to 1
|
||||
/* round up to multiple of alignment : add (alignment - 1) and then round down by masking */
|
||||
void *ptr = (void *) (((uintptr_t)(buf) + nSize * sizeof(T) + 15) & ~ (uintptr_t)0x0F);
|
||||
new (ptr) atomic_count( 1 );
|
||||
|
||||
T* storage = reinterpret_cast<T*>(buf);
|
||||
return shared_array(storage, nSize, ptr);
|
||||
}
|
||||
|
||||
private:
|
||||
|
||||
shared_array( T * buff, std::size_t nSize, void * pCtr )
|
||||
: m_size(nSize)
|
||||
, m_buffer(buff)
|
||||
, m_pCtr(pCtr)
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
atomic_count* get_counter() const
|
||||
{
|
||||
return reinterpret_cast<atomic_count*>( m_pCtr );
|
||||
}
|
||||
|
||||
void increment_reference_count() const
|
||||
{
|
||||
atomic_count* counter = get_counter();
|
||||
++(*counter);
|
||||
}
|
||||
|
||||
long decrement_reference_count() const
|
||||
{
|
||||
atomic_count* counter = get_counter();
|
||||
return --(*counter);
|
||||
}
|
||||
|
||||
void attach() const
|
||||
{
|
||||
if( !empty() )
|
||||
increment_reference_count();
|
||||
}
|
||||
|
||||
void release()
|
||||
{
|
||||
if( empty() )
|
||||
return;
|
||||
|
||||
//free object if reference count has decreased to zero
|
||||
if( decrement_reference_count() == 0)
|
||||
{
|
||||
T * tmpBuff = m_buffer;
|
||||
atomic_count* tmpCounter = get_counter();
|
||||
|
||||
m_buffer = 0;
|
||||
m_size = 0;
|
||||
|
||||
//explicitly call destructor for the counter object
|
||||
tmpCounter->~atomic_count();
|
||||
|
||||
std::free(tmpBuff);
|
||||
}
|
||||
}
|
||||
|
||||
std::size_t m_size;
|
||||
T * m_buffer;
|
||||
void * m_pCtr;
|
||||
};
|
||||
#endif
|
||||
}
|
||||
|
||||
#endif
|
||||
Reference in new issue
Block a user