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>
|
|
|
|
*/
|
|
|
|
|
2017-08-29 16:53:11 +10:00
|
|
|
#ifndef CRUFT_UTIL_ALLOC_RAW_LINEAR_HPP
|
|
|
|
#define CRUFT_UTIL_ALLOC_RAW_LINEAR_HPP
|
2015-11-13 17:17:37 +11:00
|
|
|
|
2018-03-02 12:18:20 +11:00
|
|
|
#include "../../view.hpp"
|
2018-05-10 13:53:06 +10:00
|
|
|
#include "../../pointer.hpp"
|
2018-03-02 12:18:20 +11:00
|
|
|
|
2015-11-13 17:17:37 +11:00
|
|
|
#include <cstddef>
|
2017-08-30 15:13:43 +10:00
|
|
|
#include <iterator>
|
2015-11-13 17:17:37 +11:00
|
|
|
|
2017-08-29 16:53:11 +10:00
|
|
|
namespace util::alloc::raw {
|
2015-11-19 15:03:57 +11:00
|
|
|
// allocate progressively across a buffer without concern for deallocation.
|
|
|
|
// deallocation is a noop; the only way to free allocations is via reset.
|
2015-11-13 17:17:37 +11:00
|
|
|
class linear {
|
|
|
|
public:
|
|
|
|
linear (const linear&) = delete;
|
|
|
|
linear (linear&&) = delete;
|
|
|
|
linear& operator= (const linear&) = delete;
|
|
|
|
linear& operator= (linear&&) = delete;
|
|
|
|
|
2018-03-02 12:18:20 +11:00
|
|
|
linear (util::view<std::byte*> _data);
|
2017-08-30 15:13:43 +10:00
|
|
|
|
2018-05-10 13:53:06 +10:00
|
|
|
template <typename T>
|
|
|
|
util::view<T*>
|
|
|
|
allocate (size_t count)
|
|
|
|
{
|
|
|
|
auto const bytes = count * sizeof (T);
|
|
|
|
if (m_cursor + bytes > m_end)
|
|
|
|
throw std::bad_alloc ();
|
|
|
|
|
|
|
|
auto ptr = m_cursor;
|
|
|
|
m_cursor += bytes;
|
|
|
|
return { util::cast::alignment<T*> (ptr), count };
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template <typename T>
|
|
|
|
util::view<T*>
|
|
|
|
allocate (size_t count, size_t alignment)
|
|
|
|
{
|
|
|
|
auto const bytes = count * sizeof (T);
|
2016-10-10 20:59:26 +11:00
|
|
|
|
2018-05-10 13:53:06 +10:00
|
|
|
auto ptr = util::align (m_cursor, alignment);
|
|
|
|
if (ptr + bytes > m_end)
|
|
|
|
throw std::bad_alloc ();
|
|
|
|
|
|
|
|
m_cursor = ptr + bytes;
|
|
|
|
|
|
|
|
return { util::cast::alignment<T*> (ptr), count };
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T>
|
|
|
|
void deallocate (util::view<T*> ptr)
|
|
|
|
{
|
|
|
|
(void)ptr;
|
|
|
|
}
|
2016-10-10 20:59:26 +11:00
|
|
|
|
2018-02-28 17:55:56 +11:00
|
|
|
std::byte* data (void);
|
|
|
|
std::byte* begin (void);
|
|
|
|
std::byte* end (void);
|
|
|
|
std::byte* cursor (void);
|
2017-08-31 13:48:33 +10:00
|
|
|
|
2018-02-28 17:55:56 +11:00
|
|
|
const std::byte* data (void) const;
|
|
|
|
const std::byte* begin (void) const;
|
|
|
|
const std::byte* end (void) const;
|
|
|
|
const std::byte* cursor (void) const;
|
2017-08-31 13:48:33 +10:00
|
|
|
|
2016-06-22 19:51:18 +10:00
|
|
|
size_t offset (const void*) const;
|
2015-11-13 17:17:37 +11:00
|
|
|
|
2018-05-18 16:51:42 +10:00
|
|
|
template <typename ValueT>
|
|
|
|
size_t
|
|
|
|
offset (ValueT const *ptr) const
|
|
|
|
{
|
|
|
|
CHECK_MOD (reinterpret_cast<uintptr_t> (ptr), sizeof (ValueT));
|
|
|
|
CHECK_MOD (reinterpret_cast<uintptr_t> (data ()), sizeof (ValueT));
|
|
|
|
|
|
|
|
return ptr - util::cast::alignment<ValueT const*> (data ());
|
|
|
|
}
|
|
|
|
|
2018-04-20 15:04:12 +10:00
|
|
|
template <typename T>
|
|
|
|
size_t
|
|
|
|
offset (util::view<T*> ptr) const
|
|
|
|
{
|
|
|
|
return offset (ptr.data ());
|
|
|
|
}
|
|
|
|
|
2015-11-13 17:17:37 +11:00
|
|
|
void reset (void);
|
|
|
|
|
|
|
|
size_t capacity (void) const;
|
2015-11-30 16:08:07 +11:00
|
|
|
size_t used (void) const;
|
2015-11-24 16:48:46 +11:00
|
|
|
size_t remain (void) const;
|
2015-11-13 17:17:37 +11:00
|
|
|
|
|
|
|
protected:
|
2018-02-28 17:55:56 +11:00
|
|
|
std::byte *const m_begin;
|
|
|
|
std::byte *const m_end;
|
|
|
|
std::byte *m_cursor;
|
2015-11-13 17:17:37 +11:00
|
|
|
};
|
2016-10-10 17:58:59 +11:00
|
|
|
}
|
2015-11-13 17:17:37 +11:00
|
|
|
|
|
|
|
#endif
|