/*
 * 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 Danny Robson <danny@nerdcruft.net>
 */

#ifndef CRUFT_UTIL_ALLOC_RAW_LINEAR_HPP
#define CRUFT_UTIL_ALLOC_RAW_LINEAR_HPP

#include "../../view.hpp"
#include "../../pointer.hpp"

#include <cstddef>
#include <iterator>

namespace util::alloc::raw {
    // allocate progressively across a buffer without concern for deallocation.
    // deallocation is a noop; the only way to free allocations is via reset.
    class linear {
    public:
        linear (const linear&) = delete;
        linear (linear&&) = delete;
        linear& operator= (const linear&) = delete;
        linear& operator= (linear&&) = delete;

        linear (util::view<std::byte*> _data);

        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);

            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;
        }

        std::byte* data (void);
        std::byte* begin (void);
        std::byte* end (void);
        std::byte* cursor (void);

        const std::byte* data (void) const;
        const std::byte* begin (void) const;
        const std::byte* end (void) const;
        const std::byte* cursor (void) const;

        size_t offset (const void*) const;

        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 ());
        }

        template <typename T>
        size_t
        offset (util::view<T*> ptr) const
        {
            return offset (ptr.data ());
        }

        void reset (void);

        size_t capacity (void) const;
        size_t used     (void) const;
        size_t remain   (void) const;

    protected:
        std::byte *const m_begin;
        std::byte *const m_end;
        std::byte *m_cursor;
    };
}

#endif