libcruft-util/cruft/util/alloc/linear.cpp

140 lines
2.9 KiB
C++
Raw Normal View History

2015-11-13 17:17:37 +11:00
/*
2018-08-04 15:14:06 +10:00
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
2015-11-13 17:17:37 +11:00
*
* Copyright 2015 Danny Robson <danny@nerdcruft.net>
*/
#include "linear.hpp"
2015-11-13 17:17:37 +11:00
#include "traits.hpp"
#include "../pointer.hpp"
#include "../debug/assert.hpp"
2015-11-13 17:17:37 +11:00
using cruft::alloc::linear;
2015-11-13 17:17:37 +11:00
///////////////////////////////////////////////////////////////////////////////
linear::linear (cruft::view<u08*> _data):
m_begin (_data.begin ()),
m_end (_data.end ()),
m_cursor (_data.begin ())
{ ; }
2015-11-13 17:17:37 +11:00
///////////////////////////////////////////////////////////////////////////////
2019-01-03 15:48:34 +11:00
linear::linear (linear &&rhs) noexcept
: m_begin (std::exchange (rhs.m_begin, nullptr))
, m_end (std::exchange (rhs.m_end, nullptr))
, m_cursor (std::exchange (rhs.m_cursor, nullptr))
{ ; }
//-----------------------------------------------------------------------------
linear&
2019-01-03 15:48:34 +11:00
linear::operator= (linear &&rhs) noexcept
{
m_begin = std::exchange (rhs.m_begin, nullptr);
m_end = std::exchange (rhs.m_end, nullptr);
m_cursor = std::exchange (rhs.m_cursor, nullptr);
return *this;
}
2015-11-13 17:17:37 +11:00
///////////////////////////////////////////////////////////////////////////////
u08*
2018-02-28 16:19:27 +11:00
linear::data (void)
{
return m_begin;
}
//-----------------------------------------------------------------------------
const u08*
2018-02-28 16:19:27 +11:00
linear::data (void) const
{
return m_begin;
}
2016-06-22 19:51:18 +10:00
//-----------------------------------------------------------------------------
u08*
2017-08-31 13:48:33 +10:00
linear::begin (void)
2016-06-22 19:51:18 +10:00
{
return m_begin;
}
//-----------------------------------------------------------------------------
const u08*
2017-08-31 13:48:33 +10:00
linear::begin (void) const
{
return m_begin;
}
//-----------------------------------------------------------------------------
u08*
linear::end (void)
{
return m_end;
}
//-----------------------------------------------------------------------------
const u08*
linear::end (void) const
{
return m_end;
}
2016-06-22 19:51:18 +10:00
//-----------------------------------------------------------------------------
size_t
linear::offset (const void *_ptr) const
{
auto ptr = reinterpret_cast<const u08*> (_ptr);
2016-06-22 19:51:18 +10:00
CHECK_GE (ptr, m_begin);
return ptr - m_begin;
}
2015-11-13 17:17:37 +11:00
///////////////////////////////////////////////////////////////////////////////
void
linear::reset (void)
{
m_cursor = m_begin;
}
///////////////////////////////////////////////////////////////////////////////
size_t
linear::capacity (void) const
{
return m_end - m_begin;
}
//-----------------------------------------------------------------------------
size_t
2015-11-30 16:08:07 +11:00
linear::used (void) const
{
return m_cursor - m_begin;
}
//-----------------------------------------------------------------------------
size_t
linear::remain (void) const
{
2015-11-30 16:08:07 +11:00
return capacity () - used ();
}
///////////////////////////////////////////////////////////////////////////////
static_assert (cruft::alloc::is_allocator_v<linear>);