libcruft-util/alloc/raw/stack.cpp

171 lines
4.3 KiB
C++
Raw Normal View History

2015-11-13 17:17:37 +11:00
/*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* Copyright 2015-2016 Danny Robson <danny@nerdcruft.net>
2015-11-13 17:17:37 +11:00
*/
#include "stack.hpp"
2015-11-13 17:17:37 +11:00
#include "../../debug.hpp"
#include "../../pointer.hpp"
#include "../../cast.hpp"
2015-11-13 17:17:37 +11:00
using util::alloc::raw::stack;
2015-11-13 17:17:37 +11:00
///////////////////////////////////////////////////////////////////////////////
stack::stack (void *begin, void *end):
m_begin (reinterpret_cast<char*> (begin)),
m_end (reinterpret_cast<char*> (end)),
m_cursor (reinterpret_cast<char*> (begin))
{
CHECK_LE (m_begin, m_end);
}
///////////////////////////////////////////////////////////////////////////////
union record {
using offset_t = uint32_t;
char *as_bytes;
offset_t *as_offset;
2015-11-13 17:17:37 +11:00
};
//-----------------------------------------------------------------------------
constexpr auto MIN_ALIGNMENT = sizeof (record::offset_t);
///////////////////////////////////////////////////////////////////////////////
void*
stack::allocate (size_t bytes)
{
return allocate (bytes, alignof (std::max_align_t));
}
//-----------------------------------------------------------------------------
void*
2015-11-13 17:17:37 +11:00
stack::allocate (size_t bytes, size_t alignment)
{
// reserve space at the front of the allocation to record the total
// allocation size so we can account for alignment if required.
auto ptr = m_cursor + sizeof (record::offset_t);
// align the outgoing pointer if required
alignment = util::max (MIN_ALIGNMENT, alignment);
2015-11-13 17:17:37 +11:00
ptr = align (ptr, alignment);
// ensure we haven't overrun our allocated segment
if (ptr + bytes > m_end)
throw std::bad_alloc ();
// use a 'record' struct as a window into the reserved space at the front
// of the allocation and store the offset to the previous allocation head
// (from the record struct). allows us to account for alignment.
2015-11-13 17:17:37 +11:00
record record;
record.as_bytes = ptr - sizeof (record::offset_t);
*record.as_offset = trunc_cast<uint32_t> (ptr - m_cursor);
2015-11-13 17:17:37 +11:00
m_cursor = ptr + bytes;
return ptr;
}
//-----------------------------------------------------------------------------
void
stack::deallocate (void *ptr, size_t bytes)
{
return deallocate (ptr, bytes, alignof (std::max_align_t));
}
2015-11-13 17:17:37 +11:00
//-----------------------------------------------------------------------------
void
stack::deallocate (void *_ptr, size_t bytes, size_t alignment)
{
(void)bytes;
alignment = util::max (MIN_ALIGNMENT, alignment);
auto ptr = reinterpret_cast<char*> (_ptr);
record record;
record.as_bytes = ptr - sizeof (record::offset_t);
//CHECK_LE (bytes, *record.as_offset);
CHECK_GE (m_cursor - *record.as_offset, m_begin);
2015-11-13 17:17:37 +11:00
m_cursor -= bytes;
m_cursor -= *record.as_offset;
2015-11-13 17:17:37 +11:00
}
2016-06-22 19:51:18 +10:00
//-----------------------------------------------------------------------------
void*
2017-08-31 13:48:33 +10:00
stack::begin (void)
2016-06-22 19:51:18 +10:00
{
return m_begin;
}
//-----------------------------------------------------------------------------
const void*
2017-08-31 13:48:33 +10:00
stack::begin (void) const
{
return m_begin;
}
2016-06-22 19:51:18 +10:00
//-----------------------------------------------------------------------------
size_t
stack::offset (const void *_ptr) const
{
auto ptr = reinterpret_cast<const char*> (_ptr);
CHECK_GE (ptr, m_begin);
return ptr - m_begin;
}
2015-11-13 17:17:37 +11:00
//-----------------------------------------------------------------------------
void
stack::reset (void)
{
m_cursor = m_begin;
}
///////////////////////////////////////////////////////////////////////////////
size_t
stack::capacity (void) const
{
return m_end - m_begin;
}
//-----------------------------------------------------------------------------
size_t
2015-11-30 16:08:07 +11:00
stack::used (void) const
{
return m_cursor - m_begin;
}
//-----------------------------------------------------------------------------
size_t
stack::remain (void) const
{
2015-11-30 16:08:07 +11:00
return capacity () - used ();
}