icinga2/lib/base/fifo.cpp

149 lines
3.5 KiB
C++
Raw Normal View History

/******************************************************************************
* Icinga 2 *
2015-01-22 12:00:23 +01:00
* Copyright (C) 2012-2015 Icinga Development Team (http://www.icinga.org) *
* *
* This program is free software; you can redistribute it and/or *
* modify it under the terms of the GNU General Public License *
* as published by the Free Software Foundation; either version 2 *
* of the License, or (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the Free Software Foundation *
2012-05-11 13:33:57 +02:00
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. *
******************************************************************************/
2014-05-25 16:23:35 +02:00
#include "base/fifo.hpp"
2012-06-15 19:32:41 +02:00
2012-03-28 13:24:49 +02:00
using namespace icinga;
/**
* Constructor for the FIFO class.
*/
2012-03-28 13:24:49 +02:00
FIFO::FIFO(void)
2012-08-03 15:35:27 +02:00
: m_Buffer(NULL), m_DataSize(0), m_AllocSize(0), m_Offset(0)
{ }
2012-03-28 13:24:49 +02:00
/**
* Destructor for the FIFO class.
*/
2012-03-28 13:24:49 +02:00
FIFO::~FIFO(void)
{
2012-05-26 20:19:32 +02:00
free(m_Buffer);
2012-03-28 13:24:49 +02:00
}
/**
* Resizes the FIFO's buffer so that it is at least newSize bytes long.
*
* @param newSize The minimum new size of the FIFO buffer.
*/
2013-04-08 09:44:12 +02:00
void FIFO::ResizeBuffer(size_t newSize, bool decrease)
2012-03-28 13:24:49 +02:00
{
2013-04-08 09:44:12 +02:00
if (m_AllocSize >= newSize && !decrease)
return;
2012-03-28 13:24:49 +02:00
newSize = (newSize / FIFO::BlockSize + 1) * FIFO::BlockSize;
2012-03-28 13:24:49 +02:00
2013-04-08 09:44:12 +02:00
if (newSize == m_AllocSize)
return;
2012-08-08 08:34:15 +02:00
char *newBuffer = static_cast<char *>(realloc(m_Buffer, newSize));
2012-05-26 20:19:32 +02:00
if (newBuffer == NULL)
2013-03-16 21:18:53 +01:00
BOOST_THROW_EXCEPTION(std::bad_alloc());
2012-05-26 20:19:32 +02:00
2012-05-27 00:27:55 +02:00
m_Buffer = newBuffer;
m_AllocSize = newSize;
2012-03-28 13:24:49 +02:00
}
/**
* Optimizes memory usage of the FIFO buffer by reallocating
* and moving the buffer.
*/
2012-03-28 13:24:49 +02:00
void FIFO::Optimize(void)
{
if (m_DataSize < m_Offset) {
std::memcpy(m_Buffer, m_Buffer + m_Offset, m_DataSize);
2012-03-28 13:24:49 +02:00
m_Offset = 0;
2013-04-08 09:44:12 +02:00
if (m_DataSize > 0)
ResizeBuffer(m_DataSize, true);
2012-03-28 13:24:49 +02:00
return;
2013-04-05 14:05:00 +02:00
}
2012-03-28 13:24:49 +02:00
}
2015-06-22 11:11:21 +02:00
size_t FIFO::Peek(void *buffer, size_t count, bool allow_partial)
{
2015-06-22 11:11:21 +02:00
ASSERT(allow_partial);
if (count > m_DataSize)
count = m_DataSize;
if (buffer != NULL)
std::memcpy(buffer, m_Buffer + m_Offset, count);
return count;
}
/**
2013-04-04 16:08:02 +02:00
* Implements IOQueue::Read.
*/
size_t FIFO::Read(void *buffer, size_t count, bool allow_partial)
2012-03-28 13:24:49 +02:00
{
ASSERT(allow_partial);
2012-11-22 12:04:32 +01:00
if (count > m_DataSize)
count = m_DataSize;
2012-03-28 13:24:49 +02:00
if (buffer != NULL)
std::memcpy(buffer, m_Buffer + m_Offset, count);
2012-11-22 12:04:32 +01:00
m_DataSize -= count;
2012-03-28 13:24:49 +02:00
m_Offset += count;
Optimize();
2012-11-22 12:04:32 +01:00
return count;
2012-03-28 13:24:49 +02:00
}
/**
2012-07-16 00:02:31 +02:00
* Implements IOQueue::Write.
*/
2012-07-16 00:02:31 +02:00
void FIFO::Write(const void *buffer, size_t count)
2012-03-28 19:50:55 +02:00
{
2013-04-08 09:44:12 +02:00
ResizeBuffer(m_Offset + m_DataSize + count, false);
std::memcpy(m_Buffer + m_Offset + m_DataSize, buffer, count);
m_DataSize += count;
SignalDataAvailable();
2012-03-28 13:24:49 +02:00
}
2013-04-04 16:08:02 +02:00
void FIFO::Close(void)
{ }
bool FIFO::IsEof(void) const
{
return false;
}
2013-04-04 16:08:02 +02:00
size_t FIFO::GetAvailableBytes(void) const
{
return m_DataSize;
}
bool FIFO::SupportsWaiting(void) const
{
return true;
}
bool FIFO::IsDataAvailable(void) const
{
return m_DataSize > 0;
2015-06-22 11:11:21 +02:00
}